Searched refs:TreeChunk (Results 1 - 3 of 3) sorted by relevance

/openjdk7/hotspot/src/share/vm/memory/
H A DbinaryTreeDictionary.hpp40 template <class Chunk> class TreeChunk;
48 friend class TreeChunk<Chunk>;
97 static TreeList<Chunk>* as_TreeList(TreeChunk<Chunk>* tc);
100 // Returns the head of the free list as a pointer to a TreeChunk.
101 TreeChunk<Chunk>* head_as_TreeChunk();
104 // to a TreeChunk.
105 TreeChunk<Chunk>* first_available();
110 TreeChunk<Chunk>* largest_address();
118 TreeList<Chunk>* remove_chunk_replace_if_needed(TreeChunk<Chunk>* tc);
120 void return_chunk_at_head(TreeChunk<Chun
138 class TreeChunk : public Chunk { class in inherits:Chunk
[all...]
H A DbinaryTreeDictionary.cpp41 TreeChunk<Chunk>* TreeChunk<Chunk>::as_TreeChunk(Chunk* fc) {
43 return (TreeChunk<Chunk>*) fc;
47 void TreeChunk<Chunk>::verify_tree_chunk_list() const {
48 TreeChunk<Chunk>* nextTC = (TreeChunk<Chunk>*)next();
62 TreeList<Chunk>* TreeList<Chunk>::as_TreeList(TreeChunk<Chunk>* tc) {
64 assert(tc->size() >= BinaryTreeDictionary<Chunk>::min_tree_chunk_size, "Chunk is too small for a TreeChunk");
84 TreeChunk<Chunk>* tc = (TreeChunk<Chun
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/concurrentMarkSweep/
H A DcompactibleFreeListSpace.cpp1723 TreeChunk<FreeChunk>::as_TreeChunk(chunk)->list()->verify_stats();
2539 assert(BinaryTreeDictionary<FreeChunk>::min_tree_chunk_size*HeapWordSize == sizeof(TreeChunk<FreeChunk>),

Completed in 43 milliseconds