Mercurial > hg > truffle
annotate src/share/vm/memory/freeList.cpp @ 8001:db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
Summary: Rename INCLUDE_ALTERNATE_GCS to INCLUDE_ALL_GCS and replace SERIALGC with INCLUDE_ALL_GCS.
Reviewed-by: coleenp, stefank
| author | jprovino |
|---|---|
| date | Wed, 23 Jan 2013 13:02:39 -0500 |
| parents | 685df3c6f84b |
| children | 7c5a1b62f53d |
| rev | line source |
|---|---|
| 0 | 1 /* |
|
6842
b9a9ed0f8eeb
7197424: update copyright year to match last edit in jdk8 hotspot repository
mikael
parents:
6028
diff
changeset
|
2 * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved. |
| 0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 * | |
| 5 * This code is free software; you can redistribute it and/or modify it | |
| 6 * under the terms of the GNU General Public License version 2 only, as | |
| 7 * published by the Free Software Foundation. | |
| 8 * | |
| 9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
| 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 12 * version 2 for more details (a copy is included in the LICENSE file that | |
| 13 * accompanied this code). | |
| 14 * | |
| 15 * You should have received a copy of the GNU General Public License version | |
| 16 * 2 along with this work; if not, write to the Free Software Foundation, | |
| 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
| 18 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1145
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1145
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:
1145
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #include "precompiled.hpp" |
| 6026 | 26 #include "memory/freeBlockDictionary.hpp" |
| 27 #include "memory/freeList.hpp" | |
| 6885 | 28 #include "memory/metablock.hpp" |
| 29 #include "memory/metachunk.hpp" | |
| 1972 | 30 #include "memory/sharedHeap.hpp" |
| 31 #include "runtime/globals.hpp" | |
| 32 #include "runtime/mutex.hpp" | |
| 33 #include "runtime/vmThread.hpp" | |
|
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6885
diff
changeset
|
34 #include "utilities/macros.hpp" |
| 0 | 35 |
|
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6885
diff
changeset
|
36 #if INCLUDE_ALL_GCS |
| 6026 | 37 #include "gc_implementation/concurrentMarkSweep/freeChunk.hpp" |
|
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6885
diff
changeset
|
38 #endif // INCLUDE_ALL_GCS |
| 6026 | 39 |
| 0 | 40 // Free list. A FreeList is used to access a linked list of chunks |
| 41 // of space in the heap. The head and tail are maintained so that | |
| 42 // items can be (as in the current implementation) added at the | |
| 43 // at the tail of the list and removed from the head of the list to | |
| 44 // maintain a FIFO queue. | |
| 45 | |
| 6026 | 46 template <class Chunk> |
| 47 FreeList<Chunk>::FreeList() : | |
| 0 | 48 _head(NULL), _tail(NULL) |
| 49 #ifdef ASSERT | |
| 50 , _protecting_lock(NULL) | |
| 51 #endif | |
| 52 { | |
| 53 _size = 0; | |
| 54 _count = 0; | |
| 55 } | |
| 56 | |
| 6026 | 57 template <class Chunk> |
| 58 FreeList<Chunk>::FreeList(Chunk* fc) : | |
| 0 | 59 _head(fc), _tail(fc) |
| 60 #ifdef ASSERT | |
| 61 , _protecting_lock(NULL) | |
| 62 #endif | |
| 63 { | |
| 64 _size = fc->size(); | |
| 65 _count = 1; | |
| 66 } | |
| 67 | |
| 6026 | 68 template <class Chunk> |
| 6885 | 69 void FreeList<Chunk>::link_head(Chunk* v) { |
| 70 assert_proper_lock_protection(); | |
| 71 set_head(v); | |
| 72 // If this method is not used (just set the head instead), | |
| 73 // this check can be avoided. | |
| 74 if (v != NULL) { | |
| 75 v->link_prev(NULL); | |
| 76 } | |
| 77 } | |
| 78 | |
| 79 | |
| 80 | |
| 81 template <class Chunk> | |
| 82 void FreeList<Chunk>::reset() { | |
| 83 // Don't set the _size to 0 because this method is | |
| 84 // used with a existing list that has a size but which has | |
| 85 // been emptied. | |
| 86 // Don't clear the _protecting_lock of an existing list. | |
| 0 | 87 set_count(0); |
| 88 set_head(NULL); | |
| 89 set_tail(NULL); | |
| 90 } | |
| 91 | |
| 6026 | 92 template <class Chunk> |
| 6885 | 93 void FreeList<Chunk>::initialize() { |
| 94 #ifdef ASSERT | |
| 95 // Needed early because it might be checked in other initializing code. | |
| 96 set_protecting_lock(NULL); | |
| 97 #endif | |
| 98 reset(); | |
| 99 set_size(0); | |
| 0 | 100 } |
| 101 | |
| 6885 | 102 template <class Chunk_t> |
| 103 Chunk_t* FreeList<Chunk_t>::get_chunk_at_head() { | |
| 0 | 104 assert_proper_lock_protection(); |
| 105 assert(head() == NULL || head()->prev() == NULL, "list invariant"); | |
| 106 assert(tail() == NULL || tail()->next() == NULL, "list invariant"); | |
| 6885 | 107 Chunk_t* fc = head(); |
| 0 | 108 if (fc != NULL) { |
| 6885 | 109 Chunk_t* nextFC = fc->next(); |
| 0 | 110 if (nextFC != NULL) { |
| 111 // The chunk fc being removed has a "next". Set the "next" to the | |
| 112 // "prev" of fc. | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
113 nextFC->link_prev(NULL); |
| 0 | 114 } else { // removed tail of list |
| 115 link_tail(NULL); | |
| 116 } | |
| 117 link_head(nextFC); | |
| 118 decrement_count(); | |
| 119 } | |
| 120 assert(head() == NULL || head()->prev() == NULL, "list invariant"); | |
| 121 assert(tail() == NULL || tail()->next() == NULL, "list invariant"); | |
| 122 return fc; | |
| 123 } | |
| 124 | |
| 125 | |
| 6026 | 126 template <class Chunk> |
| 127 void FreeList<Chunk>::getFirstNChunksFromList(size_t n, FreeList<Chunk>* fl) { | |
| 0 | 128 assert_proper_lock_protection(); |
| 129 assert(fl->count() == 0, "Precondition"); | |
| 130 if (count() > 0) { | |
| 131 int k = 1; | |
| 132 fl->set_head(head()); n--; | |
| 6026 | 133 Chunk* tl = head(); |
| 0 | 134 while (tl->next() != NULL && n > 0) { |
| 135 tl = tl->next(); n--; k++; | |
| 136 } | |
| 137 assert(tl != NULL, "Loop Inv."); | |
| 138 | |
| 139 // First, fix up the list we took from. | |
| 6026 | 140 Chunk* new_head = tl->next(); |
| 0 | 141 set_head(new_head); |
| 142 set_count(count() - k); | |
| 143 if (new_head == NULL) { | |
| 144 set_tail(NULL); | |
| 145 } else { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
146 new_head->link_prev(NULL); |
| 0 | 147 } |
| 148 // Now we can fix up the tail. | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
149 tl->link_next(NULL); |
| 0 | 150 // And return the result. |
| 151 fl->set_tail(tl); | |
| 152 fl->set_count(k); | |
| 153 } | |
| 154 } | |
| 155 | |
| 156 // Remove this chunk from the list | |
| 6026 | 157 template <class Chunk> |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
158 void FreeList<Chunk>::remove_chunk(Chunk*fc) { |
| 0 | 159 assert_proper_lock_protection(); |
| 160 assert(head() != NULL, "Remove from empty list"); | |
| 161 assert(fc != NULL, "Remove a NULL chunk"); | |
| 162 assert(size() == fc->size(), "Wrong list"); | |
| 163 assert(head() == NULL || head()->prev() == NULL, "list invariant"); | |
| 164 assert(tail() == NULL || tail()->next() == NULL, "list invariant"); | |
| 165 | |
| 6026 | 166 Chunk* prevFC = fc->prev(); |
| 167 Chunk* nextFC = fc->next(); | |
| 0 | 168 if (nextFC != NULL) { |
| 169 // The chunk fc being removed has a "next". Set the "next" to the | |
| 170 // "prev" of fc. | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
171 nextFC->link_prev(prevFC); |
| 0 | 172 } else { // removed tail of list |
| 173 link_tail(prevFC); | |
| 174 } | |
| 175 if (prevFC == NULL) { // removed head of list | |
| 176 link_head(nextFC); | |
| 177 assert(nextFC == NULL || nextFC->prev() == NULL, | |
| 178 "Prev of head should be NULL"); | |
| 179 } else { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
180 prevFC->link_next(nextFC); |
| 0 | 181 assert(tail() != prevFC || prevFC->next() == NULL, |
| 182 "Next of tail should be NULL"); | |
| 183 } | |
| 184 decrement_count(); | |
|
1777
179464550c7d
6983930: CMS: Various small cleanups ca September 2010
ysr
parents:
1552
diff
changeset
|
185 assert(((head() == NULL) + (tail() == NULL) + (count() == 0)) % 3 == 0, |
|
179464550c7d
6983930: CMS: Various small cleanups ca September 2010
ysr
parents:
1552
diff
changeset
|
186 "H/T/C Inconsistency"); |
| 0 | 187 // clear next and prev fields of fc, debug only |
| 188 NOT_PRODUCT( | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
189 fc->link_prev(NULL); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
190 fc->link_next(NULL); |
| 0 | 191 ) |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
192 assert(fc->is_free(), "Should still be a free chunk"); |
| 0 | 193 assert(head() == NULL || head()->prev() == NULL, "list invariant"); |
| 194 assert(tail() == NULL || tail()->next() == NULL, "list invariant"); | |
| 195 assert(head() == NULL || head()->size() == size(), "wrong item on list"); | |
| 196 assert(tail() == NULL || tail()->size() == size(), "wrong item on list"); | |
| 197 } | |
| 198 | |
| 199 // Add this chunk at the head of the list. | |
| 6026 | 200 template <class Chunk> |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
201 void FreeList<Chunk>::return_chunk_at_head(Chunk* chunk, bool record_return) { |
| 0 | 202 assert_proper_lock_protection(); |
| 203 assert(chunk != NULL, "insert a NULL chunk"); | |
| 204 assert(size() == chunk->size(), "Wrong size"); | |
| 205 assert(head() == NULL || head()->prev() == NULL, "list invariant"); | |
| 206 assert(tail() == NULL || tail()->next() == NULL, "list invariant"); | |
| 207 | |
| 6026 | 208 Chunk* oldHead = head(); |
| 0 | 209 assert(chunk != oldHead, "double insertion"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
210 chunk->link_after(oldHead); |
| 0 | 211 link_head(chunk); |
| 212 if (oldHead == NULL) { // only chunk in list | |
| 213 assert(tail() == NULL, "inconsistent FreeList"); | |
| 214 link_tail(chunk); | |
| 215 } | |
| 216 increment_count(); // of # of chunks in list | |
| 217 assert(head() == NULL || head()->prev() == NULL, "list invariant"); | |
| 218 assert(tail() == NULL || tail()->next() == NULL, "list invariant"); | |
| 219 assert(head() == NULL || head()->size() == size(), "wrong item on list"); | |
| 220 assert(tail() == NULL || tail()->size() == size(), "wrong item on list"); | |
| 221 } | |
| 222 | |
| 6026 | 223 template <class Chunk> |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
224 void FreeList<Chunk>::return_chunk_at_head(Chunk* chunk) { |
| 0 | 225 assert_proper_lock_protection(); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
226 return_chunk_at_head(chunk, true); |
| 0 | 227 } |
| 228 | |
| 229 // Add this chunk at the tail of the list. | |
| 6026 | 230 template <class Chunk> |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
231 void FreeList<Chunk>::return_chunk_at_tail(Chunk* chunk, bool record_return) { |
| 0 | 232 assert_proper_lock_protection(); |
| 233 assert(head() == NULL || head()->prev() == NULL, "list invariant"); | |
| 234 assert(tail() == NULL || tail()->next() == NULL, "list invariant"); | |
| 235 assert(chunk != NULL, "insert a NULL chunk"); | |
| 236 assert(size() == chunk->size(), "wrong size"); | |
| 237 | |
| 6026 | 238 Chunk* oldTail = tail(); |
| 0 | 239 assert(chunk != oldTail, "double insertion"); |
| 240 if (oldTail != NULL) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
241 oldTail->link_after(chunk); |
| 0 | 242 } else { // only chunk in list |
| 243 assert(head() == NULL, "inconsistent FreeList"); | |
| 244 link_head(chunk); | |
| 245 } | |
| 246 link_tail(chunk); | |
| 247 increment_count(); // of # of chunks in list | |
| 248 assert(head() == NULL || head()->prev() == NULL, "list invariant"); | |
| 249 assert(tail() == NULL || tail()->next() == NULL, "list invariant"); | |
| 250 assert(head() == NULL || head()->size() == size(), "wrong item on list"); | |
| 251 assert(tail() == NULL || tail()->size() == size(), "wrong item on list"); | |
| 252 } | |
| 253 | |
| 6026 | 254 template <class Chunk> |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
255 void FreeList<Chunk>::return_chunk_at_tail(Chunk* chunk) { |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
256 return_chunk_at_tail(chunk, true); |
| 0 | 257 } |
| 258 | |
| 6026 | 259 template <class Chunk> |
| 260 void FreeList<Chunk>::prepend(FreeList<Chunk>* fl) { | |
| 0 | 261 assert_proper_lock_protection(); |
| 262 if (fl->count() > 0) { | |
| 263 if (count() == 0) { | |
| 264 set_head(fl->head()); | |
| 265 set_tail(fl->tail()); | |
| 266 set_count(fl->count()); | |
| 267 } else { | |
| 268 // Both are non-empty. | |
| 6026 | 269 Chunk* fl_tail = fl->tail(); |
| 270 Chunk* this_head = head(); | |
| 0 | 271 assert(fl_tail->next() == NULL, "Well-formedness of fl"); |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
272 fl_tail->link_next(this_head); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
273 this_head->link_prev(fl_tail); |
| 0 | 274 set_head(fl->head()); |
| 275 set_count(count() + fl->count()); | |
| 276 } | |
| 277 fl->set_head(NULL); | |
| 278 fl->set_tail(NULL); | |
| 279 fl->set_count(0); | |
| 280 } | |
| 281 } | |
| 282 | |
| 6885 | 283 // verify_chunk_in_free_lists() is used to verify that an item is in this free list. |
| 0 | 284 // It is used as a debugging aid. |
| 6026 | 285 template <class Chunk> |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
286 bool FreeList<Chunk>::verify_chunk_in_free_list(Chunk* fc) const { |
| 0 | 287 // This is an internal consistency check, not part of the check that the |
| 288 // chunk is in the free lists. | |
| 289 guarantee(fc->size() == size(), "Wrong list is being searched"); | |
| 6026 | 290 Chunk* curFC = head(); |
| 0 | 291 while (curFC) { |
| 292 // This is an internal consistency check. | |
| 293 guarantee(size() == curFC->size(), "Chunk is in wrong list."); | |
| 294 if (fc == curFC) { | |
| 295 return true; | |
| 296 } | |
| 297 curFC = curFC->next(); | |
| 298 } | |
| 299 return false; | |
| 300 } | |
| 301 | |
| 302 #ifndef PRODUCT | |
| 6026 | 303 template <class Chunk> |
| 304 void FreeList<Chunk>::assert_proper_lock_protection_work() const { | |
| 6885 | 305 assert(protecting_lock() != NULL, "Don't call this directly"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
306 assert(ParallelGCThreads > 0, "Don't call this directly"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
307 Thread* thr = Thread::current(); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
308 if (thr->is_VM_thread() || thr->is_ConcurrentGC_thread()) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
309 // assert that we are holding the freelist lock |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
310 } else if (thr->is_GC_task_thread()) { |
| 6885 | 311 assert(protecting_lock()->owned_by_self(), "FreeList RACE DETECTED"); |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
312 } else if (thr->is_Java_thread()) { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
313 assert(!SafepointSynchronize::is_at_safepoint(), "Should not be executing"); |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
314 } else { |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
315 ShouldNotReachHere(); // unaccounted thread type? |
| 0 | 316 } |
| 317 } | |
| 318 #endif | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
319 |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
320 // Print the "label line" for free list stats. |
| 6026 | 321 template <class Chunk> |
| 322 void FreeList<Chunk>::print_labels_on(outputStream* st, const char* c) { | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
323 st->print("%16s\t", c); |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
324 st->print("%14s\t" "%14s\t" "%14s\t" "%14s\t" "%14s\t" |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
325 "%14s\t" "%14s\t" "%14s\t" "%14s\t" "%14s\t" "\n", |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
326 "bfrsurp", "surplus", "desired", "prvSwep", "bfrSwep", |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
327 "count", "cBirths", "cDeaths", "sBirths", "sDeaths"); |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
328 } |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
329 |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
330 // Print the AllocationStats for the given free list. If the second argument |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
331 // to the call is a non-null string, it is printed in the first column; |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
332 // otherwise, if the argument is null (the default), then the size of the |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
333 // (free list) block is printed in the first column. |
| 6885 | 334 template <class Chunk_t> |
| 335 void FreeList<Chunk_t>::print_on(outputStream* st, const char* c) const { | |
|
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
336 if (c != NULL) { |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
337 st->print("%16s", c); |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
338 } else { |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
339 st->print(SIZE_FORMAT_W(16), size()); |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
340 } |
|
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
341 } |
| 6026 | 342 |
| 6885 | 343 template class FreeList<Metablock>; |
| 344 template class FreeList<Metachunk>; | |
|
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6885
diff
changeset
|
345 #if INCLUDE_ALL_GCS |
| 6026 | 346 template class FreeList<FreeChunk>; |
|
8001
db9981fd3124
8005915: Unify SERIALGC and INCLUDE_ALTERNATE_GCS
jprovino
parents:
6885
diff
changeset
|
347 #endif // INCLUDE_ALL_GCS |