vm/memory/binaryTreeDictionary.cpp

71 TreeList<Chunk_t, FreeList_t>::TreeList() : _parent(NULL),
75 TreeList<Chunk_t, FreeList_t>*
76 TreeList<Chunk_t, FreeList_t>::as_TreeList(TreeChunk<Chunk_t,FreeList_t>* tc) {
80   TreeList<Chunk_t, FreeList_t>* tl = tc->embedded_list();
92 TreeList<Chunk_t, FreeList_t>*
93 TreeList<Chunk_t, FreeList_t>::as_TreeList(HeapWord* addr, size_t size) {
104   TreeList<Chunk_t, FreeList_t>* tl = TreeList<Chunk_t, FreeList_t>::as_TreeList(tc);
115 TreeList<FreeChunk, AdaptiveFreeList<FreeChunk> >*
116 TreeList<FreeChunk, AdaptiveFreeList<FreeChunk> >::get_better_list(
122   TreeList<FreeChunk, ::AdaptiveFreeList<FreeChunk> >* curTL = this;
125     TreeList<FreeChunk, ::AdaptiveFreeList<FreeChunk> >* hintTL = this;
154 TreeList<Chunk_t, FreeList_t>*
155 TreeList<Chunk_t, FreeList_t>::get_better_list(
161 TreeList<Chunk_t, FreeList_t>* TreeList<Chunk_t, FreeList_t>::remove_chunk_replace_if_needed(TreeChunk<Chunk_t, FreeList_t>* tc) {
163   TreeList<Chunk_t, FreeList_t>* retTL = this;
179     // The "getChunk..." functions for a TreeList<Chunk_t, FreeList_t> will not return the
188     // TreeList<Chunk_t, FreeList_t> from the first chunk to the next chunk and update all
189     // the TreeList<Chunk_t, FreeList_t> pointers in the chunks in the list.
206       // Fix the parent to point to the new TreeList<Chunk_t, FreeList_t>.
237   // Below this point the embedded TreeList<Chunk_t, FreeList_t> being used for the
239   // TreeList<Chunk_t, FreeList_t>*.
277 void TreeList<Chunk_t, FreeList_t>::return_chunk_at_tail(TreeChunk<Chunk_t, FreeList_t>* chunk) {
299 // because the TreeList<Chunk_t, FreeList_t> is embedded in the first TreeChunk<Chunk_t, FreeList_t> in the
302 void TreeList<Chunk_t, FreeList_t>::return_chunk_at_head(TreeChunk<Chunk_t, FreeList_t>* chunk) {
336 TreeChunk<Chunk_t, FreeList_t>* TreeList<Chunk_t, FreeList_t>::head_as_TreeChunk() {
343 TreeChunk<Chunk_t, FreeList_t>* TreeList<Chunk_t, FreeList_t>::first_available() {
360 TreeChunk<Chunk_t, FreeList_t>* TreeList<Chunk_t, FreeList_t>::largest_address() {
408   set_root(TreeList<Chunk_t, FreeList_t>::as_TreeList(mr.start(), mr.word_size()));
433   TreeList<Chunk_t, FreeList_t> *curTL, *prevTL;
487 TreeList<Chunk_t, FreeList_t>* BinaryTreeDictionary<Chunk_t, FreeList_t>::find_list(size_t size) const {
488   TreeList<Chunk_t, FreeList_t>* curTL;
508   TreeList<Chunk_t, FreeList_t>* tl = find_list(size);
518   TreeList<Chunk_t, FreeList_t> *curTL = root();
537   TreeList<Chunk_t, FreeList_t> *newTL, *parentTL;
539   TreeList<Chunk_t, FreeList_t>* tl = tc->list();
559   // (TreeList<Chunk_t, FreeList_t>*) in the tree.  If the node is the root, update it.
560   TreeList<Chunk_t, FreeList_t>* replacementTL = tl->remove_chunk_replace_if_needed(tc);
574       TreeList<Chunk_t, FreeList_t>* rhl = replacementTL->head_as_TreeChunk()->list();
575       TreeList<Chunk_t, FreeList_t>* rtl =
673 TreeList<Chunk_t, FreeList_t>* BinaryTreeDictionary<Chunk_t, FreeList_t>::remove_tree_minimum(TreeList<Chunk_t, FreeList_t>* tl) {
676   TreeList<Chunk_t, FreeList_t>* curTL = tl;
680     TreeList<Chunk_t, FreeList_t>* parentTL = curTL->parent();
709   TreeList<Chunk_t, FreeList_t> *curTL, *prevTL;
736   // TreeList<Chunk_t, FreeList_t> should be unused at this point.
744     TreeList<Chunk_t, FreeList_t>* newTL = TreeList<Chunk_t, FreeList_t>::as_TreeList(tc);
776   TreeList<Chunk_t, FreeList_t>* tc = root();
783 size_t BinaryTreeDictionary<Chunk_t, FreeList_t>::total_list_length(TreeList<Chunk_t, FreeList_t>* tl) const {
796 size_t BinaryTreeDictionary<Chunk_t, FreeList_t>::total_size_in_tree(TreeList<Chunk_t, FreeList_t>* tl) const {
805 double BinaryTreeDictionary<Chunk_t, FreeList_t>::sum_of_squared_block_sizes(TreeList<Chunk_t, FreeList_t>* const tl) const {
817 size_t BinaryTreeDictionary<Chunk_t, FreeList_t>::total_free_blocks_in_tree(TreeList<Chunk_t, FreeList_t>* tl) const {
833 size_t BinaryTreeDictionary<Chunk_t, FreeList_t>::tree_height_helper(TreeList<Chunk_t, FreeList_t>* tl) const {
846 size_t BinaryTreeDictionary<Chunk_t, FreeList_t>::total_nodes_helper(TreeList<Chunk_t, FreeList_t>* tl) const {
855 size_t BinaryTreeDictionary<Chunk_t, FreeList_t>::total_nodes_in_tree(TreeList<Chunk_t, FreeList_t>* tl) const {
865   TreeList<FreeChunk, AdaptiveFreeList<FreeChunk> >* nd = find_list(size);
905   TreeList<FreeChunk, AdaptiveFreeList<FreeChunk> >* list_of_size = find_list(size);
923   virtual void do_tree(TreeList<Chunk_t, FreeList_t>* tl) = 0;
929   void do_tree(TreeList<Chunk_t, FreeList_t>* tl) {
941   void do_tree(TreeList<Chunk_t, FreeList_t>* tl) {
990   virtual bool do_tree(TreeList<Chunk_t, FreeList_t>* tl) = 0;
997   bool do_tree(TreeList<Chunk_t, FreeList_t>* tl) {
1011   bool do_tree(TreeList<Chunk_t, FreeList_t>* tl) {
1352 size_t BinaryTreeDictionary<Chunk_t, FreeList_t>::verify_prev_free_ptrs(TreeList<Chunk_t, FreeList_t>* tl) {
1366 void BinaryTreeDictionary<Chunk_t, FreeList_t>::verify_tree_helper(TreeList<Chunk_t, FreeList_t>* tl) const {
1400 template class TreeList<Metablock, FreeList<Metablock> >;
1404 template class TreeList<Metachunk, FreeList<Metachunk> >;
1411 template class TreeList<FreeChunk, AdaptiveFreeList<FreeChunk> >;