Mercurial > hg > truffle

comparison src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.cpp @ 17695:ab36007d6358

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
8034171: Remove use of template template parameters from binaryTreeDictionary. Reviewed-by: mgerdin, jmasa Contributed-by: matthias.baesken@sap.com
author goetz
date Tue, 11 Feb 2014 09:34:50 +0100
parents 71180a6e5080
children bbfbe9b06038
comparison
equal deleted inserted replaced
17694:cc3f124c6eae 17695:ab36007d6358
1702 // adjust _unallocated_block downward, as necessary 1702 // adjust _unallocated_block downward, as necessary
1703 _bt.freed((HeapWord*)chunk, size); 1703 _bt.freed((HeapWord*)chunk, size);
1704 _dictionary->return_chunk(chunk); 1704 _dictionary->return_chunk(chunk);
1705 #ifndef PRODUCT 1705 #ifndef PRODUCT
1706 if (CMSCollector::abstract_state() != CMSCollector::Sweeping) { 1706 if (CMSCollector::abstract_state() != CMSCollector::Sweeping) {
1707 TreeChunk<FreeChunk, AdaptiveFreeList>* tc = TreeChunk<FreeChunk, AdaptiveFreeList>::as_TreeChunk(chunk); 1707 TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >* tc = TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >::as_TreeChunk(chunk);
1708 TreeList<FreeChunk, AdaptiveFreeList>* tl = tc->list(); 1708 TreeList<FreeChunk, AdaptiveFreeList<FreeChunk> >* tl = tc->list();
1709 tl->verify_stats(); 1709 tl->verify_stats();
1710 } 1710 }
1711 #endif // PRODUCT 1711 #endif // PRODUCT
1712 } 1712 }
1713 1713
2513 guarantee(n == num, "Incorrect count"); 2513 guarantee(n == num, "Incorrect count");
2514 } 2514 }
2515 2515
2516 #ifndef PRODUCT 2516 #ifndef PRODUCT
2517 void CompactibleFreeListSpace::check_free_list_consistency() const { 2517 void CompactibleFreeListSpace::check_free_list_consistency() const {
2518 assert((TreeChunk<FreeChunk, AdaptiveFreeList>::min_size() <= IndexSetSize), 2518 assert((TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >::min_size() <= IndexSetSize),
2519 "Some sizes can't be allocated without recourse to" 2519 "Some sizes can't be allocated without recourse to"
2520 " linear allocation buffers"); 2520 " linear allocation buffers");
2521 assert((TreeChunk<FreeChunk, AdaptiveFreeList>::min_size()*HeapWordSize == sizeof(TreeChunk<FreeChunk, AdaptiveFreeList>)), 2521 assert((TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >::min_size()*HeapWordSize == sizeof(TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >)),
2522 "else MIN_TREE_CHUNK_SIZE is wrong"); 2522 "else MIN_TREE_CHUNK_SIZE is wrong");
2523 assert(IndexSetStart != 0, "IndexSetStart not initialized"); 2523 assert(IndexSetStart != 0, "IndexSetStart not initialized");
2524 assert(IndexSetStride != 0, "IndexSetStride not initialized"); 2524 assert(IndexSetStride != 0, "IndexSetStride not initialized");
2525 } 2525 }
2526 #endif 2526 #endif