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