Mercurial > hg > truffle

comparison src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp @ 4024:c08412904149

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
7099817: CMS: +FLSVerifyLists +FLSVerifyIndexTable asserts: odd slot non-empty, chunk not on free list Summary: Suitably weaken asserts that were in each case a tad too strong; fix up some loose uses of parameters in code related to size-indexed free list table. Reviewed-by: jmasa, brutisso, stefank
author ysr
date Tue, 25 Oct 2011 20:15:41 -0700
parents 537a4053b0f9
children 5a5ed80bea5b
comparison
equal deleted inserted replaced
4023:c6a6e936dc68 4024:c08412904149
500 void prepare_for_verify(); 500 void prepare_for_verify();
501 void verify(bool allow_dirty) const; 501 void verify(bool allow_dirty) const;
502 void verifyFreeLists() const PRODUCT_RETURN; 502 void verifyFreeLists() const PRODUCT_RETURN;
503 void verifyIndexedFreeLists() const; 503 void verifyIndexedFreeLists() const;
504 void verifyIndexedFreeList(size_t size) const; 504 void verifyIndexedFreeList(size_t size) const;
505 // verify that the given chunk is in the free lists. 505 // Verify that the given chunk is in the free lists:
506 // i.e. either the binary tree dictionary, the indexed free lists
507 // or the linear allocation block.
506 bool verifyChunkInFreeLists(FreeChunk* fc) const; 508 bool verifyChunkInFreeLists(FreeChunk* fc) const;
509 // Verify that the given chunk is the linear allocation block
510 bool verify_chunk_is_linear_alloc_block(FreeChunk* fc) const;
507 // Do some basic checks on the the free lists. 511 // Do some basic checks on the the free lists.
508 void checkFreeListConsistency() const PRODUCT_RETURN; 512 void check_free_list_consistency() const PRODUCT_RETURN;
509 513
510 // Printing support 514 // Printing support
511 void dump_at_safepoint_with_locks(CMSCollector* c, outputStream* st); 515 void dump_at_safepoint_with_locks(CMSCollector* c, outputStream* st);
512 void print_indexed_free_lists(outputStream* st) const; 516 void print_indexed_free_lists(outputStream* st) const;
513 void print_dictionary_free_lists(outputStream* st) const; 517 void print_dictionary_free_lists(outputStream* st) const;