Mercurial > hg > truffle
comparison src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.cpp @ 360:5d254928c888
Merge
author | ysr |
---|---|
date | Wed, 27 Aug 2008 11:20:46 -0700 |
parents | ebeb6490b814 1ee8caae33af |
children | e9be0e04635a |
comparison
equal
deleted
inserted
replaced
341:d60e4e6d7f72 | 360:5d254928c888 |
---|---|
788 } | 788 } |
789 return NULL; | 789 return NULL; |
790 } | 790 } |
791 | 791 |
792 | 792 |
793 HeapWord* CompactibleFreeListSpace::block_start(const void* p) const { | 793 HeapWord* CompactibleFreeListSpace::block_start_const(const void* p) const { |
794 NOT_PRODUCT(verify_objects_initialized()); | 794 NOT_PRODUCT(verify_objects_initialized()); |
795 return _bt.block_start(p); | 795 return _bt.block_start(p); |
796 } | 796 } |
797 | 797 |
798 HeapWord* CompactibleFreeListSpace::block_start_careful(const void* p) const { | 798 HeapWord* CompactibleFreeListSpace::block_start_careful(const void* p) const { |
2284 verifyIndexedFreeList(i); | 2284 verifyIndexedFreeList(i); |
2285 } | 2285 } |
2286 } | 2286 } |
2287 | 2287 |
2288 void CompactibleFreeListSpace::verifyIndexedFreeList(size_t size) const { | 2288 void CompactibleFreeListSpace::verifyIndexedFreeList(size_t size) const { |
2289 guarantee(size % 2 == 0, "Odd slots should be empty"); | 2289 FreeChunk* fc = _indexedFreeList[size].head(); |
2290 for (FreeChunk* fc = _indexedFreeList[size].head(); fc != NULL; | 2290 guarantee((size % 2 == 0) || fc == NULL, "Odd slots should be empty"); |
2291 fc = fc->next()) { | 2291 for (; fc != NULL; fc = fc->next()) { |
2292 guarantee(fc->size() == size, "Size inconsistency"); | 2292 guarantee(fc->size() == size, "Size inconsistency"); |
2293 guarantee(fc->isFree(), "!free?"); | 2293 guarantee(fc->isFree(), "!free?"); |
2294 guarantee(fc->next() == NULL || fc->next()->prev() == fc, "Broken list"); | 2294 guarantee(fc->next() == NULL || fc->next()->prev() == fc, "Broken list"); |
2295 } | 2295 } |
2296 } | 2296 } |