1.1 --- a/src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp Thu Mar 29 19:46:24 2012 -0700
1.2 +++ b/src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp Wed Apr 25 09:55:55 2012 -0700
1.3 @@ -499,7 +499,7 @@
1.4 // Verify that the given chunk is in the free lists:
1.5 // i.e. either the binary tree dictionary, the indexed free lists
1.6 // or the linear allocation block.
1.7 - bool verifyChunkInFreeLists(FreeChunk* fc) const;
1.8 + bool verify_chunk_in_free_list(FreeChunk* fc) const;
1.9 // Verify that the given chunk is the linear allocation block
1.10 bool verify_chunk_is_linear_alloc_block(FreeChunk* fc) const;
1.11 // Do some basic checks on the the free lists.
1.12 @@ -608,7 +608,7 @@
1.13 void coalDeath(size_t size);
1.14 void smallSplitBirth(size_t size);
1.15 void smallSplitDeath(size_t size);
1.16 - void splitBirth(size_t size);
1.17 + void split_birth(size_t size);
1.18 void splitDeath(size_t size);
1.19 void split(size_t from, size_t to1);
1.20
