Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.cpp @ 7448:b735136e0d82
8004132: SerialGC: ValidateMarkSweep broken when running GCOld
Summary: Remove bit-rotten ValidateMarkSweep functionality and flag.
Reviewed-by: johnc, jmasa
Contributed-by: tamao <tao.mao@oracle.com>
| author | johnc |
|---|---|
| date | Wed, 02 Jan 2013 11:32:41 -0800 |
| parents | 685df3c6f84b |
| children | c73c3f2c5b3b 3c327c2b6782 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 6008 | 2 * Copyright (c) 2001, 2012, 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" |
| 26 #include "gc_implementation/concurrentMarkSweep/cmsLockVerifier.hpp" | |
| 27 #include "gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp" | |
| 28 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepGeneration.inline.hpp" | |
| 29 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepThread.hpp" | |
| 30 #include "gc_implementation/shared/liveRange.hpp" | |
| 31 #include "gc_implementation/shared/spaceDecorator.hpp" | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
32 #include "gc_interface/collectedHeap.inline.hpp" |
| 1972 | 33 #include "memory/allocation.inline.hpp" |
| 34 #include "memory/blockOffsetTable.inline.hpp" | |
| 35 #include "memory/resourceArea.hpp" | |
| 36 #include "memory/universe.inline.hpp" | |
| 37 #include "oops/oop.inline.hpp" | |
| 38 #include "runtime/globals.hpp" | |
| 39 #include "runtime/handles.inline.hpp" | |
| 40 #include "runtime/init.hpp" | |
| 41 #include "runtime/java.hpp" | |
| 42 #include "runtime/vmThread.hpp" | |
| 43 #include "utilities/copy.hpp" | |
| 0 | 44 |
| 45 ///////////////////////////////////////////////////////////////////////// | |
| 46 //// CompactibleFreeListSpace | |
| 47 ///////////////////////////////////////////////////////////////////////// | |
| 48 | |
| 49 // highest ranked free list lock rank | |
| 50 int CompactibleFreeListSpace::_lockRank = Mutex::leaf + 3; | |
| 51 | |
|
1571
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
52 // Defaults are 0 so things will break badly if incorrectly initialized. |
|
4068
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
53 size_t CompactibleFreeListSpace::IndexSetStart = 0; |
|
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
54 size_t CompactibleFreeListSpace::IndexSetStride = 0; |
|
1571
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
55 |
|
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
56 size_t MinChunkSize = 0; |
|
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
57 |
|
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
58 void CompactibleFreeListSpace::set_cms_values() { |
|
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
59 // Set CMS global values |
|
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
60 assert(MinChunkSize == 0, "already set"); |
|
6104
c92a79900986
7169062: CMS: Assertion failed with -XX:+ObjectAlignmentInBytes=64
brutisso
parents:
6028
diff
changeset
|
61 |
|
c92a79900986
7169062: CMS: Assertion failed with -XX:+ObjectAlignmentInBytes=64
brutisso
parents:
6028
diff
changeset
|
62 // MinChunkSize should be a multiple of MinObjAlignment and be large enough |
|
c92a79900986
7169062: CMS: Assertion failed with -XX:+ObjectAlignmentInBytes=64
brutisso
parents:
6028
diff
changeset
|
63 // for chunks to contain a FreeChunk. |
|
c92a79900986
7169062: CMS: Assertion failed with -XX:+ObjectAlignmentInBytes=64
brutisso
parents:
6028
diff
changeset
|
64 size_t min_chunk_size_in_bytes = align_size_up(sizeof(FreeChunk), MinObjAlignmentInBytes); |
|
c92a79900986
7169062: CMS: Assertion failed with -XX:+ObjectAlignmentInBytes=64
brutisso
parents:
6028
diff
changeset
|
65 MinChunkSize = min_chunk_size_in_bytes / BytesPerWord; |
|
1571
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
66 |
|
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
67 assert(IndexSetStart == 0 && IndexSetStride == 0, "already set"); |
|
4068
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
68 IndexSetStart = MinChunkSize; |
|
1571
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
69 IndexSetStride = MinObjAlignment; |
|
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
70 } |
|
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
71 |
| 0 | 72 // Constructor |
| 73 CompactibleFreeListSpace::CompactibleFreeListSpace(BlockOffsetSharedArray* bs, | |
| 74 MemRegion mr, bool use_adaptive_freelists, | |
| 6026 | 75 FreeBlockDictionary<FreeChunk>::DictionaryChoice dictionaryChoice) : |
| 0 | 76 _dictionaryChoice(dictionaryChoice), |
| 77 _adaptive_freelists(use_adaptive_freelists), | |
| 78 _bt(bs, mr), | |
| 79 // free list locks are in the range of values taken by _lockRank | |
| 80 // This range currently is [_leaf+2, _leaf+3] | |
| 81 // Note: this requires that CFLspace c'tors | |
| 82 // are called serially in the order in which the locks are | |
| 83 // are acquired in the program text. This is true today. | |
| 84 _freelistLock(_lockRank--, "CompactibleFreeListSpace._lock", true), | |
| 85 _parDictionaryAllocLock(Mutex::leaf - 1, // == rank(ExpandHeap_lock) - 1 | |
| 86 "CompactibleFreeListSpace._dict_par_lock", true), | |
| 87 _rescan_task_size(CardTableModRefBS::card_size_in_words * BitsPerWord * | |
| 88 CMSRescanMultiple), | |
| 89 _marking_task_size(CardTableModRefBS::card_size_in_words * BitsPerWord * | |
| 90 CMSConcMarkMultiple), | |
| 91 _collector(NULL) | |
| 92 { | |
| 6026 | 93 assert(sizeof(FreeChunk) / BytesPerWord <= MinChunkSize, |
| 6885 | 94 "FreeChunk is larger than expected"); |
| 0 | 95 _bt.set_space(this); |
|
263
12eea04c8b06
6672698: mangle_unused_area() should not remangle the entire heap at each collection.
jmasa
parents:
187
diff
changeset
|
96 initialize(mr, SpaceDecorator::Clear, SpaceDecorator::Mangle); |
| 0 | 97 // We have all of "mr", all of which we place in the dictionary |
| 98 // as one big chunk. We'll need to decide here which of several | |
| 99 // possible alternative dictionary implementations to use. For | |
| 100 // now the choice is easy, since we have only one working | |
| 101 // implementation, namely, the simple binary tree (splaying | |
| 102 // temporarily disabled). | |
| 103 switch (dictionaryChoice) { | |
| 6885 | 104 case FreeBlockDictionary<FreeChunk>::dictionaryBinaryTree: |
| 105 _dictionary = new BinaryTreeDictionary<FreeChunk, AdaptiveFreeList>(mr); | |
| 106 break; | |
| 6026 | 107 case FreeBlockDictionary<FreeChunk>::dictionarySplayTree: |
| 108 case FreeBlockDictionary<FreeChunk>::dictionarySkipList: | |
| 0 | 109 default: |
| 110 warning("dictionaryChoice: selected option not understood; using" | |
| 111 " default BinaryTreeDictionary implementation instead."); | |
| 112 } | |
| 113 assert(_dictionary != NULL, "CMS dictionary initialization"); | |
| 114 // The indexed free lists are initially all empty and are lazily | |
| 115 // filled in on demand. Initialize the array elements to NULL. | |
| 116 initializeIndexedFreeListArray(); | |
| 117 | |
| 118 // Not using adaptive free lists assumes that allocation is first | |
| 119 // from the linAB's. Also a cms perm gen which can be compacted | |
| 120 // has to have the klass's klassKlass allocated at a lower | |
| 121 // address in the heap than the klass so that the klassKlass is | |
| 122 // moved to its new location before the klass is moved. | |
| 123 // Set the _refillSize for the linear allocation blocks | |
| 124 if (!use_adaptive_freelists) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
125 FreeChunk* fc = _dictionary->get_chunk(mr.word_size()); |
| 0 | 126 // The small linAB initially has all the space and will allocate |
| 127 // a chunk of any size. | |
| 128 HeapWord* addr = (HeapWord*) fc; | |
| 129 _smallLinearAllocBlock.set(addr, fc->size() , | |
| 130 1024*SmallForLinearAlloc, fc->size()); | |
| 131 // Note that _unallocated_block is not updated here. | |
| 132 // Allocations from the linear allocation block should | |
| 133 // update it. | |
| 134 } else { | |
| 135 _smallLinearAllocBlock.set(0, 0, 1024*SmallForLinearAlloc, | |
| 136 SmallForLinearAlloc); | |
| 137 } | |
| 138 // CMSIndexedFreeListReplenish should be at least 1 | |
| 139 CMSIndexedFreeListReplenish = MAX2((uintx)1, CMSIndexedFreeListReplenish); | |
| 140 _promoInfo.setSpace(this); | |
| 141 if (UseCMSBestFit) { | |
| 142 _fitStrategy = FreeBlockBestFitFirst; | |
| 143 } else { | |
| 144 _fitStrategy = FreeBlockStrategyNone; | |
| 145 } | |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
146 check_free_list_consistency(); |
| 0 | 147 |
| 148 // Initialize locks for parallel case. | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
149 |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
150 if (CollectedHeap::use_parallel_gc_threads()) { |
| 0 | 151 for (size_t i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { |
| 152 _indexedFreeListParLocks[i] = new Mutex(Mutex::leaf - 1, // == ExpandHeap_lock - 1 | |
| 153 "a freelist par lock", | |
| 154 true); | |
| 155 if (_indexedFreeListParLocks[i] == NULL) | |
| 156 vm_exit_during_initialization("Could not allocate a par lock"); | |
| 157 DEBUG_ONLY( | |
| 158 _indexedFreeList[i].set_protecting_lock(_indexedFreeListParLocks[i]); | |
| 159 ) | |
| 160 } | |
| 161 _dictionary->set_par_lock(&_parDictionaryAllocLock); | |
| 162 } | |
| 163 } | |
| 164 | |
| 165 // Like CompactibleSpace forward() but always calls cross_threshold() to | |
| 166 // update the block offset table. Removed initialize_threshold call because | |
| 167 // CFLS does not use a block offset array for contiguous spaces. | |
| 168 HeapWord* CompactibleFreeListSpace::forward(oop q, size_t size, | |
| 169 CompactPoint* cp, HeapWord* compact_top) { | |
| 170 // q is alive | |
| 171 // First check if we should switch compaction space | |
| 172 assert(this == cp->space, "'this' should be current compaction space."); | |
| 173 size_t compaction_max_size = pointer_delta(end(), compact_top); | |
| 174 assert(adjustObjectSize(size) == cp->space->adjust_object_size_v(size), | |
| 175 "virtual adjustObjectSize_v() method is not correct"); | |
| 176 size_t adjusted_size = adjustObjectSize(size); | |
| 177 assert(compaction_max_size >= MinChunkSize || compaction_max_size == 0, | |
| 178 "no small fragments allowed"); | |
| 179 assert(minimum_free_block_size() == MinChunkSize, | |
| 180 "for de-virtualized reference below"); | |
| 181 // Can't leave a nonzero size, residual fragment smaller than MinChunkSize | |
| 182 if (adjusted_size + MinChunkSize > compaction_max_size && | |
| 183 adjusted_size != compaction_max_size) { | |
| 184 do { | |
| 185 // switch to next compaction space | |
| 186 cp->space->set_compaction_top(compact_top); | |
| 187 cp->space = cp->space->next_compaction_space(); | |
| 188 if (cp->space == NULL) { | |
| 189 cp->gen = GenCollectedHeap::heap()->prev_gen(cp->gen); | |
| 190 assert(cp->gen != NULL, "compaction must succeed"); | |
| 191 cp->space = cp->gen->first_compaction_space(); | |
| 192 assert(cp->space != NULL, "generation must have a first compaction space"); | |
| 193 } | |
| 194 compact_top = cp->space->bottom(); | |
| 195 cp->space->set_compaction_top(compact_top); | |
| 196 // The correct adjusted_size may not be the same as that for this method | |
| 197 // (i.e., cp->space may no longer be "this" so adjust the size again. | |
| 198 // Use the virtual method which is not used above to save the virtual | |
| 199 // dispatch. | |
| 200 adjusted_size = cp->space->adjust_object_size_v(size); | |
| 201 compaction_max_size = pointer_delta(cp->space->end(), compact_top); | |
| 202 assert(cp->space->minimum_free_block_size() == 0, "just checking"); | |
| 203 } while (adjusted_size > compaction_max_size); | |
| 204 } | |
| 205 | |
| 206 // store the forwarding pointer into the mark word | |
| 207 if ((HeapWord*)q != compact_top) { | |
| 208 q->forward_to(oop(compact_top)); | |
| 209 assert(q->is_gc_marked(), "encoding the pointer should preserve the mark"); | |
| 210 } else { | |
| 211 // if the object isn't moving we can just set the mark to the default | |
| 212 // mark and handle it specially later on. | |
| 213 q->init_mark(); | |
| 214 assert(q->forwardee() == NULL, "should be forwarded to NULL"); | |
| 215 } | |
| 216 | |
| 217 compact_top += adjusted_size; | |
| 218 | |
| 219 // we need to update the offset table so that the beginnings of objects can be | |
| 220 // found during scavenge. Note that we are updating the offset table based on | |
| 221 // where the object will be once the compaction phase finishes. | |
| 222 | |
| 223 // Always call cross_threshold(). A contiguous space can only call it when | |
| 224 // the compaction_top exceeds the current threshold but not for an | |
| 225 // non-contiguous space. | |
| 226 cp->threshold = | |
| 227 cp->space->cross_threshold(compact_top - adjusted_size, compact_top); | |
| 228 return compact_top; | |
| 229 } | |
| 230 | |
| 231 // A modified copy of OffsetTableContigSpace::cross_threshold() with _offsets -> _bt | |
| 232 // and use of single_block instead of alloc_block. The name here is not really | |
| 233 // appropriate - maybe a more general name could be invented for both the | |
| 234 // contiguous and noncontiguous spaces. | |
| 235 | |
| 236 HeapWord* CompactibleFreeListSpace::cross_threshold(HeapWord* start, HeapWord* the_end) { | |
| 237 _bt.single_block(start, the_end); | |
| 238 return end(); | |
| 239 } | |
| 240 | |
| 241 // Initialize them to NULL. | |
| 242 void CompactibleFreeListSpace::initializeIndexedFreeListArray() { | |
| 243 for (size_t i = 0; i < IndexSetSize; i++) { | |
| 244 // Note that on platforms where objects are double word aligned, | |
| 245 // the odd array elements are not used. It is convenient, however, | |
| 246 // to map directly from the object size to the array element. | |
| 247 _indexedFreeList[i].reset(IndexSetSize); | |
| 248 _indexedFreeList[i].set_size(i); | |
| 249 assert(_indexedFreeList[i].count() == 0, "reset check failed"); | |
| 250 assert(_indexedFreeList[i].head() == NULL, "reset check failed"); | |
| 251 assert(_indexedFreeList[i].tail() == NULL, "reset check failed"); | |
| 252 assert(_indexedFreeList[i].hint() == IndexSetSize, "reset check failed"); | |
| 253 } | |
| 254 } | |
| 255 | |
| 256 void CompactibleFreeListSpace::resetIndexedFreeListArray() { | |
|
4068
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
257 for (size_t i = 1; i < IndexSetSize; i++) { |
| 0 | 258 assert(_indexedFreeList[i].size() == (size_t) i, |
| 259 "Indexed free list sizes are incorrect"); | |
| 260 _indexedFreeList[i].reset(IndexSetSize); | |
| 261 assert(_indexedFreeList[i].count() == 0, "reset check failed"); | |
| 262 assert(_indexedFreeList[i].head() == NULL, "reset check failed"); | |
| 263 assert(_indexedFreeList[i].tail() == NULL, "reset check failed"); | |
| 264 assert(_indexedFreeList[i].hint() == IndexSetSize, "reset check failed"); | |
| 265 } | |
| 266 } | |
| 267 | |
| 268 void CompactibleFreeListSpace::reset(MemRegion mr) { | |
| 269 resetIndexedFreeListArray(); | |
| 270 dictionary()->reset(); | |
| 271 if (BlockOffsetArrayUseUnallocatedBlock) { | |
| 272 assert(end() == mr.end(), "We are compacting to the bottom of CMS gen"); | |
| 273 // Everything's allocated until proven otherwise. | |
| 274 _bt.set_unallocated_block(end()); | |
| 275 } | |
| 276 if (!mr.is_empty()) { | |
| 277 assert(mr.word_size() >= MinChunkSize, "Chunk size is too small"); | |
| 278 _bt.single_block(mr.start(), mr.word_size()); | |
| 279 FreeChunk* fc = (FreeChunk*) mr.start(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
280 fc->set_size(mr.word_size()); |
| 0 | 281 if (mr.word_size() >= IndexSetSize ) { |
| 282 returnChunkToDictionary(fc); | |
| 283 } else { | |
| 284 _bt.verify_not_unallocated((HeapWord*)fc, fc->size()); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
285 _indexedFreeList[mr.word_size()].return_chunk_at_head(fc); |
| 0 | 286 } |
| 287 } | |
| 288 _promoInfo.reset(); | |
| 289 _smallLinearAllocBlock._ptr = NULL; | |
| 290 _smallLinearAllocBlock._word_size = 0; | |
| 291 } | |
| 292 | |
| 293 void CompactibleFreeListSpace::reset_after_compaction() { | |
| 294 // Reset the space to the new reality - one free chunk. | |
| 295 MemRegion mr(compaction_top(), end()); | |
| 296 reset(mr); | |
| 297 // Now refill the linear allocation block(s) if possible. | |
| 298 if (_adaptive_freelists) { | |
| 299 refillLinearAllocBlocksIfNeeded(); | |
| 300 } else { | |
| 301 // Place as much of mr in the linAB as we can get, | |
| 302 // provided it was big enough to go into the dictionary. | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
303 FreeChunk* fc = dictionary()->find_largest_dict(); |
| 0 | 304 if (fc != NULL) { |
| 305 assert(fc->size() == mr.word_size(), | |
| 306 "Why was the chunk broken up?"); | |
| 307 removeChunkFromDictionary(fc); | |
| 308 HeapWord* addr = (HeapWord*) fc; | |
| 309 _smallLinearAllocBlock.set(addr, fc->size() , | |
| 310 1024*SmallForLinearAlloc, fc->size()); | |
| 311 // Note that _unallocated_block is not updated here. | |
| 312 } | |
| 313 } | |
| 314 } | |
| 315 | |
| 316 // Walks the entire dictionary, returning a coterminal | |
| 317 // chunk, if it exists. Use with caution since it involves | |
| 318 // a potentially complete walk of a potentially large tree. | |
| 319 FreeChunk* CompactibleFreeListSpace::find_chunk_at_end() { | |
| 320 | |
| 321 assert_lock_strong(&_freelistLock); | |
| 322 | |
| 323 return dictionary()->find_chunk_ends_at(end()); | |
| 324 } | |
| 325 | |
| 326 | |
| 327 #ifndef PRODUCT | |
| 328 void CompactibleFreeListSpace::initializeIndexedFreeListArrayReturnedBytes() { | |
| 329 for (size_t i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
330 _indexedFreeList[i].allocation_stats()->set_returned_bytes(0); |
| 0 | 331 } |
| 332 } | |
| 333 | |
| 334 size_t CompactibleFreeListSpace::sumIndexedFreeListArrayReturnedBytes() { | |
| 335 size_t sum = 0; | |
| 336 for (size_t i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
337 sum += _indexedFreeList[i].allocation_stats()->returned_bytes(); |
| 0 | 338 } |
| 339 return sum; | |
| 340 } | |
| 341 | |
| 342 size_t CompactibleFreeListSpace::totalCountInIndexedFreeLists() const { | |
| 343 size_t count = 0; | |
|
4068
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
344 for (size_t i = IndexSetStart; i < IndexSetSize; i++) { |
| 0 | 345 debug_only( |
| 346 ssize_t total_list_count = 0; | |
| 347 for (FreeChunk* fc = _indexedFreeList[i].head(); fc != NULL; | |
| 348 fc = fc->next()) { | |
| 349 total_list_count++; | |
| 350 } | |
| 351 assert(total_list_count == _indexedFreeList[i].count(), | |
| 352 "Count in list is incorrect"); | |
| 353 ) | |
| 354 count += _indexedFreeList[i].count(); | |
| 355 } | |
| 356 return count; | |
| 357 } | |
| 358 | |
| 359 size_t CompactibleFreeListSpace::totalCount() { | |
| 360 size_t num = totalCountInIndexedFreeLists(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
361 num += dictionary()->total_count(); |
| 0 | 362 if (_smallLinearAllocBlock._word_size != 0) { |
| 363 num++; | |
| 364 } | |
| 365 return num; | |
| 366 } | |
| 367 #endif | |
| 368 | |
| 369 bool CompactibleFreeListSpace::is_free_block(const HeapWord* p) const { | |
| 370 FreeChunk* fc = (FreeChunk*) p; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
371 return fc->is_free(); |
| 0 | 372 } |
| 373 | |
| 374 size_t CompactibleFreeListSpace::used() const { | |
| 375 return capacity() - free(); | |
| 376 } | |
| 377 | |
| 378 size_t CompactibleFreeListSpace::free() const { | |
| 379 // "MT-safe, but not MT-precise"(TM), if you will: i.e. | |
| 380 // if you do this while the structures are in flux you | |
| 381 // may get an approximate answer only; for instance | |
| 382 // because there is concurrent allocation either | |
| 383 // directly by mutators or for promotion during a GC. | |
| 384 // It's "MT-safe", however, in the sense that you are guaranteed | |
| 385 // not to crash and burn, for instance, because of walking | |
| 386 // pointers that could disappear as you were walking them. | |
| 387 // The approximation is because the various components | |
| 388 // that are read below are not read atomically (and | |
| 389 // further the computation of totalSizeInIndexedFreeLists() | |
| 390 // is itself a non-atomic computation. The normal use of | |
| 391 // this is during a resize operation at the end of GC | |
| 392 // and at that time you are guaranteed to get the | |
| 393 // correct actual value. However, for instance, this is | |
| 394 // also read completely asynchronously by the "perf-sampler" | |
| 395 // that supports jvmstat, and you are apt to see the values | |
| 396 // flicker in such cases. | |
| 397 assert(_dictionary != NULL, "No _dictionary?"); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
398 return (_dictionary->total_chunk_size(DEBUG_ONLY(freelistLock())) + |
| 0 | 399 totalSizeInIndexedFreeLists() + |
| 400 _smallLinearAllocBlock._word_size) * HeapWordSize; | |
| 401 } | |
| 402 | |
| 403 size_t CompactibleFreeListSpace::max_alloc_in_words() const { | |
| 404 assert(_dictionary != NULL, "No _dictionary?"); | |
| 405 assert_locked(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
406 size_t res = _dictionary->max_chunk_size(); |
| 0 | 407 res = MAX2(res, MIN2(_smallLinearAllocBlock._word_size, |
| 408 (size_t) SmallForLinearAlloc - 1)); | |
| 409 // XXX the following could potentially be pretty slow; | |
| 410 // should one, pesimally for the rare cases when res | |
| 411 // caclulated above is less than IndexSetSize, | |
| 412 // just return res calculated above? My reasoning was that | |
| 413 // those cases will be so rare that the extra time spent doesn't | |
| 414 // really matter.... | |
| 415 // Note: do not change the loop test i >= res + IndexSetStride | |
| 416 // to i > res below, because i is unsigned and res may be zero. | |
| 417 for (size_t i = IndexSetSize - 1; i >= res + IndexSetStride; | |
| 418 i -= IndexSetStride) { | |
| 419 if (_indexedFreeList[i].head() != NULL) { | |
| 420 assert(_indexedFreeList[i].count() != 0, "Inconsistent FreeList"); | |
| 421 return i; | |
| 422 } | |
| 423 } | |
| 424 return res; | |
| 425 } | |
| 426 | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
427 void LinearAllocBlock::print_on(outputStream* st) const { |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
428 st->print_cr(" LinearAllocBlock: ptr = " PTR_FORMAT ", word_size = " SIZE_FORMAT |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
429 ", refillsize = " SIZE_FORMAT ", allocation_size_limit = " SIZE_FORMAT, |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
430 _ptr, _word_size, _refillSize, _allocation_size_limit); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
431 } |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
432 |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
433 void CompactibleFreeListSpace::print_on(outputStream* st) const { |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
434 st->print_cr("COMPACTIBLE FREELIST SPACE"); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
435 st->print_cr(" Space:"); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
436 Space::print_on(st); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
437 |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
438 st->print_cr("promoInfo:"); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
439 _promoInfo.print_on(st); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
440 |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
441 st->print_cr("_smallLinearAllocBlock"); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
442 _smallLinearAllocBlock.print_on(st); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
443 |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
444 // dump_memory_block(_smallLinearAllocBlock->_ptr, 128); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
445 |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
446 st->print_cr(" _fitStrategy = %s, _adaptive_freelists = %s", |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
447 _fitStrategy?"true":"false", _adaptive_freelists?"true":"false"); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
448 } |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
449 |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
450 void CompactibleFreeListSpace::print_indexed_free_lists(outputStream* st) |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
451 const { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
452 reportIndexedFreeListStatistics(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
453 gclog_or_tty->print_cr("Layout of Indexed Freelists"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
454 gclog_or_tty->print_cr("---------------------------"); |
| 6885 | 455 AdaptiveFreeList<FreeChunk>::print_labels_on(st, "size"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
456 for (size_t i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
457 _indexedFreeList[i].print_on(gclog_or_tty); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
458 for (FreeChunk* fc = _indexedFreeList[i].head(); fc != NULL; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
459 fc = fc->next()) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
460 gclog_or_tty->print_cr("\t[" PTR_FORMAT "," PTR_FORMAT ") %s", |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
461 fc, (HeapWord*)fc + i, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
462 fc->cantCoalesce() ? "\t CC" : ""); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
463 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
464 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
465 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
466 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
467 void CompactibleFreeListSpace::print_promo_info_blocks(outputStream* st) |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
468 const { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
469 _promoInfo.print_on(st); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
470 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
471 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
472 void CompactibleFreeListSpace::print_dictionary_free_lists(outputStream* st) |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
473 const { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
474 _dictionary->report_statistics(); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
475 st->print_cr("Layout of Freelists in Tree"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
476 st->print_cr("---------------------------"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
477 _dictionary->print_free_lists(st); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
478 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
479 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
480 class BlkPrintingClosure: public BlkClosure { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
481 const CMSCollector* _collector; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
482 const CompactibleFreeListSpace* _sp; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
483 const CMSBitMap* _live_bit_map; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
484 const bool _post_remark; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
485 outputStream* _st; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
486 public: |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
487 BlkPrintingClosure(const CMSCollector* collector, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
488 const CompactibleFreeListSpace* sp, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
489 const CMSBitMap* live_bit_map, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
490 outputStream* st): |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
491 _collector(collector), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
492 _sp(sp), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
493 _live_bit_map(live_bit_map), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
494 _post_remark(collector->abstract_state() > CMSCollector::FinalMarking), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
495 _st(st) { } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
496 size_t do_blk(HeapWord* addr); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
497 }; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
498 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
499 size_t BlkPrintingClosure::do_blk(HeapWord* addr) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
500 size_t sz = _sp->block_size_no_stall(addr, _collector); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
501 assert(sz != 0, "Should always be able to compute a size"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
502 if (_sp->block_is_obj(addr)) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
503 const bool dead = _post_remark && !_live_bit_map->isMarked(addr); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
504 _st->print_cr(PTR_FORMAT ": %s object of size " SIZE_FORMAT "%s", |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
505 addr, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
506 dead ? "dead" : "live", |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
507 sz, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
508 (!dead && CMSPrintObjectsInDump) ? ":" : "."); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
509 if (CMSPrintObjectsInDump && !dead) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
510 oop(addr)->print_on(_st); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
511 _st->print_cr("--------------------------------------"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
512 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
513 } else { // free block |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
514 _st->print_cr(PTR_FORMAT ": free block of size " SIZE_FORMAT "%s", |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
515 addr, sz, CMSPrintChunksInDump ? ":" : "."); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
516 if (CMSPrintChunksInDump) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
517 ((FreeChunk*)addr)->print_on(_st); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
518 _st->print_cr("--------------------------------------"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
519 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
520 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
521 return sz; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
522 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
523 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
524 void CompactibleFreeListSpace::dump_at_safepoint_with_locks(CMSCollector* c, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
525 outputStream* st) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
526 st->print_cr("\n========================="); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
527 st->print_cr("Block layout in CMS Heap:"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
528 st->print_cr("========================="); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
529 BlkPrintingClosure bpcl(c, this, c->markBitMap(), st); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
530 blk_iterate(&bpcl); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
531 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
532 st->print_cr("\n======================================="); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
533 st->print_cr("Order & Layout of Promotion Info Blocks"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
534 st->print_cr("======================================="); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
535 print_promo_info_blocks(st); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
536 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
537 st->print_cr("\n==========================="); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
538 st->print_cr("Order of Indexed Free Lists"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
539 st->print_cr("========================="); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
540 print_indexed_free_lists(st); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
541 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
542 st->print_cr("\n================================="); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
543 st->print_cr("Order of Free Lists in Dictionary"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
544 st->print_cr("================================="); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
545 print_dictionary_free_lists(st); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
546 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
547 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
548 |
| 0 | 549 void CompactibleFreeListSpace::reportFreeListStatistics() const { |
| 550 assert_lock_strong(&_freelistLock); | |
| 551 assert(PrintFLSStatistics != 0, "Reporting error"); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
552 _dictionary->report_statistics(); |
| 0 | 553 if (PrintFLSStatistics > 1) { |
| 554 reportIndexedFreeListStatistics(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
555 size_t total_size = totalSizeInIndexedFreeLists() + |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
556 _dictionary->total_chunk_size(DEBUG_ONLY(freelistLock())); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
557 gclog_or_tty->print(" free=%ld frag=%1.4f\n", total_size, flsFrag()); |
| 0 | 558 } |
| 559 } | |
| 560 | |
| 561 void CompactibleFreeListSpace::reportIndexedFreeListStatistics() const { | |
| 562 assert_lock_strong(&_freelistLock); | |
| 563 gclog_or_tty->print("Statistics for IndexedFreeLists:\n" | |
| 564 "--------------------------------\n"); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
565 size_t total_size = totalSizeInIndexedFreeLists(); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
566 size_t free_blocks = numFreeBlocksInIndexedFreeLists(); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
567 gclog_or_tty->print("Total Free Space: %d\n", total_size); |
| 0 | 568 gclog_or_tty->print("Max Chunk Size: %d\n", maxChunkSizeInIndexedFreeLists()); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
569 gclog_or_tty->print("Number of Blocks: %d\n", free_blocks); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
570 if (free_blocks != 0) { |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
571 gclog_or_tty->print("Av. Block Size: %d\n", total_size/free_blocks); |
| 0 | 572 } |
| 573 } | |
| 574 | |
| 575 size_t CompactibleFreeListSpace::numFreeBlocksInIndexedFreeLists() const { | |
| 576 size_t res = 0; | |
| 577 for (size_t i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { | |
| 578 debug_only( | |
| 579 ssize_t recount = 0; | |
| 580 for (FreeChunk* fc = _indexedFreeList[i].head(); fc != NULL; | |
| 581 fc = fc->next()) { | |
| 582 recount += 1; | |
| 583 } | |
| 584 assert(recount == _indexedFreeList[i].count(), | |
| 585 "Incorrect count in list"); | |
| 586 ) | |
| 587 res += _indexedFreeList[i].count(); | |
| 588 } | |
| 589 return res; | |
| 590 } | |
| 591 | |
| 592 size_t CompactibleFreeListSpace::maxChunkSizeInIndexedFreeLists() const { | |
| 593 for (size_t i = IndexSetSize - 1; i != 0; i -= IndexSetStride) { | |
| 594 if (_indexedFreeList[i].head() != NULL) { | |
| 595 assert(_indexedFreeList[i].count() != 0, "Inconsistent FreeList"); | |
| 596 return (size_t)i; | |
| 597 } | |
| 598 } | |
| 599 return 0; | |
| 600 } | |
| 601 | |
| 602 void CompactibleFreeListSpace::set_end(HeapWord* value) { | |
| 603 HeapWord* prevEnd = end(); | |
| 604 assert(prevEnd != value, "unnecessary set_end call"); | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
605 assert(prevEnd == NULL || !BlockOffsetArrayUseUnallocatedBlock || value >= unallocated_block(), |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
606 "New end is below unallocated block"); |
| 0 | 607 _end = value; |
| 608 if (prevEnd != NULL) { | |
| 609 // Resize the underlying block offset table. | |
| 610 _bt.resize(pointer_delta(value, bottom())); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
611 if (value <= prevEnd) { |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
612 assert(!BlockOffsetArrayUseUnallocatedBlock || value >= unallocated_block(), |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
613 "New end is below unallocated block"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
614 } else { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
615 // Now, take this new chunk and add it to the free blocks. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
616 // Note that the BOT has not yet been updated for this block. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
617 size_t newFcSize = pointer_delta(value, prevEnd); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
618 // XXX This is REALLY UGLY and should be fixed up. XXX |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
619 if (!_adaptive_freelists && _smallLinearAllocBlock._ptr == NULL) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
620 // Mark the boundary of the new block in BOT |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
621 _bt.mark_block(prevEnd, value); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
622 // put it all in the linAB |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
623 if (ParallelGCThreads == 0) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
624 _smallLinearAllocBlock._ptr = prevEnd; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
625 _smallLinearAllocBlock._word_size = newFcSize; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
626 repairLinearAllocBlock(&_smallLinearAllocBlock); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
627 } else { // ParallelGCThreads > 0 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
628 MutexLockerEx x(parDictionaryAllocLock(), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
629 Mutex::_no_safepoint_check_flag); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
630 _smallLinearAllocBlock._ptr = prevEnd; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
631 _smallLinearAllocBlock._word_size = newFcSize; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
632 repairLinearAllocBlock(&_smallLinearAllocBlock); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
633 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
634 // Births of chunks put into a LinAB are not recorded. Births |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
635 // of chunks as they are allocated out of a LinAB are. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
636 } else { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
637 // Add the block to the free lists, if possible coalescing it |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
638 // with the last free block, and update the BOT and census data. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
639 addChunkToFreeListsAtEndRecordingStats(prevEnd, newFcSize); |
| 0 | 640 } |
| 641 } | |
| 642 } | |
| 643 } | |
| 644 | |
| 645 class FreeListSpace_DCTOC : public Filtering_DCTOC { | |
| 646 CompactibleFreeListSpace* _cfls; | |
| 647 CMSCollector* _collector; | |
| 648 protected: | |
| 649 // Override. | |
| 650 #define walk_mem_region_with_cl_DECL(ClosureType) \ | |
| 651 virtual void walk_mem_region_with_cl(MemRegion mr, \ | |
| 652 HeapWord* bottom, HeapWord* top, \ | |
| 653 ClosureType* cl); \ | |
| 654 void walk_mem_region_with_cl_par(MemRegion mr, \ | |
| 655 HeapWord* bottom, HeapWord* top, \ | |
| 656 ClosureType* cl); \ | |
| 657 void walk_mem_region_with_cl_nopar(MemRegion mr, \ | |
| 658 HeapWord* bottom, HeapWord* top, \ | |
| 659 ClosureType* cl) | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
660 walk_mem_region_with_cl_DECL(ExtendedOopClosure); |
| 0 | 661 walk_mem_region_with_cl_DECL(FilteringClosure); |
| 662 | |
| 663 public: | |
| 664 FreeListSpace_DCTOC(CompactibleFreeListSpace* sp, | |
| 665 CMSCollector* collector, | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
666 ExtendedOopClosure* cl, |
| 0 | 667 CardTableModRefBS::PrecisionStyle precision, |
| 668 HeapWord* boundary) : | |
| 669 Filtering_DCTOC(sp, cl, precision, boundary), | |
| 670 _cfls(sp), _collector(collector) {} | |
| 671 }; | |
| 672 | |
| 673 // We de-virtualize the block-related calls below, since we know that our | |
| 674 // space is a CompactibleFreeListSpace. | |
|
4095
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
4068
diff
changeset
|
675 |
| 0 | 676 #define FreeListSpace_DCTOC__walk_mem_region_with_cl_DEFN(ClosureType) \ |
| 677 void FreeListSpace_DCTOC::walk_mem_region_with_cl(MemRegion mr, \ | |
| 678 HeapWord* bottom, \ | |
| 679 HeapWord* top, \ | |
| 680 ClosureType* cl) { \ | |
|
4095
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
4068
diff
changeset
|
681 bool is_par = SharedHeap::heap()->n_par_threads() > 0; \ |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
4068
diff
changeset
|
682 if (is_par) { \ |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
4068
diff
changeset
|
683 assert(SharedHeap::heap()->n_par_threads() == \ |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
4068
diff
changeset
|
684 SharedHeap::heap()->workers()->active_workers(), "Mismatch"); \ |
| 0 | 685 walk_mem_region_with_cl_par(mr, bottom, top, cl); \ |
| 686 } else { \ | |
| 687 walk_mem_region_with_cl_nopar(mr, bottom, top, cl); \ | |
| 688 } \ | |
| 689 } \ | |
| 690 void FreeListSpace_DCTOC::walk_mem_region_with_cl_par(MemRegion mr, \ | |
| 691 HeapWord* bottom, \ | |
| 692 HeapWord* top, \ | |
| 693 ClosureType* cl) { \ | |
| 694 /* Skip parts that are before "mr", in case "block_start" sent us \ | |
| 695 back too far. */ \ | |
| 696 HeapWord* mr_start = mr.start(); \ | |
| 697 size_t bot_size = _cfls->CompactibleFreeListSpace::block_size(bottom); \ | |
| 698 HeapWord* next = bottom + bot_size; \ | |
| 699 while (next < mr_start) { \ | |
| 700 bottom = next; \ | |
| 701 bot_size = _cfls->CompactibleFreeListSpace::block_size(bottom); \ | |
| 702 next = bottom + bot_size; \ | |
| 703 } \ | |
| 704 \ | |
| 705 while (bottom < top) { \ | |
| 706 if (_cfls->CompactibleFreeListSpace::block_is_obj(bottom) && \ | |
| 707 !_cfls->CompactibleFreeListSpace::obj_allocated_since_save_marks( \ | |
| 708 oop(bottom)) && \ | |
| 709 !_collector->CMSCollector::is_dead_obj(oop(bottom))) { \ | |
| 710 size_t word_sz = oop(bottom)->oop_iterate(cl, mr); \ | |
| 711 bottom += _cfls->adjustObjectSize(word_sz); \ | |
| 712 } else { \ | |
| 713 bottom += _cfls->CompactibleFreeListSpace::block_size(bottom); \ | |
| 714 } \ | |
| 715 } \ | |
| 716 } \ | |
| 717 void FreeListSpace_DCTOC::walk_mem_region_with_cl_nopar(MemRegion mr, \ | |
| 718 HeapWord* bottom, \ | |
| 719 HeapWord* top, \ | |
| 720 ClosureType* cl) { \ | |
| 721 /* Skip parts that are before "mr", in case "block_start" sent us \ | |
| 722 back too far. */ \ | |
| 723 HeapWord* mr_start = mr.start(); \ | |
| 724 size_t bot_size = _cfls->CompactibleFreeListSpace::block_size_nopar(bottom); \ | |
| 725 HeapWord* next = bottom + bot_size; \ | |
| 726 while (next < mr_start) { \ | |
| 727 bottom = next; \ | |
| 728 bot_size = _cfls->CompactibleFreeListSpace::block_size_nopar(bottom); \ | |
| 729 next = bottom + bot_size; \ | |
| 730 } \ | |
| 731 \ | |
| 732 while (bottom < top) { \ | |
| 733 if (_cfls->CompactibleFreeListSpace::block_is_obj_nopar(bottom) && \ | |
| 734 !_cfls->CompactibleFreeListSpace::obj_allocated_since_save_marks( \ | |
| 735 oop(bottom)) && \ | |
| 736 !_collector->CMSCollector::is_dead_obj(oop(bottom))) { \ | |
| 737 size_t word_sz = oop(bottom)->oop_iterate(cl, mr); \ | |
| 738 bottom += _cfls->adjustObjectSize(word_sz); \ | |
| 739 } else { \ | |
| 740 bottom += _cfls->CompactibleFreeListSpace::block_size_nopar(bottom); \ | |
| 741 } \ | |
| 742 } \ | |
| 743 } | |
| 744 | |
| 745 // (There are only two of these, rather than N, because the split is due | |
| 746 // only to the introduction of the FilteringClosure, a local part of the | |
| 747 // impl of this abstraction.) | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
748 FreeListSpace_DCTOC__walk_mem_region_with_cl_DEFN(ExtendedOopClosure) |
| 0 | 749 FreeListSpace_DCTOC__walk_mem_region_with_cl_DEFN(FilteringClosure) |
| 750 | |
| 751 DirtyCardToOopClosure* | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
752 CompactibleFreeListSpace::new_dcto_cl(ExtendedOopClosure* cl, |
| 0 | 753 CardTableModRefBS::PrecisionStyle precision, |
| 754 HeapWord* boundary) { | |
| 755 return new FreeListSpace_DCTOC(this, _collector, cl, precision, boundary); | |
| 756 } | |
| 757 | |
| 758 | |
| 759 // Note on locking for the space iteration functions: | |
| 760 // since the collector's iteration activities are concurrent with | |
| 761 // allocation activities by mutators, absent a suitable mutual exclusion | |
| 762 // mechanism the iterators may go awry. For instace a block being iterated | |
| 763 // may suddenly be allocated or divided up and part of it allocated and | |
| 764 // so on. | |
| 765 | |
| 766 // Apply the given closure to each block in the space. | |
| 767 void CompactibleFreeListSpace::blk_iterate_careful(BlkClosureCareful* cl) { | |
| 768 assert_lock_strong(freelistLock()); | |
| 769 HeapWord *cur, *limit; | |
| 770 for (cur = bottom(), limit = end(); cur < limit; | |
| 771 cur += cl->do_blk_careful(cur)); | |
| 772 } | |
| 773 | |
| 774 // Apply the given closure to each block in the space. | |
| 775 void CompactibleFreeListSpace::blk_iterate(BlkClosure* cl) { | |
| 776 assert_lock_strong(freelistLock()); | |
| 777 HeapWord *cur, *limit; | |
| 778 for (cur = bottom(), limit = end(); cur < limit; | |
| 779 cur += cl->do_blk(cur)); | |
| 780 } | |
| 781 | |
| 782 // Apply the given closure to each oop in the space. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
783 void CompactibleFreeListSpace::oop_iterate(ExtendedOopClosure* cl) { |
| 0 | 784 assert_lock_strong(freelistLock()); |
| 785 HeapWord *cur, *limit; | |
| 786 size_t curSize; | |
| 787 for (cur = bottom(), limit = end(); cur < limit; | |
| 788 cur += curSize) { | |
| 789 curSize = block_size(cur); | |
| 790 if (block_is_obj(cur)) { | |
| 791 oop(cur)->oop_iterate(cl); | |
| 792 } | |
| 793 } | |
| 794 } | |
| 795 | |
| 796 // Apply the given closure to each oop in the space \intersect memory region. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
797 void CompactibleFreeListSpace::oop_iterate(MemRegion mr, ExtendedOopClosure* cl) { |
| 0 | 798 assert_lock_strong(freelistLock()); |
| 799 if (is_empty()) { | |
| 800 return; | |
| 801 } | |
| 802 MemRegion cur = MemRegion(bottom(), end()); | |
| 803 mr = mr.intersection(cur); | |
| 804 if (mr.is_empty()) { | |
| 805 return; | |
| 806 } | |
| 807 if (mr.equals(cur)) { | |
| 808 oop_iterate(cl); | |
| 809 return; | |
| 810 } | |
| 811 assert(mr.end() <= end(), "just took an intersection above"); | |
| 812 HeapWord* obj_addr = block_start(mr.start()); | |
| 813 HeapWord* t = mr.end(); | |
| 814 | |
| 815 SpaceMemRegionOopsIterClosure smr_blk(cl, mr); | |
| 816 if (block_is_obj(obj_addr)) { | |
| 817 // Handle first object specially. | |
| 818 oop obj = oop(obj_addr); | |
| 819 obj_addr += adjustObjectSize(obj->oop_iterate(&smr_blk)); | |
| 820 } else { | |
| 821 FreeChunk* fc = (FreeChunk*)obj_addr; | |
| 822 obj_addr += fc->size(); | |
| 823 } | |
| 824 while (obj_addr < t) { | |
| 825 HeapWord* obj = obj_addr; | |
| 826 obj_addr += block_size(obj_addr); | |
| 827 // If "obj_addr" is not greater than top, then the | |
| 828 // entire object "obj" is within the region. | |
| 829 if (obj_addr <= t) { | |
| 830 if (block_is_obj(obj)) { | |
| 831 oop(obj)->oop_iterate(cl); | |
| 832 } | |
| 833 } else { | |
| 834 // "obj" extends beyond end of region | |
| 835 if (block_is_obj(obj)) { | |
| 836 oop(obj)->oop_iterate(&smr_blk); | |
| 837 } | |
| 838 break; | |
| 839 } | |
| 840 } | |
| 841 } | |
| 842 | |
| 843 // NOTE: In the following methods, in order to safely be able to | |
| 844 // apply the closure to an object, we need to be sure that the | |
| 845 // object has been initialized. We are guaranteed that an object | |
| 846 // is initialized if we are holding the Heap_lock with the | |
| 847 // world stopped. | |
| 848 void CompactibleFreeListSpace::verify_objects_initialized() const { | |
| 849 if (is_init_completed()) { | |
| 850 assert_locked_or_safepoint(Heap_lock); | |
| 851 if (Universe::is_fully_initialized()) { | |
| 852 guarantee(SafepointSynchronize::is_at_safepoint(), | |
| 853 "Required for objects to be initialized"); | |
| 854 } | |
| 855 } // else make a concession at vm start-up | |
| 856 } | |
| 857 | |
| 858 // Apply the given closure to each object in the space | |
| 859 void CompactibleFreeListSpace::object_iterate(ObjectClosure* blk) { | |
| 860 assert_lock_strong(freelistLock()); | |
| 861 NOT_PRODUCT(verify_objects_initialized()); | |
| 862 HeapWord *cur, *limit; | |
| 863 size_t curSize; | |
| 864 for (cur = bottom(), limit = end(); cur < limit; | |
| 865 cur += curSize) { | |
| 866 curSize = block_size(cur); | |
| 867 if (block_is_obj(cur)) { | |
| 868 blk->do_object(oop(cur)); | |
| 869 } | |
| 870 } | |
| 871 } | |
| 872 | |
|
517
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
873 // Apply the given closure to each live object in the space |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
874 // The usage of CompactibleFreeListSpace |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
875 // by the ConcurrentMarkSweepGeneration for concurrent GC's allows |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
876 // objects in the space with references to objects that are no longer |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
877 // valid. For example, an object may reference another object |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
878 // that has already been sweep up (collected). This method uses |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
879 // obj_is_alive() to determine whether it is safe to apply the closure to |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
880 // an object. See obj_is_alive() for details on how liveness of an |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
881 // object is decided. |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
882 |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
883 void CompactibleFreeListSpace::safe_object_iterate(ObjectClosure* blk) { |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
884 assert_lock_strong(freelistLock()); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
885 NOT_PRODUCT(verify_objects_initialized()); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
886 HeapWord *cur, *limit; |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
887 size_t curSize; |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
888 for (cur = bottom(), limit = end(); cur < limit; |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
889 cur += curSize) { |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
890 curSize = block_size(cur); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
891 if (block_is_obj(cur) && obj_is_alive(cur)) { |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
892 blk->do_object(oop(cur)); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
893 } |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
894 } |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
895 } |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
896 |
| 0 | 897 void CompactibleFreeListSpace::object_iterate_mem(MemRegion mr, |
| 898 UpwardsObjectClosure* cl) { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
899 assert_locked(freelistLock()); |
| 0 | 900 NOT_PRODUCT(verify_objects_initialized()); |
| 901 Space::object_iterate_mem(mr, cl); | |
| 902 } | |
| 903 | |
| 904 // Callers of this iterator beware: The closure application should | |
| 905 // be robust in the face of uninitialized objects and should (always) | |
| 906 // return a correct size so that the next addr + size below gives us a | |
| 907 // valid block boundary. [See for instance, | |
| 908 // ScanMarkedObjectsAgainCarefullyClosure::do_object_careful() | |
| 909 // in ConcurrentMarkSweepGeneration.cpp.] | |
| 910 HeapWord* | |
| 911 CompactibleFreeListSpace::object_iterate_careful(ObjectClosureCareful* cl) { | |
| 912 assert_lock_strong(freelistLock()); | |
| 913 HeapWord *addr, *last; | |
| 914 size_t size; | |
| 915 for (addr = bottom(), last = end(); | |
| 916 addr < last; addr += size) { | |
| 917 FreeChunk* fc = (FreeChunk*)addr; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
918 if (fc->is_free()) { |
| 0 | 919 // Since we hold the free list lock, which protects direct |
| 920 // allocation in this generation by mutators, a free object | |
| 921 // will remain free throughout this iteration code. | |
| 922 size = fc->size(); | |
| 923 } else { | |
| 924 // Note that the object need not necessarily be initialized, | |
| 925 // because (for instance) the free list lock does NOT protect | |
| 926 // object initialization. The closure application below must | |
| 927 // therefore be correct in the face of uninitialized objects. | |
| 928 size = cl->do_object_careful(oop(addr)); | |
| 929 if (size == 0) { | |
| 930 // An unparsable object found. Signal early termination. | |
| 931 return addr; | |
| 932 } | |
| 933 } | |
| 934 } | |
| 935 return NULL; | |
| 936 } | |
| 937 | |
| 938 // Callers of this iterator beware: The closure application should | |
| 939 // be robust in the face of uninitialized objects and should (always) | |
| 940 // return a correct size so that the next addr + size below gives us a | |
| 941 // valid block boundary. [See for instance, | |
| 942 // ScanMarkedObjectsAgainCarefullyClosure::do_object_careful() | |
| 943 // in ConcurrentMarkSweepGeneration.cpp.] | |
| 944 HeapWord* | |
| 945 CompactibleFreeListSpace::object_iterate_careful_m(MemRegion mr, | |
| 946 ObjectClosureCareful* cl) { | |
| 947 assert_lock_strong(freelistLock()); | |
| 948 // Can't use used_region() below because it may not necessarily | |
| 949 // be the same as [bottom(),end()); although we could | |
| 950 // use [used_region().start(),round_to(used_region().end(),CardSize)), | |
| 951 // that appears too cumbersome, so we just do the simpler check | |
| 952 // in the assertion below. | |
| 953 assert(!mr.is_empty() && MemRegion(bottom(),end()).contains(mr), | |
| 954 "mr should be non-empty and within used space"); | |
| 955 HeapWord *addr, *end; | |
| 956 size_t size; | |
| 957 for (addr = block_start_careful(mr.start()), end = mr.end(); | |
| 958 addr < end; addr += size) { | |
| 959 FreeChunk* fc = (FreeChunk*)addr; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
960 if (fc->is_free()) { |
| 0 | 961 // Since we hold the free list lock, which protects direct |
| 962 // allocation in this generation by mutators, a free object | |
| 963 // will remain free throughout this iteration code. | |
| 964 size = fc->size(); | |
| 965 } else { | |
| 966 // Note that the object need not necessarily be initialized, | |
| 967 // because (for instance) the free list lock does NOT protect | |
| 968 // object initialization. The closure application below must | |
| 969 // therefore be correct in the face of uninitialized objects. | |
| 970 size = cl->do_object_careful_m(oop(addr), mr); | |
| 971 if (size == 0) { | |
| 972 // An unparsable object found. Signal early termination. | |
| 973 return addr; | |
| 974 } | |
| 975 } | |
| 976 } | |
| 977 return NULL; | |
| 978 } | |
| 979 | |
| 980 | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
981 HeapWord* CompactibleFreeListSpace::block_start_const(const void* p) const { |
| 0 | 982 NOT_PRODUCT(verify_objects_initialized()); |
| 983 return _bt.block_start(p); | |
| 984 } | |
| 985 | |
| 986 HeapWord* CompactibleFreeListSpace::block_start_careful(const void* p) const { | |
| 987 return _bt.block_start_careful(p); | |
| 988 } | |
| 989 | |
| 990 size_t CompactibleFreeListSpace::block_size(const HeapWord* p) const { | |
| 991 NOT_PRODUCT(verify_objects_initialized()); | |
| 992 // This must be volatile, or else there is a danger that the compiler | |
| 993 // will compile the code below into a sometimes-infinite loop, by keeping | |
| 994 // the value read the first time in a register. | |
| 995 while (true) { | |
| 996 // We must do this until we get a consistent view of the object. | |
| 187 | 997 if (FreeChunk::indicatesFreeChunk(p)) { |
| 998 volatile FreeChunk* fc = (volatile FreeChunk*)p; | |
| 999 size_t res = fc->size(); | |
| 1000 // If the object is still a free chunk, return the size, else it | |
| 1001 // has been allocated so try again. | |
| 1002 if (FreeChunk::indicatesFreeChunk(p)) { | |
| 0 | 1003 assert(res != 0, "Block size should not be 0"); |
| 1004 return res; | |
| 1005 } | |
| 187 | 1006 } else { |
| 1007 // must read from what 'p' points to in each loop. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1008 Klass* k = ((volatile oopDesc*)p)->klass_or_null(); |
| 187 | 1009 if (k != NULL) { |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1010 assert(k->is_klass(), "Should really be klass oop."); |
| 187 | 1011 oop o = (oop)p; |
| 1012 assert(o->is_oop(true /* ignore mark word */), "Should be an oop."); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1013 size_t res = o->size_given_klass(k); |
| 187 | 1014 res = adjustObjectSize(res); |
| 1015 assert(res != 0, "Block size should not be 0"); | |
| 1016 return res; | |
| 1017 } | |
| 0 | 1018 } |
| 1019 } | |
| 1020 } | |
| 1021 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1022 // TODO: Now that is_parsable is gone, we should combine these two functions. |
| 0 | 1023 // A variant of the above that uses the Printezis bits for |
| 1024 // unparsable but allocated objects. This avoids any possible | |
| 1025 // stalls waiting for mutators to initialize objects, and is | |
| 1026 // thus potentially faster than the variant above. However, | |
| 1027 // this variant may return a zero size for a block that is | |
| 1028 // under mutation and for which a consistent size cannot be | |
| 1029 // inferred without stalling; see CMSCollector::block_size_if_printezis_bits(). | |
| 1030 size_t CompactibleFreeListSpace::block_size_no_stall(HeapWord* p, | |
| 1031 const CMSCollector* c) | |
| 1032 const { | |
| 1033 assert(MemRegion(bottom(), end()).contains(p), "p not in space"); | |
| 1034 // This must be volatile, or else there is a danger that the compiler | |
| 1035 // will compile the code below into a sometimes-infinite loop, by keeping | |
| 1036 // the value read the first time in a register. | |
| 1037 DEBUG_ONLY(uint loops = 0;) | |
| 1038 while (true) { | |
| 1039 // We must do this until we get a consistent view of the object. | |
| 187 | 1040 if (FreeChunk::indicatesFreeChunk(p)) { |
| 1041 volatile FreeChunk* fc = (volatile FreeChunk*)p; | |
| 1042 size_t res = fc->size(); | |
| 1043 if (FreeChunk::indicatesFreeChunk(p)) { | |
| 0 | 1044 assert(res != 0, "Block size should not be 0"); |
| 1045 assert(loops == 0, "Should be 0"); | |
| 1046 return res; | |
| 1047 } | |
| 1048 } else { | |
| 187 | 1049 // must read from what 'p' points to in each loop. |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1050 Klass* k = ((volatile oopDesc*)p)->klass_or_null(); |
|
2226
c5a923563727
6912621: iCMS: Error: assert(_markBitMap.isMarked(addr + 1),"Missing Printezis bit?")
ysr
parents:
1972
diff
changeset
|
1051 // We trust the size of any object that has a non-NULL |
|
c5a923563727
6912621: iCMS: Error: assert(_markBitMap.isMarked(addr + 1),"Missing Printezis bit?")
ysr
parents:
1972
diff
changeset
|
1052 // klass and (for those in the perm gen) is parsable |
|
c5a923563727
6912621: iCMS: Error: assert(_markBitMap.isMarked(addr + 1),"Missing Printezis bit?")
ysr
parents:
1972
diff
changeset
|
1053 // -- irrespective of its conc_safe-ty. |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1054 if (k != NULL) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1055 assert(k->is_klass(), "Should really be klass oop."); |
| 187 | 1056 oop o = (oop)p; |
| 1057 assert(o->is_oop(), "Should be an oop"); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1058 size_t res = o->size_given_klass(k); |
| 187 | 1059 res = adjustObjectSize(res); |
| 1060 assert(res != 0, "Block size should not be 0"); | |
| 1061 return res; | |
| 1062 } else { | |
|
2226
c5a923563727
6912621: iCMS: Error: assert(_markBitMap.isMarked(addr + 1),"Missing Printezis bit?")
ysr
parents:
1972
diff
changeset
|
1063 // May return 0 if P-bits not present. |
| 187 | 1064 return c->block_size_if_printezis_bits(p); |
| 1065 } | |
| 0 | 1066 } |
| 1067 assert(loops == 0, "Can loop at most once"); | |
| 1068 DEBUG_ONLY(loops++;) | |
| 1069 } | |
| 1070 } | |
| 1071 | |
| 1072 size_t CompactibleFreeListSpace::block_size_nopar(const HeapWord* p) const { | |
| 1073 NOT_PRODUCT(verify_objects_initialized()); | |
| 1074 assert(MemRegion(bottom(), end()).contains(p), "p not in space"); | |
| 1075 FreeChunk* fc = (FreeChunk*)p; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1076 if (fc->is_free()) { |
| 0 | 1077 return fc->size(); |
| 1078 } else { | |
| 1079 // Ignore mark word because this may be a recently promoted | |
| 1080 // object whose mark word is used to chain together grey | |
| 1081 // objects (the last one would have a null value). | |
| 1082 assert(oop(p)->is_oop(true), "Should be an oop"); | |
| 1083 return adjustObjectSize(oop(p)->size()); | |
| 1084 } | |
| 1085 } | |
| 1086 | |
| 1087 // This implementation assumes that the property of "being an object" is | |
| 1088 // stable. But being a free chunk may not be (because of parallel | |
| 1089 // promotion.) | |
| 1090 bool CompactibleFreeListSpace::block_is_obj(const HeapWord* p) const { | |
| 1091 FreeChunk* fc = (FreeChunk*)p; | |
| 1092 assert(is_in_reserved(p), "Should be in space"); | |
| 1093 // When doing a mark-sweep-compact of the CMS generation, this | |
| 1094 // assertion may fail because prepare_for_compaction() uses | |
| 1095 // space that is garbage to maintain information on ranges of | |
| 1096 // live objects so that these live ranges can be moved as a whole. | |
| 1097 // Comment out this assertion until that problem can be solved | |
| 1098 // (i.e., that the block start calculation may look at objects | |
| 1099 // at address below "p" in finding the object that contains "p" | |
| 1100 // and those objects (if garbage) may have been modified to hold | |
| 1101 // live range information. | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
1102 // assert(CollectedHeap::use_parallel_gc_threads() || _bt.block_start(p) == p, |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
1103 // "Should be a block boundary"); |
| 187 | 1104 if (FreeChunk::indicatesFreeChunk(p)) return false; |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1105 Klass* k = oop(p)->klass_or_null(); |
| 0 | 1106 if (k != NULL) { |
| 1107 // Ignore mark word because it may have been used to | |
| 1108 // chain together promoted objects (the last one | |
| 1109 // would have a null value). | |
| 1110 assert(oop(p)->is_oop(true), "Should be an oop"); | |
| 1111 return true; | |
| 1112 } else { | |
| 1113 return false; // Was not an object at the start of collection. | |
| 1114 } | |
| 1115 } | |
| 1116 | |
| 1117 // Check if the object is alive. This fact is checked either by consulting | |
| 1118 // the main marking bitmap in the sweeping phase or, if it's a permanent | |
| 1119 // generation and we're not in the sweeping phase, by checking the | |
| 1120 // perm_gen_verify_bit_map where we store the "deadness" information if | |
| 1121 // we did not sweep the perm gen in the most recent previous GC cycle. | |
| 1122 bool CompactibleFreeListSpace::obj_is_alive(const HeapWord* p) const { | |
|
1959
9eecf81a02fb
7000578: CMS: assert(SafepointSynchronize::is_at_safepoint()) failed: Else races are possible
ysr
parents:
1952
diff
changeset
|
1123 assert(SafepointSynchronize::is_at_safepoint() || !is_init_completed(), |
|
9eecf81a02fb
7000578: CMS: assert(SafepointSynchronize::is_at_safepoint()) failed: Else races are possible
ysr
parents:
1952
diff
changeset
|
1124 "Else races are possible"); |
|
1951
899bbbdcb6ea
6997298: fatal error: must own lock CMS_markBitMap_lock during heap dump
ysr
parents:
1833
diff
changeset
|
1125 assert(block_is_obj(p), "The address should point to an object"); |
| 0 | 1126 |
| 1127 // If we're sweeping, we use object liveness information from the main bit map | |
| 1128 // for both perm gen and old gen. | |
| 1129 // We don't need to lock the bitmap (live_map or dead_map below), because | |
| 1130 // EITHER we are in the middle of the sweeping phase, and the | |
| 1131 // main marking bit map (live_map below) is locked, | |
| 1132 // OR we're in other phases and perm_gen_verify_bit_map (dead_map below) | |
| 1133 // is stable, because it's mutated only in the sweeping phase. | |
|
1951
899bbbdcb6ea
6997298: fatal error: must own lock CMS_markBitMap_lock during heap dump
ysr
parents:
1833
diff
changeset
|
1134 // NOTE: This method is also used by jmap where, if class unloading is |
|
899bbbdcb6ea
6997298: fatal error: must own lock CMS_markBitMap_lock during heap dump
ysr
parents:
1833
diff
changeset
|
1135 // off, the results can return "false" for legitimate perm objects, |
|
899bbbdcb6ea
6997298: fatal error: must own lock CMS_markBitMap_lock during heap dump
ysr
parents:
1833
diff
changeset
|
1136 // when we are not in the midst of a sweeping phase, which can result |
|
899bbbdcb6ea
6997298: fatal error: must own lock CMS_markBitMap_lock during heap dump
ysr
parents:
1833
diff
changeset
|
1137 // in jmap not reporting certain perm gen objects. This will be moot |
|
899bbbdcb6ea
6997298: fatal error: must own lock CMS_markBitMap_lock during heap dump
ysr
parents:
1833
diff
changeset
|
1138 // if/when the perm gen goes away in the future. |
| 0 | 1139 if (_collector->abstract_state() == CMSCollector::Sweeping) { |
| 1140 CMSBitMap* live_map = _collector->markBitMap(); | |
|
1951
899bbbdcb6ea
6997298: fatal error: must own lock CMS_markBitMap_lock during heap dump
ysr
parents:
1833
diff
changeset
|
1141 return live_map->par_isMarked((HeapWord*) p); |
| 0 | 1142 } |
| 1143 return true; | |
| 1144 } | |
| 1145 | |
| 1146 bool CompactibleFreeListSpace::block_is_obj_nopar(const HeapWord* p) const { | |
| 1147 FreeChunk* fc = (FreeChunk*)p; | |
| 1148 assert(is_in_reserved(p), "Should be in space"); | |
| 1149 assert(_bt.block_start(p) == p, "Should be a block boundary"); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1150 if (!fc->is_free()) { |
| 0 | 1151 // Ignore mark word because it may have been used to |
| 1152 // chain together promoted objects (the last one | |
| 1153 // would have a null value). | |
| 1154 assert(oop(p)->is_oop(true), "Should be an oop"); | |
| 1155 return true; | |
| 1156 } | |
| 1157 return false; | |
| 1158 } | |
| 1159 | |
| 1160 // "MT-safe but not guaranteed MT-precise" (TM); you may get an | |
| 1161 // approximate answer if you don't hold the freelistlock when you call this. | |
| 1162 size_t CompactibleFreeListSpace::totalSizeInIndexedFreeLists() const { | |
| 1163 size_t size = 0; | |
| 1164 for (size_t i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { | |
| 1165 debug_only( | |
| 1166 // We may be calling here without the lock in which case we | |
| 1167 // won't do this modest sanity check. | |
| 1168 if (freelistLock()->owned_by_self()) { | |
| 1169 size_t total_list_size = 0; | |
| 1170 for (FreeChunk* fc = _indexedFreeList[i].head(); fc != NULL; | |
| 1171 fc = fc->next()) { | |
| 1172 total_list_size += i; | |
| 1173 } | |
| 1174 assert(total_list_size == i * _indexedFreeList[i].count(), | |
| 1175 "Count in list is incorrect"); | |
| 1176 } | |
| 1177 ) | |
| 1178 size += i * _indexedFreeList[i].count(); | |
| 1179 } | |
| 1180 return size; | |
| 1181 } | |
| 1182 | |
| 1183 HeapWord* CompactibleFreeListSpace::par_allocate(size_t size) { | |
| 1184 MutexLockerEx x(freelistLock(), Mutex::_no_safepoint_check_flag); | |
| 1185 return allocate(size); | |
| 1186 } | |
| 1187 | |
| 1188 HeapWord* | |
| 1189 CompactibleFreeListSpace::getChunkFromSmallLinearAllocBlockRemainder(size_t size) { | |
| 1190 return getChunkFromLinearAllocBlockRemainder(&_smallLinearAllocBlock, size); | |
| 1191 } | |
| 1192 | |
| 1193 HeapWord* CompactibleFreeListSpace::allocate(size_t size) { | |
| 1194 assert_lock_strong(freelistLock()); | |
| 1195 HeapWord* res = NULL; | |
| 1196 assert(size == adjustObjectSize(size), | |
| 1197 "use adjustObjectSize() before calling into allocate()"); | |
| 1198 | |
| 1199 if (_adaptive_freelists) { | |
| 1200 res = allocate_adaptive_freelists(size); | |
| 1201 } else { // non-adaptive free lists | |
| 1202 res = allocate_non_adaptive_freelists(size); | |
| 1203 } | |
| 1204 | |
| 1205 if (res != NULL) { | |
| 1206 // check that res does lie in this space! | |
| 1207 assert(is_in_reserved(res), "Not in this space!"); | |
| 1208 assert(is_aligned((void*)res), "alignment check"); | |
| 1209 | |
| 1210 FreeChunk* fc = (FreeChunk*)res; | |
| 1211 fc->markNotFree(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1212 assert(!fc->is_free(), "shouldn't be marked free"); |
| 187 | 1213 assert(oop(fc)->klass_or_null() == NULL, "should look uninitialized"); |
| 0 | 1214 // Verify that the block offset table shows this to |
| 1215 // be a single block, but not one which is unallocated. | |
| 1216 _bt.verify_single_block(res, size); | |
| 1217 _bt.verify_not_unallocated(res, size); | |
| 1218 // mangle a just allocated object with a distinct pattern. | |
| 1219 debug_only(fc->mangleAllocated(size)); | |
| 1220 } | |
| 1221 | |
| 1222 return res; | |
| 1223 } | |
| 1224 | |
| 1225 HeapWord* CompactibleFreeListSpace::allocate_non_adaptive_freelists(size_t size) { | |
| 1226 HeapWord* res = NULL; | |
| 1227 // try and use linear allocation for smaller blocks | |
| 1228 if (size < _smallLinearAllocBlock._allocation_size_limit) { | |
| 1229 // if successful, the following also adjusts block offset table | |
| 1230 res = getChunkFromSmallLinearAllocBlock(size); | |
| 1231 } | |
| 1232 // Else triage to indexed lists for smaller sizes | |
| 1233 if (res == NULL) { | |
| 1234 if (size < SmallForDictionary) { | |
| 1235 res = (HeapWord*) getChunkFromIndexedFreeList(size); | |
| 1236 } else { | |
| 1237 // else get it from the big dictionary; if even this doesn't | |
| 1238 // work we are out of luck. | |
| 1239 res = (HeapWord*)getChunkFromDictionaryExact(size); | |
| 1240 } | |
| 1241 } | |
| 1242 | |
| 1243 return res; | |
| 1244 } | |
| 1245 | |
| 1246 HeapWord* CompactibleFreeListSpace::allocate_adaptive_freelists(size_t size) { | |
| 1247 assert_lock_strong(freelistLock()); | |
| 1248 HeapWord* res = NULL; | |
| 1249 assert(size == adjustObjectSize(size), | |
| 1250 "use adjustObjectSize() before calling into allocate()"); | |
| 1251 | |
| 1252 // Strategy | |
| 1253 // if small | |
| 1254 // exact size from small object indexed list if small | |
| 1255 // small or large linear allocation block (linAB) as appropriate | |
| 1256 // take from lists of greater sized chunks | |
| 1257 // else | |
| 1258 // dictionary | |
| 1259 // small or large linear allocation block if it has the space | |
| 1260 // Try allocating exact size from indexTable first | |
| 1261 if (size < IndexSetSize) { | |
| 1262 res = (HeapWord*) getChunkFromIndexedFreeList(size); | |
| 1263 if(res != NULL) { | |
| 1264 assert(res != (HeapWord*)_indexedFreeList[size].head(), | |
| 1265 "Not removed from free list"); | |
| 1266 // no block offset table adjustment is necessary on blocks in | |
| 1267 // the indexed lists. | |
| 1268 | |
| 1269 // Try allocating from the small LinAB | |
| 1270 } else if (size < _smallLinearAllocBlock._allocation_size_limit && | |
| 1271 (res = getChunkFromSmallLinearAllocBlock(size)) != NULL) { | |
| 1272 // if successful, the above also adjusts block offset table | |
| 1273 // Note that this call will refill the LinAB to | |
| 1274 // satisfy the request. This is different that | |
| 1275 // evm. | |
| 1276 // Don't record chunk off a LinAB? smallSplitBirth(size); | |
| 1277 } else { | |
| 1278 // Raid the exact free lists larger than size, even if they are not | |
| 1279 // overpopulated. | |
| 1280 res = (HeapWord*) getChunkFromGreater(size); | |
| 1281 } | |
| 1282 } else { | |
| 1283 // Big objects get allocated directly from the dictionary. | |
| 1284 res = (HeapWord*) getChunkFromDictionaryExact(size); | |
| 1285 if (res == NULL) { | |
| 1286 // Try hard not to fail since an allocation failure will likely | |
| 1287 // trigger a synchronous GC. Try to get the space from the | |
| 1288 // allocation blocks. | |
| 1289 res = getChunkFromSmallLinearAllocBlockRemainder(size); | |
| 1290 } | |
| 1291 } | |
| 1292 | |
| 1293 return res; | |
| 1294 } | |
| 1295 | |
| 1296 // A worst-case estimate of the space required (in HeapWords) to expand the heap | |
| 1297 // when promoting obj. | |
| 1298 size_t CompactibleFreeListSpace::expansionSpaceRequired(size_t obj_size) const { | |
| 1299 // Depending on the object size, expansion may require refilling either a | |
| 1300 // bigLAB or a smallLAB plus refilling a PromotionInfo object. MinChunkSize | |
| 1301 // is added because the dictionary may over-allocate to avoid fragmentation. | |
| 1302 size_t space = obj_size; | |
| 1303 if (!_adaptive_freelists) { | |
| 1304 space = MAX2(space, _smallLinearAllocBlock._refillSize); | |
| 1305 } | |
| 1306 space += _promoInfo.refillSize() + 2 * MinChunkSize; | |
| 1307 return space; | |
| 1308 } | |
| 1309 | |
| 1310 FreeChunk* CompactibleFreeListSpace::getChunkFromGreater(size_t numWords) { | |
| 1311 FreeChunk* ret; | |
| 1312 | |
| 1313 assert(numWords >= MinChunkSize, "Size is less than minimum"); | |
| 1314 assert(linearAllocationWouldFail() || bestFitFirst(), | |
| 1315 "Should not be here"); | |
| 1316 | |
| 1317 size_t i; | |
| 1318 size_t currSize = numWords + MinChunkSize; | |
| 1319 assert(currSize % MinObjAlignment == 0, "currSize should be aligned"); | |
| 1320 for (i = currSize; i < IndexSetSize; i += IndexSetStride) { | |
| 6885 | 1321 AdaptiveFreeList<FreeChunk>* fl = &_indexedFreeList[i]; |
| 0 | 1322 if (fl->head()) { |
| 1323 ret = getFromListGreater(fl, numWords); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1324 assert(ret == NULL || ret->is_free(), "Should be returning a free chunk"); |
| 0 | 1325 return ret; |
| 1326 } | |
| 1327 } | |
| 1328 | |
| 1329 currSize = MAX2((size_t)SmallForDictionary, | |
| 1330 (size_t)(numWords + MinChunkSize)); | |
| 1331 | |
| 1332 /* Try to get a chunk that satisfies request, while avoiding | |
| 1333 fragmentation that can't be handled. */ | |
| 1334 { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1335 ret = dictionary()->get_chunk(currSize); |
| 0 | 1336 if (ret != NULL) { |
| 1337 assert(ret->size() - numWords >= MinChunkSize, | |
| 1338 "Chunk is too small"); | |
| 1339 _bt.allocated((HeapWord*)ret, ret->size()); | |
| 1340 /* Carve returned chunk. */ | |
| 1341 (void) splitChunkAndReturnRemainder(ret, numWords); | |
| 1342 /* Label this as no longer a free chunk. */ | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1343 assert(ret->is_free(), "This chunk should be free"); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1344 ret->link_prev(NULL); |
| 0 | 1345 } |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1346 assert(ret == NULL || ret->is_free(), "Should be returning a free chunk"); |
| 0 | 1347 return ret; |
| 1348 } | |
| 1349 ShouldNotReachHere(); | |
| 1350 } | |
| 1351 | |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1352 bool CompactibleFreeListSpace::verifyChunkInIndexedFreeLists(FreeChunk* fc) const { |
| 0 | 1353 assert(fc->size() < IndexSetSize, "Size of chunk is too large"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1354 return _indexedFreeList[fc->size()].verify_chunk_in_free_list(fc); |
| 0 | 1355 } |
| 1356 | |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1357 bool CompactibleFreeListSpace::verify_chunk_is_linear_alloc_block(FreeChunk* fc) const { |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1358 assert((_smallLinearAllocBlock._ptr != (HeapWord*)fc) || |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1359 (_smallLinearAllocBlock._word_size == fc->size()), |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1360 "Linear allocation block shows incorrect size"); |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1361 return ((_smallLinearAllocBlock._ptr == (HeapWord*)fc) && |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1362 (_smallLinearAllocBlock._word_size == fc->size())); |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1363 } |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1364 |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1365 // Check if the purported free chunk is present either as a linear |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1366 // allocation block, the size-indexed table of (smaller) free blocks, |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1367 // or the larger free blocks kept in the binary tree dictionary. |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1368 bool CompactibleFreeListSpace::verify_chunk_in_free_list(FreeChunk* fc) const { |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1369 if (verify_chunk_is_linear_alloc_block(fc)) { |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1370 return true; |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1371 } else if (fc->size() < IndexSetSize) { |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1372 return verifyChunkInIndexedFreeLists(fc); |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1373 } else { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1374 return dictionary()->verify_chunk_in_free_list(fc); |
| 0 | 1375 } |
| 1376 } | |
| 1377 | |
| 1378 #ifndef PRODUCT | |
| 1379 void CompactibleFreeListSpace::assert_locked() const { | |
| 1380 CMSLockVerifier::assert_locked(freelistLock(), parDictionaryAllocLock()); | |
| 1381 } | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1382 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1383 void CompactibleFreeListSpace::assert_locked(const Mutex* lock) const { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1384 CMSLockVerifier::assert_locked(lock); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1385 } |
| 0 | 1386 #endif |
| 1387 | |
| 1388 FreeChunk* CompactibleFreeListSpace::allocateScratch(size_t size) { | |
| 1389 // In the parallel case, the main thread holds the free list lock | |
| 1390 // on behalf the parallel threads. | |
| 1391 FreeChunk* fc; | |
| 1392 { | |
| 1393 // If GC is parallel, this might be called by several threads. | |
| 1394 // This should be rare enough that the locking overhead won't affect | |
| 1395 // the sequential code. | |
| 1396 MutexLockerEx x(parDictionaryAllocLock(), | |
| 1397 Mutex::_no_safepoint_check_flag); | |
| 1398 fc = getChunkFromDictionary(size); | |
| 1399 } | |
| 1400 if (fc != NULL) { | |
| 1401 fc->dontCoalesce(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1402 assert(fc->is_free(), "Should be free, but not coalescable"); |
| 0 | 1403 // Verify that the block offset table shows this to |
| 1404 // be a single block, but not one which is unallocated. | |
| 1405 _bt.verify_single_block((HeapWord*)fc, fc->size()); | |
| 1406 _bt.verify_not_unallocated((HeapWord*)fc, fc->size()); | |
| 1407 } | |
| 1408 return fc; | |
| 1409 } | |
| 1410 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
1411 oop CompactibleFreeListSpace::promote(oop obj, size_t obj_size) { |
| 0 | 1412 assert(obj_size == (size_t)obj->size(), "bad obj_size passed in"); |
| 1413 assert_locked(); | |
| 1414 | |
| 1415 // if we are tracking promotions, then first ensure space for | |
| 1416 // promotion (including spooling space for saving header if necessary). | |
| 1417 // then allocate and copy, then track promoted info if needed. | |
| 1418 // When tracking (see PromotionInfo::track()), the mark word may | |
| 1419 // be displaced and in this case restoration of the mark word | |
| 1420 // occurs in the (oop_since_save_marks_)iterate phase. | |
| 1421 if (_promoInfo.tracking() && !_promoInfo.ensure_spooling_space()) { | |
| 1422 return NULL; | |
| 1423 } | |
| 1424 // Call the allocate(size_t, bool) form directly to avoid the | |
| 1425 // additional call through the allocate(size_t) form. Having | |
| 1426 // the compile inline the call is problematic because allocate(size_t) | |
| 1427 // is a virtual method. | |
| 1428 HeapWord* res = allocate(adjustObjectSize(obj_size)); | |
| 1429 if (res != NULL) { | |
| 1430 Copy::aligned_disjoint_words((HeapWord*)obj, res, obj_size); | |
| 1431 // if we should be tracking promotions, do so. | |
| 1432 if (_promoInfo.tracking()) { | |
| 1433 _promoInfo.track((PromotedObject*)res); | |
| 1434 } | |
| 1435 } | |
| 1436 return oop(res); | |
| 1437 } | |
| 1438 | |
| 1439 HeapWord* | |
| 1440 CompactibleFreeListSpace::getChunkFromSmallLinearAllocBlock(size_t size) { | |
| 1441 assert_locked(); | |
| 1442 assert(size >= MinChunkSize, "minimum chunk size"); | |
| 1443 assert(size < _smallLinearAllocBlock._allocation_size_limit, | |
| 1444 "maximum from smallLinearAllocBlock"); | |
| 1445 return getChunkFromLinearAllocBlock(&_smallLinearAllocBlock, size); | |
| 1446 } | |
| 1447 | |
| 1448 HeapWord* | |
| 1449 CompactibleFreeListSpace::getChunkFromLinearAllocBlock(LinearAllocBlock *blk, | |
| 1450 size_t size) { | |
| 1451 assert_locked(); | |
| 1452 assert(size >= MinChunkSize, "too small"); | |
| 1453 HeapWord* res = NULL; | |
| 1454 // Try to do linear allocation from blk, making sure that | |
| 1455 if (blk->_word_size == 0) { | |
| 1456 // We have probably been unable to fill this either in the prologue or | |
| 1457 // when it was exhausted at the last linear allocation. Bail out until | |
| 1458 // next time. | |
| 1459 assert(blk->_ptr == NULL, "consistency check"); | |
| 1460 return NULL; | |
| 1461 } | |
| 1462 assert(blk->_word_size != 0 && blk->_ptr != NULL, "consistency check"); | |
| 1463 res = getChunkFromLinearAllocBlockRemainder(blk, size); | |
| 1464 if (res != NULL) return res; | |
| 1465 | |
| 1466 // about to exhaust this linear allocation block | |
| 1467 if (blk->_word_size == size) { // exactly satisfied | |
| 1468 res = blk->_ptr; | |
| 1469 _bt.allocated(res, blk->_word_size); | |
| 1470 } else if (size + MinChunkSize <= blk->_refillSize) { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1471 size_t sz = blk->_word_size; |
| 0 | 1472 // Update _unallocated_block if the size is such that chunk would be |
| 1473 // returned to the indexed free list. All other chunks in the indexed | |
| 1474 // free lists are allocated from the dictionary so that _unallocated_block | |
| 1475 // has already been adjusted for them. Do it here so that the cost | |
| 1476 // for all chunks added back to the indexed free lists. | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1477 if (sz < SmallForDictionary) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1478 _bt.allocated(blk->_ptr, sz); |
| 0 | 1479 } |
| 1480 // Return the chunk that isn't big enough, and then refill below. | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1481 addChunkToFreeLists(blk->_ptr, sz); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1482 split_birth(sz); |
| 0 | 1483 // Don't keep statistics on adding back chunk from a LinAB. |
| 1484 } else { | |
| 1485 // A refilled block would not satisfy the request. | |
| 1486 return NULL; | |
| 1487 } | |
| 1488 | |
| 1489 blk->_ptr = NULL; blk->_word_size = 0; | |
| 1490 refillLinearAllocBlock(blk); | |
| 1491 assert(blk->_ptr == NULL || blk->_word_size >= size + MinChunkSize, | |
| 1492 "block was replenished"); | |
| 1493 if (res != NULL) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1494 split_birth(size); |
| 0 | 1495 repairLinearAllocBlock(blk); |
| 1496 } else if (blk->_ptr != NULL) { | |
| 1497 res = blk->_ptr; | |
| 1498 size_t blk_size = blk->_word_size; | |
| 1499 blk->_word_size -= size; | |
| 1500 blk->_ptr += size; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1501 split_birth(size); |
| 0 | 1502 repairLinearAllocBlock(blk); |
| 1503 // Update BOT last so that other (parallel) GC threads see a consistent | |
| 1504 // view of the BOT and free blocks. | |
| 1505 // Above must occur before BOT is updated below. | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
1506 OrderAccess::storestore(); |
| 0 | 1507 _bt.split_block(res, blk_size, size); // adjust block offset table |
| 1508 } | |
| 1509 return res; | |
| 1510 } | |
| 1511 | |
| 1512 HeapWord* CompactibleFreeListSpace::getChunkFromLinearAllocBlockRemainder( | |
| 1513 LinearAllocBlock* blk, | |
| 1514 size_t size) { | |
| 1515 assert_locked(); | |
| 1516 assert(size >= MinChunkSize, "too small"); | |
| 1517 | |
| 1518 HeapWord* res = NULL; | |
| 1519 // This is the common case. Keep it simple. | |
| 1520 if (blk->_word_size >= size + MinChunkSize) { | |
| 1521 assert(blk->_ptr != NULL, "consistency check"); | |
| 1522 res = blk->_ptr; | |
| 1523 // Note that the BOT is up-to-date for the linAB before allocation. It | |
| 1524 // indicates the start of the linAB. The split_block() updates the | |
| 1525 // BOT for the linAB after the allocation (indicates the start of the | |
| 1526 // next chunk to be allocated). | |
| 1527 size_t blk_size = blk->_word_size; | |
| 1528 blk->_word_size -= size; | |
| 1529 blk->_ptr += size; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1530 split_birth(size); |
| 0 | 1531 repairLinearAllocBlock(blk); |
| 1532 // Update BOT last so that other (parallel) GC threads see a consistent | |
| 1533 // view of the BOT and free blocks. | |
| 1534 // Above must occur before BOT is updated below. | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
1535 OrderAccess::storestore(); |
| 0 | 1536 _bt.split_block(res, blk_size, size); // adjust block offset table |
| 1537 _bt.allocated(res, size); | |
| 1538 } | |
| 1539 return res; | |
| 1540 } | |
| 1541 | |
| 1542 FreeChunk* | |
| 1543 CompactibleFreeListSpace::getChunkFromIndexedFreeList(size_t size) { | |
| 1544 assert_locked(); | |
| 1545 assert(size < SmallForDictionary, "just checking"); | |
| 1546 FreeChunk* res; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1547 res = _indexedFreeList[size].get_chunk_at_head(); |
| 0 | 1548 if (res == NULL) { |
| 1549 res = getChunkFromIndexedFreeListHelper(size); | |
| 1550 } | |
| 1551 _bt.verify_not_unallocated((HeapWord*) res, size); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1552 assert(res == NULL || res->size() == size, "Incorrect block size"); |
| 0 | 1553 return res; |
| 1554 } | |
| 1555 | |
| 1556 FreeChunk* | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1557 CompactibleFreeListSpace::getChunkFromIndexedFreeListHelper(size_t size, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1558 bool replenish) { |
| 0 | 1559 assert_locked(); |
| 1560 FreeChunk* fc = NULL; | |
| 1561 if (size < SmallForDictionary) { | |
| 1562 assert(_indexedFreeList[size].head() == NULL || | |
| 1563 _indexedFreeList[size].surplus() <= 0, | |
| 1564 "List for this size should be empty or under populated"); | |
| 1565 // Try best fit in exact lists before replenishing the list | |
| 1566 if (!bestFitFirst() || (fc = bestFitSmall(size)) == NULL) { | |
| 1567 // Replenish list. | |
| 1568 // | |
| 1569 // Things tried that failed. | |
| 1570 // Tried allocating out of the two LinAB's first before | |
| 1571 // replenishing lists. | |
| 1572 // Tried small linAB of size 256 (size in indexed list) | |
| 1573 // and replenishing indexed lists from the small linAB. | |
| 1574 // | |
| 1575 FreeChunk* newFc = NULL; | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1576 const size_t replenish_size = CMSIndexedFreeListReplenish * size; |
| 0 | 1577 if (replenish_size < SmallForDictionary) { |
| 1578 // Do not replenish from an underpopulated size. | |
| 1579 if (_indexedFreeList[replenish_size].surplus() > 0 && | |
| 1580 _indexedFreeList[replenish_size].head() != NULL) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1581 newFc = _indexedFreeList[replenish_size].get_chunk_at_head(); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1582 } else if (bestFitFirst()) { |
| 0 | 1583 newFc = bestFitSmall(replenish_size); |
| 1584 } | |
| 1585 } | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1586 if (newFc == NULL && replenish_size > size) { |
| 0 | 1587 assert(CMSIndexedFreeListReplenish > 1, "ctl pt invariant"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1588 newFc = getChunkFromIndexedFreeListHelper(replenish_size, false); |
| 0 | 1589 } |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1590 // Note: The stats update re split-death of block obtained above |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1591 // will be recorded below precisely when we know we are going to |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1592 // be actually splitting it into more than one pieces below. |
| 0 | 1593 if (newFc != NULL) { |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1594 if (replenish || CMSReplenishIntermediate) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1595 // Replenish this list and return one block to caller. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1596 size_t i; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1597 FreeChunk *curFc, *nextFc; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1598 size_t num_blk = newFc->size() / size; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1599 assert(num_blk >= 1, "Smaller than requested?"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1600 assert(newFc->size() % size == 0, "Should be integral multiple of request"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1601 if (num_blk > 1) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1602 // we are sure we will be splitting the block just obtained |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1603 // into multiple pieces; record the split-death of the original |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1604 splitDeath(replenish_size); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1605 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1606 // carve up and link blocks 0, ..., num_blk - 2 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1607 // The last chunk is not added to the lists but is returned as the |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1608 // free chunk. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1609 for (curFc = newFc, nextFc = (FreeChunk*)((HeapWord*)curFc + size), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1610 i = 0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1611 i < (num_blk - 1); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1612 curFc = nextFc, nextFc = (FreeChunk*)((HeapWord*)nextFc + size), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1613 i++) { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1614 curFc->set_size(size); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1615 // Don't record this as a return in order to try and |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1616 // determine the "returns" from a GC. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1617 _bt.verify_not_unallocated((HeapWord*) fc, size); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1618 _indexedFreeList[size].return_chunk_at_tail(curFc, false); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1619 _bt.mark_block((HeapWord*)curFc, size); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1620 split_birth(size); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1621 // Don't record the initial population of the indexed list |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1622 // as a split birth. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1623 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1624 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1625 // check that the arithmetic was OK above |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1626 assert((HeapWord*)nextFc == (HeapWord*)newFc + num_blk*size, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1627 "inconsistency in carving newFc"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1628 curFc->set_size(size); |
| 0 | 1629 _bt.mark_block((HeapWord*)curFc, size); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1630 split_birth(size); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1631 fc = curFc; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1632 } else { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1633 // Return entire block to caller |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1634 fc = newFc; |
| 0 | 1635 } |
| 1636 } | |
| 1637 } | |
| 1638 } else { | |
| 1639 // Get a free chunk from the free chunk dictionary to be returned to | |
| 1640 // replenish the indexed free list. | |
| 1641 fc = getChunkFromDictionaryExact(size); | |
| 1642 } | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1643 // assert(fc == NULL || fc->is_free(), "Should be returning a free chunk"); |
| 0 | 1644 return fc; |
| 1645 } | |
| 1646 | |
| 1647 FreeChunk* | |
| 1648 CompactibleFreeListSpace::getChunkFromDictionary(size_t size) { | |
| 1649 assert_locked(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1650 FreeChunk* fc = _dictionary->get_chunk(size); |
| 0 | 1651 if (fc == NULL) { |
| 1652 return NULL; | |
| 1653 } | |
| 1654 _bt.allocated((HeapWord*)fc, fc->size()); | |
| 1655 if (fc->size() >= size + MinChunkSize) { | |
| 1656 fc = splitChunkAndReturnRemainder(fc, size); | |
| 1657 } | |
| 1658 assert(fc->size() >= size, "chunk too small"); | |
| 1659 assert(fc->size() < size + MinChunkSize, "chunk too big"); | |
| 1660 _bt.verify_single_block((HeapWord*)fc, fc->size()); | |
| 1661 return fc; | |
| 1662 } | |
| 1663 | |
| 1664 FreeChunk* | |
| 1665 CompactibleFreeListSpace::getChunkFromDictionaryExact(size_t size) { | |
| 1666 assert_locked(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1667 FreeChunk* fc = _dictionary->get_chunk(size); |
| 0 | 1668 if (fc == NULL) { |
| 1669 return fc; | |
| 1670 } | |
| 1671 _bt.allocated((HeapWord*)fc, fc->size()); | |
| 1672 if (fc->size() == size) { | |
| 1673 _bt.verify_single_block((HeapWord*)fc, size); | |
| 1674 return fc; | |
| 1675 } | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1676 assert(fc->size() > size, "get_chunk() guarantee"); |
| 0 | 1677 if (fc->size() < size + MinChunkSize) { |
| 1678 // Return the chunk to the dictionary and go get a bigger one. | |
| 1679 returnChunkToDictionary(fc); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1680 fc = _dictionary->get_chunk(size + MinChunkSize); |
| 0 | 1681 if (fc == NULL) { |
| 1682 return NULL; | |
| 1683 } | |
| 1684 _bt.allocated((HeapWord*)fc, fc->size()); | |
| 1685 } | |
| 1686 assert(fc->size() >= size + MinChunkSize, "tautology"); | |
| 1687 fc = splitChunkAndReturnRemainder(fc, size); | |
| 1688 assert(fc->size() == size, "chunk is wrong size"); | |
| 1689 _bt.verify_single_block((HeapWord*)fc, size); | |
| 1690 return fc; | |
| 1691 } | |
| 1692 | |
| 1693 void | |
| 1694 CompactibleFreeListSpace::returnChunkToDictionary(FreeChunk* chunk) { | |
| 1695 assert_locked(); | |
| 1696 | |
| 1697 size_t size = chunk->size(); | |
| 1698 _bt.verify_single_block((HeapWord*)chunk, size); | |
| 1699 // adjust _unallocated_block downward, as necessary | |
| 1700 _bt.freed((HeapWord*)chunk, size); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1701 _dictionary->return_chunk(chunk); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1702 #ifndef PRODUCT |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1703 if (CMSCollector::abstract_state() != CMSCollector::Sweeping) { |
| 6885 | 1704 TreeChunk<FreeChunk, AdaptiveFreeList>* tc = TreeChunk<FreeChunk, AdaptiveFreeList>::as_TreeChunk(chunk); |
| 1705 TreeList<FreeChunk, AdaptiveFreeList>* tl = tc->list(); | |
| 1706 tl->verify_stats(); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1707 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1708 #endif // PRODUCT |
| 0 | 1709 } |
| 1710 | |
| 1711 void | |
| 1712 CompactibleFreeListSpace::returnChunkToFreeList(FreeChunk* fc) { | |
| 1713 assert_locked(); | |
| 1714 size_t size = fc->size(); | |
| 1715 _bt.verify_single_block((HeapWord*) fc, size); | |
| 1716 _bt.verify_not_unallocated((HeapWord*) fc, size); | |
| 1717 if (_adaptive_freelists) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1718 _indexedFreeList[size].return_chunk_at_tail(fc); |
| 0 | 1719 } else { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1720 _indexedFreeList[size].return_chunk_at_head(fc); |
| 0 | 1721 } |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1722 #ifndef PRODUCT |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1723 if (CMSCollector::abstract_state() != CMSCollector::Sweeping) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1724 _indexedFreeList[size].verify_stats(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1725 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1726 #endif // PRODUCT |
| 0 | 1727 } |
| 1728 | |
| 1729 // Add chunk to end of last block -- if it's the largest | |
| 1730 // block -- and update BOT and census data. We would | |
| 1731 // of course have preferred to coalesce it with the | |
| 1732 // last block, but it's currently less expensive to find the | |
| 1733 // largest block than it is to find the last. | |
| 1734 void | |
| 1735 CompactibleFreeListSpace::addChunkToFreeListsAtEndRecordingStats( | |
| 1736 HeapWord* chunk, size_t size) { | |
| 1737 // check that the chunk does lie in this space! | |
| 1738 assert(chunk != NULL && is_in_reserved(chunk), "Not in this space!"); | |
| 1739 // One of the parallel gc task threads may be here | |
| 1740 // whilst others are allocating. | |
| 1741 Mutex* lock = NULL; | |
| 1742 if (ParallelGCThreads != 0) { | |
| 1743 lock = &_parDictionaryAllocLock; | |
| 1744 } | |
| 1745 FreeChunk* ec; | |
| 1746 { | |
| 1747 MutexLockerEx x(lock, Mutex::_no_safepoint_check_flag); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1748 ec = dictionary()->find_largest_dict(); // get largest block |
| 6885 | 1749 if (ec != NULL && ec->end() == (uintptr_t*) chunk) { |
| 0 | 1750 // It's a coterminal block - we can coalesce. |
| 1751 size_t old_size = ec->size(); | |
| 1752 coalDeath(old_size); | |
| 1753 removeChunkFromDictionary(ec); | |
| 1754 size += old_size; | |
| 1755 } else { | |
| 1756 ec = (FreeChunk*)chunk; | |
| 1757 } | |
| 1758 } | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1759 ec->set_size(size); |
| 0 | 1760 debug_only(ec->mangleFreed(size)); |
| 1761 if (size < SmallForDictionary) { | |
| 1762 lock = _indexedFreeListParLocks[size]; | |
| 1763 } | |
| 1764 MutexLockerEx x(lock, Mutex::_no_safepoint_check_flag); | |
| 1765 addChunkAndRepairOffsetTable((HeapWord*)ec, size, true); | |
| 1766 // record the birth under the lock since the recording involves | |
| 1767 // manipulation of the list on which the chunk lives and | |
| 1768 // if the chunk is allocated and is the last on the list, | |
| 1769 // the list can go away. | |
| 1770 coalBirth(size); | |
| 1771 } | |
| 1772 | |
| 1773 void | |
| 1774 CompactibleFreeListSpace::addChunkToFreeLists(HeapWord* chunk, | |
| 1775 size_t size) { | |
| 1776 // check that the chunk does lie in this space! | |
| 1777 assert(chunk != NULL && is_in_reserved(chunk), "Not in this space!"); | |
| 1778 assert_locked(); | |
| 1779 _bt.verify_single_block(chunk, size); | |
| 1780 | |
| 1781 FreeChunk* fc = (FreeChunk*) chunk; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1782 fc->set_size(size); |
| 0 | 1783 debug_only(fc->mangleFreed(size)); |
| 1784 if (size < SmallForDictionary) { | |
| 1785 returnChunkToFreeList(fc); | |
| 1786 } else { | |
| 1787 returnChunkToDictionary(fc); | |
| 1788 } | |
| 1789 } | |
| 1790 | |
| 1791 void | |
| 1792 CompactibleFreeListSpace::addChunkAndRepairOffsetTable(HeapWord* chunk, | |
| 1793 size_t size, bool coalesced) { | |
| 1794 assert_locked(); | |
| 1795 assert(chunk != NULL, "null chunk"); | |
| 1796 if (coalesced) { | |
| 1797 // repair BOT | |
| 1798 _bt.single_block(chunk, size); | |
| 1799 } | |
| 1800 addChunkToFreeLists(chunk, size); | |
| 1801 } | |
| 1802 | |
| 1803 // We _must_ find the purported chunk on our free lists; | |
| 1804 // we assert if we don't. | |
| 1805 void | |
| 1806 CompactibleFreeListSpace::removeFreeChunkFromFreeLists(FreeChunk* fc) { | |
| 1807 size_t size = fc->size(); | |
| 1808 assert_locked(); | |
| 1809 debug_only(verifyFreeLists()); | |
| 1810 if (size < SmallForDictionary) { | |
| 1811 removeChunkFromIndexedFreeList(fc); | |
| 1812 } else { | |
| 1813 removeChunkFromDictionary(fc); | |
| 1814 } | |
| 1815 _bt.verify_single_block((HeapWord*)fc, size); | |
| 1816 debug_only(verifyFreeLists()); | |
| 1817 } | |
| 1818 | |
| 1819 void | |
| 1820 CompactibleFreeListSpace::removeChunkFromDictionary(FreeChunk* fc) { | |
| 1821 size_t size = fc->size(); | |
| 1822 assert_locked(); | |
| 1823 assert(fc != NULL, "null chunk"); | |
| 1824 _bt.verify_single_block((HeapWord*)fc, size); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1825 _dictionary->remove_chunk(fc); |
| 0 | 1826 // adjust _unallocated_block upward, as necessary |
| 1827 _bt.allocated((HeapWord*)fc, size); | |
| 1828 } | |
| 1829 | |
| 1830 void | |
| 1831 CompactibleFreeListSpace::removeChunkFromIndexedFreeList(FreeChunk* fc) { | |
| 1832 assert_locked(); | |
| 1833 size_t size = fc->size(); | |
| 1834 _bt.verify_single_block((HeapWord*)fc, size); | |
| 1835 NOT_PRODUCT( | |
| 1836 if (FLSVerifyIndexTable) { | |
| 1837 verifyIndexedFreeList(size); | |
| 1838 } | |
| 1839 ) | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1840 _indexedFreeList[size].remove_chunk(fc); |
| 0 | 1841 NOT_PRODUCT( |
| 1842 if (FLSVerifyIndexTable) { | |
| 1843 verifyIndexedFreeList(size); | |
| 1844 } | |
| 1845 ) | |
| 1846 } | |
| 1847 | |
| 1848 FreeChunk* CompactibleFreeListSpace::bestFitSmall(size_t numWords) { | |
| 1849 /* A hint is the next larger size that has a surplus. | |
| 1850 Start search at a size large enough to guarantee that | |
| 1851 the excess is >= MIN_CHUNK. */ | |
| 1852 size_t start = align_object_size(numWords + MinChunkSize); | |
| 1853 if (start < IndexSetSize) { | |
| 6885 | 1854 AdaptiveFreeList<FreeChunk>* it = _indexedFreeList; |
| 0 | 1855 size_t hint = _indexedFreeList[start].hint(); |
| 1856 while (hint < IndexSetSize) { | |
| 1857 assert(hint % MinObjAlignment == 0, "hint should be aligned"); | |
| 6885 | 1858 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[hint]; |
| 0 | 1859 if (fl->surplus() > 0 && fl->head() != NULL) { |
| 1860 // Found a list with surplus, reset original hint | |
| 1861 // and split out a free chunk which is returned. | |
| 1862 _indexedFreeList[start].set_hint(hint); | |
| 1863 FreeChunk* res = getFromListGreater(fl, numWords); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1864 assert(res == NULL || res->is_free(), |
| 0 | 1865 "Should be returning a free chunk"); |
| 1866 return res; | |
| 1867 } | |
| 1868 hint = fl->hint(); /* keep looking */ | |
| 1869 } | |
| 1870 /* None found. */ | |
| 1871 it[start].set_hint(IndexSetSize); | |
| 1872 } | |
| 1873 return NULL; | |
| 1874 } | |
| 1875 | |
| 1876 /* Requires fl->size >= numWords + MinChunkSize */ | |
| 6885 | 1877 FreeChunk* CompactibleFreeListSpace::getFromListGreater(AdaptiveFreeList<FreeChunk>* fl, |
| 0 | 1878 size_t numWords) { |
| 1879 FreeChunk *curr = fl->head(); | |
| 1880 size_t oldNumWords = curr->size(); | |
| 1881 assert(numWords >= MinChunkSize, "Word size is too small"); | |
| 1882 assert(curr != NULL, "List is empty"); | |
| 1883 assert(oldNumWords >= numWords + MinChunkSize, | |
| 1884 "Size of chunks in the list is too small"); | |
| 1885 | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1886 fl->remove_chunk(curr); |
| 0 | 1887 // recorded indirectly by splitChunkAndReturnRemainder - |
| 1888 // smallSplit(oldNumWords, numWords); | |
| 1889 FreeChunk* new_chunk = splitChunkAndReturnRemainder(curr, numWords); | |
| 1890 // Does anything have to be done for the remainder in terms of | |
| 1891 // fixing the card table? | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1892 assert(new_chunk == NULL || new_chunk->is_free(), |
| 0 | 1893 "Should be returning a free chunk"); |
| 1894 return new_chunk; | |
| 1895 } | |
| 1896 | |
| 1897 FreeChunk* | |
| 1898 CompactibleFreeListSpace::splitChunkAndReturnRemainder(FreeChunk* chunk, | |
| 1899 size_t new_size) { | |
| 1900 assert_locked(); | |
| 1901 size_t size = chunk->size(); | |
| 1902 assert(size > new_size, "Split from a smaller block?"); | |
| 1903 assert(is_aligned(chunk), "alignment problem"); | |
| 1904 assert(size == adjustObjectSize(size), "alignment problem"); | |
| 1905 size_t rem_size = size - new_size; | |
| 1906 assert(rem_size == adjustObjectSize(rem_size), "alignment problem"); | |
| 1907 assert(rem_size >= MinChunkSize, "Free chunk smaller than minimum"); | |
| 1908 FreeChunk* ffc = (FreeChunk*)((HeapWord*)chunk + new_size); | |
| 1909 assert(is_aligned(ffc), "alignment problem"); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1910 ffc->set_size(rem_size); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1911 ffc->link_next(NULL); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1912 ffc->link_prev(NULL); // Mark as a free block for other (parallel) GC threads. |
| 0 | 1913 // Above must occur before BOT is updated below. |
| 1914 // adjust block offset table | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
1915 OrderAccess::storestore(); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1916 assert(chunk->is_free() && ffc->is_free(), "Error"); |
| 0 | 1917 _bt.split_block((HeapWord*)chunk, chunk->size(), new_size); |
| 1918 if (rem_size < SmallForDictionary) { | |
| 1919 bool is_par = (SharedHeap::heap()->n_par_threads() > 0); | |
| 1920 if (is_par) _indexedFreeListParLocks[rem_size]->lock(); | |
|
4095
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
4068
diff
changeset
|
1921 assert(!is_par || |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
4068
diff
changeset
|
1922 (SharedHeap::heap()->n_par_threads() == |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
4068
diff
changeset
|
1923 SharedHeap::heap()->workers()->active_workers()), "Mismatch"); |
| 0 | 1924 returnChunkToFreeList(ffc); |
| 1925 split(size, rem_size); | |
| 1926 if (is_par) _indexedFreeListParLocks[rem_size]->unlock(); | |
| 1927 } else { | |
| 1928 returnChunkToDictionary(ffc); | |
| 1929 split(size ,rem_size); | |
| 1930 } | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1931 chunk->set_size(new_size); |
| 0 | 1932 return chunk; |
| 1933 } | |
| 1934 | |
| 1935 void | |
| 1936 CompactibleFreeListSpace::sweep_completed() { | |
| 1937 // Now that space is probably plentiful, refill linear | |
| 1938 // allocation blocks as needed. | |
| 1939 refillLinearAllocBlocksIfNeeded(); | |
| 1940 } | |
| 1941 | |
| 1942 void | |
| 1943 CompactibleFreeListSpace::gc_prologue() { | |
| 1944 assert_locked(); | |
| 1945 if (PrintFLSStatistics != 0) { | |
| 1946 gclog_or_tty->print("Before GC:\n"); | |
| 1947 reportFreeListStatistics(); | |
| 1948 } | |
| 1949 refillLinearAllocBlocksIfNeeded(); | |
| 1950 } | |
| 1951 | |
| 1952 void | |
| 1953 CompactibleFreeListSpace::gc_epilogue() { | |
| 1954 assert_locked(); | |
| 1955 if (PrintGCDetails && Verbose && !_adaptive_freelists) { | |
| 1956 if (_smallLinearAllocBlock._word_size == 0) | |
| 1957 warning("CompactibleFreeListSpace(epilogue):: Linear allocation failure"); | |
| 1958 } | |
| 1959 assert(_promoInfo.noPromotions(), "_promoInfo inconsistency"); | |
| 1960 _promoInfo.stopTrackingPromotions(); | |
| 1961 repairLinearAllocationBlocks(); | |
| 1962 // Print Space's stats | |
| 1963 if (PrintFLSStatistics != 0) { | |
| 1964 gclog_or_tty->print("After GC:\n"); | |
| 1965 reportFreeListStatistics(); | |
| 1966 } | |
| 1967 } | |
| 1968 | |
| 1969 // Iteration support, mostly delegated from a CMS generation | |
| 1970 | |
| 1971 void CompactibleFreeListSpace::save_marks() { | |
|
3293
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1972 assert(Thread::current()->is_VM_thread(), |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1973 "Global variable should only be set when single-threaded"); |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1974 // Mark the "end" of the used space at the time of this call; |
| 0 | 1975 // note, however, that promoted objects from this point |
| 1976 // on are tracked in the _promoInfo below. | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
1977 set_saved_mark_word(unallocated_block()); |
|
3293
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1978 #ifdef ASSERT |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1979 // Check the sanity of save_marks() etc. |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1980 MemRegion ur = used_region(); |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1981 MemRegion urasm = used_region_at_save_marks(); |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1982 assert(ur.contains(urasm), |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1983 err_msg(" Error at save_marks(): [" PTR_FORMAT "," PTR_FORMAT ")" |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1984 " should contain [" PTR_FORMAT "," PTR_FORMAT ")", |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1985 ur.start(), ur.end(), urasm.start(), urasm.end())); |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
1986 #endif |
| 0 | 1987 // inform allocator that promotions should be tracked. |
| 1988 assert(_promoInfo.noPromotions(), "_promoInfo inconsistency"); | |
| 1989 _promoInfo.startTrackingPromotions(); | |
| 1990 } | |
| 1991 | |
| 1992 bool CompactibleFreeListSpace::no_allocs_since_save_marks() { | |
| 1993 assert(_promoInfo.tracking(), "No preceding save_marks?"); | |
|
1777
179464550c7d
6983930: CMS: Various small cleanups ca September 2010
ysr
parents:
1716
diff
changeset
|
1994 assert(SharedHeap::heap()->n_par_threads() == 0, |
|
179464550c7d
6983930: CMS: Various small cleanups ca September 2010
ysr
parents:
1716
diff
changeset
|
1995 "Shouldn't be called if using parallel gc."); |
| 0 | 1996 return _promoInfo.noPromotions(); |
| 1997 } | |
| 1998 | |
| 1999 #define CFLS_OOP_SINCE_SAVE_MARKS_DEFN(OopClosureType, nv_suffix) \ | |
| 2000 \ | |
| 2001 void CompactibleFreeListSpace:: \ | |
| 2002 oop_since_save_marks_iterate##nv_suffix(OopClosureType* blk) { \ | |
| 2003 assert(SharedHeap::heap()->n_par_threads() == 0, \ | |
| 2004 "Shouldn't be called (yet) during parallel part of gc."); \ | |
| 2005 _promoInfo.promoted_oops_iterate##nv_suffix(blk); \ | |
| 2006 /* \ | |
| 2007 * This also restores any displaced headers and removes the elements from \ | |
| 2008 * the iteration set as they are processed, so that we have a clean slate \ | |
| 2009 * at the end of the iteration. Note, thus, that if new objects are \ | |
| 2010 * promoted as a result of the iteration they are iterated over as well. \ | |
| 2011 */ \ | |
| 2012 assert(_promoInfo.noPromotions(), "_promoInfo inconsistency"); \ | |
| 2013 } | |
| 2014 | |
| 2015 ALL_SINCE_SAVE_MARKS_CLOSURES(CFLS_OOP_SINCE_SAVE_MARKS_DEFN) | |
| 2016 | |
| 2017 | |
| 2018 void CompactibleFreeListSpace::object_iterate_since_last_GC(ObjectClosure* cl) { | |
| 2019 // ugghh... how would one do this efficiently for a non-contiguous space? | |
| 2020 guarantee(false, "NYI"); | |
| 2021 } | |
| 2022 | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2023 bool CompactibleFreeListSpace::linearAllocationWouldFail() const { |
| 0 | 2024 return _smallLinearAllocBlock._word_size == 0; |
| 2025 } | |
| 2026 | |
| 2027 void CompactibleFreeListSpace::repairLinearAllocationBlocks() { | |
| 2028 // Fix up linear allocation blocks to look like free blocks | |
| 2029 repairLinearAllocBlock(&_smallLinearAllocBlock); | |
| 2030 } | |
| 2031 | |
| 2032 void CompactibleFreeListSpace::repairLinearAllocBlock(LinearAllocBlock* blk) { | |
| 2033 assert_locked(); | |
| 2034 if (blk->_ptr != NULL) { | |
| 2035 assert(blk->_word_size != 0 && blk->_word_size >= MinChunkSize, | |
| 2036 "Minimum block size requirement"); | |
| 2037 FreeChunk* fc = (FreeChunk*)(blk->_ptr); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2038 fc->set_size(blk->_word_size); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2039 fc->link_prev(NULL); // mark as free |
| 0 | 2040 fc->dontCoalesce(); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2041 assert(fc->is_free(), "just marked it free"); |
| 0 | 2042 assert(fc->cantCoalesce(), "just marked it uncoalescable"); |
| 2043 } | |
| 2044 } | |
| 2045 | |
| 2046 void CompactibleFreeListSpace::refillLinearAllocBlocksIfNeeded() { | |
| 2047 assert_locked(); | |
| 2048 if (_smallLinearAllocBlock._ptr == NULL) { | |
| 2049 assert(_smallLinearAllocBlock._word_size == 0, | |
| 2050 "Size of linAB should be zero if the ptr is NULL"); | |
| 2051 // Reset the linAB refill and allocation size limit. | |
| 2052 _smallLinearAllocBlock.set(0, 0, 1024*SmallForLinearAlloc, SmallForLinearAlloc); | |
| 2053 } | |
| 2054 refillLinearAllocBlockIfNeeded(&_smallLinearAllocBlock); | |
| 2055 } | |
| 2056 | |
| 2057 void | |
| 2058 CompactibleFreeListSpace::refillLinearAllocBlockIfNeeded(LinearAllocBlock* blk) { | |
| 2059 assert_locked(); | |
| 2060 assert((blk->_ptr == NULL && blk->_word_size == 0) || | |
| 2061 (blk->_ptr != NULL && blk->_word_size >= MinChunkSize), | |
| 2062 "blk invariant"); | |
| 2063 if (blk->_ptr == NULL) { | |
| 2064 refillLinearAllocBlock(blk); | |
| 2065 } | |
| 2066 if (PrintMiscellaneous && Verbose) { | |
| 2067 if (blk->_word_size == 0) { | |
| 2068 warning("CompactibleFreeListSpace(prologue):: Linear allocation failure"); | |
| 2069 } | |
| 2070 } | |
| 2071 } | |
| 2072 | |
| 2073 void | |
| 2074 CompactibleFreeListSpace::refillLinearAllocBlock(LinearAllocBlock* blk) { | |
| 2075 assert_locked(); | |
| 2076 assert(blk->_word_size == 0 && blk->_ptr == NULL, | |
| 2077 "linear allocation block should be empty"); | |
| 2078 FreeChunk* fc; | |
| 2079 if (blk->_refillSize < SmallForDictionary && | |
| 2080 (fc = getChunkFromIndexedFreeList(blk->_refillSize)) != NULL) { | |
| 2081 // A linAB's strategy might be to use small sizes to reduce | |
| 2082 // fragmentation but still get the benefits of allocation from a | |
| 2083 // linAB. | |
| 2084 } else { | |
| 2085 fc = getChunkFromDictionary(blk->_refillSize); | |
| 2086 } | |
| 2087 if (fc != NULL) { | |
| 2088 blk->_ptr = (HeapWord*)fc; | |
| 2089 blk->_word_size = fc->size(); | |
| 2090 fc->dontCoalesce(); // to prevent sweeper from sweeping us up | |
| 2091 } | |
| 2092 } | |
| 2093 | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2094 // Support for concurrent collection policy decisions. |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2095 bool CompactibleFreeListSpace::should_concurrent_collect() const { |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2096 // In the future we might want to add in frgamentation stats -- |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2097 // including erosion of the "mountain" into this decision as well. |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2098 return !adaptive_freelists() && linearAllocationWouldFail(); |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2099 } |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2100 |
| 0 | 2101 // Support for compaction |
| 2102 | |
| 2103 void CompactibleFreeListSpace::prepare_for_compaction(CompactPoint* cp) { | |
| 2104 SCAN_AND_FORWARD(cp,end,block_is_obj,block_size); | |
| 2105 // prepare_for_compaction() uses the space between live objects | |
| 2106 // so that later phase can skip dead space quickly. So verification | |
| 2107 // of the free lists doesn't work after. | |
| 2108 } | |
| 2109 | |
| 2110 #define obj_size(q) adjustObjectSize(oop(q)->size()) | |
| 2111 #define adjust_obj_size(s) adjustObjectSize(s) | |
| 2112 | |
| 2113 void CompactibleFreeListSpace::adjust_pointers() { | |
| 2114 // In other versions of adjust_pointers(), a bail out | |
| 2115 // based on the amount of live data in the generation | |
| 2116 // (i.e., if 0, bail out) may be used. | |
| 2117 // Cannot test used() == 0 here because the free lists have already | |
| 2118 // been mangled by the compaction. | |
| 2119 | |
| 2120 SCAN_AND_ADJUST_POINTERS(adjust_obj_size); | |
| 2121 // See note about verification in prepare_for_compaction(). | |
| 2122 } | |
| 2123 | |
| 2124 void CompactibleFreeListSpace::compact() { | |
| 2125 SCAN_AND_COMPACT(obj_size); | |
| 2126 } | |
| 2127 | |
| 2128 // fragmentation_metric = 1 - [sum of (fbs**2) / (sum of fbs)**2] | |
| 2129 // where fbs is free block sizes | |
| 2130 double CompactibleFreeListSpace::flsFrag() const { | |
| 2131 size_t itabFree = totalSizeInIndexedFreeLists(); | |
| 2132 double frag = 0.0; | |
| 2133 size_t i; | |
| 2134 | |
| 2135 for (i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { | |
| 2136 double sz = i; | |
| 2137 frag += _indexedFreeList[i].count() * (sz * sz); | |
| 2138 } | |
| 2139 | |
| 2140 double totFree = itabFree + | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2141 _dictionary->total_chunk_size(DEBUG_ONLY(freelistLock())); |
| 0 | 2142 if (totFree > 0) { |
| 2143 frag = ((frag + _dictionary->sum_of_squared_block_sizes()) / | |
| 2144 (totFree * totFree)); | |
| 2145 frag = (double)1.0 - frag; | |
| 2146 } else { | |
| 2147 assert(frag == 0.0, "Follows from totFree == 0"); | |
| 2148 } | |
| 2149 return frag; | |
| 2150 } | |
| 2151 | |
| 2152 void CompactibleFreeListSpace::beginSweepFLCensus( | |
| 2153 float inter_sweep_current, | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2154 float inter_sweep_estimate, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2155 float intra_sweep_estimate) { |
| 0 | 2156 assert_locked(); |
| 2157 size_t i; | |
| 2158 for (i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { | |
| 6885 | 2159 AdaptiveFreeList<FreeChunk>* fl = &_indexedFreeList[i]; |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2160 if (PrintFLSStatistics > 1) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2161 gclog_or_tty->print("size[%d] : ", i); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2162 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2163 fl->compute_desired(inter_sweep_current, inter_sweep_estimate, intra_sweep_estimate); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2164 fl->set_coal_desired((ssize_t)((double)fl->desired() * CMSSmallCoalSurplusPercent)); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2165 fl->set_before_sweep(fl->count()); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2166 fl->set_bfr_surp(fl->surplus()); |
| 0 | 2167 } |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2168 _dictionary->begin_sweep_dict_census(CMSLargeCoalSurplusPercent, |
| 0 | 2169 inter_sweep_current, |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2170 inter_sweep_estimate, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2171 intra_sweep_estimate); |
| 0 | 2172 } |
| 2173 | |
| 2174 void CompactibleFreeListSpace::setFLSurplus() { | |
| 2175 assert_locked(); | |
| 2176 size_t i; | |
| 2177 for (i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { | |
| 6885 | 2178 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[i]; |
| 0 | 2179 fl->set_surplus(fl->count() - |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2180 (ssize_t)((double)fl->desired() * CMSSmallSplitSurplusPercent)); |
| 0 | 2181 } |
| 2182 } | |
| 2183 | |
| 2184 void CompactibleFreeListSpace::setFLHints() { | |
| 2185 assert_locked(); | |
| 2186 size_t i; | |
| 2187 size_t h = IndexSetSize; | |
| 2188 for (i = IndexSetSize - 1; i != 0; i -= IndexSetStride) { | |
| 6885 | 2189 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[i]; |
| 0 | 2190 fl->set_hint(h); |
| 2191 if (fl->surplus() > 0) { | |
| 2192 h = i; | |
| 2193 } | |
| 2194 } | |
| 2195 } | |
| 2196 | |
| 2197 void CompactibleFreeListSpace::clearFLCensus() { | |
| 2198 assert_locked(); | |
|
4068
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
2199 size_t i; |
| 0 | 2200 for (i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { |
| 6885 | 2201 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[i]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2202 fl->set_prev_sweep(fl->count()); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2203 fl->set_coal_births(0); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2204 fl->set_coal_deaths(0); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2205 fl->set_split_births(0); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2206 fl->set_split_deaths(0); |
| 0 | 2207 } |
| 2208 } | |
| 2209 | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2210 void CompactibleFreeListSpace::endSweepFLCensus(size_t sweep_count) { |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2211 if (PrintFLSStatistics > 0) { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2212 HeapWord* largestAddr = (HeapWord*) dictionary()->find_largest_dict(); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2213 gclog_or_tty->print_cr("CMS: Large block " PTR_FORMAT, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2214 largestAddr); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2215 } |
| 0 | 2216 setFLSurplus(); |
| 2217 setFLHints(); | |
| 2218 if (PrintGC && PrintFLSCensus > 0) { | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2219 printFLCensus(sweep_count); |
| 0 | 2220 } |
| 2221 clearFLCensus(); | |
| 2222 assert_locked(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2223 _dictionary->end_sweep_dict_census(CMSLargeSplitSurplusPercent); |
| 0 | 2224 } |
| 2225 | |
| 2226 bool CompactibleFreeListSpace::coalOverPopulated(size_t size) { | |
| 2227 if (size < SmallForDictionary) { | |
| 6885 | 2228 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[size]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2229 return (fl->coal_desired() < 0) || |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2230 ((int)fl->count() > fl->coal_desired()); |
| 0 | 2231 } else { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2232 return dictionary()->coal_dict_over_populated(size); |
| 0 | 2233 } |
| 2234 } | |
| 2235 | |
| 2236 void CompactibleFreeListSpace::smallCoalBirth(size_t size) { | |
| 2237 assert(size < SmallForDictionary, "Size too large for indexed list"); | |
| 6885 | 2238 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[size]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2239 fl->increment_coal_births(); |
| 0 | 2240 fl->increment_surplus(); |
| 2241 } | |
| 2242 | |
| 2243 void CompactibleFreeListSpace::smallCoalDeath(size_t size) { | |
| 2244 assert(size < SmallForDictionary, "Size too large for indexed list"); | |
| 6885 | 2245 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[size]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2246 fl->increment_coal_deaths(); |
| 0 | 2247 fl->decrement_surplus(); |
| 2248 } | |
| 2249 | |
| 2250 void CompactibleFreeListSpace::coalBirth(size_t size) { | |
| 2251 if (size < SmallForDictionary) { | |
| 2252 smallCoalBirth(size); | |
| 2253 } else { | |
| 6885 | 2254 dictionary()->dict_census_update(size, |
| 0 | 2255 false /* split */, |
| 2256 true /* birth */); | |
| 2257 } | |
| 2258 } | |
| 2259 | |
| 2260 void CompactibleFreeListSpace::coalDeath(size_t size) { | |
| 2261 if(size < SmallForDictionary) { | |
| 2262 smallCoalDeath(size); | |
| 2263 } else { | |
| 6885 | 2264 dictionary()->dict_census_update(size, |
| 0 | 2265 false /* split */, |
| 2266 false /* birth */); | |
| 2267 } | |
| 2268 } | |
| 2269 | |
| 2270 void CompactibleFreeListSpace::smallSplitBirth(size_t size) { | |
| 2271 assert(size < SmallForDictionary, "Size too large for indexed list"); | |
| 6885 | 2272 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[size]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2273 fl->increment_split_births(); |
| 0 | 2274 fl->increment_surplus(); |
| 2275 } | |
| 2276 | |
| 2277 void CompactibleFreeListSpace::smallSplitDeath(size_t size) { | |
| 2278 assert(size < SmallForDictionary, "Size too large for indexed list"); | |
| 6885 | 2279 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[size]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2280 fl->increment_split_deaths(); |
| 0 | 2281 fl->decrement_surplus(); |
| 2282 } | |
| 2283 | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2284 void CompactibleFreeListSpace::split_birth(size_t size) { |
| 0 | 2285 if (size < SmallForDictionary) { |
| 2286 smallSplitBirth(size); | |
| 2287 } else { | |
| 6885 | 2288 dictionary()->dict_census_update(size, |
| 0 | 2289 true /* split */, |
| 2290 true /* birth */); | |
| 2291 } | |
| 2292 } | |
| 2293 | |
| 2294 void CompactibleFreeListSpace::splitDeath(size_t size) { | |
| 2295 if (size < SmallForDictionary) { | |
| 2296 smallSplitDeath(size); | |
| 2297 } else { | |
| 6885 | 2298 dictionary()->dict_census_update(size, |
| 0 | 2299 true /* split */, |
| 2300 false /* birth */); | |
| 2301 } | |
| 2302 } | |
| 2303 | |
| 2304 void CompactibleFreeListSpace::split(size_t from, size_t to1) { | |
| 2305 size_t to2 = from - to1; | |
| 2306 splitDeath(from); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2307 split_birth(to1); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2308 split_birth(to2); |
| 0 | 2309 } |
| 2310 | |
| 2311 void CompactibleFreeListSpace::print() const { | |
|
1952
4df7f8cba524
6996613: CompactibleFreeListSpace::print should call CompactibleFreeListSpace::print_on, not Space::print_on
ysr
parents:
1951
diff
changeset
|
2312 print_on(tty); |
| 0 | 2313 } |
| 2314 | |
| 2315 void CompactibleFreeListSpace::prepare_for_verify() { | |
| 2316 assert_locked(); | |
| 2317 repairLinearAllocationBlocks(); | |
| 2318 // Verify that the SpoolBlocks look like free blocks of | |
| 2319 // appropriate sizes... To be done ... | |
| 2320 } | |
| 2321 | |
| 2322 class VerifyAllBlksClosure: public BlkClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2323 private: |
| 0 | 2324 const CompactibleFreeListSpace* _sp; |
| 2325 const MemRegion _span; | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2326 HeapWord* _last_addr; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2327 size_t _last_size; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2328 bool _last_was_obj; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2329 bool _last_was_live; |
| 0 | 2330 |
| 2331 public: | |
| 2332 VerifyAllBlksClosure(const CompactibleFreeListSpace* sp, | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2333 MemRegion span) : _sp(sp), _span(span), |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2334 _last_addr(NULL), _last_size(0), |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2335 _last_was_obj(false), _last_was_live(false) { } |
| 0 | 2336 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2337 virtual size_t do_blk(HeapWord* addr) { |
| 0 | 2338 size_t res; |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2339 bool was_obj = false; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2340 bool was_live = false; |
| 0 | 2341 if (_sp->block_is_obj(addr)) { |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2342 was_obj = true; |
| 0 | 2343 oop p = oop(addr); |
| 2344 guarantee(p->is_oop(), "Should be an oop"); | |
| 2345 res = _sp->adjustObjectSize(p->size()); | |
| 2346 if (_sp->obj_is_alive(addr)) { | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2347 was_live = true; |
| 0 | 2348 p->verify(); |
| 2349 } | |
| 2350 } else { | |
| 2351 FreeChunk* fc = (FreeChunk*)addr; | |
| 2352 res = fc->size(); | |
| 2353 if (FLSVerifyLists && !fc->cantCoalesce()) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2354 guarantee(_sp->verify_chunk_in_free_list(fc), |
| 0 | 2355 "Chunk should be on a free list"); |
| 2356 } | |
| 2357 } | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2358 if (res == 0) { |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2359 gclog_or_tty->print_cr("Livelock: no rank reduction!"); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2360 gclog_or_tty->print_cr( |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2361 " Current: addr = " PTR_FORMAT ", size = " SIZE_FORMAT ", obj = %s, live = %s \n" |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2362 " Previous: addr = " PTR_FORMAT ", size = " SIZE_FORMAT ", obj = %s, live = %s \n", |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2363 addr, res, was_obj ?"true":"false", was_live ?"true":"false", |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2364 _last_addr, _last_size, _last_was_obj?"true":"false", _last_was_live?"true":"false"); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2365 _sp->print_on(gclog_or_tty); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2366 guarantee(false, "Seppuku!"); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2367 } |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2368 _last_addr = addr; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2369 _last_size = res; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2370 _last_was_obj = was_obj; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2371 _last_was_live = was_live; |
| 0 | 2372 return res; |
| 2373 } | |
| 2374 }; | |
| 2375 | |
| 2376 class VerifyAllOopsClosure: public OopClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2377 private: |
| 0 | 2378 const CMSCollector* _collector; |
| 2379 const CompactibleFreeListSpace* _sp; | |
| 2380 const MemRegion _span; | |
| 2381 const bool _past_remark; | |
| 2382 const CMSBitMap* _bit_map; | |
| 2383 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2384 protected: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2385 void do_oop(void* p, oop obj) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2386 if (_span.contains(obj)) { // the interior oop points into CMS heap |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2387 if (!_span.contains(p)) { // reference from outside CMS heap |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2388 // Should be a valid object; the first disjunct below allows |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2389 // us to sidestep an assertion in block_is_obj() that insists |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2390 // that p be in _sp. Note that several generations (and spaces) |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2391 // are spanned by _span (CMS heap) above. |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2392 guarantee(!_sp->is_in_reserved(obj) || |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2393 _sp->block_is_obj((HeapWord*)obj), |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2394 "Should be an object"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2395 guarantee(obj->is_oop(), "Should be an oop"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2396 obj->verify(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2397 if (_past_remark) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2398 // Remark has been completed, the object should be marked |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2399 _bit_map->isMarked((HeapWord*)obj); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2400 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2401 } else { // reference within CMS heap |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2402 if (_past_remark) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2403 // Remark has been completed -- so the referent should have |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2404 // been marked, if referring object is. |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2405 if (_bit_map->isMarked(_collector->block_start(p))) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2406 guarantee(_bit_map->isMarked((HeapWord*)obj), "Marking error?"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2407 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2408 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2409 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2410 } else if (_sp->is_in_reserved(p)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2411 // the reference is from FLS, and points out of FLS |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2412 guarantee(obj->is_oop(), "Should be an oop"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2413 obj->verify(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2414 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2415 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2416 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2417 template <class T> void do_oop_work(T* p) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2418 T heap_oop = oopDesc::load_heap_oop(p); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2419 if (!oopDesc::is_null(heap_oop)) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2420 oop obj = oopDesc::decode_heap_oop_not_null(heap_oop); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2421 do_oop(p, obj); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2422 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2423 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2424 |
| 0 | 2425 public: |
| 2426 VerifyAllOopsClosure(const CMSCollector* collector, | |
| 2427 const CompactibleFreeListSpace* sp, MemRegion span, | |
| 2428 bool past_remark, CMSBitMap* bit_map) : | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
2429 _collector(collector), _sp(sp), _span(span), |
| 0 | 2430 _past_remark(past_remark), _bit_map(bit_map) { } |
| 2431 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2432 virtual void do_oop(oop* p) { VerifyAllOopsClosure::do_oop_work(p); } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2433 virtual void do_oop(narrowOop* p) { VerifyAllOopsClosure::do_oop_work(p); } |
| 0 | 2434 }; |
| 2435 | |
| 6008 | 2436 void CompactibleFreeListSpace::verify() const { |
| 0 | 2437 assert_lock_strong(&_freelistLock); |
| 2438 verify_objects_initialized(); | |
| 2439 MemRegion span = _collector->_span; | |
| 2440 bool past_remark = (_collector->abstract_state() == | |
| 2441 CMSCollector::Sweeping); | |
| 2442 | |
| 2443 ResourceMark rm; | |
| 2444 HandleMark hm; | |
| 2445 | |
| 2446 // Check integrity of CFL data structures | |
| 2447 _promoInfo.verify(); | |
| 2448 _dictionary->verify(); | |
| 2449 if (FLSVerifyIndexTable) { | |
| 2450 verifyIndexedFreeLists(); | |
| 2451 } | |
| 2452 // Check integrity of all objects and free blocks in space | |
| 2453 { | |
| 2454 VerifyAllBlksClosure cl(this, span); | |
| 2455 ((CompactibleFreeListSpace*)this)->blk_iterate(&cl); // cast off const | |
| 2456 } | |
| 2457 // Check that all references in the heap to FLS | |
| 2458 // are to valid objects in FLS or that references in | |
| 2459 // FLS are to valid objects elsewhere in the heap | |
| 2460 if (FLSVerifyAllHeapReferences) | |
| 2461 { | |
| 2462 VerifyAllOopsClosure cl(_collector, this, span, past_remark, | |
| 2463 _collector->markBitMap()); | |
| 2464 CollectedHeap* ch = Universe::heap(); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
2465 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
2466 // Iterate over all oops in the heap. Uses the _no_header version |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
2467 // since we are not interested in following the klass pointers. |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
2468 ch->oop_iterate_no_header(&cl); |
| 0 | 2469 } |
| 2470 | |
| 2471 if (VerifyObjectStartArray) { | |
| 2472 // Verify the block offset table | |
| 2473 _bt.verify(); | |
| 2474 } | |
| 2475 } | |
| 2476 | |
| 2477 #ifndef PRODUCT | |
| 2478 void CompactibleFreeListSpace::verifyFreeLists() const { | |
| 2479 if (FLSVerifyLists) { | |
| 2480 _dictionary->verify(); | |
| 2481 verifyIndexedFreeLists(); | |
| 2482 } else { | |
| 2483 if (FLSVerifyDictionary) { | |
| 2484 _dictionary->verify(); | |
| 2485 } | |
| 2486 if (FLSVerifyIndexTable) { | |
| 2487 verifyIndexedFreeLists(); | |
| 2488 } | |
| 2489 } | |
| 2490 } | |
| 2491 #endif | |
| 2492 | |
| 2493 void CompactibleFreeListSpace::verifyIndexedFreeLists() const { | |
| 2494 size_t i = 0; | |
|
4068
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
2495 for (; i < IndexSetStart; i++) { |
| 0 | 2496 guarantee(_indexedFreeList[i].head() == NULL, "should be NULL"); |
| 2497 } | |
| 2498 for (; i < IndexSetSize; i++) { | |
| 2499 verifyIndexedFreeList(i); | |
| 2500 } | |
| 2501 } | |
| 2502 | |
| 2503 void CompactibleFreeListSpace::verifyIndexedFreeList(size_t size) const { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2504 FreeChunk* fc = _indexedFreeList[size].head(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2505 FreeChunk* tail = _indexedFreeList[size].tail(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2506 size_t num = _indexedFreeList[size].count(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2507 size_t n = 0; |
|
4068
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
2508 guarantee(((size >= IndexSetStart) && (size % IndexSetStride == 0)) || fc == NULL, |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2509 "Slot should have been empty"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2510 for (; fc != NULL; fc = fc->next(), n++) { |
| 0 | 2511 guarantee(fc->size() == size, "Size inconsistency"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2512 guarantee(fc->is_free(), "!free?"); |
| 0 | 2513 guarantee(fc->next() == NULL || fc->next()->prev() == fc, "Broken list"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2514 guarantee((fc->next() == NULL) == (fc == tail), "Incorrect tail"); |
| 0 | 2515 } |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2516 guarantee(n == num, "Incorrect count"); |
| 0 | 2517 } |
| 2518 | |
| 2519 #ifndef PRODUCT | |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2520 void CompactibleFreeListSpace::check_free_list_consistency() const { |
| 6885 | 2521 assert((TreeChunk<FreeChunk, AdaptiveFreeList>::min_size() <= IndexSetSize), |
| 0 | 2522 "Some sizes can't be allocated without recourse to" |
| 2523 " linear allocation buffers"); | |
| 6885 | 2524 assert((TreeChunk<FreeChunk, AdaptiveFreeList>::min_size()*HeapWordSize == sizeof(TreeChunk<FreeChunk, AdaptiveFreeList>)), |
| 0 | 2525 "else MIN_TREE_CHUNK_SIZE is wrong"); |
|
6104
c92a79900986
7169062: CMS: Assertion failed with -XX:+ObjectAlignmentInBytes=64
brutisso
parents:
6028
diff
changeset
|
2526 assert(IndexSetStart != 0, "IndexSetStart not initialized"); |
|
c92a79900986
7169062: CMS: Assertion failed with -XX:+ObjectAlignmentInBytes=64
brutisso
parents:
6028
diff
changeset
|
2527 assert(IndexSetStride != 0, "IndexSetStride not initialized"); |
| 0 | 2528 } |
| 2529 #endif | |
| 2530 | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2531 void CompactibleFreeListSpace::printFLCensus(size_t sweep_count) const { |
| 0 | 2532 assert_lock_strong(&_freelistLock); |
| 6885 | 2533 AdaptiveFreeList<FreeChunk> total; |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2534 gclog_or_tty->print("end sweep# " SIZE_FORMAT "\n", sweep_count); |
| 6885 | 2535 AdaptiveFreeList<FreeChunk>::print_labels_on(gclog_or_tty, "size"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2536 size_t total_free = 0; |
| 0 | 2537 for (size_t i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { |
| 6885 | 2538 const AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[i]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2539 total_free += fl->count() * fl->size(); |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2540 if (i % (40*IndexSetStride) == 0) { |
| 6885 | 2541 AdaptiveFreeList<FreeChunk>::print_labels_on(gclog_or_tty, "size"); |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2542 } |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2543 fl->print_on(gclog_or_tty); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2544 total.set_bfr_surp( total.bfr_surp() + fl->bfr_surp() ); |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2545 total.set_surplus( total.surplus() + fl->surplus() ); |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2546 total.set_desired( total.desired() + fl->desired() ); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2547 total.set_prev_sweep( total.prev_sweep() + fl->prev_sweep() ); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2548 total.set_before_sweep(total.before_sweep() + fl->before_sweep()); |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2549 total.set_count( total.count() + fl->count() ); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2550 total.set_coal_births( total.coal_births() + fl->coal_births() ); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2551 total.set_coal_deaths( total.coal_deaths() + fl->coal_deaths() ); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2552 total.set_split_births(total.split_births() + fl->split_births()); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2553 total.set_split_deaths(total.split_deaths() + fl->split_deaths()); |
| 0 | 2554 } |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2555 total.print_on(gclog_or_tty, "TOTAL"); |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2556 gclog_or_tty->print_cr("Total free in indexed lists " |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2557 SIZE_FORMAT " words", total_free); |
| 0 | 2558 gclog_or_tty->print("growth: %8.5f deficit: %8.5f\n", |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2559 (double)(total.split_births()+total.coal_births()-total.split_deaths()-total.coal_deaths())/ |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2560 (total.prev_sweep() != 0 ? (double)total.prev_sweep() : 1.0), |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2561 (double)(total.desired() - total.count())/(total.desired() != 0 ? (double)total.desired() : 1.0)); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2562 _dictionary->print_dict_census(); |
| 0 | 2563 } |
| 2564 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2565 /////////////////////////////////////////////////////////////////////////// |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2566 // CFLS_LAB |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2567 /////////////////////////////////////////////////////////////////////////// |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2568 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2569 #define VECTOR_257(x) \ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2570 /* 1 2 3 4 5 6 7 8 9 1x 11 12 13 14 15 16 17 18 19 2x 21 22 23 24 25 26 27 28 29 3x 31 32 */ \ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2571 { x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, \ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2572 x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, \ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2573 x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, \ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2574 x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, \ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2575 x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, \ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2576 x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, \ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2577 x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, \ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2578 x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, x, \ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2579 x } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2580 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2581 // Initialize with default setting of CMSParPromoteBlocksToClaim, _not_ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2582 // OldPLABSize, whose static default is different; if overridden at the |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2583 // command-line, this will get reinitialized via a call to |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2584 // modify_initialization() below. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2585 AdaptiveWeightedAverage CFLS_LAB::_blocks_to_claim[] = |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2586 VECTOR_257(AdaptiveWeightedAverage(OldPLABWeight, (float)CMSParPromoteBlocksToClaim)); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2587 size_t CFLS_LAB::_global_num_blocks[] = VECTOR_257(0); |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4095
diff
changeset
|
2588 uint CFLS_LAB::_global_num_workers[] = VECTOR_257(0); |
| 0 | 2589 |
| 2590 CFLS_LAB::CFLS_LAB(CompactibleFreeListSpace* cfls) : | |
| 2591 _cfls(cfls) | |
| 2592 { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2593 assert(CompactibleFreeListSpace::IndexSetSize == 257, "Modify VECTOR_257() macro above"); |
| 0 | 2594 for (size_t i = CompactibleFreeListSpace::IndexSetStart; |
| 2595 i < CompactibleFreeListSpace::IndexSetSize; | |
| 2596 i += CompactibleFreeListSpace::IndexSetStride) { | |
| 2597 _indexedFreeList[i].set_size(i); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2598 _num_blocks[i] = 0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2599 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2600 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2601 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2602 static bool _CFLS_LAB_modified = false; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2603 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2604 void CFLS_LAB::modify_initialization(size_t n, unsigned wt) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2605 assert(!_CFLS_LAB_modified, "Call only once"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2606 _CFLS_LAB_modified = true; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2607 for (size_t i = CompactibleFreeListSpace::IndexSetStart; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2608 i < CompactibleFreeListSpace::IndexSetSize; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2609 i += CompactibleFreeListSpace::IndexSetStride) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2610 _blocks_to_claim[i].modify(n, wt, true /* force */); |
| 0 | 2611 } |
| 2612 } | |
| 2613 | |
| 2614 HeapWord* CFLS_LAB::alloc(size_t word_sz) { | |
| 2615 FreeChunk* res; | |
|
1777
179464550c7d
6983930: CMS: Various small cleanups ca September 2010
ysr
parents:
1716
diff
changeset
|
2616 assert(word_sz == _cfls->adjustObjectSize(word_sz), "Error"); |
| 0 | 2617 if (word_sz >= CompactibleFreeListSpace::IndexSetSize) { |
| 2618 // This locking manages sync with other large object allocations. | |
| 2619 MutexLockerEx x(_cfls->parDictionaryAllocLock(), | |
| 2620 Mutex::_no_safepoint_check_flag); | |
| 2621 res = _cfls->getChunkFromDictionaryExact(word_sz); | |
| 2622 if (res == NULL) return NULL; | |
| 2623 } else { | |
| 6885 | 2624 AdaptiveFreeList<FreeChunk>* fl = &_indexedFreeList[word_sz]; |
| 0 | 2625 if (fl->count() == 0) { |
| 2626 // Attempt to refill this local free list. | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2627 get_from_global_pool(word_sz, fl); |
| 0 | 2628 // If it didn't work, give up. |
| 2629 if (fl->count() == 0) return NULL; | |
| 2630 } | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2631 res = fl->get_chunk_at_head(); |
| 0 | 2632 assert(res != NULL, "Why was count non-zero?"); |
| 2633 } | |
| 2634 res->markNotFree(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2635 assert(!res->is_free(), "shouldn't be marked free"); |
| 187 | 2636 assert(oop(res)->klass_or_null() == NULL, "should look uninitialized"); |
| 0 | 2637 // mangle a just allocated object with a distinct pattern. |
| 2638 debug_only(res->mangleAllocated(word_sz)); | |
| 2639 return (HeapWord*)res; | |
| 2640 } | |
| 2641 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2642 // Get a chunk of blocks of the right size and update related |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2643 // book-keeping stats |
| 6885 | 2644 void CFLS_LAB::get_from_global_pool(size_t word_sz, AdaptiveFreeList<FreeChunk>* fl) { |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2645 // Get the #blocks we want to claim |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2646 size_t n_blks = (size_t)_blocks_to_claim[word_sz].average(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2647 assert(n_blks > 0, "Error"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2648 assert(ResizePLAB || n_blks == OldPLABSize, "Error"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2649 // In some cases, when the application has a phase change, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2650 // there may be a sudden and sharp shift in the object survival |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2651 // profile, and updating the counts at the end of a scavenge |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2652 // may not be quick enough, giving rise to large scavenge pauses |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2653 // during these phase changes. It is beneficial to detect such |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2654 // changes on-the-fly during a scavenge and avoid such a phase-change |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2655 // pothole. The following code is a heuristic attempt to do that. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2656 // It is protected by a product flag until we have gained |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2657 // enough experience with this heuristic and fine-tuned its behaviour. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2658 // WARNING: This might increase fragmentation if we overreact to |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2659 // small spikes, so some kind of historical smoothing based on |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2660 // previous experience with the greater reactivity might be useful. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2661 // Lacking sufficient experience, CMSOldPLABResizeQuicker is disabled by |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2662 // default. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2663 if (ResizeOldPLAB && CMSOldPLABResizeQuicker) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2664 size_t multiple = _num_blocks[word_sz]/(CMSOldPLABToleranceFactor*CMSOldPLABNumRefills*n_blks); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2665 n_blks += CMSOldPLABReactivityFactor*multiple*n_blks; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2666 n_blks = MIN2(n_blks, CMSOldPLABMax); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2667 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2668 assert(n_blks > 0, "Error"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2669 _cfls->par_get_chunk_of_blocks(word_sz, n_blks, fl); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2670 // Update stats table entry for this block size |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2671 _num_blocks[word_sz] += fl->count(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2672 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2673 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2674 void CFLS_LAB::compute_desired_plab_size() { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2675 for (size_t i = CompactibleFreeListSpace::IndexSetStart; |
| 0 | 2676 i < CompactibleFreeListSpace::IndexSetSize; |
| 2677 i += CompactibleFreeListSpace::IndexSetStride) { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2678 assert((_global_num_workers[i] == 0) == (_global_num_blocks[i] == 0), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2679 "Counter inconsistency"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2680 if (_global_num_workers[i] > 0) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2681 // Need to smooth wrt historical average |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2682 if (ResizeOldPLAB) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2683 _blocks_to_claim[i].sample( |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2684 MAX2((size_t)CMSOldPLABMin, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2685 MIN2((size_t)CMSOldPLABMax, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2686 _global_num_blocks[i]/(_global_num_workers[i]*CMSOldPLABNumRefills)))); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2687 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2688 // Reset counters for next round |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2689 _global_num_workers[i] = 0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2690 _global_num_blocks[i] = 0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2691 if (PrintOldPLAB) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2692 gclog_or_tty->print_cr("[%d]: %d", i, (size_t)_blocks_to_claim[i].average()); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2693 } |
| 0 | 2694 } |
| 2695 } | |
| 2696 } | |
| 2697 | |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2698 // If this is changed in the future to allow parallel |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2699 // access, one would need to take the FL locks and, |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2700 // depending on how it is used, stagger access from |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2701 // parallel threads to reduce contention. |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2702 void CFLS_LAB::retire(int tid) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2703 // We run this single threaded with the world stopped; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2704 // so no need for locks and such. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2705 NOT_PRODUCT(Thread* t = Thread::current();) |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2706 assert(Thread::current()->is_VM_thread(), "Error"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2707 for (size_t i = CompactibleFreeListSpace::IndexSetStart; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2708 i < CompactibleFreeListSpace::IndexSetSize; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2709 i += CompactibleFreeListSpace::IndexSetStride) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2710 assert(_num_blocks[i] >= (size_t)_indexedFreeList[i].count(), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2711 "Can't retire more than what we obtained"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2712 if (_num_blocks[i] > 0) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2713 size_t num_retire = _indexedFreeList[i].count(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2714 assert(_num_blocks[i] > num_retire, "Should have used at least one"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2715 { |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2716 // MutexLockerEx x(_cfls->_indexedFreeListParLocks[i], |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2717 // Mutex::_no_safepoint_check_flag); |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2718 |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2719 // Update globals stats for num_blocks used |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2720 _global_num_blocks[i] += (_num_blocks[i] - num_retire); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2721 _global_num_workers[i]++; |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4095
diff
changeset
|
2722 assert(_global_num_workers[i] <= ParallelGCThreads, "Too big"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2723 if (num_retire > 0) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2724 _cfls->_indexedFreeList[i].prepend(&_indexedFreeList[i]); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2725 // Reset this list. |
| 6885 | 2726 _indexedFreeList[i] = AdaptiveFreeList<FreeChunk>(); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2727 _indexedFreeList[i].set_size(i); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2728 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2729 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2730 if (PrintOldPLAB) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2731 gclog_or_tty->print_cr("%d[%d]: %d/%d/%d", |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2732 tid, i, num_retire, _num_blocks[i], (size_t)_blocks_to_claim[i].average()); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2733 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2734 // Reset stats for next round |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2735 _num_blocks[i] = 0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2736 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2737 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2738 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2739 |
| 6885 | 2740 void CompactibleFreeListSpace:: par_get_chunk_of_blocks(size_t word_sz, size_t n, AdaptiveFreeList<FreeChunk>* fl) { |
| 0 | 2741 assert(fl->count() == 0, "Precondition."); |
| 2742 assert(word_sz < CompactibleFreeListSpace::IndexSetSize, | |
| 2743 "Precondition"); | |
| 2744 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2745 // We'll try all multiples of word_sz in the indexed set, starting with |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2746 // word_sz itself and, if CMSSplitIndexedFreeListBlocks, try larger multiples, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2747 // then try getting a big chunk and splitting it. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2748 { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2749 bool found; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2750 int k; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2751 size_t cur_sz; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2752 for (k = 1, cur_sz = k * word_sz, found = false; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2753 (cur_sz < CompactibleFreeListSpace::IndexSetSize) && |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2754 (CMSSplitIndexedFreeListBlocks || k <= 1); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2755 k++, cur_sz = k * word_sz) { |
| 6885 | 2756 AdaptiveFreeList<FreeChunk> fl_for_cur_sz; // Empty. |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2757 fl_for_cur_sz.set_size(cur_sz); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2758 { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2759 MutexLockerEx x(_indexedFreeListParLocks[cur_sz], |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2760 Mutex::_no_safepoint_check_flag); |
| 6885 | 2761 AdaptiveFreeList<FreeChunk>* gfl = &_indexedFreeList[cur_sz]; |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2762 if (gfl->count() != 0) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2763 // nn is the number of chunks of size cur_sz that |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2764 // we'd need to split k-ways each, in order to create |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2765 // "n" chunks of size word_sz each. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2766 const size_t nn = MAX2(n/k, (size_t)1); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2767 gfl->getFirstNChunksFromList(nn, &fl_for_cur_sz); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2768 found = true; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2769 if (k > 1) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2770 // Update split death stats for the cur_sz-size blocks list: |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2771 // we increment the split death count by the number of blocks |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2772 // we just took from the cur_sz-size blocks list and which |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2773 // we will be splitting below. |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2774 ssize_t deaths = gfl->split_deaths() + |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2775 fl_for_cur_sz.count(); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2776 gfl->set_split_deaths(deaths); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2777 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2778 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2779 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2780 // Now transfer fl_for_cur_sz to fl. Common case, we hope, is k = 1. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2781 if (found) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2782 if (k == 1) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2783 fl->prepend(&fl_for_cur_sz); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2784 } else { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2785 // Divide each block on fl_for_cur_sz up k ways. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2786 FreeChunk* fc; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2787 while ((fc = fl_for_cur_sz.get_chunk_at_head()) != NULL) { |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2788 // Must do this in reverse order, so that anybody attempting to |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2789 // access the main chunk sees it as a single free block until we |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2790 // change it. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2791 size_t fc_size = fc->size(); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2792 assert(fc->is_free(), "Error"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2793 for (int i = k-1; i >= 0; i--) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2794 FreeChunk* ffc = (FreeChunk*)((HeapWord*)fc + i * word_sz); |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2795 assert((i != 0) || |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2796 ((fc == ffc) && ffc->is_free() && |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2797 (ffc->size() == k*word_sz) && (fc_size == word_sz)), |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2798 "Counting error"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2799 ffc->set_size(word_sz); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2800 ffc->link_prev(NULL); // Mark as a free block for other (parallel) GC threads. |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2801 ffc->link_next(NULL); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2802 // Above must occur before BOT is updated below. |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2803 OrderAccess::storestore(); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2804 // splitting from the right, fc_size == i * word_sz |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2805 _bt.mark_block((HeapWord*)ffc, word_sz, true /* reducing */); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2806 fc_size -= word_sz; |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2807 assert(fc_size == i*word_sz, "Error"); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2808 _bt.verify_not_unallocated((HeapWord*)ffc, word_sz); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2809 _bt.verify_single_block((HeapWord*)fc, fc_size); |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2810 _bt.verify_single_block((HeapWord*)ffc, word_sz); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2811 // Push this on "fl". |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2812 fl->return_chunk_at_head(ffc); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2813 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2814 // TRAP |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2815 assert(fl->tail()->next() == NULL, "List invariant."); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2816 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2817 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2818 // Update birth stats for this block size. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2819 size_t num = fl->count(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2820 MutexLockerEx x(_indexedFreeListParLocks[word_sz], |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2821 Mutex::_no_safepoint_check_flag); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2822 ssize_t births = _indexedFreeList[word_sz].split_births() + num; |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2823 _indexedFreeList[word_sz].set_split_births(births); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2824 return; |
| 0 | 2825 } |
| 2826 } | |
| 2827 } | |
| 2828 // Otherwise, we'll split a block from the dictionary. | |
| 2829 FreeChunk* fc = NULL; | |
| 2830 FreeChunk* rem_fc = NULL; | |
| 2831 size_t rem; | |
| 2832 { | |
| 2833 MutexLockerEx x(parDictionaryAllocLock(), | |
| 2834 Mutex::_no_safepoint_check_flag); | |
| 2835 while (n > 0) { | |
| 6885 | 2836 fc = dictionary()->get_chunk(MAX2(n * word_sz, _dictionary->min_size()), |
| 6026 | 2837 FreeBlockDictionary<FreeChunk>::atLeast); |
| 0 | 2838 if (fc != NULL) { |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2839 _bt.allocated((HeapWord*)fc, fc->size(), true /* reducing */); // update _unallocated_blk |
| 6885 | 2840 dictionary()->dict_census_update(fc->size(), |
| 0 | 2841 true /*split*/, |
| 2842 false /*birth*/); | |
| 2843 break; | |
| 2844 } else { | |
| 2845 n--; | |
| 2846 } | |
| 2847 } | |
| 2848 if (fc == NULL) return; | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2849 // Otherwise, split up that block. |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2850 assert((ssize_t)n >= 1, "Control point invariant"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2851 assert(fc->is_free(), "Error: should be a free block"); |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2852 _bt.verify_single_block((HeapWord*)fc, fc->size()); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2853 const size_t nn = fc->size() / word_sz; |
| 0 | 2854 n = MIN2(nn, n); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2855 assert((ssize_t)n >= 1, "Control point invariant"); |
| 0 | 2856 rem = fc->size() - n * word_sz; |
| 2857 // If there is a remainder, and it's too small, allocate one fewer. | |
| 2858 if (rem > 0 && rem < MinChunkSize) { | |
| 2859 n--; rem += word_sz; | |
| 2860 } | |
|
1148
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2861 // Note that at this point we may have n == 0. |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2862 assert((ssize_t)n >= 0, "Control point invariant"); |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2863 |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2864 // If n is 0, the chunk fc that was found is not large |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2865 // enough to leave a viable remainder. We are unable to |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2866 // allocate even one block. Return fc to the |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2867 // dictionary and return, leaving "fl" empty. |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2868 if (n == 0) { |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2869 returnChunkToDictionary(fc); |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2870 assert(fl->count() == 0, "We never allocated any blocks"); |
|
1148
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2871 return; |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2872 } |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2873 |
| 0 | 2874 // First return the remainder, if any. |
| 2875 // Note that we hold the lock until we decide if we're going to give | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2876 // back the remainder to the dictionary, since a concurrent allocation |
| 0 | 2877 // may otherwise see the heap as empty. (We're willing to take that |
| 2878 // hit if the block is a small block.) | |
| 2879 if (rem > 0) { | |
| 2880 size_t prefix_size = n * word_sz; | |
| 2881 rem_fc = (FreeChunk*)((HeapWord*)fc + prefix_size); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2882 rem_fc->set_size(rem); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2883 rem_fc->link_prev(NULL); // Mark as a free block for other (parallel) GC threads. |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2884 rem_fc->link_next(NULL); |
| 0 | 2885 // Above must occur before BOT is updated below. |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2886 assert((ssize_t)n > 0 && prefix_size > 0 && rem_fc > fc, "Error"); |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2887 OrderAccess::storestore(); |
| 0 | 2888 _bt.split_block((HeapWord*)fc, fc->size(), prefix_size); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2889 assert(fc->is_free(), "Error"); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2890 fc->set_size(prefix_size); |
| 0 | 2891 if (rem >= IndexSetSize) { |
| 2892 returnChunkToDictionary(rem_fc); | |
| 6885 | 2893 dictionary()->dict_census_update(rem, true /*split*/, true /*birth*/); |
| 0 | 2894 rem_fc = NULL; |
| 2895 } | |
| 2896 // Otherwise, return it to the small list below. | |
| 2897 } | |
| 2898 } | |
| 2899 if (rem_fc != NULL) { | |
| 2900 MutexLockerEx x(_indexedFreeListParLocks[rem], | |
| 2901 Mutex::_no_safepoint_check_flag); | |
| 2902 _bt.verify_not_unallocated((HeapWord*)rem_fc, rem_fc->size()); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2903 _indexedFreeList[rem].return_chunk_at_head(rem_fc); |
| 0 | 2904 smallSplitBirth(rem); |
| 2905 } | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2906 assert((ssize_t)n > 0 && fc != NULL, "Consistency"); |
| 0 | 2907 // Now do the splitting up. |
| 2908 // Must do this in reverse order, so that anybody attempting to | |
| 2909 // access the main chunk sees it as a single free block until we | |
| 2910 // change it. | |
| 2911 size_t fc_size = n * word_sz; | |
| 2912 // All but first chunk in this loop | |
| 2913 for (ssize_t i = n-1; i > 0; i--) { | |
| 2914 FreeChunk* ffc = (FreeChunk*)((HeapWord*)fc + i * word_sz); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2915 ffc->set_size(word_sz); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2916 ffc->link_prev(NULL); // Mark as a free block for other (parallel) GC threads. |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2917 ffc->link_next(NULL); |
| 0 | 2918 // Above must occur before BOT is updated below. |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2919 OrderAccess::storestore(); |
| 0 | 2920 // splitting from the right, fc_size == (n - i + 1) * wordsize |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2921 _bt.mark_block((HeapWord*)ffc, word_sz, true /* reducing */); |
| 0 | 2922 fc_size -= word_sz; |
| 2923 _bt.verify_not_unallocated((HeapWord*)ffc, ffc->size()); | |
| 2924 _bt.verify_single_block((HeapWord*)ffc, ffc->size()); | |
| 2925 _bt.verify_single_block((HeapWord*)fc, fc_size); | |
| 2926 // Push this on "fl". | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2927 fl->return_chunk_at_head(ffc); |
| 0 | 2928 } |
| 2929 // First chunk | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2930 assert(fc->is_free() && fc->size() == n*word_sz, "Error: should still be a free block"); |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2931 // The blocks above should show their new sizes before the first block below |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2932 fc->set_size(word_sz); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2933 fc->link_prev(NULL); // idempotent wrt free-ness, see assert above |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2934 fc->link_next(NULL); |
| 0 | 2935 _bt.verify_not_unallocated((HeapWord*)fc, fc->size()); |
| 2936 _bt.verify_single_block((HeapWord*)fc, fc->size()); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2937 fl->return_chunk_at_head(fc); |
| 0 | 2938 |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2939 assert((ssize_t)n > 0 && (ssize_t)n == fl->count(), "Incorrect number of blocks"); |
| 0 | 2940 { |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2941 // Update the stats for this block size. |
| 0 | 2942 MutexLockerEx x(_indexedFreeListParLocks[word_sz], |
| 2943 Mutex::_no_safepoint_check_flag); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2944 const ssize_t births = _indexedFreeList[word_sz].split_births() + n; |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2945 _indexedFreeList[word_sz].set_split_births(births); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2946 // ssize_t new_surplus = _indexedFreeList[word_sz].surplus() + n; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2947 // _indexedFreeList[word_sz].set_surplus(new_surplus); |
| 0 | 2948 } |
| 2949 | |
| 2950 // TRAP | |
| 2951 assert(fl->tail()->next() == NULL, "List invariant."); | |
| 2952 } | |
| 2953 | |
| 2954 // Set up the space's par_seq_tasks structure for work claiming | |
| 2955 // for parallel rescan. See CMSParRemarkTask where this is currently used. | |
| 2956 // XXX Need to suitably abstract and generalize this and the next | |
| 2957 // method into one. | |
| 2958 void | |
| 2959 CompactibleFreeListSpace:: | |
| 2960 initialize_sequential_subtasks_for_rescan(int n_threads) { | |
| 2961 // The "size" of each task is fixed according to rescan_task_size. | |
| 2962 assert(n_threads > 0, "Unexpected n_threads argument"); | |
| 2963 const size_t task_size = rescan_task_size(); | |
| 2964 size_t n_tasks = (used_region().word_size() + task_size - 1)/task_size; | |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
269
diff
changeset
|
2965 assert((n_tasks == 0) == used_region().is_empty(), "n_tasks incorrect"); |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
269
diff
changeset
|
2966 assert(n_tasks == 0 || |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
269
diff
changeset
|
2967 ((used_region().start() + (n_tasks - 1)*task_size < used_region().end()) && |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
269
diff
changeset
|
2968 (used_region().start() + n_tasks*task_size >= used_region().end())), |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
269
diff
changeset
|
2969 "n_tasks calculation incorrect"); |
| 0 | 2970 SequentialSubTasksDone* pst = conc_par_seq_tasks(); |
| 2971 assert(!pst->valid(), "Clobbering existing data?"); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
2972 // 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
|
2973 // need to finish in order to be done). |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
2974 pst->set_n_threads(n_threads); |
| 0 | 2975 pst->set_n_tasks((int)n_tasks); |
| 2976 } | |
| 2977 | |
| 2978 // Set up the space's par_seq_tasks structure for work claiming | |
| 2979 // for parallel concurrent marking. See CMSConcMarkTask where this is currently used. | |
| 2980 void | |
| 2981 CompactibleFreeListSpace:: | |
| 2982 initialize_sequential_subtasks_for_marking(int n_threads, | |
| 2983 HeapWord* low) { | |
| 2984 // The "size" of each task is fixed according to rescan_task_size. | |
| 2985 assert(n_threads > 0, "Unexpected n_threads argument"); | |
| 2986 const size_t task_size = marking_task_size(); | |
| 2987 assert(task_size > CardTableModRefBS::card_size_in_words && | |
| 2988 (task_size % CardTableModRefBS::card_size_in_words == 0), | |
| 2989 "Otherwise arithmetic below would be incorrect"); | |
| 2990 MemRegion span = _gen->reserved(); | |
| 2991 if (low != NULL) { | |
| 2992 if (span.contains(low)) { | |
| 2993 // Align low down to a card boundary so that | |
| 2994 // we can use block_offset_careful() on span boundaries. | |
| 2995 HeapWord* aligned_low = (HeapWord*)align_size_down((uintptr_t)low, | |
| 2996 CardTableModRefBS::card_size); | |
| 2997 // Clip span prefix at aligned_low | |
| 2998 span = span.intersection(MemRegion(aligned_low, span.end())); | |
| 2999 } else if (low > span.end()) { | |
| 3000 span = MemRegion(low, low); // Null region | |
| 3001 } // else use entire span | |
| 3002 } | |
| 3003 assert(span.is_empty() || | |
| 3004 ((uintptr_t)span.start() % CardTableModRefBS::card_size == 0), | |
| 3005 "span should start at a card boundary"); | |
| 3006 size_t n_tasks = (span.word_size() + task_size - 1)/task_size; | |
| 3007 assert((n_tasks == 0) == span.is_empty(), "Inconsistency"); | |
| 3008 assert(n_tasks == 0 || | |
| 3009 ((span.start() + (n_tasks - 1)*task_size < span.end()) && | |
| 3010 (span.start() + n_tasks*task_size >= span.end())), | |
|
340
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
269
diff
changeset
|
3011 "n_tasks calculation incorrect"); |
| 0 | 3012 SequentialSubTasksDone* pst = conc_par_seq_tasks(); |
| 3013 assert(!pst->valid(), "Clobbering existing data?"); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3014 // 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
|
3015 // need to finish in order to be done). |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3016 pst->set_n_threads(n_threads); |
| 0 | 3017 pst->set_n_tasks((int)n_tasks); |
| 3018 } |