Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.cpp @ 20198:c49dcaf78a65
8042737: Introduce umbrella header prefetch.inline.hpp
Reviewed-by: twisti, stefank
| author | goetz |
|---|---|
| date | Thu, 08 May 2014 15:37:17 +0200 |
| parents | ce8f6bb717c9 |
| children | 30c99d8e0f02 |
| 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 // Apply the given closure to each oop in the space \intersect memory region. | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
799 void CompactibleFreeListSpace::oop_iterate(MemRegion mr, ExtendedOopClosure* cl) { |
| 0 | 800 assert_lock_strong(freelistLock()); |
| 801 if (is_empty()) { | |
| 802 return; | |
| 803 } | |
| 804 MemRegion cur = MemRegion(bottom(), end()); | |
| 805 mr = mr.intersection(cur); | |
| 806 if (mr.is_empty()) { | |
| 807 return; | |
| 808 } | |
| 809 if (mr.equals(cur)) { | |
| 810 oop_iterate(cl); | |
| 811 return; | |
| 812 } | |
| 813 assert(mr.end() <= end(), "just took an intersection above"); | |
| 814 HeapWord* obj_addr = block_start(mr.start()); | |
| 815 HeapWord* t = mr.end(); | |
| 816 | |
| 817 SpaceMemRegionOopsIterClosure smr_blk(cl, mr); | |
| 818 if (block_is_obj(obj_addr)) { | |
| 819 // Handle first object specially. | |
| 820 oop obj = oop(obj_addr); | |
| 821 obj_addr += adjustObjectSize(obj->oop_iterate(&smr_blk)); | |
| 822 } else { | |
| 823 FreeChunk* fc = (FreeChunk*)obj_addr; | |
| 824 obj_addr += fc->size(); | |
| 825 } | |
| 826 while (obj_addr < t) { | |
| 827 HeapWord* obj = obj_addr; | |
| 828 obj_addr += block_size(obj_addr); | |
| 829 // If "obj_addr" is not greater than top, then the | |
| 830 // entire object "obj" is within the region. | |
| 831 if (obj_addr <= t) { | |
| 832 if (block_is_obj(obj)) { | |
| 833 oop(obj)->oop_iterate(cl); | |
| 834 } | |
| 835 } else { | |
| 836 // "obj" extends beyond end of region | |
| 837 if (block_is_obj(obj)) { | |
| 838 oop(obj)->oop_iterate(&smr_blk); | |
| 839 } | |
| 840 break; | |
| 841 } | |
| 842 } | |
| 843 } | |
| 844 | |
| 845 // NOTE: In the following methods, in order to safely be able to | |
| 846 // apply the closure to an object, we need to be sure that the | |
| 847 // object has been initialized. We are guaranteed that an object | |
| 848 // is initialized if we are holding the Heap_lock with the | |
| 849 // world stopped. | |
| 850 void CompactibleFreeListSpace::verify_objects_initialized() const { | |
| 851 if (is_init_completed()) { | |
| 852 assert_locked_or_safepoint(Heap_lock); | |
| 853 if (Universe::is_fully_initialized()) { | |
| 854 guarantee(SafepointSynchronize::is_at_safepoint(), | |
| 855 "Required for objects to be initialized"); | |
| 856 } | |
| 857 } // else make a concession at vm start-up | |
| 858 } | |
| 859 | |
| 860 // Apply the given closure to each object in the space | |
| 861 void CompactibleFreeListSpace::object_iterate(ObjectClosure* blk) { | |
| 862 assert_lock_strong(freelistLock()); | |
| 863 NOT_PRODUCT(verify_objects_initialized()); | |
| 864 HeapWord *cur, *limit; | |
| 865 size_t curSize; | |
| 866 for (cur = bottom(), limit = end(); cur < limit; | |
| 867 cur += curSize) { | |
| 868 curSize = block_size(cur); | |
| 869 if (block_is_obj(cur)) { | |
| 870 blk->do_object(oop(cur)); | |
| 871 } | |
| 872 } | |
| 873 } | |
| 874 | |
|
517
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
875 // 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
|
876 // The usage of CompactibleFreeListSpace |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
877 // by the ConcurrentMarkSweepGeneration for concurrent GC's allows |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
878 // 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
|
879 // valid. For example, an object may reference another object |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
880 // 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
|
881 // 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
|
882 // 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
|
883 // object is decided. |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
884 |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
885 void CompactibleFreeListSpace::safe_object_iterate(ObjectClosure* blk) { |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
886 assert_lock_strong(freelistLock()); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
887 NOT_PRODUCT(verify_objects_initialized()); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
888 HeapWord *cur, *limit; |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
889 size_t curSize; |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
890 for (cur = bottom(), limit = end(); cur < limit; |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
891 cur += curSize) { |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
892 curSize = block_size(cur); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
893 if (block_is_obj(cur) && obj_is_alive(cur)) { |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
894 blk->do_object(oop(cur)); |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
895 } |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
896 } |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
897 } |
|
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
360
diff
changeset
|
898 |
| 0 | 899 void CompactibleFreeListSpace::object_iterate_mem(MemRegion mr, |
| 900 UpwardsObjectClosure* cl) { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
901 assert_locked(freelistLock()); |
| 0 | 902 NOT_PRODUCT(verify_objects_initialized()); |
| 903 Space::object_iterate_mem(mr, cl); | |
| 904 } | |
| 905 | |
| 906 // Callers of this iterator beware: The closure application should | |
| 907 // be robust in the face of uninitialized objects and should (always) | |
| 908 // return a correct size so that the next addr + size below gives us a | |
| 909 // valid block boundary. [See for instance, | |
| 910 // ScanMarkedObjectsAgainCarefullyClosure::do_object_careful() | |
| 911 // in ConcurrentMarkSweepGeneration.cpp.] | |
| 912 HeapWord* | |
| 913 CompactibleFreeListSpace::object_iterate_careful(ObjectClosureCareful* cl) { | |
| 914 assert_lock_strong(freelistLock()); | |
| 915 HeapWord *addr, *last; | |
| 916 size_t size; | |
| 917 for (addr = bottom(), last = end(); | |
| 918 addr < last; addr += size) { | |
| 919 FreeChunk* fc = (FreeChunk*)addr; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
920 if (fc->is_free()) { |
| 0 | 921 // Since we hold the free list lock, which protects direct |
| 922 // allocation in this generation by mutators, a free object | |
| 923 // will remain free throughout this iteration code. | |
| 924 size = fc->size(); | |
| 925 } else { | |
| 926 // Note that the object need not necessarily be initialized, | |
| 927 // because (for instance) the free list lock does NOT protect | |
| 928 // object initialization. The closure application below must | |
| 929 // therefore be correct in the face of uninitialized objects. | |
| 930 size = cl->do_object_careful(oop(addr)); | |
| 931 if (size == 0) { | |
| 932 // An unparsable object found. Signal early termination. | |
| 933 return addr; | |
| 934 } | |
| 935 } | |
| 936 } | |
| 937 return NULL; | |
| 938 } | |
| 939 | |
| 940 // Callers of this iterator beware: The closure application should | |
| 941 // be robust in the face of uninitialized objects and should (always) | |
| 942 // return a correct size so that the next addr + size below gives us a | |
| 943 // valid block boundary. [See for instance, | |
| 944 // ScanMarkedObjectsAgainCarefullyClosure::do_object_careful() | |
| 945 // in ConcurrentMarkSweepGeneration.cpp.] | |
| 946 HeapWord* | |
| 947 CompactibleFreeListSpace::object_iterate_careful_m(MemRegion mr, | |
| 948 ObjectClosureCareful* cl) { | |
| 949 assert_lock_strong(freelistLock()); | |
| 950 // Can't use used_region() below because it may not necessarily | |
| 951 // be the same as [bottom(),end()); although we could | |
| 952 // use [used_region().start(),round_to(used_region().end(),CardSize)), | |
| 953 // that appears too cumbersome, so we just do the simpler check | |
| 954 // in the assertion below. | |
| 955 assert(!mr.is_empty() && MemRegion(bottom(),end()).contains(mr), | |
| 956 "mr should be non-empty and within used space"); | |
| 957 HeapWord *addr, *end; | |
| 958 size_t size; | |
| 959 for (addr = block_start_careful(mr.start()), end = mr.end(); | |
| 960 addr < end; addr += size) { | |
| 961 FreeChunk* fc = (FreeChunk*)addr; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
962 if (fc->is_free()) { |
| 0 | 963 // Since we hold the free list lock, which protects direct |
| 964 // allocation in this generation by mutators, a free object | |
| 965 // will remain free throughout this iteration code. | |
| 966 size = fc->size(); | |
| 967 } else { | |
| 968 // Note that the object need not necessarily be initialized, | |
| 969 // because (for instance) the free list lock does NOT protect | |
| 970 // object initialization. The closure application below must | |
| 971 // therefore be correct in the face of uninitialized objects. | |
| 972 size = cl->do_object_careful_m(oop(addr), mr); | |
| 973 if (size == 0) { | |
| 974 // An unparsable object found. Signal early termination. | |
| 975 return addr; | |
| 976 } | |
| 977 } | |
| 978 } | |
| 979 return NULL; | |
| 980 } | |
| 981 | |
| 982 | |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
983 HeapWord* CompactibleFreeListSpace::block_start_const(const void* p) const { |
| 0 | 984 NOT_PRODUCT(verify_objects_initialized()); |
| 985 return _bt.block_start(p); | |
| 986 } | |
| 987 | |
| 988 HeapWord* CompactibleFreeListSpace::block_start_careful(const void* p) const { | |
| 989 return _bt.block_start_careful(p); | |
| 990 } | |
| 991 | |
| 992 size_t CompactibleFreeListSpace::block_size(const HeapWord* p) const { | |
| 993 NOT_PRODUCT(verify_objects_initialized()); | |
| 994 // This must be volatile, or else there is a danger that the compiler | |
| 995 // will compile the code below into a sometimes-infinite loop, by keeping | |
| 996 // the value read the first time in a register. | |
| 997 while (true) { | |
| 998 // We must do this until we get a consistent view of the object. | |
| 187 | 999 if (FreeChunk::indicatesFreeChunk(p)) { |
| 1000 volatile FreeChunk* fc = (volatile FreeChunk*)p; | |
| 1001 size_t res = fc->size(); | |
|
14443
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1002 |
|
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1003 // 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
|
1004 // 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
|
1005 // 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
|
1006 // still free, the read size is correct. |
|
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1007 OrderAccess::acquire(); |
|
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1008 |
| 187 | 1009 // If the object is still a free chunk, return the size, else it |
| 1010 // has been allocated so try again. | |
| 1011 if (FreeChunk::indicatesFreeChunk(p)) { | |
| 0 | 1012 assert(res != 0, "Block size should not be 0"); |
| 1013 return res; | |
| 1014 } | |
| 187 | 1015 } else { |
| 1016 // 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
|
1017 Klass* k = ((volatile oopDesc*)p)->klass_or_null(); |
| 187 | 1018 if (k != NULL) { |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1019 assert(k->is_klass(), "Should really be klass oop."); |
| 187 | 1020 oop o = (oop)p; |
| 1021 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
|
1022 |
|
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1023 // 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
|
1024 // 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
|
1025 // size (third word) is consistent. |
|
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1026 OrderAccess::acquire(); |
|
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1027 |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1028 size_t res = o->size_given_klass(k); |
| 187 | 1029 res = adjustObjectSize(res); |
| 1030 assert(res != 0, "Block size should not be 0"); | |
| 1031 return res; | |
| 1032 } | |
| 0 | 1033 } |
| 1034 } | |
| 1035 } | |
| 1036 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1037 // TODO: Now that is_parsable is gone, we should combine these two functions. |
| 0 | 1038 // A variant of the above that uses the Printezis bits for |
| 1039 // unparsable but allocated objects. This avoids any possible | |
| 1040 // stalls waiting for mutators to initialize objects, and is | |
| 1041 // thus potentially faster than the variant above. However, | |
| 1042 // this variant may return a zero size for a block that is | |
| 1043 // under mutation and for which a consistent size cannot be | |
| 1044 // inferred without stalling; see CMSCollector::block_size_if_printezis_bits(). | |
| 1045 size_t CompactibleFreeListSpace::block_size_no_stall(HeapWord* p, | |
| 1046 const CMSCollector* c) | |
| 1047 const { | |
| 1048 assert(MemRegion(bottom(), end()).contains(p), "p not in space"); | |
| 1049 // This must be volatile, or else there is a danger that the compiler | |
| 1050 // will compile the code below into a sometimes-infinite loop, by keeping | |
| 1051 // the value read the first time in a register. | |
| 1052 DEBUG_ONLY(uint loops = 0;) | |
| 1053 while (true) { | |
| 1054 // We must do this until we get a consistent view of the object. | |
| 187 | 1055 if (FreeChunk::indicatesFreeChunk(p)) { |
| 1056 volatile FreeChunk* fc = (volatile FreeChunk*)p; | |
| 1057 size_t res = fc->size(); | |
|
14443
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1058 |
|
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1059 // 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
|
1060 // 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
|
1061 // 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
|
1062 // 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
|
1063 OrderAccess::acquire(); |
|
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1064 |
| 187 | 1065 if (FreeChunk::indicatesFreeChunk(p)) { |
| 0 | 1066 assert(res != 0, "Block size should not be 0"); |
| 1067 assert(loops == 0, "Should be 0"); | |
| 1068 return res; | |
| 1069 } | |
| 1070 } else { | |
| 187 | 1071 // 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
|
1072 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
|
1073 // 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
|
1074 // 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
|
1075 // -- irrespective of its conc_safe-ty. |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1076 if (k != NULL) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1077 assert(k->is_klass(), "Should really be klass oop."); |
| 187 | 1078 oop o = (oop)p; |
| 1079 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
|
1080 |
|
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1081 // 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
|
1082 // 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
|
1083 // size (third word) is consistent. |
|
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1084 OrderAccess::acquire(); |
|
3205e78d8193
8029396: PPC64 (part 212): Several memory ordering fixes in C-code.
goetz
parents:
11096
diff
changeset
|
1085 |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1086 size_t res = o->size_given_klass(k); |
| 187 | 1087 res = adjustObjectSize(res); |
| 1088 assert(res != 0, "Block size should not be 0"); | |
| 1089 return res; | |
| 1090 } else { | |
|
2226
c5a923563727
6912621: iCMS: Error: assert(_markBitMap.isMarked(addr + 1),"Missing Printezis bit?")
ysr
parents:
1972
diff
changeset
|
1091 // May return 0 if P-bits not present. |
| 187 | 1092 return c->block_size_if_printezis_bits(p); |
| 1093 } | |
| 0 | 1094 } |
| 1095 assert(loops == 0, "Can loop at most once"); | |
| 1096 DEBUG_ONLY(loops++;) | |
| 1097 } | |
| 1098 } | |
| 1099 | |
| 1100 size_t CompactibleFreeListSpace::block_size_nopar(const HeapWord* p) const { | |
| 1101 NOT_PRODUCT(verify_objects_initialized()); | |
| 1102 assert(MemRegion(bottom(), end()).contains(p), "p not in space"); | |
| 1103 FreeChunk* fc = (FreeChunk*)p; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1104 if (fc->is_free()) { |
| 0 | 1105 return fc->size(); |
| 1106 } else { | |
| 1107 // Ignore mark word because this may be a recently promoted | |
| 1108 // object whose mark word is used to chain together grey | |
| 1109 // objects (the last one would have a null value). | |
| 1110 assert(oop(p)->is_oop(true), "Should be an oop"); | |
| 1111 return adjustObjectSize(oop(p)->size()); | |
| 1112 } | |
| 1113 } | |
| 1114 | |
| 1115 // This implementation assumes that the property of "being an object" is | |
| 1116 // stable. But being a free chunk may not be (because of parallel | |
| 1117 // promotion.) | |
| 1118 bool CompactibleFreeListSpace::block_is_obj(const HeapWord* p) const { | |
| 1119 FreeChunk* fc = (FreeChunk*)p; | |
| 1120 assert(is_in_reserved(p), "Should be in space"); | |
| 1121 // When doing a mark-sweep-compact of the CMS generation, this | |
| 1122 // assertion may fail because prepare_for_compaction() uses | |
| 1123 // space that is garbage to maintain information on ranges of | |
| 1124 // live objects so that these live ranges can be moved as a whole. | |
| 1125 // Comment out this assertion until that problem can be solved | |
| 1126 // (i.e., that the block start calculation may look at objects | |
| 1127 // at address below "p" in finding the object that contains "p" | |
| 1128 // and those objects (if garbage) may have been modified to hold | |
| 1129 // live range information. | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
1130 // 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
|
1131 // "Should be a block boundary"); |
| 187 | 1132 if (FreeChunk::indicatesFreeChunk(p)) return false; |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
1133 Klass* k = oop(p)->klass_or_null(); |
| 0 | 1134 if (k != NULL) { |
| 1135 // Ignore mark word because it may have been used to | |
| 1136 // chain together promoted objects (the last one | |
| 1137 // would have a null value). | |
| 1138 assert(oop(p)->is_oop(true), "Should be an oop"); | |
| 1139 return true; | |
| 1140 } else { | |
| 1141 return false; // Was not an object at the start of collection. | |
| 1142 } | |
| 1143 } | |
| 1144 | |
| 1145 // Check if the object is alive. This fact is checked either by consulting | |
| 1146 // the main marking bitmap in the sweeping phase or, if it's a permanent | |
| 1147 // generation and we're not in the sweeping phase, by checking the | |
| 1148 // perm_gen_verify_bit_map where we store the "deadness" information if | |
| 1149 // we did not sweep the perm gen in the most recent previous GC cycle. | |
| 1150 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
|
1151 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
|
1152 "Else races are possible"); |
|
1951
899bbbdcb6ea
6997298: fatal error: must own lock CMS_markBitMap_lock during heap dump
ysr
parents:
1833
diff
changeset
|
1153 assert(block_is_obj(p), "The address should point to an object"); |
| 0 | 1154 |
| 1155 // If we're sweeping, we use object liveness information from the main bit map | |
| 1156 // for both perm gen and old gen. | |
| 1157 // We don't need to lock the bitmap (live_map or dead_map below), because | |
| 1158 // EITHER we are in the middle of the sweeping phase, and the | |
| 1159 // main marking bit map (live_map below) is locked, | |
| 1160 // OR we're in other phases and perm_gen_verify_bit_map (dead_map below) | |
| 1161 // 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
|
1162 // 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
|
1163 // 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
|
1164 // 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
|
1165 // 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
|
1166 // if/when the perm gen goes away in the future. |
| 0 | 1167 if (_collector->abstract_state() == CMSCollector::Sweeping) { |
| 1168 CMSBitMap* live_map = _collector->markBitMap(); | |
|
1951
899bbbdcb6ea
6997298: fatal error: must own lock CMS_markBitMap_lock during heap dump
ysr
parents:
1833
diff
changeset
|
1169 return live_map->par_isMarked((HeapWord*) p); |
| 0 | 1170 } |
| 1171 return true; | |
| 1172 } | |
| 1173 | |
| 1174 bool CompactibleFreeListSpace::block_is_obj_nopar(const HeapWord* p) const { | |
| 1175 FreeChunk* fc = (FreeChunk*)p; | |
| 1176 assert(is_in_reserved(p), "Should be in space"); | |
| 1177 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
|
1178 if (!fc->is_free()) { |
| 0 | 1179 // Ignore mark word because it may have been used to |
| 1180 // chain together promoted objects (the last one | |
| 1181 // would have a null value). | |
| 1182 assert(oop(p)->is_oop(true), "Should be an oop"); | |
| 1183 return true; | |
| 1184 } | |
| 1185 return false; | |
| 1186 } | |
| 1187 | |
| 1188 // "MT-safe but not guaranteed MT-precise" (TM); you may get an | |
| 1189 // approximate answer if you don't hold the freelistlock when you call this. | |
| 1190 size_t CompactibleFreeListSpace::totalSizeInIndexedFreeLists() const { | |
| 1191 size_t size = 0; | |
| 1192 for (size_t i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { | |
| 1193 debug_only( | |
| 1194 // We may be calling here without the lock in which case we | |
| 1195 // won't do this modest sanity check. | |
| 1196 if (freelistLock()->owned_by_self()) { | |
| 1197 size_t total_list_size = 0; | |
| 1198 for (FreeChunk* fc = _indexedFreeList[i].head(); fc != NULL; | |
| 1199 fc = fc->next()) { | |
| 1200 total_list_size += i; | |
| 1201 } | |
| 1202 assert(total_list_size == i * _indexedFreeList[i].count(), | |
| 1203 "Count in list is incorrect"); | |
| 1204 } | |
| 1205 ) | |
| 1206 size += i * _indexedFreeList[i].count(); | |
| 1207 } | |
| 1208 return size; | |
| 1209 } | |
| 1210 | |
| 1211 HeapWord* CompactibleFreeListSpace::par_allocate(size_t size) { | |
| 1212 MutexLockerEx x(freelistLock(), Mutex::_no_safepoint_check_flag); | |
| 1213 return allocate(size); | |
| 1214 } | |
| 1215 | |
| 1216 HeapWord* | |
| 1217 CompactibleFreeListSpace::getChunkFromSmallLinearAllocBlockRemainder(size_t size) { | |
| 1218 return getChunkFromLinearAllocBlockRemainder(&_smallLinearAllocBlock, size); | |
| 1219 } | |
| 1220 | |
| 1221 HeapWord* CompactibleFreeListSpace::allocate(size_t size) { | |
| 1222 assert_lock_strong(freelistLock()); | |
| 1223 HeapWord* res = NULL; | |
| 1224 assert(size == adjustObjectSize(size), | |
| 1225 "use adjustObjectSize() before calling into allocate()"); | |
| 1226 | |
| 1227 if (_adaptive_freelists) { | |
| 1228 res = allocate_adaptive_freelists(size); | |
| 1229 } else { // non-adaptive free lists | |
| 1230 res = allocate_non_adaptive_freelists(size); | |
| 1231 } | |
| 1232 | |
| 1233 if (res != NULL) { | |
| 1234 // check that res does lie in this space! | |
| 1235 assert(is_in_reserved(res), "Not in this space!"); | |
| 1236 assert(is_aligned((void*)res), "alignment check"); | |
| 1237 | |
| 1238 FreeChunk* fc = (FreeChunk*)res; | |
| 1239 fc->markNotFree(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1240 assert(!fc->is_free(), "shouldn't be marked free"); |
| 187 | 1241 assert(oop(fc)->klass_or_null() == NULL, "should look uninitialized"); |
| 0 | 1242 // Verify that the block offset table shows this to |
| 1243 // be a single block, but not one which is unallocated. | |
| 1244 _bt.verify_single_block(res, size); | |
| 1245 _bt.verify_not_unallocated(res, size); | |
| 1246 // mangle a just allocated object with a distinct pattern. | |
| 1247 debug_only(fc->mangleAllocated(size)); | |
| 1248 } | |
| 1249 | |
| 1250 return res; | |
| 1251 } | |
| 1252 | |
| 1253 HeapWord* CompactibleFreeListSpace::allocate_non_adaptive_freelists(size_t size) { | |
| 1254 HeapWord* res = NULL; | |
| 1255 // try and use linear allocation for smaller blocks | |
| 1256 if (size < _smallLinearAllocBlock._allocation_size_limit) { | |
| 1257 // if successful, the following also adjusts block offset table | |
| 1258 res = getChunkFromSmallLinearAllocBlock(size); | |
| 1259 } | |
| 1260 // Else triage to indexed lists for smaller sizes | |
| 1261 if (res == NULL) { | |
| 1262 if (size < SmallForDictionary) { | |
| 1263 res = (HeapWord*) getChunkFromIndexedFreeList(size); | |
| 1264 } else { | |
| 1265 // else get it from the big dictionary; if even this doesn't | |
| 1266 // work we are out of luck. | |
| 1267 res = (HeapWord*)getChunkFromDictionaryExact(size); | |
| 1268 } | |
| 1269 } | |
| 1270 | |
| 1271 return res; | |
| 1272 } | |
| 1273 | |
| 1274 HeapWord* CompactibleFreeListSpace::allocate_adaptive_freelists(size_t size) { | |
| 1275 assert_lock_strong(freelistLock()); | |
| 1276 HeapWord* res = NULL; | |
| 1277 assert(size == adjustObjectSize(size), | |
| 1278 "use adjustObjectSize() before calling into allocate()"); | |
| 1279 | |
| 1280 // Strategy | |
| 1281 // if small | |
| 1282 // exact size from small object indexed list if small | |
| 1283 // small or large linear allocation block (linAB) as appropriate | |
| 1284 // take from lists of greater sized chunks | |
| 1285 // else | |
| 1286 // dictionary | |
| 1287 // small or large linear allocation block if it has the space | |
| 1288 // Try allocating exact size from indexTable first | |
| 1289 if (size < IndexSetSize) { | |
| 1290 res = (HeapWord*) getChunkFromIndexedFreeList(size); | |
| 1291 if(res != NULL) { | |
| 1292 assert(res != (HeapWord*)_indexedFreeList[size].head(), | |
| 1293 "Not removed from free list"); | |
| 1294 // no block offset table adjustment is necessary on blocks in | |
| 1295 // the indexed lists. | |
| 1296 | |
| 1297 // Try allocating from the small LinAB | |
| 1298 } else if (size < _smallLinearAllocBlock._allocation_size_limit && | |
| 1299 (res = getChunkFromSmallLinearAllocBlock(size)) != NULL) { | |
| 1300 // if successful, the above also adjusts block offset table | |
| 1301 // Note that this call will refill the LinAB to | |
| 1302 // satisfy the request. This is different that | |
| 1303 // evm. | |
| 1304 // Don't record chunk off a LinAB? smallSplitBirth(size); | |
| 1305 } else { | |
| 1306 // Raid the exact free lists larger than size, even if they are not | |
| 1307 // overpopulated. | |
| 1308 res = (HeapWord*) getChunkFromGreater(size); | |
| 1309 } | |
| 1310 } else { | |
| 1311 // Big objects get allocated directly from the dictionary. | |
| 1312 res = (HeapWord*) getChunkFromDictionaryExact(size); | |
| 1313 if (res == NULL) { | |
| 1314 // Try hard not to fail since an allocation failure will likely | |
| 1315 // trigger a synchronous GC. Try to get the space from the | |
| 1316 // allocation blocks. | |
| 1317 res = getChunkFromSmallLinearAllocBlockRemainder(size); | |
| 1318 } | |
| 1319 } | |
| 1320 | |
| 1321 return res; | |
| 1322 } | |
| 1323 | |
| 1324 // A worst-case estimate of the space required (in HeapWords) to expand the heap | |
| 1325 // when promoting obj. | |
| 1326 size_t CompactibleFreeListSpace::expansionSpaceRequired(size_t obj_size) const { | |
| 1327 // Depending on the object size, expansion may require refilling either a | |
| 1328 // bigLAB or a smallLAB plus refilling a PromotionInfo object. MinChunkSize | |
| 1329 // is added because the dictionary may over-allocate to avoid fragmentation. | |
| 1330 size_t space = obj_size; | |
| 1331 if (!_adaptive_freelists) { | |
| 1332 space = MAX2(space, _smallLinearAllocBlock._refillSize); | |
| 1333 } | |
| 1334 space += _promoInfo.refillSize() + 2 * MinChunkSize; | |
| 1335 return space; | |
| 1336 } | |
| 1337 | |
| 1338 FreeChunk* CompactibleFreeListSpace::getChunkFromGreater(size_t numWords) { | |
| 1339 FreeChunk* ret; | |
| 1340 | |
| 1341 assert(numWords >= MinChunkSize, "Size is less than minimum"); | |
| 1342 assert(linearAllocationWouldFail() || bestFitFirst(), | |
| 1343 "Should not be here"); | |
| 1344 | |
| 1345 size_t i; | |
| 1346 size_t currSize = numWords + MinChunkSize; | |
| 1347 assert(currSize % MinObjAlignment == 0, "currSize should be aligned"); | |
| 1348 for (i = currSize; i < IndexSetSize; i += IndexSetStride) { | |
| 6885 | 1349 AdaptiveFreeList<FreeChunk>* fl = &_indexedFreeList[i]; |
| 0 | 1350 if (fl->head()) { |
| 1351 ret = getFromListGreater(fl, numWords); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1352 assert(ret == NULL || ret->is_free(), "Should be returning a free chunk"); |
| 0 | 1353 return ret; |
| 1354 } | |
| 1355 } | |
| 1356 | |
| 1357 currSize = MAX2((size_t)SmallForDictionary, | |
| 1358 (size_t)(numWords + MinChunkSize)); | |
| 1359 | |
| 1360 /* Try to get a chunk that satisfies request, while avoiding | |
| 1361 fragmentation that can't be handled. */ | |
| 1362 { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1363 ret = dictionary()->get_chunk(currSize); |
| 0 | 1364 if (ret != NULL) { |
| 1365 assert(ret->size() - numWords >= MinChunkSize, | |
| 1366 "Chunk is too small"); | |
| 1367 _bt.allocated((HeapWord*)ret, ret->size()); | |
| 1368 /* Carve returned chunk. */ | |
| 1369 (void) splitChunkAndReturnRemainder(ret, numWords); | |
| 1370 /* Label this as no longer a free chunk. */ | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1371 assert(ret->is_free(), "This chunk should be free"); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1372 ret->link_prev(NULL); |
| 0 | 1373 } |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1374 assert(ret == NULL || ret->is_free(), "Should be returning a free chunk"); |
| 0 | 1375 return ret; |
| 1376 } | |
| 1377 ShouldNotReachHere(); | |
| 1378 } | |
| 1379 | |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1380 bool CompactibleFreeListSpace::verifyChunkInIndexedFreeLists(FreeChunk* fc) const { |
| 0 | 1381 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
|
1382 return _indexedFreeList[fc->size()].verify_chunk_in_free_list(fc); |
| 0 | 1383 } |
| 1384 | |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1385 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
|
1386 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
|
1387 (_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
|
1388 "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
|
1389 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
|
1390 (_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
|
1391 } |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1392 |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1393 // 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
|
1394 // 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
|
1395 // 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
|
1396 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
|
1397 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
|
1398 return true; |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1399 } 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
|
1400 return verifyChunkInIndexedFreeLists(fc); |
|
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
1401 } else { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1402 return dictionary()->verify_chunk_in_free_list(fc); |
| 0 | 1403 } |
| 1404 } | |
| 1405 | |
| 1406 #ifndef PRODUCT | |
| 1407 void CompactibleFreeListSpace::assert_locked() const { | |
| 1408 CMSLockVerifier::assert_locked(freelistLock(), parDictionaryAllocLock()); | |
| 1409 } | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1410 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1411 void CompactibleFreeListSpace::assert_locked(const Mutex* lock) const { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1412 CMSLockVerifier::assert_locked(lock); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1413 } |
| 0 | 1414 #endif |
| 1415 | |
| 1416 FreeChunk* CompactibleFreeListSpace::allocateScratch(size_t size) { | |
| 1417 // In the parallel case, the main thread holds the free list lock | |
| 1418 // on behalf the parallel threads. | |
| 1419 FreeChunk* fc; | |
| 1420 { | |
| 1421 // If GC is parallel, this might be called by several threads. | |
| 1422 // This should be rare enough that the locking overhead won't affect | |
| 1423 // the sequential code. | |
| 1424 MutexLockerEx x(parDictionaryAllocLock(), | |
| 1425 Mutex::_no_safepoint_check_flag); | |
| 1426 fc = getChunkFromDictionary(size); | |
| 1427 } | |
| 1428 if (fc != NULL) { | |
| 1429 fc->dontCoalesce(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1430 assert(fc->is_free(), "Should be free, but not coalescable"); |
| 0 | 1431 // Verify that the block offset table shows this to |
| 1432 // be a single block, but not one which is unallocated. | |
| 1433 _bt.verify_single_block((HeapWord*)fc, fc->size()); | |
| 1434 _bt.verify_not_unallocated((HeapWord*)fc, fc->size()); | |
| 1435 } | |
| 1436 return fc; | |
| 1437 } | |
| 1438 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
1439 oop CompactibleFreeListSpace::promote(oop obj, size_t obj_size) { |
| 0 | 1440 assert(obj_size == (size_t)obj->size(), "bad obj_size passed in"); |
| 1441 assert_locked(); | |
| 1442 | |
| 1443 // if we are tracking promotions, then first ensure space for | |
| 1444 // promotion (including spooling space for saving header if necessary). | |
| 1445 // then allocate and copy, then track promoted info if needed. | |
| 1446 // When tracking (see PromotionInfo::track()), the mark word may | |
| 1447 // be displaced and in this case restoration of the mark word | |
| 1448 // occurs in the (oop_since_save_marks_)iterate phase. | |
| 1449 if (_promoInfo.tracking() && !_promoInfo.ensure_spooling_space()) { | |
| 1450 return NULL; | |
| 1451 } | |
| 1452 // Call the allocate(size_t, bool) form directly to avoid the | |
| 1453 // additional call through the allocate(size_t) form. Having | |
| 1454 // the compile inline the call is problematic because allocate(size_t) | |
| 1455 // is a virtual method. | |
| 1456 HeapWord* res = allocate(adjustObjectSize(obj_size)); | |
| 1457 if (res != NULL) { | |
| 1458 Copy::aligned_disjoint_words((HeapWord*)obj, res, obj_size); | |
| 1459 // if we should be tracking promotions, do so. | |
| 1460 if (_promoInfo.tracking()) { | |
| 1461 _promoInfo.track((PromotedObject*)res); | |
| 1462 } | |
| 1463 } | |
| 1464 return oop(res); | |
| 1465 } | |
| 1466 | |
| 1467 HeapWord* | |
| 1468 CompactibleFreeListSpace::getChunkFromSmallLinearAllocBlock(size_t size) { | |
| 1469 assert_locked(); | |
| 1470 assert(size >= MinChunkSize, "minimum chunk size"); | |
| 1471 assert(size < _smallLinearAllocBlock._allocation_size_limit, | |
| 1472 "maximum from smallLinearAllocBlock"); | |
| 1473 return getChunkFromLinearAllocBlock(&_smallLinearAllocBlock, size); | |
| 1474 } | |
| 1475 | |
| 1476 HeapWord* | |
| 1477 CompactibleFreeListSpace::getChunkFromLinearAllocBlock(LinearAllocBlock *blk, | |
| 1478 size_t size) { | |
| 1479 assert_locked(); | |
| 1480 assert(size >= MinChunkSize, "too small"); | |
| 1481 HeapWord* res = NULL; | |
| 1482 // Try to do linear allocation from blk, making sure that | |
| 1483 if (blk->_word_size == 0) { | |
| 1484 // We have probably been unable to fill this either in the prologue or | |
| 1485 // when it was exhausted at the last linear allocation. Bail out until | |
| 1486 // next time. | |
| 1487 assert(blk->_ptr == NULL, "consistency check"); | |
| 1488 return NULL; | |
| 1489 } | |
| 1490 assert(blk->_word_size != 0 && blk->_ptr != NULL, "consistency check"); | |
| 1491 res = getChunkFromLinearAllocBlockRemainder(blk, size); | |
| 1492 if (res != NULL) return res; | |
| 1493 | |
| 1494 // about to exhaust this linear allocation block | |
| 1495 if (blk->_word_size == size) { // exactly satisfied | |
| 1496 res = blk->_ptr; | |
| 1497 _bt.allocated(res, blk->_word_size); | |
| 1498 } else if (size + MinChunkSize <= blk->_refillSize) { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1499 size_t sz = blk->_word_size; |
| 0 | 1500 // Update _unallocated_block if the size is such that chunk would be |
| 1501 // returned to the indexed free list. All other chunks in the indexed | |
| 1502 // free lists are allocated from the dictionary so that _unallocated_block | |
| 1503 // has already been adjusted for them. Do it here so that the cost | |
| 1504 // for all chunks added back to the indexed free lists. | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1505 if (sz < SmallForDictionary) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1506 _bt.allocated(blk->_ptr, sz); |
| 0 | 1507 } |
| 1508 // 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
|
1509 addChunkToFreeLists(blk->_ptr, sz); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1510 split_birth(sz); |
| 0 | 1511 // Don't keep statistics on adding back chunk from a LinAB. |
| 1512 } else { | |
| 1513 // A refilled block would not satisfy the request. | |
| 1514 return NULL; | |
| 1515 } | |
| 1516 | |
| 1517 blk->_ptr = NULL; blk->_word_size = 0; | |
| 1518 refillLinearAllocBlock(blk); | |
| 1519 assert(blk->_ptr == NULL || blk->_word_size >= size + MinChunkSize, | |
| 1520 "block was replenished"); | |
| 1521 if (res != NULL) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1522 split_birth(size); |
| 0 | 1523 repairLinearAllocBlock(blk); |
| 1524 } else if (blk->_ptr != NULL) { | |
| 1525 res = blk->_ptr; | |
| 1526 size_t blk_size = blk->_word_size; | |
| 1527 blk->_word_size -= size; | |
| 1528 blk->_ptr += size; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1529 split_birth(size); |
| 0 | 1530 repairLinearAllocBlock(blk); |
| 1531 // Update BOT last so that other (parallel) GC threads see a consistent | |
| 1532 // view of the BOT and free blocks. | |
| 1533 // 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
|
1534 OrderAccess::storestore(); |
| 0 | 1535 _bt.split_block(res, blk_size, size); // adjust block offset table |
| 1536 } | |
| 1537 return res; | |
| 1538 } | |
| 1539 | |
| 1540 HeapWord* CompactibleFreeListSpace::getChunkFromLinearAllocBlockRemainder( | |
| 1541 LinearAllocBlock* blk, | |
| 1542 size_t size) { | |
| 1543 assert_locked(); | |
| 1544 assert(size >= MinChunkSize, "too small"); | |
| 1545 | |
| 1546 HeapWord* res = NULL; | |
| 1547 // This is the common case. Keep it simple. | |
| 1548 if (blk->_word_size >= size + MinChunkSize) { | |
| 1549 assert(blk->_ptr != NULL, "consistency check"); | |
| 1550 res = blk->_ptr; | |
| 1551 // Note that the BOT is up-to-date for the linAB before allocation. It | |
| 1552 // indicates the start of the linAB. The split_block() updates the | |
| 1553 // BOT for the linAB after the allocation (indicates the start of the | |
| 1554 // next chunk to be allocated). | |
| 1555 size_t blk_size = blk->_word_size; | |
| 1556 blk->_word_size -= size; | |
| 1557 blk->_ptr += size; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1558 split_birth(size); |
| 0 | 1559 repairLinearAllocBlock(blk); |
| 1560 // Update BOT last so that other (parallel) GC threads see a consistent | |
| 1561 // view of the BOT and free blocks. | |
| 1562 // 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
|
1563 OrderAccess::storestore(); |
| 0 | 1564 _bt.split_block(res, blk_size, size); // adjust block offset table |
| 1565 _bt.allocated(res, size); | |
| 1566 } | |
| 1567 return res; | |
| 1568 } | |
| 1569 | |
| 1570 FreeChunk* | |
| 1571 CompactibleFreeListSpace::getChunkFromIndexedFreeList(size_t size) { | |
| 1572 assert_locked(); | |
| 1573 assert(size < SmallForDictionary, "just checking"); | |
| 1574 FreeChunk* res; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1575 res = _indexedFreeList[size].get_chunk_at_head(); |
| 0 | 1576 if (res == NULL) { |
| 1577 res = getChunkFromIndexedFreeListHelper(size); | |
| 1578 } | |
| 1579 _bt.verify_not_unallocated((HeapWord*) res, size); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1580 assert(res == NULL || res->size() == size, "Incorrect block size"); |
| 0 | 1581 return res; |
| 1582 } | |
| 1583 | |
| 1584 FreeChunk* | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1585 CompactibleFreeListSpace::getChunkFromIndexedFreeListHelper(size_t size, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1586 bool replenish) { |
| 0 | 1587 assert_locked(); |
| 1588 FreeChunk* fc = NULL; | |
| 1589 if (size < SmallForDictionary) { | |
| 1590 assert(_indexedFreeList[size].head() == NULL || | |
| 1591 _indexedFreeList[size].surplus() <= 0, | |
| 1592 "List for this size should be empty or under populated"); | |
| 1593 // Try best fit in exact lists before replenishing the list | |
| 1594 if (!bestFitFirst() || (fc = bestFitSmall(size)) == NULL) { | |
| 1595 // Replenish list. | |
| 1596 // | |
| 1597 // Things tried that failed. | |
| 1598 // Tried allocating out of the two LinAB's first before | |
| 1599 // replenishing lists. | |
| 1600 // Tried small linAB of size 256 (size in indexed list) | |
| 1601 // and replenishing indexed lists from the small linAB. | |
| 1602 // | |
| 1603 FreeChunk* newFc = NULL; | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1604 const size_t replenish_size = CMSIndexedFreeListReplenish * size; |
| 0 | 1605 if (replenish_size < SmallForDictionary) { |
| 1606 // Do not replenish from an underpopulated size. | |
| 1607 if (_indexedFreeList[replenish_size].surplus() > 0 && | |
| 1608 _indexedFreeList[replenish_size].head() != NULL) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1609 newFc = _indexedFreeList[replenish_size].get_chunk_at_head(); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1610 } else if (bestFitFirst()) { |
| 0 | 1611 newFc = bestFitSmall(replenish_size); |
| 1612 } | |
| 1613 } | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1614 if (newFc == NULL && replenish_size > size) { |
| 0 | 1615 assert(CMSIndexedFreeListReplenish > 1, "ctl pt invariant"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1616 newFc = getChunkFromIndexedFreeListHelper(replenish_size, false); |
| 0 | 1617 } |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1618 // Note: The stats update re split-death of block obtained above |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1619 // 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
|
1620 // be actually splitting it into more than one pieces below. |
| 0 | 1621 if (newFc != NULL) { |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1622 if (replenish || CMSReplenishIntermediate) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1623 // Replenish this list and return one block to caller. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1624 size_t i; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1625 FreeChunk *curFc, *nextFc; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1626 size_t num_blk = newFc->size() / size; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1627 assert(num_blk >= 1, "Smaller than requested?"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1628 assert(newFc->size() % size == 0, "Should be integral multiple of request"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1629 if (num_blk > 1) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1630 // we are sure we will be splitting the block just obtained |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1631 // into multiple pieces; record the split-death of the original |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1632 splitDeath(replenish_size); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1633 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1634 // carve up and link blocks 0, ..., num_blk - 2 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1635 // 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
|
1636 // free chunk. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1637 for (curFc = newFc, nextFc = (FreeChunk*)((HeapWord*)curFc + size), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1638 i = 0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1639 i < (num_blk - 1); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1640 curFc = nextFc, nextFc = (FreeChunk*)((HeapWord*)nextFc + size), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1641 i++) { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1642 curFc->set_size(size); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1643 // 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
|
1644 // determine the "returns" from a GC. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1645 _bt.verify_not_unallocated((HeapWord*) fc, size); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1646 _indexedFreeList[size].return_chunk_at_tail(curFc, false); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1647 _bt.mark_block((HeapWord*)curFc, size); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1648 split_birth(size); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1649 // Don't record the initial population of the indexed list |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1650 // as a split birth. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1651 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1652 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1653 // check that the arithmetic was OK above |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1654 assert((HeapWord*)nextFc == (HeapWord*)newFc + num_blk*size, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1655 "inconsistency in carving newFc"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1656 curFc->set_size(size); |
| 0 | 1657 _bt.mark_block((HeapWord*)curFc, size); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1658 split_birth(size); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1659 fc = curFc; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1660 } else { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1661 // Return entire block to caller |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1662 fc = newFc; |
| 0 | 1663 } |
| 1664 } | |
| 1665 } | |
| 1666 } else { | |
| 1667 // Get a free chunk from the free chunk dictionary to be returned to | |
| 1668 // replenish the indexed free list. | |
| 1669 fc = getChunkFromDictionaryExact(size); | |
| 1670 } | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1671 // assert(fc == NULL || fc->is_free(), "Should be returning a free chunk"); |
| 0 | 1672 return fc; |
| 1673 } | |
| 1674 | |
| 1675 FreeChunk* | |
| 1676 CompactibleFreeListSpace::getChunkFromDictionary(size_t size) { | |
| 1677 assert_locked(); | |
|
7947
3c327c2b6782
8004895: NPG: JMapPermCore test failure caused by warnings about missing field
jmasa
parents:
7448
diff
changeset
|
1678 FreeChunk* fc = _dictionary->get_chunk(size, |
|
3c327c2b6782
8004895: NPG: JMapPermCore test failure caused by warnings about missing field
jmasa
parents:
7448
diff
changeset
|
1679 FreeBlockDictionary<FreeChunk>::atLeast); |
| 0 | 1680 if (fc == NULL) { |
| 1681 return NULL; | |
| 1682 } | |
| 1683 _bt.allocated((HeapWord*)fc, fc->size()); | |
| 1684 if (fc->size() >= size + MinChunkSize) { | |
| 1685 fc = splitChunkAndReturnRemainder(fc, size); | |
| 1686 } | |
| 1687 assert(fc->size() >= size, "chunk too small"); | |
| 1688 assert(fc->size() < size + MinChunkSize, "chunk too big"); | |
| 1689 _bt.verify_single_block((HeapWord*)fc, fc->size()); | |
| 1690 return fc; | |
| 1691 } | |
| 1692 | |
| 1693 FreeChunk* | |
| 1694 CompactibleFreeListSpace::getChunkFromDictionaryExact(size_t size) { | |
| 1695 assert_locked(); | |
|
7947
3c327c2b6782
8004895: NPG: JMapPermCore test failure caused by warnings about missing field
jmasa
parents:
7448
diff
changeset
|
1696 FreeChunk* fc = _dictionary->get_chunk(size, |
|
3c327c2b6782
8004895: NPG: JMapPermCore test failure caused by warnings about missing field
jmasa
parents:
7448
diff
changeset
|
1697 FreeBlockDictionary<FreeChunk>::atLeast); |
| 0 | 1698 if (fc == NULL) { |
| 1699 return fc; | |
| 1700 } | |
| 1701 _bt.allocated((HeapWord*)fc, fc->size()); | |
| 1702 if (fc->size() == size) { | |
| 1703 _bt.verify_single_block((HeapWord*)fc, size); | |
| 1704 return fc; | |
| 1705 } | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1706 assert(fc->size() > size, "get_chunk() guarantee"); |
| 0 | 1707 if (fc->size() < size + MinChunkSize) { |
| 1708 // Return the chunk to the dictionary and go get a bigger one. | |
| 1709 returnChunkToDictionary(fc); | |
|
7947
3c327c2b6782
8004895: NPG: JMapPermCore test failure caused by warnings about missing field
jmasa
parents:
7448
diff
changeset
|
1710 fc = _dictionary->get_chunk(size + MinChunkSize, |
|
3c327c2b6782
8004895: NPG: JMapPermCore test failure caused by warnings about missing field
jmasa
parents:
7448
diff
changeset
|
1711 FreeBlockDictionary<FreeChunk>::atLeast); |
| 0 | 1712 if (fc == NULL) { |
| 1713 return NULL; | |
| 1714 } | |
| 1715 _bt.allocated((HeapWord*)fc, fc->size()); | |
| 1716 } | |
| 1717 assert(fc->size() >= size + MinChunkSize, "tautology"); | |
| 1718 fc = splitChunkAndReturnRemainder(fc, size); | |
| 1719 assert(fc->size() == size, "chunk is wrong size"); | |
| 1720 _bt.verify_single_block((HeapWord*)fc, size); | |
| 1721 return fc; | |
| 1722 } | |
| 1723 | |
| 1724 void | |
| 1725 CompactibleFreeListSpace::returnChunkToDictionary(FreeChunk* chunk) { | |
| 1726 assert_locked(); | |
| 1727 | |
| 1728 size_t size = chunk->size(); | |
| 1729 _bt.verify_single_block((HeapWord*)chunk, size); | |
| 1730 // adjust _unallocated_block downward, as necessary | |
| 1731 _bt.freed((HeapWord*)chunk, size); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1732 _dictionary->return_chunk(chunk); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1733 #ifndef PRODUCT |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1734 if (CMSCollector::abstract_state() != CMSCollector::Sweeping) { |
|
17695
ab36007d6358
8034171: Remove use of template template parameters from binaryTreeDictionary.
goetz
parents:
11096
diff
changeset
|
1735 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
|
1736 TreeList<FreeChunk, AdaptiveFreeList<FreeChunk> >* tl = tc->list(); |
| 6885 | 1737 tl->verify_stats(); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1738 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1739 #endif // PRODUCT |
| 0 | 1740 } |
| 1741 | |
| 1742 void | |
| 1743 CompactibleFreeListSpace::returnChunkToFreeList(FreeChunk* fc) { | |
| 1744 assert_locked(); | |
| 1745 size_t size = fc->size(); | |
| 1746 _bt.verify_single_block((HeapWord*) fc, size); | |
| 1747 _bt.verify_not_unallocated((HeapWord*) fc, size); | |
| 1748 if (_adaptive_freelists) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1749 _indexedFreeList[size].return_chunk_at_tail(fc); |
| 0 | 1750 } else { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1751 _indexedFreeList[size].return_chunk_at_head(fc); |
| 0 | 1752 } |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1753 #ifndef PRODUCT |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1754 if (CMSCollector::abstract_state() != CMSCollector::Sweeping) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1755 _indexedFreeList[size].verify_stats(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1756 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
1757 #endif // PRODUCT |
| 0 | 1758 } |
| 1759 | |
| 1760 // Add chunk to end of last block -- if it's the largest | |
| 1761 // block -- and update BOT and census data. We would | |
| 1762 // of course have preferred to coalesce it with the | |
| 1763 // last block, but it's currently less expensive to find the | |
| 1764 // largest block than it is to find the last. | |
| 1765 void | |
| 1766 CompactibleFreeListSpace::addChunkToFreeListsAtEndRecordingStats( | |
| 1767 HeapWord* chunk, size_t size) { | |
| 1768 // check that the chunk does lie in this space! | |
| 1769 assert(chunk != NULL && is_in_reserved(chunk), "Not in this space!"); | |
| 1770 // One of the parallel gc task threads may be here | |
| 1771 // whilst others are allocating. | |
| 1772 Mutex* lock = NULL; | |
| 1773 if (ParallelGCThreads != 0) { | |
| 1774 lock = &_parDictionaryAllocLock; | |
| 1775 } | |
| 1776 FreeChunk* ec; | |
| 1777 { | |
| 1778 MutexLockerEx x(lock, Mutex::_no_safepoint_check_flag); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1779 ec = dictionary()->find_largest_dict(); // get largest block |
| 6885 | 1780 if (ec != NULL && ec->end() == (uintptr_t*) chunk) { |
| 0 | 1781 // It's a coterminal block - we can coalesce. |
| 1782 size_t old_size = ec->size(); | |
| 1783 coalDeath(old_size); | |
| 1784 removeChunkFromDictionary(ec); | |
| 1785 size += old_size; | |
| 1786 } else { | |
| 1787 ec = (FreeChunk*)chunk; | |
| 1788 } | |
| 1789 } | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1790 ec->set_size(size); |
| 0 | 1791 debug_only(ec->mangleFreed(size)); |
|
10334
7c5a1b62f53d
8014971: Minor code cleanup of the freelist management
brutisso
parents:
10331
diff
changeset
|
1792 if (size < SmallForDictionary && ParallelGCThreads != 0) { |
| 0 | 1793 lock = _indexedFreeListParLocks[size]; |
| 1794 } | |
| 1795 MutexLockerEx x(lock, Mutex::_no_safepoint_check_flag); | |
| 1796 addChunkAndRepairOffsetTable((HeapWord*)ec, size, true); | |
| 1797 // record the birth under the lock since the recording involves | |
| 1798 // manipulation of the list on which the chunk lives and | |
| 1799 // if the chunk is allocated and is the last on the list, | |
| 1800 // the list can go away. | |
| 1801 coalBirth(size); | |
| 1802 } | |
| 1803 | |
| 1804 void | |
| 1805 CompactibleFreeListSpace::addChunkToFreeLists(HeapWord* chunk, | |
| 1806 size_t size) { | |
| 1807 // check that the chunk does lie in this space! | |
| 1808 assert(chunk != NULL && is_in_reserved(chunk), "Not in this space!"); | |
| 1809 assert_locked(); | |
| 1810 _bt.verify_single_block(chunk, size); | |
| 1811 | |
| 1812 FreeChunk* fc = (FreeChunk*) chunk; | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1813 fc->set_size(size); |
| 0 | 1814 debug_only(fc->mangleFreed(size)); |
| 1815 if (size < SmallForDictionary) { | |
| 1816 returnChunkToFreeList(fc); | |
| 1817 } else { | |
| 1818 returnChunkToDictionary(fc); | |
| 1819 } | |
| 1820 } | |
| 1821 | |
| 1822 void | |
| 1823 CompactibleFreeListSpace::addChunkAndRepairOffsetTable(HeapWord* chunk, | |
| 1824 size_t size, bool coalesced) { | |
| 1825 assert_locked(); | |
| 1826 assert(chunk != NULL, "null chunk"); | |
| 1827 if (coalesced) { | |
| 1828 // repair BOT | |
| 1829 _bt.single_block(chunk, size); | |
| 1830 } | |
| 1831 addChunkToFreeLists(chunk, size); | |
| 1832 } | |
| 1833 | |
| 1834 // We _must_ find the purported chunk on our free lists; | |
| 1835 // we assert if we don't. | |
| 1836 void | |
| 1837 CompactibleFreeListSpace::removeFreeChunkFromFreeLists(FreeChunk* fc) { | |
| 1838 size_t size = fc->size(); | |
| 1839 assert_locked(); | |
| 1840 debug_only(verifyFreeLists()); | |
| 1841 if (size < SmallForDictionary) { | |
| 1842 removeChunkFromIndexedFreeList(fc); | |
| 1843 } else { | |
| 1844 removeChunkFromDictionary(fc); | |
| 1845 } | |
| 1846 _bt.verify_single_block((HeapWord*)fc, size); | |
| 1847 debug_only(verifyFreeLists()); | |
| 1848 } | |
| 1849 | |
| 1850 void | |
| 1851 CompactibleFreeListSpace::removeChunkFromDictionary(FreeChunk* fc) { | |
| 1852 size_t size = fc->size(); | |
| 1853 assert_locked(); | |
| 1854 assert(fc != NULL, "null chunk"); | |
| 1855 _bt.verify_single_block((HeapWord*)fc, size); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1856 _dictionary->remove_chunk(fc); |
| 0 | 1857 // adjust _unallocated_block upward, as necessary |
| 1858 _bt.allocated((HeapWord*)fc, size); | |
| 1859 } | |
| 1860 | |
| 1861 void | |
| 1862 CompactibleFreeListSpace::removeChunkFromIndexedFreeList(FreeChunk* fc) { | |
| 1863 assert_locked(); | |
| 1864 size_t size = fc->size(); | |
| 1865 _bt.verify_single_block((HeapWord*)fc, size); | |
| 1866 NOT_PRODUCT( | |
| 1867 if (FLSVerifyIndexTable) { | |
| 1868 verifyIndexedFreeList(size); | |
| 1869 } | |
| 1870 ) | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1871 _indexedFreeList[size].remove_chunk(fc); |
| 0 | 1872 NOT_PRODUCT( |
| 1873 if (FLSVerifyIndexTable) { | |
| 1874 verifyIndexedFreeList(size); | |
| 1875 } | |
| 1876 ) | |
| 1877 } | |
| 1878 | |
| 1879 FreeChunk* CompactibleFreeListSpace::bestFitSmall(size_t numWords) { | |
| 1880 /* A hint is the next larger size that has a surplus. | |
| 1881 Start search at a size large enough to guarantee that | |
| 1882 the excess is >= MIN_CHUNK. */ | |
| 1883 size_t start = align_object_size(numWords + MinChunkSize); | |
| 1884 if (start < IndexSetSize) { | |
| 6885 | 1885 AdaptiveFreeList<FreeChunk>* it = _indexedFreeList; |
| 0 | 1886 size_t hint = _indexedFreeList[start].hint(); |
| 1887 while (hint < IndexSetSize) { | |
| 1888 assert(hint % MinObjAlignment == 0, "hint should be aligned"); | |
| 6885 | 1889 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[hint]; |
| 0 | 1890 if (fl->surplus() > 0 && fl->head() != NULL) { |
| 1891 // Found a list with surplus, reset original hint | |
| 1892 // and split out a free chunk which is returned. | |
| 1893 _indexedFreeList[start].set_hint(hint); | |
| 1894 FreeChunk* res = getFromListGreater(fl, numWords); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1895 assert(res == NULL || res->is_free(), |
| 0 | 1896 "Should be returning a free chunk"); |
| 1897 return res; | |
| 1898 } | |
| 1899 hint = fl->hint(); /* keep looking */ | |
| 1900 } | |
| 1901 /* None found. */ | |
| 1902 it[start].set_hint(IndexSetSize); | |
| 1903 } | |
| 1904 return NULL; | |
| 1905 } | |
| 1906 | |
| 1907 /* Requires fl->size >= numWords + MinChunkSize */ | |
| 6885 | 1908 FreeChunk* CompactibleFreeListSpace::getFromListGreater(AdaptiveFreeList<FreeChunk>* fl, |
| 0 | 1909 size_t numWords) { |
| 1910 FreeChunk *curr = fl->head(); | |
| 1911 size_t oldNumWords = curr->size(); | |
| 1912 assert(numWords >= MinChunkSize, "Word size is too small"); | |
| 1913 assert(curr != NULL, "List is empty"); | |
| 1914 assert(oldNumWords >= numWords + MinChunkSize, | |
| 1915 "Size of chunks in the list is too small"); | |
| 1916 | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1917 fl->remove_chunk(curr); |
| 0 | 1918 // recorded indirectly by splitChunkAndReturnRemainder - |
| 1919 // smallSplit(oldNumWords, numWords); | |
| 1920 FreeChunk* new_chunk = splitChunkAndReturnRemainder(curr, numWords); | |
| 1921 // Does anything have to be done for the remainder in terms of | |
| 1922 // fixing the card table? | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1923 assert(new_chunk == NULL || new_chunk->is_free(), |
| 0 | 1924 "Should be returning a free chunk"); |
| 1925 return new_chunk; | |
| 1926 } | |
| 1927 | |
| 1928 FreeChunk* | |
| 1929 CompactibleFreeListSpace::splitChunkAndReturnRemainder(FreeChunk* chunk, | |
| 1930 size_t new_size) { | |
| 1931 assert_locked(); | |
| 1932 size_t size = chunk->size(); | |
| 1933 assert(size > new_size, "Split from a smaller block?"); | |
| 1934 assert(is_aligned(chunk), "alignment problem"); | |
| 1935 assert(size == adjustObjectSize(size), "alignment problem"); | |
| 1936 size_t rem_size = size - new_size; | |
| 1937 assert(rem_size == adjustObjectSize(rem_size), "alignment problem"); | |
| 1938 assert(rem_size >= MinChunkSize, "Free chunk smaller than minimum"); | |
| 1939 FreeChunk* ffc = (FreeChunk*)((HeapWord*)chunk + new_size); | |
| 1940 assert(is_aligned(ffc), "alignment problem"); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1941 ffc->set_size(rem_size); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1942 ffc->link_next(NULL); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1943 ffc->link_prev(NULL); // Mark as a free block for other (parallel) GC threads. |
| 0 | 1944 // Above must occur before BOT is updated below. |
| 1945 // adjust block offset table | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
1946 OrderAccess::storestore(); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1947 assert(chunk->is_free() && ffc->is_free(), "Error"); |
| 0 | 1948 _bt.split_block((HeapWord*)chunk, chunk->size(), new_size); |
| 1949 if (rem_size < SmallForDictionary) { | |
| 1950 bool is_par = (SharedHeap::heap()->n_par_threads() > 0); | |
| 1951 if (is_par) _indexedFreeListParLocks[rem_size]->lock(); | |
|
4095
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
4068
diff
changeset
|
1952 assert(!is_par || |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
4068
diff
changeset
|
1953 (SharedHeap::heap()->n_par_threads() == |
|
bca17e38de00
6593758: RFE: Enhance GC ergonomics to dynamically choose ParallelGCThreads
jmasa
parents:
4068
diff
changeset
|
1954 SharedHeap::heap()->workers()->active_workers()), "Mismatch"); |
| 0 | 1955 returnChunkToFreeList(ffc); |
| 1956 split(size, rem_size); | |
| 1957 if (is_par) _indexedFreeListParLocks[rem_size]->unlock(); | |
| 1958 } else { | |
| 1959 returnChunkToDictionary(ffc); | |
| 1960 split(size ,rem_size); | |
| 1961 } | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
1962 chunk->set_size(new_size); |
| 0 | 1963 return chunk; |
| 1964 } | |
| 1965 | |
| 1966 void | |
| 1967 CompactibleFreeListSpace::sweep_completed() { | |
| 1968 // Now that space is probably plentiful, refill linear | |
| 1969 // allocation blocks as needed. | |
| 1970 refillLinearAllocBlocksIfNeeded(); | |
| 1971 } | |
| 1972 | |
| 1973 void | |
| 1974 CompactibleFreeListSpace::gc_prologue() { | |
| 1975 assert_locked(); | |
| 1976 if (PrintFLSStatistics != 0) { | |
| 1977 gclog_or_tty->print("Before GC:\n"); | |
| 1978 reportFreeListStatistics(); | |
| 1979 } | |
| 1980 refillLinearAllocBlocksIfNeeded(); | |
| 1981 } | |
| 1982 | |
| 1983 void | |
| 1984 CompactibleFreeListSpace::gc_epilogue() { | |
| 1985 assert_locked(); | |
| 1986 if (PrintGCDetails && Verbose && !_adaptive_freelists) { | |
| 1987 if (_smallLinearAllocBlock._word_size == 0) | |
| 1988 warning("CompactibleFreeListSpace(epilogue):: Linear allocation failure"); | |
| 1989 } | |
| 1990 assert(_promoInfo.noPromotions(), "_promoInfo inconsistency"); | |
| 1991 _promoInfo.stopTrackingPromotions(); | |
| 1992 repairLinearAllocationBlocks(); | |
| 1993 // Print Space's stats | |
| 1994 if (PrintFLSStatistics != 0) { | |
| 1995 gclog_or_tty->print("After GC:\n"); | |
| 1996 reportFreeListStatistics(); | |
| 1997 } | |
| 1998 } | |
| 1999 | |
| 2000 // Iteration support, mostly delegated from a CMS generation | |
| 2001 | |
| 2002 void CompactibleFreeListSpace::save_marks() { | |
|
3293
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
2003 assert(Thread::current()->is_VM_thread(), |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
2004 "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
|
2005 // Mark the "end" of the used space at the time of this call; |
| 0 | 2006 // note, however, that promoted objects from this point |
| 2007 // 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
|
2008 set_saved_mark_word(unallocated_block()); |
|
3293
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
2009 #ifdef ASSERT |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
2010 // Check the sanity of save_marks() etc. |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
2011 MemRegion ur = used_region(); |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
2012 MemRegion urasm = used_region_at_save_marks(); |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
2013 assert(ur.contains(urasm), |
|
1f4413413144
7039089: G1: changeset for 7037276 broke heap verification, and related cleanups
ysr
parents:
2426
diff
changeset
|
2014 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
|
2015 " should contain [" PTR_FORMAT "," PTR_FORMAT ")", |
|
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17805
diff
changeset
|
2016 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
|
2017 #endif |
| 0 | 2018 // inform allocator that promotions should be tracked. |
| 2019 assert(_promoInfo.noPromotions(), "_promoInfo inconsistency"); | |
| 2020 _promoInfo.startTrackingPromotions(); | |
| 2021 } | |
| 2022 | |
| 2023 bool CompactibleFreeListSpace::no_allocs_since_save_marks() { | |
| 2024 assert(_promoInfo.tracking(), "No preceding save_marks?"); | |
|
1777
179464550c7d
6983930: CMS: Various small cleanups ca September 2010
ysr
parents:
1716
diff
changeset
|
2025 assert(SharedHeap::heap()->n_par_threads() == 0, |
|
179464550c7d
6983930: CMS: Various small cleanups ca September 2010
ysr
parents:
1716
diff
changeset
|
2026 "Shouldn't be called if using parallel gc."); |
| 0 | 2027 return _promoInfo.noPromotions(); |
| 2028 } | |
| 2029 | |
| 2030 #define CFLS_OOP_SINCE_SAVE_MARKS_DEFN(OopClosureType, nv_suffix) \ | |
| 2031 \ | |
| 2032 void CompactibleFreeListSpace:: \ | |
| 2033 oop_since_save_marks_iterate##nv_suffix(OopClosureType* blk) { \ | |
| 2034 assert(SharedHeap::heap()->n_par_threads() == 0, \ | |
| 2035 "Shouldn't be called (yet) during parallel part of gc."); \ | |
| 2036 _promoInfo.promoted_oops_iterate##nv_suffix(blk); \ | |
| 2037 /* \ | |
| 2038 * This also restores any displaced headers and removes the elements from \ | |
| 2039 * the iteration set as they are processed, so that we have a clean slate \ | |
| 2040 * at the end of the iteration. Note, thus, that if new objects are \ | |
| 2041 * promoted as a result of the iteration they are iterated over as well. \ | |
| 2042 */ \ | |
| 2043 assert(_promoInfo.noPromotions(), "_promoInfo inconsistency"); \ | |
| 2044 } | |
| 2045 | |
| 2046 ALL_SINCE_SAVE_MARKS_CLOSURES(CFLS_OOP_SINCE_SAVE_MARKS_DEFN) | |
| 2047 | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2048 bool CompactibleFreeListSpace::linearAllocationWouldFail() const { |
| 0 | 2049 return _smallLinearAllocBlock._word_size == 0; |
| 2050 } | |
| 2051 | |
| 2052 void CompactibleFreeListSpace::repairLinearAllocationBlocks() { | |
| 2053 // Fix up linear allocation blocks to look like free blocks | |
| 2054 repairLinearAllocBlock(&_smallLinearAllocBlock); | |
| 2055 } | |
| 2056 | |
| 2057 void CompactibleFreeListSpace::repairLinearAllocBlock(LinearAllocBlock* blk) { | |
| 2058 assert_locked(); | |
| 2059 if (blk->_ptr != NULL) { | |
| 2060 assert(blk->_word_size != 0 && blk->_word_size >= MinChunkSize, | |
| 2061 "Minimum block size requirement"); | |
| 2062 FreeChunk* fc = (FreeChunk*)(blk->_ptr); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2063 fc->set_size(blk->_word_size); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2064 fc->link_prev(NULL); // mark as free |
| 0 | 2065 fc->dontCoalesce(); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2066 assert(fc->is_free(), "just marked it free"); |
| 0 | 2067 assert(fc->cantCoalesce(), "just marked it uncoalescable"); |
| 2068 } | |
| 2069 } | |
| 2070 | |
| 2071 void CompactibleFreeListSpace::refillLinearAllocBlocksIfNeeded() { | |
| 2072 assert_locked(); | |
| 2073 if (_smallLinearAllocBlock._ptr == NULL) { | |
| 2074 assert(_smallLinearAllocBlock._word_size == 0, | |
| 2075 "Size of linAB should be zero if the ptr is NULL"); | |
| 2076 // Reset the linAB refill and allocation size limit. | |
| 2077 _smallLinearAllocBlock.set(0, 0, 1024*SmallForLinearAlloc, SmallForLinearAlloc); | |
| 2078 } | |
| 2079 refillLinearAllocBlockIfNeeded(&_smallLinearAllocBlock); | |
| 2080 } | |
| 2081 | |
| 2082 void | |
| 2083 CompactibleFreeListSpace::refillLinearAllocBlockIfNeeded(LinearAllocBlock* blk) { | |
| 2084 assert_locked(); | |
| 2085 assert((blk->_ptr == NULL && blk->_word_size == 0) || | |
| 2086 (blk->_ptr != NULL && blk->_word_size >= MinChunkSize), | |
| 2087 "blk invariant"); | |
| 2088 if (blk->_ptr == NULL) { | |
| 2089 refillLinearAllocBlock(blk); | |
| 2090 } | |
| 2091 if (PrintMiscellaneous && Verbose) { | |
| 2092 if (blk->_word_size == 0) { | |
| 2093 warning("CompactibleFreeListSpace(prologue):: Linear allocation failure"); | |
| 2094 } | |
| 2095 } | |
| 2096 } | |
| 2097 | |
| 2098 void | |
| 2099 CompactibleFreeListSpace::refillLinearAllocBlock(LinearAllocBlock* blk) { | |
| 2100 assert_locked(); | |
| 2101 assert(blk->_word_size == 0 && blk->_ptr == NULL, | |
| 2102 "linear allocation block should be empty"); | |
| 2103 FreeChunk* fc; | |
| 2104 if (blk->_refillSize < SmallForDictionary && | |
| 2105 (fc = getChunkFromIndexedFreeList(blk->_refillSize)) != NULL) { | |
| 2106 // A linAB's strategy might be to use small sizes to reduce | |
| 2107 // fragmentation but still get the benefits of allocation from a | |
| 2108 // linAB. | |
| 2109 } else { | |
| 2110 fc = getChunkFromDictionary(blk->_refillSize); | |
| 2111 } | |
| 2112 if (fc != NULL) { | |
| 2113 blk->_ptr = (HeapWord*)fc; | |
| 2114 blk->_word_size = fc->size(); | |
| 2115 fc->dontCoalesce(); // to prevent sweeper from sweeping us up | |
| 2116 } | |
| 2117 } | |
| 2118 | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2119 // Support for concurrent collection policy decisions. |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2120 bool CompactibleFreeListSpace::should_concurrent_collect() const { |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2121 // In the future we might want to add in frgamentation stats -- |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2122 // including erosion of the "mountain" into this decision as well. |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2123 return !adaptive_freelists() && linearAllocationWouldFail(); |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2124 } |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2125 |
| 0 | 2126 // Support for compaction |
| 2127 | |
| 2128 void CompactibleFreeListSpace::prepare_for_compaction(CompactPoint* cp) { | |
| 2129 SCAN_AND_FORWARD(cp,end,block_is_obj,block_size); | |
| 2130 // prepare_for_compaction() uses the space between live objects | |
| 2131 // so that later phase can skip dead space quickly. So verification | |
| 2132 // of the free lists doesn't work after. | |
| 2133 } | |
| 2134 | |
| 2135 #define obj_size(q) adjustObjectSize(oop(q)->size()) | |
| 2136 #define adjust_obj_size(s) adjustObjectSize(s) | |
| 2137 | |
| 2138 void CompactibleFreeListSpace::adjust_pointers() { | |
| 2139 // In other versions of adjust_pointers(), a bail out | |
| 2140 // based on the amount of live data in the generation | |
| 2141 // (i.e., if 0, bail out) may be used. | |
| 2142 // Cannot test used() == 0 here because the free lists have already | |
| 2143 // been mangled by the compaction. | |
| 2144 | |
| 2145 SCAN_AND_ADJUST_POINTERS(adjust_obj_size); | |
| 2146 // See note about verification in prepare_for_compaction(). | |
| 2147 } | |
| 2148 | |
| 2149 void CompactibleFreeListSpace::compact() { | |
| 2150 SCAN_AND_COMPACT(obj_size); | |
| 2151 } | |
| 2152 | |
| 2153 // fragmentation_metric = 1 - [sum of (fbs**2) / (sum of fbs)**2] | |
| 2154 // where fbs is free block sizes | |
| 2155 double CompactibleFreeListSpace::flsFrag() const { | |
| 2156 size_t itabFree = totalSizeInIndexedFreeLists(); | |
| 2157 double frag = 0.0; | |
| 2158 size_t i; | |
| 2159 | |
| 2160 for (i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { | |
| 2161 double sz = i; | |
| 2162 frag += _indexedFreeList[i].count() * (sz * sz); | |
| 2163 } | |
| 2164 | |
| 2165 double totFree = itabFree + | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2166 _dictionary->total_chunk_size(DEBUG_ONLY(freelistLock())); |
| 0 | 2167 if (totFree > 0) { |
| 2168 frag = ((frag + _dictionary->sum_of_squared_block_sizes()) / | |
| 2169 (totFree * totFree)); | |
| 2170 frag = (double)1.0 - frag; | |
| 2171 } else { | |
| 2172 assert(frag == 0.0, "Follows from totFree == 0"); | |
| 2173 } | |
| 2174 return frag; | |
| 2175 } | |
| 2176 | |
| 2177 void CompactibleFreeListSpace::beginSweepFLCensus( | |
| 2178 float inter_sweep_current, | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2179 float inter_sweep_estimate, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2180 float intra_sweep_estimate) { |
| 0 | 2181 assert_locked(); |
| 2182 size_t i; | |
| 2183 for (i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { | |
| 6885 | 2184 AdaptiveFreeList<FreeChunk>* fl = &_indexedFreeList[i]; |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2185 if (PrintFLSStatistics > 1) { |
|
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17805
diff
changeset
|
2186 gclog_or_tty->print("size[" SIZE_FORMAT "] : ", i); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2187 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2188 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
|
2189 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
|
2190 fl->set_before_sweep(fl->count()); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2191 fl->set_bfr_surp(fl->surplus()); |
| 0 | 2192 } |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2193 _dictionary->begin_sweep_dict_census(CMSLargeCoalSurplusPercent, |
| 0 | 2194 inter_sweep_current, |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2195 inter_sweep_estimate, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2196 intra_sweep_estimate); |
| 0 | 2197 } |
| 2198 | |
| 2199 void CompactibleFreeListSpace::setFLSurplus() { | |
| 2200 assert_locked(); | |
| 2201 size_t i; | |
| 2202 for (i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { | |
| 6885 | 2203 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[i]; |
| 0 | 2204 fl->set_surplus(fl->count() - |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2205 (ssize_t)((double)fl->desired() * CMSSmallSplitSurplusPercent)); |
| 0 | 2206 } |
| 2207 } | |
| 2208 | |
| 2209 void CompactibleFreeListSpace::setFLHints() { | |
| 2210 assert_locked(); | |
| 2211 size_t i; | |
| 2212 size_t h = IndexSetSize; | |
| 2213 for (i = IndexSetSize - 1; i != 0; i -= IndexSetStride) { | |
| 6885 | 2214 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[i]; |
| 0 | 2215 fl->set_hint(h); |
| 2216 if (fl->surplus() > 0) { | |
| 2217 h = i; | |
| 2218 } | |
| 2219 } | |
| 2220 } | |
| 2221 | |
| 2222 void CompactibleFreeListSpace::clearFLCensus() { | |
| 2223 assert_locked(); | |
|
4068
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
2224 size_t i; |
| 0 | 2225 for (i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { |
| 6885 | 2226 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[i]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2227 fl->set_prev_sweep(fl->count()); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2228 fl->set_coal_births(0); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2229 fl->set_coal_deaths(0); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2230 fl->set_split_births(0); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2231 fl->set_split_deaths(0); |
| 0 | 2232 } |
| 2233 } | |
| 2234 | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2235 void CompactibleFreeListSpace::endSweepFLCensus(size_t sweep_count) { |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2236 if (PrintFLSStatistics > 0) { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2237 HeapWord* largestAddr = (HeapWord*) dictionary()->find_largest_dict(); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2238 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
|
2239 p2i(largestAddr)); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2240 } |
| 0 | 2241 setFLSurplus(); |
| 2242 setFLHints(); | |
| 2243 if (PrintGC && PrintFLSCensus > 0) { | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2244 printFLCensus(sweep_count); |
| 0 | 2245 } |
| 2246 clearFLCensus(); | |
| 2247 assert_locked(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2248 _dictionary->end_sweep_dict_census(CMSLargeSplitSurplusPercent); |
| 0 | 2249 } |
| 2250 | |
| 2251 bool CompactibleFreeListSpace::coalOverPopulated(size_t size) { | |
| 2252 if (size < SmallForDictionary) { | |
| 6885 | 2253 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[size]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2254 return (fl->coal_desired() < 0) || |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2255 ((int)fl->count() > fl->coal_desired()); |
| 0 | 2256 } else { |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2257 return dictionary()->coal_dict_over_populated(size); |
| 0 | 2258 } |
| 2259 } | |
| 2260 | |
| 2261 void CompactibleFreeListSpace::smallCoalBirth(size_t size) { | |
| 2262 assert(size < SmallForDictionary, "Size too large for indexed list"); | |
| 6885 | 2263 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[size]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2264 fl->increment_coal_births(); |
| 0 | 2265 fl->increment_surplus(); |
| 2266 } | |
| 2267 | |
| 2268 void CompactibleFreeListSpace::smallCoalDeath(size_t size) { | |
| 2269 assert(size < SmallForDictionary, "Size too large for indexed list"); | |
| 6885 | 2270 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[size]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2271 fl->increment_coal_deaths(); |
| 0 | 2272 fl->decrement_surplus(); |
| 2273 } | |
| 2274 | |
| 2275 void CompactibleFreeListSpace::coalBirth(size_t size) { | |
| 2276 if (size < SmallForDictionary) { | |
| 2277 smallCoalBirth(size); | |
| 2278 } else { | |
| 6885 | 2279 dictionary()->dict_census_update(size, |
| 0 | 2280 false /* split */, |
| 2281 true /* birth */); | |
| 2282 } | |
| 2283 } | |
| 2284 | |
| 2285 void CompactibleFreeListSpace::coalDeath(size_t size) { | |
| 2286 if(size < SmallForDictionary) { | |
| 2287 smallCoalDeath(size); | |
| 2288 } else { | |
| 6885 | 2289 dictionary()->dict_census_update(size, |
| 0 | 2290 false /* split */, |
| 2291 false /* birth */); | |
| 2292 } | |
| 2293 } | |
| 2294 | |
| 2295 void CompactibleFreeListSpace::smallSplitBirth(size_t size) { | |
| 2296 assert(size < SmallForDictionary, "Size too large for indexed list"); | |
| 6885 | 2297 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[size]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2298 fl->increment_split_births(); |
| 0 | 2299 fl->increment_surplus(); |
| 2300 } | |
| 2301 | |
| 2302 void CompactibleFreeListSpace::smallSplitDeath(size_t size) { | |
| 2303 assert(size < SmallForDictionary, "Size too large for indexed list"); | |
| 6885 | 2304 AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[size]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2305 fl->increment_split_deaths(); |
| 0 | 2306 fl->decrement_surplus(); |
| 2307 } | |
| 2308 | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2309 void CompactibleFreeListSpace::split_birth(size_t size) { |
| 0 | 2310 if (size < SmallForDictionary) { |
| 2311 smallSplitBirth(size); | |
| 2312 } else { | |
| 6885 | 2313 dictionary()->dict_census_update(size, |
| 0 | 2314 true /* split */, |
| 2315 true /* birth */); | |
| 2316 } | |
| 2317 } | |
| 2318 | |
| 2319 void CompactibleFreeListSpace::splitDeath(size_t size) { | |
| 2320 if (size < SmallForDictionary) { | |
| 2321 smallSplitDeath(size); | |
| 2322 } else { | |
| 6885 | 2323 dictionary()->dict_census_update(size, |
| 0 | 2324 true /* split */, |
| 2325 false /* birth */); | |
| 2326 } | |
| 2327 } | |
| 2328 | |
| 2329 void CompactibleFreeListSpace::split(size_t from, size_t to1) { | |
| 2330 size_t to2 = from - to1; | |
| 2331 splitDeath(from); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2332 split_birth(to1); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2333 split_birth(to2); |
| 0 | 2334 } |
| 2335 | |
| 2336 void CompactibleFreeListSpace::print() const { | |
|
1952
4df7f8cba524
6996613: CompactibleFreeListSpace::print should call CompactibleFreeListSpace::print_on, not Space::print_on
ysr
parents:
1951
diff
changeset
|
2337 print_on(tty); |
| 0 | 2338 } |
| 2339 | |
| 2340 void CompactibleFreeListSpace::prepare_for_verify() { | |
| 2341 assert_locked(); | |
| 2342 repairLinearAllocationBlocks(); | |
| 2343 // Verify that the SpoolBlocks look like free blocks of | |
| 2344 // appropriate sizes... To be done ... | |
| 2345 } | |
| 2346 | |
| 2347 class VerifyAllBlksClosure: public BlkClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2348 private: |
| 0 | 2349 const CompactibleFreeListSpace* _sp; |
| 2350 const MemRegion _span; | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2351 HeapWord* _last_addr; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2352 size_t _last_size; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2353 bool _last_was_obj; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2354 bool _last_was_live; |
| 0 | 2355 |
| 2356 public: | |
| 2357 VerifyAllBlksClosure(const CompactibleFreeListSpace* sp, | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2358 MemRegion span) : _sp(sp), _span(span), |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2359 _last_addr(NULL), _last_size(0), |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2360 _last_was_obj(false), _last_was_live(false) { } |
| 0 | 2361 |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2362 virtual size_t do_blk(HeapWord* addr) { |
| 0 | 2363 size_t res; |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2364 bool was_obj = false; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2365 bool was_live = false; |
| 0 | 2366 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
|
2367 was_obj = true; |
| 0 | 2368 oop p = oop(addr); |
| 2369 guarantee(p->is_oop(), "Should be an oop"); | |
| 2370 res = _sp->adjustObjectSize(p->size()); | |
| 2371 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
|
2372 was_live = true; |
| 0 | 2373 p->verify(); |
| 2374 } | |
| 2375 } else { | |
| 2376 FreeChunk* fc = (FreeChunk*)addr; | |
| 2377 res = fc->size(); | |
| 2378 if (FLSVerifyLists && !fc->cantCoalesce()) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2379 guarantee(_sp->verify_chunk_in_free_list(fc), |
| 0 | 2380 "Chunk should be on a free list"); |
| 2381 } | |
| 2382 } | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2383 if (res == 0) { |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2384 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
|
2385 gclog_or_tty->print_cr( |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2386 " 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
|
2387 " 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
|
2388 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
|
2389 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
|
2390 _sp->print_on(gclog_or_tty); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2391 guarantee(false, "Seppuku!"); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2392 } |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2393 _last_addr = addr; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2394 _last_size = res; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2395 _last_was_obj = was_obj; |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2396 _last_was_live = was_live; |
| 0 | 2397 return res; |
| 2398 } | |
| 2399 }; | |
| 2400 | |
| 2401 class VerifyAllOopsClosure: public OopClosure { | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2402 private: |
| 0 | 2403 const CMSCollector* _collector; |
| 2404 const CompactibleFreeListSpace* _sp; | |
| 2405 const MemRegion _span; | |
| 2406 const bool _past_remark; | |
| 2407 const CMSBitMap* _bit_map; | |
| 2408 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2409 protected: |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2410 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
|
2411 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
|
2412 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
|
2413 // 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
|
2414 // 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
|
2415 // 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
|
2416 // 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
|
2417 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
|
2418 _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
|
2419 "Should be an object"); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2420 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
|
2421 obj->verify(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2422 if (_past_remark) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2423 // 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
|
2424 _bit_map->isMarked((HeapWord*)obj); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2425 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2426 } else { // reference within CMS heap |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2427 if (_past_remark) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2428 // 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
|
2429 // 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
|
2430 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
|
2431 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
|
2432 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2433 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2434 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2435 } 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
|
2436 // 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
|
2437 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
|
2438 obj->verify(); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2439 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2440 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2441 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2442 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
|
2443 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
|
2444 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
|
2445 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
|
2446 do_oop(p, obj); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2447 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2448 } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2449 |
| 0 | 2450 public: |
| 2451 VerifyAllOopsClosure(const CMSCollector* collector, | |
| 2452 const CompactibleFreeListSpace* sp, MemRegion span, | |
| 2453 bool past_remark, CMSBitMap* bit_map) : | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
2454 _collector(collector), _sp(sp), _span(span), |
| 0 | 2455 _past_remark(past_remark), _bit_map(bit_map) { } |
| 2456 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
2457 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
|
2458 virtual void do_oop(narrowOop* p) { VerifyAllOopsClosure::do_oop_work(p); } |
| 0 | 2459 }; |
| 2460 | |
| 6008 | 2461 void CompactibleFreeListSpace::verify() const { |
| 0 | 2462 assert_lock_strong(&_freelistLock); |
| 2463 verify_objects_initialized(); | |
| 2464 MemRegion span = _collector->_span; | |
| 2465 bool past_remark = (_collector->abstract_state() == | |
| 2466 CMSCollector::Sweeping); | |
| 2467 | |
| 2468 ResourceMark rm; | |
| 2469 HandleMark hm; | |
| 2470 | |
| 2471 // Check integrity of CFL data structures | |
| 2472 _promoInfo.verify(); | |
| 2473 _dictionary->verify(); | |
| 2474 if (FLSVerifyIndexTable) { | |
| 2475 verifyIndexedFreeLists(); | |
| 2476 } | |
| 2477 // Check integrity of all objects and free blocks in space | |
| 2478 { | |
| 2479 VerifyAllBlksClosure cl(this, span); | |
| 2480 ((CompactibleFreeListSpace*)this)->blk_iterate(&cl); // cast off const | |
| 2481 } | |
| 2482 // Check that all references in the heap to FLS | |
| 2483 // are to valid objects in FLS or that references in | |
| 2484 // FLS are to valid objects elsewhere in the heap | |
| 2485 if (FLSVerifyAllHeapReferences) | |
| 2486 { | |
| 2487 VerifyAllOopsClosure cl(_collector, this, span, past_remark, | |
| 2488 _collector->markBitMap()); | |
| 2489 CollectedHeap* ch = Universe::heap(); | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
2490 |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6104
diff
changeset
|
2491 // 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
|
2492 // 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
|
2493 ch->oop_iterate_no_header(&cl); |
| 0 | 2494 } |
| 2495 | |
| 2496 if (VerifyObjectStartArray) { | |
| 2497 // Verify the block offset table | |
| 2498 _bt.verify(); | |
| 2499 } | |
| 2500 } | |
| 2501 | |
| 2502 #ifndef PRODUCT | |
| 2503 void CompactibleFreeListSpace::verifyFreeLists() const { | |
| 2504 if (FLSVerifyLists) { | |
| 2505 _dictionary->verify(); | |
| 2506 verifyIndexedFreeLists(); | |
| 2507 } else { | |
| 2508 if (FLSVerifyDictionary) { | |
| 2509 _dictionary->verify(); | |
| 2510 } | |
| 2511 if (FLSVerifyIndexTable) { | |
| 2512 verifyIndexedFreeLists(); | |
| 2513 } | |
| 2514 } | |
| 2515 } | |
| 2516 #endif | |
| 2517 | |
| 2518 void CompactibleFreeListSpace::verifyIndexedFreeLists() const { | |
| 2519 size_t i = 0; | |
|
4068
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
2520 for (; i < IndexSetStart; i++) { |
| 0 | 2521 guarantee(_indexedFreeList[i].head() == NULL, "should be NULL"); |
| 2522 } | |
| 2523 for (; i < IndexSetSize; i++) { | |
| 2524 verifyIndexedFreeList(i); | |
| 2525 } | |
| 2526 } | |
| 2527 | |
| 2528 void CompactibleFreeListSpace::verifyIndexedFreeList(size_t size) const { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2529 FreeChunk* fc = _indexedFreeList[size].head(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2530 FreeChunk* tail = _indexedFreeList[size].tail(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2531 size_t num = _indexedFreeList[size].count(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2532 size_t n = 0; |
|
4068
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
2533 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
|
2534 "Slot should have been empty"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2535 for (; fc != NULL; fc = fc->next(), n++) { |
| 0 | 2536 guarantee(fc->size() == size, "Size inconsistency"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2537 guarantee(fc->is_free(), "!free?"); |
| 0 | 2538 guarantee(fc->next() == NULL || fc->next()->prev() == fc, "Broken list"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2539 guarantee((fc->next() == NULL) == (fc == tail), "Incorrect tail"); |
| 0 | 2540 } |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2541 guarantee(n == num, "Incorrect count"); |
| 0 | 2542 } |
| 2543 | |
| 2544 #ifndef PRODUCT | |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2545 void CompactibleFreeListSpace::check_free_list_consistency() const { |
|
17695
ab36007d6358
8034171: Remove use of template template parameters from binaryTreeDictionary.
goetz
parents:
11096
diff
changeset
|
2546 assert((TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >::min_size() <= IndexSetSize), |
| 0 | 2547 "Some sizes can't be allocated without recourse to" |
| 2548 " linear allocation buffers"); | |
|
17695
ab36007d6358
8034171: Remove use of template template parameters from binaryTreeDictionary.
goetz
parents:
11096
diff
changeset
|
2549 assert((TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >::min_size()*HeapWordSize == sizeof(TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >)), |
| 0 | 2550 "else MIN_TREE_CHUNK_SIZE is wrong"); |
|
6104
c92a79900986
7169062: CMS: Assertion failed with -XX:+ObjectAlignmentInBytes=64
brutisso
parents:
6028
diff
changeset
|
2551 assert(IndexSetStart != 0, "IndexSetStart not initialized"); |
|
c92a79900986
7169062: CMS: Assertion failed with -XX:+ObjectAlignmentInBytes=64
brutisso
parents:
6028
diff
changeset
|
2552 assert(IndexSetStride != 0, "IndexSetStride not initialized"); |
| 0 | 2553 } |
| 2554 #endif | |
| 2555 | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2556 void CompactibleFreeListSpace::printFLCensus(size_t sweep_count) const { |
| 0 | 2557 assert_lock_strong(&_freelistLock); |
| 6885 | 2558 AdaptiveFreeList<FreeChunk> total; |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2559 gclog_or_tty->print("end sweep# " SIZE_FORMAT "\n", sweep_count); |
| 6885 | 2560 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
|
2561 size_t total_free = 0; |
| 0 | 2562 for (size_t i = IndexSetStart; i < IndexSetSize; i += IndexSetStride) { |
| 6885 | 2563 const AdaptiveFreeList<FreeChunk> *fl = &_indexedFreeList[i]; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2564 total_free += fl->count() * fl->size(); |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2565 if (i % (40*IndexSetStride) == 0) { |
| 6885 | 2566 AdaptiveFreeList<FreeChunk>::print_labels_on(gclog_or_tty, "size"); |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2567 } |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2568 fl->print_on(gclog_or_tty); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2569 total.set_bfr_surp( total.bfr_surp() + fl->bfr_surp() ); |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2570 total.set_surplus( total.surplus() + fl->surplus() ); |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2571 total.set_desired( total.desired() + fl->desired() ); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2572 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
|
2573 total.set_before_sweep(total.before_sweep() + fl->before_sweep()); |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2574 total.set_count( total.count() + fl->count() ); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2575 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
|
2576 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
|
2577 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
|
2578 total.set_split_deaths(total.split_deaths() + fl->split_deaths()); |
| 0 | 2579 } |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2580 total.print_on(gclog_or_tty, "TOTAL"); |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2581 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
|
2582 SIZE_FORMAT " words", total_free); |
| 0 | 2583 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
|
2584 (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
|
2585 (total.prev_sweep() != 0 ? (double)total.prev_sweep() : 1.0), |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
2586 (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
|
2587 _dictionary->print_dict_census(); |
| 0 | 2588 } |
| 2589 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2590 /////////////////////////////////////////////////////////////////////////// |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2591 // CFLS_LAB |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2592 /////////////////////////////////////////////////////////////////////////// |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2593 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2594 #define VECTOR_257(x) \ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2595 /* 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
|
2596 { 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
|
2597 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
|
2598 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
|
2599 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
|
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 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2605 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2606 // Initialize with default setting of CMSParPromoteBlocksToClaim, _not_ |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2607 // OldPLABSize, whose static default is different; if overridden at the |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2608 // command-line, this will get reinitialized via a call to |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2609 // modify_initialization() below. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2610 AdaptiveWeightedAverage CFLS_LAB::_blocks_to_claim[] = |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2611 VECTOR_257(AdaptiveWeightedAverage(OldPLABWeight, (float)CMSParPromoteBlocksToClaim)); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2612 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
|
2613 uint CFLS_LAB::_global_num_workers[] = VECTOR_257(0); |
| 0 | 2614 |
| 2615 CFLS_LAB::CFLS_LAB(CompactibleFreeListSpace* cfls) : | |
| 2616 _cfls(cfls) | |
| 2617 { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2618 assert(CompactibleFreeListSpace::IndexSetSize == 257, "Modify VECTOR_257() macro above"); |
| 0 | 2619 for (size_t i = CompactibleFreeListSpace::IndexSetStart; |
| 2620 i < CompactibleFreeListSpace::IndexSetSize; | |
| 2621 i += CompactibleFreeListSpace::IndexSetStride) { | |
| 2622 _indexedFreeList[i].set_size(i); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2623 _num_blocks[i] = 0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2624 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2625 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2626 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2627 static bool _CFLS_LAB_modified = false; |
|
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 void CFLS_LAB::modify_initialization(size_t n, unsigned wt) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2630 assert(!_CFLS_LAB_modified, "Call only once"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2631 _CFLS_LAB_modified = true; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2632 for (size_t i = CompactibleFreeListSpace::IndexSetStart; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2633 i < CompactibleFreeListSpace::IndexSetSize; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2634 i += CompactibleFreeListSpace::IndexSetStride) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2635 _blocks_to_claim[i].modify(n, wt, true /* force */); |
| 0 | 2636 } |
| 2637 } | |
| 2638 | |
| 2639 HeapWord* CFLS_LAB::alloc(size_t word_sz) { | |
| 2640 FreeChunk* res; | |
|
1777
179464550c7d
6983930: CMS: Various small cleanups ca September 2010
ysr
parents:
1716
diff
changeset
|
2641 assert(word_sz == _cfls->adjustObjectSize(word_sz), "Error"); |
| 0 | 2642 if (word_sz >= CompactibleFreeListSpace::IndexSetSize) { |
| 2643 // This locking manages sync with other large object allocations. | |
| 2644 MutexLockerEx x(_cfls->parDictionaryAllocLock(), | |
| 2645 Mutex::_no_safepoint_check_flag); | |
| 2646 res = _cfls->getChunkFromDictionaryExact(word_sz); | |
| 2647 if (res == NULL) return NULL; | |
| 2648 } else { | |
| 6885 | 2649 AdaptiveFreeList<FreeChunk>* fl = &_indexedFreeList[word_sz]; |
| 0 | 2650 if (fl->count() == 0) { |
| 2651 // Attempt to refill this local free list. | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2652 get_from_global_pool(word_sz, fl); |
| 0 | 2653 // If it didn't work, give up. |
| 2654 if (fl->count() == 0) return NULL; | |
| 2655 } | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2656 res = fl->get_chunk_at_head(); |
| 0 | 2657 assert(res != NULL, "Why was count non-zero?"); |
| 2658 } | |
| 2659 res->markNotFree(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2660 assert(!res->is_free(), "shouldn't be marked free"); |
| 187 | 2661 assert(oop(res)->klass_or_null() == NULL, "should look uninitialized"); |
| 0 | 2662 // mangle a just allocated object with a distinct pattern. |
| 2663 debug_only(res->mangleAllocated(word_sz)); | |
| 2664 return (HeapWord*)res; | |
| 2665 } | |
| 2666 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2667 // 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
|
2668 // book-keeping stats |
| 6885 | 2669 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
|
2670 // Get the #blocks we want to claim |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2671 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
|
2672 assert(n_blks > 0, "Error"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2673 assert(ResizePLAB || n_blks == OldPLABSize, "Error"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2674 // In some cases, when the application has a phase change, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2675 // 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
|
2676 // profile, and updating the counts at the end of a scavenge |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2677 // may not be quick enough, giving rise to large scavenge pauses |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2678 // during these phase changes. It is beneficial to detect such |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2679 // 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
|
2680 // pothole. The following code is a heuristic attempt to do that. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2681 // It is protected by a product flag until we have gained |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2682 // enough experience with this heuristic and fine-tuned its behaviour. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2683 // WARNING: This might increase fragmentation if we overreact to |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2684 // small spikes, so some kind of historical smoothing based on |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2685 // previous experience with the greater reactivity might be useful. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2686 // Lacking sufficient experience, CMSOldPLABResizeQuicker is disabled by |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2687 // default. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2688 if (ResizeOldPLAB && CMSOldPLABResizeQuicker) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2689 size_t multiple = _num_blocks[word_sz]/(CMSOldPLABToleranceFactor*CMSOldPLABNumRefills*n_blks); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2690 n_blks += CMSOldPLABReactivityFactor*multiple*n_blks; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2691 n_blks = MIN2(n_blks, CMSOldPLABMax); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2692 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2693 assert(n_blks > 0, "Error"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2694 _cfls->par_get_chunk_of_blocks(word_sz, n_blks, fl); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2695 // Update stats table entry for this block size |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2696 _num_blocks[word_sz] += fl->count(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2697 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2698 |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2699 void CFLS_LAB::compute_desired_plab_size() { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2700 for (size_t i = CompactibleFreeListSpace::IndexSetStart; |
| 0 | 2701 i < CompactibleFreeListSpace::IndexSetSize; |
| 2702 i += CompactibleFreeListSpace::IndexSetStride) { | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2703 assert((_global_num_workers[i] == 0) == (_global_num_blocks[i] == 0), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2704 "Counter inconsistency"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2705 if (_global_num_workers[i] > 0) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2706 // Need to smooth wrt historical average |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2707 if (ResizeOldPLAB) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2708 _blocks_to_claim[i].sample( |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2709 MAX2((size_t)CMSOldPLABMin, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2710 MIN2((size_t)CMSOldPLABMax, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2711 _global_num_blocks[i]/(_global_num_workers[i]*CMSOldPLABNumRefills)))); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2712 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2713 // Reset counters for next round |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2714 _global_num_workers[i] = 0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2715 _global_num_blocks[i] = 0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2716 if (PrintOldPLAB) { |
|
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17805
diff
changeset
|
2717 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
|
2718 } |
| 0 | 2719 } |
| 2720 } | |
| 2721 } | |
| 2722 | |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2723 // 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
|
2724 // 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
|
2725 // 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
|
2726 // parallel threads to reduce contention. |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2727 void CFLS_LAB::retire(int tid) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2728 // We run this single threaded with the world stopped; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2729 // so no need for locks and such. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2730 NOT_PRODUCT(Thread* t = Thread::current();) |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2731 assert(Thread::current()->is_VM_thread(), "Error"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2732 for (size_t i = CompactibleFreeListSpace::IndexSetStart; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2733 i < CompactibleFreeListSpace::IndexSetSize; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2734 i += CompactibleFreeListSpace::IndexSetStride) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2735 assert(_num_blocks[i] >= (size_t)_indexedFreeList[i].count(), |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2736 "Can't retire more than what we obtained"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2737 if (_num_blocks[i] > 0) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2738 size_t num_retire = _indexedFreeList[i].count(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2739 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
|
2740 { |
|
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3761
diff
changeset
|
2741 // 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
|
2742 // 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
|
2743 |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2744 // Update globals stats for num_blocks used |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2745 _global_num_blocks[i] += (_num_blocks[i] - num_retire); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2746 _global_num_workers[i]++; |
|
4728
441e946dc1af
7121618: Change type of number of GC workers to unsigned int.
jmasa
parents:
4095
diff
changeset
|
2747 assert(_global_num_workers[i] <= ParallelGCThreads, "Too big"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2748 if (num_retire > 0) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2749 _cfls->_indexedFreeList[i].prepend(&_indexedFreeList[i]); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2750 // Reset this list. |
| 6885 | 2751 _indexedFreeList[i] = AdaptiveFreeList<FreeChunk>(); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2752 _indexedFreeList[i].set_size(i); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2753 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2754 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2755 if (PrintOldPLAB) { |
|
17937
78bbf4d43a14
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
17805
diff
changeset
|
2756 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
|
2757 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
|
2758 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2759 // Reset stats for next round |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2760 _num_blocks[i] = 0; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2761 } |
|
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 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2764 |
| 6885 | 2765 void CompactibleFreeListSpace:: par_get_chunk_of_blocks(size_t word_sz, size_t n, AdaptiveFreeList<FreeChunk>* fl) { |
| 0 | 2766 assert(fl->count() == 0, "Precondition."); |
| 2767 assert(word_sz < CompactibleFreeListSpace::IndexSetSize, | |
| 2768 "Precondition"); | |
| 2769 | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2770 // 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
|
2771 // word_sz itself and, if CMSSplitIndexedFreeListBlocks, try larger multiples, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2772 // then try getting a big chunk and splitting it. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2773 { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2774 bool found; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2775 int k; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2776 size_t cur_sz; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2777 for (k = 1, cur_sz = k * word_sz, found = false; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2778 (cur_sz < CompactibleFreeListSpace::IndexSetSize) && |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2779 (CMSSplitIndexedFreeListBlocks || k <= 1); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2780 k++, cur_sz = k * word_sz) { |
| 6885 | 2781 AdaptiveFreeList<FreeChunk> fl_for_cur_sz; // Empty. |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2782 fl_for_cur_sz.set_size(cur_sz); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2783 { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2784 MutexLockerEx x(_indexedFreeListParLocks[cur_sz], |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2785 Mutex::_no_safepoint_check_flag); |
| 6885 | 2786 AdaptiveFreeList<FreeChunk>* gfl = &_indexedFreeList[cur_sz]; |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2787 if (gfl->count() != 0) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2788 // nn is the number of chunks of size cur_sz that |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2789 // 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
|
2790 // "n" chunks of size word_sz each. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2791 const size_t nn = MAX2(n/k, (size_t)1); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2792 gfl->getFirstNChunksFromList(nn, &fl_for_cur_sz); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2793 found = true; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2794 if (k > 1) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2795 // Update split death stats for the cur_sz-size blocks list: |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2796 // we increment the split death count by the number of blocks |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2797 // 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
|
2798 // we will be splitting below. |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2799 ssize_t deaths = gfl->split_deaths() + |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2800 fl_for_cur_sz.count(); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2801 gfl->set_split_deaths(deaths); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2802 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2803 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2804 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2805 // 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
|
2806 if (found) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2807 if (k == 1) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2808 fl->prepend(&fl_for_cur_sz); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2809 } else { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2810 // Divide each block on fl_for_cur_sz up k ways. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2811 FreeChunk* fc; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2812 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
|
2813 // Must do this in reverse order, so that anybody attempting to |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2814 // 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
|
2815 // change it. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2816 size_t fc_size = fc->size(); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2817 assert(fc->is_free(), "Error"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2818 for (int i = k-1; i >= 0; i--) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2819 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
|
2820 assert((i != 0) || |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2821 ((fc == ffc) && ffc->is_free() && |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2822 (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
|
2823 "Counting error"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2824 ffc->set_size(word_sz); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2825 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
|
2826 ffc->link_next(NULL); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2827 // 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
|
2828 OrderAccess::storestore(); |
|
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2829 // 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
|
2830 _bt.mark_block((HeapWord*)ffc, word_sz, true /* reducing */); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2831 fc_size -= word_sz; |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2832 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
|
2833 _bt.verify_not_unallocated((HeapWord*)ffc, word_sz); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2834 _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
|
2835 _bt.verify_single_block((HeapWord*)ffc, word_sz); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2836 // Push this on "fl". |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2837 fl->return_chunk_at_head(ffc); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2838 } |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2839 // TRAP |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2840 assert(fl->tail()->next() == NULL, "List invariant."); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2841 } |
|
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 // Update birth stats for this block size. |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2844 size_t num = fl->count(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2845 MutexLockerEx x(_indexedFreeListParLocks[word_sz], |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2846 Mutex::_no_safepoint_check_flag); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2847 ssize_t births = _indexedFreeList[word_sz].split_births() + num; |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2848 _indexedFreeList[word_sz].set_split_births(births); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2849 return; |
| 0 | 2850 } |
| 2851 } | |
| 2852 } | |
| 2853 // Otherwise, we'll split a block from the dictionary. | |
| 2854 FreeChunk* fc = NULL; | |
| 2855 FreeChunk* rem_fc = NULL; | |
| 2856 size_t rem; | |
| 2857 { | |
| 2858 MutexLockerEx x(parDictionaryAllocLock(), | |
| 2859 Mutex::_no_safepoint_check_flag); | |
| 2860 while (n > 0) { | |
| 6885 | 2861 fc = dictionary()->get_chunk(MAX2(n * word_sz, _dictionary->min_size()), |
| 6026 | 2862 FreeBlockDictionary<FreeChunk>::atLeast); |
| 0 | 2863 if (fc != NULL) { |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2864 _bt.allocated((HeapWord*)fc, fc->size(), true /* reducing */); // update _unallocated_blk |
| 6885 | 2865 dictionary()->dict_census_update(fc->size(), |
| 0 | 2866 true /*split*/, |
| 2867 false /*birth*/); | |
| 2868 break; | |
| 2869 } else { | |
| 2870 n--; | |
| 2871 } | |
| 2872 } | |
| 2873 if (fc == NULL) return; | |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2874 // Otherwise, split up that block. |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2875 assert((ssize_t)n >= 1, "Control point invariant"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2876 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
|
2877 _bt.verify_single_block((HeapWord*)fc, fc->size()); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2878 const size_t nn = fc->size() / word_sz; |
| 0 | 2879 n = MIN2(nn, n); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2880 assert((ssize_t)n >= 1, "Control point invariant"); |
| 0 | 2881 rem = fc->size() - n * word_sz; |
| 2882 // If there is a remainder, and it's too small, allocate one fewer. | |
| 2883 if (rem > 0 && rem < MinChunkSize) { | |
| 2884 n--; rem += word_sz; | |
| 2885 } | |
|
1148
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2886 // 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
|
2887 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
|
2888 |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2889 // 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
|
2890 // 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
|
2891 // 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
|
2892 // 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
|
2893 if (n == 0) { |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2894 returnChunkToDictionary(fc); |
|
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
2895 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
|
2896 return; |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2897 } |
|
05b775309e59
6912018: CMS: guarantee(head() != 0,"The head of the list cannot be NULL")
jmasa
parents:
1145
diff
changeset
|
2898 |
| 0 | 2899 // First return the remainder, if any. |
| 2900 // 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
|
2901 // back the remainder to the dictionary, since a concurrent allocation |
| 0 | 2902 // may otherwise see the heap as empty. (We're willing to take that |
| 2903 // hit if the block is a small block.) | |
| 2904 if (rem > 0) { | |
| 2905 size_t prefix_size = n * word_sz; | |
| 2906 rem_fc = (FreeChunk*)((HeapWord*)fc + prefix_size); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2907 rem_fc->set_size(rem); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2908 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
|
2909 rem_fc->link_next(NULL); |
| 0 | 2910 // Above must occur before BOT is updated below. |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2911 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
|
2912 OrderAccess::storestore(); |
| 0 | 2913 _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
|
2914 assert(fc->is_free(), "Error"); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2915 fc->set_size(prefix_size); |
| 0 | 2916 if (rem >= IndexSetSize) { |
| 2917 returnChunkToDictionary(rem_fc); | |
| 6885 | 2918 dictionary()->dict_census_update(rem, true /*split*/, true /*birth*/); |
| 0 | 2919 rem_fc = NULL; |
| 2920 } | |
| 2921 // Otherwise, return it to the small list below. | |
| 2922 } | |
| 2923 } | |
| 2924 if (rem_fc != NULL) { | |
| 2925 MutexLockerEx x(_indexedFreeListParLocks[rem], | |
| 2926 Mutex::_no_safepoint_check_flag); | |
| 2927 _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
|
2928 _indexedFreeList[rem].return_chunk_at_head(rem_fc); |
| 0 | 2929 smallSplitBirth(rem); |
| 2930 } | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2931 assert((ssize_t)n > 0 && fc != NULL, "Consistency"); |
| 0 | 2932 // Now do the splitting up. |
| 2933 // Must do this in reverse order, so that anybody attempting to | |
| 2934 // access the main chunk sees it as a single free block until we | |
| 2935 // change it. | |
| 2936 size_t fc_size = n * word_sz; | |
| 2937 // All but first chunk in this loop | |
| 2938 for (ssize_t i = n-1; i > 0; i--) { | |
| 2939 FreeChunk* ffc = (FreeChunk*)((HeapWord*)fc + i * word_sz); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2940 ffc->set_size(word_sz); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2941 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
|
2942 ffc->link_next(NULL); |
| 0 | 2943 // 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
|
2944 OrderAccess::storestore(); |
| 0 | 2945 // 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
|
2946 _bt.mark_block((HeapWord*)ffc, word_sz, true /* reducing */); |
| 0 | 2947 fc_size -= word_sz; |
| 2948 _bt.verify_not_unallocated((HeapWord*)ffc, ffc->size()); | |
| 2949 _bt.verify_single_block((HeapWord*)ffc, ffc->size()); | |
| 2950 _bt.verify_single_block((HeapWord*)fc, fc_size); | |
| 2951 // Push this on "fl". | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2952 fl->return_chunk_at_head(ffc); |
| 0 | 2953 } |
| 2954 // First chunk | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2955 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
|
2956 // 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
|
2957 fc->set_size(word_sz); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2958 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
|
2959 fc->link_next(NULL); |
| 0 | 2960 _bt.verify_not_unallocated((HeapWord*)fc, fc->size()); |
| 2961 _bt.verify_single_block((HeapWord*)fc, fc->size()); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2962 fl->return_chunk_at_head(fc); |
| 0 | 2963 |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2964 assert((ssize_t)n > 0 && (ssize_t)n == fl->count(), "Incorrect number of blocks"); |
| 0 | 2965 { |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2966 // Update the stats for this block size. |
| 0 | 2967 MutexLockerEx x(_indexedFreeListParLocks[word_sz], |
| 2968 Mutex::_no_safepoint_check_flag); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
2969 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
|
2970 _indexedFreeList[word_sz].set_split_births(births); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2971 // ssize_t new_surplus = _indexedFreeList[word_sz].surplus() + n; |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
2972 // _indexedFreeList[word_sz].set_surplus(new_surplus); |
| 0 | 2973 } |
| 2974 | |
| 2975 // TRAP | |
| 2976 assert(fl->tail()->next() == NULL, "List invariant."); | |
| 2977 } | |
| 2978 | |
| 2979 // Set up the space's par_seq_tasks structure for work claiming | |
| 2980 // for parallel rescan. See CMSParRemarkTask where this is currently used. | |
| 2981 // XXX Need to suitably abstract and generalize this and the next | |
| 2982 // method into one. | |
| 2983 void | |
| 2984 CompactibleFreeListSpace:: | |
| 2985 initialize_sequential_subtasks_for_rescan(int n_threads) { | |
| 2986 // The "size" of each task is fixed according to rescan_task_size. | |
| 2987 assert(n_threads > 0, "Unexpected n_threads argument"); | |
| 2988 const size_t task_size = rescan_task_size(); | |
| 2989 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
|
2990 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
|
2991 assert(n_tasks == 0 || |
|
ebeb6490b814
6722116: CMS: Incorrect overflow handling when using parallel concurrent marking
ysr
parents:
269
diff
changeset
|
2992 ((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
|
2993 (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
|
2994 "n_tasks calculation incorrect"); |
| 0 | 2995 SequentialSubTasksDone* pst = conc_par_seq_tasks(); |
| 2996 assert(!pst->valid(), "Clobbering existing data?"); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
2997 // 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
|
2998 // need to finish in order to be done). |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
2999 pst->set_n_threads(n_threads); |
| 0 | 3000 pst->set_n_tasks((int)n_tasks); |
| 3001 } | |
| 3002 | |
| 3003 // Set up the space's par_seq_tasks structure for work claiming | |
| 3004 // for parallel concurrent marking. See CMSConcMarkTask where this is currently used. | |
| 3005 void | |
| 3006 CompactibleFreeListSpace:: | |
| 3007 initialize_sequential_subtasks_for_marking(int n_threads, | |
| 3008 HeapWord* low) { | |
| 3009 // The "size" of each task is fixed according to rescan_task_size. | |
| 3010 assert(n_threads > 0, "Unexpected n_threads argument"); | |
| 3011 const size_t task_size = marking_task_size(); | |
| 3012 assert(task_size > CardTableModRefBS::card_size_in_words && | |
| 3013 (task_size % CardTableModRefBS::card_size_in_words == 0), | |
| 3014 "Otherwise arithmetic below would be incorrect"); | |
| 3015 MemRegion span = _gen->reserved(); | |
| 3016 if (low != NULL) { | |
| 3017 if (span.contains(low)) { | |
| 3018 // Align low down to a card boundary so that | |
| 3019 // we can use block_offset_careful() on span boundaries. | |
| 3020 HeapWord* aligned_low = (HeapWord*)align_size_down((uintptr_t)low, | |
| 3021 CardTableModRefBS::card_size); | |
| 3022 // Clip span prefix at aligned_low | |
| 3023 span = span.intersection(MemRegion(aligned_low, span.end())); | |
| 3024 } else if (low > span.end()) { | |
| 3025 span = MemRegion(low, low); // Null region | |
| 3026 } // else use entire span | |
| 3027 } | |
| 3028 assert(span.is_empty() || | |
| 3029 ((uintptr_t)span.start() % CardTableModRefBS::card_size == 0), | |
| 3030 "span should start at a card boundary"); | |
| 3031 size_t n_tasks = (span.word_size() + task_size - 1)/task_size; | |
| 3032 assert((n_tasks == 0) == span.is_empty(), "Inconsistency"); | |
| 3033 assert(n_tasks == 0 || | |
| 3034 ((span.start() + (n_tasks - 1)*task_size < span.end()) && | |
| 3035 (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
|
3036 "n_tasks calculation incorrect"); |
| 0 | 3037 SequentialSubTasksDone* pst = conc_par_seq_tasks(); |
| 3038 assert(!pst->valid(), "Clobbering existing data?"); | |
|
1833
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3039 // 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
|
3040 // need to finish in order to be done). |
|
8b10f48633dc
6984287: Regularize how GC parallel workers are specified.
jmasa
parents:
1777
diff
changeset
|
3041 pst->set_n_threads(n_threads); |
| 0 | 3042 pst->set_n_tasks((int)n_tasks); |
| 3043 } |