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; |