Searched refs:BinaryTreeDictionary (Results 1 - 6 of 6) sorted by relevance
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/memory/ |
H A D | BinaryTreeDictionary.java | 2 * @(#)BinaryTreeDictionary.java 33 public class BinaryTreeDictionary extends VMObject { class in inherits:VMObject 43 Type type = db.lookupType("BinaryTreeDictionary"); 56 public BinaryTreeDictionary(Address addr) { method in class:BinaryTreeDictionary
|
H A D | CompactibleFreeListSpace.java | 120 BinaryTreeDictionary bfbd = (BinaryTreeDictionary) VMObjectFactory.newObject(BinaryTreeDictionary.class,
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | binaryTreeDictionary.cpp | 64 assert(tc->size() >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "Chunk is too small for a TreeChunk"); 85 assert(size >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "Chunk is too small for a TreeChunk"); 315 BinaryTreeDictionary<Chunk>::BinaryTreeDictionary(bool adaptive_freelists, bool splay) : function in class:BinaryTreeDictionary 320 BinaryTreeDictionary<Chunk>::BinaryTreeDictionary(MemRegion mr, function in class:BinaryTreeDictionary 325 assert(mr.word_size() >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "minimum chunk size"); 337 void BinaryTreeDictionary<Chunk>::inc_total_size(size_t inc) { 342 void BinaryTreeDictionary<Chunk>::dec_total_size(size_t dec) { 347 void BinaryTreeDictionary<Chun [all...] |
H A D | binaryTreeDictionary.hpp | 41 template <class Chunk> class BinaryTreeDictionary; 49 friend class BinaryTreeDictionary<Chunk>; 164 class BinaryTreeDictionary: public FreeBlockDictionary<Chunk> { class in inherits:FreeBlockDictionary 237 BinaryTreeDictionary(bool adaptive_freelists, bool splay = false); 238 BinaryTreeDictionary(MemRegion mr, bool adaptive_freelists, bool splay = false);
|
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/ |
H A D | vmStructs_cms.hpp | 49 nonstatic_field(BinaryTreeDictionary<FreeChunk>,_total_size, size_t) \ 73 declare_toplevel_type(BinaryTreeDictionary<FreeChunk>*) \ 79 declare_type(BinaryTreeDictionary<FreeChunk>, FreeBlockDictionary<FreeChunk>)
|
H A D | compactibleFreeListSpace.cpp | 108 " default BinaryTreeDictionary implementation instead."); 110 _dictionary = new BinaryTreeDictionary<FreeChunk>(mr, use_adaptive_freelists); 2539 assert(BinaryTreeDictionary<FreeChunk>::min_tree_chunk_size*HeapWordSize == sizeof(TreeChunk<FreeChunk>),
|
Completed in 34 milliseconds