Mercurial > hg > truffle
annotate src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp @ 4625:73f935f28920
in esa mode, check that values in stateAfter are all ready after LIRGen of a ValudeNode
author | Gilles Duboscq <duboscq@ssw.jku.at> |
---|---|
date | Fri, 17 Feb 2012 11:37:44 +0100 |
parents | 5a5ed80bea5b |
children | 3c648b9ad052 |
rev | line source |
---|---|
0 | 1 /* |
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
1972
diff
changeset
|
2 * Copyright (c) 2001, 2011, 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 #ifndef SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_COMPACTIBLEFREELISTSPACE_HPP |
26 #define SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_COMPACTIBLEFREELISTSPACE_HPP | |
27 | |
28 #include "gc_implementation/concurrentMarkSweep/binaryTreeDictionary.hpp" | |
29 #include "gc_implementation/concurrentMarkSweep/freeList.hpp" | |
30 #include "gc_implementation/concurrentMarkSweep/promotionInfo.hpp" | |
31 #include "memory/blockOffsetTable.inline.hpp" | |
32 #include "memory/space.hpp" | |
33 | |
0 | 34 // Classes in support of keeping track of promotions into a non-Contiguous |
35 // space, in this case a CompactibleFreeListSpace. | |
36 | |
37 // Forward declarations | |
38 class CompactibleFreeListSpace; | |
39 class BlkClosure; | |
40 class BlkClosureCareful; | |
41 class UpwardsObjectClosure; | |
42 class ObjectClosureCareful; | |
43 class Klass; | |
44 | |
45 class LinearAllocBlock VALUE_OBJ_CLASS_SPEC { | |
46 public: | |
47 LinearAllocBlock() : _ptr(0), _word_size(0), _refillSize(0), | |
48 _allocation_size_limit(0) {} | |
49 void set(HeapWord* ptr, size_t word_size, size_t refill_size, | |
50 size_t allocation_size_limit) { | |
51 _ptr = ptr; | |
52 _word_size = word_size; | |
53 _refillSize = refill_size; | |
54 _allocation_size_limit = allocation_size_limit; | |
55 } | |
56 HeapWord* _ptr; | |
57 size_t _word_size; | |
58 size_t _refillSize; | |
59 size_t _allocation_size_limit; // largest size that will be allocated | |
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
60 |
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
61 void print_on(outputStream* st) const; |
0 | 62 }; |
63 | |
64 // Concrete subclass of CompactibleSpace that implements | |
65 // a free list space, such as used in the concurrent mark sweep | |
66 // generation. | |
67 | |
68 class CompactibleFreeListSpace: public CompactibleSpace { | |
69 friend class VMStructs; | |
70 friend class ConcurrentMarkSweepGeneration; | |
71 friend class ASConcurrentMarkSweepGeneration; | |
72 friend class CMSCollector; | |
73 friend class CMSPermGenGen; | |
74 // Local alloc buffer for promotion into this space. | |
75 friend class CFLS_LAB; | |
76 | |
77 // "Size" of chunks of work (executed during parallel remark phases | |
78 // of CMS collection); this probably belongs in CMSCollector, although | |
79 // it's cached here because it's used in | |
80 // initialize_sequential_subtasks_for_rescan() which modifies | |
81 // par_seq_tasks which also lives in Space. XXX | |
82 const size_t _rescan_task_size; | |
83 const size_t _marking_task_size; | |
84 | |
85 // Yet another sequential tasks done structure. This supports | |
86 // CMS GC, where we have threads dynamically | |
87 // claiming sub-tasks from a larger parallel task. | |
88 SequentialSubTasksDone _conc_par_seq_tasks; | |
89 | |
90 BlockOffsetArrayNonContigSpace _bt; | |
91 | |
92 CMSCollector* _collector; | |
93 ConcurrentMarkSweepGeneration* _gen; | |
94 | |
95 // Data structures for free blocks (used during allocation/sweeping) | |
96 | |
97 // Allocation is done linearly from two different blocks depending on | |
98 // whether the request is small or large, in an effort to reduce | |
99 // fragmentation. We assume that any locking for allocation is done | |
100 // by the containing generation. Thus, none of the methods in this | |
101 // space are re-entrant. | |
102 enum SomeConstants { | |
103 SmallForLinearAlloc = 16, // size < this then use _sLAB | |
104 SmallForDictionary = 257, // size < this then use _indexedFreeList | |
1571
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
105 IndexSetSize = SmallForDictionary // keep this odd-sized |
0 | 106 }; |
4068
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
107 static size_t IndexSetStart; |
5a5ed80bea5b
7105163: CMS: some mentions of MinChunkSize should be IndexSetStart
ysr
parents:
4024
diff
changeset
|
108 static size_t IndexSetStride; |
0 | 109 |
110 private: | |
111 enum FitStrategyOptions { | |
112 FreeBlockStrategyNone = 0, | |
113 FreeBlockBestFitFirst | |
114 }; | |
115 | |
116 PromotionInfo _promoInfo; | |
117 | |
118 // helps to impose a global total order on freelistLock ranks; | |
119 // assumes that CFLSpace's are allocated in global total order | |
120 static int _lockRank; | |
121 | |
122 // a lock protecting the free lists and free blocks; | |
123 // mutable because of ubiquity of locking even for otherwise const methods | |
124 mutable Mutex _freelistLock; | |
125 // locking verifier convenience function | |
126 void assert_locked() const PRODUCT_RETURN; | |
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
127 void assert_locked(const Mutex* lock) const PRODUCT_RETURN; |
0 | 128 |
129 // Linear allocation blocks | |
130 LinearAllocBlock _smallLinearAllocBlock; | |
131 | |
132 FreeBlockDictionary::DictionaryChoice _dictionaryChoice; | |
133 FreeBlockDictionary* _dictionary; // ptr to dictionary for large size blocks | |
134 | |
135 FreeList _indexedFreeList[IndexSetSize]; | |
136 // indexed array for small size blocks | |
137 // allocation stategy | |
138 bool _fitStrategy; // Use best fit strategy. | |
139 bool _adaptive_freelists; // Use adaptive freelists | |
140 | |
141 // This is an address close to the largest free chunk in the heap. | |
142 // It is currently assumed to be at the end of the heap. Free | |
143 // chunks with addresses greater than nearLargestChunk are coalesced | |
144 // in an effort to maintain a large chunk at the end of the heap. | |
145 HeapWord* _nearLargestChunk; | |
146 | |
147 // Used to keep track of limit of sweep for the space | |
148 HeapWord* _sweep_limit; | |
149 | |
150 // Support for compacting cms | |
151 HeapWord* cross_threshold(HeapWord* start, HeapWord* end); | |
152 HeapWord* forward(oop q, size_t size, CompactPoint* cp, HeapWord* compact_top); | |
153 | |
154 // Initialization helpers. | |
155 void initializeIndexedFreeListArray(); | |
156 | |
157 // Extra stuff to manage promotion parallelism. | |
158 | |
159 // a lock protecting the dictionary during par promotion allocation. | |
160 mutable Mutex _parDictionaryAllocLock; | |
161 Mutex* parDictionaryAllocLock() const { return &_parDictionaryAllocLock; } | |
162 | |
163 // Locks protecting the exact lists during par promotion allocation. | |
164 Mutex* _indexedFreeListParLocks[IndexSetSize]; | |
165 | |
166 // Attempt to obtain up to "n" blocks of the size "word_sz" (which is | |
167 // required to be smaller than "IndexSetSize".) If successful, | |
168 // adds them to "fl", which is required to be an empty free list. | |
169 // If the count of "fl" is negative, it's absolute value indicates a | |
170 // number of free chunks that had been previously "borrowed" from global | |
171 // list of size "word_sz", and must now be decremented. | |
172 void par_get_chunk_of_blocks(size_t word_sz, size_t n, FreeList* fl); | |
173 | |
174 // Allocation helper functions | |
175 // Allocate using a strategy that takes from the indexed free lists | |
176 // first. This allocation strategy assumes a companion sweeping | |
177 // strategy that attempts to keep the needed number of chunks in each | |
178 // indexed free lists. | |
179 HeapWord* allocate_adaptive_freelists(size_t size); | |
180 // Allocate from the linear allocation buffers first. This allocation | |
181 // strategy assumes maximal coalescing can maintain chunks large enough | |
182 // to be used as linear allocation buffers. | |
183 HeapWord* allocate_non_adaptive_freelists(size_t size); | |
184 | |
185 // Gets a chunk from the linear allocation block (LinAB). If there | |
186 // is not enough space in the LinAB, refills it. | |
187 HeapWord* getChunkFromLinearAllocBlock(LinearAllocBlock* blk, size_t size); | |
188 HeapWord* getChunkFromSmallLinearAllocBlock(size_t size); | |
189 // Get a chunk from the space remaining in the linear allocation block. Do | |
190 // not attempt to refill if the space is not available, return NULL. Do the | |
191 // repairs on the linear allocation block as appropriate. | |
192 HeapWord* getChunkFromLinearAllocBlockRemainder(LinearAllocBlock* blk, size_t size); | |
193 inline HeapWord* getChunkFromSmallLinearAllocBlockRemainder(size_t size); | |
194 | |
195 // Helper function for getChunkFromIndexedFreeList. | |
196 // Replenish the indexed free list for this "size". Do not take from an | |
197 // underpopulated size. | |
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
198 FreeChunk* getChunkFromIndexedFreeListHelper(size_t size, bool replenish = true); |
0 | 199 |
200 // Get a chunk from the indexed free list. If the indexed free list | |
201 // does not have a free chunk, try to replenish the indexed free list | |
202 // then get the free chunk from the replenished indexed free list. | |
203 inline FreeChunk* getChunkFromIndexedFreeList(size_t size); | |
204 | |
205 // The returned chunk may be larger than requested (or null). | |
206 FreeChunk* getChunkFromDictionary(size_t size); | |
207 // The returned chunk is the exact size requested (or null). | |
208 FreeChunk* getChunkFromDictionaryExact(size_t size); | |
209 | |
210 // Find a chunk in the indexed free list that is the best | |
211 // fit for size "numWords". | |
212 FreeChunk* bestFitSmall(size_t numWords); | |
213 // For free list "fl" of chunks of size > numWords, | |
214 // remove a chunk, split off a chunk of size numWords | |
215 // and return it. The split off remainder is returned to | |
216 // the free lists. The old name for getFromListGreater | |
217 // was lookInListGreater. | |
218 FreeChunk* getFromListGreater(FreeList* fl, size_t numWords); | |
219 // Get a chunk in the indexed free list or dictionary, | |
220 // by considering a larger chunk and splitting it. | |
221 FreeChunk* getChunkFromGreater(size_t numWords); | |
222 // Verify that the given chunk is in the indexed free lists. | |
223 bool verifyChunkInIndexedFreeLists(FreeChunk* fc) const; | |
224 // Remove the specified chunk from the indexed free lists. | |
225 void removeChunkFromIndexedFreeList(FreeChunk* fc); | |
226 // Remove the specified chunk from the dictionary. | |
227 void removeChunkFromDictionary(FreeChunk* fc); | |
228 // Split a free chunk into a smaller free chunk of size "new_size". | |
229 // Return the smaller free chunk and return the remainder to the | |
230 // free lists. | |
231 FreeChunk* splitChunkAndReturnRemainder(FreeChunk* chunk, size_t new_size); | |
232 // Add a chunk to the free lists. | |
233 void addChunkToFreeLists(HeapWord* chunk, size_t size); | |
234 // Add a chunk to the free lists, preferring to suffix it | |
235 // to the last free chunk at end of space if possible, and | |
236 // updating the block census stats as well as block offset table. | |
237 // Take any locks as appropriate if we are multithreaded. | |
238 void addChunkToFreeListsAtEndRecordingStats(HeapWord* chunk, size_t size); | |
239 // Add a free chunk to the indexed free lists. | |
240 void returnChunkToFreeList(FreeChunk* chunk); | |
241 // Add a free chunk to the dictionary. | |
242 void returnChunkToDictionary(FreeChunk* chunk); | |
243 | |
244 // Functions for maintaining the linear allocation buffers (LinAB). | |
245 // Repairing a linear allocation block refers to operations | |
246 // performed on the remainder of a LinAB after an allocation | |
247 // has been made from it. | |
248 void repairLinearAllocationBlocks(); | |
249 void repairLinearAllocBlock(LinearAllocBlock* blk); | |
250 void refillLinearAllocBlock(LinearAllocBlock* blk); | |
251 void refillLinearAllocBlockIfNeeded(LinearAllocBlock* blk); | |
252 void refillLinearAllocBlocksIfNeeded(); | |
253 | |
254 void verify_objects_initialized() const; | |
255 | |
256 // Statistics reporting helper functions | |
257 void reportFreeListStatistics() const; | |
258 void reportIndexedFreeListStatistics() const; | |
259 size_t maxChunkSizeInIndexedFreeLists() const; | |
260 size_t numFreeBlocksInIndexedFreeLists() const; | |
261 // Accessor | |
262 HeapWord* unallocated_block() const { | |
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
263 if (BlockOffsetArrayUseUnallocatedBlock) { |
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
264 HeapWord* ub = _bt.unallocated_block(); |
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
265 assert(ub >= bottom() && |
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
266 ub <= end(), "space invariant"); |
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
267 return ub; |
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
268 } else { |
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
269 return end(); |
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
270 } |
0 | 271 } |
272 void freed(HeapWord* start, size_t size) { | |
273 _bt.freed(start, size); | |
274 } | |
275 | |
276 protected: | |
277 // reset the indexed free list to its initial empty condition. | |
278 void resetIndexedFreeListArray(); | |
279 // reset to an initial state with a single free block described | |
280 // by the MemRegion parameter. | |
281 void reset(MemRegion mr); | |
282 // Return the total number of words in the indexed free lists. | |
283 size_t totalSizeInIndexedFreeLists() const; | |
284 | |
285 public: | |
286 // Constructor... | |
287 CompactibleFreeListSpace(BlockOffsetSharedArray* bs, MemRegion mr, | |
288 bool use_adaptive_freelists, | |
289 FreeBlockDictionary::DictionaryChoice); | |
290 // accessors | |
291 bool bestFitFirst() { return _fitStrategy == FreeBlockBestFitFirst; } | |
292 FreeBlockDictionary* dictionary() const { return _dictionary; } | |
293 HeapWord* nearLargestChunk() const { return _nearLargestChunk; } | |
294 void set_nearLargestChunk(HeapWord* v) { _nearLargestChunk = v; } | |
295 | |
1571
2d127394260e
6916623: Align object to 16 bytes to use Compressed Oops with java heap up to 64Gb
kvn
parents:
1521
diff
changeset
|
296 // 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
|
297 static void 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
|
298 |
0 | 299 // Return the free chunk at the end of the space. If no such |
300 // chunk exists, return NULL. | |
301 FreeChunk* find_chunk_at_end(); | |
302 | |
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
303 bool adaptive_freelists() const { return _adaptive_freelists; } |
0 | 304 |
305 void set_collector(CMSCollector* collector) { _collector = collector; } | |
306 | |
307 // Support for parallelization of rescan and marking | |
308 const size_t rescan_task_size() const { return _rescan_task_size; } | |
309 const size_t marking_task_size() const { return _marking_task_size; } | |
310 SequentialSubTasksDone* conc_par_seq_tasks() {return &_conc_par_seq_tasks; } | |
311 void initialize_sequential_subtasks_for_rescan(int n_threads); | |
312 void initialize_sequential_subtasks_for_marking(int n_threads, | |
313 HeapWord* low = NULL); | |
314 | |
315 // Space enquiries | |
316 size_t used() const; | |
317 size_t free() const; | |
318 size_t max_alloc_in_words() const; | |
319 // XXX: should have a less conservative used_region() than that of | |
320 // Space; we could consider keeping track of highest allocated | |
321 // address and correcting that at each sweep, as the sweeper | |
322 // goes through the entire allocated part of the generation. We | |
323 // could also use that information to keep the sweeper from | |
324 // sweeping more than is necessary. The allocator and sweeper will | |
325 // of course need to synchronize on this, since the sweeper will | |
326 // try to bump down the address and the allocator will try to bump it up. | |
327 // For now, however, we'll just use the default used_region() | |
328 // which overestimates the region by returning the entire | |
329 // committed region (this is safe, but inefficient). | |
330 | |
331 // Returns a subregion of the space containing all the objects in | |
332 // the space. | |
333 MemRegion used_region() const { | |
334 return MemRegion(bottom(), | |
335 BlockOffsetArrayUseUnallocatedBlock ? | |
336 unallocated_block() : end()); | |
337 } | |
338 | |
339 // This is needed because the default implementation uses block_start() | |
340 // which can;t be used at certain times (for example phase 3 of mark-sweep). | |
341 // A better fix is to change the assertions in phase 3 of mark-sweep to | |
342 // use is_in_reserved(), but that is deferred since the is_in() assertions | |
343 // are buried through several layers of callers and are used elsewhere | |
344 // as well. | |
345 bool is_in(const void* p) const { | |
346 return used_region().contains(p); | |
347 } | |
348 | |
349 virtual bool is_free_block(const HeapWord* p) const; | |
350 | |
351 // Resizing support | |
352 void set_end(HeapWord* value); // override | |
353 | |
354 // mutual exclusion support | |
355 Mutex* freelistLock() const { return &_freelistLock; } | |
356 | |
357 // Iteration support | |
358 void oop_iterate(MemRegion mr, OopClosure* cl); | |
359 void oop_iterate(OopClosure* cl); | |
360 | |
361 void object_iterate(ObjectClosure* blk); | |
517
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
362 // Apply the closure to each object in the space whose references |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
363 // point to objects in the heap. The usage of CompactibleFreeListSpace |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
364 // by the ConcurrentMarkSweepGeneration for concurrent GC's allows |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
365 // objects in the space with references to objects that are no longer |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
366 // valid. For example, an object may reference another object |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
367 // that has already been sweep up (collected). This method uses |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
368 // obj_is_alive() to determine whether it is safe to iterate of |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
369 // an object. |
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
370 void safe_object_iterate(ObjectClosure* blk); |
0 | 371 void object_iterate_mem(MemRegion mr, UpwardsObjectClosure* cl); |
372 | |
373 // Requires that "mr" be entirely within the space. | |
374 // Apply "cl->do_object" to all objects that intersect with "mr". | |
375 // If the iteration encounters an unparseable portion of the region, | |
376 // terminate the iteration and return the address of the start of the | |
377 // subregion that isn't done. Return of "NULL" indicates that the | |
378 // interation completed. | |
379 virtual HeapWord* | |
380 object_iterate_careful_m(MemRegion mr, | |
381 ObjectClosureCareful* cl); | |
382 virtual HeapWord* | |
383 object_iterate_careful(ObjectClosureCareful* cl); | |
384 | |
385 // Override: provides a DCTO_CL specific to this kind of space. | |
386 DirtyCardToOopClosure* new_dcto_cl(OopClosure* cl, | |
387 CardTableModRefBS::PrecisionStyle precision, | |
388 HeapWord* boundary); | |
389 | |
390 void blk_iterate(BlkClosure* cl); | |
391 void blk_iterate_careful(BlkClosureCareful* cl); | |
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
113
diff
changeset
|
392 HeapWord* block_start_const(const void* p) const; |
0 | 393 HeapWord* block_start_careful(const void* p) const; |
394 size_t block_size(const HeapWord* p) const; | |
395 size_t block_size_no_stall(HeapWord* p, const CMSCollector* c) const; | |
396 bool block_is_obj(const HeapWord* p) const; | |
397 bool obj_is_alive(const HeapWord* p) const; | |
398 size_t block_size_nopar(const HeapWord* p) const; | |
399 bool block_is_obj_nopar(const HeapWord* p) const; | |
400 | |
401 // iteration support for promotion | |
402 void save_marks(); | |
403 bool no_allocs_since_save_marks(); | |
404 void object_iterate_since_last_GC(ObjectClosure* cl); | |
405 | |
406 // iteration support for sweeping | |
407 void save_sweep_limit() { | |
408 _sweep_limit = BlockOffsetArrayUseUnallocatedBlock ? | |
409 unallocated_block() : end(); | |
3746
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
1972
diff
changeset
|
410 if (CMSTraceSweeper) { |
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
1972
diff
changeset
|
411 gclog_or_tty->print_cr(">>>>> Saving sweep limit " PTR_FORMAT |
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
1972
diff
changeset
|
412 " for space [" PTR_FORMAT "," PTR_FORMAT ") <<<<<<", |
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
1972
diff
changeset
|
413 _sweep_limit, bottom(), end()); |
537a4053b0f9
7042740: CMS: assert(n> q) failed: Looping at: ... blockOffsetTable.cpp:557
ysr
parents:
1972
diff
changeset
|
414 } |
0 | 415 } |
416 NOT_PRODUCT( | |
417 void clear_sweep_limit() { _sweep_limit = NULL; } | |
418 ) | |
419 HeapWord* sweep_limit() { return _sweep_limit; } | |
420 | |
421 // Apply "blk->do_oop" to the addresses of all reference fields in objects | |
422 // promoted into this generation since the most recent save_marks() call. | |
423 // Fields in objects allocated by applications of the closure | |
424 // *are* included in the iteration. Thus, when the iteration completes | |
425 // there should be no further such objects remaining. | |
426 #define CFLS_OOP_SINCE_SAVE_MARKS_DECL(OopClosureType, nv_suffix) \ | |
427 void oop_since_save_marks_iterate##nv_suffix(OopClosureType* blk); | |
428 ALL_SINCE_SAVE_MARKS_CLOSURES(CFLS_OOP_SINCE_SAVE_MARKS_DECL) | |
429 #undef CFLS_OOP_SINCE_SAVE_MARKS_DECL | |
430 | |
431 // Allocation support | |
432 HeapWord* allocate(size_t size); | |
433 HeapWord* par_allocate(size_t size); | |
434 | |
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
12
diff
changeset
|
435 oop promote(oop obj, size_t obj_size); |
0 | 436 void gc_prologue(); |
437 void gc_epilogue(); | |
438 | |
439 // This call is used by a containing CMS generation / collector | |
440 // to inform the CFLS space that a sweep has been completed | |
441 // and that the space can do any related house-keeping functions. | |
442 void sweep_completed(); | |
443 | |
444 // For an object in this space, the mark-word's two | |
445 // LSB's having the value [11] indicates that it has been | |
446 // promoted since the most recent call to save_marks() on | |
447 // this generation and has not subsequently been iterated | |
448 // over (using oop_since_save_marks_iterate() above). | |
1521 | 449 // This property holds only for single-threaded collections, |
450 // and is typically used for Cheney scans; for MT scavenges, | |
451 // the property holds for all objects promoted during that | |
452 // scavenge for the duration of the scavenge and is used | |
453 // by card-scanning to avoid scanning objects (being) promoted | |
454 // during that scavenge. | |
0 | 455 bool obj_allocated_since_save_marks(const oop obj) const { |
456 assert(is_in_reserved(obj), "Wrong space?"); | |
457 return ((PromotedObject*)obj)->hasPromotedMark(); | |
458 } | |
459 | |
460 // A worst-case estimate of the space required (in HeapWords) to expand the | |
461 // heap when promoting an obj of size obj_size. | |
462 size_t expansionSpaceRequired(size_t obj_size) const; | |
463 | |
464 FreeChunk* allocateScratch(size_t size); | |
465 | |
466 // returns true if either the small or large linear allocation buffer is empty. | |
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
467 bool linearAllocationWouldFail() const; |
0 | 468 |
469 // Adjust the chunk for the minimum size. This version is called in | |
470 // most cases in CompactibleFreeListSpace methods. | |
471 inline static size_t adjustObjectSize(size_t size) { | |
472 return (size_t) align_object_size(MAX2(size, (size_t)MinChunkSize)); | |
473 } | |
474 // This is a virtual version of adjustObjectSize() that is called | |
475 // only occasionally when the compaction space changes and the type | |
476 // of the new compaction space is is only known to be CompactibleSpace. | |
477 size_t adjust_object_size_v(size_t size) const { | |
478 return adjustObjectSize(size); | |
479 } | |
480 // Minimum size of a free block. | |
481 virtual size_t minimum_free_block_size() const { return MinChunkSize; } | |
482 void removeFreeChunkFromFreeLists(FreeChunk* chunk); | |
483 void addChunkAndRepairOffsetTable(HeapWord* chunk, size_t size, | |
484 bool coalesced); | |
485 | |
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
486 // Support for decisions regarding concurrent collection policy |
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
487 bool should_concurrent_collect() const; |
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
488 |
0 | 489 // Support for compaction |
490 void prepare_for_compaction(CompactPoint* cp); | |
491 void adjust_pointers(); | |
492 void compact(); | |
493 // reset the space to reflect the fact that a compaction of the | |
494 // space has been done. | |
495 virtual void reset_after_compaction(); | |
496 | |
497 // Debugging support | |
498 void print() const; | |
1716
be3f9c242c9d
6948538: CMS: BOT walkers can fall into object allocation and initialization cracks
ysr
parents:
1579
diff
changeset
|
499 void print_on(outputStream* st) const; |
0 | 500 void prepare_for_verify(); |
501 void verify(bool allow_dirty) const; | |
502 void verifyFreeLists() const PRODUCT_RETURN; | |
503 void verifyIndexedFreeLists() const; | |
504 void verifyIndexedFreeList(size_t size) const; | |
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3746
diff
changeset
|
505 // Verify that the given chunk is in the free lists: |
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3746
diff
changeset
|
506 // i.e. either the binary tree dictionary, the indexed free lists |
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3746
diff
changeset
|
507 // or the linear allocation block. |
0 | 508 bool verifyChunkInFreeLists(FreeChunk* fc) const; |
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3746
diff
changeset
|
509 // Verify that the given chunk is the linear allocation block |
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3746
diff
changeset
|
510 bool verify_chunk_is_linear_alloc_block(FreeChunk* fc) const; |
0 | 511 // Do some basic checks on the the free lists. |
4024
c08412904149
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list
ysr
parents:
3746
diff
changeset
|
512 void check_free_list_consistency() const PRODUCT_RETURN; |
0 | 513 |
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
514 // Printing support |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
515 void dump_at_safepoint_with_locks(CMSCollector* c, outputStream* st); |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
516 void print_indexed_free_lists(outputStream* st) const; |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
517 void print_dictionary_free_lists(outputStream* st) const; |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
518 void print_promo_info_blocks(outputStream* st) const; |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
519 |
0 | 520 NOT_PRODUCT ( |
521 void initializeIndexedFreeListArrayReturnedBytes(); | |
522 size_t sumIndexedFreeListArrayReturnedBytes(); | |
523 // Return the total number of chunks in the indexed free lists. | |
524 size_t totalCountInIndexedFreeLists() const; | |
525 // Return the total numberof chunks in the space. | |
526 size_t totalCount(); | |
527 ) | |
528 | |
529 // The census consists of counts of the quantities such as | |
530 // the current count of the free chunks, number of chunks | |
531 // created as a result of the split of a larger chunk or | |
532 // coalescing of smaller chucks, etc. The counts in the | |
533 // census is used to make decisions on splitting and | |
534 // coalescing of chunks during the sweep of garbage. | |
535 | |
536 // Print the statistics for the free lists. | |
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
537 void printFLCensus(size_t sweep_count) const; |
0 | 538 |
539 // Statistics functions | |
540 // Initialize census for lists before the sweep. | |
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
541 void beginSweepFLCensus(float inter_sweep_current, |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
542 float inter_sweep_estimate, |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
543 float intra_sweep_estimate); |
0 | 544 // Set the surplus for each of the free lists. |
545 void setFLSurplus(); | |
546 // Set the hint for each of the free lists. | |
547 void setFLHints(); | |
548 // Clear the census for each of the free lists. | |
549 void clearFLCensus(); | |
550 // Perform functions for the census after the end of the sweep. | |
12
6432c3bb6240
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
0
diff
changeset
|
551 void endSweepFLCensus(size_t sweep_count); |
0 | 552 // Return true if the count of free chunks is greater |
553 // than the desired number of free chunks. | |
554 bool coalOverPopulated(size_t size); | |
555 | |
556 // Record (for each size): | |
557 // | |
558 // split-births = #chunks added due to splits in (prev-sweep-end, | |
559 // this-sweep-start) | |
560 // split-deaths = #chunks removed for splits in (prev-sweep-end, | |
561 // this-sweep-start) | |
562 // num-curr = #chunks at start of this sweep | |
563 // num-prev = #chunks at end of previous sweep | |
564 // | |
565 // The above are quantities that are measured. Now define: | |
566 // | |
567 // num-desired := num-prev + split-births - split-deaths - num-curr | |
568 // | |
569 // Roughly, num-prev + split-births is the supply, | |
570 // split-deaths is demand due to other sizes | |
571 // and num-curr is what we have left. | |
572 // | |
573 // Thus, num-desired is roughly speaking the "legitimate demand" | |
574 // for blocks of this size and what we are striving to reach at the | |
575 // end of the current sweep. | |
576 // | |
577 // For a given list, let num-len be its current population. | |
578 // Define, for a free list of a given size: | |
579 // | |
580 // coal-overpopulated := num-len >= num-desired * coal-surplus | |
581 // (coal-surplus is set to 1.05, i.e. we allow a little slop when | |
582 // coalescing -- we do not coalesce unless we think that the current | |
583 // supply has exceeded the estimated demand by more than 5%). | |
584 // | |
585 // For the set of sizes in the binary tree, which is neither dense nor | |
586 // closed, it may be the case that for a particular size we have never | |
587 // had, or do not now have, or did not have at the previous sweep, | |
588 // chunks of that size. We need to extend the definition of | |
589 // coal-overpopulated to such sizes as well: | |
590 // | |
591 // For a chunk in/not in the binary tree, extend coal-overpopulated | |
592 // defined above to include all sizes as follows: | |
593 // | |
594 // . a size that is non-existent is coal-overpopulated | |
595 // . a size that has a num-desired <= 0 as defined above is | |
596 // coal-overpopulated. | |
597 // | |
598 // Also define, for a chunk heap-offset C and mountain heap-offset M: | |
599 // | |
600 // close-to-mountain := C >= 0.99 * M | |
601 // | |
602 // Now, the coalescing strategy is: | |
603 // | |
604 // Coalesce left-hand chunk with right-hand chunk if and | |
605 // only if: | |
606 // | |
607 // EITHER | |
608 // . left-hand chunk is of a size that is coal-overpopulated | |
609 // OR | |
610 // . right-hand chunk is close-to-mountain | |
611 void smallCoalBirth(size_t size); | |
612 void smallCoalDeath(size_t size); | |
613 void coalBirth(size_t size); | |
614 void coalDeath(size_t size); | |
615 void smallSplitBirth(size_t size); | |
616 void smallSplitDeath(size_t size); | |
617 void splitBirth(size_t size); | |
618 void splitDeath(size_t size); | |
619 void split(size_t from, size_t to1); | |
620 | |
621 double flsFrag() const; | |
622 }; | |
623 | |
624 // A parallel-GC-thread-local allocation buffer for allocation into a | |
625 // CompactibleFreeListSpace. | |
626 class CFLS_LAB : public CHeapObj { | |
627 // The space that this buffer allocates into. | |
628 CompactibleFreeListSpace* _cfls; | |
629 | |
630 // Our local free lists. | |
631 FreeList _indexedFreeList[CompactibleFreeListSpace::IndexSetSize]; | |
632 | |
633 // Initialized from a command-line arg. | |
634 | |
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
635 // Allocation statistics in support of dynamic adjustment of |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
636 // #blocks to claim per get_from_global_pool() call below. |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
637 static AdaptiveWeightedAverage |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
638 _blocks_to_claim [CompactibleFreeListSpace::IndexSetSize]; |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
639 static size_t _global_num_blocks [CompactibleFreeListSpace::IndexSetSize]; |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
640 static int _global_num_workers[CompactibleFreeListSpace::IndexSetSize]; |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
641 size_t _num_blocks [CompactibleFreeListSpace::IndexSetSize]; |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
642 |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
643 // Internal work method |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
644 void get_from_global_pool(size_t word_sz, FreeList* fl); |
0 | 645 |
646 public: | |
647 CFLS_LAB(CompactibleFreeListSpace* cfls); | |
648 | |
649 // Allocate and return a block of the given size, or else return NULL. | |
650 HeapWord* alloc(size_t word_sz); | |
651 | |
652 // Return any unused portions of the buffer to the global pool. | |
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
653 void retire(int tid); |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
654 |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
655 // Dynamic OldPLABSize sizing |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
656 static void compute_desired_plab_size(); |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
657 // When the settings are modified from default static initialization |
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
579
diff
changeset
|
658 static void modify_initialization(size_t n, unsigned wt); |
0 | 659 }; |
660 | |
661 size_t PromotionInfo::refillSize() const { | |
662 const size_t CMSSpoolBlockSize = 256; | |
663 const size_t sz = heap_word_size(sizeof(SpoolBlock) + sizeof(markOop) | |
664 * CMSSpoolBlockSize); | |
665 return CompactibleFreeListSpace::adjustObjectSize(sz); | |
666 } | |
1972 | 667 |
668 #endif // SHARE_VM_GC_IMPLEMENTATION_CONCURRENTMARKSWEEP_COMPACTIBLEFREELISTSPACE_HPP |