< prev index next >

src/hotspot/share/memory/binaryTreeDictionary.inline.hpp

Print this page

        

*** 227,237 **** --- 227,240 ---- void TreeList<Chunk_t, FreeList_t>::return_chunk_at_tail(TreeChunk<Chunk_t, FreeList_t>* chunk) { assert(chunk != NULL, "returning NULL chunk"); assert(chunk->list() == this, "list should be set for chunk"); assert(tail() != NULL, "The tree list is embedded in the first chunk"); // which means that the list can never be empty. + if (FLSVerifyDictionary) { + // This is expensive for metaspace assert(!this->verify_chunk_in_free_list(chunk), "Double entry"); + } assert(head() == NULL || head()->prev() == NULL, "list invariant"); assert(tail() == NULL || tail()->next() == NULL, "list invariant"); Chunk_t* fc = tail(); fc->link_after(chunk);
*** 251,261 **** --- 254,267 ---- template <class Chunk_t, class FreeList_t> void TreeList<Chunk_t, FreeList_t>::return_chunk_at_head(TreeChunk<Chunk_t, FreeList_t>* chunk) { assert(chunk->list() == this, "list should be set for chunk"); assert(head() != NULL, "The tree list is embedded in the first chunk"); assert(chunk != NULL, "returning NULL chunk"); + if (FLSVerifyDictionary) { + // This is expensive for metaspace assert(!this->verify_chunk_in_free_list(chunk), "Double entry"); + } assert(head() == NULL || head()->prev() == NULL, "list invariant"); assert(tail() == NULL || tail()->next() == NULL, "list invariant"); Chunk_t* fc = head()->next(); if (fc != NULL) {
< prev index next >