1.1 --- a/src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp Sun Oct 23 23:06:06 2011 -0700 1.2 +++ b/src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp Tue Oct 25 20:15:41 2011 -0700 1.3 @@ -502,10 +502,14 @@ 1.4 void verifyFreeLists() const PRODUCT_RETURN; 1.5 void verifyIndexedFreeLists() const; 1.6 void verifyIndexedFreeList(size_t size) const; 1.7 - // verify that the given chunk is in the free lists. 1.8 + // Verify that the given chunk is in the free lists: 1.9 + // i.e. either the binary tree dictionary, the indexed free lists 1.10 + // or the linear allocation block. 1.11 bool verifyChunkInFreeLists(FreeChunk* fc) const; 1.12 + // Verify that the given chunk is the linear allocation block 1.13 + bool verify_chunk_is_linear_alloc_block(FreeChunk* fc) const; 1.14 // Do some basic checks on the the free lists. 1.15 - void checkFreeListConsistency() const PRODUCT_RETURN; 1.16 + void check_free_list_consistency() const PRODUCT_RETURN; 1.17 1.18 // Printing support 1.19 void dump_at_safepoint_with_locks(CMSCollector* c, outputStream* st);