Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/concurrentMarkSweep/concurrentMarkSweepGeneration.cpp @ 11156:060ae9b7ffea
8020547: Event based tracing needs a UNICODE string type
Reviewed-by: egahlin, rbackman, dcubed, brutisso, acorn
| author | mgronlun |
|---|---|
| date | Fri, 19 Jul 2013 17:56:27 +0200 |
| parents | 71180a6e5080 |
| children | 7b06ae405d7b |
| rev | line source |
|---|---|
| 0 | 1 /* |
|
7623
203f64878aab
7102489: RFE: cleanup jlong typedef on __APPLE__and _LLP64 systems.
hseigel
parents:
6885
diff
changeset
|
2 * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved. |
| 0 | 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:
1521
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1521
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:
1521
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #include "precompiled.hpp" |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
26 #include "classfile/classLoaderData.hpp" |
| 1972 | 27 #include "classfile/symbolTable.hpp" |
| 28 #include "classfile/systemDictionary.hpp" | |
| 29 #include "code/codeCache.hpp" | |
| 30 #include "gc_implementation/concurrentMarkSweep/cmsAdaptiveSizePolicy.hpp" | |
| 31 #include "gc_implementation/concurrentMarkSweep/cmsCollectorPolicy.hpp" | |
| 32 #include "gc_implementation/concurrentMarkSweep/cmsGCAdaptivePolicyCounters.hpp" | |
| 33 #include "gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp" | |
| 34 #include "gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp" | |
| 35 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepGeneration.inline.hpp" | |
| 36 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepThread.hpp" | |
| 37 #include "gc_implementation/concurrentMarkSweep/vmCMSOperations.hpp" | |
| 38 #include "gc_implementation/parNew/parNewGeneration.hpp" | |
| 39 #include "gc_implementation/shared/collectorCounters.hpp" | |
| 10405 | 40 #include "gc_implementation/shared/gcTimer.hpp" |
| 41 #include "gc_implementation/shared/gcTrace.hpp" | |
| 42 #include "gc_implementation/shared/gcTraceTime.hpp" | |
| 1972 | 43 #include "gc_implementation/shared/isGCActiveMark.hpp" |
| 44 #include "gc_interface/collectedHeap.inline.hpp" | |
| 10405 | 45 #include "memory/allocation.hpp" |
| 1972 | 46 #include "memory/cardTableRS.hpp" |
| 47 #include "memory/collectorPolicy.hpp" | |
| 48 #include "memory/gcLocker.inline.hpp" | |
| 49 #include "memory/genCollectedHeap.hpp" | |
| 50 #include "memory/genMarkSweep.hpp" | |
| 51 #include "memory/genOopClosures.inline.hpp" | |
| 52 #include "memory/iterator.hpp" | |
| 53 #include "memory/referencePolicy.hpp" | |
| 54 #include "memory/resourceArea.hpp" | |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
55 #include "memory/tenuredGeneration.hpp" |
| 1972 | 56 #include "oops/oop.inline.hpp" |
| 57 #include "prims/jvmtiExport.hpp" | |
| 58 #include "runtime/globals_extension.hpp" | |
| 59 #include "runtime/handles.inline.hpp" | |
| 60 #include "runtime/java.hpp" | |
| 61 #include "runtime/vmThread.hpp" | |
| 62 #include "services/memoryService.hpp" | |
| 63 #include "services/runtimeService.hpp" | |
| 0 | 64 |
| 65 // statics | |
| 66 CMSCollector* ConcurrentMarkSweepGeneration::_collector = NULL; | |
| 10405 | 67 bool CMSCollector::_full_gc_requested = false; |
| 68 GCCause::Cause CMSCollector::_full_gc_cause = GCCause::_no_gc; | |
| 0 | 69 |
| 70 ////////////////////////////////////////////////////////////////// | |
| 71 // In support of CMS/VM thread synchronization | |
| 72 ////////////////////////////////////////////////////////////////// | |
| 73 // We split use of the CGC_lock into 2 "levels". | |
| 74 // The low-level locking is of the usual CGC_lock monitor. We introduce | |
| 75 // a higher level "token" (hereafter "CMS token") built on top of the | |
| 76 // low level monitor (hereafter "CGC lock"). | |
| 77 // The token-passing protocol gives priority to the VM thread. The | |
| 78 // CMS-lock doesn't provide any fairness guarantees, but clients | |
| 79 // should ensure that it is only held for very short, bounded | |
| 80 // durations. | |
| 81 // | |
| 82 // When either of the CMS thread or the VM thread is involved in | |
| 83 // collection operations during which it does not want the other | |
| 84 // thread to interfere, it obtains the CMS token. | |
| 85 // | |
| 86 // If either thread tries to get the token while the other has | |
| 87 // it, that thread waits. However, if the VM thread and CMS thread | |
| 88 // both want the token, then the VM thread gets priority while the | |
| 89 // CMS thread waits. This ensures, for instance, that the "concurrent" | |
| 90 // phases of the CMS thread's work do not block out the VM thread | |
| 91 // for long periods of time as the CMS thread continues to hog | |
| 92 // the token. (See bug 4616232). | |
| 93 // | |
| 94 // The baton-passing functions are, however, controlled by the | |
| 95 // flags _foregroundGCShouldWait and _foregroundGCIsActive, | |
| 96 // and here the low-level CMS lock, not the high level token, | |
| 97 // ensures mutual exclusion. | |
| 98 // | |
| 99 // Two important conditions that we have to satisfy: | |
| 100 // 1. if a thread does a low-level wait on the CMS lock, then it | |
| 101 // relinquishes the CMS token if it were holding that token | |
| 102 // when it acquired the low-level CMS lock. | |
| 103 // 2. any low-level notifications on the low-level lock | |
| 104 // should only be sent when a thread has relinquished the token. | |
| 105 // | |
| 106 // In the absence of either property, we'd have potential deadlock. | |
| 107 // | |
| 108 // We protect each of the CMS (concurrent and sequential) phases | |
| 109 // with the CMS _token_, not the CMS _lock_. | |
| 110 // | |
| 111 // The only code protected by CMS lock is the token acquisition code | |
| 112 // itself, see ConcurrentMarkSweepThread::[de]synchronize(), and the | |
| 113 // baton-passing code. | |
| 114 // | |
| 115 // Unfortunately, i couldn't come up with a good abstraction to factor and | |
| 116 // hide the naked CGC_lock manipulation in the baton-passing code | |
| 117 // further below. That's something we should try to do. Also, the proof | |
| 118 // of correctness of this 2-level locking scheme is far from obvious, | |
| 119 // and potentially quite slippery. We have an uneasy supsicion, for instance, | |
| 120 // that there may be a theoretical possibility of delay/starvation in the | |
| 121 // low-level lock/wait/notify scheme used for the baton-passing because of | |
| 122 // potential intereference with the priority scheme embodied in the | |
| 123 // CMS-token-passing protocol. See related comments at a CGC_lock->wait() | |
| 124 // invocation further below and marked with "XXX 20011219YSR". | |
| 125 // Indeed, as we note elsewhere, this may become yet more slippery | |
| 126 // in the presence of multiple CMS and/or multiple VM threads. XXX | |
| 127 | |
| 128 class CMSTokenSync: public StackObj { | |
| 129 private: | |
| 130 bool _is_cms_thread; | |
| 131 public: | |
| 132 CMSTokenSync(bool is_cms_thread): | |
| 133 _is_cms_thread(is_cms_thread) { | |
| 134 assert(is_cms_thread == Thread::current()->is_ConcurrentGC_thread(), | |
| 135 "Incorrect argument to constructor"); | |
| 136 ConcurrentMarkSweepThread::synchronize(_is_cms_thread); | |
| 137 } | |
| 138 | |
| 139 ~CMSTokenSync() { | |
| 140 assert(_is_cms_thread ? | |
| 141 ConcurrentMarkSweepThread::cms_thread_has_cms_token() : | |
| 142 ConcurrentMarkSweepThread::vm_thread_has_cms_token(), | |
| 143 "Incorrect state"); | |
| 144 ConcurrentMarkSweepThread::desynchronize(_is_cms_thread); | |
| 145 } | |
| 146 }; | |
| 147 | |
| 148 // Convenience class that does a CMSTokenSync, and then acquires | |
| 149 // upto three locks. | |
| 150 class CMSTokenSyncWithLocks: public CMSTokenSync { | |
| 151 private: | |
| 152 // Note: locks are acquired in textual declaration order | |
| 153 // and released in the opposite order | |
| 154 MutexLockerEx _locker1, _locker2, _locker3; | |
| 155 public: | |
| 156 CMSTokenSyncWithLocks(bool is_cms_thread, Mutex* mutex1, | |
| 157 Mutex* mutex2 = NULL, Mutex* mutex3 = NULL): | |
| 158 CMSTokenSync(is_cms_thread), | |
| 159 _locker1(mutex1, Mutex::_no_safepoint_check_flag), | |
| 160 _locker2(mutex2, Mutex::_no_safepoint_check_flag), | |
| 161 _locker3(mutex3, Mutex::_no_safepoint_check_flag) | |
| 162 { } | |
| 163 }; | |
| 164 | |
| 165 | |
| 166 // Wrapper class to temporarily disable icms during a foreground cms collection. | |
| 167 class ICMSDisabler: public StackObj { | |
| 168 public: | |
| 169 // The ctor disables icms and wakes up the thread so it notices the change; | |
| 170 // the dtor re-enables icms. Note that the CMSCollector methods will check | |
| 171 // CMSIncrementalMode. | |
| 172 ICMSDisabler() { CMSCollector::disable_icms(); CMSCollector::start_icms(); } | |
| 173 ~ICMSDisabler() { CMSCollector::enable_icms(); } | |
| 174 }; | |
| 175 | |
| 176 ////////////////////////////////////////////////////////////////// | |
| 177 // Concurrent Mark-Sweep Generation ///////////////////////////// | |
| 178 ////////////////////////////////////////////////////////////////// | |
| 179 | |
| 180 NOT_PRODUCT(CompactibleFreeListSpace* debug_cms_space;) | |
| 181 | |
| 182 // This struct contains per-thread things necessary to support parallel | |
| 183 // young-gen collection. | |
| 6197 | 184 class CMSParGCThreadState: public CHeapObj<mtGC> { |
| 0 | 185 public: |
| 186 CFLS_LAB lab; | |
| 187 PromotionInfo promo; | |
| 188 | |
| 189 // Constructor. | |
| 190 CMSParGCThreadState(CompactibleFreeListSpace* cfls) : lab(cfls) { | |
| 191 promo.setSpace(cfls); | |
| 192 } | |
| 193 }; | |
| 194 | |
| 195 ConcurrentMarkSweepGeneration::ConcurrentMarkSweepGeneration( | |
| 196 ReservedSpace rs, size_t initial_byte_size, int level, | |
| 197 CardTableRS* ct, bool use_adaptive_freelists, | |
| 6026 | 198 FreeBlockDictionary<FreeChunk>::DictionaryChoice dictionaryChoice) : |
| 0 | 199 CardGeneration(rs, initial_byte_size, level, ct), |
|
1571
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
200 _dilatation_factor(((double)MinChunkSize)/((double)(CollectedHeap::min_fill_size()))), |
|
10244
06ab37f08701
8013184: CMS: Call reset_after_compaction() only if a compaction has been done
jmasa
parents:
10243
diff
changeset
|
201 _debug_collection_type(Concurrent_collection_type), |
|
06ab37f08701
8013184: CMS: Call reset_after_compaction() only if a compaction has been done
jmasa
parents:
10243
diff
changeset
|
202 _did_compact(false) |
| 0 | 203 { |
| 204 HeapWord* bottom = (HeapWord*) _virtual_space.low(); | |
| 205 HeapWord* end = (HeapWord*) _virtual_space.high(); | |
| 206 | |
| 207 _direct_allocated_words = 0; | |
| 208 NOT_PRODUCT( | |
| 209 _numObjectsPromoted = 0; | |
| 210 _numWordsPromoted = 0; | |
| 211 _numObjectsAllocated = 0; | |
| 212 _numWordsAllocated = 0; | |
| 213 ) | |
| 214 | |
| 215 _cmsSpace = new CompactibleFreeListSpace(_bts, MemRegion(bottom, end), | |
| 216 use_adaptive_freelists, | |
| 217 dictionaryChoice); | |
| 218 NOT_PRODUCT(debug_cms_space = _cmsSpace;) | |
| 219 if (_cmsSpace == NULL) { | |
| 220 vm_exit_during_initialization( | |
| 221 "CompactibleFreeListSpace allocation failure"); | |
| 222 } | |
| 223 _cmsSpace->_gen = this; | |
| 224 | |
| 225 _gc_stats = new CMSGCStats(); | |
| 226 | |
| 227 // Verify the assumption that FreeChunk::_prev and OopDesc::_klass | |
| 228 // offsets match. The ability to tell free chunks from objects | |
| 229 // depends on this property. | |
| 230 debug_only( | |
| 231 FreeChunk* junk = NULL; | |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6787
diff
changeset
|
232 assert(UseCompressedKlassPointers || |
| 187 | 233 junk->prev_addr() == (void*)(oop(junk)->klass_addr()), |
| 0 | 234 "Offset of FreeChunk::_prev within FreeChunk must match" |
| 235 " that of OopDesc::_klass within OopDesc"); | |
| 236 ) | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
237 if (CollectedHeap::use_parallel_gc_threads()) { |
| 0 | 238 typedef CMSParGCThreadState* CMSParGCThreadStatePtr; |
| 239 _par_gc_thread_states = | |
| 6197 | 240 NEW_C_HEAP_ARRAY(CMSParGCThreadStatePtr, ParallelGCThreads, mtGC); |
| 0 | 241 if (_par_gc_thread_states == NULL) { |
| 242 vm_exit_during_initialization("Could not allocate par gc structs"); | |
| 243 } | |
| 244 for (uint i = 0; i < ParallelGCThreads; i++) { | |
| 245 _par_gc_thread_states[i] = new CMSParGCThreadState(cmsSpace()); | |
| 246 if (_par_gc_thread_states[i] == NULL) { | |
| 247 vm_exit_during_initialization("Could not allocate par gc structs"); | |
| 248 } | |
| 249 } | |
| 250 } else { | |
| 251 _par_gc_thread_states = NULL; | |
| 252 } | |
| 253 _incremental_collection_failed = false; | |
| 254 // The "dilatation_factor" is the expansion that can occur on | |
| 255 // account of the fact that the minimum object size in the CMS | |
| 256 // generation may be larger than that in, say, a contiguous young | |
| 257 // generation. | |
| 258 // Ideally, in the calculation below, we'd compute the dilatation | |
| 259 // factor as: MinChunkSize/(promoting_gen's min object size) | |
| 260 // Since we do not have such a general query interface for the | |
| 261 // promoting generation, we'll instead just use the mimimum | |
| 262 // object size (which today is a header's worth of space); | |
| 263 // note that all arithmetic is in units of HeapWords. | |
|
1571
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
264 assert(MinChunkSize >= CollectedHeap::min_fill_size(), "just checking"); |
| 0 | 265 assert(_dilatation_factor >= 1.0, "from previous assert"); |
| 266 } | |
| 267 | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
268 |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
269 // The field "_initiating_occupancy" represents the occupancy percentage |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
270 // at which we trigger a new collection cycle. Unless explicitly specified |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
271 // via CMSInitiatingOccupancyFraction (argument "io" below), it |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
272 // is calculated by: |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
273 // |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
274 // Let "f" be MinHeapFreeRatio in |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
275 // |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
276 // _intiating_occupancy = 100-f + |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
277 // f * (CMSTriggerRatio/100) |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
278 // where CMSTriggerRatio is the argument "tr" below. |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
279 // |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
280 // That is, if we assume the heap is at its desired maximum occupancy at the |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
281 // end of a collection, we let CMSTriggerRatio of the (purported) free |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
282 // space be allocated before initiating a new collection cycle. |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
283 // |
| 8035 | 284 void ConcurrentMarkSweepGeneration::init_initiating_occupancy(intx io, uintx tr) { |
| 285 assert(io <= 100 && tr <= 100, "Check the arguments"); | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
286 if (io >= 0) { |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
287 _initiating_occupancy = (double)io / 100.0; |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
288 } else { |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
289 _initiating_occupancy = ((100 - MinHeapFreeRatio) + |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
290 (double)(tr * MinHeapFreeRatio) / 100.0) |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
291 / 100.0; |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
292 } |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
293 } |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
294 |
| 0 | 295 void ConcurrentMarkSweepGeneration::ref_processor_init() { |
| 296 assert(collector() != NULL, "no collector"); | |
| 297 collector()->ref_processor_init(); | |
| 298 } | |
| 299 | |
| 300 void CMSCollector::ref_processor_init() { | |
| 301 if (_ref_processor == NULL) { | |
| 302 // Allocate and initialize a reference processor | |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
303 _ref_processor = |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
304 new ReferenceProcessor(_span, // span |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
305 (ParallelGCThreads > 1) && ParallelRefProcEnabled, // mt processing |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
306 (int) ParallelGCThreads, // mt processing degree |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
307 _cmsGen->refs_discovery_is_mt(), // mt discovery |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
308 (int) MAX2(ConcGCThreads, ParallelGCThreads), // mt discovery degree |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
309 _cmsGen->refs_discovery_is_atomic(), // discovery is not atomic |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
310 &_is_alive_closure, // closure for liveness info |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
311 false); // next field updates do not need write barrier |
| 0 | 312 // Initialize the _ref_processor field of CMSGen |
| 313 _cmsGen->set_ref_processor(_ref_processor); | |
| 314 | |
| 315 } | |
| 316 } | |
| 317 | |
| 318 CMSAdaptiveSizePolicy* CMSCollector::size_policy() { | |
| 319 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 320 assert(gch->kind() == CollectedHeap::GenCollectedHeap, | |
| 321 "Wrong type of heap"); | |
| 322 CMSAdaptiveSizePolicy* sp = (CMSAdaptiveSizePolicy*) | |
| 323 gch->gen_policy()->size_policy(); | |
| 324 assert(sp->is_gc_cms_adaptive_size_policy(), | |
| 325 "Wrong type of size policy"); | |
| 326 return sp; | |
| 327 } | |
| 328 | |
| 329 CMSGCAdaptivePolicyCounters* CMSCollector::gc_adaptive_policy_counters() { | |
| 330 CMSGCAdaptivePolicyCounters* results = | |
| 331 (CMSGCAdaptivePolicyCounters*) collector_policy()->counters(); | |
| 332 assert( | |
| 333 results->kind() == GCPolicyCounters::CMSGCAdaptivePolicyCountersKind, | |
| 334 "Wrong gc policy counter kind"); | |
| 335 return results; | |
| 336 } | |
| 337 | |
| 338 | |
| 339 void ConcurrentMarkSweepGeneration::initialize_performance_counters() { | |
| 340 | |
| 341 const char* gen_name = "old"; | |
| 342 | |
| 343 // Generation Counters - generation 1, 1 subspace | |
| 344 _gen_counters = new GenerationCounters(gen_name, 1, 1, &_virtual_space); | |
| 345 | |
| 346 _space_counters = new GSpaceCounters(gen_name, 0, | |
| 347 _virtual_space.reserved_size(), | |
| 348 this, _gen_counters); | |
| 349 } | |
| 350 | |
| 351 CMSStats::CMSStats(ConcurrentMarkSweepGeneration* cms_gen, unsigned int alpha): | |
| 352 _cms_gen(cms_gen) | |
| 353 { | |
| 354 assert(alpha <= 100, "bad value"); | |
| 355 _saved_alpha = alpha; | |
| 356 | |
| 357 // Initialize the alphas to the bootstrap value of 100. | |
| 358 _gc0_alpha = _cms_alpha = 100; | |
| 359 | |
| 360 _cms_begin_time.update(); | |
| 361 _cms_end_time.update(); | |
| 362 | |
| 363 _gc0_duration = 0.0; | |
| 364 _gc0_period = 0.0; | |
| 365 _gc0_promoted = 0; | |
| 366 | |
| 367 _cms_duration = 0.0; | |
| 368 _cms_period = 0.0; | |
| 369 _cms_allocated = 0; | |
| 370 | |
| 371 _cms_used_at_gc0_begin = 0; | |
| 372 _cms_used_at_gc0_end = 0; | |
| 373 _allow_duty_cycle_reduction = false; | |
| 374 _valid_bits = 0; | |
| 375 _icms_duty_cycle = CMSIncrementalDutyCycle; | |
| 376 } | |
| 377 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
378 double CMSStats::cms_free_adjustment_factor(size_t free) const { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
379 // TBD: CR 6909490 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
380 return 1.0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
381 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
382 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
383 void CMSStats::adjust_cms_free_adjustment_factor(bool fail, size_t free) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
384 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
385 |
| 0 | 386 // If promotion failure handling is on use |
| 387 // the padded average size of the promotion for each | |
| 388 // young generation collection. | |
| 389 double CMSStats::time_until_cms_gen_full() const { | |
| 390 size_t cms_free = _cms_gen->cmsSpace()->free(); | |
| 391 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
|
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
392 size_t expected_promotion = MIN2(gch->get_gen(0)->capacity(), |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
393 (size_t) _cms_gen->gc_stats()->avg_promoted()->padded_average()); |
| 0 | 394 if (cms_free > expected_promotion) { |
| 395 // Start a cms collection if there isn't enough space to promote | |
| 396 // for the next minor collection. Use the padded average as | |
| 397 // a safety factor. | |
| 398 cms_free -= expected_promotion; | |
| 399 | |
| 400 // Adjust by the safety factor. | |
| 401 double cms_free_dbl = (double)cms_free; | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
402 double cms_adjustment = (100.0 - CMSIncrementalSafetyFactor)/100.0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
403 // Apply a further correction factor which tries to adjust |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
404 // for recent occurance of concurrent mode failures. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
405 cms_adjustment = cms_adjustment * cms_free_adjustment_factor(cms_free); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
406 cms_free_dbl = cms_free_dbl * cms_adjustment; |
| 0 | 407 |
| 408 if (PrintGCDetails && Verbose) { | |
| 409 gclog_or_tty->print_cr("CMSStats::time_until_cms_gen_full: cms_free " | |
| 410 SIZE_FORMAT " expected_promotion " SIZE_FORMAT, | |
| 411 cms_free, expected_promotion); | |
| 412 gclog_or_tty->print_cr(" cms_free_dbl %f cms_consumption_rate %f", | |
| 413 cms_free_dbl, cms_consumption_rate() + 1.0); | |
| 414 } | |
| 415 // Add 1 in case the consumption rate goes to zero. | |
| 416 return cms_free_dbl / (cms_consumption_rate() + 1.0); | |
| 417 } | |
| 418 return 0.0; | |
| 419 } | |
| 420 | |
| 421 // Compare the duration of the cms collection to the | |
| 422 // time remaining before the cms generation is empty. | |
| 423 // Note that the time from the start of the cms collection | |
| 424 // to the start of the cms sweep (less than the total | |
| 425 // duration of the cms collection) can be used. This | |
| 426 // has been tried and some applications experienced | |
| 427 // promotion failures early in execution. This was | |
| 428 // possibly because the averages were not accurate | |
| 429 // enough at the beginning. | |
| 430 double CMSStats::time_until_cms_start() const { | |
| 431 // We add "gc0_period" to the "work" calculation | |
| 432 // below because this query is done (mostly) at the | |
| 433 // end of a scavenge, so we need to conservatively | |
| 434 // account for that much possible delay | |
| 435 // in the query so as to avoid concurrent mode failures | |
| 436 // due to starting the collection just a wee bit too | |
| 437 // late. | |
| 438 double work = cms_duration() + gc0_period(); | |
| 439 double deadline = time_until_cms_gen_full(); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
440 // If a concurrent mode failure occurred recently, we want to be |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
441 // more conservative and halve our expected time_until_cms_gen_full() |
| 0 | 442 if (work > deadline) { |
| 443 if (Verbose && PrintGCDetails) { | |
| 444 gclog_or_tty->print( | |
| 445 " CMSCollector: collect because of anticipated promotion " | |
| 446 "before full %3.7f + %3.7f > %3.7f ", cms_duration(), | |
| 447 gc0_period(), time_until_cms_gen_full()); | |
| 448 } | |
| 449 return 0.0; | |
| 450 } | |
| 451 return work - deadline; | |
| 452 } | |
| 453 | |
| 454 // Return a duty cycle based on old_duty_cycle and new_duty_cycle, limiting the | |
| 455 // amount of change to prevent wild oscillation. | |
| 456 unsigned int CMSStats::icms_damped_duty_cycle(unsigned int old_duty_cycle, | |
| 457 unsigned int new_duty_cycle) { | |
| 458 assert(old_duty_cycle <= 100, "bad input value"); | |
| 459 assert(new_duty_cycle <= 100, "bad input value"); | |
| 460 | |
| 461 // Note: use subtraction with caution since it may underflow (values are | |
| 462 // unsigned). Addition is safe since we're in the range 0-100. | |
| 463 unsigned int damped_duty_cycle = new_duty_cycle; | |
| 464 if (new_duty_cycle < old_duty_cycle) { | |
| 465 const unsigned int largest_delta = MAX2(old_duty_cycle / 4, 5U); | |
| 466 if (new_duty_cycle + largest_delta < old_duty_cycle) { | |
| 467 damped_duty_cycle = old_duty_cycle - largest_delta; | |
| 468 } | |
| 469 } else if (new_duty_cycle > old_duty_cycle) { | |
| 470 const unsigned int largest_delta = MAX2(old_duty_cycle / 4, 15U); | |
| 471 if (new_duty_cycle > old_duty_cycle + largest_delta) { | |
| 472 damped_duty_cycle = MIN2(old_duty_cycle + largest_delta, 100U); | |
| 473 } | |
| 474 } | |
| 475 assert(damped_duty_cycle <= 100, "invalid duty cycle computed"); | |
| 476 | |
| 477 if (CMSTraceIncrementalPacing) { | |
| 478 gclog_or_tty->print(" [icms_damped_duty_cycle(%d,%d) = %d] ", | |
| 479 old_duty_cycle, new_duty_cycle, damped_duty_cycle); | |
| 480 } | |
| 481 return damped_duty_cycle; | |
| 482 } | |
| 483 | |
| 484 unsigned int CMSStats::icms_update_duty_cycle_impl() { | |
| 485 assert(CMSIncrementalPacing && valid(), | |
| 486 "should be handled in icms_update_duty_cycle()"); | |
| 487 | |
| 488 double cms_time_so_far = cms_timer().seconds(); | |
| 489 double scaled_duration = cms_duration_per_mb() * _cms_used_at_gc0_end / M; | |
| 490 double scaled_duration_remaining = fabsd(scaled_duration - cms_time_so_far); | |
| 491 | |
| 492 // Avoid division by 0. | |
| 493 double time_until_full = MAX2(time_until_cms_gen_full(), 0.01); | |
| 494 double duty_cycle_dbl = 100.0 * scaled_duration_remaining / time_until_full; | |
| 495 | |
| 496 unsigned int new_duty_cycle = MIN2((unsigned int)duty_cycle_dbl, 100U); | |
| 497 if (new_duty_cycle > _icms_duty_cycle) { | |
| 498 // Avoid very small duty cycles (1 or 2); 0 is allowed. | |
| 499 if (new_duty_cycle > 2) { | |
| 500 _icms_duty_cycle = icms_damped_duty_cycle(_icms_duty_cycle, | |
| 501 new_duty_cycle); | |
| 502 } | |
| 503 } else if (_allow_duty_cycle_reduction) { | |
| 504 // The duty cycle is reduced only once per cms cycle (see record_cms_end()). | |
| 505 new_duty_cycle = icms_damped_duty_cycle(_icms_duty_cycle, new_duty_cycle); | |
| 506 // Respect the minimum duty cycle. | |
| 507 unsigned int min_duty_cycle = (unsigned int)CMSIncrementalDutyCycleMin; | |
| 508 _icms_duty_cycle = MAX2(new_duty_cycle, min_duty_cycle); | |
| 509 } | |
| 510 | |
| 511 if (PrintGCDetails || CMSTraceIncrementalPacing) { | |
| 512 gclog_or_tty->print(" icms_dc=%d ", _icms_duty_cycle); | |
| 513 } | |
| 514 | |
| 515 _allow_duty_cycle_reduction = false; | |
| 516 return _icms_duty_cycle; | |
| 517 } | |
| 518 | |
| 519 #ifndef PRODUCT | |
| 520 void CMSStats::print_on(outputStream *st) const { | |
| 521 st->print(" gc0_alpha=%d,cms_alpha=%d", _gc0_alpha, _cms_alpha); | |
| 522 st->print(",gc0_dur=%g,gc0_per=%g,gc0_promo=" SIZE_FORMAT, | |
| 523 gc0_duration(), gc0_period(), gc0_promoted()); | |
| 524 st->print(",cms_dur=%g,cms_dur_per_mb=%g,cms_per=%g,cms_alloc=" SIZE_FORMAT, | |
| 525 cms_duration(), cms_duration_per_mb(), | |
| 526 cms_period(), cms_allocated()); | |
| 527 st->print(",cms_since_beg=%g,cms_since_end=%g", | |
| 528 cms_time_since_begin(), cms_time_since_end()); | |
| 529 st->print(",cms_used_beg=" SIZE_FORMAT ",cms_used_end=" SIZE_FORMAT, | |
| 530 _cms_used_at_gc0_begin, _cms_used_at_gc0_end); | |
| 531 if (CMSIncrementalMode) { | |
| 532 st->print(",dc=%d", icms_duty_cycle()); | |
| 533 } | |
| 534 | |
| 535 if (valid()) { | |
| 536 st->print(",promo_rate=%g,cms_alloc_rate=%g", | |
| 537 promotion_rate(), cms_allocation_rate()); | |
| 538 st->print(",cms_consumption_rate=%g,time_until_full=%g", | |
| 539 cms_consumption_rate(), time_until_cms_gen_full()); | |
| 540 } | |
| 541 st->print(" "); | |
| 542 } | |
| 543 #endif // #ifndef PRODUCT | |
| 544 | |
| 545 CMSCollector::CollectorState CMSCollector::_collectorState = | |
| 546 CMSCollector::Idling; | |
| 547 bool CMSCollector::_foregroundGCIsActive = false; | |
| 548 bool CMSCollector::_foregroundGCShouldWait = false; | |
| 549 | |
| 550 CMSCollector::CMSCollector(ConcurrentMarkSweepGeneration* cmsGen, | |
| 551 CardTableRS* ct, | |
| 552 ConcurrentMarkSweepPolicy* cp): | |
| 553 _cmsGen(cmsGen), | |
| 554 _ct(ct), | |
| 555 _ref_processor(NULL), // will be set later | |
| 556 _conc_workers(NULL), // may be set later | |
| 557 _abort_preclean(false), | |
| 558 _start_sampling(false), | |
| 559 _between_prologue_and_epilogue(false), | |
| 560 _markBitMap(0, Mutex::leaf + 1, "CMS_markBitMap_lock"), | |
| 561 _modUnionTable((CardTableModRefBS::card_shift - LogHeapWordSize), | |
| 562 -1 /* lock-free */, "No_lock" /* dummy */), | |
| 563 _modUnionClosure(&_modUnionTable), | |
| 564 _modUnionClosurePar(&_modUnionTable), | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
565 // Adjust my span to cover old (cms) gen |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
566 _span(cmsGen->reserved()), |
|
143
b5489bb705c9
6662086: 6u4+, 7b11+: CMS never clears referents when -XX:+ParallelRefProcEnabled
ysr
parents:
113
diff
changeset
|
567 // Construct the is_alive_closure with _span & markBitMap |
|
b5489bb705c9
6662086: 6u4+, 7b11+: CMS never clears referents when -XX:+ParallelRefProcEnabled
ysr
parents:
113
diff
changeset
|
568 _is_alive_closure(_span, &_markBitMap), |
| 0 | 569 _restart_addr(NULL), |
| 570 _overflow_list(NULL), | |
| 571 _stats(cmsGen), | |
| 572 _eden_chunk_array(NULL), // may be set in ctor body | |
| 573 _eden_chunk_capacity(0), // -- ditto -- | |
| 574 _eden_chunk_index(0), // -- ditto -- | |
| 575 _survivor_plab_array(NULL), // -- ditto -- | |
| 576 _survivor_chunk_array(NULL), // -- ditto -- | |
| 577 _survivor_chunk_capacity(0), // -- ditto -- | |
| 578 _survivor_chunk_index(0), // -- ditto -- | |
| 579 _ser_pmc_preclean_ovflw(0), | |
|
452
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
580 _ser_kac_preclean_ovflw(0), |
| 0 | 581 _ser_pmc_remark_ovflw(0), |
| 582 _par_pmc_remark_ovflw(0), | |
| 583 _ser_kac_ovflw(0), | |
| 584 _par_kac_ovflw(0), | |
| 585 #ifndef PRODUCT | |
| 586 _num_par_pushes(0), | |
| 587 #endif | |
| 588 _collection_count_start(0), | |
| 589 _verifying(false), | |
| 590 _icms_start_limit(NULL), | |
| 591 _icms_stop_limit(NULL), | |
| 592 _verification_mark_bm(0, Mutex::leaf + 1, "CMS_verification_mark_bm_lock"), | |
| 593 _completed_initialization(false), | |
| 594 _collector_policy(cp), | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
595 _should_unload_classes(false), |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
596 _concurrent_cycles_since_last_unload(0), |
|
798
fe1574da39fc
6848641: CMSCollector::_roots_scanning_options should be initialized
ysr
parents:
679
diff
changeset
|
597 _roots_scanning_options(0), |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
598 _inter_sweep_estimate(CMS_SweepWeight, CMS_SweepPadding), |
| 10405 | 599 _intra_sweep_estimate(CMS_SweepWeight, CMS_SweepPadding), |
| 600 _gc_tracer_cm(new (ResourceObj::C_HEAP, mtGC) CMSTracer()), | |
| 601 _gc_timer_cm(new (ResourceObj::C_HEAP, mtGC) ConcurrentGCTimer()), | |
| 602 _cms_start_registered(false) | |
| 0 | 603 { |
| 604 if (ExplicitGCInvokesConcurrentAndUnloadsClasses) { | |
| 605 ExplicitGCInvokesConcurrent = true; | |
| 606 } | |
| 607 // Now expand the span and allocate the collection support structures | |
| 608 // (MUT, marking bit map etc.) to cover both generations subject to | |
| 609 // collection. | |
| 610 | |
| 611 // For use by dirty card to oop closures. | |
| 612 _cmsGen->cmsSpace()->set_collector(this); | |
| 613 | |
| 614 // Allocate MUT and marking bit map | |
| 615 { | |
| 616 MutexLockerEx x(_markBitMap.lock(), Mutex::_no_safepoint_check_flag); | |
| 617 if (!_markBitMap.allocate(_span)) { | |
| 618 warning("Failed to allocate CMS Bit Map"); | |
| 619 return; | |
| 620 } | |
| 621 assert(_markBitMap.covers(_span), "_markBitMap inconsistency?"); | |
| 622 } | |
| 623 { | |
| 624 _modUnionTable.allocate(_span); | |
| 625 assert(_modUnionTable.covers(_span), "_modUnionTable inconsistency?"); | |
| 626 } | |
| 627 | |
| 1284 | 628 if (!_markStack.allocate(MarkStackSize)) { |
| 0 | 629 warning("Failed to allocate CMS Marking Stack"); |
| 630 return; | |
| 631 } | |
| 632 | |
| 633 // Support for multi-threaded concurrent phases | |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
634 if (CMSConcurrentMTEnabled) { |
| 1284 | 635 if (FLAG_IS_DEFAULT(ConcGCThreads)) { |
| 0 | 636 // just for now |
| 1284 | 637 FLAG_SET_DEFAULT(ConcGCThreads, (ParallelGCThreads + 3)/4); |
| 638 } | |
| 639 if (ConcGCThreads > 1) { | |
| 0 | 640 _conc_workers = new YieldingFlexibleWorkGang("Parallel CMS Threads", |
| 1284 | 641 ConcGCThreads, true); |
| 0 | 642 if (_conc_workers == NULL) { |
| 643 warning("GC/CMS: _conc_workers allocation failure: " | |
| 644 "forcing -CMSConcurrentMTEnabled"); | |
| 645 CMSConcurrentMTEnabled = false; | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
646 } else { |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
647 _conc_workers->initialize_workers(); |
| 0 | 648 } |
| 649 } else { | |
| 650 CMSConcurrentMTEnabled = false; | |
| 651 } | |
| 652 } | |
| 653 if (!CMSConcurrentMTEnabled) { | |
| 1284 | 654 ConcGCThreads = 0; |
| 0 | 655 } else { |
| 656 // Turn off CMSCleanOnEnter optimization temporarily for | |
| 657 // the MT case where it's not fixed yet; see 6178663. | |
| 658 CMSCleanOnEnter = false; | |
| 659 } | |
| 1284 | 660 assert((_conc_workers != NULL) == (ConcGCThreads > 1), |
| 0 | 661 "Inconsistency"); |
| 662 | |
| 663 // Parallel task queues; these are shared for the | |
| 664 // concurrent and stop-world phases of CMS, but | |
| 665 // are not shared with parallel scavenge (ParNew). | |
| 666 { | |
| 667 uint i; | |
| 1284 | 668 uint num_queues = (uint) MAX2(ParallelGCThreads, ConcGCThreads); |
| 0 | 669 |
| 670 if ((CMSParallelRemarkEnabled || CMSConcurrentMTEnabled | |
| 671 || ParallelRefProcEnabled) | |
| 672 && num_queues > 0) { | |
| 673 _task_queues = new OopTaskQueueSet(num_queues); | |
| 674 if (_task_queues == NULL) { | |
| 675 warning("task_queues allocation failure."); | |
| 676 return; | |
| 677 } | |
| 6197 | 678 _hash_seed = NEW_C_HEAP_ARRAY(int, num_queues, mtGC); |
| 0 | 679 if (_hash_seed == NULL) { |
| 680 warning("_hash_seed array allocation failure"); | |
| 681 return; | |
| 682 } | |
| 683 | |
| 1665 | 684 typedef Padded<OopTaskQueue> PaddedOopTaskQueue; |
| 0 | 685 for (i = 0; i < num_queues; i++) { |
| 1665 | 686 PaddedOopTaskQueue *q = new PaddedOopTaskQueue(); |
| 687 if (q == NULL) { | |
| 0 | 688 warning("work_queue allocation failure."); |
| 689 return; | |
| 690 } | |
| 1665 | 691 _task_queues->register_queue(i, q); |
| 0 | 692 } |
| 693 for (i = 0; i < num_queues; i++) { | |
| 694 _task_queues->queue(i)->initialize(); | |
| 695 _hash_seed[i] = 17; // copied from ParNew | |
| 696 } | |
| 697 } | |
| 698 } | |
| 699 | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
700 _cmsGen ->init_initiating_occupancy(CMSInitiatingOccupancyFraction, CMSTriggerRatio); |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
701 |
| 0 | 702 // Clip CMSBootstrapOccupancy between 0 and 100. |
|
10287
12f651e29f6b
6843347: Boundary values in some public GC options cause crashes
tschatzl
parents:
10244
diff
changeset
|
703 _bootstrap_occupancy = ((double)CMSBootstrapOccupancy)/(double)100; |
| 0 | 704 |
| 705 _full_gcs_since_conc_gc = 0; | |
| 706 | |
| 707 // Now tell CMS generations the identity of their collector | |
| 708 ConcurrentMarkSweepGeneration::set_collector(this); | |
| 709 | |
| 710 // Create & start a CMS thread for this CMS collector | |
| 711 _cmsThread = ConcurrentMarkSweepThread::start(this); | |
| 712 assert(cmsThread() != NULL, "CMS Thread should have been created"); | |
| 713 assert(cmsThread()->collector() == this, | |
| 714 "CMS Thread should refer to this gen"); | |
| 715 assert(CGC_lock != NULL, "Where's the CGC_lock?"); | |
| 716 | |
| 717 // Support for parallelizing young gen rescan | |
| 718 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 719 _young_gen = gch->prev_gen(_cmsGen); | |
| 720 if (gch->supports_inline_contig_alloc()) { | |
| 721 _top_addr = gch->top_addr(); | |
| 722 _end_addr = gch->end_addr(); | |
| 723 assert(_young_gen != NULL, "no _young_gen"); | |
| 724 _eden_chunk_index = 0; | |
| 725 _eden_chunk_capacity = (_young_gen->max_capacity()+CMSSamplingGrain)/CMSSamplingGrain; | |
| 6197 | 726 _eden_chunk_array = NEW_C_HEAP_ARRAY(HeapWord*, _eden_chunk_capacity, mtGC); |
| 0 | 727 if (_eden_chunk_array == NULL) { |
| 728 _eden_chunk_capacity = 0; | |
| 729 warning("GC/CMS: _eden_chunk_array allocation failure"); | |
| 730 } | |
| 731 } | |
| 732 assert(_eden_chunk_array != NULL || _eden_chunk_capacity == 0, "Error"); | |
| 733 | |
| 734 // Support for parallelizing survivor space rescan | |
| 735 if (CMSParallelRemarkEnabled && CMSParallelSurvivorRemarkEnabled) { | |
|
1289
d47555d7aca8
6910182: CMS: assert(_cursor[j] == _survivor_plab_array[j].end(),"Ctl pt invariant")
jmasa
parents:
1284
diff
changeset
|
736 const size_t max_plab_samples = |
|
d47555d7aca8
6910182: CMS: assert(_cursor[j] == _survivor_plab_array[j].end(),"Ctl pt invariant")
jmasa
parents:
1284
diff
changeset
|
737 ((DefNewGeneration*)_young_gen)->max_survivor_size()/MinTLABSize; |
|
d47555d7aca8
6910182: CMS: assert(_cursor[j] == _survivor_plab_array[j].end(),"Ctl pt invariant")
jmasa
parents:
1284
diff
changeset
|
738 |
| 6197 | 739 _survivor_plab_array = NEW_C_HEAP_ARRAY(ChunkArray, ParallelGCThreads, mtGC); |
| 740 _survivor_chunk_array = NEW_C_HEAP_ARRAY(HeapWord*, 2*max_plab_samples, mtGC); | |
| 741 _cursor = NEW_C_HEAP_ARRAY(size_t, ParallelGCThreads, mtGC); | |
| 0 | 742 if (_survivor_plab_array == NULL || _survivor_chunk_array == NULL |
| 743 || _cursor == NULL) { | |
| 744 warning("Failed to allocate survivor plab/chunk array"); | |
| 745 if (_survivor_plab_array != NULL) { | |
| 6197 | 746 FREE_C_HEAP_ARRAY(ChunkArray, _survivor_plab_array, mtGC); |
| 0 | 747 _survivor_plab_array = NULL; |
| 748 } | |
| 749 if (_survivor_chunk_array != NULL) { | |
| 6197 | 750 FREE_C_HEAP_ARRAY(HeapWord*, _survivor_chunk_array, mtGC); |
| 0 | 751 _survivor_chunk_array = NULL; |
| 752 } | |
| 753 if (_cursor != NULL) { | |
| 6197 | 754 FREE_C_HEAP_ARRAY(size_t, _cursor, mtGC); |
| 0 | 755 _cursor = NULL; |
| 756 } | |
| 757 } else { | |
| 758 _survivor_chunk_capacity = 2*max_plab_samples; | |
| 759 for (uint i = 0; i < ParallelGCThreads; i++) { | |
| 6197 | 760 HeapWord** vec = NEW_C_HEAP_ARRAY(HeapWord*, max_plab_samples, mtGC); |
| 0 | 761 if (vec == NULL) { |
| 762 warning("Failed to allocate survivor plab array"); | |
| 763 for (int j = i; j > 0; j--) { | |
| 6197 | 764 FREE_C_HEAP_ARRAY(HeapWord*, _survivor_plab_array[j-1].array(), mtGC); |
| 0 | 765 } |
| 6197 | 766 FREE_C_HEAP_ARRAY(ChunkArray, _survivor_plab_array, mtGC); |
| 767 FREE_C_HEAP_ARRAY(HeapWord*, _survivor_chunk_array, mtGC); | |
| 0 | 768 _survivor_plab_array = NULL; |
| 769 _survivor_chunk_array = NULL; | |
| 770 _survivor_chunk_capacity = 0; | |
| 771 break; | |
| 772 } else { | |
| 773 ChunkArray* cur = | |
| 774 ::new (&_survivor_plab_array[i]) ChunkArray(vec, | |
| 775 max_plab_samples); | |
| 776 assert(cur->end() == 0, "Should be 0"); | |
| 777 assert(cur->array() == vec, "Should be vec"); | |
| 778 assert(cur->capacity() == max_plab_samples, "Error"); | |
| 779 } | |
| 780 } | |
| 781 } | |
| 782 } | |
| 783 assert( ( _survivor_plab_array != NULL | |
| 784 && _survivor_chunk_array != NULL) | |
| 785 || ( _survivor_chunk_capacity == 0 | |
| 786 && _survivor_chunk_index == 0), | |
| 787 "Error"); | |
| 788 | |
| 789 // Choose what strong roots should be scanned depending on verification options | |
| 790 if (!CMSClassUnloadingEnabled) { | |
| 791 // If class unloading is disabled we want to include all classes into the root set. | |
| 792 add_root_scanning_option(SharedHeap::SO_AllClasses); | |
| 793 } else { | |
| 794 add_root_scanning_option(SharedHeap::SO_SystemClasses); | |
| 795 } | |
| 796 | |
| 797 NOT_PRODUCT(_overflow_counter = CMSMarkStackOverflowInterval;) | |
| 798 _gc_counters = new CollectorCounters("CMS", 1); | |
| 799 _completed_initialization = true; | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
800 _inter_sweep_timer.start(); // start of time |
| 0 | 801 } |
| 802 | |
| 803 const char* ConcurrentMarkSweepGeneration::name() const { | |
| 804 return "concurrent mark-sweep generation"; | |
| 805 } | |
| 806 void ConcurrentMarkSweepGeneration::update_counters() { | |
| 807 if (UsePerfData) { | |
| 808 _space_counters->update_all(); | |
| 809 _gen_counters->update_all(); | |
| 810 } | |
| 811 } | |
| 812 | |
| 813 // this is an optimized version of update_counters(). it takes the | |
| 814 // used value as a parameter rather than computing it. | |
| 815 // | |
| 816 void ConcurrentMarkSweepGeneration::update_counters(size_t used) { | |
| 817 if (UsePerfData) { | |
| 818 _space_counters->update_used(used); | |
| 819 _space_counters->update_capacity(); | |
| 820 _gen_counters->update_all(); | |
| 821 } | |
| 822 } | |
| 823 | |
| 824 void ConcurrentMarkSweepGeneration::print() const { | |
| 825 Generation::print(); | |
| 826 cmsSpace()->print(); | |
| 827 } | |
| 828 | |
| 829 #ifndef PRODUCT | |
| 830 void ConcurrentMarkSweepGeneration::print_statistics() { | |
| 831 cmsSpace()->printFLCensus(0); | |
| 832 } | |
| 833 #endif | |
| 834 | |
| 835 void ConcurrentMarkSweepGeneration::printOccupancy(const char *s) { | |
| 836 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 837 if (PrintGCDetails) { | |
| 838 if (Verbose) { | |
|
7455
0b54ffe4c2d3
8005672: Clean up some changes to GC logging with GCCause's
jmasa
parents:
6885
diff
changeset
|
839 gclog_or_tty->print("[%d %s-%s: "SIZE_FORMAT"("SIZE_FORMAT")]", |
| 0 | 840 level(), short_name(), s, used(), capacity()); |
| 841 } else { | |
|
7455
0b54ffe4c2d3
8005672: Clean up some changes to GC logging with GCCause's
jmasa
parents:
6885
diff
changeset
|
842 gclog_or_tty->print("[%d %s-%s: "SIZE_FORMAT"K("SIZE_FORMAT"K)]", |
| 0 | 843 level(), short_name(), s, used() / K, capacity() / K); |
| 844 } | |
| 845 } | |
| 846 if (Verbose) { | |
| 847 gclog_or_tty->print(" "SIZE_FORMAT"("SIZE_FORMAT")", | |
| 848 gch->used(), gch->capacity()); | |
| 849 } else { | |
| 850 gclog_or_tty->print(" "SIZE_FORMAT"K("SIZE_FORMAT"K)", | |
| 851 gch->used() / K, gch->capacity() / K); | |
| 852 } | |
| 853 } | |
| 854 | |
| 855 size_t | |
| 856 ConcurrentMarkSweepGeneration::contiguous_available() const { | |
| 857 // dld proposes an improvement in precision here. If the committed | |
| 858 // part of the space ends in a free block we should add that to | |
| 859 // uncommitted size in the calculation below. Will make this | |
| 860 // change later, staying with the approximation below for the | |
| 861 // time being. -- ysr. | |
| 862 return MAX2(_virtual_space.uncommitted_size(), unsafe_max_alloc_nogc()); | |
| 863 } | |
| 864 | |
| 865 size_t | |
| 866 ConcurrentMarkSweepGeneration::unsafe_max_alloc_nogc() const { | |
| 867 return _cmsSpace->max_alloc_in_words() * HeapWordSize; | |
| 868 } | |
| 869 | |
| 870 size_t ConcurrentMarkSweepGeneration::max_available() const { | |
| 871 return free() + _virtual_space.uncommitted_size(); | |
| 872 } | |
| 873 | |
|
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
874 bool ConcurrentMarkSweepGeneration::promotion_attempt_is_safe(size_t max_promotion_in_bytes) const { |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
875 size_t available = max_available(); |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
876 size_t av_promo = (size_t)gc_stats()->avg_promoted()->padded_average(); |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
877 bool res = (available >= av_promo) || (available >= max_promotion_in_bytes); |
|
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
878 if (Verbose && PrintGCDetails) { |
|
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
879 gclog_or_tty->print_cr( |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
880 "CMS: promo attempt is%s safe: available("SIZE_FORMAT") %s av_promo("SIZE_FORMAT")," |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
881 "max_promo("SIZE_FORMAT")", |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
882 res? "":" not", available, res? ">=":"<", |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
883 av_promo, max_promotion_in_bytes); |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
884 } |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
885 return res; |
| 0 | 886 } |
| 887 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
888 // At a promotion failure dump information on block layout in heap |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
889 // (cms old generation). |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
890 void ConcurrentMarkSweepGeneration::promotion_failure_occurred() { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
891 if (CMSDumpAtPromotionFailure) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
892 cmsSpace()->dump_at_safepoint_with_locks(collector(), gclog_or_tty); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
893 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
894 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
895 |
| 0 | 896 CompactibleSpace* |
| 897 ConcurrentMarkSweepGeneration::first_compaction_space() const { | |
| 898 return _cmsSpace; | |
| 899 } | |
| 900 | |
| 901 void ConcurrentMarkSweepGeneration::reset_after_compaction() { | |
| 902 // Clear the promotion information. These pointers can be adjusted | |
| 903 // along with all the other pointers into the heap but | |
| 904 // compaction is expected to be a rare event with | |
| 905 // a heap using cms so don't do it without seeing the need. | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
906 if (CollectedHeap::use_parallel_gc_threads()) { |
| 0 | 907 for (uint i = 0; i < ParallelGCThreads; i++) { |
| 908 _par_gc_thread_states[i]->promo.reset(); | |
| 909 } | |
| 910 } | |
| 911 } | |
| 912 | |
| 913 void ConcurrentMarkSweepGeneration::space_iterate(SpaceClosure* blk, bool usedOnly) { | |
| 914 blk->do_space(_cmsSpace); | |
| 915 } | |
| 916 | |
| 917 void ConcurrentMarkSweepGeneration::compute_new_size() { | |
| 918 assert_locked_or_safepoint(Heap_lock); | |
| 919 | |
| 920 // If incremental collection failed, we just want to expand | |
| 921 // to the limit. | |
| 922 if (incremental_collection_failed()) { | |
| 923 clear_incremental_collection_failed(); | |
| 924 grow_to_reserved(); | |
| 925 return; | |
| 926 } | |
| 927 | |
|
10243
a9d568b7df60
8013032: CMS: assert(used() == used_after_gc && used_after_gc <= capacity()) failed: used: 0 used_after_gc: 292080 capacity: 1431699456
jmasa
parents:
10188
diff
changeset
|
928 // The heap has been compacted but not reset yet. |
|
a9d568b7df60
8013032: CMS: assert(used() == used_after_gc && used_after_gc <= capacity()) failed: used: 0 used_after_gc: 292080 capacity: 1431699456
jmasa
parents:
10188
diff
changeset
|
929 // Any metric such as free() or used() will be incorrect. |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
930 |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
931 CardGeneration::compute_new_size(); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
932 |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
933 // Reset again after a possible resizing |
|
10244
06ab37f08701
8013184: CMS: Call reset_after_compaction() only if a compaction has been done
jmasa
parents:
10243
diff
changeset
|
934 if (did_compact()) { |
|
06ab37f08701
8013184: CMS: Call reset_after_compaction() only if a compaction has been done
jmasa
parents:
10243
diff
changeset
|
935 cmsSpace()->reset_after_compaction(); |
|
06ab37f08701
8013184: CMS: Call reset_after_compaction() only if a compaction has been done
jmasa
parents:
10243
diff
changeset
|
936 } |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
937 } |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
938 |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
939 void ConcurrentMarkSweepGeneration::compute_new_size_free_list() { |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
940 assert_locked_or_safepoint(Heap_lock); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
941 |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
942 // If incremental collection failed, we just want to expand |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
943 // to the limit. |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
944 if (incremental_collection_failed()) { |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
945 clear_incremental_collection_failed(); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
946 grow_to_reserved(); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
947 return; |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
948 } |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
949 |
| 0 | 950 double free_percentage = ((double) free()) / capacity(); |
| 951 double desired_free_percentage = (double) MinHeapFreeRatio / 100; | |
| 952 double maximum_free_percentage = (double) MaxHeapFreeRatio / 100; | |
| 953 | |
| 954 // compute expansion delta needed for reaching desired free percentage | |
| 955 if (free_percentage < desired_free_percentage) { | |
| 956 size_t desired_capacity = (size_t)(used() / ((double) 1 - desired_free_percentage)); | |
| 957 assert(desired_capacity >= capacity(), "invalid expansion size"); | |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
958 size_t expand_bytes = MAX2(desired_capacity - capacity(), MinHeapDeltaBytes); |
| 0 | 959 if (PrintGCDetails && Verbose) { |
| 960 size_t desired_capacity = (size_t)(used() / ((double) 1 - desired_free_percentage)); | |
| 961 gclog_or_tty->print_cr("\nFrom compute_new_size: "); | |
| 962 gclog_or_tty->print_cr(" Free fraction %f", free_percentage); | |
| 963 gclog_or_tty->print_cr(" Desired free fraction %f", | |
| 964 desired_free_percentage); | |
| 965 gclog_or_tty->print_cr(" Maximum free fraction %f", | |
| 966 maximum_free_percentage); | |
| 967 gclog_or_tty->print_cr(" Capactiy "SIZE_FORMAT, capacity()/1000); | |
| 968 gclog_or_tty->print_cr(" Desired capacity "SIZE_FORMAT, | |
| 969 desired_capacity/1000); | |
| 970 int prev_level = level() - 1; | |
| 971 if (prev_level >= 0) { | |
| 972 size_t prev_size = 0; | |
| 973 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 974 Generation* prev_gen = gch->_gens[prev_level]; | |
| 975 prev_size = prev_gen->capacity(); | |
| 976 gclog_or_tty->print_cr(" Younger gen size "SIZE_FORMAT, | |
| 977 prev_size/1000); | |
| 978 } | |
| 979 gclog_or_tty->print_cr(" unsafe_max_alloc_nogc "SIZE_FORMAT, | |
| 980 unsafe_max_alloc_nogc()/1000); | |
| 981 gclog_or_tty->print_cr(" contiguous available "SIZE_FORMAT, | |
| 982 contiguous_available()/1000); | |
| 983 gclog_or_tty->print_cr(" Expand by "SIZE_FORMAT" (bytes)", | |
| 984 expand_bytes); | |
| 985 } | |
| 986 // safe if expansion fails | |
| 987 expand(expand_bytes, 0, CMSExpansionCause::_satisfy_free_ratio); | |
| 988 if (PrintGCDetails && Verbose) { | |
| 989 gclog_or_tty->print_cr(" Expanded free fraction %f", | |
| 990 ((double) free()) / capacity()); | |
| 991 } | |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
992 } else { |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
993 size_t desired_capacity = (size_t)(used() / ((double) 1 - desired_free_percentage)); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
994 assert(desired_capacity <= capacity(), "invalid expansion size"); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
995 size_t shrink_bytes = capacity() - desired_capacity; |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
996 // Don't shrink unless the delta is greater than the minimum shrink we want |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
997 if (shrink_bytes >= MinHeapDeltaBytes) { |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
998 shrink_free_list_by(shrink_bytes); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
999 } |
| 0 | 1000 } |
| 1001 } | |
| 1002 | |
| 1003 Mutex* ConcurrentMarkSweepGeneration::freelistLock() const { | |
| 1004 return cmsSpace()->freelistLock(); | |
| 1005 } | |
| 1006 | |
| 1007 HeapWord* ConcurrentMarkSweepGeneration::allocate(size_t size, | |
| 1008 bool tlab) { | |
| 1009 CMSSynchronousYieldRequest yr; | |
| 1010 MutexLockerEx x(freelistLock(), | |
| 1011 Mutex::_no_safepoint_check_flag); | |
| 1012 return have_lock_and_allocate(size, tlab); | |
| 1013 } | |
| 1014 | |
| 1015 HeapWord* ConcurrentMarkSweepGeneration::have_lock_and_allocate(size_t size, | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1016 bool tlab /* ignored */) { |
| 0 | 1017 assert_lock_strong(freelistLock()); |
| 1018 size_t adjustedSize = CompactibleFreeListSpace::adjustObjectSize(size); | |
| 1019 HeapWord* res = cmsSpace()->allocate(adjustedSize); | |
| 1020 // Allocate the object live (grey) if the background collector has | |
| 1021 // started marking. This is necessary because the marker may | |
| 1022 // have passed this address and consequently this object will | |
| 1023 // not otherwise be greyed and would be incorrectly swept up. | |
| 1024 // Note that if this object contains references, the writing | |
| 1025 // of those references will dirty the card containing this object | |
| 1026 // allowing the object to be blackened (and its references scanned) | |
| 1027 // either during a preclean phase or at the final checkpoint. | |
| 1028 if (res != NULL) { | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1029 // We may block here with an uninitialized object with |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1030 // its mark-bit or P-bits not yet set. Such objects need |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1031 // to be safely navigable by block_start(). |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1032 assert(oop(res)->klass_or_null() == NULL, "Object should be uninitialized here."); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1033 assert(!((FreeChunk*)res)->is_free(), "Error, block will look free but show wrong size"); |
| 0 | 1034 collector()->direct_allocated(res, adjustedSize); |
| 1035 _direct_allocated_words += adjustedSize; | |
| 1036 // allocation counters | |
| 1037 NOT_PRODUCT( | |
| 1038 _numObjectsAllocated++; | |
| 1039 _numWordsAllocated += (int)adjustedSize; | |
| 1040 ) | |
| 1041 } | |
| 1042 return res; | |
| 1043 } | |
| 1044 | |
| 1045 // In the case of direct allocation by mutators in a generation that | |
| 1046 // is being concurrently collected, the object must be allocated | |
| 1047 // live (grey) if the background collector has started marking. | |
| 1048 // This is necessary because the marker may | |
| 1049 // have passed this address and consequently this object will | |
| 1050 // not otherwise be greyed and would be incorrectly swept up. | |
| 1051 // Note that if this object contains references, the writing | |
| 1052 // of those references will dirty the card containing this object | |
| 1053 // allowing the object to be blackened (and its references scanned) | |
| 1054 // either during a preclean phase or at the final checkpoint. | |
| 1055 void CMSCollector::direct_allocated(HeapWord* start, size_t size) { | |
| 1056 assert(_markBitMap.covers(start, size), "Out of bounds"); | |
| 1057 if (_collectorState >= Marking) { | |
| 1058 MutexLockerEx y(_markBitMap.lock(), | |
| 1059 Mutex::_no_safepoint_check_flag); | |
| 1060 // [see comments preceding SweepClosure::do_blk() below for details] | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1061 // |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1062 // Can the P-bits be deleted now? JJJ |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1063 // |
| 0 | 1064 // 1. need to mark the object as live so it isn't collected |
| 1065 // 2. need to mark the 2nd bit to indicate the object may be uninitialized | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1066 // 3. need to mark the end of the object so marking, precleaning or sweeping |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1067 // can skip over uninitialized or unparsable objects. An allocated |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1068 // object is considered uninitialized for our purposes as long as |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1069 // its klass word is NULL. All old gen objects are parsable |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1070 // as soon as they are initialized.) |
| 0 | 1071 _markBitMap.mark(start); // object is live |
| 1072 _markBitMap.mark(start + 1); // object is potentially uninitialized? | |
| 1073 _markBitMap.mark(start + size - 1); | |
| 1074 // mark end of object | |
| 1075 } | |
| 1076 // check that oop looks uninitialized | |
| 187 | 1077 assert(oop(start)->klass_or_null() == NULL, "_klass should be NULL"); |
| 0 | 1078 } |
| 1079 | |
| 1080 void CMSCollector::promoted(bool par, HeapWord* start, | |
| 1081 bool is_obj_array, size_t obj_size) { | |
| 1082 assert(_markBitMap.covers(start), "Out of bounds"); | |
| 1083 // See comment in direct_allocated() about when objects should | |
| 1084 // be allocated live. | |
| 1085 if (_collectorState >= Marking) { | |
| 1086 // we already hold the marking bit map lock, taken in | |
| 1087 // the prologue | |
| 1088 if (par) { | |
| 1089 _markBitMap.par_mark(start); | |
| 1090 } else { | |
| 1091 _markBitMap.mark(start); | |
| 1092 } | |
| 1093 // We don't need to mark the object as uninitialized (as | |
| 1094 // in direct_allocated above) because this is being done with the | |
| 1095 // world stopped and the object will be initialized by the | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1096 // time the marking, precleaning or sweeping get to look at it. |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1097 // But see the code for copying objects into the CMS generation, |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1098 // where we need to ensure that concurrent readers of the |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1099 // block offset table are able to safely navigate a block that |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1100 // is in flux from being free to being allocated (and in |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1101 // transition while being copied into) and subsequently |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1102 // becoming a bona-fide object when the copy/promotion is complete. |
| 0 | 1103 assert(SafepointSynchronize::is_at_safepoint(), |
| 1104 "expect promotion only at safepoints"); | |
| 1105 | |
| 1106 if (_collectorState < Sweeping) { | |
| 1107 // Mark the appropriate cards in the modUnionTable, so that | |
| 1108 // this object gets scanned before the sweep. If this is | |
| 1109 // not done, CMS generation references in the object might | |
| 1110 // not get marked. | |
| 1111 // For the case of arrays, which are otherwise precisely | |
| 1112 // marked, we need to dirty the entire array, not just its head. | |
| 1113 if (is_obj_array) { | |
| 1114 // The [par_]mark_range() method expects mr.end() below to | |
| 1115 // be aligned to the granularity of a bit's representation | |
| 1116 // in the heap. In the case of the MUT below, that's a | |
| 1117 // card size. | |
| 1118 MemRegion mr(start, | |
| 1119 (HeapWord*)round_to((intptr_t)(start + obj_size), | |
| 1120 CardTableModRefBS::card_size /* bytes */)); | |
| 1121 if (par) { | |
| 1122 _modUnionTable.par_mark_range(mr); | |
| 1123 } else { | |
| 1124 _modUnionTable.mark_range(mr); | |
| 1125 } | |
| 1126 } else { // not an obj array; we can just mark the head | |
| 1127 if (par) { | |
| 1128 _modUnionTable.par_mark(start); | |
| 1129 } else { | |
| 1130 _modUnionTable.mark(start); | |
| 1131 } | |
| 1132 } | |
| 1133 } | |
| 1134 } | |
| 1135 } | |
| 1136 | |
| 1137 static inline size_t percent_of_space(Space* space, HeapWord* addr) | |
| 1138 { | |
| 1139 size_t delta = pointer_delta(addr, space->bottom()); | |
| 1140 return (size_t)(delta * 100.0 / (space->capacity() / HeapWordSize)); | |
| 1141 } | |
| 1142 | |
| 1143 void CMSCollector::icms_update_allocation_limits() | |
| 1144 { | |
| 1145 Generation* gen0 = GenCollectedHeap::heap()->get_gen(0); | |
| 1146 EdenSpace* eden = gen0->as_DefNewGeneration()->eden(); | |
| 1147 | |
| 1148 const unsigned int duty_cycle = stats().icms_update_duty_cycle(); | |
| 1149 if (CMSTraceIncrementalPacing) { | |
| 1150 stats().print(); | |
| 1151 } | |
| 1152 | |
| 1153 assert(duty_cycle <= 100, "invalid duty cycle"); | |
| 1154 if (duty_cycle != 0) { | |
| 1155 // The duty_cycle is a percentage between 0 and 100; convert to words and | |
| 1156 // then compute the offset from the endpoints of the space. | |
| 1157 size_t free_words = eden->free() / HeapWordSize; | |
| 1158 double free_words_dbl = (double)free_words; | |
| 1159 size_t duty_cycle_words = (size_t)(free_words_dbl * duty_cycle / 100.0); | |
| 1160 size_t offset_words = (free_words - duty_cycle_words) / 2; | |
| 1161 | |
| 1162 _icms_start_limit = eden->top() + offset_words; | |
| 1163 _icms_stop_limit = eden->end() - offset_words; | |
| 1164 | |
| 1165 // The limits may be adjusted (shifted to the right) by | |
| 1166 // CMSIncrementalOffset, to allow the application more mutator time after a | |
| 1167 // young gen gc (when all mutators were stopped) and before CMS starts and | |
| 1168 // takes away one or more cpus. | |
| 1169 if (CMSIncrementalOffset != 0) { | |
| 1170 double adjustment_dbl = free_words_dbl * CMSIncrementalOffset / 100.0; | |
| 1171 size_t adjustment = (size_t)adjustment_dbl; | |
| 1172 HeapWord* tmp_stop = _icms_stop_limit + adjustment; | |
| 1173 if (tmp_stop > _icms_stop_limit && tmp_stop < eden->end()) { | |
| 1174 _icms_start_limit += adjustment; | |
| 1175 _icms_stop_limit = tmp_stop; | |
| 1176 } | |
| 1177 } | |
| 1178 } | |
| 1179 if (duty_cycle == 0 || (_icms_start_limit == _icms_stop_limit)) { | |
| 1180 _icms_start_limit = _icms_stop_limit = eden->end(); | |
| 1181 } | |
| 1182 | |
| 1183 // Install the new start limit. | |
| 1184 eden->set_soft_end(_icms_start_limit); | |
| 1185 | |
| 1186 if (CMSTraceIncrementalMode) { | |
| 1187 gclog_or_tty->print(" icms alloc limits: " | |
| 1188 PTR_FORMAT "," PTR_FORMAT | |
| 1189 " (" SIZE_FORMAT "%%," SIZE_FORMAT "%%) ", | |
| 1190 _icms_start_limit, _icms_stop_limit, | |
| 1191 percent_of_space(eden, _icms_start_limit), | |
| 1192 percent_of_space(eden, _icms_stop_limit)); | |
| 1193 if (Verbose) { | |
| 1194 gclog_or_tty->print("eden: "); | |
| 1195 eden->print_on(gclog_or_tty); | |
| 1196 } | |
| 1197 } | |
| 1198 } | |
| 1199 | |
| 1200 // Any changes here should try to maintain the invariant | |
| 1201 // that if this method is called with _icms_start_limit | |
| 1202 // and _icms_stop_limit both NULL, then it should return NULL | |
| 1203 // and not notify the icms thread. | |
| 1204 HeapWord* | |
| 1205 CMSCollector::allocation_limit_reached(Space* space, HeapWord* top, | |
| 1206 size_t word_size) | |
| 1207 { | |
| 1208 // A start_limit equal to end() means the duty cycle is 0, so treat that as a | |
| 1209 // nop. | |
| 1210 if (CMSIncrementalMode && _icms_start_limit != space->end()) { | |
| 1211 if (top <= _icms_start_limit) { | |
| 1212 if (CMSTraceIncrementalMode) { | |
| 1213 space->print_on(gclog_or_tty); | |
| 1214 gclog_or_tty->stamp(); | |
| 1215 gclog_or_tty->print_cr(" start limit top=" PTR_FORMAT | |
| 1216 ", new limit=" PTR_FORMAT | |
| 1217 " (" SIZE_FORMAT "%%)", | |
| 1218 top, _icms_stop_limit, | |
| 1219 percent_of_space(space, _icms_stop_limit)); | |
| 1220 } | |
| 1221 ConcurrentMarkSweepThread::start_icms(); | |
| 1222 assert(top < _icms_stop_limit, "Tautology"); | |
| 1223 if (word_size < pointer_delta(_icms_stop_limit, top)) { | |
| 1224 return _icms_stop_limit; | |
| 1225 } | |
| 1226 | |
| 1227 // The allocation will cross both the _start and _stop limits, so do the | |
| 1228 // stop notification also and return end(). | |
| 1229 if (CMSTraceIncrementalMode) { | |
| 1230 space->print_on(gclog_or_tty); | |
| 1231 gclog_or_tty->stamp(); | |
| 1232 gclog_or_tty->print_cr(" +stop limit top=" PTR_FORMAT | |
| 1233 ", new limit=" PTR_FORMAT | |
| 1234 " (" SIZE_FORMAT "%%)", | |
| 1235 top, space->end(), | |
| 1236 percent_of_space(space, space->end())); | |
| 1237 } | |
| 1238 ConcurrentMarkSweepThread::stop_icms(); | |
| 1239 return space->end(); | |
| 1240 } | |
| 1241 | |
| 1242 if (top <= _icms_stop_limit) { | |
| 1243 if (CMSTraceIncrementalMode) { | |
| 1244 space->print_on(gclog_or_tty); | |
| 1245 gclog_or_tty->stamp(); | |
| 1246 gclog_or_tty->print_cr(" stop limit top=" PTR_FORMAT | |
| 1247 ", new limit=" PTR_FORMAT | |
| 1248 " (" SIZE_FORMAT "%%)", | |
| 1249 top, space->end(), | |
| 1250 percent_of_space(space, space->end())); | |
| 1251 } | |
| 1252 ConcurrentMarkSweepThread::stop_icms(); | |
| 1253 return space->end(); | |
| 1254 } | |
| 1255 | |
| 1256 if (CMSTraceIncrementalMode) { | |
| 1257 space->print_on(gclog_or_tty); | |
| 1258 gclog_or_tty->stamp(); | |
| 1259 gclog_or_tty->print_cr(" end limit top=" PTR_FORMAT | |
| 1260 ", new limit=" PTR_FORMAT, | |
| 1261 top, NULL); | |
| 1262 } | |
| 1263 } | |
| 1264 | |
| 1265 return NULL; | |
| 1266 } | |
| 1267 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
1268 oop ConcurrentMarkSweepGeneration::promote(oop obj, size_t obj_size) { |
| 0 | 1269 assert(obj_size == (size_t)obj->size(), "bad obj_size passed in"); |
| 1270 // allocate, copy and if necessary update promoinfo -- | |
| 1271 // delegate to underlying space. | |
| 1272 assert_lock_strong(freelistLock()); | |
| 1273 | |
| 1274 #ifndef PRODUCT | |
| 1275 if (Universe::heap()->promotion_should_fail()) { | |
| 1276 return NULL; | |
| 1277 } | |
| 1278 #endif // #ifndef PRODUCT | |
| 1279 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
1280 oop res = _cmsSpace->promote(obj, obj_size); |
| 0 | 1281 if (res == NULL) { |
| 1282 // expand and retry | |
| 1283 size_t s = _cmsSpace->expansionSpaceRequired(obj_size); // HeapWords | |
| 1284 expand(s*HeapWordSize, MinHeapDeltaBytes, | |
| 1285 CMSExpansionCause::_satisfy_promotion); | |
| 1286 // Since there's currently no next generation, we don't try to promote | |
| 1287 // into a more senior generation. | |
| 1288 assert(next_gen() == NULL, "assumption, based upon which no attempt " | |
| 1289 "is made to pass on a possibly failing " | |
| 1290 "promotion to next generation"); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
1291 res = _cmsSpace->promote(obj, obj_size); |
| 0 | 1292 } |
| 1293 if (res != NULL) { | |
| 1294 // See comment in allocate() about when objects should | |
| 1295 // be allocated live. | |
| 1296 assert(obj->is_oop(), "Will dereference klass pointer below"); | |
| 1297 collector()->promoted(false, // Not parallel | |
| 1298 (HeapWord*)res, obj->is_objArray(), obj_size); | |
| 1299 // promotion counters | |
| 1300 NOT_PRODUCT( | |
| 1301 _numObjectsPromoted++; | |
| 1302 _numWordsPromoted += | |
| 1303 (int)(CompactibleFreeListSpace::adjustObjectSize(obj->size())); | |
| 1304 ) | |
| 1305 } | |
| 1306 return res; | |
| 1307 } | |
| 1308 | |
| 1309 | |
| 1310 HeapWord* | |
| 1311 ConcurrentMarkSweepGeneration::allocation_limit_reached(Space* space, | |
| 1312 HeapWord* top, | |
| 1313 size_t word_sz) | |
| 1314 { | |
| 1315 return collector()->allocation_limit_reached(space, top, word_sz); | |
| 1316 } | |
| 1317 | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1318 // IMPORTANT: Notes on object size recognition in CMS. |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1319 // --------------------------------------------------- |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1320 // A block of storage in the CMS generation is always in |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1321 // one of three states. A free block (FREE), an allocated |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1322 // object (OBJECT) whose size() method reports the correct size, |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1323 // and an intermediate state (TRANSIENT) in which its size cannot |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1324 // be accurately determined. |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1325 // STATE IDENTIFICATION: (32 bit and 64 bit w/o COOPS) |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1326 // ----------------------------------------------------- |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1327 // FREE: klass_word & 1 == 1; mark_word holds block size |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1328 // |
|
1777
179464550c7d
6983930: CMS: Various small cleanups ca September 2010
ysr
parents:
1720
diff
changeset
|
1329 // OBJECT: klass_word installed; klass_word != 0 && klass_word & 1 == 0; |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1330 // obj->size() computes correct size |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1331 // |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1332 // TRANSIENT: klass_word == 0; size is indeterminate until we become an OBJECT |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1333 // |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1334 // STATE IDENTIFICATION: (64 bit+COOPS) |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1335 // ------------------------------------ |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1336 // FREE: mark_word & CMS_FREE_BIT == 1; mark_word & ~CMS_FREE_BIT gives block_size |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1337 // |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1338 // OBJECT: klass_word installed; klass_word != 0; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1339 // obj->size() computes correct size |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1340 // |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1341 // TRANSIENT: klass_word == 0; size is indeterminate until we become an OBJECT |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1342 // |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1343 // |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1344 // STATE TRANSITION DIAGRAM |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1345 // |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1346 // mut / parnew mut / parnew |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1347 // FREE --------------------> TRANSIENT ---------------------> OBJECT --| |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1348 // ^ | |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1349 // |------------------------ DEAD <------------------------------------| |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1350 // sweep mut |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1351 // |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1352 // While a block is in TRANSIENT state its size cannot be determined |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1353 // so readers will either need to come back later or stall until |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1354 // the size can be determined. Note that for the case of direct |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1355 // allocation, P-bits, when available, may be used to determine the |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1356 // size of an object that may not yet have been initialized. |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1357 |
| 0 | 1358 // Things to support parallel young-gen collection. |
| 1359 oop | |
| 1360 ConcurrentMarkSweepGeneration::par_promote(int thread_num, | |
| 1361 oop old, markOop m, | |
| 1362 size_t word_sz) { | |
| 1363 #ifndef PRODUCT | |
| 1364 if (Universe::heap()->promotion_should_fail()) { | |
| 1365 return NULL; | |
| 1366 } | |
| 1367 #endif // #ifndef PRODUCT | |
| 1368 | |
| 1369 CMSParGCThreadState* ps = _par_gc_thread_states[thread_num]; | |
| 1370 PromotionInfo* promoInfo = &ps->promo; | |
| 1371 // if we are tracking promotions, then first ensure space for | |
| 1372 // promotion (including spooling space for saving header if necessary). | |
| 1373 // then allocate and copy, then track promoted info if needed. | |
| 1374 // When tracking (see PromotionInfo::track()), the mark word may | |
| 1375 // be displaced and in this case restoration of the mark word | |
| 1376 // occurs in the (oop_since_save_marks_)iterate phase. | |
| 1377 if (promoInfo->tracking() && !promoInfo->ensure_spooling_space()) { | |
| 1378 // Out of space for allocating spooling buffers; | |
| 1379 // try expanding and allocating spooling buffers. | |
| 1380 if (!expand_and_ensure_spooling_space(promoInfo)) { | |
| 1381 return NULL; | |
| 1382 } | |
| 1383 } | |
| 1384 assert(promoInfo->has_spooling_space(), "Control point invariant"); | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1385 const size_t alloc_sz = CompactibleFreeListSpace::adjustObjectSize(word_sz); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1386 HeapWord* obj_ptr = ps->lab.alloc(alloc_sz); |
| 0 | 1387 if (obj_ptr == NULL) { |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1388 obj_ptr = expand_and_par_lab_allocate(ps, alloc_sz); |
| 0 | 1389 if (obj_ptr == NULL) { |
| 1390 return NULL; | |
| 1391 } | |
| 1392 } | |
| 1393 oop obj = oop(obj_ptr); | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1394 OrderAccess::storestore(); |
| 187 | 1395 assert(obj->klass_or_null() == NULL, "Object should be uninitialized here."); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1396 assert(!((FreeChunk*)obj_ptr)->is_free(), "Error, block will look free but show wrong size"); |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1397 // IMPORTANT: See note on object initialization for CMS above. |
| 0 | 1398 // Otherwise, copy the object. Here we must be careful to insert the |
| 1399 // klass pointer last, since this marks the block as an allocated object. | |
| 187 | 1400 // Except with compressed oops it's the mark word. |
| 0 | 1401 HeapWord* old_ptr = (HeapWord*)old; |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1402 // Restore the mark word copied above. |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1403 obj->set_mark(m); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1404 assert(obj->klass_or_null() == NULL, "Object should be uninitialized here."); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1405 assert(!((FreeChunk*)obj_ptr)->is_free(), "Error, block will look free but show wrong size"); |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1406 OrderAccess::storestore(); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1407 |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1408 if (UseCompressedKlassPointers) { |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1409 // Copy gap missed by (aligned) header size calculation below |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1410 obj->set_klass_gap(old->klass_gap()); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1411 } |
| 0 | 1412 if (word_sz > (size_t)oopDesc::header_size()) { |
| 1413 Copy::aligned_disjoint_words(old_ptr + oopDesc::header_size(), | |
| 1414 obj_ptr + oopDesc::header_size(), | |
| 1415 word_sz - oopDesc::header_size()); | |
| 1416 } | |
| 187 | 1417 |
| 0 | 1418 // Now we can track the promoted object, if necessary. We take care |
| 1521 | 1419 // to delay the transition from uninitialized to full object |
| 0 | 1420 // (i.e., insertion of klass pointer) until after, so that it |
| 1421 // atomically becomes a promoted object. | |
| 1422 if (promoInfo->tracking()) { | |
| 1423 promoInfo->track((PromotedObject*)obj, old->klass()); | |
| 1424 } | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1425 assert(obj->klass_or_null() == NULL, "Object should be uninitialized here."); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1426 assert(!((FreeChunk*)obj_ptr)->is_free(), "Error, block will look free but show wrong size"); |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1427 assert(old->is_oop(), "Will use and dereference old klass ptr below"); |
| 187 | 1428 |
| 1429 // Finally, install the klass pointer (this should be volatile). | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1430 OrderAccess::storestore(); |
| 0 | 1431 obj->set_klass(old->klass()); |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1432 // We should now be able to calculate the right size for this object |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1433 assert(obj->is_oop() && obj->size() == (int)word_sz, "Error, incorrect size computed for promoted object"); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1434 |
| 0 | 1435 collector()->promoted(true, // parallel |
| 1436 obj_ptr, old->is_objArray(), word_sz); | |
| 1437 | |
| 1438 NOT_PRODUCT( | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1439 Atomic::inc_ptr(&_numObjectsPromoted); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1704
diff
changeset
|
1440 Atomic::add_ptr(alloc_sz, &_numWordsPromoted); |
| 0 | 1441 ) |
| 1442 | |
| 1443 return obj; | |
| 1444 } | |
| 1445 | |
| 1446 void | |
| 1447 ConcurrentMarkSweepGeneration:: | |
| 1448 par_promote_alloc_undo(int thread_num, | |
| 1449 HeapWord* obj, size_t word_sz) { | |
| 1450 // CMS does not support promotion undo. | |
| 1451 ShouldNotReachHere(); | |
| 1452 } | |
| 1453 | |
| 1454 void | |
| 1455 ConcurrentMarkSweepGeneration:: | |
| 1456 par_promote_alloc_done(int thread_num) { | |
| 1457 CMSParGCThreadState* ps = _par_gc_thread_states[thread_num]; | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
1458 ps->lab.retire(thread_num); |
| 0 | 1459 } |
| 1460 | |
| 1461 void | |
| 1462 ConcurrentMarkSweepGeneration:: | |
| 1463 par_oop_since_save_marks_iterate_done(int thread_num) { | |
| 1464 CMSParGCThreadState* ps = _par_gc_thread_states[thread_num]; | |
| 1465 ParScanWithoutBarrierClosure* dummy_cl = NULL; | |
| 1466 ps->promo.promoted_oops_iterate_nv(dummy_cl); | |
| 1467 } | |
| 1468 | |
| 1469 bool ConcurrentMarkSweepGeneration::should_collect(bool full, | |
| 1470 size_t size, | |
| 1471 bool tlab) | |
| 1472 { | |
| 1473 // We allow a STW collection only if a full | |
| 1474 // collection was requested. | |
| 1475 return full || should_allocate(size, tlab); // FIX ME !!! | |
| 1476 // This and promotion failure handling are connected at the | |
| 1477 // hip and should be fixed by untying them. | |
| 1478 } | |
| 1479 | |
| 1480 bool CMSCollector::shouldConcurrentCollect() { | |
| 1481 if (_full_gc_requested) { | |
| 1482 if (Verbose && PrintGCDetails) { | |
| 1483 gclog_or_tty->print_cr("CMSCollector: collect because of explicit " | |
|
1520
bb843ebc7c55
6919638: CMS: ExplicitGCInvokesConcurrent misinteracts with gc locker
ysr
parents:
1518
diff
changeset
|
1484 " gc request (or gc_locker)"); |
| 0 | 1485 } |
| 1486 return true; | |
| 1487 } | |
| 1488 | |
| 1489 // For debugging purposes, change the type of collection. | |
| 1490 // If the rotation is not on the concurrent collection | |
| 1491 // type, don't start a concurrent collection. | |
| 1492 NOT_PRODUCT( | |
| 1493 if (RotateCMSCollectionTypes && | |
| 1494 (_cmsGen->debug_collection_type() != | |
| 1495 ConcurrentMarkSweepGeneration::Concurrent_collection_type)) { | |
| 1496 assert(_cmsGen->debug_collection_type() != | |
| 1497 ConcurrentMarkSweepGeneration::Unknown_collection_type, | |
| 1498 "Bad cms collection type"); | |
| 1499 return false; | |
| 1500 } | |
| 1501 ) | |
| 1502 | |
| 1503 FreelistLocker x(this); | |
| 1504 // ------------------------------------------------------------------ | |
| 1505 // Print out lots of information which affects the initiation of | |
| 1506 // a collection. | |
| 1507 if (PrintCMSInitiationStatistics && stats().valid()) { | |
| 1508 gclog_or_tty->print("CMSCollector shouldConcurrentCollect: "); | |
| 1509 gclog_or_tty->stamp(); | |
| 1510 gclog_or_tty->print_cr(""); | |
| 1511 stats().print_on(gclog_or_tty); | |
| 1512 gclog_or_tty->print_cr("time_until_cms_gen_full %3.7f", | |
| 1513 stats().time_until_cms_gen_full()); | |
| 1514 gclog_or_tty->print_cr("free="SIZE_FORMAT, _cmsGen->free()); | |
| 1515 gclog_or_tty->print_cr("contiguous_available="SIZE_FORMAT, | |
| 1516 _cmsGen->contiguous_available()); | |
| 1517 gclog_or_tty->print_cr("promotion_rate=%g", stats().promotion_rate()); | |
| 1518 gclog_or_tty->print_cr("cms_allocation_rate=%g", stats().cms_allocation_rate()); | |
| 1519 gclog_or_tty->print_cr("occupancy=%3.7f", _cmsGen->occupancy()); | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1520 gclog_or_tty->print_cr("initiatingOccupancy=%3.7f", _cmsGen->initiating_occupancy()); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1521 gclog_or_tty->print_cr("metadata initialized %d", |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1522 MetaspaceGC::should_concurrent_collect()); |
| 0 | 1523 } |
| 1524 // ------------------------------------------------------------------ | |
| 1525 | |
| 1526 // If the estimated time to complete a cms collection (cms_duration()) | |
| 1527 // is less than the estimated time remaining until the cms generation | |
| 1528 // is full, start a collection. | |
| 1529 if (!UseCMSInitiatingOccupancyOnly) { | |
| 1530 if (stats().valid()) { | |
| 1531 if (stats().time_until_cms_start() == 0.0) { | |
| 1532 return true; | |
| 1533 } | |
| 1534 } else { | |
| 1535 // We want to conservatively collect somewhat early in order | |
| 1536 // to try and "bootstrap" our CMS/promotion statistics; | |
| 1537 // this branch will not fire after the first successful CMS | |
| 1538 // collection because the stats should then be valid. | |
| 1539 if (_cmsGen->occupancy() >= _bootstrap_occupancy) { | |
| 1540 if (Verbose && PrintGCDetails) { | |
| 1541 gclog_or_tty->print_cr( | |
| 1542 " CMSCollector: collect for bootstrapping statistics:" | |
| 1543 " occupancy = %f, boot occupancy = %f", _cmsGen->occupancy(), | |
| 1544 _bootstrap_occupancy); | |
| 1545 } | |
| 1546 return true; | |
| 1547 } | |
| 1548 } | |
| 1549 } | |
| 1550 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1551 // Otherwise, we start a collection cycle if |
| 0 | 1552 // old gen want a collection cycle started. Each may use |
| 1553 // an appropriate criterion for making this decision. | |
| 1554 // XXX We need to make sure that the gen expansion | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1555 // criterion dovetails well with this. XXX NEED TO FIX THIS |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1556 if (_cmsGen->should_concurrent_collect()) { |
| 0 | 1557 if (Verbose && PrintGCDetails) { |
| 1558 gclog_or_tty->print_cr("CMS old gen initiated"); | |
| 1559 } | |
| 1560 return true; | |
| 1561 } | |
| 1562 | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1563 // We start a collection if we believe an incremental collection may fail; |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1564 // this is not likely to be productive in practice because it's probably too |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1565 // late anyway. |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1566 GenCollectedHeap* gch = GenCollectedHeap::heap(); |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1567 assert(gch->collector_policy()->is_two_generation_policy(), |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1568 "You may want to check the correctness of the following"); |
|
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
1569 if (gch->incremental_collection_will_fail(true /* consult_young */)) { |
|
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
1570 if (Verbose && PrintGCDetails) { |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1571 gclog_or_tty->print("CMSCollector: collect because incremental collection will fail "); |
| 0 | 1572 } |
| 1573 return true; | |
| 1574 } | |
| 1575 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1576 if (MetaspaceGC::should_concurrent_collect()) { |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1577 if (Verbose && PrintGCDetails) { |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1578 gclog_or_tty->print("CMSCollector: collect for metadata allocation "); |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1579 } |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1580 return true; |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1581 } |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1582 |
| 0 | 1583 return false; |
| 1584 } | |
| 1585 | |
|
10244
06ab37f08701
8013184: CMS: Call reset_after_compaction() only if a compaction has been done
jmasa
parents:
10243
diff
changeset
|
1586 void CMSCollector::set_did_compact(bool v) { _cmsGen->set_did_compact(v); } |
|
06ab37f08701
8013184: CMS: Call reset_after_compaction() only if a compaction has been done
jmasa
parents:
10243
diff
changeset
|
1587 |
| 0 | 1588 // Clear _expansion_cause fields of constituent generations |
| 1589 void CMSCollector::clear_expansion_cause() { | |
| 1590 _cmsGen->clear_expansion_cause(); | |
| 1591 } | |
| 1592 | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1593 // We should be conservative in starting a collection cycle. To |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1594 // start too eagerly runs the risk of collecting too often in the |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1595 // extreme. To collect too rarely falls back on full collections, |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1596 // which works, even if not optimum in terms of concurrent work. |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1597 // As a work around for too eagerly collecting, use the flag |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1598 // UseCMSInitiatingOccupancyOnly. This also has the advantage of |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1599 // giving the user an easily understandable way of controlling the |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1600 // collections. |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1601 // We want to start a new collection cycle if any of the following |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1602 // conditions hold: |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1603 // . our current occupancy exceeds the configured initiating occupancy |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1604 // for this generation, or |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1605 // . we recently needed to expand this space and have not, since that |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1606 // expansion, done a collection of this generation, or |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1607 // . the underlying space believes that it may be a good idea to initiate |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1608 // a concurrent collection (this may be based on criteria such as the |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1609 // following: the space uses linear allocation and linear allocation is |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1610 // going to fail, or there is believed to be excessive fragmentation in |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1611 // the generation, etc... or ... |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1612 // [.(currently done by CMSCollector::shouldConcurrentCollect() only for |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1613 // the case of the old generation; see CR 6543076): |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1614 // we may be approaching a point at which allocation requests may fail because |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1615 // we will be out of sufficient free space given allocation rate estimates.] |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1616 bool ConcurrentMarkSweepGeneration::should_concurrent_collect() const { |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1617 |
| 0 | 1618 assert_lock_strong(freelistLock()); |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1619 if (occupancy() > initiating_occupancy()) { |
| 0 | 1620 if (PrintGCDetails && Verbose) { |
| 1621 gclog_or_tty->print(" %s: collect because of occupancy %f / %f ", | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1622 short_name(), occupancy(), initiating_occupancy()); |
| 0 | 1623 } |
| 1624 return true; | |
| 1625 } | |
| 1626 if (UseCMSInitiatingOccupancyOnly) { | |
| 1627 return false; | |
| 1628 } | |
| 1629 if (expansion_cause() == CMSExpansionCause::_satisfy_allocation) { | |
| 1630 if (PrintGCDetails && Verbose) { | |
| 1631 gclog_or_tty->print(" %s: collect because expanded for allocation ", | |
| 1632 short_name()); | |
| 1633 } | |
| 1634 return true; | |
| 1635 } | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1636 if (_cmsSpace->should_concurrent_collect()) { |
| 0 | 1637 if (PrintGCDetails && Verbose) { |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
1638 gclog_or_tty->print(" %s: collect because cmsSpace says so ", |
| 0 | 1639 short_name()); |
| 1640 } | |
| 1641 return true; | |
| 1642 } | |
| 1643 return false; | |
| 1644 } | |
| 1645 | |
| 1646 void ConcurrentMarkSweepGeneration::collect(bool full, | |
| 1647 bool clear_all_soft_refs, | |
| 1648 size_t size, | |
| 1649 bool tlab) | |
| 1650 { | |
| 1651 collector()->collect(full, clear_all_soft_refs, size, tlab); | |
| 1652 } | |
| 1653 | |
| 1654 void CMSCollector::collect(bool full, | |
| 1655 bool clear_all_soft_refs, | |
| 1656 size_t size, | |
| 1657 bool tlab) | |
| 1658 { | |
| 1659 if (!UseCMSCollectionPassing && _collectorState > Idling) { | |
| 1660 // For debugging purposes skip the collection if the state | |
| 1661 // is not currently idle | |
| 1662 if (TraceCMSState) { | |
| 1663 gclog_or_tty->print_cr("Thread " INTPTR_FORMAT " skipped full:%d CMS state %d", | |
| 1664 Thread::current(), full, _collectorState); | |
| 1665 } | |
| 1666 return; | |
| 1667 } | |
| 1668 | |
| 1669 // The following "if" branch is present for defensive reasons. | |
| 1670 // In the current uses of this interface, it can be replaced with: | |
| 1671 // assert(!GC_locker.is_active(), "Can't be called otherwise"); | |
| 1672 // But I am not placing that assert here to allow future | |
| 1673 // generality in invoking this interface. | |
| 1674 if (GC_locker::is_active()) { | |
| 1675 // A consistency test for GC_locker | |
| 1676 assert(GC_locker::needs_gc(), "Should have been set already"); | |
| 1677 // Skip this foreground collection, instead | |
| 1678 // expanding the heap if necessary. | |
| 1679 // Need the free list locks for the call to free() in compute_new_size() | |
| 1680 compute_new_size(); | |
| 1681 return; | |
| 1682 } | |
| 1683 acquire_control_and_collect(full, clear_all_soft_refs); | |
| 1684 _full_gcs_since_conc_gc++; | |
| 1685 } | |
| 1686 | |
| 10405 | 1687 void CMSCollector::request_full_gc(unsigned int full_gc_count, GCCause::Cause cause) { |
| 0 | 1688 GenCollectedHeap* gch = GenCollectedHeap::heap(); |
| 1689 unsigned int gc_count = gch->total_full_collections(); | |
| 1690 if (gc_count == full_gc_count) { | |
| 1691 MutexLockerEx y(CGC_lock, Mutex::_no_safepoint_check_flag); | |
| 1692 _full_gc_requested = true; | |
| 10405 | 1693 _full_gc_cause = cause; |
| 0 | 1694 CGC_lock->notify(); // nudge CMS thread |
|
2365
a181f3a124dd
6987703: iCMS: Intermittent hang with gc/gctests/CallGC/CallGC01 and +ExplicitGCInvokesConcurrent
ysr
parents:
2226
diff
changeset
|
1695 } else { |
|
a181f3a124dd
6987703: iCMS: Intermittent hang with gc/gctests/CallGC/CallGC01 and +ExplicitGCInvokesConcurrent
ysr
parents:
2226
diff
changeset
|
1696 assert(gc_count > full_gc_count, "Error: causal loop"); |
| 0 | 1697 } |
| 1698 } | |
| 1699 | |
| 10405 | 1700 bool CMSCollector::is_external_interruption() { |
| 1701 GCCause::Cause cause = GenCollectedHeap::heap()->gc_cause(); | |
| 1702 return GCCause::is_user_requested_gc(cause) || | |
| 1703 GCCause::is_serviceability_requested_gc(cause); | |
| 1704 } | |
| 1705 | |
| 1706 void CMSCollector::report_concurrent_mode_interruption() { | |
| 1707 if (is_external_interruption()) { | |
| 1708 if (PrintGCDetails) { | |
| 1709 gclog_or_tty->print(" (concurrent mode interrupted)"); | |
| 1710 } | |
| 1711 } else { | |
| 1712 if (PrintGCDetails) { | |
| 1713 gclog_or_tty->print(" (concurrent mode failure)"); | |
| 1714 } | |
| 1715 _gc_tracer_cm->report_concurrent_mode_failure(); | |
| 1716 } | |
| 1717 } | |
| 1718 | |
| 0 | 1719 |
| 1720 // The foreground and background collectors need to coordinate in order | |
| 1721 // to make sure that they do not mutually interfere with CMS collections. | |
| 1722 // When a background collection is active, | |
| 1723 // the foreground collector may need to take over (preempt) and | |
| 1724 // synchronously complete an ongoing collection. Depending on the | |
| 1725 // frequency of the background collections and the heap usage | |
| 1726 // of the application, this preemption can be seldom or frequent. | |
| 1727 // There are only certain | |
| 1728 // points in the background collection that the "collection-baton" | |
| 1729 // can be passed to the foreground collector. | |
| 1730 // | |
| 1731 // The foreground collector will wait for the baton before | |
| 1732 // starting any part of the collection. The foreground collector | |
| 1733 // will only wait at one location. | |
| 1734 // | |
| 1735 // The background collector will yield the baton before starting a new | |
| 1736 // phase of the collection (e.g., before initial marking, marking from roots, | |
| 1737 // precleaning, final re-mark, sweep etc.) This is normally done at the head | |
| 1738 // of the loop which switches the phases. The background collector does some | |
| 1739 // of the phases (initial mark, final re-mark) with the world stopped. | |
| 1740 // Because of locking involved in stopping the world, | |
| 1741 // the foreground collector should not block waiting for the background | |
| 1742 // collector when it is doing a stop-the-world phase. The background | |
| 1743 // collector will yield the baton at an additional point just before | |
| 1744 // it enters a stop-the-world phase. Once the world is stopped, the | |
| 1745 // background collector checks the phase of the collection. If the | |
| 1746 // phase has not changed, it proceeds with the collection. If the | |
| 1747 // phase has changed, it skips that phase of the collection. See | |
| 1748 // the comments on the use of the Heap_lock in collect_in_background(). | |
| 1749 // | |
| 1750 // Variable used in baton passing. | |
| 1751 // _foregroundGCIsActive - Set to true by the foreground collector when | |
| 1752 // it wants the baton. The foreground clears it when it has finished | |
| 1753 // the collection. | |
| 1754 // _foregroundGCShouldWait - Set to true by the background collector | |
| 1755 // when it is running. The foreground collector waits while | |
| 1756 // _foregroundGCShouldWait is true. | |
| 1757 // CGC_lock - monitor used to protect access to the above variables | |
| 1758 // and to notify the foreground and background collectors. | |
| 1759 // _collectorState - current state of the CMS collection. | |
| 1760 // | |
| 1761 // The foreground collector | |
| 1762 // acquires the CGC_lock | |
| 1763 // sets _foregroundGCIsActive | |
| 1764 // waits on the CGC_lock for _foregroundGCShouldWait to be false | |
| 1765 // various locks acquired in preparation for the collection | |
| 1766 // are released so as not to block the background collector | |
| 1767 // that is in the midst of a collection | |
| 1768 // proceeds with the collection | |
| 1769 // clears _foregroundGCIsActive | |
| 1770 // returns | |
| 1771 // | |
| 1772 // The background collector in a loop iterating on the phases of the | |
| 1773 // collection | |
| 1774 // acquires the CGC_lock | |
| 1775 // sets _foregroundGCShouldWait | |
| 1776 // if _foregroundGCIsActive is set | |
| 1777 // clears _foregroundGCShouldWait, notifies _CGC_lock | |
| 1778 // waits on _CGC_lock for _foregroundGCIsActive to become false | |
| 1779 // and exits the loop. | |
| 1780 // otherwise | |
| 1781 // proceed with that phase of the collection | |
| 1782 // if the phase is a stop-the-world phase, | |
| 1783 // yield the baton once more just before enqueueing | |
| 1784 // the stop-world CMS operation (executed by the VM thread). | |
| 1785 // returns after all phases of the collection are done | |
| 1786 // | |
| 1787 | |
| 1788 void CMSCollector::acquire_control_and_collect(bool full, | |
| 1789 bool clear_all_soft_refs) { | |
| 1790 assert(SafepointSynchronize::is_at_safepoint(), "should be at safepoint"); | |
| 1791 assert(!Thread::current()->is_ConcurrentGC_thread(), | |
| 1792 "shouldn't try to acquire control from self!"); | |
| 1793 | |
| 1794 // Start the protocol for acquiring control of the | |
| 1795 // collection from the background collector (aka CMS thread). | |
| 1796 assert(ConcurrentMarkSweepThread::vm_thread_has_cms_token(), | |
| 1797 "VM thread should have CMS token"); | |
| 1798 // Remember the possibly interrupted state of an ongoing | |
| 1799 // concurrent collection | |
| 1800 CollectorState first_state = _collectorState; | |
| 1801 | |
| 1802 // Signal to a possibly ongoing concurrent collection that | |
| 1803 // we want to do a foreground collection. | |
| 1804 _foregroundGCIsActive = true; | |
| 1805 | |
| 1806 // Disable incremental mode during a foreground collection. | |
| 1807 ICMSDisabler icms_disabler; | |
| 1808 | |
| 1809 // release locks and wait for a notify from the background collector | |
| 1810 // releasing the locks in only necessary for phases which | |
| 1811 // do yields to improve the granularity of the collection. | |
| 1812 assert_lock_strong(bitMapLock()); | |
| 1813 // We need to lock the Free list lock for the space that we are | |
| 1814 // currently collecting. | |
| 1815 assert(haveFreelistLocks(), "Must be holding free list locks"); | |
| 1816 bitMapLock()->unlock(); | |
| 1817 releaseFreelistLocks(); | |
| 1818 { | |
| 1819 MutexLockerEx x(CGC_lock, Mutex::_no_safepoint_check_flag); | |
| 1820 if (_foregroundGCShouldWait) { | |
| 1821 // We are going to be waiting for action for the CMS thread; | |
| 1822 // it had better not be gone (for instance at shutdown)! | |
| 1823 assert(ConcurrentMarkSweepThread::cmst() != NULL, | |
| 1824 "CMS thread must be running"); | |
| 1825 // Wait here until the background collector gives us the go-ahead | |
| 1826 ConcurrentMarkSweepThread::clear_CMS_flag( | |
| 1827 ConcurrentMarkSweepThread::CMS_vm_has_token); // release token | |
| 1828 // Get a possibly blocked CMS thread going: | |
| 1829 // Note that we set _foregroundGCIsActive true above, | |
| 1830 // without protection of the CGC_lock. | |
| 1831 CGC_lock->notify(); | |
| 1832 assert(!ConcurrentMarkSweepThread::vm_thread_wants_cms_token(), | |
| 1833 "Possible deadlock"); | |
| 1834 while (_foregroundGCShouldWait) { | |
| 1835 // wait for notification | |
| 1836 CGC_lock->wait(Mutex::_no_safepoint_check_flag); | |
| 1837 // Possibility of delay/starvation here, since CMS token does | |
| 1838 // not know to give priority to VM thread? Actually, i think | |
| 1839 // there wouldn't be any delay/starvation, but the proof of | |
| 1840 // that "fact" (?) appears non-trivial. XXX 20011219YSR | |
| 1841 } | |
| 1842 ConcurrentMarkSweepThread::set_CMS_flag( | |
| 1843 ConcurrentMarkSweepThread::CMS_vm_has_token); | |
| 1844 } | |
| 1845 } | |
| 1846 // The CMS_token is already held. Get back the other locks. | |
| 1847 assert(ConcurrentMarkSweepThread::vm_thread_has_cms_token(), | |
| 1848 "VM thread should have CMS token"); | |
| 1849 getFreelistLocks(); | |
| 1850 bitMapLock()->lock_without_safepoint_check(); | |
| 1851 if (TraceCMSState) { | |
| 1852 gclog_or_tty->print_cr("CMS foreground collector has asked for control " | |
| 1853 INTPTR_FORMAT " with first state %d", Thread::current(), first_state); | |
| 1854 gclog_or_tty->print_cr(" gets control with state %d", _collectorState); | |
| 1855 } | |
| 1856 | |
| 1857 // Check if we need to do a compaction, or if not, whether | |
| 1858 // we need to start the mark-sweep from scratch. | |
| 1859 bool should_compact = false; | |
| 1860 bool should_start_over = false; | |
| 1861 decide_foreground_collection_type(clear_all_soft_refs, | |
| 1862 &should_compact, &should_start_over); | |
| 1863 | |
| 1864 NOT_PRODUCT( | |
| 1865 if (RotateCMSCollectionTypes) { | |
| 1866 if (_cmsGen->debug_collection_type() == | |
| 1867 ConcurrentMarkSweepGeneration::MSC_foreground_collection_type) { | |
| 1868 should_compact = true; | |
| 1869 } else if (_cmsGen->debug_collection_type() == | |
| 1870 ConcurrentMarkSweepGeneration::MS_foreground_collection_type) { | |
| 1871 should_compact = false; | |
| 1872 } | |
| 1873 } | |
| 1874 ) | |
| 1875 | |
| 10405 | 1876 if (first_state > Idling) { |
| 1877 report_concurrent_mode_interruption(); | |
| 0 | 1878 } |
| 1879 | |
|
10244
06ab37f08701
8013184: CMS: Call reset_after_compaction() only if a compaction has been done
jmasa
parents:
10243
diff
changeset
|
1880 set_did_compact(should_compact); |
| 0 | 1881 if (should_compact) { |
| 1882 // If the collection is being acquired from the background | |
| 1883 // collector, there may be references on the discovered | |
| 1884 // references lists that have NULL referents (being those | |
| 1885 // that were concurrently cleared by a mutator) or | |
| 1886 // that are no longer active (having been enqueued concurrently | |
| 1887 // by the mutator). | |
| 1888 // Scrub the list of those references because Mark-Sweep-Compact | |
| 1889 // code assumes referents are not NULL and that all discovered | |
| 1890 // Reference objects are active. | |
| 1891 ref_processor()->clean_up_discovered_references(); | |
| 1892 | |
| 10405 | 1893 if (first_state > Idling) { |
| 1894 save_heap_summary(); | |
| 1895 } | |
| 1896 | |
| 0 | 1897 do_compaction_work(clear_all_soft_refs); |
| 1898 | |
| 1899 // Has the GC time limit been exceeded? | |
|
1387
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1900 DefNewGeneration* young_gen = _young_gen->as_DefNewGeneration(); |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1901 size_t max_eden_size = young_gen->max_capacity() - |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1902 young_gen->to()->capacity() - |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1903 young_gen->from()->capacity(); |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1904 GenCollectedHeap* gch = GenCollectedHeap::heap(); |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1905 GCCause::Cause gc_cause = gch->gc_cause(); |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1906 size_policy()->check_gc_overhead_limit(_young_gen->used(), |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1907 young_gen->eden()->used(), |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1908 _cmsGen->max_capacity(), |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1909 max_eden_size, |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1910 full, |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1911 gc_cause, |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
1912 gch->collector_policy()); |
| 0 | 1913 } else { |
| 1914 do_mark_sweep_work(clear_all_soft_refs, first_state, | |
| 1915 should_start_over); | |
| 1916 } | |
| 1917 // Reset the expansion cause, now that we just completed | |
| 1918 // a collection cycle. | |
| 1919 clear_expansion_cause(); | |
| 1920 _foregroundGCIsActive = false; | |
| 1921 return; | |
| 1922 } | |
| 1923 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1924 // Resize the tenured generation |
| 0 | 1925 // after obtaining the free list locks for the |
| 1926 // two generations. | |
| 1927 void CMSCollector::compute_new_size() { | |
| 1928 assert_locked_or_safepoint(Heap_lock); | |
| 1929 FreelistLocker z(this); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
1930 MetaspaceGC::compute_new_size(); |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
1931 _cmsGen->compute_new_size_free_list(); |
| 0 | 1932 } |
| 1933 | |
| 1934 // A work method used by foreground collection to determine | |
| 1935 // what type of collection (compacting or not, continuing or fresh) | |
| 1936 // it should do. | |
| 1937 // NOTE: the intent is to make UseCMSCompactAtFullCollection | |
| 1938 // and CMSCompactWhenClearAllSoftRefs the default in the future | |
| 1939 // and do away with the flags after a suitable period. | |
| 1940 void CMSCollector::decide_foreground_collection_type( | |
| 1941 bool clear_all_soft_refs, bool* should_compact, | |
| 1942 bool* should_start_over) { | |
| 1943 // Normally, we'll compact only if the UseCMSCompactAtFullCollection | |
| 1944 // flag is set, and we have either requested a System.gc() or | |
| 1945 // the number of full gc's since the last concurrent cycle | |
| 1946 // has exceeded the threshold set by CMSFullGCsBeforeCompaction, | |
| 1947 // or if an incremental collection has failed | |
| 1948 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 1949 assert(gch->collector_policy()->is_two_generation_policy(), | |
| 1950 "You may want to check the correctness of the following"); | |
| 1951 // Inform cms gen if this was due to partial collection failing. | |
| 1952 // The CMS gen may use this fact to determine its expansion policy. | |
|
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
1953 if (gch->incremental_collection_will_fail(false /* don't consult_young */)) { |
| 0 | 1954 assert(!_cmsGen->incremental_collection_failed(), |
| 1955 "Should have been noticed, reacted to and cleared"); | |
| 1956 _cmsGen->set_incremental_collection_failed(); | |
| 1957 } | |
| 1958 *should_compact = | |
| 1959 UseCMSCompactAtFullCollection && | |
| 1960 ((_full_gcs_since_conc_gc >= CMSFullGCsBeforeCompaction) || | |
| 1961 GCCause::is_user_requested_gc(gch->gc_cause()) || | |
|
1994
6cd6d394f280
7001033: assert(gch->gc_cause() == GCCause::_scavenge_alot || !gch->incremental_collection_failed())
ysr
parents:
1972
diff
changeset
|
1962 gch->incremental_collection_will_fail(true /* consult_young */)); |
| 0 | 1963 *should_start_over = false; |
| 1964 if (clear_all_soft_refs && !*should_compact) { | |
| 1965 // We are about to do a last ditch collection attempt | |
| 1966 // so it would normally make sense to do a compaction | |
| 1967 // to reclaim as much space as possible. | |
| 1968 if (CMSCompactWhenClearAllSoftRefs) { | |
| 1969 // Default: The rationale is that in this case either | |
| 1970 // we are past the final marking phase, in which case | |
| 1971 // we'd have to start over, or so little has been done | |
| 1972 // that there's little point in saving that work. Compaction | |
| 1973 // appears to be the sensible choice in either case. | |
| 1974 *should_compact = true; | |
| 1975 } else { | |
| 1976 // We have been asked to clear all soft refs, but not to | |
| 1977 // compact. Make sure that we aren't past the final checkpoint | |
| 1978 // phase, for that is where we process soft refs. If we are already | |
| 1979 // past that phase, we'll need to redo the refs discovery phase and | |
| 1980 // if necessary clear soft refs that weren't previously | |
| 1981 // cleared. We do so by remembering the phase in which | |
| 1982 // we came in, and if we are past the refs processing | |
| 1983 // phase, we'll choose to just redo the mark-sweep | |
| 1984 // collection from scratch. | |
| 1985 if (_collectorState > FinalMarking) { | |
| 1986 // We are past the refs processing phase; | |
| 1987 // start over and do a fresh synchronous CMS cycle | |
| 1988 _collectorState = Resetting; // skip to reset to start new cycle | |
| 1989 reset(false /* == !asynch */); | |
| 1990 *should_start_over = true; | |
| 1991 } // else we can continue a possibly ongoing current cycle | |
| 1992 } | |
| 1993 } | |
| 1994 } | |
| 1995 | |
| 1996 // A work method used by the foreground collector to do | |
| 1997 // a mark-sweep-compact. | |
| 1998 void CMSCollector::do_compaction_work(bool clear_all_soft_refs) { | |
| 1999 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 10405 | 2000 |
| 2001 STWGCTimer* gc_timer = GenMarkSweep::gc_timer(); | |
| 2002 gc_timer->register_gc_start(os::elapsed_counter()); | |
| 2003 | |
| 2004 SerialOldTracer* gc_tracer = GenMarkSweep::gc_tracer(); | |
| 2005 gc_tracer->report_gc_start(gch->gc_cause(), gc_timer->gc_start()); | |
| 2006 | |
| 2007 GCTraceTime t("CMS:MSC ", PrintGCDetails && Verbose, true, NULL); | |
| 0 | 2008 if (PrintGC && Verbose && !(GCCause::is_user_requested_gc(gch->gc_cause()))) { |
| 2009 gclog_or_tty->print_cr("Compact ConcurrentMarkSweepGeneration after %d " | |
| 2010 "collections passed to foreground collector", _full_gcs_since_conc_gc); | |
| 2011 } | |
| 2012 | |
| 2013 // Sample collection interval time and reset for collection pause. | |
| 2014 if (UseAdaptiveSizePolicy) { | |
| 2015 size_policy()->msc_collection_begin(); | |
| 2016 } | |
| 2017 | |
| 2018 // Temporarily widen the span of the weak reference processing to | |
| 2019 // the entire heap. | |
| 2020 MemRegion new_span(GenCollectedHeap::heap()->reserved_region()); | |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
2021 ReferenceProcessorSpanMutator rp_mut_span(ref_processor(), new_span); |
| 0 | 2022 // Temporarily, clear the "is_alive_non_header" field of the |
| 2023 // reference processor. | |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
2024 ReferenceProcessorIsAliveMutator rp_mut_closure(ref_processor(), NULL); |
| 0 | 2025 // Temporarily make reference _processing_ single threaded (non-MT). |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
2026 ReferenceProcessorMTProcMutator rp_mut_mt_processing(ref_processor(), false); |
| 0 | 2027 // Temporarily make refs discovery atomic |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
2028 ReferenceProcessorAtomicMutator rp_mut_atomic(ref_processor(), true); |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
2029 // Temporarily make reference _discovery_ single threaded (non-MT) |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
2030 ReferenceProcessorMTDiscoveryMutator rp_mut_discovery(ref_processor(), false); |
| 0 | 2031 |
| 2032 ref_processor()->set_enqueuing_is_done(false); | |
|
3979
4dfb2df418f2
6484982: G1: process references during evacuation pauses
johnc
parents:
3827
diff
changeset
|
2033 ref_processor()->enable_discovery(false /*verify_disabled*/, false /*check_no_refs*/); |
|
457
27a80744a83b
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
453
diff
changeset
|
2034 ref_processor()->setup_policy(clear_all_soft_refs); |
| 0 | 2035 // If an asynchronous collection finishes, the _modUnionTable is |
| 2036 // all clear. If we are assuming the collection from an asynchronous | |
| 2037 // collection, clear the _modUnionTable. | |
| 2038 assert(_collectorState != Idling || _modUnionTable.isAllClear(), | |
| 2039 "_modUnionTable should be clear if the baton was not passed"); | |
| 2040 _modUnionTable.clear_all(); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2041 assert(_collectorState != Idling || _ct->klass_rem_set()->mod_union_is_clear(), |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2042 "mod union for klasses should be clear if the baton was passed"); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2043 _ct->klass_rem_set()->clear_mod_union(); |
| 0 | 2044 |
| 2045 // We must adjust the allocation statistics being maintained | |
| 2046 // in the free list space. We do so by reading and clearing | |
| 2047 // the sweep timer and updating the block flux rate estimates below. | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2048 assert(!_intra_sweep_timer.is_active(), "_intra_sweep_timer should be inactive"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2049 if (_inter_sweep_timer.is_active()) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2050 _inter_sweep_timer.stop(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2051 // Note that we do not use this sample to update the _inter_sweep_estimate. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2052 _cmsGen->cmsSpace()->beginSweepFLCensus((float)(_inter_sweep_timer.seconds()), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2053 _inter_sweep_estimate.padded_average(), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2054 _intra_sweep_estimate.padded_average()); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2055 } |
| 0 | 2056 |
| 2057 GenMarkSweep::invoke_at_safepoint(_cmsGen->level(), | |
| 2058 ref_processor(), clear_all_soft_refs); | |
| 2059 #ifdef ASSERT | |
| 2060 CompactibleFreeListSpace* cms_space = _cmsGen->cmsSpace(); | |
| 2061 size_t free_size = cms_space->free(); | |
| 2062 assert(free_size == | |
| 2063 pointer_delta(cms_space->end(), cms_space->compaction_top()) | |
| 2064 * HeapWordSize, | |
| 2065 "All the free space should be compacted into one chunk at top"); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2066 assert(cms_space->dictionary()->total_chunk_size( |
| 0 | 2067 debug_only(cms_space->freelistLock())) == 0 || |
| 2068 cms_space->totalSizeInIndexedFreeLists() == 0, | |
| 2069 "All the free space should be in a single chunk"); | |
| 2070 size_t num = cms_space->totalCount(); | |
| 2071 assert((free_size == 0 && num == 0) || | |
| 2072 (free_size > 0 && (num == 1 || num == 2)), | |
| 2073 "There should be at most 2 free chunks after compaction"); | |
| 2074 #endif // ASSERT | |
| 2075 _collectorState = Resetting; | |
| 2076 assert(_restart_addr == NULL, | |
| 2077 "Should have been NULL'd before baton was passed"); | |
| 2078 reset(false /* == !asynch */); | |
| 2079 _cmsGen->reset_after_compaction(); | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
2080 _concurrent_cycles_since_last_unload = 0; |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
2081 |
| 0 | 2082 // Clear any data recorded in the PLAB chunk arrays. |
| 2083 if (_survivor_plab_array != NULL) { | |
| 2084 reset_survivor_plab_arrays(); | |
| 2085 } | |
| 2086 | |
| 2087 // Adjust the per-size allocation stats for the next epoch. | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2088 _cmsGen->cmsSpace()->endSweepFLCensus(sweep_count() /* fake */); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2089 // Restart the "inter sweep timer" for the next epoch. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2090 _inter_sweep_timer.reset(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2091 _inter_sweep_timer.start(); |
| 0 | 2092 |
| 2093 // Sample collection pause time and reset for collection interval. | |
| 2094 if (UseAdaptiveSizePolicy) { | |
| 2095 size_policy()->msc_collection_end(gch->gc_cause()); | |
| 2096 } | |
| 2097 | |
| 10405 | 2098 gc_timer->register_gc_end(os::elapsed_counter()); |
| 2099 | |
| 2100 gc_tracer->report_gc_end(gc_timer->gc_end(), gc_timer->time_partitions()); | |
| 2101 | |
| 0 | 2102 // For a mark-sweep-compact, compute_new_size() will be called |
| 2103 // in the heap's do_collection() method. | |
| 2104 } | |
| 2105 | |
| 2106 // A work method used by the foreground collector to do | |
| 2107 // a mark-sweep, after taking over from a possibly on-going | |
| 2108 // concurrent mark-sweep collection. | |
| 2109 void CMSCollector::do_mark_sweep_work(bool clear_all_soft_refs, | |
| 2110 CollectorState first_state, bool should_start_over) { | |
| 2111 if (PrintGC && Verbose) { | |
| 2112 gclog_or_tty->print_cr("Pass concurrent collection to foreground " | |
| 2113 "collector with count %d", | |
| 2114 _full_gcs_since_conc_gc); | |
| 2115 } | |
| 2116 switch (_collectorState) { | |
| 2117 case Idling: | |
| 2118 if (first_state == Idling || should_start_over) { | |
| 2119 // The background GC was not active, or should | |
| 2120 // restarted from scratch; start the cycle. | |
| 2121 _collectorState = InitialMarking; | |
| 2122 } | |
| 2123 // If first_state was not Idling, then a background GC | |
| 2124 // was in progress and has now finished. No need to do it | |
| 2125 // again. Leave the state as Idling. | |
| 2126 break; | |
| 2127 case Precleaning: | |
| 2128 // In the foreground case don't do the precleaning since | |
| 2129 // it is not done concurrently and there is extra work | |
| 2130 // required. | |
| 2131 _collectorState = FinalMarking; | |
| 2132 } | |
| 10405 | 2133 collect_in_foreground(clear_all_soft_refs, GenCollectedHeap::heap()->gc_cause()); |
| 0 | 2134 |
| 2135 // For a mark-sweep, compute_new_size() will be called | |
| 2136 // in the heap's do_collection() method. | |
| 2137 } | |
| 2138 | |
| 2139 | |
| 2140 void CMSCollector::getFreelistLocks() const { | |
| 2141 // Get locks for all free lists in all generations that this | |
| 2142 // collector is responsible for | |
| 2143 _cmsGen->freelistLock()->lock_without_safepoint_check(); | |
| 2144 } | |
| 2145 | |
| 2146 void CMSCollector::releaseFreelistLocks() const { | |
| 2147 // Release locks for all free lists in all generations that this | |
| 2148 // collector is responsible for | |
| 2149 _cmsGen->freelistLock()->unlock(); | |
| 2150 } | |
| 2151 | |
| 2152 bool CMSCollector::haveFreelistLocks() const { | |
| 2153 // Check locks for all free lists in all generations that this | |
| 2154 // collector is responsible for | |
| 2155 assert_lock_strong(_cmsGen->freelistLock()); | |
| 2156 PRODUCT_ONLY(ShouldNotReachHere()); | |
| 2157 return true; | |
| 2158 } | |
| 2159 | |
| 2160 // A utility class that is used by the CMS collector to | |
| 2161 // temporarily "release" the foreground collector from its | |
| 2162 // usual obligation to wait for the background collector to | |
| 2163 // complete an ongoing phase before proceeding. | |
| 2164 class ReleaseForegroundGC: public StackObj { | |
| 2165 private: | |
| 2166 CMSCollector* _c; | |
| 2167 public: | |
| 2168 ReleaseForegroundGC(CMSCollector* c) : _c(c) { | |
| 2169 assert(_c->_foregroundGCShouldWait, "Else should not need to call"); | |
| 2170 MutexLockerEx x(CGC_lock, Mutex::_no_safepoint_check_flag); | |
| 2171 // allow a potentially blocked foreground collector to proceed | |
| 2172 _c->_foregroundGCShouldWait = false; | |
| 2173 if (_c->_foregroundGCIsActive) { | |
| 2174 CGC_lock->notify(); | |
| 2175 } | |
| 2176 assert(!ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 2177 "Possible deadlock"); | |
| 2178 } | |
| 2179 | |
| 2180 ~ReleaseForegroundGC() { | |
| 2181 assert(!_c->_foregroundGCShouldWait, "Usage protocol violation?"); | |
| 2182 MutexLockerEx x(CGC_lock, Mutex::_no_safepoint_check_flag); | |
| 2183 _c->_foregroundGCShouldWait = true; | |
| 2184 } | |
| 2185 }; | |
| 2186 | |
| 2187 // There are separate collect_in_background and collect_in_foreground because of | |
| 2188 // the different locking requirements of the background collector and the | |
| 2189 // foreground collector. There was originally an attempt to share | |
| 2190 // one "collect" method between the background collector and the foreground | |
| 2191 // collector but the if-then-else required made it cleaner to have | |
| 2192 // separate methods. | |
| 10405 | 2193 void CMSCollector::collect_in_background(bool clear_all_soft_refs, GCCause::Cause cause) { |
| 0 | 2194 assert(Thread::current()->is_ConcurrentGC_thread(), |
| 2195 "A CMS asynchronous collection is only allowed on a CMS thread."); | |
| 2196 | |
| 2197 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 2198 { | |
| 2199 bool safepoint_check = Mutex::_no_safepoint_check_flag; | |
| 2200 MutexLockerEx hl(Heap_lock, safepoint_check); | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
2201 FreelistLocker fll(this); |
| 0 | 2202 MutexLockerEx x(CGC_lock, safepoint_check); |
| 2203 if (_foregroundGCIsActive || !UseAsyncConcMarkSweepGC) { | |
| 2204 // The foreground collector is active or we're | |
| 2205 // not using asynchronous collections. Skip this | |
| 2206 // background collection. | |
| 2207 assert(!_foregroundGCShouldWait, "Should be clear"); | |
| 2208 return; | |
| 2209 } else { | |
| 2210 assert(_collectorState == Idling, "Should be idling before start."); | |
| 2211 _collectorState = InitialMarking; | |
| 10405 | 2212 register_gc_start(cause); |
| 0 | 2213 // Reset the expansion cause, now that we are about to begin |
| 2214 // a new cycle. | |
| 2215 clear_expansion_cause(); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2216 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2217 // Clear the MetaspaceGC flag since a concurrent collection |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2218 // is starting but also clear it after the collection. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2219 MetaspaceGC::set_should_concurrent_collect(false); |
| 0 | 2220 } |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
2221 // Decide if we want to enable class unloading as part of the |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
2222 // ensuing concurrent GC cycle. |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
2223 update_should_unload_classes(); |
| 0 | 2224 _full_gc_requested = false; // acks all outstanding full gc requests |
| 10405 | 2225 _full_gc_cause = GCCause::_no_gc; |
| 0 | 2226 // Signal that we are about to start a collection |
| 2227 gch->increment_total_full_collections(); // ... starting a collection cycle | |
| 2228 _collection_count_start = gch->total_full_collections(); | |
| 2229 } | |
| 2230 | |
| 2231 // Used for PrintGC | |
| 2232 size_t prev_used; | |
| 2233 if (PrintGC && Verbose) { | |
| 2234 prev_used = _cmsGen->used(); // XXXPERM | |
| 2235 } | |
| 2236 | |
| 2237 // The change of the collection state is normally done at this level; | |
| 2238 // the exceptions are phases that are executed while the world is | |
| 2239 // stopped. For those phases the change of state is done while the | |
| 2240 // world is stopped. For baton passing purposes this allows the | |
| 2241 // background collector to finish the phase and change state atomically. | |
| 2242 // The foreground collector cannot wait on a phase that is done | |
| 2243 // while the world is stopped because the foreground collector already | |
| 2244 // has the world stopped and would deadlock. | |
| 2245 while (_collectorState != Idling) { | |
| 2246 if (TraceCMSState) { | |
| 2247 gclog_or_tty->print_cr("Thread " INTPTR_FORMAT " in CMS state %d", | |
| 2248 Thread::current(), _collectorState); | |
| 2249 } | |
| 2250 // The foreground collector | |
| 2251 // holds the Heap_lock throughout its collection. | |
| 2252 // holds the CMS token (but not the lock) | |
| 2253 // except while it is waiting for the background collector to yield. | |
| 2254 // | |
| 2255 // The foreground collector should be blocked (not for long) | |
| 2256 // if the background collector is about to start a phase | |
| 2257 // executed with world stopped. If the background | |
| 2258 // collector has already started such a phase, the | |
| 2259 // foreground collector is blocked waiting for the | |
| 2260 // Heap_lock. The stop-world phases (InitialMarking and FinalMarking) | |
| 2261 // are executed in the VM thread. | |
| 2262 // | |
| 2263 // The locking order is | |
| 2264 // PendingListLock (PLL) -- if applicable (FinalMarking) | |
| 2265 // Heap_lock (both this & PLL locked in VM_CMS_Operation::prologue()) | |
| 2266 // CMS token (claimed in | |
| 2267 // stop_world_and_do() --> | |
| 2268 // safepoint_synchronize() --> | |
| 2269 // CMSThread::synchronize()) | |
| 2270 | |
| 2271 { | |
| 2272 // Check if the FG collector wants us to yield. | |
| 2273 CMSTokenSync x(true); // is cms thread | |
| 2274 if (waitForForegroundGC()) { | |
| 2275 // We yielded to a foreground GC, nothing more to be | |
| 2276 // done this round. | |
| 2277 assert(_foregroundGCShouldWait == false, "We set it to false in " | |
| 2278 "waitForForegroundGC()"); | |
| 2279 if (TraceCMSState) { | |
| 2280 gclog_or_tty->print_cr("CMS Thread " INTPTR_FORMAT | |
| 2281 " exiting collection CMS state %d", | |
| 2282 Thread::current(), _collectorState); | |
| 2283 } | |
| 2284 return; | |
| 2285 } else { | |
| 2286 // The background collector can run but check to see if the | |
| 2287 // foreground collector has done a collection while the | |
| 2288 // background collector was waiting to get the CGC_lock | |
| 2289 // above. If yes, break so that _foregroundGCShouldWait | |
| 2290 // is cleared before returning. | |
| 2291 if (_collectorState == Idling) { | |
| 2292 break; | |
| 2293 } | |
| 2294 } | |
| 2295 } | |
| 2296 | |
| 2297 assert(_foregroundGCShouldWait, "Foreground collector, if active, " | |
| 2298 "should be waiting"); | |
| 2299 | |
| 2300 switch (_collectorState) { | |
| 2301 case InitialMarking: | |
| 2302 { | |
| 2303 ReleaseForegroundGC x(this); | |
| 2304 stats().record_cms_begin(); | |
| 2305 VM_CMS_Initial_Mark initial_mark_op(this); | |
| 2306 VMThread::execute(&initial_mark_op); | |
| 2307 } | |
| 2308 // The collector state may be any legal state at this point | |
| 2309 // since the background collector may have yielded to the | |
| 2310 // foreground collector. | |
| 2311 break; | |
| 2312 case Marking: | |
| 2313 // initial marking in checkpointRootsInitialWork has been completed | |
| 2314 if (markFromRoots(true)) { // we were successful | |
| 2315 assert(_collectorState == Precleaning, "Collector state should " | |
| 2316 "have changed"); | |
| 2317 } else { | |
| 2318 assert(_foregroundGCIsActive, "Internal state inconsistency"); | |
| 2319 } | |
| 2320 break; | |
| 2321 case Precleaning: | |
| 2322 if (UseAdaptiveSizePolicy) { | |
| 2323 size_policy()->concurrent_precleaning_begin(); | |
| 2324 } | |
| 2325 // marking from roots in markFromRoots has been completed | |
| 2326 preclean(); | |
| 2327 if (UseAdaptiveSizePolicy) { | |
| 2328 size_policy()->concurrent_precleaning_end(); | |
| 2329 } | |
| 2330 assert(_collectorState == AbortablePreclean || | |
| 2331 _collectorState == FinalMarking, | |
| 2332 "Collector state should have changed"); | |
| 2333 break; | |
| 2334 case AbortablePreclean: | |
| 2335 if (UseAdaptiveSizePolicy) { | |
| 2336 size_policy()->concurrent_phases_resume(); | |
| 2337 } | |
| 2338 abortable_preclean(); | |
| 2339 if (UseAdaptiveSizePolicy) { | |
| 2340 size_policy()->concurrent_precleaning_end(); | |
| 2341 } | |
| 2342 assert(_collectorState == FinalMarking, "Collector state should " | |
| 2343 "have changed"); | |
| 2344 break; | |
| 2345 case FinalMarking: | |
| 2346 { | |
| 2347 ReleaseForegroundGC x(this); | |
| 2348 | |
| 2349 VM_CMS_Final_Remark final_remark_op(this); | |
| 2350 VMThread::execute(&final_remark_op); | |
| 935 | 2351 } |
| 0 | 2352 assert(_foregroundGCShouldWait, "block post-condition"); |
| 2353 break; | |
| 2354 case Sweeping: | |
| 2355 if (UseAdaptiveSizePolicy) { | |
| 2356 size_policy()->concurrent_sweeping_begin(); | |
| 2357 } | |
| 2358 // final marking in checkpointRootsFinal has been completed | |
| 2359 sweep(true); | |
| 2360 assert(_collectorState == Resizing, "Collector state change " | |
| 2361 "to Resizing must be done under the free_list_lock"); | |
| 2362 _full_gcs_since_conc_gc = 0; | |
| 2363 | |
| 2364 // Stop the timers for adaptive size policy for the concurrent phases | |
| 2365 if (UseAdaptiveSizePolicy) { | |
| 2366 size_policy()->concurrent_sweeping_end(); | |
| 2367 size_policy()->concurrent_phases_end(gch->gc_cause(), | |
| 2368 gch->prev_gen(_cmsGen)->capacity(), | |
| 2369 _cmsGen->free()); | |
| 2370 } | |
| 2371 | |
| 2372 case Resizing: { | |
| 2373 // Sweeping has been completed... | |
| 2374 // At this point the background collection has completed. | |
| 2375 // Don't move the call to compute_new_size() down | |
| 2376 // into code that might be executed if the background | |
| 2377 // collection was preempted. | |
| 2378 { | |
| 2379 ReleaseForegroundGC x(this); // unblock FG collection | |
| 2380 MutexLockerEx y(Heap_lock, Mutex::_no_safepoint_check_flag); | |
| 2381 CMSTokenSync z(true); // not strictly needed. | |
| 2382 if (_collectorState == Resizing) { | |
| 2383 compute_new_size(); | |
| 10405 | 2384 save_heap_summary(); |
| 0 | 2385 _collectorState = Resetting; |
| 2386 } else { | |
| 2387 assert(_collectorState == Idling, "The state should only change" | |
| 2388 " because the foreground collector has finished the collection"); | |
| 2389 } | |
| 2390 } | |
| 2391 break; | |
| 2392 } | |
| 2393 case Resetting: | |
| 2394 // CMS heap resizing has been completed | |
| 2395 reset(true); | |
| 2396 assert(_collectorState == Idling, "Collector state should " | |
| 2397 "have changed"); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2398 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2399 MetaspaceGC::set_should_concurrent_collect(false); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2400 |
| 0 | 2401 stats().record_cms_end(); |
| 2402 // Don't move the concurrent_phases_end() and compute_new_size() | |
| 2403 // calls to here because a preempted background collection | |
| 2404 // has it's state set to "Resetting". | |
| 2405 break; | |
| 2406 case Idling: | |
| 2407 default: | |
| 2408 ShouldNotReachHere(); | |
| 2409 break; | |
| 2410 } | |
| 2411 if (TraceCMSState) { | |
| 2412 gclog_or_tty->print_cr(" Thread " INTPTR_FORMAT " done - next CMS state %d", | |
| 2413 Thread::current(), _collectorState); | |
| 2414 } | |
| 2415 assert(_foregroundGCShouldWait, "block post-condition"); | |
| 2416 } | |
| 2417 | |
| 2418 // Should this be in gc_epilogue? | |
| 2419 collector_policy()->counters()->update_counters(); | |
| 2420 | |
| 2421 { | |
| 2422 // Clear _foregroundGCShouldWait and, in the event that the | |
| 2423 // foreground collector is waiting, notify it, before | |
| 2424 // returning. | |
| 2425 MutexLockerEx x(CGC_lock, Mutex::_no_safepoint_check_flag); | |
| 2426 _foregroundGCShouldWait = false; | |
| 2427 if (_foregroundGCIsActive) { | |
| 2428 CGC_lock->notify(); | |
| 2429 } | |
| 2430 assert(!ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 2431 "Possible deadlock"); | |
| 2432 } | |
| 2433 if (TraceCMSState) { | |
| 2434 gclog_or_tty->print_cr("CMS Thread " INTPTR_FORMAT | |
| 2435 " exiting collection CMS state %d", | |
| 2436 Thread::current(), _collectorState); | |
| 2437 } | |
| 2438 if (PrintGC && Verbose) { | |
| 2439 _cmsGen->print_heap_change(prev_used); | |
| 2440 } | |
| 2441 } | |
| 2442 | |
| 10405 | 2443 void CMSCollector::register_foreground_gc_start(GCCause::Cause cause) { |
| 2444 if (!_cms_start_registered) { | |
| 2445 register_gc_start(cause); | |
| 2446 } | |
| 2447 } | |
| 2448 | |
| 2449 void CMSCollector::register_gc_start(GCCause::Cause cause) { | |
| 2450 _cms_start_registered = true; | |
| 2451 _gc_timer_cm->register_gc_start(os::elapsed_counter()); | |
| 2452 _gc_tracer_cm->report_gc_start(cause, _gc_timer_cm->gc_start()); | |
| 2453 } | |
| 2454 | |
| 2455 void CMSCollector::register_gc_end() { | |
| 2456 if (_cms_start_registered) { | |
| 2457 report_heap_summary(GCWhen::AfterGC); | |
| 2458 | |
| 2459 _gc_timer_cm->register_gc_end(os::elapsed_counter()); | |
| 2460 _gc_tracer_cm->report_gc_end(_gc_timer_cm->gc_end(), _gc_timer_cm->time_partitions()); | |
| 2461 _cms_start_registered = false; | |
| 2462 } | |
| 2463 } | |
| 2464 | |
| 2465 void CMSCollector::save_heap_summary() { | |
| 2466 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 2467 _last_heap_summary = gch->create_heap_summary(); | |
| 2468 _last_metaspace_summary = gch->create_metaspace_summary(); | |
| 2469 } | |
| 2470 | |
| 2471 void CMSCollector::report_heap_summary(GCWhen::Type when) { | |
| 2472 _gc_tracer_cm->report_gc_heap_summary(when, _last_heap_summary, _last_metaspace_summary); | |
| 2473 } | |
| 2474 | |
| 2475 void CMSCollector::collect_in_foreground(bool clear_all_soft_refs, GCCause::Cause cause) { | |
| 0 | 2476 assert(_foregroundGCIsActive && !_foregroundGCShouldWait, |
| 2477 "Foreground collector should be waiting, not executing"); | |
| 2478 assert(Thread::current()->is_VM_thread(), "A foreground collection" | |
| 2479 "may only be done by the VM Thread with the world stopped"); | |
| 2480 assert(ConcurrentMarkSweepThread::vm_thread_has_cms_token(), | |
| 2481 "VM thread should have CMS token"); | |
| 2482 | |
| 10405 | 2483 NOT_PRODUCT(GCTraceTime t("CMS:MS (foreground) ", PrintGCDetails && Verbose, |
| 2484 true, NULL);) | |
| 0 | 2485 if (UseAdaptiveSizePolicy) { |
| 2486 size_policy()->ms_collection_begin(); | |
| 2487 } | |
| 2488 COMPILER2_PRESENT(DerivedPointerTableDeactivate dpt_deact); | |
| 2489 | |
| 2490 HandleMark hm; // Discard invalid handles created during verification | |
| 2491 | |
| 2492 if (VerifyBeforeGC && | |
| 2493 GenCollectedHeap::heap()->total_collections() >= VerifyGCStartAt) { | |
|
6865
4202510ee0fe
8000831: Heap verification output incorrect/incomplete
johnc
parents:
6787
diff
changeset
|
2494 Universe::verify(); |
| 0 | 2495 } |
| 2496 | |
|
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
2497 // Snapshot the soft reference policy to be used in this collection cycle. |
|
457
27a80744a83b
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
453
diff
changeset
|
2498 ref_processor()->setup_policy(clear_all_soft_refs); |
|
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
2499 |
| 0 | 2500 bool init_mark_was_synchronous = false; // until proven otherwise |
| 2501 while (_collectorState != Idling) { | |
| 2502 if (TraceCMSState) { | |
| 2503 gclog_or_tty->print_cr("Thread " INTPTR_FORMAT " in CMS state %d", | |
| 2504 Thread::current(), _collectorState); | |
| 2505 } | |
| 2506 switch (_collectorState) { | |
| 2507 case InitialMarking: | |
| 10405 | 2508 register_foreground_gc_start(cause); |
| 0 | 2509 init_mark_was_synchronous = true; // fact to be exploited in re-mark |
| 2510 checkpointRootsInitial(false); | |
| 2511 assert(_collectorState == Marking, "Collector state should have changed" | |
| 2512 " within checkpointRootsInitial()"); | |
| 2513 break; | |
| 2514 case Marking: | |
| 2515 // initial marking in checkpointRootsInitialWork has been completed | |
| 2516 if (VerifyDuringGC && | |
| 2517 GenCollectedHeap::heap()->total_collections() >= VerifyGCStartAt) { | |
|
10186
b06ac540229e
8013132: Add a flag to turn off the output of the verbose verification code
stefank
parents:
10180
diff
changeset
|
2518 Universe::verify("Verify before initial mark: "); |
| 0 | 2519 } |
| 2520 { | |
| 2521 bool res = markFromRoots(false); | |
| 2522 assert(res && _collectorState == FinalMarking, "Collector state should " | |
| 2523 "have changed"); | |
| 2524 break; | |
| 2525 } | |
| 2526 case FinalMarking: | |
| 2527 if (VerifyDuringGC && | |
| 2528 GenCollectedHeap::heap()->total_collections() >= VerifyGCStartAt) { | |
|
10186
b06ac540229e
8013132: Add a flag to turn off the output of the verbose verification code
stefank
parents:
10180
diff
changeset
|
2529 Universe::verify("Verify before re-mark: "); |
| 0 | 2530 } |
| 2531 checkpointRootsFinal(false, clear_all_soft_refs, | |
| 2532 init_mark_was_synchronous); | |
| 2533 assert(_collectorState == Sweeping, "Collector state should not " | |
| 2534 "have changed within checkpointRootsFinal()"); | |
| 2535 break; | |
| 2536 case Sweeping: | |
| 2537 // final marking in checkpointRootsFinal has been completed | |
| 2538 if (VerifyDuringGC && | |
| 2539 GenCollectedHeap::heap()->total_collections() >= VerifyGCStartAt) { | |
|
10186
b06ac540229e
8013132: Add a flag to turn off the output of the verbose verification code
stefank
parents:
10180
diff
changeset
|
2540 Universe::verify("Verify before sweep: "); |
| 0 | 2541 } |
| 2542 sweep(false); | |
| 2543 assert(_collectorState == Resizing, "Incorrect state"); | |
| 2544 break; | |
| 2545 case Resizing: { | |
| 2546 // Sweeping has been completed; the actual resize in this case | |
| 2547 // is done separately; nothing to be done in this state. | |
| 2548 _collectorState = Resetting; | |
| 2549 break; | |
| 2550 } | |
| 2551 case Resetting: | |
| 2552 // The heap has been resized. | |
| 2553 if (VerifyDuringGC && | |
| 2554 GenCollectedHeap::heap()->total_collections() >= VerifyGCStartAt) { | |
|
10186
b06ac540229e
8013132: Add a flag to turn off the output of the verbose verification code
stefank
parents:
10180
diff
changeset
|
2555 Universe::verify("Verify before reset: "); |
| 0 | 2556 } |
| 10405 | 2557 save_heap_summary(); |
| 0 | 2558 reset(false); |
| 2559 assert(_collectorState == Idling, "Collector state should " | |
| 2560 "have changed"); | |
| 2561 break; | |
| 2562 case Precleaning: | |
| 2563 case AbortablePreclean: | |
| 2564 // Elide the preclean phase | |
| 2565 _collectorState = FinalMarking; | |
| 2566 break; | |
| 2567 default: | |
| 2568 ShouldNotReachHere(); | |
| 2569 } | |
| 2570 if (TraceCMSState) { | |
| 2571 gclog_or_tty->print_cr(" Thread " INTPTR_FORMAT " done - next CMS state %d", | |
| 2572 Thread::current(), _collectorState); | |
| 2573 } | |
| 2574 } | |
| 2575 | |
| 2576 if (UseAdaptiveSizePolicy) { | |
| 2577 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 2578 size_policy()->ms_collection_end(gch->gc_cause()); | |
| 2579 } | |
| 2580 | |
| 2581 if (VerifyAfterGC && | |
| 2582 GenCollectedHeap::heap()->total_collections() >= VerifyGCStartAt) { | |
|
6865
4202510ee0fe
8000831: Heap verification output incorrect/incomplete
johnc
parents:
6787
diff
changeset
|
2583 Universe::verify(); |
| 0 | 2584 } |
| 2585 if (TraceCMSState) { | |
| 2586 gclog_or_tty->print_cr("CMS Thread " INTPTR_FORMAT | |
| 2587 " exiting collection CMS state %d", | |
| 2588 Thread::current(), _collectorState); | |
| 2589 } | |
| 2590 } | |
| 2591 | |
| 2592 bool CMSCollector::waitForForegroundGC() { | |
| 2593 bool res = false; | |
| 2594 assert(ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 2595 "CMS thread should have CMS token"); | |
| 2596 // Block the foreground collector until the | |
| 2597 // background collectors decides whether to | |
| 2598 // yield. | |
| 2599 MutexLockerEx x(CGC_lock, Mutex::_no_safepoint_check_flag); | |
| 2600 _foregroundGCShouldWait = true; | |
| 2601 if (_foregroundGCIsActive) { | |
| 2602 // The background collector yields to the | |
| 2603 // foreground collector and returns a value | |
| 2604 // indicating that it has yielded. The foreground | |
| 2605 // collector can proceed. | |
| 2606 res = true; | |
| 2607 _foregroundGCShouldWait = false; | |
| 2608 ConcurrentMarkSweepThread::clear_CMS_flag( | |
| 2609 ConcurrentMarkSweepThread::CMS_cms_has_token); | |
| 2610 ConcurrentMarkSweepThread::set_CMS_flag( | |
| 2611 ConcurrentMarkSweepThread::CMS_cms_wants_token); | |
| 2612 // Get a possibly blocked foreground thread going | |
| 2613 CGC_lock->notify(); | |
| 2614 if (TraceCMSState) { | |
| 2615 gclog_or_tty->print_cr("CMS Thread " INTPTR_FORMAT " waiting at CMS state %d", | |
| 2616 Thread::current(), _collectorState); | |
| 2617 } | |
| 2618 while (_foregroundGCIsActive) { | |
| 2619 CGC_lock->wait(Mutex::_no_safepoint_check_flag); | |
| 2620 } | |
| 2621 ConcurrentMarkSweepThread::set_CMS_flag( | |
| 2622 ConcurrentMarkSweepThread::CMS_cms_has_token); | |
| 2623 ConcurrentMarkSweepThread::clear_CMS_flag( | |
| 2624 ConcurrentMarkSweepThread::CMS_cms_wants_token); | |
| 2625 } | |
| 2626 if (TraceCMSState) { | |
| 2627 gclog_or_tty->print_cr("CMS Thread " INTPTR_FORMAT " continuing at CMS state %d", | |
| 2628 Thread::current(), _collectorState); | |
| 2629 } | |
| 2630 return res; | |
| 2631 } | |
| 2632 | |
| 2633 // Because of the need to lock the free lists and other structures in | |
| 2634 // the collector, common to all the generations that the collector is | |
| 2635 // collecting, we need the gc_prologues of individual CMS generations | |
| 2636 // delegate to their collector. It may have been simpler had the | |
| 2637 // current infrastructure allowed one to call a prologue on a | |
| 2638 // collector. In the absence of that we have the generation's | |
| 2639 // prologue delegate to the collector, which delegates back | |
| 2640 // some "local" work to a worker method in the individual generations | |
| 2641 // that it's responsible for collecting, while itself doing any | |
| 2642 // work common to all generations it's responsible for. A similar | |
| 2643 // comment applies to the gc_epilogue()'s. | |
| 2644 // The role of the varaible _between_prologue_and_epilogue is to | |
| 2645 // enforce the invocation protocol. | |
| 2646 void CMSCollector::gc_prologue(bool full) { | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2647 // Call gc_prologue_work() for the CMSGen |
| 0 | 2648 // we are responsible for. |
| 2649 | |
| 2650 // The following locking discipline assumes that we are only called | |
| 2651 // when the world is stopped. | |
| 2652 assert(SafepointSynchronize::is_at_safepoint(), "world is stopped assumption"); | |
| 2653 | |
| 2654 // The CMSCollector prologue must call the gc_prologues for the | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2655 // "generations" that it's responsible |
| 0 | 2656 // for. |
| 2657 | |
| 2658 assert( Thread::current()->is_VM_thread() | |
| 2659 || ( CMSScavengeBeforeRemark | |
| 2660 && Thread::current()->is_ConcurrentGC_thread()), | |
| 2661 "Incorrect thread type for prologue execution"); | |
| 2662 | |
| 2663 if (_between_prologue_and_epilogue) { | |
| 2664 // We have already been invoked; this is a gc_prologue delegation | |
| 2665 // from yet another CMS generation that we are responsible for, just | |
| 2666 // ignore it since all relevant work has already been done. | |
| 2667 return; | |
| 2668 } | |
| 2669 | |
| 2670 // set a bit saying prologue has been called; cleared in epilogue | |
| 2671 _between_prologue_and_epilogue = true; | |
| 2672 // Claim locks for common data structures, then call gc_prologue_work() | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2673 // for each CMSGen. |
| 0 | 2674 |
| 2675 getFreelistLocks(); // gets free list locks on constituent spaces | |
| 2676 bitMapLock()->lock_without_safepoint_check(); | |
| 2677 | |
| 2678 // Should call gc_prologue_work() for all cms gens we are responsible for | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2679 bool duringMarking = _collectorState >= Marking |
| 0 | 2680 && _collectorState < Sweeping; |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2681 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2682 // The young collections clear the modified oops state, which tells if |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2683 // there are any modified oops in the class. The remark phase also needs |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2684 // that information. Tell the young collection to save the union of all |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2685 // modified klasses. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2686 if (duringMarking) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2687 _ct->klass_rem_set()->set_accumulate_modified_oops(true); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2688 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2689 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2690 bool registerClosure = duringMarking; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2691 |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
2692 ModUnionClosure* muc = CollectedHeap::use_parallel_gc_threads() ? |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
2693 &_modUnionClosurePar |
| 0 | 2694 : &_modUnionClosure; |
| 2695 _cmsGen->gc_prologue_work(full, registerClosure, muc); | |
| 2696 | |
| 2697 if (!full) { | |
| 2698 stats().record_gc0_begin(); | |
| 2699 } | |
| 2700 } | |
| 2701 | |
| 2702 void ConcurrentMarkSweepGeneration::gc_prologue(bool full) { | |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
2703 |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
2704 _capacity_at_prologue = capacity(); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
2705 _used_at_prologue = used(); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
2706 |
| 0 | 2707 // Delegate to CMScollector which knows how to coordinate between |
| 2708 // this and any other CMS generations that it is responsible for | |
| 2709 // collecting. | |
| 2710 collector()->gc_prologue(full); | |
| 2711 } | |
| 2712 | |
| 2713 // This is a "private" interface for use by this generation's CMSCollector. | |
| 2714 // Not to be called directly by any other entity (for instance, | |
| 2715 // GenCollectedHeap, which calls the "public" gc_prologue method above). | |
| 2716 void ConcurrentMarkSweepGeneration::gc_prologue_work(bool full, | |
| 2717 bool registerClosure, ModUnionClosure* modUnionClosure) { | |
| 2718 assert(!incremental_collection_failed(), "Shouldn't be set yet"); | |
| 2719 assert(cmsSpace()->preconsumptionDirtyCardClosure() == NULL, | |
| 2720 "Should be NULL"); | |
| 2721 if (registerClosure) { | |
| 2722 cmsSpace()->setPreconsumptionDirtyCardClosure(modUnionClosure); | |
| 2723 } | |
| 2724 cmsSpace()->gc_prologue(); | |
| 2725 // Clear stat counters | |
| 2726 NOT_PRODUCT( | |
| 2727 assert(_numObjectsPromoted == 0, "check"); | |
| 2728 assert(_numWordsPromoted == 0, "check"); | |
| 2729 if (Verbose && PrintGC) { | |
| 2730 gclog_or_tty->print("Allocated "SIZE_FORMAT" objects, " | |
| 2731 SIZE_FORMAT" bytes concurrently", | |
| 2732 _numObjectsAllocated, _numWordsAllocated*sizeof(HeapWord)); | |
| 2733 } | |
| 2734 _numObjectsAllocated = 0; | |
| 2735 _numWordsAllocated = 0; | |
| 2736 ) | |
| 2737 } | |
| 2738 | |
| 2739 void CMSCollector::gc_epilogue(bool full) { | |
| 2740 // The following locking discipline assumes that we are only called | |
| 2741 // when the world is stopped. | |
| 2742 assert(SafepointSynchronize::is_at_safepoint(), | |
| 2743 "world is stopped assumption"); | |
| 2744 | |
| 2745 // Currently the CMS epilogue (see CompactibleFreeListSpace) merely checks | |
| 2746 // if linear allocation blocks need to be appropriately marked to allow the | |
| 2747 // the blocks to be parsable. We also check here whether we need to nudge the | |
| 2748 // CMS collector thread to start a new cycle (if it's not already active). | |
| 2749 assert( Thread::current()->is_VM_thread() | |
| 2750 || ( CMSScavengeBeforeRemark | |
| 2751 && Thread::current()->is_ConcurrentGC_thread()), | |
| 2752 "Incorrect thread type for epilogue execution"); | |
| 2753 | |
| 2754 if (!_between_prologue_and_epilogue) { | |
| 2755 // We have already been invoked; this is a gc_epilogue delegation | |
| 2756 // from yet another CMS generation that we are responsible for, just | |
| 2757 // ignore it since all relevant work has already been done. | |
| 2758 return; | |
| 2759 } | |
| 2760 assert(haveFreelistLocks(), "must have freelist locks"); | |
| 2761 assert_lock_strong(bitMapLock()); | |
| 2762 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2763 _ct->klass_rem_set()->set_accumulate_modified_oops(false); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2764 |
| 0 | 2765 _cmsGen->gc_epilogue_work(full); |
| 2766 | |
| 2767 if (_collectorState == AbortablePreclean || _collectorState == Precleaning) { | |
| 2768 // in case sampling was not already enabled, enable it | |
| 2769 _start_sampling = true; | |
| 2770 } | |
| 2771 // reset _eden_chunk_array so sampling starts afresh | |
| 2772 _eden_chunk_index = 0; | |
| 2773 | |
| 2774 size_t cms_used = _cmsGen->cmsSpace()->used(); | |
| 2775 | |
| 2776 // update performance counters - this uses a special version of | |
| 2777 // update_counters() that allows the utilization to be passed as a | |
| 2778 // parameter, avoiding multiple calls to used(). | |
| 2779 // | |
| 2780 _cmsGen->update_counters(cms_used); | |
| 2781 | |
| 2782 if (CMSIncrementalMode) { | |
| 2783 icms_update_allocation_limits(); | |
| 2784 } | |
| 2785 | |
| 2786 bitMapLock()->unlock(); | |
| 2787 releaseFreelistLocks(); | |
| 2788 | |
|
3799
48048b59a551
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
3746
diff
changeset
|
2789 if (!CleanChunkPoolAsync) { |
|
48048b59a551
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
3746
diff
changeset
|
2790 Chunk::clean_chunk_pool(); |
|
48048b59a551
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
3746
diff
changeset
|
2791 } |
|
48048b59a551
7061204: clean the chunk table synchronously in embedded builds
jcoomes
parents:
3746
diff
changeset
|
2792 |
|
10244
06ab37f08701
8013184: CMS: Call reset_after_compaction() only if a compaction has been done
jmasa
parents:
10243
diff
changeset
|
2793 set_did_compact(false); |
| 0 | 2794 _between_prologue_and_epilogue = false; // ready for next cycle |
| 2795 } | |
| 2796 | |
| 2797 void ConcurrentMarkSweepGeneration::gc_epilogue(bool full) { | |
| 2798 collector()->gc_epilogue(full); | |
| 2799 | |
| 2800 // Also reset promotion tracking in par gc thread states. | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
2801 if (CollectedHeap::use_parallel_gc_threads()) { |
| 0 | 2802 for (uint i = 0; i < ParallelGCThreads; i++) { |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2803 _par_gc_thread_states[i]->promo.stopTrackingPromotions(i); |
| 0 | 2804 } |
| 2805 } | |
| 2806 } | |
| 2807 | |
| 2808 void ConcurrentMarkSweepGeneration::gc_epilogue_work(bool full) { | |
| 2809 assert(!incremental_collection_failed(), "Should have been cleared"); | |
| 2810 cmsSpace()->setPreconsumptionDirtyCardClosure(NULL); | |
| 2811 cmsSpace()->gc_epilogue(); | |
| 2812 // Print stat counters | |
| 2813 NOT_PRODUCT( | |
| 2814 assert(_numObjectsAllocated == 0, "check"); | |
| 2815 assert(_numWordsAllocated == 0, "check"); | |
| 2816 if (Verbose && PrintGC) { | |
| 2817 gclog_or_tty->print("Promoted "SIZE_FORMAT" objects, " | |
| 2818 SIZE_FORMAT" bytes", | |
| 2819 _numObjectsPromoted, _numWordsPromoted*sizeof(HeapWord)); | |
| 2820 } | |
| 2821 _numObjectsPromoted = 0; | |
| 2822 _numWordsPromoted = 0; | |
| 2823 ) | |
| 2824 | |
| 2825 if (PrintGC && Verbose) { | |
| 2826 // Call down the chain in contiguous_available needs the freelistLock | |
| 2827 // so print this out before releasing the freeListLock. | |
| 2828 gclog_or_tty->print(" Contiguous available "SIZE_FORMAT" bytes ", | |
| 2829 contiguous_available()); | |
| 2830 } | |
| 2831 } | |
| 2832 | |
| 2833 #ifndef PRODUCT | |
| 2834 bool CMSCollector::have_cms_token() { | |
| 2835 Thread* thr = Thread::current(); | |
| 2836 if (thr->is_VM_thread()) { | |
| 2837 return ConcurrentMarkSweepThread::vm_thread_has_cms_token(); | |
| 2838 } else if (thr->is_ConcurrentGC_thread()) { | |
| 2839 return ConcurrentMarkSweepThread::cms_thread_has_cms_token(); | |
| 2840 } else if (thr->is_GC_task_thread()) { | |
| 2841 return ConcurrentMarkSweepThread::vm_thread_has_cms_token() && | |
| 2842 ParGCRareEvent_lock->owned_by_self(); | |
| 2843 } | |
| 2844 return false; | |
| 2845 } | |
| 2846 #endif | |
| 2847 | |
| 2848 // Check reachability of the given heap address in CMS generation, | |
| 2849 // treating all other generations as roots. | |
| 2850 bool CMSCollector::is_cms_reachable(HeapWord* addr) { | |
| 2851 // We could "guarantee" below, rather than assert, but i'll | |
| 2852 // leave these as "asserts" so that an adventurous debugger | |
| 2853 // could try this in the product build provided some subset of | |
| 2854 // the conditions were met, provided they were intersted in the | |
| 2855 // results and knew that the computation below wouldn't interfere | |
| 2856 // with other concurrent computations mutating the structures | |
| 2857 // being read or written. | |
| 2858 assert(SafepointSynchronize::is_at_safepoint(), | |
| 2859 "Else mutations in object graph will make answer suspect"); | |
| 2860 assert(have_cms_token(), "Should hold cms token"); | |
| 2861 assert(haveFreelistLocks(), "must hold free list locks"); | |
| 2862 assert_lock_strong(bitMapLock()); | |
| 2863 | |
| 2864 // Clear the marking bit map array before starting, but, just | |
| 2865 // for kicks, first report if the given address is already marked | |
| 2866 gclog_or_tty->print_cr("Start: Address 0x%x is%s marked", addr, | |
| 2867 _markBitMap.isMarked(addr) ? "" : " not"); | |
| 2868 | |
| 2869 if (verify_after_remark()) { | |
| 2870 MutexLockerEx x(verification_mark_bm()->lock(), Mutex::_no_safepoint_check_flag); | |
| 2871 bool result = verification_mark_bm()->isMarked(addr); | |
| 2872 gclog_or_tty->print_cr("TransitiveMark: Address 0x%x %s marked", addr, | |
| 2873 result ? "IS" : "is NOT"); | |
| 2874 return result; | |
| 2875 } else { | |
| 2876 gclog_or_tty->print_cr("Could not compute result"); | |
| 2877 return false; | |
| 2878 } | |
| 2879 } | |
| 2880 | |
|
9076
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2881 |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2882 void |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2883 CMSCollector::print_on_error(outputStream* st) { |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2884 CMSCollector* collector = ConcurrentMarkSweepGeneration::_collector; |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2885 if (collector != NULL) { |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2886 CMSBitMap* bitmap = &collector->_markBitMap; |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2887 st->print_cr("Marking Bits: (CMSBitMap*) " PTR_FORMAT, bitmap); |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2888 bitmap->print_on_error(st, " Bits: "); |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2889 |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2890 st->cr(); |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2891 |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2892 CMSBitMap* mut_bitmap = &collector->_modUnionTable; |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2893 st->print_cr("Mod Union Table: (CMSBitMap*) " PTR_FORMAT, mut_bitmap); |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2894 mut_bitmap->print_on_error(st, " Bits: "); |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2895 } |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2896 } |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
2897 |
| 0 | 2898 //////////////////////////////////////////////////////// |
| 2899 // CMS Verification Support | |
| 2900 //////////////////////////////////////////////////////// | |
| 2901 // Following the remark phase, the following invariant | |
| 2902 // should hold -- each object in the CMS heap which is | |
| 2903 // marked in markBitMap() should be marked in the verification_mark_bm(). | |
| 2904 | |
| 2905 class VerifyMarkedClosure: public BitMapClosure { | |
| 2906 CMSBitMap* _marks; | |
| 2907 bool _failed; | |
| 2908 | |
| 2909 public: | |
| 2910 VerifyMarkedClosure(CMSBitMap* bm): _marks(bm), _failed(false) {} | |
| 2911 | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
2912 bool do_bit(size_t offset) { |
| 0 | 2913 HeapWord* addr = _marks->offsetToHeapWord(offset); |
| 2914 if (!_marks->isMarked(addr)) { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2915 oop(addr)->print_on(gclog_or_tty); |
| 0 | 2916 gclog_or_tty->print_cr(" ("INTPTR_FORMAT" should have been marked)", addr); |
| 2917 _failed = true; | |
| 2918 } | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
2919 return true; |
| 0 | 2920 } |
| 2921 | |
| 2922 bool failed() { return _failed; } | |
| 2923 }; | |
| 2924 | |
|
10186
b06ac540229e
8013132: Add a flag to turn off the output of the verbose verification code
stefank
parents:
10180
diff
changeset
|
2925 bool CMSCollector::verify_after_remark(bool silent) { |
|
b06ac540229e
8013132: Add a flag to turn off the output of the verbose verification code
stefank
parents:
10180
diff
changeset
|
2926 if (!silent) gclog_or_tty->print(" [Verifying CMS Marking... "); |
| 0 | 2927 MutexLockerEx ml(verification_mark_bm()->lock(), Mutex::_no_safepoint_check_flag); |
| 2928 static bool init = false; | |
| 2929 | |
| 2930 assert(SafepointSynchronize::is_at_safepoint(), | |
| 2931 "Else mutations in object graph will make answer suspect"); | |
| 2932 assert(have_cms_token(), | |
| 2933 "Else there may be mutual interference in use of " | |
| 2934 " verification data structures"); | |
| 2935 assert(_collectorState > Marking && _collectorState <= Sweeping, | |
| 2936 "Else marking info checked here may be obsolete"); | |
| 2937 assert(haveFreelistLocks(), "must hold free list locks"); | |
| 2938 assert_lock_strong(bitMapLock()); | |
| 2939 | |
| 2940 | |
| 2941 // Allocate marking bit map if not already allocated | |
| 2942 if (!init) { // first time | |
| 2943 if (!verification_mark_bm()->allocate(_span)) { | |
| 2944 return false; | |
| 2945 } | |
| 2946 init = true; | |
| 2947 } | |
| 2948 | |
| 2949 assert(verification_mark_stack()->isEmpty(), "Should be empty"); | |
| 2950 | |
| 2951 // Turn off refs discovery -- so we will be tracing through refs. | |
| 2952 // This is as intended, because by this time | |
| 2953 // GC must already have cleared any refs that need to be cleared, | |
| 2954 // and traced those that need to be marked; moreover, | |
| 2955 // the marking done here is not going to intefere in any | |
| 2956 // way with the marking information used by GC. | |
| 2957 NoRefDiscovery no_discovery(ref_processor()); | |
| 2958 | |
| 2959 COMPILER2_PRESENT(DerivedPointerTableDeactivate dpt_deact;) | |
| 2960 | |
| 2961 // Clear any marks from a previous round | |
| 2962 verification_mark_bm()->clear_all(); | |
| 2963 assert(verification_mark_stack()->isEmpty(), "markStack should be empty"); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
2964 verify_work_stacks_empty(); |
| 0 | 2965 |
| 2966 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 2967 gch->ensure_parsability(false); // fill TLABs, but no need to retire them | |
| 2968 // Update the saved marks which may affect the root scans. | |
| 2969 gch->save_marks(); | |
| 2970 | |
| 2971 if (CMSRemarkVerifyVariant == 1) { | |
| 2972 // In this first variant of verification, we complete | |
| 2973 // all marking, then check if the new marks-verctor is | |
| 2974 // a subset of the CMS marks-vector. | |
| 2975 verify_after_remark_work_1(); | |
| 2976 } else if (CMSRemarkVerifyVariant == 2) { | |
| 2977 // In this second variant of verification, we flag an error | |
| 2978 // (i.e. an object reachable in the new marks-vector not reachable | |
| 2979 // in the CMS marks-vector) immediately, also indicating the | |
| 2980 // identify of an object (A) that references the unmarked object (B) -- | |
| 2981 // presumably, a mutation to A failed to be picked up by preclean/remark? | |
| 2982 verify_after_remark_work_2(); | |
| 2983 } else { | |
| 2984 warning("Unrecognized value %d for CMSRemarkVerifyVariant", | |
| 2985 CMSRemarkVerifyVariant); | |
| 2986 } | |
|
10186
b06ac540229e
8013132: Add a flag to turn off the output of the verbose verification code
stefank
parents:
10180
diff
changeset
|
2987 if (!silent) gclog_or_tty->print(" done] "); |
| 0 | 2988 return true; |
| 2989 } | |
| 2990 | |
| 2991 void CMSCollector::verify_after_remark_work_1() { | |
| 2992 ResourceMark rm; | |
| 2993 HandleMark hm; | |
| 2994 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 2995 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2996 // Get a clear set of claim bits for the strong roots processing to work with. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2997 ClassLoaderDataGraph::clear_claimed_marks(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
2998 |
| 0 | 2999 // Mark from roots one level into CMS |
|
994
753cf9794df9
6885169: merge of 4957990 and 6863023 causes conflict on do_nmethods
jrose
parents:
993
diff
changeset
|
3000 MarkRefsIntoClosure notOlder(_span, verification_mark_bm()); |
| 0 | 3001 gch->rem_set()->prepare_for_younger_refs_iterate(false); // Not parallel. |
| 3002 | |
| 3003 gch->gen_process_strong_roots(_cmsGen->level(), | |
| 3004 true, // younger gens are roots | |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
3005 true, // activate StrongRootsScope |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3006 false, // not scavenging |
| 0 | 3007 SharedHeap::ScanningOption(roots_scanning_options()), |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
3008 ¬Older, |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
3009 true, // walk code active on stacks |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3010 NULL, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3011 NULL); // SSS: Provide correct closure |
| 0 | 3012 |
| 3013 // Now mark from the roots | |
| 3014 MarkFromRootsClosure markFromRootsClosure(this, _span, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3015 verification_mark_bm(), verification_mark_stack(), |
| 0 | 3016 false /* don't yield */, true /* verifying */); |
| 3017 assert(_restart_addr == NULL, "Expected pre-condition"); | |
| 3018 verification_mark_bm()->iterate(&markFromRootsClosure); | |
| 3019 while (_restart_addr != NULL) { | |
| 3020 // Deal with stack overflow: by restarting at the indicated | |
| 3021 // address. | |
| 3022 HeapWord* ra = _restart_addr; | |
| 3023 markFromRootsClosure.reset(ra); | |
| 3024 _restart_addr = NULL; | |
| 3025 verification_mark_bm()->iterate(&markFromRootsClosure, ra, _span.end()); | |
| 3026 } | |
| 3027 assert(verification_mark_stack()->isEmpty(), "Should have been drained"); | |
| 3028 verify_work_stacks_empty(); | |
| 3029 | |
| 3030 // Marking completed -- now verify that each bit marked in | |
| 3031 // verification_mark_bm() is also marked in markBitMap(); flag all | |
| 3032 // errors by printing corresponding objects. | |
| 3033 VerifyMarkedClosure vcl(markBitMap()); | |
| 3034 verification_mark_bm()->iterate(&vcl); | |
| 3035 if (vcl.failed()) { | |
| 3036 gclog_or_tty->print("Verification failed"); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
3037 Universe::heap()->print_on(gclog_or_tty); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
3038 fatal("CMS: failed marking verification after remark"); |
| 0 | 3039 } |
| 3040 } | |
| 3041 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3042 class VerifyKlassOopsKlassClosure : public KlassClosure { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3043 class VerifyKlassOopsClosure : public OopClosure { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3044 CMSBitMap* _bitmap; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3045 public: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3046 VerifyKlassOopsClosure(CMSBitMap* bitmap) : _bitmap(bitmap) { } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3047 void do_oop(oop* p) { guarantee(*p == NULL || _bitmap->isMarked((HeapWord*) *p), "Should be marked"); } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3048 void do_oop(narrowOop* p) { ShouldNotReachHere(); } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3049 } _oop_closure; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3050 public: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3051 VerifyKlassOopsKlassClosure(CMSBitMap* bitmap) : _oop_closure(bitmap) {} |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3052 void do_klass(Klass* k) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3053 k->oops_do(&_oop_closure); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3054 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3055 }; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3056 |
| 0 | 3057 void CMSCollector::verify_after_remark_work_2() { |
| 3058 ResourceMark rm; | |
| 3059 HandleMark hm; | |
| 3060 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 3061 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3062 // Get a clear set of claim bits for the strong roots processing to work with. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3063 ClassLoaderDataGraph::clear_claimed_marks(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3064 |
| 0 | 3065 // Mark from roots one level into CMS |
| 3066 MarkRefsIntoVerifyClosure notOlder(_span, verification_mark_bm(), | |
|
994
753cf9794df9
6885169: merge of 4957990 and 6863023 causes conflict on do_nmethods
jrose
parents:
993
diff
changeset
|
3067 markBitMap()); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3068 CMKlassClosure klass_closure(¬Older); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3069 |
| 0 | 3070 gch->rem_set()->prepare_for_younger_refs_iterate(false); // Not parallel. |
| 3071 gch->gen_process_strong_roots(_cmsGen->level(), | |
| 3072 true, // younger gens are roots | |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
3073 true, // activate StrongRootsScope |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3074 false, // not scavenging |
| 0 | 3075 SharedHeap::ScanningOption(roots_scanning_options()), |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
3076 ¬Older, |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
3077 true, // walk code active on stacks |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3078 NULL, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3079 &klass_closure); |
| 0 | 3080 |
| 3081 // Now mark from the roots | |
| 3082 MarkFromRootsVerifyClosure markFromRootsClosure(this, _span, | |
| 3083 verification_mark_bm(), markBitMap(), verification_mark_stack()); | |
| 3084 assert(_restart_addr == NULL, "Expected pre-condition"); | |
| 3085 verification_mark_bm()->iterate(&markFromRootsClosure); | |
| 3086 while (_restart_addr != NULL) { | |
| 3087 // Deal with stack overflow: by restarting at the indicated | |
| 3088 // address. | |
| 3089 HeapWord* ra = _restart_addr; | |
| 3090 markFromRootsClosure.reset(ra); | |
| 3091 _restart_addr = NULL; | |
| 3092 verification_mark_bm()->iterate(&markFromRootsClosure, ra, _span.end()); | |
| 3093 } | |
| 3094 assert(verification_mark_stack()->isEmpty(), "Should have been drained"); | |
| 3095 verify_work_stacks_empty(); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3096 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3097 VerifyKlassOopsKlassClosure verify_klass_oops(verification_mark_bm()); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3098 ClassLoaderDataGraph::classes_do(&verify_klass_oops); |
| 0 | 3099 |
| 3100 // Marking completed -- now verify that each bit marked in | |
| 3101 // verification_mark_bm() is also marked in markBitMap(); flag all | |
| 3102 // errors by printing corresponding objects. | |
| 3103 VerifyMarkedClosure vcl(markBitMap()); | |
| 3104 verification_mark_bm()->iterate(&vcl); | |
| 3105 assert(!vcl.failed(), "Else verification above should not have succeeded"); | |
| 3106 } | |
| 3107 | |
| 3108 void ConcurrentMarkSweepGeneration::save_marks() { | |
| 3109 // delegate to CMS space | |
| 3110 cmsSpace()->save_marks(); | |
| 3111 for (uint i = 0; i < ParallelGCThreads; i++) { | |
| 3112 _par_gc_thread_states[i]->promo.startTrackingPromotions(); | |
| 3113 } | |
| 3114 } | |
| 3115 | |
| 3116 bool ConcurrentMarkSweepGeneration::no_allocs_since_save_marks() { | |
| 3117 return cmsSpace()->no_allocs_since_save_marks(); | |
| 3118 } | |
| 3119 | |
| 3120 #define CMS_SINCE_SAVE_MARKS_DEFN(OopClosureType, nv_suffix) \ | |
| 3121 \ | |
| 3122 void ConcurrentMarkSweepGeneration:: \ | |
| 3123 oop_since_save_marks_iterate##nv_suffix(OopClosureType* cl) { \ | |
| 3124 cl->set_generation(this); \ | |
| 3125 cmsSpace()->oop_since_save_marks_iterate##nv_suffix(cl); \ | |
| 3126 cl->reset_generation(); \ | |
| 3127 save_marks(); \ | |
| 3128 } | |
| 3129 | |
| 3130 ALL_SINCE_SAVE_MARKS_CLOSURES(CMS_SINCE_SAVE_MARKS_DEFN) | |
| 3131 | |
| 3132 void | |
| 3133 ConcurrentMarkSweepGeneration::younger_refs_iterate(OopsInGenClosure* cl) { | |
| 3134 cl->set_generation(this); | |
| 3135 younger_refs_in_space_iterate(_cmsSpace, cl); | |
| 3136 cl->reset_generation(); | |
| 3137 } | |
| 3138 | |
| 3139 void | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3140 ConcurrentMarkSweepGeneration::oop_iterate(MemRegion mr, ExtendedOopClosure* cl) { |
| 0 | 3141 if (freelistLock()->owned_by_self()) { |
| 3142 Generation::oop_iterate(mr, cl); | |
| 3143 } else { | |
| 3144 MutexLockerEx x(freelistLock(), Mutex::_no_safepoint_check_flag); | |
| 3145 Generation::oop_iterate(mr, cl); | |
| 3146 } | |
| 3147 } | |
| 3148 | |
| 3149 void | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3150 ConcurrentMarkSweepGeneration::oop_iterate(ExtendedOopClosure* cl) { |
| 0 | 3151 if (freelistLock()->owned_by_self()) { |
| 3152 Generation::oop_iterate(cl); | |
| 3153 } else { | |
| 3154 MutexLockerEx x(freelistLock(), Mutex::_no_safepoint_check_flag); | |
| 3155 Generation::oop_iterate(cl); | |
| 3156 } | |
| 3157 } | |
| 3158 | |
| 3159 void | |
| 3160 ConcurrentMarkSweepGeneration::object_iterate(ObjectClosure* cl) { | |
| 3161 if (freelistLock()->owned_by_self()) { | |
| 3162 Generation::object_iterate(cl); | |
| 3163 } else { | |
| 3164 MutexLockerEx x(freelistLock(), Mutex::_no_safepoint_check_flag); | |
| 3165 Generation::object_iterate(cl); | |
| 3166 } | |
| 3167 } | |
| 3168 | |
| 3169 void | |
|
517
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
3170 ConcurrentMarkSweepGeneration::safe_object_iterate(ObjectClosure* cl) { |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
3171 if (freelistLock()->owned_by_self()) { |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
3172 Generation::safe_object_iterate(cl); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
3173 } else { |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
3174 MutexLockerEx x(freelistLock(), Mutex::_no_safepoint_check_flag); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
3175 Generation::safe_object_iterate(cl); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
3176 } |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
3177 } |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
3178 |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
457
diff
changeset
|
3179 void |
| 0 | 3180 ConcurrentMarkSweepGeneration::post_compact() { |
| 3181 } | |
| 3182 | |
| 3183 void | |
| 3184 ConcurrentMarkSweepGeneration::prepare_for_verify() { | |
| 3185 // Fix the linear allocation blocks to look like free blocks. | |
| 3186 | |
| 3187 // Locks are normally acquired/released in gc_prologue/gc_epilogue, but those | |
| 3188 // are not called when the heap is verified during universe initialization and | |
| 3189 // at vm shutdown. | |
| 3190 if (freelistLock()->owned_by_self()) { | |
| 3191 cmsSpace()->prepare_for_verify(); | |
| 3192 } else { | |
| 3193 MutexLockerEx fll(freelistLock(), Mutex::_no_safepoint_check_flag); | |
| 3194 cmsSpace()->prepare_for_verify(); | |
| 3195 } | |
| 3196 } | |
| 3197 | |
| 3198 void | |
| 6008 | 3199 ConcurrentMarkSweepGeneration::verify() { |
| 0 | 3200 // Locks are normally acquired/released in gc_prologue/gc_epilogue, but those |
| 3201 // are not called when the heap is verified during universe initialization and | |
| 3202 // at vm shutdown. | |
| 3203 if (freelistLock()->owned_by_self()) { | |
| 6008 | 3204 cmsSpace()->verify(); |
| 0 | 3205 } else { |
| 3206 MutexLockerEx fll(freelistLock(), Mutex::_no_safepoint_check_flag); | |
| 6008 | 3207 cmsSpace()->verify(); |
| 3208 } | |
| 3209 } | |
| 3210 | |
| 3211 void CMSCollector::verify() { | |
| 3212 _cmsGen->verify(); | |
| 0 | 3213 } |
| 3214 | |
| 3215 #ifndef PRODUCT | |
| 3216 bool CMSCollector::overflow_list_is_empty() const { | |
| 3217 assert(_num_par_pushes >= 0, "Inconsistency"); | |
| 3218 if (_overflow_list == NULL) { | |
| 3219 assert(_num_par_pushes == 0, "Inconsistency"); | |
| 3220 } | |
| 3221 return _overflow_list == NULL; | |
| 3222 } | |
| 3223 | |
| 3224 // The methods verify_work_stacks_empty() and verify_overflow_empty() | |
| 3225 // merely consolidate assertion checks that appear to occur together frequently. | |
| 3226 void CMSCollector::verify_work_stacks_empty() const { | |
| 3227 assert(_markStack.isEmpty(), "Marking stack should be empty"); | |
| 3228 assert(overflow_list_is_empty(), "Overflow list should be empty"); | |
| 3229 } | |
| 3230 | |
| 3231 void CMSCollector::verify_overflow_empty() const { | |
| 3232 assert(overflow_list_is_empty(), "Overflow list should be empty"); | |
| 3233 assert(no_preserved_marks(), "No preserved marks"); | |
| 3234 } | |
| 3235 #endif // PRODUCT | |
| 3236 | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3237 // Decide if we want to enable class unloading as part of the |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3238 // ensuing concurrent GC cycle. We will collect and |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3239 // unload classes if it's the case that: |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3240 // (1) an explicit gc request has been made and the flag |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3241 // ExplicitGCInvokesConcurrentAndUnloadsClasses is set, OR |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3242 // (2) (a) class unloading is enabled at the command line, and |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3243 // (b) old gen is getting really full |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3244 // NOTE: Provided there is no change in the state of the heap between |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3245 // calls to this method, it should have idempotent results. Moreover, |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3246 // its results should be monotonically increasing (i.e. going from 0 to 1, |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3247 // but not 1 to 0) between successive calls between which the heap was |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3248 // not collected. For the implementation below, it must thus rely on |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3249 // the property that concurrent_cycles_since_last_unload() |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3250 // will not decrease unless a collection cycle happened and that |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3251 // _cmsGen->is_too_full() are |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3252 // themselves also monotonic in that sense. See check_monotonicity() |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3253 // below. |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3254 void CMSCollector::update_should_unload_classes() { |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3255 _should_unload_classes = false; |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3256 // Condition 1 above |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3257 if (_full_gc_requested && ExplicitGCInvokesConcurrentAndUnloadsClasses) { |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3258 _should_unload_classes = true; |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3259 } else if (CMSClassUnloadingEnabled) { // Condition 2.a above |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3260 // Disjuncts 2.b.(i,ii,iii) above |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3261 _should_unload_classes = (concurrent_cycles_since_last_unload() >= |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3262 CMSClassUnloadingMaxInterval) |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3263 || _cmsGen->is_too_full(); |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3264 } |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3265 } |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3266 |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3267 bool ConcurrentMarkSweepGeneration::is_too_full() const { |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3268 bool res = should_concurrent_collect(); |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3269 res = res && (occupancy() > (double)CMSIsTooFullPercentage/100.0); |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3270 return res; |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3271 } |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3272 |
| 0 | 3273 void CMSCollector::setup_cms_unloading_and_verification_state() { |
|
3293
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2379
diff
changeset
|
3274 const bool should_verify = VerifyBeforeGC || VerifyAfterGC || VerifyDuringGC |
| 0 | 3275 || VerifyBeforeExit; |
|
3293
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2379
diff
changeset
|
3276 const int rso = SharedHeap::SO_Strings | SharedHeap::SO_CodeCache; |
| 0 | 3277 |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3278 if (should_unload_classes()) { // Should unload classes this cycle |
| 0 | 3279 remove_root_scanning_option(rso); // Shrink the root set appropriately |
| 3280 set_verifying(should_verify); // Set verification state for this cycle | |
| 3281 return; // Nothing else needs to be done at this time | |
| 3282 } | |
| 3283 | |
| 3284 // Not unloading classes this cycle | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3285 assert(!should_unload_classes(), "Inconsitency!"); |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
3286 if ((!verifying() || unloaded_classes_last_cycle()) && should_verify) { |
| 0 | 3287 // Include symbols, strings and code cache elements to prevent their resurrection. |
| 3288 add_root_scanning_option(rso); | |
| 3289 set_verifying(true); | |
| 3290 } else if (verifying() && !should_verify) { | |
| 3291 // We were verifying, but some verification flags got disabled. | |
| 3292 set_verifying(false); | |
| 3293 // Exclude symbols, strings and code cache elements from root scanning to | |
| 3294 // reduce IM and RM pauses. | |
| 3295 remove_root_scanning_option(rso); | |
| 3296 } | |
| 3297 } | |
| 3298 | |
| 3299 | |
| 3300 #ifndef PRODUCT | |
| 3301 HeapWord* CMSCollector::block_start(const void* p) const { | |
| 3302 const HeapWord* addr = (HeapWord*)p; | |
| 3303 if (_span.contains(p)) { | |
| 3304 if (_cmsGen->cmsSpace()->is_in_reserved(addr)) { | |
| 3305 return _cmsGen->cmsSpace()->block_start(p); | |
| 3306 } | |
| 3307 } | |
| 3308 return NULL; | |
| 3309 } | |
| 3310 #endif | |
| 3311 | |
| 3312 HeapWord* | |
| 3313 ConcurrentMarkSweepGeneration::expand_and_allocate(size_t word_size, | |
| 3314 bool tlab, | |
| 3315 bool parallel) { | |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3316 CMSSynchronousYieldRequest yr; |
| 0 | 3317 assert(!tlab, "Can't deal with TLAB allocation"); |
| 3318 MutexLockerEx x(freelistLock(), Mutex::_no_safepoint_check_flag); | |
| 3319 expand(word_size*HeapWordSize, MinHeapDeltaBytes, | |
| 3320 CMSExpansionCause::_satisfy_allocation); | |
| 3321 if (GCExpandToAllocateDelayMillis > 0) { | |
| 3322 os::sleep(Thread::current(), GCExpandToAllocateDelayMillis, false); | |
| 3323 } | |
|
9
173195ff483a
6642634: Test nsk/regression/b6186200 crashed with SIGSEGV
ysr
parents:
7
diff
changeset
|
3324 return have_lock_and_allocate(word_size, tlab); |
| 0 | 3325 } |
| 3326 | |
| 3327 // YSR: All of this generation expansion/shrinking stuff is an exact copy of | |
| 3328 // OneContigSpaceCardGeneration, which makes me wonder if we should move this | |
| 3329 // to CardGeneration and share it... | |
|
271
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
196
diff
changeset
|
3330 bool ConcurrentMarkSweepGeneration::expand(size_t bytes, size_t expand_bytes) { |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
196
diff
changeset
|
3331 return CardGeneration::expand(bytes, expand_bytes); |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
196
diff
changeset
|
3332 } |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
196
diff
changeset
|
3333 |
| 0 | 3334 void ConcurrentMarkSweepGeneration::expand(size_t bytes, size_t expand_bytes, |
| 3335 CMSExpansionCause::Cause cause) | |
| 3336 { | |
|
271
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
196
diff
changeset
|
3337 |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
196
diff
changeset
|
3338 bool success = expand(bytes, expand_bytes); |
|
818a18cd69a8
6730514: assertion failure in mangling code when expanding by 0 bytes
jmasa
parents:
196
diff
changeset
|
3339 |
| 0 | 3340 // remember why we expanded; this information is used |
| 3341 // by shouldConcurrentCollect() when making decisions on whether to start | |
| 3342 // a new CMS cycle. | |
| 3343 if (success) { | |
| 3344 set_expansion_cause(cause); | |
| 3345 if (PrintGCDetails && Verbose) { | |
| 3346 gclog_or_tty->print_cr("Expanded CMS gen for %s", | |
| 3347 CMSExpansionCause::to_string(cause)); | |
| 3348 } | |
| 3349 } | |
| 3350 } | |
| 3351 | |
| 3352 HeapWord* ConcurrentMarkSweepGeneration::expand_and_par_lab_allocate(CMSParGCThreadState* ps, size_t word_sz) { | |
| 3353 HeapWord* res = NULL; | |
| 3354 MutexLocker x(ParGCRareEvent_lock); | |
| 3355 while (true) { | |
| 3356 // Expansion by some other thread might make alloc OK now: | |
| 3357 res = ps->lab.alloc(word_sz); | |
| 3358 if (res != NULL) return res; | |
| 3359 // If there's not enough expansion space available, give up. | |
| 3360 if (_virtual_space.uncommitted_size() < (word_sz * HeapWordSize)) { | |
| 3361 return NULL; | |
| 3362 } | |
| 3363 // Otherwise, we try expansion. | |
| 3364 expand(word_sz*HeapWordSize, MinHeapDeltaBytes, | |
| 3365 CMSExpansionCause::_allocate_par_lab); | |
| 3366 // Now go around the loop and try alloc again; | |
| 3367 // A competing par_promote might beat us to the expansion space, | |
| 3368 // so we may go around the loop again if promotion fails agaion. | |
| 3369 if (GCExpandToAllocateDelayMillis > 0) { | |
| 3370 os::sleep(Thread::current(), GCExpandToAllocateDelayMillis, false); | |
| 3371 } | |
| 3372 } | |
| 3373 } | |
| 3374 | |
| 3375 | |
| 3376 bool ConcurrentMarkSweepGeneration::expand_and_ensure_spooling_space( | |
| 3377 PromotionInfo* promo) { | |
| 3378 MutexLocker x(ParGCRareEvent_lock); | |
| 3379 size_t refill_size_bytes = promo->refillSize() * HeapWordSize; | |
| 3380 while (true) { | |
| 3381 // Expansion by some other thread might make alloc OK now: | |
| 3382 if (promo->ensure_spooling_space()) { | |
| 3383 assert(promo->has_spooling_space(), | |
| 3384 "Post-condition of successful ensure_spooling_space()"); | |
| 3385 return true; | |
| 3386 } | |
| 3387 // If there's not enough expansion space available, give up. | |
| 3388 if (_virtual_space.uncommitted_size() < refill_size_bytes) { | |
| 3389 return false; | |
| 3390 } | |
| 3391 // Otherwise, we try expansion. | |
| 3392 expand(refill_size_bytes, MinHeapDeltaBytes, | |
| 3393 CMSExpansionCause::_allocate_par_spooling_space); | |
| 3394 // Now go around the loop and try alloc again; | |
| 3395 // A competing allocation might beat us to the expansion space, | |
| 3396 // so we may go around the loop again if allocation fails again. | |
| 3397 if (GCExpandToAllocateDelayMillis > 0) { | |
| 3398 os::sleep(Thread::current(), GCExpandToAllocateDelayMillis, false); | |
| 3399 } | |
| 3400 } | |
| 3401 } | |
| 3402 | |
| 3403 | |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3404 void ConcurrentMarkSweepGeneration::shrink_by(size_t bytes) { |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3405 assert_locked_or_safepoint(ExpandHeap_lock); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3406 // Shrink committed space |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3407 _virtual_space.shrink_by(bytes); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3408 // Shrink space; this also shrinks the space's BOT |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3409 _cmsSpace->set_end((HeapWord*) _virtual_space.high()); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3410 size_t new_word_size = heap_word_size(_cmsSpace->capacity()); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3411 // Shrink the shared block offset array |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3412 _bts->resize(new_word_size); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3413 MemRegion mr(_cmsSpace->bottom(), new_word_size); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3414 // Shrink the card table |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3415 Universe::heap()->barrier_set()->resize_covered_region(mr); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3416 |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3417 if (Verbose && PrintGC) { |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3418 size_t new_mem_size = _virtual_space.committed_size(); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3419 size_t old_mem_size = new_mem_size + bytes; |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3420 gclog_or_tty->print_cr("Shrinking %s from " SIZE_FORMAT "K to " SIZE_FORMAT "K", |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3421 name(), old_mem_size/K, new_mem_size/K); |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3422 } |
|
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3423 } |
| 0 | 3424 |
| 3425 void ConcurrentMarkSweepGeneration::shrink(size_t bytes) { | |
| 3426 assert_locked_or_safepoint(Heap_lock); | |
| 3427 size_t size = ReservedSpace::page_align_size_down(bytes); | |
| 3428 if (size > 0) { | |
| 3429 shrink_by(size); | |
| 3430 } | |
| 3431 } | |
| 3432 | |
| 3433 bool ConcurrentMarkSweepGeneration::grow_by(size_t bytes) { | |
| 3434 assert_locked_or_safepoint(Heap_lock); | |
| 3435 bool result = _virtual_space.expand_by(bytes); | |
| 3436 if (result) { | |
| 3437 size_t new_word_size = | |
| 3438 heap_word_size(_virtual_space.committed_size()); | |
| 3439 MemRegion mr(_cmsSpace->bottom(), new_word_size); | |
| 3440 _bts->resize(new_word_size); // resize the block offset shared array | |
| 3441 Universe::heap()->barrier_set()->resize_covered_region(mr); | |
| 3442 // Hmmmm... why doesn't CFLS::set_end verify locking? | |
| 3443 // This is quite ugly; FIX ME XXX | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
3444 _cmsSpace->assert_locked(freelistLock()); |
| 0 | 3445 _cmsSpace->set_end((HeapWord*)_virtual_space.high()); |
| 3446 | |
| 3447 // update the space and generation capacity counters | |
| 3448 if (UsePerfData) { | |
| 3449 _space_counters->update_capacity(); | |
| 3450 _gen_counters->update_all(); | |
| 3451 } | |
| 3452 | |
| 3453 if (Verbose && PrintGC) { | |
| 3454 size_t new_mem_size = _virtual_space.committed_size(); | |
| 3455 size_t old_mem_size = new_mem_size - bytes; | |
|
7623
203f64878aab
7102489: RFE: cleanup jlong typedef on __APPLE__and _LLP64 systems.
hseigel
parents:
6885
diff
changeset
|
3456 gclog_or_tty->print_cr("Expanding %s from " SIZE_FORMAT "K by " SIZE_FORMAT "K to " SIZE_FORMAT "K", |
| 0 | 3457 name(), old_mem_size/K, bytes/K, new_mem_size/K); |
| 3458 } | |
| 3459 } | |
| 3460 return result; | |
| 3461 } | |
| 3462 | |
| 3463 bool ConcurrentMarkSweepGeneration::grow_to_reserved() { | |
| 3464 assert_locked_or_safepoint(Heap_lock); | |
| 3465 bool success = true; | |
| 3466 const size_t remaining_bytes = _virtual_space.uncommitted_size(); | |
| 3467 if (remaining_bytes > 0) { | |
| 3468 success = grow_by(remaining_bytes); | |
| 3469 DEBUG_ONLY(if (!success) warning("grow to reserved failed");) | |
| 3470 } | |
| 3471 return success; | |
| 3472 } | |
| 3473 | |
|
9072
8617e38bb4cb
8008508: CMS does not correctly reduce heap size after a Full GC
jmasa
parents:
8784
diff
changeset
|
3474 void ConcurrentMarkSweepGeneration::shrink_free_list_by(size_t bytes) { |
| 0 | 3475 assert_locked_or_safepoint(Heap_lock); |
| 3476 assert_lock_strong(freelistLock()); | |
|
10180
ebded0261dfc
8012111: Remove warning about CMS generation shrinking.
jmasa
parents:
9152
diff
changeset
|
3477 if (PrintGCDetails && Verbose) { |
|
ebded0261dfc
8012111: Remove warning about CMS generation shrinking.
jmasa
parents:
9152
diff
changeset
|
3478 warning("Shrinking of CMS not yet implemented"); |
|
ebded0261dfc
8012111: Remove warning about CMS generation shrinking.
jmasa
parents:
9152
diff
changeset
|
3479 } |
| 0 | 3480 return; |
| 3481 } | |
| 3482 | |
| 3483 | |
| 3484 // Simple ctor/dtor wrapper for accounting & timer chores around concurrent | |
| 3485 // phases. | |
| 3486 class CMSPhaseAccounting: public StackObj { | |
| 3487 public: | |
| 3488 CMSPhaseAccounting(CMSCollector *collector, | |
| 3489 const char *phase, | |
| 3490 bool print_cr = true); | |
| 3491 ~CMSPhaseAccounting(); | |
| 3492 | |
| 3493 private: | |
| 3494 CMSCollector *_collector; | |
| 3495 const char *_phase; | |
| 3496 elapsedTimer _wallclock; | |
| 3497 bool _print_cr; | |
| 3498 | |
| 3499 public: | |
| 3500 // Not MT-safe; so do not pass around these StackObj's | |
| 3501 // where they may be accessed by other threads. | |
| 3502 jlong wallclock_millis() { | |
| 3503 assert(_wallclock.is_active(), "Wall clock should not stop"); | |
| 3504 _wallclock.stop(); // to record time | |
| 3505 jlong ret = _wallclock.milliseconds(); | |
| 3506 _wallclock.start(); // restart | |
| 3507 return ret; | |
| 3508 } | |
| 3509 }; | |
| 3510 | |
| 3511 CMSPhaseAccounting::CMSPhaseAccounting(CMSCollector *collector, | |
| 3512 const char *phase, | |
| 3513 bool print_cr) : | |
| 3514 _collector(collector), _phase(phase), _print_cr(print_cr) { | |
| 3515 | |
| 3516 if (PrintCMSStatistics != 0) { | |
| 3517 _collector->resetYields(); | |
| 3518 } | |
|
8740
62609ffa2fc6
8008684: CMS: concurrent phase start markers should always be printed
tschatzl
parents:
8736
diff
changeset
|
3519 if (PrintGCDetails) { |
| 0 | 3520 gclog_or_tty->date_stamp(PrintGCDateStamps); |
|
8740
62609ffa2fc6
8008684: CMS: concurrent phase start markers should always be printed
tschatzl
parents:
8736
diff
changeset
|
3521 gclog_or_tty->stamp(PrintGCTimeStamps); |
|
62609ffa2fc6
8008684: CMS: concurrent phase start markers should always be printed
tschatzl
parents:
8736
diff
changeset
|
3522 gclog_or_tty->print_cr("[%s-concurrent-%s-start]", |
| 0 | 3523 _collector->cmsGen()->short_name(), _phase); |
| 3524 } | |
| 3525 _collector->resetTimer(); | |
| 3526 _wallclock.start(); | |
| 3527 _collector->startTimer(); | |
| 3528 } | |
| 3529 | |
| 3530 CMSPhaseAccounting::~CMSPhaseAccounting() { | |
| 3531 assert(_wallclock.is_active(), "Wall clock should not have stopped"); | |
| 3532 _collector->stopTimer(); | |
| 3533 _wallclock.stop(); | |
| 3534 if (PrintGCDetails) { | |
| 3535 gclog_or_tty->date_stamp(PrintGCDateStamps); | |
|
6752
9646b7ff4d14
7198130: G1: PrintReferenceGC output comes out of order
brutisso
parents:
6725
diff
changeset
|
3536 gclog_or_tty->stamp(PrintGCTimeStamps); |
| 0 | 3537 gclog_or_tty->print("[%s-concurrent-%s: %3.3f/%3.3f secs]", |
| 3538 _collector->cmsGen()->short_name(), | |
| 3539 _phase, _collector->timerValue(), _wallclock.seconds()); | |
| 3540 if (_print_cr) { | |
| 3541 gclog_or_tty->print_cr(""); | |
| 3542 } | |
| 3543 if (PrintCMSStatistics != 0) { | |
| 3544 gclog_or_tty->print_cr(" (CMS-concurrent-%s yielded %d times)", _phase, | |
| 3545 _collector->yields()); | |
| 3546 } | |
| 3547 } | |
| 3548 } | |
| 3549 | |
| 3550 // CMS work | |
| 3551 | |
| 3552 // Checkpoint the roots into this generation from outside | |
| 3553 // this generation. [Note this initial checkpoint need only | |
| 3554 // be approximate -- we'll do a catch up phase subsequently.] | |
| 3555 void CMSCollector::checkpointRootsInitial(bool asynch) { | |
| 3556 assert(_collectorState == InitialMarking, "Wrong collector state"); | |
| 3557 check_correct_thread_executing(); | |
|
3356
78542e2b5e35
7036199: Adding a notification to the implementation of GarbageCollectorMXBeans
fparain
parents:
3293
diff
changeset
|
3558 TraceCMSMemoryManagerStats tms(_collectorState,GenCollectedHeap::heap()->gc_cause()); |
|
2125
7246a374a9f2
6458402: 3 jvmti tests fail with CMS and +ExplicitGCInvokesConcurrent
kamg
parents:
1994
diff
changeset
|
3559 |
| 10405 | 3560 save_heap_summary(); |
| 3561 report_heap_summary(GCWhen::BeforeGC); | |
| 3562 | |
| 0 | 3563 ReferenceProcessor* rp = ref_processor(); |
| 3564 SpecializationStats::clear(); | |
| 3565 assert(_restart_addr == NULL, "Control point invariant"); | |
| 3566 if (asynch) { | |
| 3567 // acquire locks for subsequent manipulations | |
| 3568 MutexLockerEx x(bitMapLock(), | |
| 3569 Mutex::_no_safepoint_check_flag); | |
| 3570 checkpointRootsInitialWork(asynch); | |
|
3979
4dfb2df418f2
6484982: G1: process references during evacuation pauses
johnc
parents:
3827
diff
changeset
|
3571 // enable ("weak") refs discovery |
|
4dfb2df418f2
6484982: G1: process references during evacuation pauses
johnc
parents:
3827
diff
changeset
|
3572 rp->enable_discovery(true /*verify_disabled*/, true /*check_no_refs*/); |
| 0 | 3573 _collectorState = Marking; |
| 3574 } else { | |
| 3575 // (Weak) Refs discovery: this is controlled from genCollectedHeap::do_collection | |
| 3576 // which recognizes if we are a CMS generation, and doesn't try to turn on | |
| 3577 // discovery; verify that they aren't meddling. | |
| 3578 assert(!rp->discovery_is_atomic(), | |
| 3579 "incorrect setting of discovery predicate"); | |
| 3580 assert(!rp->discovery_enabled(), "genCollectedHeap shouldn't control " | |
| 3581 "ref discovery for this generation kind"); | |
| 3582 // already have locks | |
| 3583 checkpointRootsInitialWork(asynch); | |
|
3979
4dfb2df418f2
6484982: G1: process references during evacuation pauses
johnc
parents:
3827
diff
changeset
|
3584 // now enable ("weak") refs discovery |
|
4dfb2df418f2
6484982: G1: process references during evacuation pauses
johnc
parents:
3827
diff
changeset
|
3585 rp->enable_discovery(true /*verify_disabled*/, false /*verify_no_refs*/); |
| 0 | 3586 _collectorState = Marking; |
| 3587 } | |
| 3588 SpecializationStats::print(); | |
| 3589 } | |
| 3590 | |
| 3591 void CMSCollector::checkpointRootsInitialWork(bool asynch) { | |
| 3592 assert(SafepointSynchronize::is_at_safepoint(), "world should be stopped"); | |
| 3593 assert(_collectorState == InitialMarking, "just checking"); | |
| 3594 | |
| 3595 // If there has not been a GC[n-1] since last GC[n] cycle completed, | |
| 3596 // precede our marking with a collection of all | |
| 3597 // younger generations to keep floating garbage to a minimum. | |
| 3598 // XXX: we won't do this for now -- it's an optimization to be done later. | |
| 3599 | |
| 3600 // already have locks | |
| 3601 assert_lock_strong(bitMapLock()); | |
| 3602 assert(_markBitMap.isAllClear(), "was reset at end of previous cycle"); | |
| 3603 | |
| 3604 // Setup the verification and class unloading state for this | |
| 3605 // CMS collection cycle. | |
| 3606 setup_cms_unloading_and_verification_state(); | |
| 3607 | |
| 10405 | 3608 NOT_PRODUCT(GCTraceTime t("\ncheckpointRootsInitialWork", |
| 3609 PrintGCDetails && Verbose, true, _gc_timer_cm);) | |
| 0 | 3610 if (UseAdaptiveSizePolicy) { |
| 3611 size_policy()->checkpoint_roots_initial_begin(); | |
| 3612 } | |
| 3613 | |
| 3614 // Reset all the PLAB chunk arrays if necessary. | |
| 3615 if (_survivor_plab_array != NULL && !CMSPLABRecordAlways) { | |
| 3616 reset_survivor_plab_arrays(); | |
| 3617 } | |
| 3618 | |
| 3619 ResourceMark rm; | |
| 3620 HandleMark hm; | |
| 3621 | |
| 3622 FalseClosure falseClosure; | |
| 3623 // In the case of a synchronous collection, we will elide the | |
| 3624 // remark step, so it's important to catch all the nmethod oops | |
|
994
753cf9794df9
6885169: merge of 4957990 and 6863023 causes conflict on do_nmethods
jrose
parents:
993
diff
changeset
|
3625 // in this step. |
|
753cf9794df9
6885169: merge of 4957990 and 6863023 causes conflict on do_nmethods
jrose
parents:
993
diff
changeset
|
3626 // The final 'true' flag to gen_process_strong_roots will ensure this. |
|
753cf9794df9
6885169: merge of 4957990 and 6863023 causes conflict on do_nmethods
jrose
parents:
993
diff
changeset
|
3627 // If 'async' is true, we can relax the nmethod tracing. |
|
753cf9794df9
6885169: merge of 4957990 and 6863023 causes conflict on do_nmethods
jrose
parents:
993
diff
changeset
|
3628 MarkRefsIntoClosure notOlder(_span, &_markBitMap); |
| 0 | 3629 GenCollectedHeap* gch = GenCollectedHeap::heap(); |
| 3630 | |
| 3631 verify_work_stacks_empty(); | |
| 3632 verify_overflow_empty(); | |
| 3633 | |
| 3634 gch->ensure_parsability(false); // fill TLABs, but no need to retire them | |
| 3635 // Update the saved marks which may affect the root scans. | |
| 3636 gch->save_marks(); | |
| 3637 | |
| 3638 // weak reference processing has not started yet. | |
| 3639 ref_processor()->set_enqueuing_is_done(false); | |
| 3640 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3641 // Need to remember all newly created CLDs, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3642 // so that we can guarantee that the remark finds them. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3643 ClassLoaderDataGraph::remember_new_clds(true); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3644 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3645 // Whenever a CLD is found, it will be claimed before proceeding to mark |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3646 // the klasses. The claimed marks need to be cleared before marking starts. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3647 ClassLoaderDataGraph::clear_claimed_marks(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3648 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3649 CMKlassClosure klass_closure(¬Older); |
| 0 | 3650 { |
| 3651 COMPILER2_PRESENT(DerivedPointerTableDeactivate dpt_deact;) | |
| 3652 gch->rem_set()->prepare_for_younger_refs_iterate(false); // Not parallel. | |
| 3653 gch->gen_process_strong_roots(_cmsGen->level(), | |
| 3654 true, // younger gens are roots | |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
3655 true, // activate StrongRootsScope |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3656 false, // not scavenging |
| 0 | 3657 SharedHeap::ScanningOption(roots_scanning_options()), |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
3658 ¬Older, |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
3659 true, // walk all of code cache if (so & SO_CodeCache) |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3660 NULL, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3661 &klass_closure); |
| 0 | 3662 } |
| 3663 | |
| 3664 // Clear mod-union table; it will be dirtied in the prologue of | |
| 3665 // CMS generation per each younger generation collection. | |
| 3666 | |
| 3667 assert(_modUnionTable.isAllClear(), | |
| 3668 "Was cleared in most recent final checkpoint phase" | |
| 3669 " or no bits are set in the gc_prologue before the start of the next " | |
| 3670 "subsequent marking phase."); | |
| 3671 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3672 assert(_ct->klass_rem_set()->mod_union_is_clear(), "Must be"); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3673 |
| 0 | 3674 // Save the end of the used_region of the constituent generations |
| 3675 // to be used to limit the extent of sweep in each generation. | |
| 3676 save_sweep_limits(); | |
| 3677 if (UseAdaptiveSizePolicy) { | |
| 3678 size_policy()->checkpoint_roots_initial_end(gch->gc_cause()); | |
| 3679 } | |
| 3680 verify_overflow_empty(); | |
| 3681 } | |
| 3682 | |
| 3683 bool CMSCollector::markFromRoots(bool asynch) { | |
| 3684 // we might be tempted to assert that: | |
| 3685 // assert(asynch == !SafepointSynchronize::is_at_safepoint(), | |
| 3686 // "inconsistent argument?"); | |
| 3687 // However that wouldn't be right, because it's possible that | |
| 3688 // a safepoint is indeed in progress as a younger generation | |
| 3689 // stop-the-world GC happens even as we mark in this generation. | |
| 3690 assert(_collectorState == Marking, "inconsistent state?"); | |
| 3691 check_correct_thread_executing(); | |
| 3692 verify_overflow_empty(); | |
| 3693 | |
| 3694 bool res; | |
| 3695 if (asynch) { | |
| 3696 | |
| 3697 // Start the timers for adaptive size policy for the concurrent phases | |
| 3698 // Do it here so that the foreground MS can use the concurrent | |
| 3699 // timer since a foreground MS might has the sweep done concurrently | |
| 3700 // or STW. | |
| 3701 if (UseAdaptiveSizePolicy) { | |
| 3702 size_policy()->concurrent_marking_begin(); | |
| 3703 } | |
| 3704 | |
| 3705 // Weak ref discovery note: We may be discovering weak | |
| 3706 // refs in this generation concurrent (but interleaved) with | |
| 3707 // weak ref discovery by a younger generation collector. | |
| 3708 | |
| 3709 CMSTokenSyncWithLocks ts(true, bitMapLock()); | |
| 3710 TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); | |
| 3711 CMSPhaseAccounting pa(this, "mark", !PrintGCDetails); | |
| 3712 res = markFromRootsWork(asynch); | |
| 3713 if (res) { | |
| 3714 _collectorState = Precleaning; | |
| 3715 } else { // We failed and a foreground collection wants to take over | |
| 3716 assert(_foregroundGCIsActive, "internal state inconsistency"); | |
| 3717 assert(_restart_addr == NULL, "foreground will restart from scratch"); | |
| 3718 if (PrintGCDetails) { | |
| 3719 gclog_or_tty->print_cr("bailing out to foreground collection"); | |
| 3720 } | |
| 3721 } | |
| 3722 if (UseAdaptiveSizePolicy) { | |
| 3723 size_policy()->concurrent_marking_end(); | |
| 3724 } | |
| 3725 } else { | |
| 3726 assert(SafepointSynchronize::is_at_safepoint(), | |
| 3727 "inconsistent with asynch == false"); | |
| 3728 if (UseAdaptiveSizePolicy) { | |
| 3729 size_policy()->ms_collection_marking_begin(); | |
| 3730 } | |
| 3731 // already have locks | |
| 3732 res = markFromRootsWork(asynch); | |
| 3733 _collectorState = FinalMarking; | |
| 3734 if (UseAdaptiveSizePolicy) { | |
| 3735 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 3736 size_policy()->ms_collection_marking_end(gch->gc_cause()); | |
| 3737 } | |
| 3738 } | |
| 3739 verify_overflow_empty(); | |
| 3740 return res; | |
| 3741 } | |
| 3742 | |
| 3743 bool CMSCollector::markFromRootsWork(bool asynch) { | |
| 3744 // iterate over marked bits in bit map, doing a full scan and mark | |
| 3745 // from these roots using the following algorithm: | |
| 3746 // . if oop is to the right of the current scan pointer, | |
| 3747 // mark corresponding bit (we'll process it later) | |
| 3748 // . else (oop is to left of current scan pointer) | |
| 3749 // push oop on marking stack | |
| 3750 // . drain the marking stack | |
| 3751 | |
| 3752 // Note that when we do a marking step we need to hold the | |
| 3753 // bit map lock -- recall that direct allocation (by mutators) | |
| 3754 // and promotion (by younger generation collectors) is also | |
| 3755 // marking the bit map. [the so-called allocate live policy.] | |
| 3756 // Because the implementation of bit map marking is not | |
| 3757 // robust wrt simultaneous marking of bits in the same word, | |
| 3758 // we need to make sure that there is no such interference | |
| 3759 // between concurrent such updates. | |
| 3760 | |
| 3761 // already have locks | |
| 3762 assert_lock_strong(bitMapLock()); | |
| 3763 | |
| 3764 verify_work_stacks_empty(); | |
| 3765 verify_overflow_empty(); | |
| 3766 bool result = false; | |
| 1284 | 3767 if (CMSConcurrentMTEnabled && ConcGCThreads > 0) { |
| 0 | 3768 result = do_marking_mt(asynch); |
| 3769 } else { | |
| 3770 result = do_marking_st(asynch); | |
| 3771 } | |
| 3772 return result; | |
| 3773 } | |
| 3774 | |
| 3775 // Forward decl | |
| 3776 class CMSConcMarkingTask; | |
| 3777 | |
| 3778 class CMSConcMarkingTerminator: public ParallelTaskTerminator { | |
| 3779 CMSCollector* _collector; | |
| 3780 CMSConcMarkingTask* _task; | |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3781 public: |
| 0 | 3782 virtual void yield(); |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3783 |
| 0 | 3784 // "n_threads" is the number of threads to be terminated. |
| 3785 // "queue_set" is a set of work queues of other threads. | |
| 3786 // "collector" is the CMS collector associated with this task terminator. | |
| 3787 // "yield" indicates whether we need the gang as a whole to yield. | |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3788 CMSConcMarkingTerminator(int n_threads, TaskQueueSetSuper* queue_set, CMSCollector* collector) : |
| 0 | 3789 ParallelTaskTerminator(n_threads, queue_set), |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3790 _collector(collector) { } |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3791 |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3792 void set_task(CMSConcMarkingTask* task) { |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3793 _task = task; |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3794 } |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3795 }; |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3796 |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3797 class CMSConcMarkingTerminatorTerminator: public TerminatorTerminator { |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3798 CMSConcMarkingTask* _task; |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3799 public: |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3800 bool should_exit_termination(); |
| 0 | 3801 void set_task(CMSConcMarkingTask* task) { |
| 3802 _task = task; | |
| 3803 } | |
| 3804 }; | |
| 3805 | |
| 3806 // MT Concurrent Marking Task | |
| 3807 class CMSConcMarkingTask: public YieldingFlexibleGangTask { | |
| 3808 CMSCollector* _collector; | |
| 3809 int _n_workers; // requested/desired # workers | |
| 3810 bool _asynch; | |
| 3811 bool _result; | |
| 3812 CompactibleFreeListSpace* _cms_space; | |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3813 char _pad_front[64]; // padding to ... |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3814 HeapWord* _global_finger; // ... avoid sharing cache line |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3815 char _pad_back[64]; |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
3816 HeapWord* _restart_addr; |
| 0 | 3817 |
| 3818 // Exposed here for yielding support | |
| 3819 Mutex* const _bit_map_lock; | |
| 3820 | |
| 3821 // The per thread work queues, available here for stealing | |
| 3822 OopTaskQueueSet* _task_queues; | |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3823 |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3824 // Termination (and yielding) support |
| 0 | 3825 CMSConcMarkingTerminator _term; |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3826 CMSConcMarkingTerminatorTerminator _term_term; |
| 0 | 3827 |
| 3828 public: | |
| 3829 CMSConcMarkingTask(CMSCollector* collector, | |
| 3830 CompactibleFreeListSpace* cms_space, | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3831 bool asynch, |
| 0 | 3832 YieldingFlexibleWorkGang* workers, |
| 3833 OopTaskQueueSet* task_queues): | |
| 3834 YieldingFlexibleGangTask("Concurrent marking done multi-threaded"), | |
| 3835 _collector(collector), | |
| 3836 _cms_space(cms_space), | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3837 _asynch(asynch), _n_workers(0), _result(true), |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3838 _task_queues(task_queues), |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3839 _term(_n_workers, task_queues, _collector), |
| 0 | 3840 _bit_map_lock(collector->bitMapLock()) |
| 3841 { | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3842 _requested_size = _n_workers; |
| 0 | 3843 _term.set_task(this); |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3844 _term_term.set_task(this); |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
3845 _restart_addr = _global_finger = _cms_space->bottom(); |
| 0 | 3846 } |
| 3847 | |
| 3848 | |
| 3849 OopTaskQueueSet* task_queues() { return _task_queues; } | |
| 3850 | |
| 3851 OopTaskQueue* work_queue(int i) { return task_queues()->queue(i); } | |
| 3852 | |
| 3853 HeapWord** global_finger_addr() { return &_global_finger; } | |
| 3854 | |
| 3855 CMSConcMarkingTerminator* terminator() { return &_term; } | |
| 3856 | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3857 virtual void set_for_termination(int active_workers) { |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3858 terminator()->reset_for_reuse(active_workers); |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3859 } |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3860 |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
3861 void work(uint worker_id); |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3862 bool should_yield() { |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3863 return ConcurrentMarkSweepThread::should_yield() |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3864 && !_collector->foregroundGCIsActive() |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3865 && _asynch; |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3866 } |
| 0 | 3867 |
| 3868 virtual void coordinator_yield(); // stuff done by coordinator | |
| 3869 bool result() { return _result; } | |
| 3870 | |
| 3871 void reset(HeapWord* ra) { | |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
3872 assert(_global_finger >= _cms_space->end(), "Postcondition of ::work(i)"); |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
3873 _restart_addr = _global_finger = ra; |
| 0 | 3874 _term.reset_for_reuse(); |
| 3875 } | |
| 3876 | |
| 3877 static bool get_work_from_overflow_stack(CMSMarkStack* ovflw_stk, | |
| 3878 OopTaskQueue* work_q); | |
| 3879 | |
| 3880 private: | |
| 3881 void do_scan_and_mark(int i, CompactibleFreeListSpace* sp); | |
| 3882 void do_work_steal(int i); | |
| 3883 void bump_global_finger(HeapWord* f); | |
| 3884 }; | |
| 3885 | |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3886 bool CMSConcMarkingTerminatorTerminator::should_exit_termination() { |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3887 assert(_task != NULL, "Error"); |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3888 return _task->yielding(); |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3889 // Note that we do not need the disjunct || _task->should_yield() above |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3890 // because we want terminating threads to yield only if the task |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3891 // is already in the midst of yielding, which happens only after at least one |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3892 // thread has yielded. |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3893 } |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3894 |
| 0 | 3895 void CMSConcMarkingTerminator::yield() { |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
3896 if (_task->should_yield()) { |
| 0 | 3897 _task->yield(); |
| 3898 } else { | |
| 3899 ParallelTaskTerminator::yield(); | |
| 3900 } | |
| 3901 } | |
| 3902 | |
| 3903 //////////////////////////////////////////////////////////////// | |
| 3904 // Concurrent Marking Algorithm Sketch | |
| 3905 //////////////////////////////////////////////////////////////// | |
| 3906 // Until all tasks exhausted (both spaces): | |
| 3907 // -- claim next available chunk | |
| 3908 // -- bump global finger via CAS | |
| 3909 // -- find first object that starts in this chunk | |
| 3910 // and start scanning bitmap from that position | |
| 3911 // -- scan marked objects for oops | |
| 3912 // -- CAS-mark target, and if successful: | |
| 3913 // . if target oop is above global finger (volatile read) | |
| 3914 // nothing to do | |
| 3915 // . if target oop is in chunk and above local finger | |
| 3916 // then nothing to do | |
| 3917 // . else push on work-queue | |
| 3918 // -- Deal with possible overflow issues: | |
| 3919 // . local work-queue overflow causes stuff to be pushed on | |
| 3920 // global (common) overflow queue | |
| 3921 // . always first empty local work queue | |
| 3922 // . then get a batch of oops from global work queue if any | |
| 3923 // . then do work stealing | |
| 3924 // -- When all tasks claimed (both spaces) | |
| 3925 // and local work queue empty, | |
| 3926 // then in a loop do: | |
| 3927 // . check global overflow stack; steal a batch of oops and trace | |
| 3928 // . try to steal from other threads oif GOS is empty | |
| 3929 // . if neither is available, offer termination | |
| 3930 // -- Terminate and return result | |
| 3931 // | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
3932 void CMSConcMarkingTask::work(uint worker_id) { |
| 0 | 3933 elapsedTimer _timer; |
| 3934 ResourceMark rm; | |
| 3935 HandleMark hm; | |
| 3936 | |
| 3937 DEBUG_ONLY(_collector->verify_overflow_empty();) | |
| 3938 | |
| 3939 // Before we begin work, our work queue should be empty | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
3940 assert(work_queue(worker_id)->size() == 0, "Expected to be empty"); |
| 0 | 3941 // Scan the bitmap covering _cms_space, tracing through grey objects. |
| 3942 _timer.start(); | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
3943 do_scan_and_mark(worker_id, _cms_space); |
| 0 | 3944 _timer.stop(); |
| 3945 if (PrintCMSStatistics != 0) { | |
| 3946 gclog_or_tty->print_cr("Finished cms space scanning in %dth thread: %3.3f sec", | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
3947 worker_id, _timer.seconds()); |
|
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
3948 // XXX: need xxx/xxx type of notation, two timers |
| 0 | 3949 } |
| 3950 | |
| 3951 // ... do work stealing | |
| 3952 _timer.reset(); | |
| 3953 _timer.start(); | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
3954 do_work_steal(worker_id); |
| 0 | 3955 _timer.stop(); |
| 3956 if (PrintCMSStatistics != 0) { | |
| 3957 gclog_or_tty->print_cr("Finished work stealing in %dth thread: %3.3f sec", | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
3958 worker_id, _timer.seconds()); |
|
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
3959 // XXX: need xxx/xxx type of notation, two timers |
| 0 | 3960 } |
| 3961 assert(_collector->_markStack.isEmpty(), "Should have been emptied"); | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
3962 assert(work_queue(worker_id)->size() == 0, "Should have been emptied"); |
| 0 | 3963 // Note that under the current task protocol, the |
| 3964 // following assertion is true even of the spaces | |
| 3965 // expanded since the completion of the concurrent | |
| 3966 // marking. XXX This will likely change under a strict | |
| 3967 // ABORT semantics. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3968 // After perm removal the comparison was changed to |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3969 // greater than or equal to from strictly greater than. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3970 // Before perm removal the highest address sweep would |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3971 // have been at the end of perm gen but now is at the |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3972 // end of the tenured gen. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
3973 assert(_global_finger >= _cms_space->end(), |
| 0 | 3974 "All tasks have been completed"); |
| 3975 DEBUG_ONLY(_collector->verify_overflow_empty();) | |
| 3976 } | |
| 3977 | |
| 3978 void CMSConcMarkingTask::bump_global_finger(HeapWord* f) { | |
| 3979 HeapWord* read = _global_finger; | |
| 3980 HeapWord* cur = read; | |
| 3981 while (f > read) { | |
| 3982 cur = read; | |
| 3983 read = (HeapWord*) Atomic::cmpxchg_ptr(f, &_global_finger, cur); | |
| 3984 if (cur == read) { | |
| 3985 // our cas succeeded | |
| 3986 assert(_global_finger >= f, "protocol consistency"); | |
| 3987 break; | |
| 3988 } | |
| 3989 } | |
| 3990 } | |
| 3991 | |
| 3992 // This is really inefficient, and should be redone by | |
| 3993 // using (not yet available) block-read and -write interfaces to the | |
| 3994 // stack and the work_queue. XXX FIX ME !!! | |
| 3995 bool CMSConcMarkingTask::get_work_from_overflow_stack(CMSMarkStack* ovflw_stk, | |
| 3996 OopTaskQueue* work_q) { | |
| 3997 // Fast lock-free check | |
| 3998 if (ovflw_stk->length() == 0) { | |
| 3999 return false; | |
| 4000 } | |
| 4001 assert(work_q->size() == 0, "Shouldn't steal"); | |
| 4002 MutexLockerEx ml(ovflw_stk->par_lock(), | |
| 4003 Mutex::_no_safepoint_check_flag); | |
| 4004 // Grab up to 1/4 the size of the work queue | |
|
679
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
628
diff
changeset
|
4005 size_t num = MIN2((size_t)(work_q->max_elems() - work_q->size())/4, |
| 0 | 4006 (size_t)ParGCDesiredObjsFromOverflowList); |
| 4007 num = MIN2(num, ovflw_stk->length()); | |
| 4008 for (int i = (int) num; i > 0; i--) { | |
| 4009 oop cur = ovflw_stk->pop(); | |
| 4010 assert(cur != NULL, "Counted wrong?"); | |
| 4011 work_q->push(cur); | |
| 4012 } | |
| 4013 return num > 0; | |
| 4014 } | |
| 4015 | |
| 4016 void CMSConcMarkingTask::do_scan_and_mark(int i, CompactibleFreeListSpace* sp) { | |
| 4017 SequentialSubTasksDone* pst = sp->conc_par_seq_tasks(); | |
| 4018 int n_tasks = pst->n_tasks(); | |
| 4019 // We allow that there may be no tasks to do here because | |
| 4020 // we are restarting after a stack overflow. | |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4021 assert(pst->valid() || n_tasks == 0, "Uninitialized use?"); |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
4022 uint nth_task = 0; |
| 0 | 4023 |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4024 HeapWord* aligned_start = sp->bottom(); |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4025 if (sp->used_region().contains(_restart_addr)) { |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4026 // Align down to a card boundary for the start of 0th task |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4027 // for this space. |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4028 aligned_start = |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4029 (HeapWord*)align_size_down((uintptr_t)_restart_addr, |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4030 CardTableModRefBS::card_size); |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4031 } |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4032 |
| 0 | 4033 size_t chunk_size = sp->marking_task_size(); |
| 4034 while (!pst->is_task_claimed(/* reference */ nth_task)) { | |
| 4035 // Having claimed the nth task in this space, | |
| 4036 // compute the chunk that it corresponds to: | |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4037 MemRegion span = MemRegion(aligned_start + nth_task*chunk_size, |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4038 aligned_start + (nth_task+1)*chunk_size); |
| 0 | 4039 // Try and bump the global finger via a CAS; |
| 4040 // note that we need to do the global finger bump | |
| 4041 // _before_ taking the intersection below, because | |
| 4042 // the task corresponding to that region will be | |
| 4043 // deemed done even if the used_region() expands | |
| 4044 // because of allocation -- as it almost certainly will | |
| 4045 // during start-up while the threads yield in the | |
| 4046 // closure below. | |
| 4047 HeapWord* finger = span.end(); | |
| 4048 bump_global_finger(finger); // atomically | |
| 4049 // There are null tasks here corresponding to chunks | |
| 4050 // beyond the "top" address of the space. | |
| 4051 span = span.intersection(sp->used_region()); | |
| 4052 if (!span.is_empty()) { // Non-null task | |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4053 HeapWord* prev_obj; |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4054 assert(!span.contains(_restart_addr) || nth_task == 0, |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4055 "Inconsistency"); |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4056 if (nth_task == 0) { |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4057 // For the 0th task, we'll not need to compute a block_start. |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4058 if (span.contains(_restart_addr)) { |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4059 // In the case of a restart because of stack overflow, |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4060 // we might additionally skip a chunk prefix. |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4061 prev_obj = _restart_addr; |
| 0 | 4062 } else { |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4063 prev_obj = span.start(); |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4064 } |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4065 } else { |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4066 // We want to skip the first object because |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4067 // the protocol is to scan any object in its entirety |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4068 // that _starts_ in this span; a fortiori, any |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4069 // object starting in an earlier span is scanned |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4070 // as part of an earlier claimed task. |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4071 // Below we use the "careful" version of block_start |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4072 // so we do not try to navigate uninitialized objects. |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4073 prev_obj = sp->block_start_careful(span.start()); |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4074 // Below we use a variant of block_size that uses the |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4075 // Printezis bits to avoid waiting for allocated |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4076 // objects to become initialized/parsable. |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4077 while (prev_obj < span.start()) { |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4078 size_t sz = sp->block_size_no_stall(prev_obj, _collector); |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4079 if (sz > 0) { |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4080 prev_obj += sz; |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4081 } else { |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4082 // In this case we may end up doing a bit of redundant |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4083 // scanning, but that appears unavoidable, short of |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4084 // locking the free list locks; see bug 6324141. |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4085 break; |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4086 } |
| 0 | 4087 } |
| 4088 } | |
| 4089 if (prev_obj < span.end()) { | |
| 4090 MemRegion my_span = MemRegion(prev_obj, span.end()); | |
| 4091 // Do the marking work within a non-empty span -- | |
| 4092 // the last argument to the constructor indicates whether the | |
| 4093 // iteration should be incremental with periodic yields. | |
| 4094 Par_MarkFromRootsClosure cl(this, _collector, my_span, | |
| 4095 &_collector->_markBitMap, | |
| 4096 work_queue(i), | |
| 4097 &_collector->_markStack, | |
| 4098 _asynch); | |
| 4099 _collector->_markBitMap.iterate(&cl, my_span.start(), my_span.end()); | |
| 4100 } // else nothing to do for this task | |
| 4101 } // else nothing to do for this task | |
| 4102 } | |
| 4103 // We'd be tempted to assert here that since there are no | |
| 4104 // more tasks left to claim in this space, the global_finger | |
| 4105 // must exceed space->top() and a fortiori space->end(). However, | |
| 4106 // that would not quite be correct because the bumping of | |
| 4107 // global_finger occurs strictly after the claiming of a task, | |
| 4108 // so by the time we reach here the global finger may not yet | |
| 4109 // have been bumped up by the thread that claimed the last | |
| 4110 // task. | |
| 4111 pst->all_tasks_completed(); | |
| 4112 } | |
| 4113 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4114 class Par_ConcMarkingClosure: public CMSOopClosure { |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4115 private: |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4116 CMSCollector* _collector; |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4117 CMSConcMarkingTask* _task; |
| 0 | 4118 MemRegion _span; |
| 4119 CMSBitMap* _bit_map; | |
| 4120 CMSMarkStack* _overflow_stack; | |
| 4121 OopTaskQueue* _work_queue; | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4122 protected: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4123 DO_OOP_WORK_DEFN |
| 0 | 4124 public: |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4125 Par_ConcMarkingClosure(CMSCollector* collector, CMSConcMarkingTask* task, OopTaskQueue* work_queue, |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4126 CMSBitMap* bit_map, CMSMarkStack* overflow_stack): |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4127 CMSOopClosure(collector->ref_processor()), |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4128 _collector(collector), |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4129 _task(task), |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4130 _span(collector->_span), |
| 0 | 4131 _work_queue(work_queue), |
| 4132 _bit_map(bit_map), | |
| 935 | 4133 _overflow_stack(overflow_stack) |
| 4134 { } | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4135 virtual void do_oop(oop* p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4136 virtual void do_oop(narrowOop* p); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4137 |
| 0 | 4138 void trim_queue(size_t max); |
| 4139 void handle_stack_overflow(HeapWord* lost); | |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4140 void do_yield_check() { |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4141 if (_task->should_yield()) { |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4142 _task->yield(); |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4143 } |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4144 } |
| 0 | 4145 }; |
| 4146 | |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4147 // Grey object scanning during work stealing phase -- |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4148 // the salient assumption here is that any references |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4149 // that are in these stolen objects being scanned must |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4150 // already have been initialized (else they would not have |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4151 // been published), so we do not need to check for |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4152 // uninitialized objects before pushing here. |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4153 void Par_ConcMarkingClosure::do_oop(oop obj) { |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4154 assert(obj->is_oop_or_null(true), "expected an oop or NULL"); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4155 HeapWord* addr = (HeapWord*)obj; |
| 0 | 4156 // Check if oop points into the CMS generation |
| 4157 // and is not marked | |
| 4158 if (_span.contains(addr) && !_bit_map->isMarked(addr)) { | |
| 4159 // a white object ... | |
| 4160 // If we manage to "claim" the object, by being the | |
| 4161 // first thread to mark it, then we push it on our | |
| 4162 // marking stack | |
| 4163 if (_bit_map->par_mark(addr)) { // ... now grey | |
| 4164 // push on work queue (grey set) | |
| 4165 bool simulate_overflow = false; | |
| 4166 NOT_PRODUCT( | |
| 4167 if (CMSMarkStackOverflowALot && | |
| 4168 _collector->simulate_overflow()) { | |
| 4169 // simulate a stack overflow | |
| 4170 simulate_overflow = true; | |
| 4171 } | |
| 4172 ) | |
| 4173 if (simulate_overflow || | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4174 !(_work_queue->push(obj) || _overflow_stack->par_push(obj))) { |
| 0 | 4175 // stack overflow |
| 4176 if (PrintCMSStatistics != 0) { | |
| 4177 gclog_or_tty->print_cr("CMS marking stack overflow (benign) at " | |
| 4178 SIZE_FORMAT, _overflow_stack->capacity()); | |
| 4179 } | |
| 4180 // We cannot assert that the overflow stack is full because | |
| 4181 // it may have been emptied since. | |
| 4182 assert(simulate_overflow || | |
| 4183 _work_queue->size() == _work_queue->max_elems(), | |
| 4184 "Else push should have succeeded"); | |
| 4185 handle_stack_overflow(addr); | |
| 4186 } | |
| 4187 } // Else, some other thread got there first | |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4188 do_yield_check(); |
| 0 | 4189 } |
| 4190 } | |
| 4191 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4192 void Par_ConcMarkingClosure::do_oop(oop* p) { Par_ConcMarkingClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4193 void Par_ConcMarkingClosure::do_oop(narrowOop* p) { Par_ConcMarkingClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4194 |
| 0 | 4195 void Par_ConcMarkingClosure::trim_queue(size_t max) { |
| 4196 while (_work_queue->size() > max) { | |
| 4197 oop new_oop; | |
| 4198 if (_work_queue->pop_local(new_oop)) { | |
| 4199 assert(new_oop->is_oop(), "Should be an oop"); | |
| 4200 assert(_bit_map->isMarked((HeapWord*)new_oop), "Grey object"); | |
| 4201 assert(_span.contains((HeapWord*)new_oop), "Not in span"); | |
| 4202 new_oop->oop_iterate(this); // do_oop() above | |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4203 do_yield_check(); |
| 0 | 4204 } |
| 4205 } | |
| 4206 } | |
| 4207 | |
| 4208 // Upon stack overflow, we discard (part of) the stack, | |
| 4209 // remembering the least address amongst those discarded | |
| 4210 // in CMSCollector's _restart_address. | |
| 4211 void Par_ConcMarkingClosure::handle_stack_overflow(HeapWord* lost) { | |
| 4212 // We need to do this under a mutex to prevent other | |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
4213 // workers from interfering with the work done below. |
| 0 | 4214 MutexLockerEx ml(_overflow_stack->par_lock(), |
| 4215 Mutex::_no_safepoint_check_flag); | |
| 4216 // Remember the least grey address discarded | |
| 4217 HeapWord* ra = (HeapWord*)_overflow_stack->least_value(lost); | |
| 4218 _collector->lower_restart_addr(ra); | |
| 4219 _overflow_stack->reset(); // discard stack contents | |
| 4220 _overflow_stack->expand(); // expand the stack if possible | |
| 4221 } | |
| 4222 | |
| 4223 | |
| 4224 void CMSConcMarkingTask::do_work_steal(int i) { | |
| 4225 OopTaskQueue* work_q = work_queue(i); | |
| 4226 oop obj_to_scan; | |
| 4227 CMSBitMap* bm = &(_collector->_markBitMap); | |
| 4228 CMSMarkStack* ovflw = &(_collector->_markStack); | |
| 4229 int* seed = _collector->hash_seed(i); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4230 Par_ConcMarkingClosure cl(_collector, this, work_q, bm, ovflw); |
| 0 | 4231 while (true) { |
| 4232 cl.trim_queue(0); | |
| 4233 assert(work_q->size() == 0, "Should have been emptied above"); | |
| 4234 if (get_work_from_overflow_stack(ovflw, work_q)) { | |
| 4235 // Can't assert below because the work obtained from the | |
| 4236 // overflow stack may already have been stolen from us. | |
| 4237 // assert(work_q->size() > 0, "Work from overflow stack"); | |
| 4238 continue; | |
| 4239 } else if (task_queues()->steal(i, seed, /* reference */ obj_to_scan)) { | |
| 4240 assert(obj_to_scan->is_oop(), "Should be an oop"); | |
| 4241 assert(bm->isMarked((HeapWord*)obj_to_scan), "Grey object"); | |
| 4242 obj_to_scan->oop_iterate(&cl); | |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4243 } else if (terminator()->offer_termination(&_term_term)) { |
| 0 | 4244 assert(work_q->size() == 0, "Impossible!"); |
| 4245 break; | |
|
1837
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4246 } else if (yielding() || should_yield()) { |
|
c99c53f07c14
6692906: CMS: parallel concurrent marking may be prone to hanging or stalling mutators for periods of time
ysr
parents:
1836
diff
changeset
|
4247 yield(); |
| 0 | 4248 } |
| 4249 } | |
| 4250 } | |
| 4251 | |
| 4252 // This is run by the CMS (coordinator) thread. | |
| 4253 void CMSConcMarkingTask::coordinator_yield() { | |
| 4254 assert(ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 4255 "CMS thread should hold CMS token"); | |
| 4256 // First give up the locks, then yield, then re-lock | |
| 4257 // We should probably use a constructor/destructor idiom to | |
| 4258 // do this unlock/lock or modify the MutexUnlocker class to | |
| 4259 // serve our purpose. XXX | |
| 4260 assert_lock_strong(_bit_map_lock); | |
| 4261 _bit_map_lock->unlock(); | |
| 4262 ConcurrentMarkSweepThread::desynchronize(true); | |
| 4263 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 4264 _collector->stopTimer(); | |
| 4265 if (PrintCMSStatistics != 0) { | |
| 4266 _collector->incrementYields(); | |
| 4267 } | |
| 4268 _collector->icms_wait(); | |
| 4269 | |
| 4270 // It is possible for whichever thread initiated the yield request | |
| 4271 // not to get a chance to wake up and take the bitmap lock between | |
| 4272 // this thread releasing it and reacquiring it. So, while the | |
| 4273 // should_yield() flag is on, let's sleep for a bit to give the | |
| 4274 // other thread a chance to wake up. The limit imposed on the number | |
| 4275 // of iterations is defensive, to avoid any unforseen circumstances | |
| 4276 // putting us into an infinite loop. Since it's always been this | |
| 4277 // (coordinator_yield()) method that was observed to cause the | |
| 4278 // problem, we are using a parameter (CMSCoordinatorYieldSleepCount) | |
| 4279 // which is by default non-zero. For the other seven methods that | |
| 4280 // also perform the yield operation, as are using a different | |
| 4281 // parameter (CMSYieldSleepCount) which is by default zero. This way we | |
| 4282 // can enable the sleeping for those methods too, if necessary. | |
| 4283 // See 6442774. | |
| 4284 // | |
| 4285 // We really need to reconsider the synchronization between the GC | |
| 4286 // thread and the yield-requesting threads in the future and we | |
| 4287 // should really use wait/notify, which is the recommended | |
| 4288 // way of doing this type of interaction. Additionally, we should | |
| 4289 // consolidate the eight methods that do the yield operation and they | |
| 4290 // are almost identical into one for better maintenability and | |
| 4291 // readability. See 6445193. | |
| 4292 // | |
| 4293 // Tony 2006.06.29 | |
| 4294 for (unsigned i = 0; i < CMSCoordinatorYieldSleepCount && | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4295 ConcurrentMarkSweepThread::should_yield() && |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
4296 !CMSCollector::foregroundGCIsActive(); ++i) { |
| 0 | 4297 os::sleep(Thread::current(), 1, false); |
| 4298 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 4299 } | |
| 4300 | |
| 4301 ConcurrentMarkSweepThread::synchronize(true); | |
| 4302 _bit_map_lock->lock_without_safepoint_check(); | |
| 4303 _collector->startTimer(); | |
| 4304 } | |
| 4305 | |
| 4306 bool CMSCollector::do_marking_mt(bool asynch) { | |
| 1284 | 4307 assert(ConcGCThreads > 0 && conc_workers() != NULL, "precondition"); |
|
4095
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
4308 int num_workers = AdaptiveSizePolicy::calc_active_conc_workers( |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
4309 conc_workers()->total_workers(), |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
4310 conc_workers()->active_workers(), |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
4311 Threads::number_of_non_daemon_threads()); |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
4312 conc_workers()->set_active_workers(num_workers); |
| 0 | 4313 |
| 4314 CompactibleFreeListSpace* cms_space = _cmsGen->cmsSpace(); | |
| 4315 | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
4316 CMSConcMarkingTask tsk(this, |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
4317 cms_space, |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
4318 asynch, |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
4319 conc_workers(), |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
4320 task_queues()); |
| 0 | 4321 |
| 4322 // Since the actual number of workers we get may be different | |
| 4323 // from the number we requested above, do we need to do anything different | |
| 4324 // below? In particular, may be we need to subclass the SequantialSubTasksDone | |
| 4325 // class?? XXX | |
| 4326 cms_space ->initialize_sequential_subtasks_for_marking(num_workers); | |
| 4327 | |
| 4328 // Refs discovery is already non-atomic. | |
| 4329 assert(!ref_processor()->discovery_is_atomic(), "Should be non-atomic"); | |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
4330 assert(ref_processor()->discovery_is_mt(), "Discovery should be MT"); |
| 0 | 4331 conc_workers()->start_task(&tsk); |
| 4332 while (tsk.yielded()) { | |
| 4333 tsk.coordinator_yield(); | |
| 4334 conc_workers()->continue_task(&tsk); | |
| 4335 } | |
| 4336 // If the task was aborted, _restart_addr will be non-NULL | |
| 4337 assert(tsk.completed() || _restart_addr != NULL, "Inconsistency"); | |
| 4338 while (_restart_addr != NULL) { | |
| 4339 // XXX For now we do not make use of ABORTED state and have not | |
| 4340 // yet implemented the right abort semantics (even in the original | |
| 4341 // single-threaded CMS case). That needs some more investigation | |
| 4342 // and is deferred for now; see CR# TBF. 07252005YSR. XXX | |
| 4343 assert(!CMSAbortSemantics || tsk.aborted(), "Inconsistency"); | |
| 4344 // If _restart_addr is non-NULL, a marking stack overflow | |
| 605 | 4345 // occurred; we need to do a fresh marking iteration from the |
| 0 | 4346 // indicated restart address. |
| 4347 if (_foregroundGCIsActive && asynch) { | |
| 4348 // We may be running into repeated stack overflows, having | |
| 4349 // reached the limit of the stack size, while making very | |
| 4350 // slow forward progress. It may be best to bail out and | |
| 4351 // let the foreground collector do its job. | |
| 4352 // Clear _restart_addr, so that foreground GC | |
| 4353 // works from scratch. This avoids the headache of | |
| 4354 // a "rescan" which would otherwise be needed because | |
| 4355 // of the dirty mod union table & card table. | |
| 4356 _restart_addr = NULL; | |
| 4357 return false; | |
| 4358 } | |
| 4359 // Adjust the task to restart from _restart_addr | |
| 4360 tsk.reset(_restart_addr); | |
| 4361 cms_space ->initialize_sequential_subtasks_for_marking(num_workers, | |
| 4362 _restart_addr); | |
| 4363 _restart_addr = NULL; | |
| 4364 // Get the workers going again | |
| 4365 conc_workers()->start_task(&tsk); | |
| 4366 while (tsk.yielded()) { | |
| 4367 tsk.coordinator_yield(); | |
| 4368 conc_workers()->continue_task(&tsk); | |
| 4369 } | |
| 4370 } | |
| 4371 assert(tsk.completed(), "Inconsistency"); | |
| 4372 assert(tsk.result() == true, "Inconsistency"); | |
| 4373 return true; | |
| 4374 } | |
| 4375 | |
| 4376 bool CMSCollector::do_marking_st(bool asynch) { | |
| 4377 ResourceMark rm; | |
| 4378 HandleMark hm; | |
| 4379 | |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
4380 // Temporarily make refs discovery single threaded (non-MT) |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
4381 ReferenceProcessorMTDiscoveryMutator rp_mut_discovery(ref_processor(), false); |
| 0 | 4382 MarkFromRootsClosure markFromRootsClosure(this, _span, &_markBitMap, |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4383 &_markStack, CMSYield && asynch); |
| 0 | 4384 // the last argument to iterate indicates whether the iteration |
| 4385 // should be incremental with periodic yields. | |
| 4386 _markBitMap.iterate(&markFromRootsClosure); | |
| 4387 // If _restart_addr is non-NULL, a marking stack overflow | |
| 605 | 4388 // occurred; we need to do a fresh iteration from the |
| 0 | 4389 // indicated restart address. |
| 4390 while (_restart_addr != NULL) { | |
| 4391 if (_foregroundGCIsActive && asynch) { | |
| 4392 // We may be running into repeated stack overflows, having | |
| 4393 // reached the limit of the stack size, while making very | |
| 4394 // slow forward progress. It may be best to bail out and | |
| 4395 // let the foreground collector do its job. | |
| 4396 // Clear _restart_addr, so that foreground GC | |
| 4397 // works from scratch. This avoids the headache of | |
| 4398 // a "rescan" which would otherwise be needed because | |
| 4399 // of the dirty mod union table & card table. | |
| 4400 _restart_addr = NULL; | |
| 4401 return false; // indicating failure to complete marking | |
| 4402 } | |
| 4403 // Deal with stack overflow: | |
| 4404 // we restart marking from _restart_addr | |
| 4405 HeapWord* ra = _restart_addr; | |
| 4406 markFromRootsClosure.reset(ra); | |
| 4407 _restart_addr = NULL; | |
| 4408 _markBitMap.iterate(&markFromRootsClosure, ra, _span.end()); | |
| 4409 } | |
| 4410 return true; | |
| 4411 } | |
| 4412 | |
| 4413 void CMSCollector::preclean() { | |
| 4414 check_correct_thread_executing(); | |
| 4415 assert(Thread::current()->is_ConcurrentGC_thread(), "Wrong thread"); | |
| 4416 verify_work_stacks_empty(); | |
| 4417 verify_overflow_empty(); | |
| 4418 _abort_preclean = false; | |
| 4419 if (CMSPrecleaningEnabled) { | |
| 4420 _eden_chunk_index = 0; | |
| 4421 size_t used = get_eden_used(); | |
| 4422 size_t capacity = get_eden_capacity(); | |
| 4423 // Don't start sampling unless we will get sufficiently | |
| 4424 // many samples. | |
| 4425 if (used < (capacity/(CMSScheduleRemarkSamplingRatio * 100) | |
| 4426 * CMSScheduleRemarkEdenPenetration)) { | |
| 4427 _start_sampling = true; | |
| 4428 } else { | |
| 4429 _start_sampling = false; | |
| 4430 } | |
| 4431 TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); | |
| 4432 CMSPhaseAccounting pa(this, "preclean", !PrintGCDetails); | |
| 4433 preclean_work(CMSPrecleanRefLists1, CMSPrecleanSurvivors1); | |
| 4434 } | |
| 4435 CMSTokenSync x(true); // is cms thread | |
| 4436 if (CMSPrecleaningEnabled) { | |
| 4437 sample_eden(); | |
| 4438 _collectorState = AbortablePreclean; | |
| 4439 } else { | |
| 4440 _collectorState = FinalMarking; | |
| 4441 } | |
| 4442 verify_work_stacks_empty(); | |
| 4443 verify_overflow_empty(); | |
| 4444 } | |
| 4445 | |
| 4446 // Try and schedule the remark such that young gen | |
| 4447 // occupancy is CMSScheduleRemarkEdenPenetration %. | |
| 4448 void CMSCollector::abortable_preclean() { | |
| 4449 check_correct_thread_executing(); | |
| 4450 assert(CMSPrecleaningEnabled, "Inconsistent control state"); | |
| 4451 assert(_collectorState == AbortablePreclean, "Inconsistent control state"); | |
| 4452 | |
| 4453 // If Eden's current occupancy is below this threshold, | |
| 4454 // immediately schedule the remark; else preclean | |
| 4455 // past the next scavenge in an effort to | |
| 4456 // schedule the pause as described avove. By choosing | |
| 4457 // CMSScheduleRemarkEdenSizeThreshold >= max eden size | |
| 4458 // we will never do an actual abortable preclean cycle. | |
| 4459 if (get_eden_used() > CMSScheduleRemarkEdenSizeThreshold) { | |
| 4460 TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); | |
| 4461 CMSPhaseAccounting pa(this, "abortable-preclean", !PrintGCDetails); | |
| 4462 // We need more smarts in the abortable preclean | |
| 4463 // loop below to deal with cases where allocation | |
| 4464 // in young gen is very very slow, and our precleaning | |
| 4465 // is running a losing race against a horde of | |
| 4466 // mutators intent on flooding us with CMS updates | |
| 4467 // (dirty cards). | |
| 4468 // One, admittedly dumb, strategy is to give up | |
| 4469 // after a certain number of abortable precleaning loops | |
| 4470 // or after a certain maximum time. We want to make | |
| 4471 // this smarter in the next iteration. | |
| 4472 // XXX FIX ME!!! YSR | |
| 4473 size_t loops = 0, workdone = 0, cumworkdone = 0, waited = 0; | |
| 4474 while (!(should_abort_preclean() || | |
| 4475 ConcurrentMarkSweepThread::should_terminate())) { | |
| 4476 workdone = preclean_work(CMSPrecleanRefLists2, CMSPrecleanSurvivors2); | |
| 4477 cumworkdone += workdone; | |
| 4478 loops++; | |
| 4479 // Voluntarily terminate abortable preclean phase if we have | |
| 4480 // been at it for too long. | |
| 4481 if ((CMSMaxAbortablePrecleanLoops != 0) && | |
| 4482 loops >= CMSMaxAbortablePrecleanLoops) { | |
| 4483 if (PrintGCDetails) { | |
| 4484 gclog_or_tty->print(" CMS: abort preclean due to loops "); | |
| 4485 } | |
| 4486 break; | |
| 4487 } | |
| 4488 if (pa.wallclock_millis() > CMSMaxAbortablePrecleanTime) { | |
| 4489 if (PrintGCDetails) { | |
| 4490 gclog_or_tty->print(" CMS: abort preclean due to time "); | |
| 4491 } | |
| 4492 break; | |
| 4493 } | |
| 4494 // If we are doing little work each iteration, we should | |
| 4495 // take a short break. | |
| 4496 if (workdone < CMSAbortablePrecleanMinWorkPerIteration) { | |
| 4497 // Sleep for some time, waiting for work to accumulate | |
| 4498 stopTimer(); | |
| 4499 cmsThread()->wait_on_cms_lock(CMSAbortablePrecleanWaitMillis); | |
| 4500 startTimer(); | |
| 4501 waited++; | |
| 4502 } | |
| 4503 } | |
| 4504 if (PrintCMSStatistics > 0) { | |
| 4505 gclog_or_tty->print(" [%d iterations, %d waits, %d cards)] ", | |
| 4506 loops, waited, cumworkdone); | |
| 4507 } | |
| 4508 } | |
| 4509 CMSTokenSync x(true); // is cms thread | |
| 4510 if (_collectorState != Idling) { | |
| 4511 assert(_collectorState == AbortablePreclean, | |
| 4512 "Spontaneous state transition?"); | |
| 4513 _collectorState = FinalMarking; | |
| 4514 } // Else, a foreground collection completed this CMS cycle. | |
| 4515 return; | |
| 4516 } | |
| 4517 | |
| 4518 // Respond to an Eden sampling opportunity | |
| 4519 void CMSCollector::sample_eden() { | |
| 4520 // Make sure a young gc cannot sneak in between our | |
| 4521 // reading and recording of a sample. | |
| 4522 assert(Thread::current()->is_ConcurrentGC_thread(), | |
| 4523 "Only the cms thread may collect Eden samples"); | |
| 4524 assert(ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 4525 "Should collect samples while holding CMS token"); | |
| 4526 if (!_start_sampling) { | |
| 4527 return; | |
| 4528 } | |
| 4529 if (_eden_chunk_array) { | |
| 4530 if (_eden_chunk_index < _eden_chunk_capacity) { | |
| 4531 _eden_chunk_array[_eden_chunk_index] = *_top_addr; // take sample | |
| 4532 assert(_eden_chunk_array[_eden_chunk_index] <= *_end_addr, | |
| 4533 "Unexpected state of Eden"); | |
| 4534 // We'd like to check that what we just sampled is an oop-start address; | |
| 4535 // however, we cannot do that here since the object may not yet have been | |
| 4536 // initialized. So we'll instead do the check when we _use_ this sample | |
| 4537 // later. | |
| 4538 if (_eden_chunk_index == 0 || | |
| 4539 (pointer_delta(_eden_chunk_array[_eden_chunk_index], | |
| 4540 _eden_chunk_array[_eden_chunk_index-1]) | |
| 4541 >= CMSSamplingGrain)) { | |
| 4542 _eden_chunk_index++; // commit sample | |
| 4543 } | |
| 4544 } | |
| 4545 } | |
| 4546 if ((_collectorState == AbortablePreclean) && !_abort_preclean) { | |
| 4547 size_t used = get_eden_used(); | |
| 4548 size_t capacity = get_eden_capacity(); | |
| 4549 assert(used <= capacity, "Unexpected state of Eden"); | |
| 4550 if (used > (capacity/100 * CMSScheduleRemarkEdenPenetration)) { | |
| 4551 _abort_preclean = true; | |
| 4552 } | |
| 4553 } | |
| 4554 } | |
| 4555 | |
| 4556 | |
| 4557 size_t CMSCollector::preclean_work(bool clean_refs, bool clean_survivor) { | |
| 4558 assert(_collectorState == Precleaning || | |
| 4559 _collectorState == AbortablePreclean, "incorrect state"); | |
| 4560 ResourceMark rm; | |
| 4561 HandleMark hm; | |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
4562 |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
4563 // Precleaning is currently not MT but the reference processor |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
4564 // may be set for MT. Disable it temporarily here. |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
4565 ReferenceProcessor* rp = ref_processor(); |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
4566 ReferenceProcessorMTDiscoveryMutator rp_mut_discovery(rp, false); |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
4567 |
| 0 | 4568 // Do one pass of scrubbing the discovered reference lists |
| 4569 // to remove any reference objects with strongly-reachable | |
| 4570 // referents. | |
| 4571 if (clean_refs) { | |
| 4572 CMSPrecleanRefsYieldClosure yield_cl(this); | |
| 4573 assert(rp->span().equals(_span), "Spans should be equal"); | |
| 4574 CMSKeepAliveClosure keep_alive(this, _span, &_markBitMap, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4575 &_markStack, true /* preclean */); |
| 0 | 4576 CMSDrainMarkingStackClosure complete_trace(this, |
|
452
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
4577 _span, &_markBitMap, &_markStack, |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
4578 &keep_alive, true /* preclean */); |
| 0 | 4579 |
| 4580 // We don't want this step to interfere with a young | |
| 4581 // collection because we don't want to take CPU | |
| 4582 // or memory bandwidth away from the young GC threads | |
| 4583 // (which may be as many as there are CPUs). | |
| 4584 // Note that we don't need to protect ourselves from | |
| 4585 // interference with mutators because they can't | |
| 4586 // manipulate the discovered reference lists nor affect | |
| 4587 // the computed reachability of the referents, the | |
| 4588 // only properties manipulated by the precleaning | |
| 4589 // of these reference lists. | |
| 4590 stopTimer(); | |
| 4591 CMSTokenSyncWithLocks x(true /* is cms thread */, | |
| 4592 bitMapLock()); | |
| 4593 startTimer(); | |
| 4594 sample_eden(); | |
| 935 | 4595 |
| 0 | 4596 // The following will yield to allow foreground |
| 4597 // collection to proceed promptly. XXX YSR: | |
| 4598 // The code in this method may need further | |
| 4599 // tweaking for better performance and some restructuring | |
| 4600 // for cleaner interfaces. | |
| 10405 | 4601 GCTimer *gc_timer = NULL; // Currently not tracing concurrent phases |
| 0 | 4602 rp->preclean_discovered_references( |
| 10405 | 4603 rp->is_alive_non_header(), &keep_alive, &complete_trace, &yield_cl, |
| 4604 gc_timer); | |
| 0 | 4605 } |
| 4606 | |
| 4607 if (clean_survivor) { // preclean the active survivor space(s) | |
| 4608 assert(_young_gen->kind() == Generation::DefNew || | |
| 4609 _young_gen->kind() == Generation::ParNew || | |
| 4610 _young_gen->kind() == Generation::ASParNew, | |
| 4611 "incorrect type for cast"); | |
| 4612 DefNewGeneration* dng = (DefNewGeneration*)_young_gen; | |
| 4613 PushAndMarkClosure pam_cl(this, _span, ref_processor(), | |
| 4614 &_markBitMap, &_modUnionTable, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4615 &_markStack, true /* precleaning phase */); |
| 0 | 4616 stopTimer(); |
| 4617 CMSTokenSyncWithLocks ts(true /* is cms thread */, | |
| 4618 bitMapLock()); | |
| 4619 startTimer(); | |
| 4620 unsigned int before_count = | |
| 4621 GenCollectedHeap::heap()->total_collections(); | |
| 4622 SurvivorSpacePrecleanClosure | |
| 4623 sss_cl(this, _span, &_markBitMap, &_markStack, | |
| 4624 &pam_cl, before_count, CMSYield); | |
| 4625 dng->from()->object_iterate_careful(&sss_cl); | |
| 4626 dng->to()->object_iterate_careful(&sss_cl); | |
| 4627 } | |
| 4628 MarkRefsIntoAndScanClosure | |
| 4629 mrias_cl(_span, ref_processor(), &_markBitMap, &_modUnionTable, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4630 &_markStack, this, CMSYield, |
| 0 | 4631 true /* precleaning phase */); |
| 4632 // CAUTION: The following closure has persistent state that may need to | |
| 4633 // be reset upon a decrease in the sequence of addresses it | |
| 4634 // processes. | |
| 4635 ScanMarkedObjectsAgainCarefullyClosure | |
| 4636 smoac_cl(this, _span, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4637 &_markBitMap, &_markStack, &mrias_cl, CMSYield); |
| 0 | 4638 |
| 4639 // Preclean dirty cards in ModUnionTable and CardTable using | |
| 4640 // appropriate convergence criterion; | |
| 4641 // repeat CMSPrecleanIter times unless we find that | |
| 4642 // we are losing. | |
| 4643 assert(CMSPrecleanIter < 10, "CMSPrecleanIter is too large"); | |
| 4644 assert(CMSPrecleanNumerator < CMSPrecleanDenominator, | |
| 4645 "Bad convergence multiplier"); | |
| 4646 assert(CMSPrecleanThreshold >= 100, | |
| 4647 "Unreasonably low CMSPrecleanThreshold"); | |
| 4648 | |
| 4649 size_t numIter, cumNumCards, lastNumCards, curNumCards; | |
| 4650 for (numIter = 0, cumNumCards = lastNumCards = curNumCards = 0; | |
| 4651 numIter < CMSPrecleanIter; | |
| 4652 numIter++, lastNumCards = curNumCards, cumNumCards += curNumCards) { | |
| 4653 curNumCards = preclean_mod_union_table(_cmsGen, &smoac_cl); | |
| 4654 if (Verbose && PrintGCDetails) { | |
| 4655 gclog_or_tty->print(" (modUnionTable: %d cards)", curNumCards); | |
| 4656 } | |
| 4657 // Either there are very few dirty cards, so re-mark | |
| 4658 // pause will be small anyway, or our pre-cleaning isn't | |
| 4659 // that much faster than the rate at which cards are being | |
| 4660 // dirtied, so we might as well stop and re-mark since | |
| 4661 // precleaning won't improve our re-mark time by much. | |
| 4662 if (curNumCards <= CMSPrecleanThreshold || | |
| 4663 (numIter > 0 && | |
| 4664 (curNumCards * CMSPrecleanDenominator > | |
| 4665 lastNumCards * CMSPrecleanNumerator))) { | |
| 4666 numIter++; | |
| 4667 cumNumCards += curNumCards; | |
| 4668 break; | |
| 4669 } | |
| 4670 } | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4671 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4672 preclean_klasses(&mrias_cl, _cmsGen->freelistLock()); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4673 |
| 0 | 4674 curNumCards = preclean_card_table(_cmsGen, &smoac_cl); |
| 4675 cumNumCards += curNumCards; | |
| 4676 if (PrintGCDetails && PrintCMSStatistics != 0) { | |
| 4677 gclog_or_tty->print_cr(" (cardTable: %d cards, re-scanned %d cards, %d iterations)", | |
| 4678 curNumCards, cumNumCards, numIter); | |
| 4679 } | |
| 4680 return cumNumCards; // as a measure of useful work done | |
| 4681 } | |
| 4682 | |
| 4683 // PRECLEANING NOTES: | |
| 4684 // Precleaning involves: | |
| 4685 // . reading the bits of the modUnionTable and clearing the set bits. | |
| 4686 // . For the cards corresponding to the set bits, we scan the | |
| 4687 // objects on those cards. This means we need the free_list_lock | |
| 4688 // so that we can safely iterate over the CMS space when scanning | |
| 4689 // for oops. | |
| 4690 // . When we scan the objects, we'll be both reading and setting | |
| 4691 // marks in the marking bit map, so we'll need the marking bit map. | |
| 4692 // . For protecting _collector_state transitions, we take the CGC_lock. | |
| 4693 // Note that any races in the reading of of card table entries by the | |
| 4694 // CMS thread on the one hand and the clearing of those entries by the | |
| 4695 // VM thread or the setting of those entries by the mutator threads on the | |
| 4696 // other are quite benign. However, for efficiency it makes sense to keep | |
| 4697 // the VM thread from racing with the CMS thread while the latter is | |
| 4698 // dirty card info to the modUnionTable. We therefore also use the | |
| 4699 // CGC_lock to protect the reading of the card table and the mod union | |
| 4700 // table by the CM thread. | |
| 4701 // . We run concurrently with mutator updates, so scanning | |
| 4702 // needs to be done carefully -- we should not try to scan | |
| 4703 // potentially uninitialized objects. | |
| 4704 // | |
| 4705 // Locking strategy: While holding the CGC_lock, we scan over and | |
| 4706 // reset a maximal dirty range of the mod union / card tables, then lock | |
| 4707 // the free_list_lock and bitmap lock to do a full marking, then | |
| 4708 // release these locks; and repeat the cycle. This allows for a | |
| 4709 // certain amount of fairness in the sharing of these locks between | |
| 4710 // the CMS collector on the one hand, and the VM thread and the | |
| 4711 // mutators on the other. | |
| 4712 | |
| 4713 // NOTE: preclean_mod_union_table() and preclean_card_table() | |
| 4714 // further below are largely identical; if you need to modify | |
| 4715 // one of these methods, please check the other method too. | |
| 4716 | |
| 4717 size_t CMSCollector::preclean_mod_union_table( | |
| 4718 ConcurrentMarkSweepGeneration* gen, | |
| 4719 ScanMarkedObjectsAgainCarefullyClosure* cl) { | |
| 4720 verify_work_stacks_empty(); | |
| 4721 verify_overflow_empty(); | |
| 4722 | |
| 4723 // strategy: starting with the first card, accumulate contiguous | |
| 4724 // ranges of dirty cards; clear these cards, then scan the region | |
| 4725 // covered by these cards. | |
| 4726 | |
| 4727 // Since all of the MUT is committed ahead, we can just use | |
| 4728 // that, in case the generations expand while we are precleaning. | |
| 4729 // It might also be fine to just use the committed part of the | |
| 4730 // generation, but we might potentially miss cards when the | |
| 4731 // generation is rapidly expanding while we are in the midst | |
| 4732 // of precleaning. | |
| 4733 HeapWord* startAddr = gen->reserved().start(); | |
| 4734 HeapWord* endAddr = gen->reserved().end(); | |
| 4735 | |
| 4736 cl->setFreelistLock(gen->freelistLock()); // needed for yielding | |
| 4737 | |
| 4738 size_t numDirtyCards, cumNumDirtyCards; | |
| 4739 HeapWord *nextAddr, *lastAddr; | |
| 4740 for (cumNumDirtyCards = numDirtyCards = 0, | |
| 4741 nextAddr = lastAddr = startAddr; | |
| 4742 nextAddr < endAddr; | |
| 4743 nextAddr = lastAddr, cumNumDirtyCards += numDirtyCards) { | |
| 4744 | |
| 4745 ResourceMark rm; | |
| 4746 HandleMark hm; | |
| 4747 | |
| 4748 MemRegion dirtyRegion; | |
| 4749 { | |
| 4750 stopTimer(); | |
| 935 | 4751 // Potential yield point |
| 0 | 4752 CMSTokenSync ts(true); |
| 4753 startTimer(); | |
| 4754 sample_eden(); | |
| 4755 // Get dirty region starting at nextOffset (inclusive), | |
| 4756 // simultaneously clearing it. | |
| 4757 dirtyRegion = | |
| 4758 _modUnionTable.getAndClearMarkedRegion(nextAddr, endAddr); | |
| 4759 assert(dirtyRegion.start() >= nextAddr, | |
| 4760 "returned region inconsistent?"); | |
| 4761 } | |
| 4762 // Remember where the next search should begin. | |
| 4763 // The returned region (if non-empty) is a right open interval, | |
| 4764 // so lastOffset is obtained from the right end of that | |
| 4765 // interval. | |
| 4766 lastAddr = dirtyRegion.end(); | |
| 4767 // Should do something more transparent and less hacky XXX | |
| 4768 numDirtyCards = | |
| 4769 _modUnionTable.heapWordDiffToOffsetDiff(dirtyRegion.word_size()); | |
| 4770 | |
| 4771 // We'll scan the cards in the dirty region (with periodic | |
| 4772 // yields for foreground GC as needed). | |
| 4773 if (!dirtyRegion.is_empty()) { | |
| 4774 assert(numDirtyCards > 0, "consistency check"); | |
| 4775 HeapWord* stop_point = NULL; | |
|
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
4776 stopTimer(); |
| 935 | 4777 // Potential yield point |
|
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
4778 CMSTokenSyncWithLocks ts(true, gen->freelistLock(), |
|
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
4779 bitMapLock()); |
|
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
4780 startTimer(); |
| 0 | 4781 { |
| 4782 verify_work_stacks_empty(); | |
| 4783 verify_overflow_empty(); | |
| 4784 sample_eden(); | |
| 4785 stop_point = | |
| 4786 gen->cmsSpace()->object_iterate_careful_m(dirtyRegion, cl); | |
| 4787 } | |
| 4788 if (stop_point != NULL) { | |
| 4789 // The careful iteration stopped early either because it found an | |
| 4790 // uninitialized object, or because we were in the midst of an | |
| 4791 // "abortable preclean", which should now be aborted. Redirty | |
| 4792 // the bits corresponding to the partially-scanned or unscanned | |
| 4793 // cards. We'll either restart at the next block boundary or | |
| 4794 // abort the preclean. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4795 assert((_collectorState == AbortablePreclean && should_abort_preclean()), |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4796 "Should only be AbortablePreclean."); |
| 0 | 4797 _modUnionTable.mark_range(MemRegion(stop_point, dirtyRegion.end())); |
| 4798 if (should_abort_preclean()) { | |
| 4799 break; // out of preclean loop | |
| 4800 } else { | |
| 4801 // Compute the next address at which preclean should pick up; | |
| 4802 // might need bitMapLock in order to read P-bits. | |
| 4803 lastAddr = next_card_start_after_block(stop_point); | |
| 4804 } | |
| 4805 } | |
| 4806 } else { | |
| 4807 assert(lastAddr == endAddr, "consistency check"); | |
| 4808 assert(numDirtyCards == 0, "consistency check"); | |
| 4809 break; | |
| 4810 } | |
| 4811 } | |
| 4812 verify_work_stacks_empty(); | |
| 4813 verify_overflow_empty(); | |
| 4814 return cumNumDirtyCards; | |
| 4815 } | |
| 4816 | |
| 4817 // NOTE: preclean_mod_union_table() above and preclean_card_table() | |
| 4818 // below are largely identical; if you need to modify | |
| 4819 // one of these methods, please check the other method too. | |
| 4820 | |
| 4821 size_t CMSCollector::preclean_card_table(ConcurrentMarkSweepGeneration* gen, | |
| 4822 ScanMarkedObjectsAgainCarefullyClosure* cl) { | |
| 4823 // strategy: it's similar to precleamModUnionTable above, in that | |
| 4824 // we accumulate contiguous ranges of dirty cards, mark these cards | |
| 4825 // precleaned, then scan the region covered by these cards. | |
| 4826 HeapWord* endAddr = (HeapWord*)(gen->_virtual_space.high()); | |
| 4827 HeapWord* startAddr = (HeapWord*)(gen->_virtual_space.low()); | |
| 4828 | |
| 4829 cl->setFreelistLock(gen->freelistLock()); // needed for yielding | |
| 4830 | |
| 4831 size_t numDirtyCards, cumNumDirtyCards; | |
| 4832 HeapWord *lastAddr, *nextAddr; | |
| 4833 | |
| 4834 for (cumNumDirtyCards = numDirtyCards = 0, | |
| 4835 nextAddr = lastAddr = startAddr; | |
| 4836 nextAddr < endAddr; | |
| 4837 nextAddr = lastAddr, cumNumDirtyCards += numDirtyCards) { | |
| 4838 | |
| 4839 ResourceMark rm; | |
| 4840 HandleMark hm; | |
| 4841 | |
| 4842 MemRegion dirtyRegion; | |
| 4843 { | |
| 4844 // See comments in "Precleaning notes" above on why we | |
| 4845 // do this locking. XXX Could the locking overheads be | |
| 4846 // too high when dirty cards are sparse? [I don't think so.] | |
| 4847 stopTimer(); | |
| 4848 CMSTokenSync x(true); // is cms thread | |
| 4849 startTimer(); | |
| 4850 sample_eden(); | |
| 4851 // Get and clear dirty region from card table | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
4852 dirtyRegion = _ct->ct_bs()->dirty_card_range_after_reset( |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
4853 MemRegion(nextAddr, endAddr), |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
4854 true, |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
4855 CardTableModRefBS::precleaned_card_val()); |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
4856 |
| 0 | 4857 assert(dirtyRegion.start() >= nextAddr, |
| 4858 "returned region inconsistent?"); | |
| 4859 } | |
| 4860 lastAddr = dirtyRegion.end(); | |
| 4861 numDirtyCards = | |
| 4862 dirtyRegion.word_size()/CardTableModRefBS::card_size_in_words; | |
| 4863 | |
| 4864 if (!dirtyRegion.is_empty()) { | |
| 4865 stopTimer(); | |
| 4866 CMSTokenSyncWithLocks ts(true, gen->freelistLock(), bitMapLock()); | |
| 4867 startTimer(); | |
| 4868 sample_eden(); | |
| 4869 verify_work_stacks_empty(); | |
| 4870 verify_overflow_empty(); | |
| 4871 HeapWord* stop_point = | |
| 4872 gen->cmsSpace()->object_iterate_careful_m(dirtyRegion, cl); | |
| 4873 if (stop_point != NULL) { | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4874 assert((_collectorState == AbortablePreclean && should_abort_preclean()), |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4875 "Should only be AbortablePreclean."); |
| 0 | 4876 _ct->ct_bs()->invalidate(MemRegion(stop_point, dirtyRegion.end())); |
| 4877 if (should_abort_preclean()) { | |
| 4878 break; // out of preclean loop | |
| 4879 } else { | |
| 4880 // Compute the next address at which preclean should pick up. | |
| 4881 lastAddr = next_card_start_after_block(stop_point); | |
| 4882 } | |
| 4883 } | |
| 4884 } else { | |
| 4885 break; | |
| 4886 } | |
| 4887 } | |
| 4888 verify_work_stacks_empty(); | |
| 4889 verify_overflow_empty(); | |
| 4890 return cumNumDirtyCards; | |
| 4891 } | |
| 4892 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4893 class PrecleanKlassClosure : public KlassClosure { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4894 CMKlassClosure _cm_klass_closure; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4895 public: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4896 PrecleanKlassClosure(OopClosure* oop_closure) : _cm_klass_closure(oop_closure) {} |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4897 void do_klass(Klass* k) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4898 if (k->has_accumulated_modified_oops()) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4899 k->clear_accumulated_modified_oops(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4900 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4901 _cm_klass_closure.do_klass(k); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4902 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4903 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4904 }; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4905 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4906 // The freelist lock is needed to prevent asserts, is it really needed? |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4907 void CMSCollector::preclean_klasses(MarkRefsIntoAndScanClosure* cl, Mutex* freelistLock) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4908 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4909 cl->set_freelistLock(freelistLock); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4910 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4911 CMSTokenSyncWithLocks ts(true, freelistLock, bitMapLock()); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4912 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4913 // SSS: Add equivalent to ScanMarkedObjectsAgainCarefullyClosure::do_yield_check and should_abort_preclean? |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4914 // SSS: We should probably check if precleaning should be aborted, at suitable intervals? |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4915 PrecleanKlassClosure preclean_klass_closure(cl); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4916 ClassLoaderDataGraph::classes_do(&preclean_klass_closure); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4917 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4918 verify_work_stacks_empty(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4919 verify_overflow_empty(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4920 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
4921 |
| 0 | 4922 void CMSCollector::checkpointRootsFinal(bool asynch, |
| 4923 bool clear_all_soft_refs, bool init_mark_was_synchronous) { | |
| 4924 assert(_collectorState == FinalMarking, "incorrect state transition?"); | |
| 4925 check_correct_thread_executing(); | |
| 4926 // world is stopped at this checkpoint | |
| 4927 assert(SafepointSynchronize::is_at_safepoint(), | |
| 4928 "world should be stopped"); | |
|
3356
78542e2b5e35
7036199: Adding a notification to the implementation of GarbageCollectorMXBeans
fparain
parents:
3293
diff
changeset
|
4929 TraceCMSMemoryManagerStats tms(_collectorState,GenCollectedHeap::heap()->gc_cause()); |
|
78542e2b5e35
7036199: Adding a notification to the implementation of GarbageCollectorMXBeans
fparain
parents:
3293
diff
changeset
|
4930 |
| 0 | 4931 verify_work_stacks_empty(); |
| 4932 verify_overflow_empty(); | |
| 4933 | |
| 4934 SpecializationStats::clear(); | |
| 4935 if (PrintGCDetails) { | |
| 4936 gclog_or_tty->print("[YG occupancy: "SIZE_FORMAT" K ("SIZE_FORMAT" K)]", | |
| 4937 _young_gen->used() / K, | |
| 4938 _young_gen->capacity() / K); | |
| 4939 } | |
| 4940 if (asynch) { | |
| 4941 if (CMSScavengeBeforeRemark) { | |
| 4942 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 4943 // Temporarily set flag to false, GCH->do_collection will | |
| 4944 // expect it to be false and set to true | |
| 4945 FlagSetting fl(gch->_is_gc_active, false); | |
| 10405 | 4946 NOT_PRODUCT(GCTraceTime t("Scavenge-Before-Remark", |
| 4947 PrintGCDetails && Verbose, true, _gc_timer_cm);) | |
| 0 | 4948 int level = _cmsGen->level() - 1; |
| 4949 if (level >= 0) { | |
| 4950 gch->do_collection(true, // full (i.e. force, see below) | |
| 4951 false, // !clear_all_soft_refs | |
| 4952 0, // size | |
| 4953 false, // is_tlab | |
| 4954 level // max_level | |
| 4955 ); | |
| 4956 } | |
| 4957 } | |
| 4958 FreelistLocker x(this); | |
| 4959 MutexLockerEx y(bitMapLock(), | |
| 4960 Mutex::_no_safepoint_check_flag); | |
| 4961 assert(!init_mark_was_synchronous, "but that's impossible!"); | |
| 4962 checkpointRootsFinalWork(asynch, clear_all_soft_refs, false); | |
| 4963 } else { | |
| 4964 // already have all the locks | |
| 4965 checkpointRootsFinalWork(asynch, clear_all_soft_refs, | |
| 4966 init_mark_was_synchronous); | |
| 4967 } | |
| 4968 verify_work_stacks_empty(); | |
| 4969 verify_overflow_empty(); | |
| 4970 SpecializationStats::print(); | |
| 4971 } | |
| 4972 | |
| 4973 void CMSCollector::checkpointRootsFinalWork(bool asynch, | |
| 4974 bool clear_all_soft_refs, bool init_mark_was_synchronous) { | |
| 4975 | |
| 10405 | 4976 NOT_PRODUCT(GCTraceTime tr("checkpointRootsFinalWork", PrintGCDetails, false, _gc_timer_cm);) |
| 0 | 4977 |
| 4978 assert(haveFreelistLocks(), "must have free list locks"); | |
| 4979 assert_lock_strong(bitMapLock()); | |
| 4980 | |
| 4981 if (UseAdaptiveSizePolicy) { | |
| 4982 size_policy()->checkpoint_roots_final_begin(); | |
| 4983 } | |
| 4984 | |
| 4985 ResourceMark rm; | |
| 4986 HandleMark hm; | |
| 4987 | |
| 4988 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 4989 | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
4990 if (should_unload_classes()) { |
| 0 | 4991 CodeCache::gc_prologue(); |
| 4992 } | |
| 4993 assert(haveFreelistLocks(), "must have free list locks"); | |
| 4994 assert_lock_strong(bitMapLock()); | |
| 4995 | |
| 4996 if (!init_mark_was_synchronous) { | |
| 4997 // We might assume that we need not fill TLAB's when | |
| 4998 // CMSScavengeBeforeRemark is set, because we may have just done | |
| 4999 // a scavenge which would have filled all TLAB's -- and besides | |
| 5000 // Eden would be empty. This however may not always be the case -- | |
| 5001 // for instance although we asked for a scavenge, it may not have | |
| 5002 // happened because of a JNI critical section. We probably need | |
| 5003 // a policy for deciding whether we can in that case wait until | |
| 5004 // the critical section releases and then do the remark following | |
| 5005 // the scavenge, and skip it here. In the absence of that policy, | |
| 5006 // or of an indication of whether the scavenge did indeed occur, | |
| 5007 // we cannot rely on TLAB's having been filled and must do | |
| 5008 // so here just in case a scavenge did not happen. | |
| 5009 gch->ensure_parsability(false); // fill TLAB's, but no need to retire them | |
| 5010 // Update the saved marks which may affect the root scans. | |
| 5011 gch->save_marks(); | |
| 5012 | |
| 5013 { | |
| 5014 COMPILER2_PRESENT(DerivedPointerTableDeactivate dpt_deact;) | |
| 5015 | |
| 5016 // Note on the role of the mod union table: | |
| 5017 // Since the marker in "markFromRoots" marks concurrently with | |
| 5018 // mutators, it is possible for some reachable objects not to have been | |
| 5019 // scanned. For instance, an only reference to an object A was | |
| 5020 // placed in object B after the marker scanned B. Unless B is rescanned, | |
| 5021 // A would be collected. Such updates to references in marked objects | |
| 5022 // are detected via the mod union table which is the set of all cards | |
| 5023 // dirtied since the first checkpoint in this GC cycle and prior to | |
| 5024 // the most recent young generation GC, minus those cleaned up by the | |
| 5025 // concurrent precleaning. | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5026 if (CMSParallelRemarkEnabled && CollectedHeap::use_parallel_gc_threads()) { |
| 10405 | 5027 GCTraceTime t("Rescan (parallel) ", PrintGCDetails, false, _gc_timer_cm); |
| 0 | 5028 do_remark_parallel(); |
| 5029 } else { | |
| 10405 | 5030 GCTraceTime t("Rescan (non-parallel) ", PrintGCDetails, false, |
| 5031 _gc_timer_cm); | |
| 0 | 5032 do_remark_non_parallel(); |
| 5033 } | |
| 5034 } | |
| 5035 } else { | |
| 5036 assert(!asynch, "Can't have init_mark_was_synchronous in asynch mode"); | |
| 5037 // The initial mark was stop-world, so there's no rescanning to | |
| 5038 // do; go straight on to the next step below. | |
| 5039 } | |
| 5040 verify_work_stacks_empty(); | |
| 5041 verify_overflow_empty(); | |
| 5042 | |
| 5043 { | |
| 10405 | 5044 NOT_PRODUCT(GCTraceTime ts("refProcessingWork", PrintGCDetails, false, _gc_timer_cm);) |
| 0 | 5045 refProcessingWork(asynch, clear_all_soft_refs); |
| 5046 } | |
| 5047 verify_work_stacks_empty(); | |
| 5048 verify_overflow_empty(); | |
| 5049 | |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
5050 if (should_unload_classes()) { |
| 0 | 5051 CodeCache::gc_epilogue(); |
| 5052 } | |
|
2147
9afee0b9fc1d
7012505: BreakpointWithFullGC.sh fails with Internal Error (src/share/vm/oops/methodOop.cpp:220)
kamg
parents:
2137
diff
changeset
|
5053 JvmtiExport::gc_epilogue(); |
| 0 | 5054 |
| 5055 // If we encountered any (marking stack / work queue) overflow | |
| 5056 // events during the current CMS cycle, take appropriate | |
| 5057 // remedial measures, where possible, so as to try and avoid | |
| 5058 // recurrence of that condition. | |
| 5059 assert(_markStack.isEmpty(), "No grey objects"); | |
| 5060 size_t ser_ovflw = _ser_pmc_remark_ovflw + _ser_pmc_preclean_ovflw + | |
|
452
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
5061 _ser_kac_ovflw + _ser_kac_preclean_ovflw; |
| 0 | 5062 if (ser_ovflw > 0) { |
| 5063 if (PrintCMSStatistics != 0) { | |
| 5064 gclog_or_tty->print_cr("Marking stack overflow (benign) " | |
|
452
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
5065 "(pmc_pc="SIZE_FORMAT", pmc_rm="SIZE_FORMAT", kac="SIZE_FORMAT |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
5066 ", kac_preclean="SIZE_FORMAT")", |
| 0 | 5067 _ser_pmc_preclean_ovflw, _ser_pmc_remark_ovflw, |
|
452
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
5068 _ser_kac_ovflw, _ser_kac_preclean_ovflw); |
| 0 | 5069 } |
| 5070 _markStack.expand(); | |
| 5071 _ser_pmc_remark_ovflw = 0; | |
| 5072 _ser_pmc_preclean_ovflw = 0; | |
|
452
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
5073 _ser_kac_preclean_ovflw = 0; |
| 0 | 5074 _ser_kac_ovflw = 0; |
| 5075 } | |
| 5076 if (_par_pmc_remark_ovflw > 0 || _par_kac_ovflw > 0) { | |
| 5077 if (PrintCMSStatistics != 0) { | |
| 5078 gclog_or_tty->print_cr("Work queue overflow (benign) " | |
| 5079 "(pmc_rm="SIZE_FORMAT", kac="SIZE_FORMAT")", | |
| 5080 _par_pmc_remark_ovflw, _par_kac_ovflw); | |
| 5081 } | |
| 5082 _par_pmc_remark_ovflw = 0; | |
| 5083 _par_kac_ovflw = 0; | |
| 5084 } | |
| 5085 if (PrintCMSStatistics != 0) { | |
| 5086 if (_markStack._hit_limit > 0) { | |
| 5087 gclog_or_tty->print_cr(" (benign) Hit max stack size limit ("SIZE_FORMAT")", | |
| 5088 _markStack._hit_limit); | |
| 5089 } | |
| 5090 if (_markStack._failed_double > 0) { | |
| 5091 gclog_or_tty->print_cr(" (benign) Failed stack doubling ("SIZE_FORMAT")," | |
| 5092 " current capacity "SIZE_FORMAT, | |
| 5093 _markStack._failed_double, | |
| 5094 _markStack.capacity()); | |
| 5095 } | |
| 5096 } | |
| 5097 _markStack._hit_limit = 0; | |
| 5098 _markStack._failed_double = 0; | |
| 5099 | |
| 5100 if ((VerifyAfterGC || VerifyDuringGC) && | |
| 5101 GenCollectedHeap::heap()->total_collections() >= VerifyGCStartAt) { | |
| 5102 verify_after_remark(); | |
| 5103 } | |
| 5104 | |
| 10405 | 5105 _gc_tracer_cm->report_object_count_after_gc(&_is_alive_closure); |
| 5106 | |
| 0 | 5107 // Change under the freelistLocks. |
| 5108 _collectorState = Sweeping; | |
| 5109 // Call isAllClear() under bitMapLock | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5110 assert(_modUnionTable.isAllClear(), |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5111 "Should be clear by end of the final marking"); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5112 assert(_ct->klass_rem_set()->mod_union_is_clear(), |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5113 "Should be clear by end of the final marking"); |
| 0 | 5114 if (UseAdaptiveSizePolicy) { |
| 5115 size_policy()->checkpoint_roots_final_end(gch->gc_cause()); | |
| 5116 } | |
| 5117 } | |
| 5118 | |
| 5119 // Parallel remark task | |
| 5120 class CMSParRemarkTask: public AbstractGangTask { | |
| 5121 CMSCollector* _collector; | |
| 5122 int _n_workers; | |
| 5123 CompactibleFreeListSpace* _cms_space; | |
| 5124 | |
| 5125 // The per-thread work queues, available here for stealing. | |
| 5126 OopTaskQueueSet* _task_queues; | |
| 5127 ParallelTaskTerminator _term; | |
| 5128 | |
| 5129 public: | |
|
4095
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
5130 // A value of 0 passed to n_workers will cause the number of |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
5131 // workers to be taken from the active workers in the work gang. |
| 0 | 5132 CMSParRemarkTask(CMSCollector* collector, |
| 5133 CompactibleFreeListSpace* cms_space, | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5134 int n_workers, FlexibleWorkGang* workers, |
| 0 | 5135 OopTaskQueueSet* task_queues): |
| 5136 AbstractGangTask("Rescan roots and grey objects in parallel"), | |
| 5137 _collector(collector), | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5138 _cms_space(cms_space), |
| 0 | 5139 _n_workers(n_workers), |
| 5140 _task_queues(task_queues), | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5141 _term(n_workers, task_queues) { } |
| 0 | 5142 |
| 5143 OopTaskQueueSet* task_queues() { return _task_queues; } | |
| 5144 | |
| 5145 OopTaskQueue* work_queue(int i) { return task_queues()->queue(i); } | |
| 5146 | |
| 5147 ParallelTaskTerminator* terminator() { return &_term; } | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5148 int n_workers() { return _n_workers; } |
| 0 | 5149 |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5150 void work(uint worker_id); |
| 0 | 5151 |
| 5152 private: | |
| 5153 // Work method in support of parallel rescan ... of young gen spaces | |
| 5154 void do_young_space_rescan(int i, Par_MarkRefsIntoAndScanClosure* cl, | |
| 5155 ContiguousSpace* space, | |
| 5156 HeapWord** chunk_array, size_t chunk_top); | |
| 5157 | |
| 5158 // ... of dirty cards in old space | |
| 5159 void do_dirty_card_rescan_tasks(CompactibleFreeListSpace* sp, int i, | |
| 5160 Par_MarkRefsIntoAndScanClosure* cl); | |
| 5161 | |
| 5162 // ... work stealing for the above | |
| 5163 void do_work_steal(int i, Par_MarkRefsIntoAndScanClosure* cl, int* seed); | |
| 5164 }; | |
| 5165 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5166 class RemarkKlassClosure : public KlassClosure { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5167 CMKlassClosure _cm_klass_closure; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5168 public: |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5169 RemarkKlassClosure(OopClosure* oop_closure) : _cm_klass_closure(oop_closure) {} |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5170 void do_klass(Klass* k) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5171 // Check if we have modified any oops in the Klass during the concurrent marking. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5172 if (k->has_accumulated_modified_oops()) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5173 k->clear_accumulated_modified_oops(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5174 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5175 // We could have transfered the current modified marks to the accumulated marks, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5176 // like we do with the Card Table to Mod Union Table. But it's not really necessary. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5177 } else if (k->has_modified_oops()) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5178 // Don't clear anything, this info is needed by the next young collection. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5179 } else { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5180 // No modified oops in the Klass. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5181 return; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5182 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5183 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5184 // The klass has modified fields, need to scan the klass. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5185 _cm_klass_closure.do_klass(k); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5186 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5187 }; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5188 |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5189 // work_queue(i) is passed to the closure |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5190 // Par_MarkRefsIntoAndScanClosure. The "i" parameter |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5191 // also is passed to do_dirty_card_rescan_tasks() and to |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5192 // do_work_steal() to select the i-th task_queue. |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5193 |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5194 void CMSParRemarkTask::work(uint worker_id) { |
| 0 | 5195 elapsedTimer _timer; |
| 5196 ResourceMark rm; | |
| 5197 HandleMark hm; | |
| 5198 | |
| 5199 // ---------- rescan from roots -------------- | |
| 5200 _timer.start(); | |
| 5201 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 5202 Par_MarkRefsIntoAndScanClosure par_mrias_cl(_collector, | |
| 5203 _collector->_span, _collector->ref_processor(), | |
| 5204 &(_collector->_markBitMap), | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5205 work_queue(worker_id)); |
| 0 | 5206 |
| 5207 // Rescan young gen roots first since these are likely | |
| 5208 // coarsely partitioned and may, on that account, constitute | |
| 5209 // the critical path; thus, it's best to start off that | |
| 5210 // work first. | |
| 5211 // ---------- young gen roots -------------- | |
| 5212 { | |
| 5213 DefNewGeneration* dng = _collector->_young_gen->as_DefNewGeneration(); | |
| 5214 EdenSpace* eden_space = dng->eden(); | |
| 5215 ContiguousSpace* from_space = dng->from(); | |
| 5216 ContiguousSpace* to_space = dng->to(); | |
| 5217 | |
| 5218 HeapWord** eca = _collector->_eden_chunk_array; | |
| 5219 size_t ect = _collector->_eden_chunk_index; | |
| 5220 HeapWord** sca = _collector->_survivor_chunk_array; | |
| 5221 size_t sct = _collector->_survivor_chunk_index; | |
| 5222 | |
| 5223 assert(ect <= _collector->_eden_chunk_capacity, "out of bounds"); | |
| 5224 assert(sct <= _collector->_survivor_chunk_capacity, "out of bounds"); | |
| 5225 | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5226 do_young_space_rescan(worker_id, &par_mrias_cl, to_space, NULL, 0); |
|
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5227 do_young_space_rescan(worker_id, &par_mrias_cl, from_space, sca, sct); |
|
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5228 do_young_space_rescan(worker_id, &par_mrias_cl, eden_space, eca, ect); |
| 0 | 5229 |
| 5230 _timer.stop(); | |
| 5231 if (PrintCMSStatistics != 0) { | |
| 5232 gclog_or_tty->print_cr( | |
| 5233 "Finished young gen rescan work in %dth thread: %3.3f sec", | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5234 worker_id, _timer.seconds()); |
| 0 | 5235 } |
| 5236 } | |
| 5237 | |
| 5238 // ---------- remaining roots -------------- | |
| 5239 _timer.reset(); | |
| 5240 _timer.start(); | |
| 5241 gch->gen_process_strong_roots(_collector->_cmsGen->level(), | |
| 5242 false, // yg was scanned above | |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5243 false, // this is parallel code |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5244 false, // not scavenging |
| 0 | 5245 SharedHeap::ScanningOption(_collector->CMSCollector::roots_scanning_options()), |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5246 &par_mrias_cl, |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5247 true, // walk all of code cache if (so & SO_CodeCache) |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5248 NULL, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5249 NULL); // The dirty klasses will be handled below |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5250 assert(_collector->should_unload_classes() |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5251 || (_collector->CMSCollector::roots_scanning_options() & SharedHeap::SO_CodeCache), |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5252 "if we didn't scan the code cache, we have to be ready to drop nmethods with expired weak oops"); |
| 0 | 5253 _timer.stop(); |
| 5254 if (PrintCMSStatistics != 0) { | |
| 5255 gclog_or_tty->print_cr( | |
| 5256 "Finished remaining root rescan work in %dth thread: %3.3f sec", | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5257 worker_id, _timer.seconds()); |
| 0 | 5258 } |
| 5259 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5260 // ---------- unhandled CLD scanning ---------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5261 if (worker_id == 0) { // Single threaded at the moment. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5262 _timer.reset(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5263 _timer.start(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5264 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5265 // Scan all new class loader data objects and new dependencies that were |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5266 // introduced during concurrent marking. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5267 ResourceMark rm; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5268 GrowableArray<ClassLoaderData*>* array = ClassLoaderDataGraph::new_clds(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5269 for (int i = 0; i < array->length(); i++) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5270 par_mrias_cl.do_class_loader_data(array->at(i)); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5271 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5272 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5273 // We don't need to keep track of new CLDs anymore. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5274 ClassLoaderDataGraph::remember_new_clds(false); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5275 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5276 _timer.stop(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5277 if (PrintCMSStatistics != 0) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5278 gclog_or_tty->print_cr( |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5279 "Finished unhandled CLD scanning work in %dth thread: %3.3f sec", |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5280 worker_id, _timer.seconds()); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5281 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5282 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5283 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5284 // ---------- dirty klass scanning ---------- |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5285 if (worker_id == 0) { // Single threaded at the moment. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5286 _timer.reset(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5287 _timer.start(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5288 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5289 // Scan all classes that was dirtied during the concurrent marking phase. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5290 RemarkKlassClosure remark_klass_closure(&par_mrias_cl); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5291 ClassLoaderDataGraph::classes_do(&remark_klass_closure); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5292 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5293 _timer.stop(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5294 if (PrintCMSStatistics != 0) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5295 gclog_or_tty->print_cr( |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5296 "Finished dirty klass scanning work in %dth thread: %3.3f sec", |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5297 worker_id, _timer.seconds()); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5298 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5299 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5300 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5301 // We might have added oops to ClassLoaderData::_handles during the |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5302 // concurrent marking phase. These oops point to newly allocated objects |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5303 // that are guaranteed to be kept alive. Either by the direct allocation |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5304 // code, or when the young collector processes the strong roots. Hence, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5305 // we don't have to revisit the _handles block during the remark phase. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5306 |
| 0 | 5307 // ---------- rescan dirty cards ------------ |
| 5308 _timer.reset(); | |
| 5309 _timer.start(); | |
| 5310 | |
| 5311 // Do the rescan tasks for each of the two spaces | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5312 // (cms_space) in turn. |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5313 // "worker_id" is passed to select the task_queue for "worker_id" |
|
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5314 do_dirty_card_rescan_tasks(_cms_space, worker_id, &par_mrias_cl); |
| 0 | 5315 _timer.stop(); |
| 5316 if (PrintCMSStatistics != 0) { | |
| 5317 gclog_or_tty->print_cr( | |
| 5318 "Finished dirty card rescan work in %dth thread: %3.3f sec", | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5319 worker_id, _timer.seconds()); |
| 0 | 5320 } |
| 5321 | |
| 5322 // ---------- steal work from other threads ... | |
| 5323 // ---------- ... and drain overflow list. | |
| 5324 _timer.reset(); | |
| 5325 _timer.start(); | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5326 do_work_steal(worker_id, &par_mrias_cl, _collector->hash_seed(worker_id)); |
| 0 | 5327 _timer.stop(); |
| 5328 if (PrintCMSStatistics != 0) { | |
| 5329 gclog_or_tty->print_cr( | |
| 5330 "Finished work stealing in %dth thread: %3.3f sec", | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5331 worker_id, _timer.seconds()); |
| 0 | 5332 } |
| 5333 } | |
| 5334 | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5335 // Note that parameter "i" is not used. |
| 0 | 5336 void |
| 5337 CMSParRemarkTask::do_young_space_rescan(int i, | |
| 5338 Par_MarkRefsIntoAndScanClosure* cl, ContiguousSpace* space, | |
| 5339 HeapWord** chunk_array, size_t chunk_top) { | |
| 5340 // Until all tasks completed: | |
| 5341 // . claim an unclaimed task | |
| 5342 // . compute region boundaries corresponding to task claimed | |
| 5343 // using chunk_array | |
| 5344 // . par_oop_iterate(cl) over that region | |
| 5345 | |
| 5346 ResourceMark rm; | |
| 5347 HandleMark hm; | |
| 5348 | |
| 5349 SequentialSubTasksDone* pst = space->par_seq_tasks(); | |
| 5350 assert(pst->valid(), "Uninitialized use?"); | |
| 5351 | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5352 uint nth_task = 0; |
|
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5353 uint n_tasks = pst->n_tasks(); |
| 0 | 5354 |
| 5355 HeapWord *start, *end; | |
| 5356 while (!pst->is_task_claimed(/* reference */ nth_task)) { | |
| 5357 // We claimed task # nth_task; compute its boundaries. | |
| 5358 if (chunk_top == 0) { // no samples were taken | |
| 5359 assert(nth_task == 0 && n_tasks == 1, "Can have only 1 EdenSpace task"); | |
| 5360 start = space->bottom(); | |
| 5361 end = space->top(); | |
| 5362 } else if (nth_task == 0) { | |
| 5363 start = space->bottom(); | |
| 5364 end = chunk_array[nth_task]; | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5365 } else if (nth_task < (uint)chunk_top) { |
| 0 | 5366 assert(nth_task >= 1, "Control point invariant"); |
| 5367 start = chunk_array[nth_task - 1]; | |
| 5368 end = chunk_array[nth_task]; | |
| 5369 } else { | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5370 assert(nth_task == (uint)chunk_top, "Control point invariant"); |
| 0 | 5371 start = chunk_array[chunk_top - 1]; |
| 5372 end = space->top(); | |
| 5373 } | |
| 5374 MemRegion mr(start, end); | |
| 5375 // Verify that mr is in space | |
| 5376 assert(mr.is_empty() || space->used_region().contains(mr), | |
| 5377 "Should be in space"); | |
| 5378 // Verify that "start" is an object boundary | |
| 5379 assert(mr.is_empty() || oop(mr.start())->is_oop(), | |
| 5380 "Should be an oop"); | |
| 5381 space->par_oop_iterate(mr, cl); | |
| 5382 } | |
| 5383 pst->all_tasks_completed(); | |
| 5384 } | |
| 5385 | |
| 5386 void | |
| 5387 CMSParRemarkTask::do_dirty_card_rescan_tasks( | |
| 5388 CompactibleFreeListSpace* sp, int i, | |
| 5389 Par_MarkRefsIntoAndScanClosure* cl) { | |
| 5390 // Until all tasks completed: | |
| 5391 // . claim an unclaimed task | |
| 5392 // . compute region boundaries corresponding to task claimed | |
| 5393 // . transfer dirty bits ct->mut for that region | |
| 5394 // . apply rescanclosure to dirty mut bits for that region | |
| 5395 | |
| 5396 ResourceMark rm; | |
| 5397 HandleMark hm; | |
| 5398 | |
| 5399 OopTaskQueue* work_q = work_queue(i); | |
| 5400 ModUnionClosure modUnionClosure(&(_collector->_modUnionTable)); | |
| 5401 // CAUTION! CAUTION! CAUTION! CAUTION! CAUTION! CAUTION! CAUTION! | |
| 5402 // CAUTION: This closure has state that persists across calls to | |
| 5403 // the work method dirty_range_iterate_clear() in that it has | |
| 5404 // imbedded in it a (subtype of) UpwardsObjectClosure. The | |
| 5405 // use of that state in the imbedded UpwardsObjectClosure instance | |
| 5406 // assumes that the cards are always iterated (even if in parallel | |
| 5407 // by several threads) in monotonically increasing order per each | |
| 5408 // thread. This is true of the implementation below which picks | |
| 5409 // card ranges (chunks) in monotonically increasing order globally | |
| 5410 // and, a-fortiori, in monotonically increasing order per thread | |
| 5411 // (the latter order being a subsequence of the former). | |
| 5412 // If the work code below is ever reorganized into a more chaotic | |
| 5413 // work-partitioning form than the current "sequential tasks" | |
| 5414 // paradigm, the use of that persistent state will have to be | |
| 5415 // revisited and modified appropriately. See also related | |
| 5416 // bug 4756801 work on which should examine this code to make | |
| 5417 // sure that the changes there do not run counter to the | |
| 5418 // assumptions made here and necessary for correctness and | |
| 5419 // efficiency. Note also that this code might yield inefficient | |
| 5420 // behaviour in the case of very large objects that span one or | |
| 5421 // more work chunks. Such objects would potentially be scanned | |
| 5422 // several times redundantly. Work on 4756801 should try and | |
| 5423 // address that performance anomaly if at all possible. XXX | |
| 5424 MemRegion full_span = _collector->_span; | |
| 5425 CMSBitMap* bm = &(_collector->_markBitMap); // shared | |
| 5426 MarkFromDirtyCardsClosure | |
| 5427 greyRescanClosure(_collector, full_span, // entire span of interest | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5428 sp, bm, work_q, cl); |
| 0 | 5429 |
| 5430 SequentialSubTasksDone* pst = sp->conc_par_seq_tasks(); | |
| 5431 assert(pst->valid(), "Uninitialized use?"); | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5432 uint nth_task = 0; |
| 0 | 5433 const int alignment = CardTableModRefBS::card_size * BitsPerWord; |
| 5434 MemRegion span = sp->used_region(); | |
| 5435 HeapWord* start_addr = span.start(); | |
| 5436 HeapWord* end_addr = (HeapWord*)round_to((intptr_t)span.end(), | |
| 5437 alignment); | |
| 5438 const size_t chunk_size = sp->rescan_task_size(); // in HeapWord units | |
| 5439 assert((HeapWord*)round_to((intptr_t)start_addr, alignment) == | |
| 5440 start_addr, "Check alignment"); | |
| 5441 assert((size_t)round_to((intptr_t)chunk_size, alignment) == | |
| 5442 chunk_size, "Check alignment"); | |
| 5443 | |
| 5444 while (!pst->is_task_claimed(/* reference */ nth_task)) { | |
| 5445 // Having claimed the nth_task, compute corresponding mem-region, | |
| 5446 // which is a-fortiori aligned correctly (i.e. at a MUT bopundary). | |
| 5447 // The alignment restriction ensures that we do not need any | |
| 5448 // synchronization with other gang-workers while setting or | |
| 5449 // clearing bits in thus chunk of the MUT. | |
| 5450 MemRegion this_span = MemRegion(start_addr + nth_task*chunk_size, | |
| 5451 start_addr + (nth_task+1)*chunk_size); | |
| 5452 // The last chunk's end might be way beyond end of the | |
| 5453 // used region. In that case pull back appropriately. | |
| 5454 if (this_span.end() > end_addr) { | |
| 5455 this_span.set_end(end_addr); | |
| 5456 assert(!this_span.is_empty(), "Program logic (calculation of n_tasks)"); | |
| 5457 } | |
| 5458 // Iterate over the dirty cards covering this chunk, marking them | |
| 5459 // precleaned, and setting the corresponding bits in the mod union | |
| 5460 // table. Since we have been careful to partition at Card and MUT-word | |
| 5461 // boundaries no synchronization is needed between parallel threads. | |
| 5462 _collector->_ct->ct_bs()->dirty_card_iterate(this_span, | |
| 5463 &modUnionClosure); | |
| 5464 | |
| 5465 // Having transferred these marks into the modUnionTable, | |
| 5466 // rescan the marked objects on the dirty cards in the modUnionTable. | |
| 5467 // Even if this is at a synchronous collection, the initial marking | |
| 5468 // may have been done during an asynchronous collection so there | |
| 5469 // may be dirty bits in the mod-union table. | |
| 5470 _collector->_modUnionTable.dirty_range_iterate_clear( | |
| 5471 this_span, &greyRescanClosure); | |
| 5472 _collector->_modUnionTable.verifyNoOneBitsInRange( | |
| 5473 this_span.start(), | |
| 5474 this_span.end()); | |
| 5475 } | |
| 5476 pst->all_tasks_completed(); // declare that i am done | |
| 5477 } | |
| 5478 | |
| 5479 // . see if we can share work_queues with ParNew? XXX | |
| 5480 void | |
| 5481 CMSParRemarkTask::do_work_steal(int i, Par_MarkRefsIntoAndScanClosure* cl, | |
| 5482 int* seed) { | |
| 5483 OopTaskQueue* work_q = work_queue(i); | |
| 5484 NOT_PRODUCT(int num_steals = 0;) | |
| 5485 oop obj_to_scan; | |
| 5486 CMSBitMap* bm = &(_collector->_markBitMap); | |
| 5487 | |
| 5488 while (true) { | |
| 5489 // Completely finish any left over work from (an) earlier round(s) | |
| 5490 cl->trim_queue(0); | |
|
679
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
628
diff
changeset
|
5491 size_t num_from_overflow_list = MIN2((size_t)(work_q->max_elems() - work_q->size())/4, |
|
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
628
diff
changeset
|
5492 (size_t)ParGCDesiredObjsFromOverflowList); |
| 0 | 5493 // Now check if there's any work in the overflow list |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5494 // Passing ParallelGCThreads as the third parameter, no_of_gc_threads, |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5495 // only affects the number of attempts made to get work from the |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5496 // overflow list and does not affect the number of workers. Just |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5497 // pass ParallelGCThreads so this behavior is unchanged. |
| 0 | 5498 if (_collector->par_take_from_overflow_list(num_from_overflow_list, |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5499 work_q, |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5500 ParallelGCThreads)) { |
| 0 | 5501 // found something in global overflow list; |
| 5502 // not yet ready to go stealing work from others. | |
| 5503 // We'd like to assert(work_q->size() != 0, ...) | |
| 5504 // because we just took work from the overflow list, | |
| 5505 // but of course we can't since all of that could have | |
| 5506 // been already stolen from us. | |
| 5507 // "He giveth and He taketh away." | |
| 5508 continue; | |
| 5509 } | |
| 5510 // Verify that we have no work before we resort to stealing | |
| 5511 assert(work_q->size() == 0, "Have work, shouldn't steal"); | |
| 5512 // Try to steal from other queues that have work | |
| 5513 if (task_queues()->steal(i, seed, /* reference */ obj_to_scan)) { | |
| 5514 NOT_PRODUCT(num_steals++;) | |
| 5515 assert(obj_to_scan->is_oop(), "Oops, not an oop!"); | |
| 5516 assert(bm->isMarked((HeapWord*)obj_to_scan), "Stole an unmarked oop?"); | |
| 5517 // Do scanning work | |
| 5518 obj_to_scan->oop_iterate(cl); | |
| 5519 // Loop around, finish this work, and try to steal some more | |
| 5520 } else if (terminator()->offer_termination()) { | |
| 5521 break; // nirvana from the infinite cycle | |
| 5522 } | |
| 5523 } | |
| 5524 NOT_PRODUCT( | |
| 5525 if (PrintCMSStatistics != 0) { | |
| 5526 gclog_or_tty->print("\n\t(%d: stole %d oops)", i, num_steals); | |
| 5527 } | |
| 5528 ) | |
| 5529 assert(work_q->size() == 0 && _collector->overflow_list_is_empty(), | |
| 5530 "Else our work is not yet done"); | |
| 5531 } | |
| 5532 | |
| 5533 // Return a thread-local PLAB recording array, as appropriate. | |
| 5534 void* CMSCollector::get_data_recorder(int thr_num) { | |
| 5535 if (_survivor_plab_array != NULL && | |
| 5536 (CMSPLABRecordAlways || | |
| 5537 (_collectorState > Marking && _collectorState < FinalMarking))) { | |
| 5538 assert(thr_num < (int)ParallelGCThreads, "thr_num is out of bounds"); | |
| 5539 ChunkArray* ca = &_survivor_plab_array[thr_num]; | |
| 5540 ca->reset(); // clear it so that fresh data is recorded | |
| 5541 return (void*) ca; | |
| 5542 } else { | |
| 5543 return NULL; | |
| 5544 } | |
| 5545 } | |
| 5546 | |
| 5547 // Reset all the thread-local PLAB recording arrays | |
| 5548 void CMSCollector::reset_survivor_plab_arrays() { | |
| 5549 for (uint i = 0; i < ParallelGCThreads; i++) { | |
| 5550 _survivor_plab_array[i].reset(); | |
| 5551 } | |
| 5552 } | |
| 5553 | |
| 5554 // Merge the per-thread plab arrays into the global survivor chunk | |
| 5555 // array which will provide the partitioning of the survivor space | |
| 5556 // for CMS rescan. | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5557 void CMSCollector::merge_survivor_plab_arrays(ContiguousSpace* surv, |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5558 int no_of_gc_threads) { |
| 0 | 5559 assert(_survivor_plab_array != NULL, "Error"); |
| 5560 assert(_survivor_chunk_array != NULL, "Error"); | |
| 5561 assert(_collectorState == FinalMarking, "Error"); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5562 for (int j = 0; j < no_of_gc_threads; j++) { |
| 0 | 5563 _cursor[j] = 0; |
| 5564 } | |
| 5565 HeapWord* top = surv->top(); | |
| 5566 size_t i; | |
| 5567 for (i = 0; i < _survivor_chunk_capacity; i++) { // all sca entries | |
| 5568 HeapWord* min_val = top; // Higher than any PLAB address | |
| 5569 uint min_tid = 0; // position of min_val this round | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5570 for (int j = 0; j < no_of_gc_threads; j++) { |
| 0 | 5571 ChunkArray* cur_sca = &_survivor_plab_array[j]; |
| 5572 if (_cursor[j] == cur_sca->end()) { | |
| 5573 continue; | |
| 5574 } | |
| 5575 assert(_cursor[j] < cur_sca->end(), "ctl pt invariant"); | |
| 5576 HeapWord* cur_val = cur_sca->nth(_cursor[j]); | |
| 5577 assert(surv->used_region().contains(cur_val), "Out of bounds value"); | |
| 5578 if (cur_val < min_val) { | |
| 5579 min_tid = j; | |
| 5580 min_val = cur_val; | |
| 5581 } else { | |
| 5582 assert(cur_val < top, "All recorded addresses should be less"); | |
| 5583 } | |
| 5584 } | |
| 5585 // At this point min_val and min_tid are respectively | |
| 5586 // the least address in _survivor_plab_array[j]->nth(_cursor[j]) | |
| 5587 // and the thread (j) that witnesses that address. | |
| 5588 // We record this address in the _survivor_chunk_array[i] | |
| 5589 // and increment _cursor[min_tid] prior to the next round i. | |
| 5590 if (min_val == top) { | |
| 5591 break; | |
| 5592 } | |
| 5593 _survivor_chunk_array[i] = min_val; | |
| 5594 _cursor[min_tid]++; | |
| 5595 } | |
| 5596 // We are all done; record the size of the _survivor_chunk_array | |
| 5597 _survivor_chunk_index = i; // exclusive: [0, i) | |
| 5598 if (PrintCMSStatistics > 0) { | |
| 5599 gclog_or_tty->print(" (Survivor:" SIZE_FORMAT "chunks) ", i); | |
| 5600 } | |
| 5601 // Verify that we used up all the recorded entries | |
| 5602 #ifdef ASSERT | |
| 5603 size_t total = 0; | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5604 for (int j = 0; j < no_of_gc_threads; j++) { |
| 0 | 5605 assert(_cursor[j] == _survivor_plab_array[j].end(), "Ctl pt invariant"); |
| 5606 total += _cursor[j]; | |
| 5607 } | |
| 5608 assert(total == _survivor_chunk_index, "Ctl Pt Invariant"); | |
| 5609 // Check that the merged array is in sorted order | |
| 5610 if (total > 0) { | |
| 5611 for (size_t i = 0; i < total - 1; i++) { | |
| 5612 if (PrintCMSStatistics > 0) { | |
| 5613 gclog_or_tty->print(" (chunk" SIZE_FORMAT ":" INTPTR_FORMAT ") ", | |
| 5614 i, _survivor_chunk_array[i]); | |
| 5615 } | |
| 5616 assert(_survivor_chunk_array[i] < _survivor_chunk_array[i+1], | |
| 5617 "Not sorted"); | |
| 5618 } | |
| 5619 } | |
| 5620 #endif // ASSERT | |
| 5621 } | |
| 5622 | |
| 5623 // Set up the space's par_seq_tasks structure for work claiming | |
| 5624 // for parallel rescan of young gen. | |
| 5625 // See ParRescanTask where this is currently used. | |
| 5626 void | |
| 5627 CMSCollector:: | |
| 5628 initialize_sequential_subtasks_for_young_gen_rescan(int n_threads) { | |
| 5629 assert(n_threads > 0, "Unexpected n_threads argument"); | |
| 5630 DefNewGeneration* dng = (DefNewGeneration*)_young_gen; | |
| 5631 | |
| 5632 // Eden space | |
| 5633 { | |
| 5634 SequentialSubTasksDone* pst = dng->eden()->par_seq_tasks(); | |
| 5635 assert(!pst->valid(), "Clobbering existing data?"); | |
| 5636 // Each valid entry in [0, _eden_chunk_index) represents a task. | |
| 5637 size_t n_tasks = _eden_chunk_index + 1; | |
| 5638 assert(n_tasks == 1 || _eden_chunk_array != NULL, "Error"); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5639 // Sets the condition for completion of the subtask (how many threads |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5640 // need to finish in order to be done). |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5641 pst->set_n_threads(n_threads); |
| 0 | 5642 pst->set_n_tasks((int)n_tasks); |
| 5643 } | |
| 5644 | |
| 5645 // Merge the survivor plab arrays into _survivor_chunk_array | |
| 5646 if (_survivor_plab_array != NULL) { | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5647 merge_survivor_plab_arrays(dng->from(), n_threads); |
| 0 | 5648 } else { |
| 5649 assert(_survivor_chunk_index == 0, "Error"); | |
| 5650 } | |
| 5651 | |
| 5652 // To space | |
| 5653 { | |
| 5654 SequentialSubTasksDone* pst = dng->to()->par_seq_tasks(); | |
| 5655 assert(!pst->valid(), "Clobbering existing data?"); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5656 // Sets the condition for completion of the subtask (how many threads |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5657 // need to finish in order to be done). |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5658 pst->set_n_threads(n_threads); |
| 0 | 5659 pst->set_n_tasks(1); |
| 5660 assert(pst->valid(), "Error"); | |
| 5661 } | |
| 5662 | |
| 5663 // From space | |
| 5664 { | |
| 5665 SequentialSubTasksDone* pst = dng->from()->par_seq_tasks(); | |
| 5666 assert(!pst->valid(), "Clobbering existing data?"); | |
| 5667 size_t n_tasks = _survivor_chunk_index + 1; | |
| 5668 assert(n_tasks == 1 || _survivor_chunk_array != NULL, "Error"); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5669 // Sets the condition for completion of the subtask (how many threads |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5670 // need to finish in order to be done). |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5671 pst->set_n_threads(n_threads); |
| 0 | 5672 pst->set_n_tasks((int)n_tasks); |
| 5673 assert(pst->valid(), "Error"); | |
| 5674 } | |
| 5675 } | |
| 5676 | |
| 5677 // Parallel version of remark | |
| 5678 void CMSCollector::do_remark_parallel() { | |
| 5679 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5680 FlexibleWorkGang* workers = gch->workers(); |
| 0 | 5681 assert(workers != NULL, "Need parallel worker threads."); |
|
4095
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
5682 // Choose to use the number of GC workers most recently set |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
5683 // into "active_workers". If active_workers is not set, set it |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
5684 // to ParallelGCThreads. |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
5685 int n_workers = workers->active_workers(); |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
5686 if (n_workers == 0) { |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
5687 assert(n_workers > 0, "Should have been set during scavenge"); |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
5688 n_workers = ParallelGCThreads; |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
5689 workers->set_active_workers(n_workers); |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
5690 } |
| 0 | 5691 CompactibleFreeListSpace* cms_space = _cmsGen->cmsSpace(); |
| 5692 | |
| 5693 CMSParRemarkTask tsk(this, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5694 cms_space, |
| 0 | 5695 n_workers, workers, task_queues()); |
| 5696 | |
| 5697 // Set up for parallel process_strong_roots work. | |
| 5698 gch->set_par_threads(n_workers); | |
| 5699 // We won't be iterating over the cards in the card table updating | |
| 5700 // the younger_gen cards, so we shouldn't call the following else | |
| 5701 // the verification code as well as subsequent younger_refs_iterate | |
| 5702 // code would get confused. XXX | |
| 5703 // gch->rem_set()->prepare_for_younger_refs_iterate(true); // parallel | |
| 5704 | |
| 5705 // The young gen rescan work will not be done as part of | |
| 5706 // process_strong_roots (which currently doesn't knw how to | |
| 5707 // parallelize such a scan), but rather will be broken up into | |
| 5708 // a set of parallel tasks (via the sampling that the [abortable] | |
| 5709 // preclean phase did of EdenSpace, plus the [two] tasks of | |
| 5710 // scanning the [two] survivor spaces. Further fine-grain | |
| 5711 // parallelization of the scanning of the survivor spaces | |
| 5712 // themselves, and of precleaning of the younger gen itself | |
| 5713 // is deferred to the future. | |
| 5714 initialize_sequential_subtasks_for_young_gen_rescan(n_workers); | |
| 5715 | |
| 5716 // The dirty card rescan work is broken up into a "sequence" | |
| 5717 // of parallel tasks (per constituent space) that are dynamically | |
| 5718 // claimed by the parallel threads. | |
| 5719 cms_space->initialize_sequential_subtasks_for_rescan(n_workers); | |
| 5720 | |
| 5721 // It turns out that even when we're using 1 thread, doing the work in a | |
| 5722 // separate thread causes wide variance in run times. We can't help this | |
| 5723 // in the multi-threaded case, but we special-case n=1 here to get | |
| 5724 // repeatable measurements of the 1-thread overhead of the parallel code. | |
| 5725 if (n_workers > 1) { | |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5726 // Make refs discovery MT-safe, if it isn't already: it may not |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5727 // necessarily be so, since it's possible that we are doing |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5728 // ST marking. |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5729 ReferenceProcessorMTDiscoveryMutator mt(ref_processor(), true); |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5730 GenCollectedHeap::StrongRootsScope srs(gch); |
| 0 | 5731 workers->run_task(&tsk); |
| 5732 } else { | |
|
4876
be649fefcdc2
7134655: Crash in reference processing when doing single-threaded remarking
stefank
parents:
4728
diff
changeset
|
5733 ReferenceProcessorMTDiscoveryMutator mt(ref_processor(), false); |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5734 GenCollectedHeap::StrongRootsScope srs(gch); |
| 0 | 5735 tsk.work(0); |
| 5736 } | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5737 |
| 0 | 5738 gch->set_par_threads(0); // 0 ==> non-parallel. |
| 5739 // restore, single-threaded for now, any preserved marks | |
| 5740 // as a result of work_q overflow | |
| 5741 restore_preserved_marks_if_any(); | |
| 5742 } | |
| 5743 | |
| 5744 // Non-parallel version of remark | |
| 5745 void CMSCollector::do_remark_non_parallel() { | |
| 5746 ResourceMark rm; | |
| 5747 HandleMark hm; | |
| 5748 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
|
4876
be649fefcdc2
7134655: Crash in reference processing when doing single-threaded remarking
stefank
parents:
4728
diff
changeset
|
5749 ReferenceProcessorMTDiscoveryMutator mt(ref_processor(), false); |
|
be649fefcdc2
7134655: Crash in reference processing when doing single-threaded remarking
stefank
parents:
4728
diff
changeset
|
5750 |
| 0 | 5751 MarkRefsIntoAndScanClosure |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5752 mrias_cl(_span, ref_processor(), &_markBitMap, NULL /* not precleaning */, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5753 &_markStack, this, |
| 0 | 5754 false /* should_yield */, false /* not precleaning */); |
| 5755 MarkFromDirtyCardsClosure | |
| 5756 markFromDirtyCardsClosure(this, _span, | |
| 5757 NULL, // space is set further below | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5758 &_markBitMap, &_markStack, &mrias_cl); |
| 0 | 5759 { |
| 10405 | 5760 GCTraceTime t("grey object rescan", PrintGCDetails, false, _gc_timer_cm); |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
5761 // Iterate over the dirty cards, setting the corresponding bits in the |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
5762 // mod union table. |
| 0 | 5763 { |
| 5764 ModUnionClosure modUnionClosure(&_modUnionTable); | |
| 5765 _ct->ct_bs()->dirty_card_iterate( | |
| 5766 _cmsGen->used_region(), | |
| 5767 &modUnionClosure); | |
| 5768 } | |
| 5769 // Having transferred these marks into the modUnionTable, we just need | |
| 5770 // to rescan the marked objects on the dirty cards in the modUnionTable. | |
| 5771 // The initial marking may have been done during an asynchronous | |
| 5772 // collection so there may be dirty bits in the mod-union table. | |
| 5773 const int alignment = | |
| 5774 CardTableModRefBS::card_size * BitsPerWord; | |
| 5775 { | |
| 5776 // ... First handle dirty cards in CMS gen | |
| 5777 markFromDirtyCardsClosure.set_space(_cmsGen->cmsSpace()); | |
| 5778 MemRegion ur = _cmsGen->used_region(); | |
| 5779 HeapWord* lb = ur.start(); | |
| 5780 HeapWord* ub = (HeapWord*)round_to((intptr_t)ur.end(), alignment); | |
| 5781 MemRegion cms_span(lb, ub); | |
| 5782 _modUnionTable.dirty_range_iterate_clear(cms_span, | |
| 5783 &markFromDirtyCardsClosure); | |
| 5784 verify_work_stacks_empty(); | |
| 5785 if (PrintCMSStatistics != 0) { | |
| 5786 gclog_or_tty->print(" (re-scanned "SIZE_FORMAT" dirty cards in cms gen) ", | |
| 5787 markFromDirtyCardsClosure.num_dirty_cards()); | |
| 5788 } | |
| 5789 } | |
| 5790 } | |
| 5791 if (VerifyDuringGC && | |
| 5792 GenCollectedHeap::heap()->total_collections() >= VerifyGCStartAt) { | |
| 5793 HandleMark hm; // Discard invalid handles created during verification | |
|
6865
4202510ee0fe
8000831: Heap verification output incorrect/incomplete
johnc
parents:
6787
diff
changeset
|
5794 Universe::verify(); |
| 0 | 5795 } |
| 5796 { | |
| 10405 | 5797 GCTraceTime t("root rescan", PrintGCDetails, false, _gc_timer_cm); |
| 0 | 5798 |
| 5799 verify_work_stacks_empty(); | |
| 5800 | |
| 5801 gch->rem_set()->prepare_for_younger_refs_iterate(false); // Not parallel. | |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5802 GenCollectedHeap::StrongRootsScope srs(gch); |
| 0 | 5803 gch->gen_process_strong_roots(_cmsGen->level(), |
| 5804 true, // younger gens as roots | |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5805 false, // use the local StrongRootsScope |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5806 false, // not scavenging |
| 0 | 5807 SharedHeap::ScanningOption(roots_scanning_options()), |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5808 &mrias_cl, |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5809 true, // walk code active on stacks |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5810 NULL, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5811 NULL); // The dirty klasses will be handled below |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5812 |
|
989
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5813 assert(should_unload_classes() |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5814 || (roots_scanning_options() & SharedHeap::SO_CodeCache), |
|
148e5441d916
6863023: need non-perm oops in code cache for JSR 292
jrose
parents:
798
diff
changeset
|
5815 "if we didn't scan the code cache, we have to be ready to drop nmethods with expired weak oops"); |
| 0 | 5816 } |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5817 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5818 { |
| 10405 | 5819 GCTraceTime t("visit unhandled CLDs", PrintGCDetails, false, _gc_timer_cm); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5820 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5821 verify_work_stacks_empty(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5822 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5823 // Scan all class loader data objects that might have been introduced |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5824 // during concurrent marking. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5825 ResourceMark rm; |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5826 GrowableArray<ClassLoaderData*>* array = ClassLoaderDataGraph::new_clds(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5827 for (int i = 0; i < array->length(); i++) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5828 mrias_cl.do_class_loader_data(array->at(i)); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5829 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5830 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5831 // We don't need to keep track of new CLDs anymore. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5832 ClassLoaderDataGraph::remember_new_clds(false); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5833 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5834 verify_work_stacks_empty(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5835 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5836 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5837 { |
| 10405 | 5838 GCTraceTime t("dirty klass scan", PrintGCDetails, false, _gc_timer_cm); |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5839 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5840 verify_work_stacks_empty(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5841 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5842 RemarkKlassClosure remark_klass_closure(&mrias_cl); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5843 ClassLoaderDataGraph::classes_do(&remark_klass_closure); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5844 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5845 verify_work_stacks_empty(); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5846 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5847 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5848 // We might have added oops to ClassLoaderData::_handles during the |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5849 // concurrent marking phase. These oops point to newly allocated objects |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5850 // that are guaranteed to be kept alive. Either by the direct allocation |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5851 // code, or when the young collector processes the strong roots. Hence, |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5852 // we don't have to revisit the _handles block during the remark phase. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5853 |
| 0 | 5854 verify_work_stacks_empty(); |
| 5855 // Restore evacuated mark words, if any, used for overflow list links | |
| 5856 if (!CMSOverflowEarlyRestoration) { | |
| 5857 restore_preserved_marks_if_any(); | |
| 5858 } | |
| 5859 verify_overflow_empty(); | |
| 5860 } | |
| 5861 | |
| 5862 //////////////////////////////////////////////////////// | |
| 5863 // Parallel Reference Processing Task Proxy Class | |
| 5864 //////////////////////////////////////////////////////// | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5865 class CMSRefProcTaskProxy: public AbstractGangTaskWOopQueues { |
| 0 | 5866 typedef AbstractRefProcTaskExecutor::ProcessTask ProcessTask; |
| 5867 CMSCollector* _collector; | |
| 5868 CMSBitMap* _mark_bit_map; | |
|
143
b5489bb705c9
6662086: 6u4+, 7b11+: CMS never clears referents when -XX:+ParallelRefProcEnabled
ysr
parents:
113
diff
changeset
|
5869 const MemRegion _span; |
| 0 | 5870 ProcessTask& _task; |
| 5871 | |
| 5872 public: | |
| 5873 CMSRefProcTaskProxy(ProcessTask& task, | |
| 5874 CMSCollector* collector, | |
| 5875 const MemRegion& span, | |
| 5876 CMSBitMap* mark_bit_map, | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5877 AbstractWorkGang* workers, |
| 0 | 5878 OopTaskQueueSet* task_queues): |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5879 // XXX Should superclass AGTWOQ also know about AWG since it knows |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5880 // about the task_queues used by the AWG? Then it could initialize |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5881 // the terminator() object. See 6984287. The set_for_termination() |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5882 // below is a temporary band-aid for the regression in 6984287. |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5883 AbstractGangTaskWOopQueues("Process referents by policy in parallel", |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5884 task_queues), |
| 0 | 5885 _task(task), |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5886 _collector(collector), _span(span), _mark_bit_map(mark_bit_map) |
|
2369
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5887 { |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5888 assert(_collector->_span.equals(_span) && !_span.is_empty(), |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5889 "Inconsistency in _span"); |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5890 set_for_termination(workers->active_workers()); |
|
92da084fefc9
6668573: CMS: reference processing crash if ParallelCMSThreads > ParallelGCThreads
ysr
parents:
2365
diff
changeset
|
5891 } |
| 0 | 5892 |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5893 OopTaskQueueSet* task_queues() { return queues(); } |
| 0 | 5894 |
| 5895 OopTaskQueue* work_queue(int i) { return task_queues()->queue(i); } | |
| 5896 | |
| 5897 void do_work_steal(int i, | |
| 5898 CMSParDrainMarkingStackClosure* drain, | |
| 5899 CMSParKeepAliveClosure* keep_alive, | |
| 5900 int* seed); | |
| 5901 | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5902 virtual void work(uint worker_id); |
| 0 | 5903 }; |
| 5904 | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5905 void CMSRefProcTaskProxy::work(uint worker_id) { |
|
143
b5489bb705c9
6662086: 6u4+, 7b11+: CMS never clears referents when -XX:+ParallelRefProcEnabled
ysr
parents:
113
diff
changeset
|
5906 assert(_collector->_span.equals(_span), "Inconsistency in _span"); |
| 0 | 5907 CMSParKeepAliveClosure par_keep_alive(_collector, _span, |
| 935 | 5908 _mark_bit_map, |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5909 work_queue(worker_id)); |
| 0 | 5910 CMSParDrainMarkingStackClosure par_drain_stack(_collector, _span, |
| 935 | 5911 _mark_bit_map, |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5912 work_queue(worker_id)); |
|
143
b5489bb705c9
6662086: 6u4+, 7b11+: CMS never clears referents when -XX:+ParallelRefProcEnabled
ysr
parents:
113
diff
changeset
|
5913 CMSIsAliveClosure is_alive_closure(_span, _mark_bit_map); |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5914 _task.work(worker_id, is_alive_closure, par_keep_alive, par_drain_stack); |
| 0 | 5915 if (_task.marks_oops_alive()) { |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5916 do_work_steal(worker_id, &par_drain_stack, &par_keep_alive, |
|
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5917 _collector->hash_seed(worker_id)); |
|
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5918 } |
|
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5919 assert(work_queue(worker_id)->size() == 0, "work_queue should be empty"); |
| 0 | 5920 assert(_collector->_overflow_list == NULL, "non-empty _overflow_list"); |
| 5921 } | |
| 5922 | |
| 5923 class CMSRefEnqueueTaskProxy: public AbstractGangTask { | |
| 5924 typedef AbstractRefProcTaskExecutor::EnqueueTask EnqueueTask; | |
| 5925 EnqueueTask& _task; | |
| 5926 | |
| 5927 public: | |
| 5928 CMSRefEnqueueTaskProxy(EnqueueTask& task) | |
| 5929 : AbstractGangTask("Enqueue reference objects in parallel"), | |
| 5930 _task(task) | |
| 5931 { } | |
| 5932 | |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5933 virtual void work(uint worker_id) |
| 0 | 5934 { |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4128
diff
changeset
|
5935 _task.work(worker_id); |
| 0 | 5936 } |
| 5937 }; | |
| 5938 | |
| 5939 CMSParKeepAliveClosure::CMSParKeepAliveClosure(CMSCollector* collector, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5940 MemRegion span, CMSBitMap* bit_map, OopTaskQueue* work_queue): |
| 0 | 5941 _span(span), |
| 5942 _bit_map(bit_map), | |
| 5943 _work_queue(work_queue), | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
5944 _mark_and_push(collector, span, bit_map, work_queue), |
| 0 | 5945 _low_water_mark(MIN2((uint)(work_queue->max_elems()/4), |
| 5946 (uint)(CMSWorkQueueDrainThreshold * ParallelGCThreads))) | |
| 5947 { } | |
| 5948 | |
| 5949 // . see if we can share work_queues with ParNew? XXX | |
| 5950 void CMSRefProcTaskProxy::do_work_steal(int i, | |
| 5951 CMSParDrainMarkingStackClosure* drain, | |
| 5952 CMSParKeepAliveClosure* keep_alive, | |
| 5953 int* seed) { | |
| 5954 OopTaskQueue* work_q = work_queue(i); | |
| 5955 NOT_PRODUCT(int num_steals = 0;) | |
| 5956 oop obj_to_scan; | |
| 5957 | |
| 5958 while (true) { | |
| 5959 // Completely finish any left over work from (an) earlier round(s) | |
| 5960 drain->trim_queue(0); | |
|
679
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
628
diff
changeset
|
5961 size_t num_from_overflow_list = MIN2((size_t)(work_q->max_elems() - work_q->size())/4, |
|
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
628
diff
changeset
|
5962 (size_t)ParGCDesiredObjsFromOverflowList); |
| 0 | 5963 // Now check if there's any work in the overflow list |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5964 // Passing ParallelGCThreads as the third parameter, no_of_gc_threads, |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5965 // only affects the number of attempts made to get work from the |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5966 // overflow list and does not affect the number of workers. Just |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5967 // pass ParallelGCThreads so this behavior is unchanged. |
| 0 | 5968 if (_collector->par_take_from_overflow_list(num_from_overflow_list, |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5969 work_q, |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
5970 ParallelGCThreads)) { |
| 0 | 5971 // Found something in global overflow list; |
| 5972 // not yet ready to go stealing work from others. | |
| 5973 // We'd like to assert(work_q->size() != 0, ...) | |
| 5974 // because we just took work from the overflow list, | |
| 5975 // but of course we can't, since all of that might have | |
| 5976 // been already stolen from us. | |
| 5977 continue; | |
| 5978 } | |
| 5979 // Verify that we have no work before we resort to stealing | |
| 5980 assert(work_q->size() == 0, "Have work, shouldn't steal"); | |
| 5981 // Try to steal from other queues that have work | |
| 5982 if (task_queues()->steal(i, seed, /* reference */ obj_to_scan)) { | |
| 5983 NOT_PRODUCT(num_steals++;) | |
| 5984 assert(obj_to_scan->is_oop(), "Oops, not an oop!"); | |
| 5985 assert(_mark_bit_map->isMarked((HeapWord*)obj_to_scan), "Stole an unmarked oop?"); | |
| 5986 // Do scanning work | |
| 5987 obj_to_scan->oop_iterate(keep_alive); | |
| 5988 // Loop around, finish this work, and try to steal some more | |
| 5989 } else if (terminator()->offer_termination()) { | |
| 5990 break; // nirvana from the infinite cycle | |
| 5991 } | |
| 5992 } | |
| 5993 NOT_PRODUCT( | |
| 5994 if (PrintCMSStatistics != 0) { | |
| 5995 gclog_or_tty->print("\n\t(%d: stole %d oops)", i, num_steals); | |
| 5996 } | |
| 5997 ) | |
| 5998 } | |
| 5999 | |
| 6000 void CMSRefProcTaskExecutor::execute(ProcessTask& task) | |
| 6001 { | |
| 6002 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
6003 FlexibleWorkGang* workers = gch->workers(); |
| 0 | 6004 assert(workers != NULL, "Need parallel worker threads."); |
| 6005 CMSRefProcTaskProxy rp_task(task, &_collector, | |
| 6006 _collector.ref_processor()->span(), | |
| 6007 _collector.markBitMap(), | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
6008 workers, _collector.task_queues()); |
| 0 | 6009 workers->run_task(&rp_task); |
| 6010 } | |
| 6011 | |
| 6012 void CMSRefProcTaskExecutor::execute(EnqueueTask& task) | |
| 6013 { | |
| 6014 | |
| 6015 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
6016 FlexibleWorkGang* workers = gch->workers(); |
| 0 | 6017 assert(workers != NULL, "Need parallel worker threads."); |
| 6018 CMSRefEnqueueTaskProxy enq_task(task); | |
| 6019 workers->run_task(&enq_task); | |
| 6020 } | |
| 6021 | |
| 6022 void CMSCollector::refProcessingWork(bool asynch, bool clear_all_soft_refs) { | |
| 6023 | |
| 6024 ResourceMark rm; | |
| 6025 HandleMark hm; | |
| 6026 | |
| 6027 ReferenceProcessor* rp = ref_processor(); | |
| 6028 assert(rp->span().equals(_span), "Spans should be equal"); | |
|
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
6029 assert(!rp->enqueuing_is_done(), "Enqueuing should not be complete"); |
|
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
6030 // Process weak references. |
|
457
27a80744a83b
6778647: snap(), snap_policy() should be renamed setup(), setup_policy()
ysr
parents:
453
diff
changeset
|
6031 rp->setup_policy(clear_all_soft_refs); |
|
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
6032 verify_work_stacks_empty(); |
|
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
6033 |
| 0 | 6034 CMSKeepAliveClosure cmsKeepAliveClosure(this, _span, &_markBitMap, |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6035 &_markStack, false /* !preclean */); |
| 0 | 6036 CMSDrainMarkingStackClosure cmsDrainMarkingStackClosure(this, |
| 6037 _span, &_markBitMap, &_markStack, | |
|
452
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
6038 &cmsKeepAliveClosure, false /* !preclean */); |
| 0 | 6039 { |
| 10405 | 6040 GCTraceTime t("weak refs processing", PrintGCDetails, false, _gc_timer_cm); |
| 6041 | |
| 6042 ReferenceProcessorStats stats; | |
| 0 | 6043 if (rp->processing_is_mt()) { |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
6044 // Set the degree of MT here. If the discovery is done MT, there |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
6045 // may have been a different number of threads doing the discovery |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
6046 // and a different number of discovered lists may have Ref objects. |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
6047 // That is OK as long as the Reference lists are balanced (see |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
6048 // balance_all_queues() and balance_queues()). |
|
4095
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
6049 GenCollectedHeap* gch = GenCollectedHeap::heap(); |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
6050 int active_workers = ParallelGCThreads; |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
6051 FlexibleWorkGang* workers = gch->workers(); |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
6052 if (workers != NULL) { |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
6053 active_workers = workers->active_workers(); |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
6054 // The expectation is that active_workers will have already |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
6055 // been set to a reasonable value. If it has not been set, |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
6056 // investigate. |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
6057 assert(active_workers > 0, "Should have been set during scavenge"); |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
6058 } |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
3979
diff
changeset
|
6059 rp->set_active_mt_degree(active_workers); |
| 0 | 6060 CMSRefProcTaskExecutor task_executor(*this); |
| 10405 | 6061 stats = rp->process_discovered_references(&_is_alive_closure, |
| 0 | 6062 &cmsKeepAliveClosure, |
| 6063 &cmsDrainMarkingStackClosure, | |
| 10405 | 6064 &task_executor, |
| 6065 _gc_timer_cm); | |
| 0 | 6066 } else { |
| 10405 | 6067 stats = rp->process_discovered_references(&_is_alive_closure, |
| 0 | 6068 &cmsKeepAliveClosure, |
| 6069 &cmsDrainMarkingStackClosure, | |
| 10405 | 6070 NULL, |
| 6071 _gc_timer_cm); | |
| 6072 } | |
| 6073 _gc_tracer_cm->report_gc_reference_stats(stats); | |
| 6074 | |
|
10188
2f50bc369470
8013160: NPG: Remove unnecessary mark stack draining after CodeCache::do_unloading
stefank
parents:
10186
diff
changeset
|
6075 } |
|
2f50bc369470
8013160: NPG: Remove unnecessary mark stack draining after CodeCache::do_unloading
stefank
parents:
10186
diff
changeset
|
6076 |
|
2f50bc369470
8013160: NPG: Remove unnecessary mark stack draining after CodeCache::do_unloading
stefank
parents:
10186
diff
changeset
|
6077 // This is the point where the entire marking should have completed. |
|
2f50bc369470
8013160: NPG: Remove unnecessary mark stack draining after CodeCache::do_unloading
stefank
parents:
10186
diff
changeset
|
6078 verify_work_stacks_empty(); |
| 0 | 6079 |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
6080 if (should_unload_classes()) { |
| 0 | 6081 { |
| 10405 | 6082 GCTraceTime t("class unloading", PrintGCDetails, false, _gc_timer_cm); |
| 0 | 6083 |
|
10188
2f50bc369470
8013160: NPG: Remove unnecessary mark stack draining after CodeCache::do_unloading
stefank
parents:
10186
diff
changeset
|
6084 // Unload classes and purge the SystemDictionary. |
| 0 | 6085 bool purged_class = SystemDictionary::do_unloading(&_is_alive_closure); |
| 6086 | |
|
10188
2f50bc369470
8013160: NPG: Remove unnecessary mark stack draining after CodeCache::do_unloading
stefank
parents:
10186
diff
changeset
|
6087 // Unload nmethods. |
|
6787
8966c2d65d96
7200470: KeepAliveClosure not needed in CodeCache::do_unloading
brutisso
parents:
6755
diff
changeset
|
6088 CodeCache::do_unloading(&_is_alive_closure, purged_class); |
| 0 | 6089 |
|
10188
2f50bc369470
8013160: NPG: Remove unnecessary mark stack draining after CodeCache::do_unloading
stefank
parents:
10186
diff
changeset
|
6090 // Prune dead klasses from subklass/sibling/implementor lists. |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6091 Klass::clean_weak_klass_links(&_is_alive_closure); |
| 0 | 6092 } |
| 6093 | |
| 6094 { | |
| 10405 | 6095 GCTraceTime t("scrub symbol table", PrintGCDetails, false, _gc_timer_cm); |
|
2177
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2147
diff
changeset
|
6096 // Clean up unreferenced symbols in symbol table. |
|
3582bf76420e
6990754: Use native memory and reference counting to implement SymbolTable
coleenp
parents:
2147
diff
changeset
|
6097 SymbolTable::unlink(); |
| 0 | 6098 } |
| 6099 } | |
| 6100 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6101 // CMS doesn't use the StringTable as hard roots when class unloading is turned off. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6102 // Need to check if we really scanned the StringTable. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6103 if ((roots_scanning_options() & SharedHeap::SO_Strings) == 0) { |
| 10405 | 6104 GCTraceTime t("scrub string table", PrintGCDetails, false, _gc_timer_cm); |
|
10188
2f50bc369470
8013160: NPG: Remove unnecessary mark stack draining after CodeCache::do_unloading
stefank
parents:
10186
diff
changeset
|
6105 // Delete entries for dead interned strings. |
|
2379
b099aaf51bf8
6962931: move interned strings out of the perm gen
jcoomes
parents:
2369
diff
changeset
|
6106 StringTable::unlink(&_is_alive_closure); |
|
b099aaf51bf8
6962931: move interned strings out of the perm gen
jcoomes
parents:
2369
diff
changeset
|
6107 } |
|
b099aaf51bf8
6962931: move interned strings out of the perm gen
jcoomes
parents:
2369
diff
changeset
|
6108 |
| 0 | 6109 // Restore any preserved marks as a result of mark stack or |
| 6110 // work queue overflow | |
| 6111 restore_preserved_marks_if_any(); // done single-threaded for now | |
| 6112 | |
| 6113 rp->set_enqueuing_is_done(true); | |
| 6114 if (rp->processing_is_mt()) { | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
6115 rp->balance_all_queues(); |
| 0 | 6116 CMSRefProcTaskExecutor task_executor(*this); |
| 6117 rp->enqueue_discovered_references(&task_executor); | |
| 6118 } else { | |
| 6119 rp->enqueue_discovered_references(NULL); | |
| 6120 } | |
| 6121 rp->verify_no_references_recorded(); | |
| 6122 assert(!rp->discovery_enabled(), "should have been disabled"); | |
| 6123 } | |
| 6124 | |
| 6125 #ifndef PRODUCT | |
| 6126 void CMSCollector::check_correct_thread_executing() { | |
| 6127 Thread* t = Thread::current(); | |
| 6128 // Only the VM thread or the CMS thread should be here. | |
| 6129 assert(t->is_ConcurrentGC_thread() || t->is_VM_thread(), | |
| 6130 "Unexpected thread type"); | |
| 6131 // If this is the vm thread, the foreground process | |
| 6132 // should not be waiting. Note that _foregroundGCIsActive is | |
| 6133 // true while the foreground collector is waiting. | |
| 6134 if (_foregroundGCShouldWait) { | |
| 6135 // We cannot be the VM thread | |
| 6136 assert(t->is_ConcurrentGC_thread(), | |
| 6137 "Should be CMS thread"); | |
| 6138 } else { | |
| 6139 // We can be the CMS thread only if we are in a stop-world | |
| 6140 // phase of CMS collection. | |
| 6141 if (t->is_ConcurrentGC_thread()) { | |
| 6142 assert(_collectorState == InitialMarking || | |
| 6143 _collectorState == FinalMarking, | |
| 6144 "Should be a stop-world phase"); | |
| 6145 // The CMS thread should be holding the CMS_token. | |
| 6146 assert(ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 6147 "Potential interference with concurrently " | |
| 6148 "executing VM thread"); | |
| 6149 } | |
| 6150 } | |
| 6151 } | |
| 6152 #endif | |
| 6153 | |
| 6154 void CMSCollector::sweep(bool asynch) { | |
| 6155 assert(_collectorState == Sweeping, "just checking"); | |
| 6156 check_correct_thread_executing(); | |
| 6157 verify_work_stacks_empty(); | |
| 6158 verify_overflow_empty(); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6159 increment_sweep_count(); |
|
3356
78542e2b5e35
7036199: Adding a notification to the implementation of GarbageCollectorMXBeans
fparain
parents:
3293
diff
changeset
|
6160 TraceCMSMemoryManagerStats tms(_collectorState,GenCollectedHeap::heap()->gc_cause()); |
|
1703
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
6161 |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6162 _inter_sweep_timer.stop(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6163 _inter_sweep_estimate.sample(_inter_sweep_timer.seconds()); |
| 0 | 6164 size_policy()->avg_cms_free_at_sweep()->sample(_cmsGen->free()); |
| 6165 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6166 assert(!_intra_sweep_timer.is_active(), "Should not be active"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6167 _intra_sweep_timer.reset(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6168 _intra_sweep_timer.start(); |
| 0 | 6169 if (asynch) { |
| 6170 TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); | |
| 6171 CMSPhaseAccounting pa(this, "sweep", !PrintGCDetails); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6172 // First sweep the old gen |
| 0 | 6173 { |
| 6174 CMSTokenSyncWithLocks ts(true, _cmsGen->freelistLock(), | |
| 6175 bitMapLock()); | |
| 6176 sweepWork(_cmsGen, asynch); | |
| 6177 } | |
| 6178 | |
| 6179 // Update Universe::_heap_*_at_gc figures. | |
| 6180 // We need all the free list locks to make the abstract state | |
| 6181 // transition from Sweeping to Resetting. See detailed note | |
| 6182 // further below. | |
| 6183 { | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6184 CMSTokenSyncWithLocks ts(true, _cmsGen->freelistLock()); |
| 0 | 6185 // Update heap occupancy information which is used as |
| 6186 // input to soft ref clearing policy at the next gc. | |
| 6187 Universe::update_heap_info_at_gc(); | |
| 6188 _collectorState = Resizing; | |
| 6189 } | |
| 6190 } else { | |
| 6191 // already have needed locks | |
| 6192 sweepWork(_cmsGen, asynch); | |
| 6193 // Update heap occupancy information which is used as | |
| 6194 // input to soft ref clearing policy at the next gc. | |
| 6195 Universe::update_heap_info_at_gc(); | |
| 6196 _collectorState = Resizing; | |
| 6197 } | |
| 6198 verify_work_stacks_empty(); | |
| 6199 verify_overflow_empty(); | |
| 6200 | |
|
8784
79af1312fc2c
8005602: NPG: classunloading does not happen while CMS GC with -XX:+CMSClassUnloadingEnabled is used
mgerdin
parents:
8740
diff
changeset
|
6201 if (should_unload_classes()) { |
|
79af1312fc2c
8005602: NPG: classunloading does not happen while CMS GC with -XX:+CMSClassUnloadingEnabled is used
mgerdin
parents:
8740
diff
changeset
|
6202 ClassLoaderDataGraph::purge(); |
|
79af1312fc2c
8005602: NPG: classunloading does not happen while CMS GC with -XX:+CMSClassUnloadingEnabled is used
mgerdin
parents:
8740
diff
changeset
|
6203 } |
|
79af1312fc2c
8005602: NPG: classunloading does not happen while CMS GC with -XX:+CMSClassUnloadingEnabled is used
mgerdin
parents:
8740
diff
changeset
|
6204 |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6205 _intra_sweep_timer.stop(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6206 _intra_sweep_estimate.sample(_intra_sweep_timer.seconds()); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6207 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6208 _inter_sweep_timer.reset(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6209 _inter_sweep_timer.start(); |
| 0 | 6210 |
| 4911 | 6211 // We need to use a monotonically non-deccreasing time in ms |
| 6212 // or we will see time-warp warnings and os::javaTimeMillis() | |
| 6213 // does not guarantee monotonicity. | |
| 6214 jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; | |
| 6215 update_time_of_last_gc(now); | |
| 0 | 6216 |
| 6217 // NOTE on abstract state transitions: | |
| 6218 // Mutators allocate-live and/or mark the mod-union table dirty | |
| 6219 // based on the state of the collection. The former is done in | |
| 6220 // the interval [Marking, Sweeping] and the latter in the interval | |
| 6221 // [Marking, Sweeping). Thus the transitions into the Marking state | |
| 6222 // and out of the Sweeping state must be synchronously visible | |
| 6223 // globally to the mutators. | |
| 6224 // The transition into the Marking state happens with the world | |
| 6225 // stopped so the mutators will globally see it. Sweeping is | |
| 6226 // done asynchronously by the background collector so the transition | |
| 6227 // from the Sweeping state to the Resizing state must be done | |
| 6228 // under the freelistLock (as is the check for whether to | |
| 6229 // allocate-live and whether to dirty the mod-union table). | |
| 6230 assert(_collectorState == Resizing, "Change of collector state to" | |
| 6231 " Resizing must be done under the freelistLocks (plural)"); | |
| 6232 | |
|
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
6233 // Now that sweeping has been completed, we clear |
|
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
6234 // the incremental_collection_failed flag, |
| 0 | 6235 // thus inviting a younger gen collection to promote into |
| 6236 // this generation. If such a promotion may still fail, | |
| 6237 // the flag will be set again when a young collection is | |
| 6238 // attempted. | |
| 6239 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
|
1888
a7214d79fcf1
6896603: CMS/GCH: collection_attempt_is_safe() ergo should use more recent data
ysr
parents:
1837
diff
changeset
|
6240 gch->clear_incremental_collection_failed(); // Worth retrying as fresh space may have been freed up |
| 0 | 6241 gch->update_full_collections_completed(_collection_count_start); |
| 6242 } | |
| 6243 | |
| 6244 // FIX ME!!! Looks like this belongs in CFLSpace, with | |
| 6245 // CMSGen merely delegating to it. | |
| 6246 void ConcurrentMarkSweepGeneration::setNearLargestChunk() { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6247 double nearLargestPercent = FLSLargestBlockCoalesceProximity; |
| 0 | 6248 HeapWord* minAddr = _cmsSpace->bottom(); |
| 6249 HeapWord* largestAddr = | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
6250 (HeapWord*) _cmsSpace->dictionary()->find_largest_dict(); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6251 if (largestAddr == NULL) { |
| 0 | 6252 // The dictionary appears to be empty. In this case |
| 6253 // try to coalesce at the end of the heap. | |
| 6254 largestAddr = _cmsSpace->end(); | |
| 6255 } | |
| 6256 size_t largestOffset = pointer_delta(largestAddr, minAddr); | |
| 6257 size_t nearLargestOffset = | |
| 6258 (size_t)((double)largestOffset * nearLargestPercent) - MinChunkSize; | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6259 if (PrintFLSStatistics != 0) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6260 gclog_or_tty->print_cr( |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6261 "CMS: Large Block: " PTR_FORMAT ";" |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6262 " Proximity: " PTR_FORMAT " -> " PTR_FORMAT, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6263 largestAddr, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6264 _cmsSpace->nearLargestChunk(), minAddr + nearLargestOffset); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6265 } |
| 0 | 6266 _cmsSpace->set_nearLargestChunk(minAddr + nearLargestOffset); |
| 6267 } | |
| 6268 | |
| 6269 bool ConcurrentMarkSweepGeneration::isNearLargestChunk(HeapWord* addr) { | |
| 6270 return addr >= _cmsSpace->nearLargestChunk(); | |
| 6271 } | |
| 6272 | |
| 6273 FreeChunk* ConcurrentMarkSweepGeneration::find_chunk_at_end() { | |
| 6274 return _cmsSpace->find_chunk_at_end(); | |
| 6275 } | |
| 6276 | |
| 6277 void ConcurrentMarkSweepGeneration::update_gc_stats(int current_level, | |
| 6278 bool full) { | |
| 6279 // The next lower level has been collected. Gather any statistics | |
| 6280 // that are of interest at this point. | |
| 6281 if (!full && (current_level + 1) == level()) { | |
| 6282 // Gather statistics on the young generation collection. | |
| 6283 collector()->stats().record_gc0_end(used()); | |
| 6284 } | |
| 6285 } | |
| 6286 | |
| 6287 CMSAdaptiveSizePolicy* ConcurrentMarkSweepGeneration::size_policy() { | |
| 6288 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 6289 assert(gch->kind() == CollectedHeap::GenCollectedHeap, | |
| 6290 "Wrong type of heap"); | |
| 6291 CMSAdaptiveSizePolicy* sp = (CMSAdaptiveSizePolicy*) | |
| 6292 gch->gen_policy()->size_policy(); | |
| 6293 assert(sp->is_gc_cms_adaptive_size_policy(), | |
| 6294 "Wrong type of size policy"); | |
| 6295 return sp; | |
| 6296 } | |
| 6297 | |
| 6298 void ConcurrentMarkSweepGeneration::rotate_debug_collection_type() { | |
| 6299 if (PrintGCDetails && Verbose) { | |
| 6300 gclog_or_tty->print("Rotate from %d ", _debug_collection_type); | |
| 6301 } | |
| 6302 _debug_collection_type = (CollectionTypes) (_debug_collection_type + 1); | |
| 6303 _debug_collection_type = | |
| 6304 (CollectionTypes) (_debug_collection_type % Unknown_collection_type); | |
| 6305 if (PrintGCDetails && Verbose) { | |
| 6306 gclog_or_tty->print_cr("to %d ", _debug_collection_type); | |
| 6307 } | |
| 6308 } | |
| 6309 | |
| 6310 void CMSCollector::sweepWork(ConcurrentMarkSweepGeneration* gen, | |
| 6311 bool asynch) { | |
| 6312 // We iterate over the space(s) underlying this generation, | |
| 6313 // checking the mark bit map to see if the bits corresponding | |
| 6314 // to specific blocks are marked or not. Blocks that are | |
| 6315 // marked are live and are not swept up. All remaining blocks | |
| 6316 // are swept up, with coalescing on-the-fly as we sweep up | |
| 6317 // contiguous free and/or garbage blocks: | |
| 6318 // We need to ensure that the sweeper synchronizes with allocators | |
| 6319 // and stop-the-world collectors. In particular, the following | |
| 6320 // locks are used: | |
| 6321 // . CMS token: if this is held, a stop the world collection cannot occur | |
| 6322 // . freelistLock: if this is held no allocation can occur from this | |
| 6323 // generation by another thread | |
| 6324 // . bitMapLock: if this is held, no other thread can access or update | |
| 6325 // | |
| 6326 | |
| 6327 // Note that we need to hold the freelistLock if we use | |
| 6328 // block iterate below; else the iterator might go awry if | |
| 6329 // a mutator (or promotion) causes block contents to change | |
| 6330 // (for instance if the allocator divvies up a block). | |
| 6331 // If we hold the free list lock, for all practical purposes | |
| 6332 // young generation GC's can't occur (they'll usually need to | |
| 6333 // promote), so we might as well prevent all young generation | |
| 6334 // GC's while we do a sweeping step. For the same reason, we might | |
| 6335 // as well take the bit map lock for the entire duration | |
| 6336 | |
| 6337 // check that we hold the requisite locks | |
| 6338 assert(have_cms_token(), "Should hold cms token"); | |
| 6339 assert( (asynch && ConcurrentMarkSweepThread::cms_thread_has_cms_token()) | |
| 6340 || (!asynch && ConcurrentMarkSweepThread::vm_thread_has_cms_token()), | |
| 6341 "Should possess CMS token to sweep"); | |
| 6342 assert_lock_strong(gen->freelistLock()); | |
| 6343 assert_lock_strong(bitMapLock()); | |
| 6344 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6345 assert(!_inter_sweep_timer.is_active(), "Was switched off in an outer context"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6346 assert(_intra_sweep_timer.is_active(), "Was switched on in an outer context"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6347 gen->cmsSpace()->beginSweepFLCensus((float)(_inter_sweep_timer.seconds()), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6348 _inter_sweep_estimate.padded_average(), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6349 _intra_sweep_estimate.padded_average()); |
| 0 | 6350 gen->setNearLargestChunk(); |
| 6351 | |
| 6352 { | |
| 6353 SweepClosure sweepClosure(this, gen, &_markBitMap, | |
| 6354 CMSYield && asynch); | |
| 6355 gen->cmsSpace()->blk_iterate_careful(&sweepClosure); | |
| 6356 // We need to free-up/coalesce garbage/blocks from a | |
| 6357 // co-terminal free run. This is done in the SweepClosure | |
| 6358 // destructor; so, do not remove this scope, else the | |
| 6359 // end-of-sweep-census below will be off by a little bit. | |
| 6360 } | |
| 6361 gen->cmsSpace()->sweep_completed(); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
1085
diff
changeset
|
6362 gen->cmsSpace()->endSweepFLCensus(sweep_count()); |
|
94
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
6363 if (should_unload_classes()) { // unloaded classes this cycle, |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
6364 _concurrent_cycles_since_last_unload = 0; // ... reset count |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
6365 } else { // did not unload classes, |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
6366 _concurrent_cycles_since_last_unload++; // ... increment count |
|
0834225a7916
6634032: CMS: Need CMSInitiatingPermOccupancyFraction for perm, divorcing from CMSInitiatingOccupancyFraction
ysr
parents:
9
diff
changeset
|
6367 } |
| 0 | 6368 } |
| 6369 | |
| 6370 // Reset CMS data structures (for now just the marking bit map) | |
| 6371 // preparatory for the next cycle. | |
| 6372 void CMSCollector::reset(bool asynch) { | |
| 6373 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 6374 CMSAdaptiveSizePolicy* sp = size_policy(); | |
| 6375 AdaptiveSizePolicyOutput(sp, gch->total_collections()); | |
| 6376 if (asynch) { | |
| 6377 CMSTokenSyncWithLocks ts(true, bitMapLock()); | |
| 6378 | |
| 6379 // If the state is not "Resetting", the foreground thread | |
| 6380 // has done a collection and the resetting. | |
| 6381 if (_collectorState != Resetting) { | |
| 6382 assert(_collectorState == Idling, "The state should only change" | |
| 6383 " because the foreground collector has finished the collection"); | |
| 6384 return; | |
| 6385 } | |
| 6386 | |
| 6387 // Clear the mark bitmap (no grey objects to start with) | |
| 6388 // for the next cycle. | |
| 6389 TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); | |
| 6390 CMSPhaseAccounting cmspa(this, "reset", !PrintGCDetails); | |
| 6391 | |
| 6392 HeapWord* curAddr = _markBitMap.startWord(); | |
| 6393 while (curAddr < _markBitMap.endWord()) { | |
| 6394 size_t remaining = pointer_delta(_markBitMap.endWord(), curAddr); | |
| 6395 MemRegion chunk(curAddr, MIN2(CMSBitMapYieldQuantum, remaining)); | |
| 6396 _markBitMap.clear_large_range(chunk); | |
| 6397 if (ConcurrentMarkSweepThread::should_yield() && | |
| 6398 !foregroundGCIsActive() && | |
| 6399 CMSYield) { | |
| 6400 assert(ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 6401 "CMS thread should hold CMS token"); | |
| 6402 assert_lock_strong(bitMapLock()); | |
| 6403 bitMapLock()->unlock(); | |
| 6404 ConcurrentMarkSweepThread::desynchronize(true); | |
| 6405 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 6406 stopTimer(); | |
| 6407 if (PrintCMSStatistics != 0) { | |
| 6408 incrementYields(); | |
| 6409 } | |
| 6410 icms_wait(); | |
| 6411 | |
| 6412 // See the comment in coordinator_yield() | |
| 6413 for (unsigned i = 0; i < CMSYieldSleepCount && | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6414 ConcurrentMarkSweepThread::should_yield() && |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6415 !CMSCollector::foregroundGCIsActive(); ++i) { |
| 0 | 6416 os::sleep(Thread::current(), 1, false); |
| 6417 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 6418 } | |
| 6419 | |
| 6420 ConcurrentMarkSweepThread::synchronize(true); | |
| 6421 bitMapLock()->lock_without_safepoint_check(); | |
| 6422 startTimer(); | |
| 6423 } | |
| 6424 curAddr = chunk.end(); | |
| 6425 } | |
|
1387
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
6426 // A successful mostly concurrent collection has been done. |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
6427 // Because only the full (i.e., concurrent mode failure) collections |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
6428 // are being measured for gc overhead limits, clean the "near" flag |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
6429 // and count. |
|
0bfd3fb24150
6858496: Clear all SoftReferences before an out-of-memory due to GC overhead limit.
jmasa
parents:
1289
diff
changeset
|
6430 sp->reset_gc_overhead_limit_count(); |
| 0 | 6431 _collectorState = Idling; |
| 6432 } else { | |
| 6433 // already have the lock | |
| 6434 assert(_collectorState == Resetting, "just checking"); | |
| 6435 assert_lock_strong(bitMapLock()); | |
| 6436 _markBitMap.clear_all(); | |
| 6437 _collectorState = Idling; | |
| 6438 } | |
| 6439 | |
| 6440 // Stop incremental mode after a cycle completes, so that any future cycles | |
| 6441 // are triggered by allocation. | |
| 6442 stop_icms(); | |
| 6443 | |
| 6444 NOT_PRODUCT( | |
| 6445 if (RotateCMSCollectionTypes) { | |
| 6446 _cmsGen->rotate_debug_collection_type(); | |
| 6447 } | |
| 6448 ) | |
| 10405 | 6449 |
| 6450 register_gc_end(); | |
| 0 | 6451 } |
| 6452 | |
|
6064
9d679effd28c
7166894: Add gc cause to GC logging for all collectors
brutisso
parents:
6028
diff
changeset
|
6453 void CMSCollector::do_CMS_operation(CMS_op_type op, GCCause::Cause gc_cause) { |
| 0 | 6454 gclog_or_tty->date_stamp(PrintGC && PrintGCDateStamps); |
| 6455 TraceCPUTime tcpu(PrintGCDetails, true, gclog_or_tty); | |
| 10405 | 6456 GCTraceTime t(GCCauseString("GC", gc_cause), PrintGC, !PrintGCDetails, NULL); |
| 0 | 6457 TraceCollectorStats tcs(counters()); |
| 6458 | |
| 6459 switch (op) { | |
| 6460 case CMS_op_checkpointRootsInitial: { | |
|
2125
7246a374a9f2
6458402: 3 jvmti tests fail with CMS and +ExplicitGCInvokesConcurrent
kamg
parents:
1994
diff
changeset
|
6461 SvcGCMarker sgcm(SvcGCMarker::OTHER); |
| 0 | 6462 checkpointRootsInitial(true); // asynch |
| 6463 if (PrintGC) { | |
| 6464 _cmsGen->printOccupancy("initial-mark"); | |
| 6465 } | |
| 6466 break; | |
| 6467 } | |
| 6468 case CMS_op_checkpointRootsFinal: { | |
|
2125
7246a374a9f2
6458402: 3 jvmti tests fail with CMS and +ExplicitGCInvokesConcurrent
kamg
parents:
1994
diff
changeset
|
6469 SvcGCMarker sgcm(SvcGCMarker::OTHER); |
| 0 | 6470 checkpointRootsFinal(true, // asynch |
| 6471 false, // !clear_all_soft_refs | |
| 6472 false); // !init_mark_was_synchronous | |
| 6473 if (PrintGC) { | |
| 6474 _cmsGen->printOccupancy("remark"); | |
| 6475 } | |
| 6476 break; | |
| 6477 } | |
| 6478 default: | |
| 6479 fatal("No such CMS_op"); | |
| 6480 } | |
| 6481 } | |
| 6482 | |
| 6483 #ifndef PRODUCT | |
| 6484 size_t const CMSCollector::skip_header_HeapWords() { | |
| 6485 return FreeChunk::header_size(); | |
| 6486 } | |
| 6487 | |
| 6488 // Try and collect here conditions that should hold when | |
| 6489 // CMS thread is exiting. The idea is that the foreground GC | |
| 6490 // thread should not be blocked if it wants to terminate | |
| 6491 // the CMS thread and yet continue to run the VM for a while | |
| 6492 // after that. | |
| 6493 void CMSCollector::verify_ok_to_terminate() const { | |
| 6494 assert(Thread::current()->is_ConcurrentGC_thread(), | |
| 6495 "should be called by CMS thread"); | |
| 6496 assert(!_foregroundGCShouldWait, "should be false"); | |
| 6497 // We could check here that all the various low-level locks | |
| 6498 // are not held by the CMS thread, but that is overkill; see | |
| 6499 // also CMSThread::verify_ok_to_terminate() where the CGC_lock | |
| 6500 // is checked. | |
| 6501 } | |
| 6502 #endif | |
| 6503 | |
| 6504 size_t CMSCollector::block_size_using_printezis_bits(HeapWord* addr) const { | |
|
453
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
6505 assert(_markBitMap.isMarked(addr) && _markBitMap.isMarked(addr + 1), |
|
c96030fff130
6684579: SoftReference processing can be made more efficient
ysr
parents:
452
diff
changeset
|
6506 "missing Printezis mark?"); |
| 0 | 6507 HeapWord* nextOneAddr = _markBitMap.getNextMarkedWordAddress(addr + 2); |
| 6508 size_t size = pointer_delta(nextOneAddr + 1, addr); | |
| 6509 assert(size == CompactibleFreeListSpace::adjustObjectSize(size), | |
| 6510 "alignment problem"); | |
| 6511 assert(size >= 3, "Necessary for Printezis marks to work"); | |
| 6512 return size; | |
| 6513 } | |
| 6514 | |
| 6515 // A variant of the above (block_size_using_printezis_bits()) except | |
| 6516 // that we return 0 if the P-bits are not yet set. | |
| 6517 size_t CMSCollector::block_size_if_printezis_bits(HeapWord* addr) const { | |
|
2226
c5a923563727
6912621: iCMS: Error: assert(_markBitMap.isMarked(addr + 1),"Missing Printezis bit?")
ysr
parents:
2177
diff
changeset
|
6518 if (_markBitMap.isMarked(addr + 1)) { |
|
c5a923563727
6912621: iCMS: Error: assert(_markBitMap.isMarked(addr + 1),"Missing Printezis bit?")
ysr
parents:
2177
diff
changeset
|
6519 assert(_markBitMap.isMarked(addr), "P-bit can be set only for marked objects"); |
| 0 | 6520 HeapWord* nextOneAddr = _markBitMap.getNextMarkedWordAddress(addr + 2); |
| 6521 size_t size = pointer_delta(nextOneAddr + 1, addr); | |
| 6522 assert(size == CompactibleFreeListSpace::adjustObjectSize(size), | |
| 6523 "alignment problem"); | |
| 6524 assert(size >= 3, "Necessary for Printezis marks to work"); | |
| 6525 return size; | |
|
2226
c5a923563727
6912621: iCMS: Error: assert(_markBitMap.isMarked(addr + 1),"Missing Printezis bit?")
ysr
parents:
2177
diff
changeset
|
6526 } |
|
c5a923563727
6912621: iCMS: Error: assert(_markBitMap.isMarked(addr + 1),"Missing Printezis bit?")
ysr
parents:
2177
diff
changeset
|
6527 return 0; |
| 0 | 6528 } |
| 6529 | |
| 6530 HeapWord* CMSCollector::next_card_start_after_block(HeapWord* addr) const { | |
| 6531 size_t sz = 0; | |
| 6532 oop p = (oop)addr; | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6533 if (p->klass_or_null() != NULL) { |
| 0 | 6534 sz = CompactibleFreeListSpace::adjustObjectSize(p->size()); |
| 6535 } else { | |
| 6536 sz = block_size_using_printezis_bits(addr); | |
| 6537 } | |
| 6538 assert(sz > 0, "size must be nonzero"); | |
| 6539 HeapWord* next_block = addr + sz; | |
| 6540 HeapWord* next_card = (HeapWord*)round_to((uintptr_t)next_block, | |
| 6541 CardTableModRefBS::card_size); | |
| 6542 assert(round_down((uintptr_t)addr, CardTableModRefBS::card_size) < | |
| 6543 round_down((uintptr_t)next_card, CardTableModRefBS::card_size), | |
| 6544 "must be different cards"); | |
| 6545 return next_card; | |
| 6546 } | |
| 6547 | |
| 6548 | |
| 6549 // CMS Bit Map Wrapper ///////////////////////////////////////// | |
| 6550 | |
| 6551 // Construct a CMS bit map infrastructure, but don't create the | |
| 6552 // bit vector itself. That is done by a separate call CMSBitMap::allocate() | |
| 6553 // further below. | |
| 6554 CMSBitMap::CMSBitMap(int shifter, int mutex_rank, const char* mutex_name): | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
6555 _bm(), |
| 0 | 6556 _shifter(shifter), |
| 6557 _lock(mutex_rank >= 0 ? new Mutex(mutex_rank, mutex_name, true) : NULL) | |
| 6558 { | |
| 6559 _bmStartWord = 0; | |
| 6560 _bmWordSize = 0; | |
| 6561 } | |
| 6562 | |
| 6563 bool CMSBitMap::allocate(MemRegion mr) { | |
| 6564 _bmStartWord = mr.start(); | |
| 6565 _bmWordSize = mr.word_size(); | |
| 6566 ReservedSpace brs(ReservedSpace::allocation_align_size_up( | |
| 6567 (_bmWordSize >> (_shifter + LogBitsPerByte)) + 1)); | |
| 6568 if (!brs.is_reserved()) { | |
| 6569 warning("CMS bit map allocation failure"); | |
| 6570 return false; | |
| 6571 } | |
| 6572 // For now we'll just commit all of the bit map up fromt. | |
| 6573 // Later on we'll try to be more parsimonious with swap. | |
| 6574 if (!_virtual_space.initialize(brs, brs.size())) { | |
| 6575 warning("CMS bit map backing store failure"); | |
| 6576 return false; | |
| 6577 } | |
| 6578 assert(_virtual_space.committed_size() == brs.size(), | |
| 6579 "didn't reserve backing store for all of CMS bit map?"); | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
6580 _bm.set_map((BitMap::bm_word_t*)_virtual_space.low()); |
| 0 | 6581 assert(_virtual_space.committed_size() << (_shifter + LogBitsPerByte) >= |
| 6582 _bmWordSize, "inconsistency in bit map sizing"); | |
| 6583 _bm.set_size(_bmWordSize >> _shifter); | |
| 6584 | |
| 6585 // bm.clear(); // can we rely on getting zero'd memory? verify below | |
| 6586 assert(isAllClear(), | |
| 6587 "Expected zero'd memory from ReservedSpace constructor"); | |
| 6588 assert(_bm.size() == heapWordDiffToOffsetDiff(sizeInWords()), | |
| 6589 "consistency check"); | |
| 6590 return true; | |
| 6591 } | |
| 6592 | |
| 6593 void CMSBitMap::dirty_range_iterate_clear(MemRegion mr, MemRegionClosure* cl) { | |
| 6594 HeapWord *next_addr, *end_addr, *last_addr; | |
| 6595 assert_locked(); | |
| 6596 assert(covers(mr), "out-of-range error"); | |
| 6597 // XXX assert that start and end are appropriately aligned | |
| 6598 for (next_addr = mr.start(), end_addr = mr.end(); | |
| 6599 next_addr < end_addr; next_addr = last_addr) { | |
| 6600 MemRegion dirty_region = getAndClearMarkedRegion(next_addr, end_addr); | |
| 6601 last_addr = dirty_region.end(); | |
| 6602 if (!dirty_region.is_empty()) { | |
| 6603 cl->do_MemRegion(dirty_region); | |
| 6604 } else { | |
| 6605 assert(last_addr == end_addr, "program logic"); | |
| 6606 return; | |
| 6607 } | |
| 6608 } | |
| 6609 } | |
| 6610 | |
|
9076
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
6611 void CMSBitMap::print_on_error(outputStream* st, const char* prefix) const { |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
6612 _bm.print_on_error(st, prefix); |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
6613 } |
|
7b835924c31c
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
9072
diff
changeset
|
6614 |
| 0 | 6615 #ifndef PRODUCT |
| 6616 void CMSBitMap::assert_locked() const { | |
| 6617 CMSLockVerifier::assert_locked(lock()); | |
| 6618 } | |
| 6619 | |
| 6620 bool CMSBitMap::covers(MemRegion mr) const { | |
| 6621 // assert(_bm.map() == _virtual_space.low(), "map inconsistency"); | |
| 6622 assert((size_t)_bm.size() == (_bmWordSize >> _shifter), | |
| 6623 "size inconsistency"); | |
| 6624 return (mr.start() >= _bmStartWord) && | |
| 6625 (mr.end() <= endWord()); | |
| 6626 } | |
| 6627 | |
| 6628 bool CMSBitMap::covers(HeapWord* start, size_t size) const { | |
| 6629 return (start >= _bmStartWord && (start + size) <= endWord()); | |
| 6630 } | |
| 6631 | |
| 6632 void CMSBitMap::verifyNoOneBitsInRange(HeapWord* left, HeapWord* right) { | |
| 6633 // verify that there are no 1 bits in the interval [left, right) | |
| 6634 FalseBitMapClosure falseBitMapClosure; | |
| 6635 iterate(&falseBitMapClosure, left, right); | |
| 6636 } | |
| 6637 | |
| 6638 void CMSBitMap::region_invariant(MemRegion mr) | |
| 6639 { | |
| 6640 assert_locked(); | |
| 6641 // mr = mr.intersection(MemRegion(_bmStartWord, _bmWordSize)); | |
| 6642 assert(!mr.is_empty(), "unexpected empty region"); | |
| 6643 assert(covers(mr), "mr should be covered by bit map"); | |
| 6644 // convert address range into offset range | |
| 6645 size_t start_ofs = heapWordToOffset(mr.start()); | |
| 6646 // Make sure that end() is appropriately aligned | |
| 6647 assert(mr.end() == (HeapWord*)round_to((intptr_t)mr.end(), | |
| 6648 (1 << (_shifter+LogHeapWordSize))), | |
| 6649 "Misaligned mr.end()"); | |
| 6650 size_t end_ofs = heapWordToOffset(mr.end()); | |
| 6651 assert(end_ofs > start_ofs, "Should mark at least one bit"); | |
| 6652 } | |
| 6653 | |
| 6654 #endif | |
| 6655 | |
| 6656 bool CMSMarkStack::allocate(size_t size) { | |
| 6657 // allocate a stack of the requisite depth | |
| 6658 ReservedSpace rs(ReservedSpace::allocation_align_size_up( | |
| 6659 size * sizeof(oop))); | |
| 6660 if (!rs.is_reserved()) { | |
| 6661 warning("CMSMarkStack allocation failure"); | |
| 6662 return false; | |
| 6663 } | |
| 6664 if (!_virtual_space.initialize(rs, rs.size())) { | |
| 6665 warning("CMSMarkStack backing store failure"); | |
| 6666 return false; | |
| 6667 } | |
| 6668 assert(_virtual_space.committed_size() == rs.size(), | |
| 6669 "didn't reserve backing store for all of CMS stack?"); | |
| 6670 _base = (oop*)(_virtual_space.low()); | |
| 6671 _index = 0; | |
| 6672 _capacity = size; | |
| 6673 NOT_PRODUCT(_max_depth = 0); | |
| 6674 return true; | |
| 6675 } | |
| 6676 | |
| 6677 // XXX FIX ME !!! In the MT case we come in here holding a | |
| 6678 // leaf lock. For printing we need to take a further lock | |
| 6679 // which has lower rank. We need to recallibrate the two | |
| 6680 // lock-ranks involved in order to be able to rpint the | |
| 6681 // messages below. (Or defer the printing to the caller. | |
| 6682 // For now we take the expedient path of just disabling the | |
| 6683 // messages for the problematic case.) | |
| 6684 void CMSMarkStack::expand() { | |
| 1284 | 6685 assert(_capacity <= MarkStackSizeMax, "stack bigger than permitted"); |
| 6686 if (_capacity == MarkStackSizeMax) { | |
| 0 | 6687 if (_hit_limit++ == 0 && !CMSConcurrentMTEnabled && PrintGCDetails) { |
| 6688 // We print a warning message only once per CMS cycle. | |
| 6689 gclog_or_tty->print_cr(" (benign) Hit CMSMarkStack max size limit"); | |
| 6690 } | |
| 6691 return; | |
| 6692 } | |
| 6693 // Double capacity if possible | |
| 1284 | 6694 size_t new_capacity = MIN2(_capacity*2, MarkStackSizeMax); |
| 0 | 6695 // Do not give up existing stack until we have managed to |
| 6696 // get the double capacity that we desired. | |
| 6697 ReservedSpace rs(ReservedSpace::allocation_align_size_up( | |
| 6698 new_capacity * sizeof(oop))); | |
| 6699 if (rs.is_reserved()) { | |
| 6700 // Release the backing store associated with old stack | |
| 6701 _virtual_space.release(); | |
| 6702 // Reinitialize virtual space for new stack | |
| 6703 if (!_virtual_space.initialize(rs, rs.size())) { | |
| 6704 fatal("Not enough swap for expanded marking stack"); | |
| 6705 } | |
| 6706 _base = (oop*)(_virtual_space.low()); | |
| 6707 _index = 0; | |
| 6708 _capacity = new_capacity; | |
| 6709 } else if (_failed_double++ == 0 && !CMSConcurrentMTEnabled && PrintGCDetails) { | |
| 6710 // Failed to double capacity, continue; | |
| 6711 // we print a detail message only once per CMS cycle. | |
| 6712 gclog_or_tty->print(" (benign) Failed to expand marking stack from "SIZE_FORMAT"K to " | |
| 6713 SIZE_FORMAT"K", | |
| 6714 _capacity / K, new_capacity / K); | |
| 6715 } | |
| 6716 } | |
| 6717 | |
| 6718 | |
| 6719 // Closures | |
| 6720 // XXX: there seems to be a lot of code duplication here; | |
| 6721 // should refactor and consolidate common code. | |
| 6722 | |
| 6723 // This closure is used to mark refs into the CMS generation in | |
| 6724 // the CMS bit map. Called at the first checkpoint. This closure | |
| 6725 // assumes that we do not need to re-mark dirty cards; if the CMS | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6726 // generation on which this is used is not an oldest |
| 0 | 6727 // generation then this will lose younger_gen cards! |
| 6728 | |
| 6729 MarkRefsIntoClosure::MarkRefsIntoClosure( | |
|
994
753cf9794df9
6885169: merge of 4957990 and 6863023 causes conflict on do_nmethods
jrose
parents:
993
diff
changeset
|
6730 MemRegion span, CMSBitMap* bitMap): |
| 0 | 6731 _span(span), |
|
994
753cf9794df9
6885169: merge of 4957990 and 6863023 causes conflict on do_nmethods
jrose
parents:
993
diff
changeset
|
6732 _bitMap(bitMap) |
| 0 | 6733 { |
| 6734 assert(_ref_processor == NULL, "deliberately left NULL"); | |
| 6735 assert(_bitMap->covers(_span), "_bitMap/_span mismatch"); | |
| 6736 } | |
| 6737 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6738 void MarkRefsIntoClosure::do_oop(oop obj) { |
| 0 | 6739 // if p points into _span, then mark corresponding bit in _markBitMap |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6740 assert(obj->is_oop(), "expected an oop"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6741 HeapWord* addr = (HeapWord*)obj; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6742 if (_span.contains(addr)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6743 // this should be made more efficient |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6744 _bitMap->mark(addr); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6745 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6746 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6747 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6748 void MarkRefsIntoClosure::do_oop(oop* p) { MarkRefsIntoClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6749 void MarkRefsIntoClosure::do_oop(narrowOop* p) { MarkRefsIntoClosure::do_oop_work(p); } |
| 0 | 6750 |
| 6751 // A variant of the above, used for CMS marking verification. | |
| 6752 MarkRefsIntoVerifyClosure::MarkRefsIntoVerifyClosure( | |
|
994
753cf9794df9
6885169: merge of 4957990 and 6863023 causes conflict on do_nmethods
jrose
parents:
993
diff
changeset
|
6753 MemRegion span, CMSBitMap* verification_bm, CMSBitMap* cms_bm): |
| 0 | 6754 _span(span), |
| 6755 _verification_bm(verification_bm), | |
|
994
753cf9794df9
6885169: merge of 4957990 and 6863023 causes conflict on do_nmethods
jrose
parents:
993
diff
changeset
|
6756 _cms_bm(cms_bm) |
|
753cf9794df9
6885169: merge of 4957990 and 6863023 causes conflict on do_nmethods
jrose
parents:
993
diff
changeset
|
6757 { |
| 0 | 6758 assert(_ref_processor == NULL, "deliberately left NULL"); |
| 6759 assert(_verification_bm->covers(_span), "_verification_bm/_span mismatch"); | |
| 6760 } | |
| 6761 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6762 void MarkRefsIntoVerifyClosure::do_oop(oop obj) { |
| 0 | 6763 // if p points into _span, then mark corresponding bit in _markBitMap |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6764 assert(obj->is_oop(), "expected an oop"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6765 HeapWord* addr = (HeapWord*)obj; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6766 if (_span.contains(addr)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6767 _verification_bm->mark(addr); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6768 if (!_cms_bm->isMarked(addr)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6769 oop(addr)->print(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6770 gclog_or_tty->print_cr(" (" INTPTR_FORMAT " should have been marked)", addr); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6771 fatal("... aborting"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6772 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6773 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6774 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6775 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6776 void MarkRefsIntoVerifyClosure::do_oop(oop* p) { MarkRefsIntoVerifyClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6777 void MarkRefsIntoVerifyClosure::do_oop(narrowOop* p) { MarkRefsIntoVerifyClosure::do_oop_work(p); } |
| 0 | 6778 |
| 6779 ////////////////////////////////////////////////// | |
| 6780 // MarkRefsIntoAndScanClosure | |
| 6781 ////////////////////////////////////////////////// | |
| 6782 | |
| 6783 MarkRefsIntoAndScanClosure::MarkRefsIntoAndScanClosure(MemRegion span, | |
| 6784 ReferenceProcessor* rp, | |
| 6785 CMSBitMap* bit_map, | |
| 6786 CMSBitMap* mod_union_table, | |
| 6787 CMSMarkStack* mark_stack, | |
| 6788 CMSCollector* collector, | |
| 6789 bool should_yield, | |
| 6790 bool concurrent_precleaning): | |
| 6791 _collector(collector), | |
| 6792 _span(span), | |
| 6793 _bit_map(bit_map), | |
| 6794 _mark_stack(mark_stack), | |
| 6795 _pushAndMarkClosure(collector, span, rp, bit_map, mod_union_table, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6796 mark_stack, concurrent_precleaning), |
| 0 | 6797 _yield(should_yield), |
| 6798 _concurrent_precleaning(concurrent_precleaning), | |
| 6799 _freelistLock(NULL) | |
| 6800 { | |
| 6801 _ref_processor = rp; | |
| 6802 assert(_ref_processor != NULL, "_ref_processor shouldn't be NULL"); | |
| 6803 } | |
| 6804 | |
| 6805 // This closure is used to mark refs into the CMS generation at the | |
| 6806 // second (final) checkpoint, and to scan and transitively follow | |
| 6807 // the unmarked oops. It is also used during the concurrent precleaning | |
| 6808 // phase while scanning objects on dirty cards in the CMS generation. | |
| 6809 // The marks are made in the marking bit map and the marking stack is | |
| 6810 // used for keeping the (newly) grey objects during the scan. | |
| 6811 // The parallel version (Par_...) appears further below. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6812 void MarkRefsIntoAndScanClosure::do_oop(oop obj) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6813 if (obj != NULL) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6814 assert(obj->is_oop(), "expected an oop"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6815 HeapWord* addr = (HeapWord*)obj; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6816 assert(_mark_stack->isEmpty(), "pre-condition (eager drainage)"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6817 assert(_collector->overflow_list_is_empty(), |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6818 "overflow list should be empty"); |
| 0 | 6819 if (_span.contains(addr) && |
| 6820 !_bit_map->isMarked(addr)) { | |
| 6821 // mark bit map (object is now grey) | |
| 6822 _bit_map->mark(addr); | |
| 6823 // push on marking stack (stack should be empty), and drain the | |
| 6824 // stack by applying this closure to the oops in the oops popped | |
| 6825 // from the stack (i.e. blacken the grey objects) | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6826 bool res = _mark_stack->push(obj); |
| 0 | 6827 assert(res, "Should have space to push on empty stack"); |
| 6828 do { | |
| 6829 oop new_oop = _mark_stack->pop(); | |
| 6830 assert(new_oop != NULL && new_oop->is_oop(), "Expected an oop"); | |
| 6831 assert(_bit_map->isMarked((HeapWord*)new_oop), | |
| 6832 "only grey objects on this stack"); | |
| 6833 // iterate over the oops in this oop, marking and pushing | |
| 6834 // the ones in CMS heap (i.e. in _span). | |
| 6835 new_oop->oop_iterate(&_pushAndMarkClosure); | |
| 6836 // check if it's time to yield | |
| 6837 do_yield_check(); | |
| 6838 } while (!_mark_stack->isEmpty() || | |
| 6839 (!_concurrent_precleaning && take_from_overflow_list())); | |
| 6840 // if marking stack is empty, and we are not doing this | |
| 6841 // during precleaning, then check the overflow list | |
| 6842 } | |
| 6843 assert(_mark_stack->isEmpty(), "post-condition (eager drainage)"); | |
| 6844 assert(_collector->overflow_list_is_empty(), | |
| 6845 "overflow list was drained above"); | |
| 6846 // We could restore evacuated mark words, if any, used for | |
| 6847 // overflow list links here because the overflow list is | |
| 6848 // provably empty here. That would reduce the maximum | |
| 6849 // size requirements for preserved_{oop,mark}_stack. | |
| 6850 // But we'll just postpone it until we are all done | |
| 6851 // so we can just stream through. | |
| 6852 if (!_concurrent_precleaning && CMSOverflowEarlyRestoration) { | |
| 6853 _collector->restore_preserved_marks_if_any(); | |
| 6854 assert(_collector->no_preserved_marks(), "No preserved marks"); | |
| 6855 } | |
| 6856 assert(!CMSOverflowEarlyRestoration || _collector->no_preserved_marks(), | |
| 6857 "All preserved marks should have been restored above"); | |
| 6858 } | |
| 6859 } | |
| 6860 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6861 void MarkRefsIntoAndScanClosure::do_oop(oop* p) { MarkRefsIntoAndScanClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6862 void MarkRefsIntoAndScanClosure::do_oop(narrowOop* p) { MarkRefsIntoAndScanClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6863 |
| 0 | 6864 void MarkRefsIntoAndScanClosure::do_yield_work() { |
| 6865 assert(ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 6866 "CMS thread should hold CMS token"); | |
| 6867 assert_lock_strong(_freelistLock); | |
| 6868 assert_lock_strong(_bit_map->lock()); | |
| 6869 // relinquish the free_list_lock and bitMaplock() | |
| 6870 _bit_map->lock()->unlock(); | |
| 6871 _freelistLock->unlock(); | |
| 6872 ConcurrentMarkSweepThread::desynchronize(true); | |
| 6873 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 6874 _collector->stopTimer(); | |
| 6875 GCPauseTimer p(_collector->size_policy()->concurrent_timer_ptr()); | |
| 6876 if (PrintCMSStatistics != 0) { | |
| 6877 _collector->incrementYields(); | |
| 6878 } | |
| 6879 _collector->icms_wait(); | |
| 6880 | |
| 6881 // See the comment in coordinator_yield() | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6882 for (unsigned i = 0; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6883 i < CMSYieldSleepCount && |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6884 ConcurrentMarkSweepThread::should_yield() && |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6885 !CMSCollector::foregroundGCIsActive(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6886 ++i) { |
| 0 | 6887 os::sleep(Thread::current(), 1, false); |
| 6888 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 6889 } | |
| 6890 | |
| 6891 ConcurrentMarkSweepThread::synchronize(true); | |
| 6892 _freelistLock->lock_without_safepoint_check(); | |
| 6893 _bit_map->lock()->lock_without_safepoint_check(); | |
| 6894 _collector->startTimer(); | |
| 6895 } | |
| 6896 | |
| 6897 /////////////////////////////////////////////////////////// | |
| 6898 // Par_MarkRefsIntoAndScanClosure: a parallel version of | |
| 6899 // MarkRefsIntoAndScanClosure | |
| 6900 /////////////////////////////////////////////////////////// | |
| 6901 Par_MarkRefsIntoAndScanClosure::Par_MarkRefsIntoAndScanClosure( | |
| 6902 CMSCollector* collector, MemRegion span, ReferenceProcessor* rp, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6903 CMSBitMap* bit_map, OopTaskQueue* work_queue): |
| 0 | 6904 _span(span), |
| 6905 _bit_map(bit_map), | |
| 6906 _work_queue(work_queue), | |
| 6907 _low_water_mark(MIN2((uint)(work_queue->max_elems()/4), | |
| 6908 (uint)(CMSWorkQueueDrainThreshold * ParallelGCThreads))), | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
6909 _par_pushAndMarkClosure(collector, span, rp, bit_map, work_queue) |
| 0 | 6910 { |
| 6911 _ref_processor = rp; | |
| 6912 assert(_ref_processor != NULL, "_ref_processor shouldn't be NULL"); | |
| 6913 } | |
| 6914 | |
| 6915 // This closure is used to mark refs into the CMS generation at the | |
| 6916 // second (final) checkpoint, and to scan and transitively follow | |
| 6917 // the unmarked oops. The marks are made in the marking bit map and | |
| 6918 // the work_queue is used for keeping the (newly) grey objects during | |
| 6919 // the scan phase whence they are also available for stealing by parallel | |
| 6920 // threads. Since the marking bit map is shared, updates are | |
| 6921 // synchronized (via CAS). | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6922 void Par_MarkRefsIntoAndScanClosure::do_oop(oop obj) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6923 if (obj != NULL) { |
| 0 | 6924 // Ignore mark word because this could be an already marked oop |
| 6925 // that may be chained at the end of the overflow list. | |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
6926 assert(obj->is_oop(true), "expected an oop"); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6927 HeapWord* addr = (HeapWord*)obj; |
| 0 | 6928 if (_span.contains(addr) && |
| 6929 !_bit_map->isMarked(addr)) { | |
| 6930 // mark bit map (object will become grey): | |
| 6931 // It is possible for several threads to be | |
| 6932 // trying to "claim" this object concurrently; | |
| 6933 // the unique thread that succeeds in marking the | |
| 6934 // object first will do the subsequent push on | |
| 6935 // to the work queue (or overflow list). | |
| 6936 if (_bit_map->par_mark(addr)) { | |
| 6937 // push on work_queue (which may not be empty), and trim the | |
| 6938 // queue to an appropriate length by applying this closure to | |
| 6939 // the oops in the oops popped from the stack (i.e. blacken the | |
| 6940 // grey objects) | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6941 bool res = _work_queue->push(obj); |
| 0 | 6942 assert(res, "Low water mark should be less than capacity?"); |
| 6943 trim_queue(_low_water_mark); | |
| 6944 } // Else, another thread claimed the object | |
| 6945 } | |
| 6946 } | |
| 6947 } | |
| 6948 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6949 void Par_MarkRefsIntoAndScanClosure::do_oop(oop* p) { Par_MarkRefsIntoAndScanClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6950 void Par_MarkRefsIntoAndScanClosure::do_oop(narrowOop* p) { Par_MarkRefsIntoAndScanClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
6951 |
| 0 | 6952 // This closure is used to rescan the marked objects on the dirty cards |
| 6953 // in the mod union table and the card table proper. | |
| 6954 size_t ScanMarkedObjectsAgainCarefullyClosure::do_object_careful_m( | |
| 6955 oop p, MemRegion mr) { | |
| 6956 | |
| 6957 size_t size = 0; | |
| 6958 HeapWord* addr = (HeapWord*)p; | |
| 6959 DEBUG_ONLY(_collector->verify_work_stacks_empty();) | |
| 6960 assert(_span.contains(addr), "we are scanning the CMS generation"); | |
| 6961 // check if it's time to yield | |
| 6962 if (do_yield_check()) { | |
| 6963 // We yielded for some foreground stop-world work, | |
| 6964 // and we have been asked to abort this ongoing preclean cycle. | |
| 6965 return 0; | |
| 6966 } | |
| 6967 if (_bitMap->isMarked(addr)) { | |
| 6968 // it's marked; is it potentially uninitialized? | |
| 187 | 6969 if (p->klass_or_null() != NULL) { |
| 0 | 6970 // an initialized object; ignore mark word in verification below |
| 6971 // since we are running concurrent with mutators | |
| 6972 assert(p->is_oop(true), "should be an oop"); | |
| 6973 if (p->is_objArray()) { | |
| 6974 // objArrays are precisely marked; restrict scanning | |
| 6975 // to dirty cards only. | |
| 187 | 6976 size = CompactibleFreeListSpace::adjustObjectSize( |
| 6977 p->oop_iterate(_scanningClosure, mr)); | |
| 0 | 6978 } else { |
| 6979 // A non-array may have been imprecisely marked; we need | |
| 6980 // to scan object in its entirety. | |
| 6981 size = CompactibleFreeListSpace::adjustObjectSize( | |
| 6982 p->oop_iterate(_scanningClosure)); | |
| 6983 } | |
| 9152 | 6984 #ifdef ASSERT |
| 0 | 6985 size_t direct_size = |
| 6986 CompactibleFreeListSpace::adjustObjectSize(p->size()); | |
| 6987 assert(size == direct_size, "Inconsistency in size"); | |
| 6988 assert(size >= 3, "Necessary for Printezis marks to work"); | |
| 6989 if (!_bitMap->isMarked(addr+1)) { | |
| 6990 _bitMap->verifyNoOneBitsInRange(addr+2, addr+size); | |
| 6991 } else { | |
| 6992 _bitMap->verifyNoOneBitsInRange(addr+2, addr+size-1); | |
| 6993 assert(_bitMap->isMarked(addr+size-1), | |
| 6994 "inconsistent Printezis mark"); | |
| 6995 } | |
| 9152 | 6996 #endif // ASSERT |
| 0 | 6997 } else { |
| 6998 // an unitialized object | |
| 6999 assert(_bitMap->isMarked(addr+1), "missing Printezis mark?"); | |
| 7000 HeapWord* nextOneAddr = _bitMap->getNextMarkedWordAddress(addr + 2); | |
| 7001 size = pointer_delta(nextOneAddr + 1, addr); | |
| 7002 assert(size == CompactibleFreeListSpace::adjustObjectSize(size), | |
| 7003 "alignment problem"); | |
| 7004 // Note that pre-cleaning needn't redirty the card. OopDesc::set_klass() | |
| 7005 // will dirty the card when the klass pointer is installed in the | |
| 7006 // object (signalling the completion of initialization). | |
| 7007 } | |
| 7008 } else { | |
| 7009 // Either a not yet marked object or an uninitialized object | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7010 if (p->klass_or_null() == NULL) { |
| 0 | 7011 // An uninitialized object, skip to the next card, since |
| 7012 // we may not be able to read its P-bits yet. | |
| 7013 assert(size == 0, "Initial value"); | |
| 7014 } else { | |
| 7015 // An object not (yet) reached by marking: we merely need to | |
| 7016 // compute its size so as to go look at the next block. | |
| 7017 assert(p->is_oop(true), "should be an oop"); | |
| 7018 size = CompactibleFreeListSpace::adjustObjectSize(p->size()); | |
| 7019 } | |
| 7020 } | |
| 7021 DEBUG_ONLY(_collector->verify_work_stacks_empty();) | |
| 7022 return size; | |
| 7023 } | |
| 7024 | |
| 7025 void ScanMarkedObjectsAgainCarefullyClosure::do_yield_work() { | |
| 7026 assert(ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 7027 "CMS thread should hold CMS token"); | |
| 7028 assert_lock_strong(_freelistLock); | |
| 7029 assert_lock_strong(_bitMap->lock()); | |
| 7030 // relinquish the free_list_lock and bitMaplock() | |
| 7031 _bitMap->lock()->unlock(); | |
| 7032 _freelistLock->unlock(); | |
| 7033 ConcurrentMarkSweepThread::desynchronize(true); | |
| 7034 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 7035 _collector->stopTimer(); | |
| 7036 GCPauseTimer p(_collector->size_policy()->concurrent_timer_ptr()); | |
| 7037 if (PrintCMSStatistics != 0) { | |
| 7038 _collector->incrementYields(); | |
| 7039 } | |
| 7040 _collector->icms_wait(); | |
| 7041 | |
| 7042 // See the comment in coordinator_yield() | |
| 7043 for (unsigned i = 0; i < CMSYieldSleepCount && | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7044 ConcurrentMarkSweepThread::should_yield() && |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7045 !CMSCollector::foregroundGCIsActive(); ++i) { |
| 0 | 7046 os::sleep(Thread::current(), 1, false); |
| 7047 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 7048 } | |
| 7049 | |
| 7050 ConcurrentMarkSweepThread::synchronize(true); | |
| 7051 _freelistLock->lock_without_safepoint_check(); | |
| 7052 _bitMap->lock()->lock_without_safepoint_check(); | |
| 7053 _collector->startTimer(); | |
| 7054 } | |
| 7055 | |
| 7056 | |
| 7057 ////////////////////////////////////////////////////////////////// | |
| 7058 // SurvivorSpacePrecleanClosure | |
| 7059 ////////////////////////////////////////////////////////////////// | |
| 7060 // This (single-threaded) closure is used to preclean the oops in | |
| 7061 // the survivor spaces. | |
| 7062 size_t SurvivorSpacePrecleanClosure::do_object_careful(oop p) { | |
| 7063 | |
| 7064 HeapWord* addr = (HeapWord*)p; | |
| 7065 DEBUG_ONLY(_collector->verify_work_stacks_empty();) | |
| 7066 assert(!_span.contains(addr), "we are scanning the survivor spaces"); | |
| 187 | 7067 assert(p->klass_or_null() != NULL, "object should be initializd"); |
| 0 | 7068 // an initialized object; ignore mark word in verification below |
| 7069 // since we are running concurrent with mutators | |
| 7070 assert(p->is_oop(true), "should be an oop"); | |
| 7071 // Note that we do not yield while we iterate over | |
| 7072 // the interior oops of p, pushing the relevant ones | |
| 7073 // on our marking stack. | |
| 7074 size_t size = p->oop_iterate(_scanning_closure); | |
| 7075 do_yield_check(); | |
| 7076 // Observe that below, we do not abandon the preclean | |
| 7077 // phase as soon as we should; rather we empty the | |
| 7078 // marking stack before returning. This is to satisfy | |
| 7079 // some existing assertions. In general, it may be a | |
| 7080 // good idea to abort immediately and complete the marking | |
| 7081 // from the grey objects at a later time. | |
| 7082 while (!_mark_stack->isEmpty()) { | |
| 7083 oop new_oop = _mark_stack->pop(); | |
| 7084 assert(new_oop != NULL && new_oop->is_oop(), "Expected an oop"); | |
| 7085 assert(_bit_map->isMarked((HeapWord*)new_oop), | |
| 7086 "only grey objects on this stack"); | |
| 7087 // iterate over the oops in this oop, marking and pushing | |
| 7088 // the ones in CMS heap (i.e. in _span). | |
| 7089 new_oop->oop_iterate(_scanning_closure); | |
| 7090 // check if it's time to yield | |
| 7091 do_yield_check(); | |
| 7092 } | |
| 7093 unsigned int after_count = | |
| 7094 GenCollectedHeap::heap()->total_collections(); | |
| 7095 bool abort = (_before_count != after_count) || | |
| 7096 _collector->should_abort_preclean(); | |
| 7097 return abort ? 0 : size; | |
| 7098 } | |
| 7099 | |
| 7100 void SurvivorSpacePrecleanClosure::do_yield_work() { | |
| 7101 assert(ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 7102 "CMS thread should hold CMS token"); | |
| 7103 assert_lock_strong(_bit_map->lock()); | |
| 7104 // Relinquish the bit map lock | |
| 7105 _bit_map->lock()->unlock(); | |
| 7106 ConcurrentMarkSweepThread::desynchronize(true); | |
| 7107 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 7108 _collector->stopTimer(); | |
| 7109 GCPauseTimer p(_collector->size_policy()->concurrent_timer_ptr()); | |
| 7110 if (PrintCMSStatistics != 0) { | |
| 7111 _collector->incrementYields(); | |
| 7112 } | |
| 7113 _collector->icms_wait(); | |
| 7114 | |
| 7115 // See the comment in coordinator_yield() | |
| 7116 for (unsigned i = 0; i < CMSYieldSleepCount && | |
| 7117 ConcurrentMarkSweepThread::should_yield() && | |
| 7118 !CMSCollector::foregroundGCIsActive(); ++i) { | |
| 7119 os::sleep(Thread::current(), 1, false); | |
| 7120 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 7121 } | |
| 7122 | |
| 7123 ConcurrentMarkSweepThread::synchronize(true); | |
| 7124 _bit_map->lock()->lock_without_safepoint_check(); | |
| 7125 _collector->startTimer(); | |
| 7126 } | |
| 7127 | |
| 7128 // This closure is used to rescan the marked objects on the dirty cards | |
| 7129 // in the mod union table and the card table proper. In the parallel | |
| 7130 // case, although the bitMap is shared, we do a single read so the | |
| 7131 // isMarked() query is "safe". | |
| 7132 bool ScanMarkedObjectsAgainClosure::do_object_bm(oop p, MemRegion mr) { | |
| 7133 // Ignore mark word because we are running concurrent with mutators | |
| 7134 assert(p->is_oop_or_null(true), "expected an oop or null"); | |
| 7135 HeapWord* addr = (HeapWord*)p; | |
| 7136 assert(_span.contains(addr), "we are scanning the CMS generation"); | |
| 7137 bool is_obj_array = false; | |
| 9152 | 7138 #ifdef ASSERT |
| 0 | 7139 if (!_parallel) { |
| 7140 assert(_mark_stack->isEmpty(), "pre-condition (eager drainage)"); | |
| 7141 assert(_collector->overflow_list_is_empty(), | |
| 7142 "overflow list should be empty"); | |
| 7143 | |
| 7144 } | |
| 9152 | 7145 #endif // ASSERT |
| 0 | 7146 if (_bit_map->isMarked(addr)) { |
| 7147 // Obj arrays are precisely marked, non-arrays are not; | |
| 7148 // so we scan objArrays precisely and non-arrays in their | |
| 7149 // entirety. | |
| 7150 if (p->is_objArray()) { | |
| 7151 is_obj_array = true; | |
| 7152 if (_parallel) { | |
| 7153 p->oop_iterate(_par_scan_closure, mr); | |
| 7154 } else { | |
| 7155 p->oop_iterate(_scan_closure, mr); | |
| 7156 } | |
| 7157 } else { | |
| 7158 if (_parallel) { | |
| 7159 p->oop_iterate(_par_scan_closure); | |
| 7160 } else { | |
| 7161 p->oop_iterate(_scan_closure); | |
| 7162 } | |
| 7163 } | |
| 7164 } | |
| 9152 | 7165 #ifdef ASSERT |
| 0 | 7166 if (!_parallel) { |
| 7167 assert(_mark_stack->isEmpty(), "post-condition (eager drainage)"); | |
| 7168 assert(_collector->overflow_list_is_empty(), | |
| 7169 "overflow list should be empty"); | |
| 7170 | |
| 7171 } | |
| 9152 | 7172 #endif // ASSERT |
| 0 | 7173 return is_obj_array; |
| 7174 } | |
| 7175 | |
| 7176 MarkFromRootsClosure::MarkFromRootsClosure(CMSCollector* collector, | |
| 7177 MemRegion span, | |
| 7178 CMSBitMap* bitMap, CMSMarkStack* markStack, | |
| 7179 bool should_yield, bool verifying): | |
| 7180 _collector(collector), | |
| 7181 _span(span), | |
| 7182 _bitMap(bitMap), | |
| 7183 _mut(&collector->_modUnionTable), | |
| 7184 _markStack(markStack), | |
| 7185 _yield(should_yield), | |
| 7186 _skipBits(0) | |
| 7187 { | |
| 7188 assert(_markStack->isEmpty(), "stack should be empty"); | |
| 7189 _finger = _bitMap->startWord(); | |
| 7190 _threshold = _finger; | |
| 7191 assert(_collector->_restart_addr == NULL, "Sanity check"); | |
| 7192 assert(_span.contains(_finger), "Out of bounds _finger?"); | |
| 7193 DEBUG_ONLY(_verifying = verifying;) | |
| 7194 } | |
| 7195 | |
| 7196 void MarkFromRootsClosure::reset(HeapWord* addr) { | |
| 7197 assert(_markStack->isEmpty(), "would cause duplicates on stack"); | |
| 7198 assert(_span.contains(addr), "Out of bounds _finger?"); | |
| 7199 _finger = addr; | |
| 7200 _threshold = (HeapWord*)round_to( | |
| 7201 (intptr_t)_finger, CardTableModRefBS::card_size); | |
| 7202 } | |
| 7203 | |
| 7204 // Should revisit to see if this should be restructured for | |
| 7205 // greater efficiency. | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7206 bool MarkFromRootsClosure::do_bit(size_t offset) { |
| 0 | 7207 if (_skipBits > 0) { |
| 7208 _skipBits--; | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7209 return true; |
| 0 | 7210 } |
| 7211 // convert offset into a HeapWord* | |
| 7212 HeapWord* addr = _bitMap->startWord() + offset; | |
| 7213 assert(_bitMap->endWord() && addr < _bitMap->endWord(), | |
| 7214 "address out of range"); | |
| 7215 assert(_bitMap->isMarked(addr), "tautology"); | |
| 7216 if (_bitMap->isMarked(addr+1)) { | |
| 7217 // this is an allocated but not yet initialized object | |
| 7218 assert(_skipBits == 0, "tautology"); | |
| 7219 _skipBits = 2; // skip next two marked bits ("Printezis-marks") | |
| 7220 oop p = oop(addr); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7221 if (p->klass_or_null() == NULL) { |
| 0 | 7222 DEBUG_ONLY(if (!_verifying) {) |
| 7223 // We re-dirty the cards on which this object lies and increase | |
| 7224 // the _threshold so that we'll come back to scan this object | |
| 7225 // during the preclean or remark phase. (CMSCleanOnEnter) | |
| 7226 if (CMSCleanOnEnter) { | |
| 7227 size_t sz = _collector->block_size_using_printezis_bits(addr); | |
| 7228 HeapWord* end_card_addr = (HeapWord*)round_to( | |
| 7229 (intptr_t)(addr+sz), CardTableModRefBS::card_size); | |
|
283
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7230 MemRegion redirty_range = MemRegion(addr, end_card_addr); |
| 0 | 7231 assert(!redirty_range.is_empty(), "Arithmetical tautology"); |
| 7232 // Bump _threshold to end_card_addr; note that | |
| 7233 // _threshold cannot possibly exceed end_card_addr, anyhow. | |
| 7234 // This prevents future clearing of the card as the scan proceeds | |
| 7235 // to the right. | |
| 7236 assert(_threshold <= end_card_addr, | |
| 7237 "Because we are just scanning into this object"); | |
| 7238 if (_threshold < end_card_addr) { | |
| 7239 _threshold = end_card_addr; | |
| 7240 } | |
| 187 | 7241 if (p->klass_or_null() != NULL) { |
| 0 | 7242 // Redirty the range of cards... |
| 7243 _mut->mark_range(redirty_range); | |
| 7244 } // ...else the setting of klass will dirty the card anyway. | |
| 7245 } | |
| 7246 DEBUG_ONLY(}) | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7247 return true; |
| 0 | 7248 } |
| 7249 } | |
| 7250 scanOopsInOop(addr); | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7251 return true; |
| 0 | 7252 } |
| 7253 | |
| 7254 // We take a break if we've been at this for a while, | |
| 7255 // so as to avoid monopolizing the locks involved. | |
| 7256 void MarkFromRootsClosure::do_yield_work() { | |
| 7257 // First give up the locks, then yield, then re-lock | |
| 7258 // We should probably use a constructor/destructor idiom to | |
| 7259 // do this unlock/lock or modify the MutexUnlocker class to | |
| 7260 // serve our purpose. XXX | |
| 7261 assert(ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 7262 "CMS thread should hold CMS token"); | |
| 7263 assert_lock_strong(_bitMap->lock()); | |
| 7264 _bitMap->lock()->unlock(); | |
| 7265 ConcurrentMarkSweepThread::desynchronize(true); | |
| 7266 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 7267 _collector->stopTimer(); | |
| 7268 GCPauseTimer p(_collector->size_policy()->concurrent_timer_ptr()); | |
| 7269 if (PrintCMSStatistics != 0) { | |
| 7270 _collector->incrementYields(); | |
| 7271 } | |
| 7272 _collector->icms_wait(); | |
| 7273 | |
| 7274 // See the comment in coordinator_yield() | |
| 7275 for (unsigned i = 0; i < CMSYieldSleepCount && | |
| 7276 ConcurrentMarkSweepThread::should_yield() && | |
| 7277 !CMSCollector::foregroundGCIsActive(); ++i) { | |
| 7278 os::sleep(Thread::current(), 1, false); | |
| 7279 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 7280 } | |
| 7281 | |
| 7282 ConcurrentMarkSweepThread::synchronize(true); | |
| 7283 _bitMap->lock()->lock_without_safepoint_check(); | |
| 7284 _collector->startTimer(); | |
| 7285 } | |
| 7286 | |
| 7287 void MarkFromRootsClosure::scanOopsInOop(HeapWord* ptr) { | |
| 7288 assert(_bitMap->isMarked(ptr), "expected bit to be set"); | |
| 7289 assert(_markStack->isEmpty(), | |
| 7290 "should drain stack to limit stack usage"); | |
| 7291 // convert ptr to an oop preparatory to scanning | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7292 oop obj = oop(ptr); |
| 0 | 7293 // Ignore mark word in verification below, since we |
| 7294 // may be running concurrent with mutators. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7295 assert(obj->is_oop(true), "should be an oop"); |
| 0 | 7296 assert(_finger <= ptr, "_finger runneth ahead"); |
| 7297 // advance the finger to right end of this object | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7298 _finger = ptr + obj->size(); |
| 0 | 7299 assert(_finger > ptr, "we just incremented it above"); |
| 7300 // On large heaps, it may take us some time to get through | |
| 7301 // the marking phase (especially if running iCMS). During | |
| 7302 // this time it's possible that a lot of mutations have | |
| 7303 // accumulated in the card table and the mod union table -- | |
| 7304 // these mutation records are redundant until we have | |
| 7305 // actually traced into the corresponding card. | |
| 7306 // Here, we check whether advancing the finger would make | |
| 7307 // us cross into a new card, and if so clear corresponding | |
| 7308 // cards in the MUT (preclean them in the card-table in the | |
| 7309 // future). | |
| 7310 | |
| 7311 DEBUG_ONLY(if (!_verifying) {) | |
| 7312 // The clean-on-enter optimization is disabled by default, | |
| 7313 // until we fix 6178663. | |
| 7314 if (CMSCleanOnEnter && (_finger > _threshold)) { | |
| 7315 // [_threshold, _finger) represents the interval | |
| 7316 // of cards to be cleared in MUT (or precleaned in card table). | |
| 7317 // The set of cards to be cleared is all those that overlap | |
| 7318 // with the interval [_threshold, _finger); note that | |
| 7319 // _threshold is always kept card-aligned but _finger isn't | |
| 7320 // always card-aligned. | |
| 7321 HeapWord* old_threshold = _threshold; | |
| 7322 assert(old_threshold == (HeapWord*)round_to( | |
| 7323 (intptr_t)old_threshold, CardTableModRefBS::card_size), | |
| 7324 "_threshold should always be card-aligned"); | |
| 7325 _threshold = (HeapWord*)round_to( | |
| 7326 (intptr_t)_finger, CardTableModRefBS::card_size); | |
| 7327 MemRegion mr(old_threshold, _threshold); | |
| 7328 assert(!mr.is_empty(), "Control point invariant"); | |
| 7329 assert(_span.contains(mr), "Should clear within span"); | |
| 7330 _mut->clear_range(mr); | |
| 7331 } | |
| 7332 DEBUG_ONLY(}) | |
| 7333 // Note: the finger doesn't advance while we drain | |
| 7334 // the stack below. | |
| 7335 PushOrMarkClosure pushOrMarkClosure(_collector, | |
| 7336 _span, _bitMap, _markStack, | |
| 7337 _finger, this); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7338 bool res = _markStack->push(obj); |
| 0 | 7339 assert(res, "Empty non-zero size stack should have space for single push"); |
| 7340 while (!_markStack->isEmpty()) { | |
| 7341 oop new_oop = _markStack->pop(); | |
| 7342 // Skip verifying header mark word below because we are | |
| 7343 // running concurrent with mutators. | |
| 7344 assert(new_oop->is_oop(true), "Oops! expected to pop an oop"); | |
| 7345 // now scan this oop's oops | |
| 7346 new_oop->oop_iterate(&pushOrMarkClosure); | |
| 7347 do_yield_check(); | |
| 7348 } | |
| 7349 assert(_markStack->isEmpty(), "tautology, emphasizing post-condition"); | |
| 7350 } | |
| 7351 | |
| 7352 Par_MarkFromRootsClosure::Par_MarkFromRootsClosure(CMSConcMarkingTask* task, | |
| 7353 CMSCollector* collector, MemRegion span, | |
| 7354 CMSBitMap* bit_map, | |
| 7355 OopTaskQueue* work_queue, | |
| 7356 CMSMarkStack* overflow_stack, | |
| 7357 bool should_yield): | |
| 7358 _collector(collector), | |
| 7359 _whole_span(collector->_span), | |
| 7360 _span(span), | |
| 7361 _bit_map(bit_map), | |
| 7362 _mut(&collector->_modUnionTable), | |
| 7363 _work_queue(work_queue), | |
| 7364 _overflow_stack(overflow_stack), | |
| 7365 _yield(should_yield), | |
| 7366 _skip_bits(0), | |
| 7367 _task(task) | |
| 7368 { | |
| 7369 assert(_work_queue->size() == 0, "work_queue should be empty"); | |
| 7370 _finger = span.start(); | |
| 7371 _threshold = _finger; // XXX Defer clear-on-enter optimization for now | |
| 7372 assert(_span.contains(_finger), "Out of bounds _finger?"); | |
| 7373 } | |
| 7374 | |
| 7375 // Should revisit to see if this should be restructured for | |
| 7376 // greater efficiency. | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7377 bool Par_MarkFromRootsClosure::do_bit(size_t offset) { |
| 0 | 7378 if (_skip_bits > 0) { |
| 7379 _skip_bits--; | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7380 return true; |
| 0 | 7381 } |
| 7382 // convert offset into a HeapWord* | |
| 7383 HeapWord* addr = _bit_map->startWord() + offset; | |
| 7384 assert(_bit_map->endWord() && addr < _bit_map->endWord(), | |
| 7385 "address out of range"); | |
| 7386 assert(_bit_map->isMarked(addr), "tautology"); | |
| 7387 if (_bit_map->isMarked(addr+1)) { | |
| 7388 // this is an allocated object that might not yet be initialized | |
| 7389 assert(_skip_bits == 0, "tautology"); | |
| 7390 _skip_bits = 2; // skip next two marked bits ("Printezis-marks") | |
| 7391 oop p = oop(addr); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7392 if (p->klass_or_null() == NULL) { |
| 0 | 7393 // in the case of Clean-on-Enter optimization, redirty card |
| 7394 // and avoid clearing card by increasing the threshold. | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7395 return true; |
| 0 | 7396 } |
| 7397 } | |
| 7398 scan_oops_in_oop(addr); | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7399 return true; |
| 0 | 7400 } |
| 7401 | |
| 7402 void Par_MarkFromRootsClosure::scan_oops_in_oop(HeapWord* ptr) { | |
| 7403 assert(_bit_map->isMarked(ptr), "expected bit to be set"); | |
| 7404 // Should we assert that our work queue is empty or | |
| 7405 // below some drain limit? | |
| 7406 assert(_work_queue->size() == 0, | |
| 7407 "should drain stack to limit stack usage"); | |
| 7408 // convert ptr to an oop preparatory to scanning | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7409 oop obj = oop(ptr); |
| 0 | 7410 // Ignore mark word in verification below, since we |
| 7411 // may be running concurrent with mutators. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7412 assert(obj->is_oop(true), "should be an oop"); |
| 0 | 7413 assert(_finger <= ptr, "_finger runneth ahead"); |
| 7414 // advance the finger to right end of this object | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7415 _finger = ptr + obj->size(); |
| 0 | 7416 assert(_finger > ptr, "we just incremented it above"); |
| 7417 // On large heaps, it may take us some time to get through | |
| 7418 // the marking phase (especially if running iCMS). During | |
| 7419 // this time it's possible that a lot of mutations have | |
| 7420 // accumulated in the card table and the mod union table -- | |
| 7421 // these mutation records are redundant until we have | |
| 7422 // actually traced into the corresponding card. | |
| 7423 // Here, we check whether advancing the finger would make | |
| 7424 // us cross into a new card, and if so clear corresponding | |
| 7425 // cards in the MUT (preclean them in the card-table in the | |
| 7426 // future). | |
| 7427 | |
| 7428 // The clean-on-enter optimization is disabled by default, | |
| 7429 // until we fix 6178663. | |
| 7430 if (CMSCleanOnEnter && (_finger > _threshold)) { | |
| 7431 // [_threshold, _finger) represents the interval | |
| 7432 // of cards to be cleared in MUT (or precleaned in card table). | |
| 7433 // The set of cards to be cleared is all those that overlap | |
| 7434 // with the interval [_threshold, _finger); note that | |
| 7435 // _threshold is always kept card-aligned but _finger isn't | |
| 7436 // always card-aligned. | |
| 7437 HeapWord* old_threshold = _threshold; | |
| 7438 assert(old_threshold == (HeapWord*)round_to( | |
| 7439 (intptr_t)old_threshold, CardTableModRefBS::card_size), | |
| 7440 "_threshold should always be card-aligned"); | |
| 7441 _threshold = (HeapWord*)round_to( | |
| 7442 (intptr_t)_finger, CardTableModRefBS::card_size); | |
| 7443 MemRegion mr(old_threshold, _threshold); | |
| 7444 assert(!mr.is_empty(), "Control point invariant"); | |
| 7445 assert(_span.contains(mr), "Should clear within span"); // _whole_span ?? | |
| 7446 _mut->clear_range(mr); | |
| 7447 } | |
| 7448 | |
| 7449 // Note: the local finger doesn't advance while we drain | |
| 7450 // the stack below, but the global finger sure can and will. | |
| 7451 HeapWord** gfa = _task->global_finger_addr(); | |
| 7452 Par_PushOrMarkClosure pushOrMarkClosure(_collector, | |
| 7453 _span, _bit_map, | |
| 7454 _work_queue, | |
| 7455 _overflow_stack, | |
| 7456 _finger, | |
| 7457 gfa, this); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7458 bool res = _work_queue->push(obj); // overflow could occur here |
| 0 | 7459 assert(res, "Will hold once we use workqueues"); |
| 7460 while (true) { | |
| 7461 oop new_oop; | |
| 7462 if (!_work_queue->pop_local(new_oop)) { | |
| 7463 // We emptied our work_queue; check if there's stuff that can | |
| 7464 // be gotten from the overflow stack. | |
| 7465 if (CMSConcMarkingTask::get_work_from_overflow_stack( | |
| 7466 _overflow_stack, _work_queue)) { | |
| 7467 do_yield_check(); | |
| 7468 continue; | |
| 7469 } else { // done | |
| 7470 break; | |
| 7471 } | |
| 7472 } | |
| 7473 // Skip verifying header mark word below because we are | |
| 7474 // running concurrent with mutators. | |
| 7475 assert(new_oop->is_oop(true), "Oops! expected to pop an oop"); | |
| 7476 // now scan this oop's oops | |
| 7477 new_oop->oop_iterate(&pushOrMarkClosure); | |
| 7478 do_yield_check(); | |
| 7479 } | |
| 7480 assert(_work_queue->size() == 0, "tautology, emphasizing post-condition"); | |
| 7481 } | |
| 7482 | |
| 7483 // Yield in response to a request from VM Thread or | |
| 7484 // from mutators. | |
| 7485 void Par_MarkFromRootsClosure::do_yield_work() { | |
| 7486 assert(_task != NULL, "sanity"); | |
| 7487 _task->yield(); | |
| 7488 } | |
| 7489 | |
| 7490 // A variant of the above used for verifying CMS marking work. | |
| 7491 MarkFromRootsVerifyClosure::MarkFromRootsVerifyClosure(CMSCollector* collector, | |
| 7492 MemRegion span, | |
| 7493 CMSBitMap* verification_bm, CMSBitMap* cms_bm, | |
| 7494 CMSMarkStack* mark_stack): | |
| 7495 _collector(collector), | |
| 7496 _span(span), | |
| 7497 _verification_bm(verification_bm), | |
| 7498 _cms_bm(cms_bm), | |
| 7499 _mark_stack(mark_stack), | |
| 7500 _pam_verify_closure(collector, span, verification_bm, cms_bm, | |
| 7501 mark_stack) | |
| 7502 { | |
| 7503 assert(_mark_stack->isEmpty(), "stack should be empty"); | |
| 7504 _finger = _verification_bm->startWord(); | |
| 7505 assert(_collector->_restart_addr == NULL, "Sanity check"); | |
| 7506 assert(_span.contains(_finger), "Out of bounds _finger?"); | |
| 7507 } | |
| 7508 | |
| 7509 void MarkFromRootsVerifyClosure::reset(HeapWord* addr) { | |
| 7510 assert(_mark_stack->isEmpty(), "would cause duplicates on stack"); | |
| 7511 assert(_span.contains(addr), "Out of bounds _finger?"); | |
| 7512 _finger = addr; | |
| 7513 } | |
| 7514 | |
| 7515 // Should revisit to see if this should be restructured for | |
| 7516 // greater efficiency. | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7517 bool MarkFromRootsVerifyClosure::do_bit(size_t offset) { |
| 0 | 7518 // convert offset into a HeapWord* |
| 7519 HeapWord* addr = _verification_bm->startWord() + offset; | |
| 7520 assert(_verification_bm->endWord() && addr < _verification_bm->endWord(), | |
| 7521 "address out of range"); | |
| 7522 assert(_verification_bm->isMarked(addr), "tautology"); | |
| 7523 assert(_cms_bm->isMarked(addr), "tautology"); | |
| 7524 | |
| 7525 assert(_mark_stack->isEmpty(), | |
| 7526 "should drain stack to limit stack usage"); | |
| 7527 // convert addr to an oop preparatory to scanning | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7528 oop obj = oop(addr); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7529 assert(obj->is_oop(), "should be an oop"); |
| 0 | 7530 assert(_finger <= addr, "_finger runneth ahead"); |
| 7531 // advance the finger to right end of this object | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7532 _finger = addr + obj->size(); |
| 0 | 7533 assert(_finger > addr, "we just incremented it above"); |
| 7534 // Note: the finger doesn't advance while we drain | |
| 7535 // the stack below. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7536 bool res = _mark_stack->push(obj); |
| 0 | 7537 assert(res, "Empty non-zero size stack should have space for single push"); |
| 7538 while (!_mark_stack->isEmpty()) { | |
| 7539 oop new_oop = _mark_stack->pop(); | |
| 7540 assert(new_oop->is_oop(), "Oops! expected to pop an oop"); | |
| 7541 // now scan this oop's oops | |
| 7542 new_oop->oop_iterate(&_pam_verify_closure); | |
| 7543 } | |
| 7544 assert(_mark_stack->isEmpty(), "tautology, emphasizing post-condition"); | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7545 return true; |
| 0 | 7546 } |
| 7547 | |
| 7548 PushAndMarkVerifyClosure::PushAndMarkVerifyClosure( | |
| 7549 CMSCollector* collector, MemRegion span, | |
| 7550 CMSBitMap* verification_bm, CMSBitMap* cms_bm, | |
| 7551 CMSMarkStack* mark_stack): | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7552 CMSOopClosure(collector->ref_processor()), |
| 0 | 7553 _collector(collector), |
| 7554 _span(span), | |
| 7555 _verification_bm(verification_bm), | |
| 7556 _cms_bm(cms_bm), | |
| 7557 _mark_stack(mark_stack) | |
| 7558 { } | |
| 7559 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7560 void PushAndMarkVerifyClosure::do_oop(oop* p) { PushAndMarkVerifyClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7561 void PushAndMarkVerifyClosure::do_oop(narrowOop* p) { PushAndMarkVerifyClosure::do_oop_work(p); } |
| 0 | 7562 |
| 7563 // Upon stack overflow, we discard (part of) the stack, | |
| 7564 // remembering the least address amongst those discarded | |
| 7565 // in CMSCollector's _restart_address. | |
| 7566 void PushAndMarkVerifyClosure::handle_stack_overflow(HeapWord* lost) { | |
| 7567 // Remember the least grey address discarded | |
| 7568 HeapWord* ra = (HeapWord*)_mark_stack->least_value(lost); | |
| 7569 _collector->lower_restart_addr(ra); | |
| 7570 _mark_stack->reset(); // discard stack contents | |
| 7571 _mark_stack->expand(); // expand the stack if possible | |
| 7572 } | |
| 7573 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7574 void PushAndMarkVerifyClosure::do_oop(oop obj) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7575 assert(obj->is_oop_or_null(), "expected an oop or NULL"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7576 HeapWord* addr = (HeapWord*)obj; |
| 0 | 7577 if (_span.contains(addr) && !_verification_bm->isMarked(addr)) { |
| 7578 // Oop lies in _span and isn't yet grey or black | |
| 7579 _verification_bm->mark(addr); // now grey | |
| 7580 if (!_cms_bm->isMarked(addr)) { | |
| 7581 oop(addr)->print(); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7582 gclog_or_tty->print_cr(" (" INTPTR_FORMAT " should have been marked)", |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7583 addr); |
| 0 | 7584 fatal("... aborting"); |
| 7585 } | |
| 7586 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7587 if (!_mark_stack->push(obj)) { // stack overflow |
| 0 | 7588 if (PrintCMSStatistics != 0) { |
| 7589 gclog_or_tty->print_cr("CMS marking stack overflow (benign) at " | |
| 7590 SIZE_FORMAT, _mark_stack->capacity()); | |
| 7591 } | |
| 7592 assert(_mark_stack->isFull(), "Else push should have succeeded"); | |
| 7593 handle_stack_overflow(addr); | |
| 7594 } | |
| 7595 // anything including and to the right of _finger | |
| 7596 // will be scanned as we iterate over the remainder of the | |
| 7597 // bit map | |
| 7598 } | |
| 7599 } | |
| 7600 | |
| 7601 PushOrMarkClosure::PushOrMarkClosure(CMSCollector* collector, | |
| 7602 MemRegion span, | |
| 7603 CMSBitMap* bitMap, CMSMarkStack* markStack, | |
| 7604 HeapWord* finger, MarkFromRootsClosure* parent) : | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7605 CMSOopClosure(collector->ref_processor()), |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7606 _collector(collector), |
| 0 | 7607 _span(span), |
| 7608 _bitMap(bitMap), | |
| 7609 _markStack(markStack), | |
| 7610 _finger(finger), | |
| 935 | 7611 _parent(parent) |
| 0 | 7612 { } |
| 7613 | |
| 7614 Par_PushOrMarkClosure::Par_PushOrMarkClosure(CMSCollector* collector, | |
| 7615 MemRegion span, | |
| 7616 CMSBitMap* bit_map, | |
| 7617 OopTaskQueue* work_queue, | |
| 7618 CMSMarkStack* overflow_stack, | |
| 7619 HeapWord* finger, | |
| 7620 HeapWord** global_finger_addr, | |
| 7621 Par_MarkFromRootsClosure* parent) : | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7622 CMSOopClosure(collector->ref_processor()), |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7623 _collector(collector), |
| 0 | 7624 _whole_span(collector->_span), |
| 7625 _span(span), | |
| 7626 _bit_map(bit_map), | |
| 7627 _work_queue(work_queue), | |
| 7628 _overflow_stack(overflow_stack), | |
| 7629 _finger(finger), | |
| 7630 _global_finger_addr(global_finger_addr), | |
| 935 | 7631 _parent(parent) |
| 0 | 7632 { } |
| 7633 | |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
7634 // Assumes thread-safe access by callers, who are |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
7635 // responsible for mutual exclusion. |
| 0 | 7636 void CMSCollector::lower_restart_addr(HeapWord* low) { |
| 7637 assert(_span.contains(low), "Out of bounds addr"); | |
| 7638 if (_restart_addr == NULL) { | |
| 7639 _restart_addr = low; | |
| 7640 } else { | |
| 7641 _restart_addr = MIN2(_restart_addr, low); | |
| 7642 } | |
| 7643 } | |
| 7644 | |
| 7645 // Upon stack overflow, we discard (part of) the stack, | |
| 7646 // remembering the least address amongst those discarded | |
| 7647 // in CMSCollector's _restart_address. | |
| 7648 void PushOrMarkClosure::handle_stack_overflow(HeapWord* lost) { | |
| 7649 // Remember the least grey address discarded | |
| 7650 HeapWord* ra = (HeapWord*)_markStack->least_value(lost); | |
| 7651 _collector->lower_restart_addr(ra); | |
| 7652 _markStack->reset(); // discard stack contents | |
| 7653 _markStack->expand(); // expand the stack if possible | |
| 7654 } | |
| 7655 | |
| 7656 // Upon stack overflow, we discard (part of) the stack, | |
| 7657 // remembering the least address amongst those discarded | |
| 7658 // in CMSCollector's _restart_address. | |
| 7659 void Par_PushOrMarkClosure::handle_stack_overflow(HeapWord* lost) { | |
| 7660 // We need to do this under a mutex to prevent other | |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
283
diff
changeset
|
7661 // workers from interfering with the work done below. |
| 0 | 7662 MutexLockerEx ml(_overflow_stack->par_lock(), |
| 7663 Mutex::_no_safepoint_check_flag); | |
| 7664 // Remember the least grey address discarded | |
| 7665 HeapWord* ra = (HeapWord*)_overflow_stack->least_value(lost); | |
| 7666 _collector->lower_restart_addr(ra); | |
| 7667 _overflow_stack->reset(); // discard stack contents | |
| 7668 _overflow_stack->expand(); // expand the stack if possible | |
| 7669 } | |
| 7670 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7671 void CMKlassClosure::do_klass(Klass* k) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7672 assert(_oop_closure != NULL, "Not initialized?"); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7673 k->oops_do(_oop_closure); |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7674 } |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7675 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7676 void PushOrMarkClosure::do_oop(oop obj) { |
| 0 | 7677 // Ignore mark word because we are running concurrent with mutators. |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7678 assert(obj->is_oop_or_null(true), "expected an oop or NULL"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7679 HeapWord* addr = (HeapWord*)obj; |
| 0 | 7680 if (_span.contains(addr) && !_bitMap->isMarked(addr)) { |
| 7681 // Oop lies in _span and isn't yet grey or black | |
| 7682 _bitMap->mark(addr); // now grey | |
| 7683 if (addr < _finger) { | |
| 7684 // the bit map iteration has already either passed, or | |
| 7685 // sampled, this bit in the bit map; we'll need to | |
| 7686 // use the marking stack to scan this oop's oops. | |
| 7687 bool simulate_overflow = false; | |
| 7688 NOT_PRODUCT( | |
| 7689 if (CMSMarkStackOverflowALot && | |
| 7690 _collector->simulate_overflow()) { | |
| 7691 // simulate a stack overflow | |
| 7692 simulate_overflow = true; | |
| 7693 } | |
| 7694 ) | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7695 if (simulate_overflow || !_markStack->push(obj)) { // stack overflow |
| 0 | 7696 if (PrintCMSStatistics != 0) { |
| 7697 gclog_or_tty->print_cr("CMS marking stack overflow (benign) at " | |
| 7698 SIZE_FORMAT, _markStack->capacity()); | |
| 7699 } | |
| 7700 assert(simulate_overflow || _markStack->isFull(), "Else push should have succeeded"); | |
| 7701 handle_stack_overflow(addr); | |
| 7702 } | |
| 7703 } | |
| 7704 // anything including and to the right of _finger | |
| 7705 // will be scanned as we iterate over the remainder of the | |
| 7706 // bit map | |
| 7707 do_yield_check(); | |
| 7708 } | |
| 7709 } | |
| 7710 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7711 void PushOrMarkClosure::do_oop(oop* p) { PushOrMarkClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7712 void PushOrMarkClosure::do_oop(narrowOop* p) { PushOrMarkClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7713 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7714 void Par_PushOrMarkClosure::do_oop(oop obj) { |
| 0 | 7715 // Ignore mark word because we are running concurrent with mutators. |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7716 assert(obj->is_oop_or_null(true), "expected an oop or NULL"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7717 HeapWord* addr = (HeapWord*)obj; |
| 0 | 7718 if (_whole_span.contains(addr) && !_bit_map->isMarked(addr)) { |
| 7719 // Oop lies in _span and isn't yet grey or black | |
| 7720 // We read the global_finger (volatile read) strictly after marking oop | |
| 7721 bool res = _bit_map->par_mark(addr); // now grey | |
| 7722 volatile HeapWord** gfa = (volatile HeapWord**)_global_finger_addr; | |
| 7723 // Should we push this marked oop on our stack? | |
| 7724 // -- if someone else marked it, nothing to do | |
| 7725 // -- if target oop is above global finger nothing to do | |
| 7726 // -- if target oop is in chunk and above local finger | |
| 7727 // then nothing to do | |
| 7728 // -- else push on work queue | |
| 7729 if ( !res // someone else marked it, they will deal with it | |
| 7730 || (addr >= *gfa) // will be scanned in a later task | |
| 7731 || (_span.contains(addr) && addr >= _finger)) { // later in this chunk | |
| 7732 return; | |
| 7733 } | |
| 7734 // the bit map iteration has already either passed, or | |
| 7735 // sampled, this bit in the bit map; we'll need to | |
| 7736 // use the marking stack to scan this oop's oops. | |
| 7737 bool simulate_overflow = false; | |
| 7738 NOT_PRODUCT( | |
| 7739 if (CMSMarkStackOverflowALot && | |
| 7740 _collector->simulate_overflow()) { | |
| 7741 // simulate a stack overflow | |
| 7742 simulate_overflow = true; | |
| 7743 } | |
| 7744 ) | |
| 7745 if (simulate_overflow || | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7746 !(_work_queue->push(obj) || _overflow_stack->par_push(obj))) { |
| 0 | 7747 // stack overflow |
| 7748 if (PrintCMSStatistics != 0) { | |
| 7749 gclog_or_tty->print_cr("CMS marking stack overflow (benign) at " | |
| 7750 SIZE_FORMAT, _overflow_stack->capacity()); | |
| 7751 } | |
| 7752 // We cannot assert that the overflow stack is full because | |
| 7753 // it may have been emptied since. | |
| 7754 assert(simulate_overflow || | |
| 7755 _work_queue->size() == _work_queue->max_elems(), | |
| 7756 "Else push should have succeeded"); | |
| 7757 handle_stack_overflow(addr); | |
| 7758 } | |
| 7759 do_yield_check(); | |
| 7760 } | |
| 7761 } | |
| 7762 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7763 void Par_PushOrMarkClosure::do_oop(oop* p) { Par_PushOrMarkClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7764 void Par_PushOrMarkClosure::do_oop(narrowOop* p) { Par_PushOrMarkClosure::do_oop_work(p); } |
| 0 | 7765 |
| 7766 PushAndMarkClosure::PushAndMarkClosure(CMSCollector* collector, | |
| 7767 MemRegion span, | |
| 7768 ReferenceProcessor* rp, | |
| 7769 CMSBitMap* bit_map, | |
| 7770 CMSBitMap* mod_union_table, | |
| 7771 CMSMarkStack* mark_stack, | |
| 7772 bool concurrent_precleaning): | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7773 CMSOopClosure(rp), |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7774 _collector(collector), |
| 0 | 7775 _span(span), |
| 7776 _bit_map(bit_map), | |
| 7777 _mod_union_table(mod_union_table), | |
| 7778 _mark_stack(mark_stack), | |
| 935 | 7779 _concurrent_precleaning(concurrent_precleaning) |
| 0 | 7780 { |
| 7781 assert(_ref_processor != NULL, "_ref_processor shouldn't be NULL"); | |
| 7782 } | |
| 7783 | |
| 7784 // Grey object rescan during pre-cleaning and second checkpoint phases -- | |
| 7785 // the non-parallel version (the parallel version appears further below.) | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7786 void PushAndMarkClosure::do_oop(oop obj) { |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7787 // Ignore mark word verification. If during concurrent precleaning, |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7788 // the object monitor may be locked. If during the checkpoint |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7789 // phases, the object may already have been reached by a different |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7790 // path and may be at the end of the global overflow list (so |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7791 // the mark word may be NULL). |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
143
diff
changeset
|
7792 assert(obj->is_oop_or_null(true /* ignore mark word */), |
| 0 | 7793 "expected an oop or NULL"); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7794 HeapWord* addr = (HeapWord*)obj; |
| 0 | 7795 // Check if oop points into the CMS generation |
| 7796 // and is not marked | |
| 7797 if (_span.contains(addr) && !_bit_map->isMarked(addr)) { | |
| 7798 // a white object ... | |
| 7799 _bit_map->mark(addr); // ... now grey | |
| 7800 // push on the marking stack (grey set) | |
| 7801 bool simulate_overflow = false; | |
| 7802 NOT_PRODUCT( | |
| 7803 if (CMSMarkStackOverflowALot && | |
| 7804 _collector->simulate_overflow()) { | |
| 7805 // simulate a stack overflow | |
| 7806 simulate_overflow = true; | |
| 7807 } | |
| 7808 ) | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7809 if (simulate_overflow || !_mark_stack->push(obj)) { |
| 0 | 7810 if (_concurrent_precleaning) { |
|
283
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7811 // During precleaning we can just dirty the appropriate card(s) |
| 0 | 7812 // in the mod union table, thus ensuring that the object remains |
|
283
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7813 // in the grey set and continue. In the case of object arrays |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7814 // we need to dirty all of the cards that the object spans, |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7815 // since the rescan of object arrays will be limited to the |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7816 // dirty cards. |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7817 // Note that no one can be intefering with us in this action |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7818 // of dirtying the mod union table, so no locking or atomics |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7819 // are required. |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7820 if (obj->is_objArray()) { |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7821 size_t sz = obj->size(); |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7822 HeapWord* end_card_addr = (HeapWord*)round_to( |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7823 (intptr_t)(addr+sz), CardTableModRefBS::card_size); |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7824 MemRegion redirty_range = MemRegion(addr, end_card_addr); |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7825 assert(!redirty_range.is_empty(), "Arithmetical tautology"); |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7826 _mod_union_table->mark_range(redirty_range); |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7827 } else { |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7828 _mod_union_table->mark(addr); |
|
9199f248b0ee
6722112: CMS: Incorrect encoding of overflown object arrays during concurrent precleaning
ysr
parents:
271
diff
changeset
|
7829 } |
| 0 | 7830 _collector->_ser_pmc_preclean_ovflw++; |
| 7831 } else { | |
| 7832 // During the remark phase, we need to remember this oop | |
| 7833 // in the overflow list. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7834 _collector->push_on_overflow_list(obj); |
| 0 | 7835 _collector->_ser_pmc_remark_ovflw++; |
| 7836 } | |
| 7837 } | |
| 7838 } | |
| 7839 } | |
| 7840 | |
| 7841 Par_PushAndMarkClosure::Par_PushAndMarkClosure(CMSCollector* collector, | |
| 7842 MemRegion span, | |
| 7843 ReferenceProcessor* rp, | |
| 7844 CMSBitMap* bit_map, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7845 OopTaskQueue* work_queue): |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7846 CMSOopClosure(rp), |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
7847 _collector(collector), |
| 0 | 7848 _span(span), |
| 7849 _bit_map(bit_map), | |
| 935 | 7850 _work_queue(work_queue) |
| 0 | 7851 { |
| 7852 assert(_ref_processor != NULL, "_ref_processor shouldn't be NULL"); | |
| 7853 } | |
| 7854 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7855 void PushAndMarkClosure::do_oop(oop* p) { PushAndMarkClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7856 void PushAndMarkClosure::do_oop(narrowOop* p) { PushAndMarkClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7857 |
| 0 | 7858 // Grey object rescan during second checkpoint phase -- |
| 7859 // the parallel version. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7860 void Par_PushAndMarkClosure::do_oop(oop obj) { |
| 0 | 7861 // In the assert below, we ignore the mark word because |
| 7862 // this oop may point to an already visited object that is | |
| 7863 // on the overflow stack (in which case the mark word has | |
| 7864 // been hijacked for chaining into the overflow stack -- | |
| 7865 // if this is the last object in the overflow stack then | |
| 7866 // its mark word will be NULL). Because this object may | |
| 7867 // have been subsequently popped off the global overflow | |
| 7868 // stack, and the mark word possibly restored to the prototypical | |
| 7869 // value, by the time we get to examined this failing assert in | |
| 7870 // the debugger, is_oop_or_null(false) may subsequently start | |
| 7871 // to hold. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7872 assert(obj->is_oop_or_null(true), |
| 0 | 7873 "expected an oop or NULL"); |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7874 HeapWord* addr = (HeapWord*)obj; |
| 0 | 7875 // Check if oop points into the CMS generation |
| 7876 // and is not marked | |
| 7877 if (_span.contains(addr) && !_bit_map->isMarked(addr)) { | |
| 7878 // a white object ... | |
| 7879 // If we manage to "claim" the object, by being the | |
| 7880 // first thread to mark it, then we push it on our | |
| 7881 // marking stack | |
| 7882 if (_bit_map->par_mark(addr)) { // ... now grey | |
| 7883 // push on work queue (grey set) | |
| 7884 bool simulate_overflow = false; | |
| 7885 NOT_PRODUCT( | |
| 7886 if (CMSMarkStackOverflowALot && | |
| 7887 _collector->par_simulate_overflow()) { | |
| 7888 // simulate a stack overflow | |
| 7889 simulate_overflow = true; | |
| 7890 } | |
| 7891 ) | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7892 if (simulate_overflow || !_work_queue->push(obj)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7893 _collector->par_push_on_overflow_list(obj); |
| 0 | 7894 _collector->_par_pmc_remark_ovflw++; // imprecise OK: no need to CAS |
| 7895 } | |
| 7896 } // Else, some other thread got there first | |
| 7897 } | |
| 7898 } | |
| 7899 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7900 void Par_PushAndMarkClosure::do_oop(oop* p) { Par_PushAndMarkClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7901 void Par_PushAndMarkClosure::do_oop(narrowOop* p) { Par_PushAndMarkClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
7902 |
| 0 | 7903 void CMSPrecleanRefsYieldClosure::do_yield_work() { |
| 7904 Mutex* bml = _collector->bitMapLock(); | |
| 7905 assert_lock_strong(bml); | |
| 7906 assert(ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 7907 "CMS thread should hold CMS token"); | |
| 7908 | |
| 7909 bml->unlock(); | |
| 7910 ConcurrentMarkSweepThread::desynchronize(true); | |
| 7911 | |
| 7912 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 7913 | |
| 7914 _collector->stopTimer(); | |
| 7915 GCPauseTimer p(_collector->size_policy()->concurrent_timer_ptr()); | |
| 7916 if (PrintCMSStatistics != 0) { | |
| 7917 _collector->incrementYields(); | |
| 7918 } | |
| 7919 _collector->icms_wait(); | |
| 7920 | |
| 7921 // See the comment in coordinator_yield() | |
| 7922 for (unsigned i = 0; i < CMSYieldSleepCount && | |
| 7923 ConcurrentMarkSweepThread::should_yield() && | |
| 7924 !CMSCollector::foregroundGCIsActive(); ++i) { | |
| 7925 os::sleep(Thread::current(), 1, false); | |
| 7926 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 7927 } | |
| 7928 | |
| 7929 ConcurrentMarkSweepThread::synchronize(true); | |
| 7930 bml->lock(); | |
| 7931 | |
| 7932 _collector->startTimer(); | |
| 7933 } | |
| 7934 | |
| 7935 bool CMSPrecleanRefsYieldClosure::should_return() { | |
| 7936 if (ConcurrentMarkSweepThread::should_yield()) { | |
| 7937 do_yield_work(); | |
| 7938 } | |
| 7939 return _collector->foregroundGCIsActive(); | |
| 7940 } | |
| 7941 | |
| 7942 void MarkFromDirtyCardsClosure::do_MemRegion(MemRegion mr) { | |
| 7943 assert(((size_t)mr.start())%CardTableModRefBS::card_size_in_words == 0, | |
| 7944 "mr should be aligned to start at a card boundary"); | |
| 7945 // We'd like to assert: | |
| 7946 // assert(mr.word_size()%CardTableModRefBS::card_size_in_words == 0, | |
| 7947 // "mr should be a range of cards"); | |
| 7948 // However, that would be too strong in one case -- the last | |
| 7949 // partition ends at _unallocated_block which, in general, can be | |
| 7950 // an arbitrary boundary, not necessarily card aligned. | |
| 7951 if (PrintCMSStatistics != 0) { | |
| 7952 _num_dirty_cards += | |
| 7953 mr.word_size()/CardTableModRefBS::card_size_in_words; | |
| 7954 } | |
| 7955 _space->object_iterate_mem(mr, &_scan_cl); | |
| 7956 } | |
| 7957 | |
| 7958 SweepClosure::SweepClosure(CMSCollector* collector, | |
| 7959 ConcurrentMarkSweepGeneration* g, | |
| 7960 CMSBitMap* bitMap, bool should_yield) : | |
| 7961 _collector(collector), | |
| 7962 _g(g), | |
| 7963 _sp(g->cmsSpace()), | |
| 7964 _limit(_sp->sweep_limit()), | |
| 7965 _freelistLock(_sp->freelistLock()), | |
| 7966 _bitMap(bitMap), | |
| 7967 _yield(should_yield), | |
| 7968 _inFreeRange(false), // No free range at beginning of sweep | |
| 7969 _freeRangeInFreeLists(false), // No free range at beginning of sweep | |
| 7970 _lastFreeRangeCoalesced(false), | |
| 7971 _freeFinger(g->used_region().start()) | |
| 7972 { | |
| 7973 NOT_PRODUCT( | |
| 7974 _numObjectsFreed = 0; | |
| 7975 _numWordsFreed = 0; | |
| 7976 _numObjectsLive = 0; | |
| 7977 _numWordsLive = 0; | |
| 7978 _numObjectsAlreadyFree = 0; | |
| 7979 _numWordsAlreadyFree = 0; | |
| 7980 _last_fc = NULL; | |
| 7981 | |
| 7982 _sp->initializeIndexedFreeListArrayReturnedBytes(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
7983 _sp->dictionary()->initialize_dict_returned_bytes(); |
| 0 | 7984 ) |
| 7985 assert(_limit >= _sp->bottom() && _limit <= _sp->end(), | |
| 7986 "sweep _limit out of bounds"); | |
| 7987 if (CMSTraceSweeper) { | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7988 gclog_or_tty->print_cr("\n====================\nStarting new sweep with limit " PTR_FORMAT, |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7989 _limit); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7990 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7991 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7992 |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7993 void SweepClosure::print_on(outputStream* st) const { |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7994 tty->print_cr("_sp = [" PTR_FORMAT "," PTR_FORMAT ")", |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7995 _sp->bottom(), _sp->end()); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7996 tty->print_cr("_limit = " PTR_FORMAT, _limit); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7997 tty->print_cr("_freeFinger = " PTR_FORMAT, _freeFinger); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7998 NOT_PRODUCT(tty->print_cr("_last_fc = " PTR_FORMAT, _last_fc);) |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
7999 tty->print_cr("_inFreeRange = %d, _freeRangeInFreeLists = %d, _lastFreeRangeCoalesced = %d", |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8000 _inFreeRange, _freeRangeInFreeLists, _lastFreeRangeCoalesced); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8001 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8002 |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8003 #ifndef PRODUCT |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8004 // Assertion checking only: no useful work in product mode -- |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8005 // however, if any of the flags below become product flags, |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8006 // you may need to review this code to see if it needs to be |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8007 // enabled in product mode. |
| 0 | 8008 SweepClosure::~SweepClosure() { |
| 8009 assert_lock_strong(_freelistLock); | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8010 assert(_limit >= _sp->bottom() && _limit <= _sp->end(), |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8011 "sweep _limit out of bounds"); |
| 0 | 8012 if (inFreeRange()) { |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8013 warning("inFreeRange() should have been reset; dumping state of SweepClosure"); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8014 print(); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8015 ShouldNotReachHere(); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8016 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8017 if (Verbose && PrintGC) { |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8018 gclog_or_tty->print("Collected "SIZE_FORMAT" objects, " SIZE_FORMAT " bytes", |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8019 _numObjectsFreed, _numWordsFreed*sizeof(HeapWord)); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8020 gclog_or_tty->print_cr("\nLive "SIZE_FORMAT" objects, " |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8021 SIZE_FORMAT" bytes " |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8022 "Already free "SIZE_FORMAT" objects, "SIZE_FORMAT" bytes", |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8023 _numObjectsLive, _numWordsLive*sizeof(HeapWord), |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8024 _numObjectsAlreadyFree, _numWordsAlreadyFree*sizeof(HeapWord)); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8025 size_t totalBytes = (_numWordsFreed + _numWordsLive + _numWordsAlreadyFree) |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8026 * sizeof(HeapWord); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8027 gclog_or_tty->print_cr("Total sweep: "SIZE_FORMAT" bytes", totalBytes); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8028 |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8029 if (PrintCMSStatistics && CMSVerifyReturnedBytes) { |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8030 size_t indexListReturnedBytes = _sp->sumIndexedFreeListArrayReturnedBytes(); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8031 size_t dict_returned_bytes = _sp->dictionary()->sum_dict_returned_bytes(); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8032 size_t returned_bytes = indexListReturnedBytes + dict_returned_bytes; |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8033 gclog_or_tty->print("Returned "SIZE_FORMAT" bytes", returned_bytes); |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8034 gclog_or_tty->print(" Indexed List Returned "SIZE_FORMAT" bytes", |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8035 indexListReturnedBytes); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8036 gclog_or_tty->print_cr(" Dictionary Returned "SIZE_FORMAT" bytes", |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8037 dict_returned_bytes); |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8038 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8039 } |
| 0 | 8040 if (CMSTraceSweeper) { |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8041 gclog_or_tty->print_cr("end of sweep with _limit = " PTR_FORMAT "\n================", |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8042 _limit); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8043 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8044 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8045 #endif // PRODUCT |
| 0 | 8046 |
| 8047 void SweepClosure::initialize_free_range(HeapWord* freeFinger, | |
| 8048 bool freeRangeInFreeLists) { | |
| 8049 if (CMSTraceSweeper) { | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8050 gclog_or_tty->print("---- Start free range at 0x%x with free block (%d)\n", |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8051 freeFinger, freeRangeInFreeLists); |
| 0 | 8052 } |
| 8053 assert(!inFreeRange(), "Trampling existing free range"); | |
| 8054 set_inFreeRange(true); | |
| 8055 set_lastFreeRangeCoalesced(false); | |
| 8056 | |
| 8057 set_freeFinger(freeFinger); | |
| 8058 set_freeRangeInFreeLists(freeRangeInFreeLists); | |
| 8059 if (CMSTestInFreeList) { | |
| 8060 if (freeRangeInFreeLists) { | |
| 8061 FreeChunk* fc = (FreeChunk*) freeFinger; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8062 assert(fc->is_free(), "A chunk on the free list should be free."); |
| 0 | 8063 assert(fc->size() > 0, "Free range should have a size"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8064 assert(_sp->verify_chunk_in_free_list(fc), "Chunk is not in free lists"); |
| 0 | 8065 } |
| 8066 } | |
| 8067 } | |
| 8068 | |
| 8069 // Note that the sweeper runs concurrently with mutators. Thus, | |
| 8070 // it is possible for direct allocation in this generation to happen | |
| 8071 // in the middle of the sweep. Note that the sweeper also coalesces | |
| 8072 // contiguous free blocks. Thus, unless the sweeper and the allocator | |
| 8073 // synchronize appropriately freshly allocated blocks may get swept up. | |
| 8074 // This is accomplished by the sweeper locking the free lists while | |
| 8075 // it is sweeping. Thus blocks that are determined to be free are | |
| 8076 // indeed free. There is however one additional complication: | |
| 8077 // blocks that have been allocated since the final checkpoint and | |
| 8078 // mark, will not have been marked and so would be treated as | |
| 8079 // unreachable and swept up. To prevent this, the allocator marks | |
| 8080 // the bit map when allocating during the sweep phase. This leads, | |
| 8081 // however, to a further complication -- objects may have been allocated | |
| 8082 // but not yet initialized -- in the sense that the header isn't yet | |
| 8083 // installed. The sweeper can not then determine the size of the block | |
| 8084 // in order to skip over it. To deal with this case, we use a technique | |
| 8085 // (due to Printezis) to encode such uninitialized block sizes in the | |
| 8086 // bit map. Since the bit map uses a bit per every HeapWord, but the | |
| 8087 // CMS generation has a minimum object size of 3 HeapWords, it follows | |
| 8088 // that "normal marks" won't be adjacent in the bit map (there will | |
| 8089 // always be at least two 0 bits between successive 1 bits). We make use | |
| 8090 // of these "unused" bits to represent uninitialized blocks -- the bit | |
| 8091 // corresponding to the start of the uninitialized object and the next | |
| 8092 // bit are both set. Finally, a 1 bit marks the end of the object that | |
| 8093 // started with the two consecutive 1 bits to indicate its potentially | |
| 8094 // uninitialized state. | |
| 8095 | |
| 8096 size_t SweepClosure::do_blk_careful(HeapWord* addr) { | |
| 8097 FreeChunk* fc = (FreeChunk*)addr; | |
| 8098 size_t res; | |
| 8099 | |
|
1720
5ed703250bff
6977970: CMS: concurrentMarkSweepGeneration.cpp:7947 assert(addr <= _limit) failed: sweep invariant
ysr
parents:
1716
diff
changeset
|
8100 // Check if we are done sweeping. Below we check "addr >= _limit" rather |
|
5ed703250bff
6977970: CMS: concurrentMarkSweepGeneration.cpp:7947 assert(addr <= _limit) failed: sweep invariant
ysr
parents:
1716
diff
changeset
|
8101 // than "addr == _limit" because although _limit was a block boundary when |
|
5ed703250bff
6977970: CMS: concurrentMarkSweepGeneration.cpp:7947 assert(addr <= _limit) failed: sweep invariant
ysr
parents:
1716
diff
changeset
|
8102 // we started the sweep, it may no longer be one because heap expansion |
|
5ed703250bff
6977970: CMS: concurrentMarkSweepGeneration.cpp:7947 assert(addr <= _limit) failed: sweep invariant
ysr
parents:
1716
diff
changeset
|
8103 // may have caused us to coalesce the block ending at the address _limit |
|
5ed703250bff
6977970: CMS: concurrentMarkSweepGeneration.cpp:7947 assert(addr <= _limit) failed: sweep invariant
ysr
parents:
1716
diff
changeset
|
8104 // with a newly expanded chunk (this happens when _limit was set to the |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8105 // previous _end of the space), so we may have stepped past _limit: |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8106 // see the following Zeno-like trail of CRs 6977970, 7008136, 7042740. |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8107 if (addr >= _limit) { // we have swept up to or past the limit: finish up |
| 0 | 8108 assert(_limit >= _sp->bottom() && _limit <= _sp->end(), |
| 8109 "sweep _limit out of bounds"); | |
|
1720
5ed703250bff
6977970: CMS: concurrentMarkSweepGeneration.cpp:7947 assert(addr <= _limit) failed: sweep invariant
ysr
parents:
1716
diff
changeset
|
8110 assert(addr < _sp->end(), "addr out of bounds"); |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8111 // Flush any free range we might be holding as a single |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8112 // coalesced chunk to the appropriate free list. |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8113 if (inFreeRange()) { |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8114 assert(freeFinger() >= _sp->bottom() && freeFinger() < _limit, |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8115 err_msg("freeFinger() " PTR_FORMAT" is out-of-bounds", freeFinger())); |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8116 flush_cur_free_chunk(freeFinger(), |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8117 pointer_delta(addr, freeFinger())); |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8118 if (CMSTraceSweeper) { |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8119 gclog_or_tty->print("Sweep: last chunk: "); |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8120 gclog_or_tty->print("put_free_blk 0x%x ("SIZE_FORMAT") " |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8121 "[coalesced:"SIZE_FORMAT"]\n", |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8122 freeFinger(), pointer_delta(addr, freeFinger()), |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8123 lastFreeRangeCoalesced()); |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8124 } |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8125 } |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8126 |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8127 // help the iterator loop finish |
|
1720
5ed703250bff
6977970: CMS: concurrentMarkSweepGeneration.cpp:7947 assert(addr <= _limit) failed: sweep invariant
ysr
parents:
1716
diff
changeset
|
8128 return pointer_delta(_sp->end(), addr); |
|
5ed703250bff
6977970: CMS: concurrentMarkSweepGeneration.cpp:7947 assert(addr <= _limit) failed: sweep invariant
ysr
parents:
1716
diff
changeset
|
8129 } |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8130 |
|
1720
5ed703250bff
6977970: CMS: concurrentMarkSweepGeneration.cpp:7947 assert(addr <= _limit) failed: sweep invariant
ysr
parents:
1716
diff
changeset
|
8131 assert(addr < _limit, "sweep invariant"); |
| 0 | 8132 // check if we should yield |
| 8133 do_yield_check(addr); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8134 if (fc->is_free()) { |
| 0 | 8135 // Chunk that is already free |
| 8136 res = fc->size(); | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8137 do_already_free_chunk(fc); |
| 0 | 8138 debug_only(_sp->verifyFreeLists()); |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8139 // If we flush the chunk at hand in lookahead_and_flush() |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8140 // and it's coalesced with a preceding chunk, then the |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8141 // process of "mangling" the payload of the coalesced block |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8142 // will cause erasure of the size information from the |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8143 // (erstwhile) header of all the coalesced blocks but the |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8144 // first, so the first disjunct in the assert will not hold |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8145 // in that specific case (in which case the second disjunct |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8146 // will hold). |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8147 assert(res == fc->size() || ((HeapWord*)fc) + res >= _limit, |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8148 "Otherwise the size info doesn't change at this step"); |
| 0 | 8149 NOT_PRODUCT( |
| 8150 _numObjectsAlreadyFree++; | |
| 8151 _numWordsAlreadyFree += res; | |
| 8152 ) | |
| 8153 NOT_PRODUCT(_last_fc = fc;) | |
| 8154 } else if (!_bitMap->isMarked(addr)) { | |
| 8155 // Chunk is fresh garbage | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8156 res = do_garbage_chunk(fc); |
| 0 | 8157 debug_only(_sp->verifyFreeLists()); |
| 8158 NOT_PRODUCT( | |
| 8159 _numObjectsFreed++; | |
| 8160 _numWordsFreed += res; | |
| 8161 ) | |
| 8162 } else { | |
| 8163 // Chunk that is alive. | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8164 res = do_live_chunk(fc); |
| 0 | 8165 debug_only(_sp->verifyFreeLists()); |
| 8166 NOT_PRODUCT( | |
| 8167 _numObjectsLive++; | |
| 8168 _numWordsLive += res; | |
| 8169 ) | |
| 8170 } | |
| 8171 return res; | |
| 8172 } | |
| 8173 | |
| 8174 // For the smart allocation, record following | |
| 8175 // split deaths - a free chunk is removed from its free list because | |
| 8176 // it is being split into two or more chunks. | |
| 8177 // split birth - a free chunk is being added to its free list because | |
| 8178 // a larger free chunk has been split and resulted in this free chunk. | |
| 8179 // coal death - a free chunk is being removed from its free list because | |
| 8180 // it is being coalesced into a large free chunk. | |
| 8181 // coal birth - a free chunk is being added to its free list because | |
| 8182 // it was created when two or more free chunks where coalesced into | |
| 8183 // this free chunk. | |
| 8184 // | |
| 8185 // These statistics are used to determine the desired number of free | |
| 8186 // chunks of a given size. The desired number is chosen to be relative | |
| 8187 // to the end of a CMS sweep. The desired number at the end of a sweep | |
| 8188 // is the | |
| 8189 // count-at-end-of-previous-sweep (an amount that was enough) | |
| 8190 // - count-at-beginning-of-current-sweep (the excess) | |
| 8191 // + split-births (gains in this size during interval) | |
| 8192 // - split-deaths (demands on this size during interval) | |
| 8193 // where the interval is from the end of one sweep to the end of the | |
| 8194 // next. | |
| 8195 // | |
| 8196 // When sweeping the sweeper maintains an accumulated chunk which is | |
| 8197 // the chunk that is made up of chunks that have been coalesced. That | |
| 8198 // will be termed the left-hand chunk. A new chunk of garbage that | |
| 8199 // is being considered for coalescing will be referred to as the | |
| 8200 // right-hand chunk. | |
| 8201 // | |
| 8202 // When making a decision on whether to coalesce a right-hand chunk with | |
| 8203 // the current left-hand chunk, the current count vs. the desired count | |
| 8204 // of the left-hand chunk is considered. Also if the right-hand chunk | |
| 8205 // is near the large chunk at the end of the heap (see | |
| 8206 // ConcurrentMarkSweepGeneration::isNearLargestChunk()), then the | |
| 8207 // left-hand chunk is coalesced. | |
| 8208 // | |
| 8209 // When making a decision about whether to split a chunk, the desired count | |
| 8210 // vs. the current count of the candidate to be split is also considered. | |
| 8211 // If the candidate is underpopulated (currently fewer chunks than desired) | |
| 8212 // a chunk of an overpopulated (currently more chunks than desired) size may | |
| 8213 // be chosen. The "hint" associated with a free list, if non-null, points | |
| 8214 // to a free list which may be overpopulated. | |
| 8215 // | |
| 8216 | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8217 void SweepClosure::do_already_free_chunk(FreeChunk* fc) { |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8218 const size_t size = fc->size(); |
| 0 | 8219 // Chunks that cannot be coalesced are not in the |
| 8220 // free lists. | |
| 8221 if (CMSTestInFreeList && !fc->cantCoalesce()) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8222 assert(_sp->verify_chunk_in_free_list(fc), |
| 0 | 8223 "free chunk should be in free lists"); |
| 8224 } | |
| 8225 // a chunk that is already free, should not have been | |
| 8226 // marked in the bit map | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8227 HeapWord* const addr = (HeapWord*) fc; |
| 0 | 8228 assert(!_bitMap->isMarked(addr), "free chunk should be unmarked"); |
| 8229 // Verify that the bit map has no bits marked between | |
| 8230 // addr and purported end of this block. | |
| 8231 _bitMap->verifyNoOneBitsInRange(addr + 1, addr + size); | |
| 8232 | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8233 // Some chunks cannot be coalesced under any circumstances. |
| 0 | 8234 // See the definition of cantCoalesce(). |
| 8235 if (!fc->cantCoalesce()) { | |
| 8236 // This chunk can potentially be coalesced. | |
| 8237 if (_sp->adaptive_freelists()) { | |
| 8238 // All the work is done in | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8239 do_post_free_or_garbage_chunk(fc, size); |
| 0 | 8240 } else { // Not adaptive free lists |
| 8241 // this is a free chunk that can potentially be coalesced by the sweeper; | |
| 8242 if (!inFreeRange()) { | |
| 8243 // if the next chunk is a free block that can't be coalesced | |
| 8244 // it doesn't make sense to remove this chunk from the free lists | |
| 8245 FreeChunk* nextChunk = (FreeChunk*)(addr + size); | |
|
2136
c91cc404ca46
7011940: iCMS: SIGSEGV in SweepClosure::do_already_free_chunk(FreeChunk*)+0x360
ysr
parents:
2132
diff
changeset
|
8246 assert((HeapWord*)nextChunk <= _sp->end(), "Chunk size out of bounds?"); |
|
c91cc404ca46
7011940: iCMS: SIGSEGV in SweepClosure::do_already_free_chunk(FreeChunk*)+0x360
ysr
parents:
2132
diff
changeset
|
8247 if ((HeapWord*)nextChunk < _sp->end() && // There is another free chunk to the right ... |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8248 nextChunk->is_free() && // ... which is free... |
|
2136
c91cc404ca46
7011940: iCMS: SIGSEGV in SweepClosure::do_already_free_chunk(FreeChunk*)+0x360
ysr
parents:
2132
diff
changeset
|
8249 nextChunk->cantCoalesce()) { // ... but can't be coalesced |
| 0 | 8250 // nothing to do |
| 8251 } else { | |
| 8252 // Potentially the start of a new free range: | |
| 8253 // Don't eagerly remove it from the free lists. | |
| 8254 // No need to remove it if it will just be put | |
| 8255 // back again. (Also from a pragmatic point of view | |
| 8256 // if it is a free block in a region that is beyond | |
| 8257 // any allocated blocks, an assertion will fail) | |
| 8258 // Remember the start of a free run. | |
| 8259 initialize_free_range(addr, true); | |
| 8260 // end - can coalesce with next chunk | |
| 8261 } | |
| 8262 } else { | |
| 8263 // the midst of a free range, we are coalescing | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8264 print_free_block_coalesced(fc); |
| 0 | 8265 if (CMSTraceSweeper) { |
| 8266 gclog_or_tty->print(" -- pick up free block 0x%x (%d)\n", fc, size); | |
| 8267 } | |
| 8268 // remove it from the free lists | |
| 8269 _sp->removeFreeChunkFromFreeLists(fc); | |
| 8270 set_lastFreeRangeCoalesced(true); | |
| 8271 // If the chunk is being coalesced and the current free range is | |
| 8272 // in the free lists, remove the current free range so that it | |
| 8273 // will be returned to the free lists in its entirety - all | |
| 8274 // the coalesced pieces included. | |
| 8275 if (freeRangeInFreeLists()) { | |
| 8276 FreeChunk* ffc = (FreeChunk*) freeFinger(); | |
| 8277 assert(ffc->size() == pointer_delta(addr, freeFinger()), | |
| 8278 "Size of free range is inconsistent with chunk size."); | |
| 8279 if (CMSTestInFreeList) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8280 assert(_sp->verify_chunk_in_free_list(ffc), |
| 0 | 8281 "free range is not in free lists"); |
| 8282 } | |
| 8283 _sp->removeFreeChunkFromFreeLists(ffc); | |
| 8284 set_freeRangeInFreeLists(false); | |
| 8285 } | |
| 8286 } | |
| 8287 } | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8288 // Note that if the chunk is not coalescable (the else arm |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8289 // below), we unconditionally flush, without needing to do |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8290 // a "lookahead," as we do below. |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8291 if (inFreeRange()) lookahead_and_flush(fc, size); |
| 0 | 8292 } else { |
| 8293 // Code path common to both original and adaptive free lists. | |
| 8294 | |
| 8295 // cant coalesce with previous block; this should be treated | |
| 8296 // as the end of a free run if any | |
| 8297 if (inFreeRange()) { | |
| 8298 // we kicked some butt; time to pick up the garbage | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8299 assert(freeFinger() < addr, "freeFinger points too high"); |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8300 flush_cur_free_chunk(freeFinger(), pointer_delta(addr, freeFinger())); |
| 0 | 8301 } |
| 8302 // else, nothing to do, just continue | |
| 8303 } | |
| 8304 } | |
| 8305 | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8306 size_t SweepClosure::do_garbage_chunk(FreeChunk* fc) { |
| 0 | 8307 // This is a chunk of garbage. It is not in any free list. |
| 8308 // Add it to a free list or let it possibly be coalesced into | |
| 8309 // a larger chunk. | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8310 HeapWord* const addr = (HeapWord*) fc; |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8311 const size_t size = CompactibleFreeListSpace::adjustObjectSize(oop(addr)->size()); |
| 0 | 8312 |
| 8313 if (_sp->adaptive_freelists()) { | |
| 8314 // Verify that the bit map has no bits marked between | |
| 8315 // addr and purported end of just dead object. | |
| 8316 _bitMap->verifyNoOneBitsInRange(addr + 1, addr + size); | |
| 8317 | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8318 do_post_free_or_garbage_chunk(fc, size); |
| 0 | 8319 } else { |
| 8320 if (!inFreeRange()) { | |
| 8321 // start of a new free range | |
| 8322 assert(size > 0, "A free range should have a size"); | |
| 8323 initialize_free_range(addr, false); | |
| 8324 } else { | |
| 8325 // this will be swept up when we hit the end of the | |
| 8326 // free range | |
| 8327 if (CMSTraceSweeper) { | |
| 8328 gclog_or_tty->print(" -- pick up garbage 0x%x (%d) \n", fc, size); | |
| 8329 } | |
| 8330 // If the chunk is being coalesced and the current free range is | |
| 8331 // in the free lists, remove the current free range so that it | |
| 8332 // will be returned to the free lists in its entirety - all | |
| 8333 // the coalesced pieces included. | |
| 8334 if (freeRangeInFreeLists()) { | |
| 8335 FreeChunk* ffc = (FreeChunk*)freeFinger(); | |
| 8336 assert(ffc->size() == pointer_delta(addr, freeFinger()), | |
| 8337 "Size of free range is inconsistent with chunk size."); | |
| 8338 if (CMSTestInFreeList) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8339 assert(_sp->verify_chunk_in_free_list(ffc), |
| 0 | 8340 "free range is not in free lists"); |
| 8341 } | |
| 8342 _sp->removeFreeChunkFromFreeLists(ffc); | |
| 8343 set_freeRangeInFreeLists(false); | |
| 8344 } | |
| 8345 set_lastFreeRangeCoalesced(true); | |
| 8346 } | |
| 8347 // this will be swept up when we hit the end of the free range | |
| 8348 | |
| 8349 // Verify that the bit map has no bits marked between | |
| 8350 // addr and purported end of just dead object. | |
| 8351 _bitMap->verifyNoOneBitsInRange(addr + 1, addr + size); | |
| 8352 } | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8353 assert(_limit >= addr + size, |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8354 "A freshly garbage chunk can't possibly straddle over _limit"); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8355 if (inFreeRange()) lookahead_and_flush(fc, size); |
| 0 | 8356 return size; |
| 8357 } | |
| 8358 | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8359 size_t SweepClosure::do_live_chunk(FreeChunk* fc) { |
| 0 | 8360 HeapWord* addr = (HeapWord*) fc; |
| 8361 // The sweeper has just found a live object. Return any accumulated | |
| 8362 // left hand chunk to the free lists. | |
| 8363 if (inFreeRange()) { | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8364 assert(freeFinger() < addr, "freeFinger points too high"); |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8365 flush_cur_free_chunk(freeFinger(), pointer_delta(addr, freeFinger())); |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8366 } |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8367 |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8368 // This object is live: we'd normally expect this to be |
| 0 | 8369 // an oop, and like to assert the following: |
| 8370 // assert(oop(addr)->is_oop(), "live block should be an oop"); | |
| 8371 // However, as we commented above, this may be an object whose | |
| 8372 // header hasn't yet been initialized. | |
| 8373 size_t size; | |
| 8374 assert(_bitMap->isMarked(addr), "Tautology for this control point"); | |
| 8375 if (_bitMap->isMarked(addr + 1)) { | |
| 8376 // Determine the size from the bit map, rather than trying to | |
| 8377 // compute it from the object header. | |
| 8378 HeapWord* nextOneAddr = _bitMap->getNextMarkedWordAddress(addr + 2); | |
| 8379 size = pointer_delta(nextOneAddr + 1, addr); | |
| 8380 assert(size == CompactibleFreeListSpace::adjustObjectSize(size), | |
| 8381 "alignment problem"); | |
| 8382 | |
| 9152 | 8383 #ifdef ASSERT |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
8384 if (oop(addr)->klass_or_null() != NULL) { |
| 0 | 8385 // Ignore mark word because we are running concurrent with mutators |
| 8386 assert(oop(addr)->is_oop(true), "live block should be an oop"); | |
| 8387 assert(size == | |
| 8388 CompactibleFreeListSpace::adjustObjectSize(oop(addr)->size()), | |
| 8389 "P-mark and computed size do not agree"); | |
| 8390 } | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8391 #endif |
| 0 | 8392 |
| 8393 } else { | |
| 8394 // This should be an initialized object that's alive. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
8395 assert(oop(addr)->klass_or_null() != NULL, |
| 0 | 8396 "Should be an initialized object"); |
| 8397 // Ignore mark word because we are running concurrent with mutators | |
| 8398 assert(oop(addr)->is_oop(true), "live block should be an oop"); | |
| 8399 // Verify that the bit map has no bits marked between | |
| 8400 // addr and purported end of this block. | |
| 8401 size = CompactibleFreeListSpace::adjustObjectSize(oop(addr)->size()); | |
| 8402 assert(size >= 3, "Necessary for Printezis marks to work"); | |
| 8403 assert(!_bitMap->isMarked(addr+1), "Tautology for this control point"); | |
| 8404 DEBUG_ONLY(_bitMap->verifyNoOneBitsInRange(addr+2, addr+size);) | |
| 8405 } | |
| 8406 return size; | |
| 8407 } | |
| 8408 | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8409 void SweepClosure::do_post_free_or_garbage_chunk(FreeChunk* fc, |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8410 size_t chunkSize) { |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8411 // do_post_free_or_garbage_chunk() should only be called in the case |
|
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8412 // of the adaptive free list allocator. |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8413 const bool fcInFreeLists = fc->is_free(); |
| 0 | 8414 assert(_sp->adaptive_freelists(), "Should only be used in this case."); |
| 8415 assert((HeapWord*)fc <= _limit, "sweep invariant"); | |
| 8416 if (CMSTestInFreeList && fcInFreeLists) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8417 assert(_sp->verify_chunk_in_free_list(fc), "free chunk is not in free lists"); |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8418 } |
| 0 | 8419 |
| 8420 if (CMSTraceSweeper) { | |
| 8421 gclog_or_tty->print_cr(" -- pick up another chunk at 0x%x (%d)", fc, chunkSize); | |
| 8422 } | |
| 8423 | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8424 HeapWord* const fc_addr = (HeapWord*) fc; |
| 0 | 8425 |
| 8426 bool coalesce; | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8427 const size_t left = pointer_delta(fc_addr, freeFinger()); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8428 const size_t right = chunkSize; |
| 0 | 8429 switch (FLSCoalescePolicy) { |
| 8430 // numeric value forms a coalition aggressiveness metric | |
| 8431 case 0: { // never coalesce | |
| 8432 coalesce = false; | |
| 8433 break; | |
| 8434 } | |
| 8435 case 1: { // coalesce if left & right chunks on overpopulated lists | |
| 8436 coalesce = _sp->coalOverPopulated(left) && | |
| 8437 _sp->coalOverPopulated(right); | |
| 8438 break; | |
| 8439 } | |
| 8440 case 2: { // coalesce if left chunk on overpopulated list (default) | |
| 8441 coalesce = _sp->coalOverPopulated(left); | |
| 8442 break; | |
| 8443 } | |
| 8444 case 3: { // coalesce if left OR right chunk on overpopulated list | |
| 8445 coalesce = _sp->coalOverPopulated(left) || | |
| 8446 _sp->coalOverPopulated(right); | |
| 8447 break; | |
| 8448 } | |
| 8449 case 4: { // always coalesce | |
| 8450 coalesce = true; | |
| 8451 break; | |
| 8452 } | |
| 8453 default: | |
| 8454 ShouldNotReachHere(); | |
| 8455 } | |
| 8456 | |
| 8457 // Should the current free range be coalesced? | |
| 8458 // If the chunk is in a free range and either we decided to coalesce above | |
| 8459 // or the chunk is near the large block at the end of the heap | |
| 8460 // (isNearLargestChunk() returns true), then coalesce this chunk. | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8461 const bool doCoalesce = inFreeRange() |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8462 && (coalesce || _g->isNearLargestChunk(fc_addr)); |
| 0 | 8463 if (doCoalesce) { |
| 8464 // Coalesce the current free range on the left with the new | |
| 8465 // chunk on the right. If either is on a free list, | |
| 8466 // it must be removed from the list and stashed in the closure. | |
| 8467 if (freeRangeInFreeLists()) { | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8468 FreeChunk* const ffc = (FreeChunk*)freeFinger(); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8469 assert(ffc->size() == pointer_delta(fc_addr, freeFinger()), |
| 0 | 8470 "Size of free range is inconsistent with chunk size."); |
| 8471 if (CMSTestInFreeList) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8472 assert(_sp->verify_chunk_in_free_list(ffc), |
| 0 | 8473 "Chunk is not in free lists"); |
| 8474 } | |
| 8475 _sp->coalDeath(ffc->size()); | |
| 8476 _sp->removeFreeChunkFromFreeLists(ffc); | |
| 8477 set_freeRangeInFreeLists(false); | |
| 8478 } | |
| 8479 if (fcInFreeLists) { | |
| 8480 _sp->coalDeath(chunkSize); | |
| 8481 assert(fc->size() == chunkSize, | |
| 8482 "The chunk has the wrong size or is not in the free lists"); | |
| 8483 _sp->removeFreeChunkFromFreeLists(fc); | |
| 8484 } | |
| 8485 set_lastFreeRangeCoalesced(true); | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8486 print_free_block_coalesced(fc); |
| 0 | 8487 } else { // not in a free range and/or should not coalesce |
| 8488 // Return the current free range and start a new one. | |
| 8489 if (inFreeRange()) { | |
| 8490 // In a free range but cannot coalesce with the right hand chunk. | |
| 8491 // Put the current free range into the free lists. | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8492 flush_cur_free_chunk(freeFinger(), |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8493 pointer_delta(fc_addr, freeFinger())); |
| 0 | 8494 } |
| 8495 // Set up for new free range. Pass along whether the right hand | |
| 8496 // chunk is in the free lists. | |
| 8497 initialize_free_range((HeapWord*)fc, fcInFreeLists); | |
| 8498 } | |
| 8499 } | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8500 |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8501 // Lookahead flush: |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8502 // If we are tracking a free range, and this is the last chunk that |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8503 // we'll look at because its end crosses past _limit, we'll preemptively |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8504 // flush it along with any free range we may be holding on to. Note that |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8505 // this can be the case only for an already free or freshly garbage |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8506 // chunk. If this block is an object, it can never straddle |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8507 // over _limit. The "straddling" occurs when _limit is set at |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8508 // the previous end of the space when this cycle started, and |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8509 // a subsequent heap expansion caused the previously co-terminal |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8510 // free block to be coalesced with the newly expanded portion, |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8511 // thus rendering _limit a non-block-boundary making it dangerous |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8512 // for the sweeper to step over and examine. |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8513 void SweepClosure::lookahead_and_flush(FreeChunk* fc, size_t chunk_size) { |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8514 assert(inFreeRange(), "Should only be called if currently in a free range."); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8515 HeapWord* const eob = ((HeapWord*)fc) + chunk_size; |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8516 assert(_sp->used_region().contains(eob - 1), |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8517 err_msg("eob = " PTR_FORMAT " out of bounds wrt _sp = [" PTR_FORMAT "," PTR_FORMAT ")" |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8518 " when examining fc = " PTR_FORMAT "(" SIZE_FORMAT ")", |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8519 _limit, _sp->bottom(), _sp->end(), fc, chunk_size)); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8520 if (eob >= _limit) { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8521 assert(eob == _limit || fc->is_free(), "Only a free chunk should allow us to cross over the limit"); |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8522 if (CMSTraceSweeper) { |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8523 gclog_or_tty->print_cr("_limit " PTR_FORMAT " reached or crossed by block " |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8524 "[" PTR_FORMAT "," PTR_FORMAT ") in space " |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8525 "[" PTR_FORMAT "," PTR_FORMAT ")", |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8526 _limit, fc, eob, _sp->bottom(), _sp->end()); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8527 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8528 // Return the storage we are tracking back into the free lists. |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8529 if (CMSTraceSweeper) { |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8530 gclog_or_tty->print_cr("Flushing ... "); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8531 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8532 assert(freeFinger() < eob, "Error"); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8533 flush_cur_free_chunk( freeFinger(), pointer_delta(eob, freeFinger())); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8534 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8535 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8536 |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8537 void SweepClosure::flush_cur_free_chunk(HeapWord* chunk, size_t size) { |
| 0 | 8538 assert(inFreeRange(), "Should only be called if currently in a free range."); |
| 8539 assert(size > 0, | |
| 8540 "A zero sized chunk cannot be added to the free lists."); | |
| 8541 if (!freeRangeInFreeLists()) { | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8542 if (CMSTestInFreeList) { |
| 0 | 8543 FreeChunk* fc = (FreeChunk*) chunk; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8544 fc->set_size(size); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8545 assert(!_sp->verify_chunk_in_free_list(fc), |
| 0 | 8546 "chunk should not be in free lists yet"); |
| 8547 } | |
| 8548 if (CMSTraceSweeper) { | |
| 8549 gclog_or_tty->print_cr(" -- add free block 0x%x (%d) to free lists", | |
| 8550 chunk, size); | |
| 8551 } | |
| 8552 // A new free range is going to be starting. The current | |
| 8553 // free range has not been added to the free lists yet or | |
| 8554 // was removed so add it back. | |
| 8555 // If the current free range was coalesced, then the death | |
| 8556 // of the free range was recorded. Record a birth now. | |
| 8557 if (lastFreeRangeCoalesced()) { | |
| 8558 _sp->coalBirth(size); | |
| 8559 } | |
| 8560 _sp->addChunkAndRepairOffsetTable(chunk, size, | |
| 8561 lastFreeRangeCoalesced()); | |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8562 } else if (CMSTraceSweeper) { |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8563 gclog_or_tty->print_cr("Already in free list: nothing to flush"); |
| 0 | 8564 } |
| 8565 set_inFreeRange(false); | |
| 8566 set_freeRangeInFreeLists(false); | |
| 8567 } | |
| 8568 | |
| 8569 // We take a break if we've been at this for a while, | |
| 8570 // so as to avoid monopolizing the locks involved. | |
| 8571 void SweepClosure::do_yield_work(HeapWord* addr) { | |
| 8572 // Return current free chunk being used for coalescing (if any) | |
| 8573 // to the appropriate freelist. After yielding, the next | |
| 8574 // free block encountered will start a coalescing range of | |
| 8575 // free blocks. If the next free block is adjacent to the | |
| 8576 // chunk just flushed, they will need to wait for the next | |
| 8577 // sweep to be coalesced. | |
| 8578 if (inFreeRange()) { | |
|
2132
4947ee68d19c
7008136: CMS: assert((HeapWord*)nextChunk <= _limit) failed: sweep invariant
ysr
parents:
1994
diff
changeset
|
8579 flush_cur_free_chunk(freeFinger(), pointer_delta(addr, freeFinger())); |
| 0 | 8580 } |
| 8581 | |
| 8582 // First give up the locks, then yield, then re-lock. | |
| 8583 // We should probably use a constructor/destructor idiom to | |
| 8584 // do this unlock/lock or modify the MutexUnlocker class to | |
| 8585 // serve our purpose. XXX | |
| 8586 assert_lock_strong(_bitMap->lock()); | |
| 8587 assert_lock_strong(_freelistLock); | |
| 8588 assert(ConcurrentMarkSweepThread::cms_thread_has_cms_token(), | |
| 8589 "CMS thread should hold CMS token"); | |
| 8590 _bitMap->lock()->unlock(); | |
| 8591 _freelistLock->unlock(); | |
| 8592 ConcurrentMarkSweepThread::desynchronize(true); | |
| 8593 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 8594 _collector->stopTimer(); | |
| 8595 GCPauseTimer p(_collector->size_policy()->concurrent_timer_ptr()); | |
| 8596 if (PrintCMSStatistics != 0) { | |
| 8597 _collector->incrementYields(); | |
| 8598 } | |
| 8599 _collector->icms_wait(); | |
| 8600 | |
| 8601 // See the comment in coordinator_yield() | |
| 8602 for (unsigned i = 0; i < CMSYieldSleepCount && | |
| 8603 ConcurrentMarkSweepThread::should_yield() && | |
| 8604 !CMSCollector::foregroundGCIsActive(); ++i) { | |
| 8605 os::sleep(Thread::current(), 1, false); | |
| 8606 ConcurrentMarkSweepThread::acknowledge_yield_request(); | |
| 8607 } | |
| 8608 | |
| 8609 ConcurrentMarkSweepThread::synchronize(true); | |
| 8610 _freelistLock->lock(); | |
| 8611 _bitMap->lock()->lock_without_safepoint_check(); | |
| 8612 _collector->startTimer(); | |
| 8613 } | |
| 8614 | |
| 8615 #ifndef PRODUCT | |
| 8616 // This is actually very useful in a product build if it can | |
| 8617 // be called from the debugger. Compile it into the product | |
| 8618 // as needed. | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8619 bool debug_verify_chunk_in_free_list(FreeChunk* fc) { |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
8620 return debug_cms_space->verify_chunk_in_free_list(fc); |
| 0 | 8621 } |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8622 #endif |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8623 |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8624 void SweepClosure::print_free_block_coalesced(FreeChunk* fc) const { |
| 0 | 8625 if (CMSTraceSweeper) { |
|
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8626 gclog_or_tty->print_cr("Sweep:coal_free_blk " PTR_FORMAT " (" SIZE_FORMAT ")", |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8627 fc, fc->size()); |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8628 } |
|
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
3356
diff
changeset
|
8629 } |
| 0 | 8630 |
| 8631 // CMSIsAliveClosure | |
| 8632 bool CMSIsAliveClosure::do_object_b(oop obj) { | |
| 8633 HeapWord* addr = (HeapWord*)obj; | |
| 8634 return addr != NULL && | |
| 8635 (!_span.contains(addr) || _bit_map->isMarked(addr)); | |
| 8636 } | |
| 8637 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
8638 |
| 935 | 8639 CMSKeepAliveClosure::CMSKeepAliveClosure( CMSCollector* collector, |
| 8640 MemRegion span, | |
| 8641 CMSBitMap* bit_map, CMSMarkStack* mark_stack, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
8642 bool cpc): |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
8643 _collector(collector), |
| 935 | 8644 _span(span), |
| 8645 _bit_map(bit_map), | |
| 8646 _mark_stack(mark_stack), | |
| 8647 _concurrent_precleaning(cpc) { | |
| 8648 assert(!_span.is_empty(), "Empty span could spell trouble"); | |
| 8649 } | |
| 8650 | |
| 8651 | |
| 0 | 8652 // CMSKeepAliveClosure: the serial version |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8653 void CMSKeepAliveClosure::do_oop(oop obj) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8654 HeapWord* addr = (HeapWord*)obj; |
| 0 | 8655 if (_span.contains(addr) && |
| 8656 !_bit_map->isMarked(addr)) { | |
| 8657 _bit_map->mark(addr); | |
| 8658 bool simulate_overflow = false; | |
| 8659 NOT_PRODUCT( | |
| 8660 if (CMSMarkStackOverflowALot && | |
| 8661 _collector->simulate_overflow()) { | |
| 8662 // simulate a stack overflow | |
| 8663 simulate_overflow = true; | |
| 8664 } | |
| 8665 ) | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8666 if (simulate_overflow || !_mark_stack->push(obj)) { |
|
452
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8667 if (_concurrent_precleaning) { |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8668 // We dirty the overflown object and let the remark |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8669 // phase deal with it. |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8670 assert(_collector->overflow_list_is_empty(), "Error"); |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8671 // In the case of object arrays, we need to dirty all of |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8672 // the cards that the object spans. No locking or atomics |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8673 // are needed since no one else can be mutating the mod union |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8674 // table. |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8675 if (obj->is_objArray()) { |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8676 size_t sz = obj->size(); |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8677 HeapWord* end_card_addr = |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8678 (HeapWord*)round_to((intptr_t)(addr+sz), CardTableModRefBS::card_size); |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8679 MemRegion redirty_range = MemRegion(addr, end_card_addr); |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8680 assert(!redirty_range.is_empty(), "Arithmetical tautology"); |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8681 _collector->_modUnionTable.mark_range(redirty_range); |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8682 } else { |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8683 _collector->_modUnionTable.mark(addr); |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8684 } |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8685 _collector->_ser_kac_preclean_ovflw++; |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8686 } else { |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8687 _collector->push_on_overflow_list(obj); |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8688 _collector->_ser_kac_ovflw++; |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8689 } |
| 0 | 8690 } |
| 8691 } | |
| 8692 } | |
| 8693 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8694 void CMSKeepAliveClosure::do_oop(oop* p) { CMSKeepAliveClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8695 void CMSKeepAliveClosure::do_oop(narrowOop* p) { CMSKeepAliveClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8696 |
| 0 | 8697 // CMSParKeepAliveClosure: a parallel version of the above. |
| 8698 // The work queues are private to each closure (thread), | |
| 8699 // but (may be) available for stealing by other threads. | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8700 void CMSParKeepAliveClosure::do_oop(oop obj) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8701 HeapWord* addr = (HeapWord*)obj; |
| 0 | 8702 if (_span.contains(addr) && |
| 8703 !_bit_map->isMarked(addr)) { | |
| 8704 // In general, during recursive tracing, several threads | |
| 8705 // may be concurrently getting here; the first one to | |
| 8706 // "tag" it, claims it. | |
| 8707 if (_bit_map->par_mark(addr)) { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8708 bool res = _work_queue->push(obj); |
| 0 | 8709 assert(res, "Low water mark should be much less than capacity"); |
| 8710 // Do a recursive trim in the hope that this will keep | |
| 8711 // stack usage lower, but leave some oops for potential stealers | |
| 8712 trim_queue(_low_water_mark); | |
| 8713 } // Else, another thread got there first | |
| 8714 } | |
| 8715 } | |
| 8716 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8717 void CMSParKeepAliveClosure::do_oop(oop* p) { CMSParKeepAliveClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8718 void CMSParKeepAliveClosure::do_oop(narrowOop* p) { CMSParKeepAliveClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8719 |
| 0 | 8720 void CMSParKeepAliveClosure::trim_queue(uint max) { |
| 8721 while (_work_queue->size() > max) { | |
| 8722 oop new_oop; | |
| 8723 if (_work_queue->pop_local(new_oop)) { | |
| 8724 assert(new_oop != NULL && new_oop->is_oop(), "Expected an oop"); | |
| 8725 assert(_bit_map->isMarked((HeapWord*)new_oop), | |
| 8726 "no white objects on this stack!"); | |
| 8727 assert(_span.contains((HeapWord*)new_oop), "Out of bounds oop"); | |
| 8728 // iterate over the oops in this oop, marking and pushing | |
| 8729 // the ones in CMS heap (i.e. in _span). | |
| 8730 new_oop->oop_iterate(&_mark_and_push); | |
| 8731 } | |
| 8732 } | |
| 8733 } | |
| 8734 | |
| 935 | 8735 CMSInnerParMarkAndPushClosure::CMSInnerParMarkAndPushClosure( |
| 8736 CMSCollector* collector, | |
| 8737 MemRegion span, CMSBitMap* bit_map, | |
| 8738 OopTaskQueue* work_queue): | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
8739 _collector(collector), |
| 935 | 8740 _span(span), |
| 8741 _bit_map(bit_map), | |
| 8742 _work_queue(work_queue) { } | |
| 8743 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8744 void CMSInnerParMarkAndPushClosure::do_oop(oop obj) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8745 HeapWord* addr = (HeapWord*)obj; |
| 0 | 8746 if (_span.contains(addr) && |
| 8747 !_bit_map->isMarked(addr)) { | |
| 8748 if (_bit_map->par_mark(addr)) { | |
| 8749 bool simulate_overflow = false; | |
| 8750 NOT_PRODUCT( | |
| 8751 if (CMSMarkStackOverflowALot && | |
| 8752 _collector->par_simulate_overflow()) { | |
| 8753 // simulate a stack overflow | |
| 8754 simulate_overflow = true; | |
| 8755 } | |
| 8756 ) | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8757 if (simulate_overflow || !_work_queue->push(obj)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8758 _collector->par_push_on_overflow_list(obj); |
| 0 | 8759 _collector->_par_kac_ovflw++; |
| 8760 } | |
| 8761 } // Else another thread got there already | |
| 8762 } | |
| 8763 } | |
| 8764 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8765 void CMSInnerParMarkAndPushClosure::do_oop(oop* p) { CMSInnerParMarkAndPushClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8766 void CMSInnerParMarkAndPushClosure::do_oop(narrowOop* p) { CMSInnerParMarkAndPushClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8767 |
| 0 | 8768 ////////////////////////////////////////////////////////////////// |
| 8769 // CMSExpansionCause ///////////////////////////// | |
| 8770 ////////////////////////////////////////////////////////////////// | |
| 8771 const char* CMSExpansionCause::to_string(CMSExpansionCause::Cause cause) { | |
| 8772 switch (cause) { | |
| 8773 case _no_expansion: | |
| 8774 return "No expansion"; | |
| 8775 case _satisfy_free_ratio: | |
| 8776 return "Free ratio"; | |
| 8777 case _satisfy_promotion: | |
| 8778 return "Satisfy promotion"; | |
| 8779 case _satisfy_allocation: | |
| 8780 return "allocation"; | |
| 8781 case _allocate_par_lab: | |
| 8782 return "Par LAB"; | |
| 8783 case _allocate_par_spooling_space: | |
| 8784 return "Par Spooling Space"; | |
| 8785 case _adaptive_size_policy: | |
| 8786 return "Ergonomics"; | |
| 8787 default: | |
| 8788 return "unknown"; | |
| 8789 } | |
| 8790 } | |
| 8791 | |
| 8792 void CMSDrainMarkingStackClosure::do_void() { | |
| 8793 // the max number to take from overflow list at a time | |
| 8794 const size_t num = _mark_stack->capacity()/4; | |
|
452
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8795 assert(!_concurrent_precleaning || _collector->overflow_list_is_empty(), |
|
00b023ae2d78
6722113: CMS: Incorrect overflow handling during precleaning of Reference lists
ysr
parents:
360
diff
changeset
|
8796 "Overflow list should be NULL during concurrent phases"); |
| 0 | 8797 while (!_mark_stack->isEmpty() || |
| 8798 // if stack is empty, check the overflow list | |
| 8799 _collector->take_from_overflow_list(num, _mark_stack)) { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8800 oop obj = _mark_stack->pop(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8801 HeapWord* addr = (HeapWord*)obj; |
| 0 | 8802 assert(_span.contains(addr), "Should be within span"); |
| 8803 assert(_bit_map->isMarked(addr), "Should be marked"); | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8804 assert(obj->is_oop(), "Should be an oop"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
94
diff
changeset
|
8805 obj->oop_iterate(_keep_alive); |
| 0 | 8806 } |
| 8807 } | |
| 8808 | |
| 8809 void CMSParDrainMarkingStackClosure::do_void() { | |
| 8810 // drain queue | |
| 8811 trim_queue(0); | |
| 8812 } | |
| 8813 | |
| 8814 // Trim our work_queue so its length is below max at return | |
| 8815 void CMSParDrainMarkingStackClosure::trim_queue(uint max) { | |
| 8816 while (_work_queue->size() > max) { | |
| 8817 oop new_oop; | |
| 8818 if (_work_queue->pop_local(new_oop)) { | |
| 8819 assert(new_oop->is_oop(), "Expected an oop"); | |
| 8820 assert(_bit_map->isMarked((HeapWord*)new_oop), | |
| 8821 "no white objects on this stack!"); | |
| 8822 assert(_span.contains((HeapWord*)new_oop), "Out of bounds oop"); | |
| 8823 // iterate over the oops in this oop, marking and pushing | |
| 8824 // the ones in CMS heap (i.e. in _span). | |
| 8825 new_oop->oop_iterate(&_mark_and_push); | |
| 8826 } | |
| 8827 } | |
| 8828 } | |
| 8829 | |
| 8830 //////////////////////////////////////////////////////////////////// | |
| 8831 // Support for Marking Stack Overflow list handling and related code | |
| 8832 //////////////////////////////////////////////////////////////////// | |
| 8833 // Much of the following code is similar in shape and spirit to the | |
| 8834 // code used in ParNewGC. We should try and share that code | |
| 8835 // as much as possible in the future. | |
| 8836 | |
| 8837 #ifndef PRODUCT | |
| 8838 // Debugging support for CMSStackOverflowALot | |
| 8839 | |
| 8840 // It's OK to call this multi-threaded; the worst thing | |
| 8841 // that can happen is that we'll get a bunch of closely | |
| 8842 // spaced simulated oveflows, but that's OK, in fact | |
| 8843 // probably good as it would exercise the overflow code | |
| 8844 // under contention. | |
| 8845 bool CMSCollector::simulate_overflow() { | |
| 8846 if (_overflow_counter-- <= 0) { // just being defensive | |
| 8847 _overflow_counter = CMSMarkStackOverflowInterval; | |
| 8848 return true; | |
| 8849 } else { | |
| 8850 return false; | |
| 8851 } | |
| 8852 } | |
| 8853 | |
| 8854 bool CMSCollector::par_simulate_overflow() { | |
| 8855 return simulate_overflow(); | |
| 8856 } | |
| 8857 #endif | |
| 8858 | |
| 8859 // Single-threaded | |
| 8860 bool CMSCollector::take_from_overflow_list(size_t num, CMSMarkStack* stack) { | |
| 8861 assert(stack->isEmpty(), "Expected precondition"); | |
| 8862 assert(stack->capacity() > num, "Shouldn't bite more than can chew"); | |
| 8863 size_t i = num; | |
| 8864 oop cur = _overflow_list; | |
| 8865 const markOop proto = markOopDesc::prototype(); | |
| 534 | 8866 NOT_PRODUCT(ssize_t n = 0;) |
| 0 | 8867 for (oop next; i > 0 && cur != NULL; cur = next, i--) { |
| 8868 next = oop(cur->mark()); | |
| 8869 cur->set_mark(proto); // until proven otherwise | |
| 8870 assert(cur->is_oop(), "Should be an oop"); | |
| 8871 bool res = stack->push(cur); | |
| 8872 assert(res, "Bit off more than can chew?"); | |
| 8873 NOT_PRODUCT(n++;) | |
| 8874 } | |
| 8875 _overflow_list = cur; | |
| 8876 #ifndef PRODUCT | |
| 8877 assert(_num_par_pushes >= n, "Too many pops?"); | |
| 8878 _num_par_pushes -=n; | |
| 8879 #endif | |
| 8880 return !stack->isEmpty(); | |
| 8881 } | |
| 8882 | |
| 534 | 8883 #define BUSY (oop(0x1aff1aff)) |
| 8884 // (MT-safe) Get a prefix of at most "num" from the list. | |
| 8885 // The overflow list is chained through the mark word of | |
| 8886 // each object in the list. We fetch the entire list, | |
| 8887 // break off a prefix of the right size and return the | |
| 8888 // remainder. If other threads try to take objects from | |
| 8889 // the overflow list at that time, they will wait for | |
| 8890 // some time to see if data becomes available. If (and | |
| 8891 // only if) another thread places one or more object(s) | |
| 8892 // on the global list before we have returned the suffix | |
| 8893 // to the global list, we will walk down our local list | |
| 8894 // to find its end and append the global list to | |
| 8895 // our suffix before returning it. This suffix walk can | |
| 8896 // prove to be expensive (quadratic in the amount of traffic) | |
| 8897 // when there are many objects in the overflow list and | |
| 8898 // there is much producer-consumer contention on the list. | |
| 8899 // *NOTE*: The overflow list manipulation code here and | |
| 8900 // in ParNewGeneration:: are very similar in shape, | |
| 8901 // except that in the ParNew case we use the old (from/eden) | |
| 8902 // copy of the object to thread the list via its klass word. | |
| 8903 // Because of the common code, if you make any changes in | |
| 8904 // the code below, please check the ParNew version to see if | |
| 8905 // similar changes might be needed. | |
| 8906 // CR 6797058 has been filed to consolidate the common code. | |
| 0 | 8907 bool CMSCollector::par_take_from_overflow_list(size_t num, |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
8908 OopTaskQueue* work_q, |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
8909 int no_of_gc_threads) { |
| 534 | 8910 assert(work_q->size() == 0, "First empty local work queue"); |
| 0 | 8911 assert(num < work_q->max_elems(), "Can't bite more than we can chew"); |
| 8912 if (_overflow_list == NULL) { | |
| 8913 return false; | |
| 8914 } | |
| 8915 // Grab the entire list; we'll put back a suffix | |
| 534 | 8916 oop prefix = (oop)Atomic::xchg_ptr(BUSY, &_overflow_list); |
| 8917 Thread* tid = Thread::current(); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
8918 // Before "no_of_gc_threads" was introduced CMSOverflowSpinCount was |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
8919 // set to ParallelGCThreads. |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
8920 size_t CMSOverflowSpinCount = (size_t) no_of_gc_threads; // was ParallelGCThreads; |
| 534 | 8921 size_t sleep_time_millis = MAX2((size_t)1, num/100); |
| 8922 // If the list is busy, we spin for a short while, | |
| 8923 // sleeping between attempts to get the list. | |
| 8924 for (size_t spin = 0; prefix == BUSY && spin < CMSOverflowSpinCount; spin++) { | |
| 8925 os::sleep(tid, sleep_time_millis, false); | |
| 8926 if (_overflow_list == NULL) { | |
| 8927 // Nothing left to take | |
| 8928 return false; | |
| 8929 } else if (_overflow_list != BUSY) { | |
| 8930 // Try and grab the prefix | |
| 8931 prefix = (oop)Atomic::xchg_ptr(BUSY, &_overflow_list); | |
| 8932 } | |
| 8933 } | |
| 8934 // If the list was found to be empty, or we spun long | |
| 8935 // enough, we give up and return empty-handed. If we leave | |
| 8936 // the list in the BUSY state below, it must be the case that | |
| 8937 // some other thread holds the overflow list and will set it | |
| 8938 // to a non-BUSY state in the future. | |
| 8939 if (prefix == NULL || prefix == BUSY) { | |
| 8940 // Nothing to take or waited long enough | |
| 8941 if (prefix == NULL) { | |
| 8942 // Write back the NULL in case we overwrote it with BUSY above | |
| 8943 // and it is still the same value. | |
| 8944 (void) Atomic::cmpxchg_ptr(NULL, &_overflow_list, BUSY); | |
| 8945 } | |
| 8946 return false; | |
| 8947 } | |
| 8948 assert(prefix != NULL && prefix != BUSY, "Error"); | |
| 0 | 8949 size_t i = num; |
| 8950 oop cur = prefix; | |
| 534 | 8951 // Walk down the first "num" objects, unless we reach the end. |
| 0 | 8952 for (; i > 1 && cur->mark() != NULL; cur = oop(cur->mark()), i--); |
| 534 | 8953 if (cur->mark() == NULL) { |
| 8954 // We have "num" or fewer elements in the list, so there | |
| 8955 // is nothing to return to the global list. | |
| 8956 // Write back the NULL in lieu of the BUSY we wrote | |
| 8957 // above, if it is still the same value. | |
| 8958 if (_overflow_list == BUSY) { | |
| 8959 (void) Atomic::cmpxchg_ptr(NULL, &_overflow_list, BUSY); | |
| 8960 } | |
| 8961 } else { | |
| 8962 // Chop off the suffix and rerturn it to the global list. | |
| 8963 assert(cur->mark() != BUSY, "Error"); | |
| 0 | 8964 oop suffix_head = cur->mark(); // suffix will be put back on global list |
| 8965 cur->set_mark(NULL); // break off suffix | |
| 534 | 8966 // It's possible that the list is still in the empty(busy) state |
| 8967 // we left it in a short while ago; in that case we may be | |
| 8968 // able to place back the suffix without incurring the cost | |
| 8969 // of a walk down the list. | |
| 0 | 8970 oop observed_overflow_list = _overflow_list; |
| 534 | 8971 oop cur_overflow_list = observed_overflow_list; |
| 8972 bool attached = false; | |
| 8973 while (observed_overflow_list == BUSY || observed_overflow_list == NULL) { | |
| 0 | 8974 observed_overflow_list = |
| 534 | 8975 (oop) Atomic::cmpxchg_ptr(suffix_head, &_overflow_list, cur_overflow_list); |
| 8976 if (cur_overflow_list == observed_overflow_list) { | |
| 8977 attached = true; | |
| 8978 break; | |
| 8979 } else cur_overflow_list = observed_overflow_list; | |
| 8980 } | |
| 8981 if (!attached) { | |
| 8982 // Too bad, someone else sneaked in (at least) an element; we'll need | |
| 8983 // to do a splice. Find tail of suffix so we can prepend suffix to global | |
| 8984 // list. | |
| 8985 for (cur = suffix_head; cur->mark() != NULL; cur = (oop)(cur->mark())); | |
| 8986 oop suffix_tail = cur; | |
| 8987 assert(suffix_tail != NULL && suffix_tail->mark() == NULL, | |
| 8988 "Tautology"); | |
| 8989 observed_overflow_list = _overflow_list; | |
| 8990 do { | |
| 8991 cur_overflow_list = observed_overflow_list; | |
| 8992 if (cur_overflow_list != BUSY) { | |
| 8993 // Do the splice ... | |
| 8994 suffix_tail->set_mark(markOop(cur_overflow_list)); | |
| 8995 } else { // cur_overflow_list == BUSY | |
| 8996 suffix_tail->set_mark(NULL); | |
| 8997 } | |
| 8998 // ... and try to place spliced list back on overflow_list ... | |
| 8999 observed_overflow_list = | |
| 9000 (oop) Atomic::cmpxchg_ptr(suffix_head, &_overflow_list, cur_overflow_list); | |
| 9001 } while (cur_overflow_list != observed_overflow_list); | |
| 9002 // ... until we have succeeded in doing so. | |
| 9003 } | |
| 0 | 9004 } |
| 9005 | |
| 9006 // Push the prefix elements on work_q | |
| 9007 assert(prefix != NULL, "control point invariant"); | |
| 9008 const markOop proto = markOopDesc::prototype(); | |
| 9009 oop next; | |
| 534 | 9010 NOT_PRODUCT(ssize_t n = 0;) |
| 0 | 9011 for (cur = prefix; cur != NULL; cur = next) { |
| 9012 next = oop(cur->mark()); | |
| 9013 cur->set_mark(proto); // until proven otherwise | |
| 9014 assert(cur->is_oop(), "Should be an oop"); | |
| 9015 bool res = work_q->push(cur); | |
| 9016 assert(res, "Bit off more than we can chew?"); | |
| 9017 NOT_PRODUCT(n++;) | |
| 9018 } | |
| 9019 #ifndef PRODUCT | |
| 9020 assert(_num_par_pushes >= n, "Too many pops?"); | |
| 9021 Atomic::add_ptr(-(intptr_t)n, &_num_par_pushes); | |
| 9022 #endif | |
| 9023 return true; | |
| 9024 } | |
| 9025 | |
| 9026 // Single-threaded | |
| 9027 void CMSCollector::push_on_overflow_list(oop p) { | |
| 9028 NOT_PRODUCT(_num_par_pushes++;) | |
| 9029 assert(p->is_oop(), "Not an oop"); | |
| 9030 preserve_mark_if_necessary(p); | |
| 9031 p->set_mark((markOop)_overflow_list); | |
| 9032 _overflow_list = p; | |
| 9033 } | |
| 9034 | |
| 9035 // Multi-threaded; use CAS to prepend to overflow list | |
| 9036 void CMSCollector::par_push_on_overflow_list(oop p) { | |
| 9037 NOT_PRODUCT(Atomic::inc_ptr(&_num_par_pushes);) | |
| 9038 assert(p->is_oop(), "Not an oop"); | |
| 9039 par_preserve_mark_if_necessary(p); | |
| 9040 oop observed_overflow_list = _overflow_list; | |
| 9041 oop cur_overflow_list; | |
| 9042 do { | |
| 9043 cur_overflow_list = observed_overflow_list; | |
| 534 | 9044 if (cur_overflow_list != BUSY) { |
| 9045 p->set_mark(markOop(cur_overflow_list)); | |
| 9046 } else { | |
| 9047 p->set_mark(NULL); | |
| 9048 } | |
| 0 | 9049 observed_overflow_list = |
| 9050 (oop) Atomic::cmpxchg_ptr(p, &_overflow_list, cur_overflow_list); | |
| 9051 } while (cur_overflow_list != observed_overflow_list); | |
| 9052 } | |
| 534 | 9053 #undef BUSY |
| 0 | 9054 |
| 9055 // Single threaded | |
| 9056 // General Note on GrowableArray: pushes may silently fail | |
| 9057 // because we are (temporarily) out of C-heap for expanding | |
| 9058 // the stack. The problem is quite ubiquitous and affects | |
| 9059 // a lot of code in the JVM. The prudent thing for GrowableArray | |
| 9060 // to do (for now) is to exit with an error. However, that may | |
| 9061 // be too draconian in some cases because the caller may be | |
| 534 | 9062 // able to recover without much harm. For such cases, we |
| 0 | 9063 // should probably introduce a "soft_push" method which returns |
| 9064 // an indication of success or failure with the assumption that | |
| 9065 // the caller may be able to recover from a failure; code in | |
| 9066 // the VM can then be changed, incrementally, to deal with such | |
| 9067 // failures where possible, thus, incrementally hardening the VM | |
| 9068 // in such low resource situations. | |
| 9069 void CMSCollector::preserve_mark_work(oop p, markOop m) { | |
|
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1833
diff
changeset
|
9070 _preserved_oop_stack.push(p); |
|
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1833
diff
changeset
|
9071 _preserved_mark_stack.push(m); |
| 0 | 9072 assert(m == p->mark(), "Mark word changed"); |
|
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1833
diff
changeset
|
9073 assert(_preserved_oop_stack.size() == _preserved_mark_stack.size(), |
| 0 | 9074 "bijection"); |
| 9075 } | |
| 9076 | |
| 9077 // Single threaded | |
| 9078 void CMSCollector::preserve_mark_if_necessary(oop p) { | |
| 9079 markOop m = p->mark(); | |
| 9080 if (m->must_be_preserved(p)) { | |
| 9081 preserve_mark_work(p, m); | |
| 9082 } | |
| 9083 } | |
| 9084 | |
| 9085 void CMSCollector::par_preserve_mark_if_necessary(oop p) { | |
| 9086 markOop m = p->mark(); | |
| 9087 if (m->must_be_preserved(p)) { | |
| 9088 MutexLockerEx x(ParGCRareEvent_lock, Mutex::_no_safepoint_check_flag); | |
| 9089 // Even though we read the mark word without holding | |
| 9090 // the lock, we are assured that it will not change | |
| 9091 // because we "own" this oop, so no other thread can | |
| 9092 // be trying to push it on the overflow list; see | |
| 9093 // the assertion in preserve_mark_work() that checks | |
| 9094 // that m == p->mark(). | |
| 9095 preserve_mark_work(p, m); | |
| 9096 } | |
| 9097 } | |
| 9098 | |
| 9099 // We should be able to do this multi-threaded, | |
| 9100 // a chunk of stack being a task (this is | |
| 9101 // correct because each oop only ever appears | |
| 9102 // once in the overflow list. However, it's | |
| 9103 // not very easy to completely overlap this with | |
| 9104 // other operations, so will generally not be done | |
| 9105 // until all work's been completed. Because we | |
| 9106 // expect the preserved oop stack (set) to be small, | |
| 9107 // it's probably fine to do this single-threaded. | |
| 9108 // We can explore cleverer concurrent/overlapped/parallel | |
| 9109 // processing of preserved marks if we feel the | |
| 9110 // need for this in the future. Stack overflow should | |
| 9111 // be so rare in practice and, when it happens, its | |
| 9112 // effect on performance so great that this will | |
| 9113 // likely just be in the noise anyway. | |
| 9114 void CMSCollector::restore_preserved_marks_if_any() { | |
| 9115 assert(SafepointSynchronize::is_at_safepoint(), | |
| 9116 "world should be stopped"); | |
| 9117 assert(Thread::current()->is_ConcurrentGC_thread() || | |
| 9118 Thread::current()->is_VM_thread(), | |
| 9119 "should be single-threaded"); | |
|
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1833
diff
changeset
|
9120 assert(_preserved_oop_stack.size() == _preserved_mark_stack.size(), |
|
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1833
diff
changeset
|
9121 "bijection"); |
|
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1833
diff
changeset
|
9122 |
|
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1833
diff
changeset
|
9123 while (!_preserved_oop_stack.is_empty()) { |
|
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1833
diff
changeset
|
9124 oop p = _preserved_oop_stack.pop(); |
| 0 | 9125 assert(p->is_oop(), "Should be an oop"); |
| 9126 assert(_span.contains(p), "oop should be in _span"); | |
| 9127 assert(p->mark() == markOopDesc::prototype(), | |
| 9128 "Set when taken from overflow list"); | |
|
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1833
diff
changeset
|
9129 markOop m = _preserved_mark_stack.pop(); |
| 0 | 9130 p->set_mark(m); |
| 9131 } | |
|
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1833
diff
changeset
|
9132 assert(_preserved_mark_stack.is_empty() && _preserved_oop_stack.is_empty(), |
| 0 | 9133 "stacks were cleared above"); |
| 9134 } | |
| 9135 | |
| 9136 #ifndef PRODUCT | |
| 9137 bool CMSCollector::no_preserved_marks() const { | |
|
1836
894b1d7c7e01
6423256: GC stacks should use a better data structure
jcoomes
parents:
1833
diff
changeset
|
9138 return _preserved_mark_stack.is_empty() && _preserved_oop_stack.is_empty(); |
| 0 | 9139 } |
| 9140 #endif | |
| 9141 | |
| 9142 CMSAdaptiveSizePolicy* ASConcurrentMarkSweepGeneration::cms_size_policy() const | |
| 9143 { | |
| 9144 GenCollectedHeap* gch = (GenCollectedHeap*) GenCollectedHeap::heap(); | |
| 9145 CMSAdaptiveSizePolicy* size_policy = | |
| 9146 (CMSAdaptiveSizePolicy*) gch->gen_policy()->size_policy(); | |
| 9147 assert(size_policy->is_gc_cms_adaptive_size_policy(), | |
| 9148 "Wrong type for size policy"); | |
| 9149 return size_policy; | |
| 9150 } | |
| 9151 | |
| 9152 void ASConcurrentMarkSweepGeneration::resize(size_t cur_promo_size, | |
| 9153 size_t desired_promo_size) { | |
| 9154 if (cur_promo_size < desired_promo_size) { | |
| 9155 size_t expand_bytes = desired_promo_size - cur_promo_size; | |
| 9156 if (PrintAdaptiveSizePolicy && Verbose) { | |
| 9157 gclog_or_tty->print_cr(" ASConcurrentMarkSweepGeneration::resize " | |
| 9158 "Expanding tenured generation by " SIZE_FORMAT " (bytes)", | |
| 9159 expand_bytes); | |
| 9160 } | |
| 9161 expand(expand_bytes, | |
| 9162 MinHeapDeltaBytes, | |
| 9163 CMSExpansionCause::_adaptive_size_policy); | |
| 9164 } else if (desired_promo_size < cur_promo_size) { | |
| 9165 size_t shrink_bytes = cur_promo_size - desired_promo_size; | |
| 9166 if (PrintAdaptiveSizePolicy && Verbose) { | |
| 9167 gclog_or_tty->print_cr(" ASConcurrentMarkSweepGeneration::resize " | |
| 9168 "Shrinking tenured generation by " SIZE_FORMAT " (bytes)", | |
| 9169 shrink_bytes); | |
| 9170 } | |
| 9171 shrink(shrink_bytes); | |
| 9172 } | |
| 9173 } | |
| 9174 | |
| 9175 CMSGCAdaptivePolicyCounters* ASConcurrentMarkSweepGeneration::gc_adaptive_policy_counters() { | |
| 9176 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 9177 CMSGCAdaptivePolicyCounters* counters = | |
| 9178 (CMSGCAdaptivePolicyCounters*) gch->collector_policy()->counters(); | |
| 9179 assert(counters->kind() == GCPolicyCounters::CMSGCAdaptivePolicyCountersKind, | |
| 9180 "Wrong kind of counters"); | |
| 9181 return counters; | |
| 9182 } | |
| 9183 | |
| 9184 | |
| 9185 void ASConcurrentMarkSweepGeneration::update_counters() { | |
| 9186 if (UsePerfData) { | |
| 9187 _space_counters->update_all(); | |
| 9188 _gen_counters->update_all(); | |
| 9189 CMSGCAdaptivePolicyCounters* counters = gc_adaptive_policy_counters(); | |
| 9190 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 9191 CMSGCStats* gc_stats_l = (CMSGCStats*) gc_stats(); | |
| 9192 assert(gc_stats_l->kind() == GCStats::CMSGCStatsKind, | |
| 9193 "Wrong gc statistics type"); | |
| 9194 counters->update_counters(gc_stats_l); | |
| 9195 } | |
| 9196 } | |
| 9197 | |
| 9198 void ASConcurrentMarkSweepGeneration::update_counters(size_t used) { | |
| 9199 if (UsePerfData) { | |
| 9200 _space_counters->update_used(used); | |
| 9201 _space_counters->update_capacity(); | |
| 9202 _gen_counters->update_all(); | |
| 9203 | |
| 9204 CMSGCAdaptivePolicyCounters* counters = gc_adaptive_policy_counters(); | |
| 9205 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 9206 CMSGCStats* gc_stats_l = (CMSGCStats*) gc_stats(); | |
| 9207 assert(gc_stats_l->kind() == GCStats::CMSGCStatsKind, | |
| 9208 "Wrong gc statistics type"); | |
| 9209 counters->update_counters(gc_stats_l); | |
| 9210 } | |
| 9211 } | |
| 9212 | |
| 9213 void ASConcurrentMarkSweepGeneration::shrink_by(size_t desired_bytes) { | |
| 9214 assert_locked_or_safepoint(Heap_lock); | |
| 9215 assert_lock_strong(freelistLock()); | |
| 9216 HeapWord* old_end = _cmsSpace->end(); | |
| 9217 HeapWord* unallocated_start = _cmsSpace->unallocated_block(); | |
| 9218 assert(old_end >= unallocated_start, "Miscalculation of unallocated_start"); | |
| 9219 FreeChunk* chunk_at_end = find_chunk_at_end(); | |
| 9220 if (chunk_at_end == NULL) { | |
| 9221 // No room to shrink | |
| 9222 if (PrintGCDetails && Verbose) { | |
| 9223 gclog_or_tty->print_cr("No room to shrink: old_end " | |
| 9224 PTR_FORMAT " unallocated_start " PTR_FORMAT | |
| 9225 " chunk_at_end " PTR_FORMAT, | |
| 9226 old_end, unallocated_start, chunk_at_end); | |
| 9227 } | |
| 9228 return; | |
| 9229 } else { | |
| 9230 | |
| 9231 // Find the chunk at the end of the space and determine | |
| 9232 // how much it can be shrunk. | |
| 9233 size_t shrinkable_size_in_bytes = chunk_at_end->size(); | |
| 9234 size_t aligned_shrinkable_size_in_bytes = | |
| 9235 align_size_down(shrinkable_size_in_bytes, os::vm_page_size()); | |
| 6885 | 9236 assert(unallocated_start <= (HeapWord*) chunk_at_end->end(), |
| 0 | 9237 "Inconsistent chunk at end of space"); |
| 9238 size_t bytes = MIN2(desired_bytes, aligned_shrinkable_size_in_bytes); | |
| 9239 size_t word_size_before = heap_word_size(_virtual_space.committed_size()); | |
| 9240 | |
| 9241 // Shrink the underlying space | |
| 9242 _virtual_space.shrink_by(bytes); | |
| 9243 if (PrintGCDetails && Verbose) { | |
| 9244 gclog_or_tty->print_cr("ConcurrentMarkSweepGeneration::shrink_by:" | |
| 9245 " desired_bytes " SIZE_FORMAT | |
| 9246 " shrinkable_size_in_bytes " SIZE_FORMAT | |
| 9247 " aligned_shrinkable_size_in_bytes " SIZE_FORMAT | |
| 9248 " bytes " SIZE_FORMAT, | |
| 9249 desired_bytes, shrinkable_size_in_bytes, | |
| 9250 aligned_shrinkable_size_in_bytes, bytes); | |
| 9251 gclog_or_tty->print_cr(" old_end " SIZE_FORMAT | |
| 9252 " unallocated_start " SIZE_FORMAT, | |
| 9253 old_end, unallocated_start); | |
| 9254 } | |
| 9255 | |
| 9256 // If the space did shrink (shrinking is not guaranteed), | |
| 9257 // shrink the chunk at the end by the appropriate amount. | |
| 9258 if (((HeapWord*)_virtual_space.high()) < old_end) { | |
| 9259 size_t new_word_size = | |
| 9260 heap_word_size(_virtual_space.committed_size()); | |
| 9261 | |
| 9262 // Have to remove the chunk from the dictionary because it is changing | |
| 9263 // size and might be someplace elsewhere in the dictionary. | |
| 9264 | |
| 9265 // Get the chunk at end, shrink it, and put it | |
| 9266 // back. | |
| 9267 _cmsSpace->removeChunkFromDictionary(chunk_at_end); | |
| 9268 size_t word_size_change = word_size_before - new_word_size; | |
| 9269 size_t chunk_at_end_old_size = chunk_at_end->size(); | |
| 9270 assert(chunk_at_end_old_size >= word_size_change, | |
| 9271 "Shrink is too large"); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
9272 chunk_at_end->set_size(chunk_at_end_old_size - |
| 0 | 9273 word_size_change); |
| 9274 _cmsSpace->freed((HeapWord*) chunk_at_end->end(), | |
| 9275 word_size_change); | |
| 9276 | |
| 9277 _cmsSpace->returnChunkToDictionary(chunk_at_end); | |
| 9278 | |
| 9279 MemRegion mr(_cmsSpace->bottom(), new_word_size); | |
| 9280 _bts->resize(new_word_size); // resize the block offset shared array | |
| 9281 Universe::heap()->barrier_set()->resize_covered_region(mr); | |
| 9282 _cmsSpace->assert_locked(); | |
| 9283 _cmsSpace->set_end((HeapWord*)_virtual_space.high()); | |
| 9284 | |
| 9285 NOT_PRODUCT(_cmsSpace->dictionary()->verify()); | |
| 9286 | |
| 9287 // update the space and generation capacity counters | |
| 9288 if (UsePerfData) { | |
| 9289 _space_counters->update_capacity(); | |
| 9290 _gen_counters->update_all(); | |
| 9291 } | |
| 9292 | |
| 9293 if (Verbose && PrintGCDetails) { | |
| 9294 size_t new_mem_size = _virtual_space.committed_size(); | |
| 9295 size_t old_mem_size = new_mem_size + bytes; | |
|
7623
203f64878aab
7102489: RFE: cleanup jlong typedef on __APPLE__and _LLP64 systems.
hseigel
parents:
6885
diff
changeset
|
9296 gclog_or_tty->print_cr("Shrinking %s from " SIZE_FORMAT "K by " SIZE_FORMAT "K to " SIZE_FORMAT "K", |
| 0 | 9297 name(), old_mem_size/K, bytes/K, new_mem_size/K); |
| 9298 } | |
| 9299 } | |
| 9300 | |
| 9301 assert(_cmsSpace->unallocated_block() <= _cmsSpace->end(), | |
| 9302 "Inconsistency at end of space"); | |
| 6885 | 9303 assert(chunk_at_end->end() == (uintptr_t*) _cmsSpace->end(), |
| 0 | 9304 "Shrinking is inconsistent"); |
| 9305 return; | |
| 9306 } | |
| 9307 } | |
| 9308 | |
| 9309 // Transfer some number of overflown objects to usual marking | |
| 9310 // stack. Return true if some objects were transferred. | |
| 9311 bool MarkRefsIntoAndScanClosure::take_from_overflow_list() { | |
|
679
cea947c8a988
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
ysr
parents:
628
diff
changeset
|
9312 size_t num = MIN2((size_t)(_mark_stack->capacity() - _mark_stack->length())/4, |
| 0 | 9313 (size_t)ParGCDesiredObjsFromOverflowList); |
| 9314 | |
| 9315 bool res = _collector->take_from_overflow_list(num, _mark_stack); | |
| 9316 assert(_collector->overflow_list_is_empty() || res, | |
| 9317 "If list is not empty, we should have taken something"); | |
| 9318 assert(!res || !_mark_stack->isEmpty(), | |
| 9319 "If we took something, it should now be on our stack"); | |
| 9320 return res; | |
| 9321 } | |
| 9322 | |
| 9323 size_t MarkDeadObjectsClosure::do_blk(HeapWord* addr) { | |
| 9324 size_t res = _sp->block_size_no_stall(addr, _collector); | |
| 9325 if (_sp->block_is_obj(addr)) { | |
| 9326 if (_live_bit_map->isMarked(addr)) { | |
| 9327 // It can't have been dead in a previous cycle | |
| 9328 guarantee(!_dead_bit_map->isMarked(addr), "No resurrection!"); | |
| 9329 } else { | |
| 9330 _dead_bit_map->mark(addr); // mark the dead object | |
| 9331 } | |
| 9332 } | |
|
2226
c5a923563727
6912621: iCMS: Error: assert(_markBitMap.isMarked(addr + 1),"Missing Printezis bit?")
ysr
parents:
2177
diff
changeset
|
9333 // Could be 0, if the block size could not be computed without stalling. |
| 0 | 9334 return res; |
| 9335 } | |
|
1703
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9336 |
|
3356
78542e2b5e35
7036199: Adding a notification to the implementation of GarbageCollectorMXBeans
fparain
parents:
3293
diff
changeset
|
9337 TraceCMSMemoryManagerStats::TraceCMSMemoryManagerStats(CMSCollector::CollectorState phase, GCCause::Cause cause): TraceMemoryManagerStats() { |
|
1703
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9338 |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9339 switch (phase) { |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9340 case CMSCollector::InitialMarking: |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9341 initialize(true /* fullGC */ , |
|
3356
78542e2b5e35
7036199: Adding a notification to the implementation of GarbageCollectorMXBeans
fparain
parents:
3293
diff
changeset
|
9342 cause /* cause of the GC */, |
|
1703
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9343 true /* recordGCBeginTime */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9344 true /* recordPreGCUsage */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9345 false /* recordPeakUsage */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9346 false /* recordPostGCusage */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9347 true /* recordAccumulatedGCTime */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9348 false /* recordGCEndTime */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9349 false /* countCollection */ ); |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9350 break; |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9351 |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9352 case CMSCollector::FinalMarking: |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9353 initialize(true /* fullGC */ , |
|
3356
78542e2b5e35
7036199: Adding a notification to the implementation of GarbageCollectorMXBeans
fparain
parents:
3293
diff
changeset
|
9354 cause /* cause of the GC */, |
|
1703
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9355 false /* recordGCBeginTime */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9356 false /* recordPreGCUsage */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9357 false /* recordPeakUsage */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9358 false /* recordPostGCusage */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9359 true /* recordAccumulatedGCTime */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9360 false /* recordGCEndTime */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9361 false /* countCollection */ ); |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9362 break; |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9363 |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9364 case CMSCollector::Sweeping: |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9365 initialize(true /* fullGC */ , |
|
3356
78542e2b5e35
7036199: Adding a notification to the implementation of GarbageCollectorMXBeans
fparain
parents:
3293
diff
changeset
|
9366 cause /* cause of the GC */, |
|
1703
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9367 false /* recordGCBeginTime */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9368 false /* recordPreGCUsage */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9369 true /* recordPeakUsage */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9370 true /* recordPostGCusage */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9371 false /* recordAccumulatedGCTime */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9372 true /* recordGCEndTime */, |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9373 true /* countCollection */ ); |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9374 break; |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9375 |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9376 default: |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9377 ShouldNotReachHere(); |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9378 } |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9379 } |
|
f6f3eef8a521
6581734: CMS Old Gen's collection usage is zero after GC which is incorrect
kevinw
parents:
1579
diff
changeset
|
9380 |