< prev index next >
src/hotspot/share/memory/binaryTreeDictionary.hpp
Print this page
rev 50187 : imported patch metaspace-split
@@ -24,10 +24,13 @@
#ifndef SHARE_VM_MEMORY_BINARYTREEDICTIONARY_HPP
#define SHARE_VM_MEMORY_BINARYTREEDICTIONARY_HPP
#include "memory/freeList.hpp"
+#include "memory/memRegion.hpp"
+
+class Mutex;
/*
* A binary tree based search structure for free blocks.
* This is currently used in the Concurrent Mark&Sweep implementation, but
* will be used for free block management for metadata.
@@ -274,19 +277,11 @@
remove_chunk_from_tree((TreeChunk<Chunk_t, FreeList_t>*)chunk);
assert(chunk->is_free(), "Should still be a free chunk");
}
size_t max_chunk_size() const;
- size_t total_chunk_size(debug_only(const Mutex* lock)) const {
- debug_only(
- if (lock != NULL && lock->owned_by_self()) {
- assert(total_size_in_tree(root()) == total_size(),
- "_total_size inconsistency");
- }
- )
- return total_size();
- }
+ inline size_t total_chunk_size(debug_only(const Mutex* lock)) const;
size_t min_size() const {
return TreeChunk<Chunk_t, FreeList_t>::min_size();
}
< prev index next >