1.1 --- a/src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp Fri Oct 03 13:34:46 2014 -0700 1.2 +++ b/src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp Thu Nov 21 09:57:00 2013 -0800 1.3 @@ -172,6 +172,20 @@ 1.4 // list of size "word_sz", and must now be decremented. 1.5 void par_get_chunk_of_blocks(size_t word_sz, size_t n, AdaptiveFreeList<FreeChunk>* fl); 1.6 1.7 + // Used by par_get_chunk_of_blocks() for the chunks from the 1.8 + // indexed_free_lists. 1.9 + bool par_get_chunk_of_blocks_IFL(size_t word_sz, size_t n, AdaptiveFreeList<FreeChunk>* fl); 1.10 + 1.11 + // Used by par_get_chunk_of_blocks_dictionary() to get a chunk 1.12 + // evenly splittable into "n" "word_sz" chunks. Returns that 1.13 + // evenly splittable chunk. May split a larger chunk to get the 1.14 + // evenly splittable chunk. 1.15 + FreeChunk* get_n_way_chunk_to_split(size_t word_sz, size_t n); 1.16 + 1.17 + // Used by par_get_chunk_of_blocks() for the chunks from the 1.18 + // dictionary. 1.19 + void par_get_chunk_of_blocks_dictionary(size_t word_sz, size_t n, AdaptiveFreeList<FreeChunk>* fl); 1.20 + 1.21 // Allocation helper functions 1.22 // Allocate using a strategy that takes from the indexed free lists 1.23 // first. This allocation strategy assumes a companion sweeping