/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/memory/ |
H A D | binaryTreeDictionary.hpp | 40 template <class Chunk_t, class FreeList_t> class TreeChunk; 52 friend class TreeChunk<Chunk_t, FreeList_t>; 99 as_TreeList(TreeChunk<Chunk_t, FreeList_t>* tc); 103 TreeChunk<Chunk_t, FreeList_t>* head_as_TreeChunk(); 107 TreeChunk<Chunk_t, FreeList_t>* first_available(); 112 TreeChunk<Chunk_t, FreeList_t>* largest_address(); 125 void return_chunk_at_head(TreeChunk<Chunk_t, FreeList_t>* tc); 143 class TreeChunk : public Chunk_t { class 174 size_t TreeChunk<Chunk_t, FreeList_t>::_min_tree_chunk_size = sizeof(TreeChunk<Chunk_t, FreeList_t>… 206 TreeChunk<Chunk_t, FreeList_t>* remove_chunk_from_tree(TreeChunk<Chunk_t, FreeList_t>* tc); [all …]
|
H A D | binaryTreeDictionary.cpp | 48 TreeChunk<Chunk_t, FreeList_t>* TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(Chunk_t* fc) { in as_TreeChunk() 50 return (TreeChunk<Chunk_t, FreeList_t>*) fc; in as_TreeChunk() 55 TreeChunk<Chunk_t, FreeList_t>* nextTC = (TreeChunk<Chunk_t, FreeList_t>*)next(); in verify_tree_chunk_list() 91 TreeChunk<Chunk_t, FreeList_t>* tc = (TreeChunk<Chunk_t, FreeList_t>*) addr; in as_TreeList() 171 TreeChunk<Chunk_t, FreeList_t>* nextTC = TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(tc->next()); in remove_chunk_replace_if_needed() 343 TreeChunk<Chunk_t, FreeList_t>* retTC; in first_available() 360 TreeChunk<Chunk_t, FreeList_t>* retTC; in largest_address() 425 TreeChunk<Chunk_t, FreeList_t>* 529 TreeChunk<Chunk_t, FreeList_t>* 535 TreeChunk<Chunk_t, FreeList_t>* retTC; in remove_chunk_from_tree() [all …]
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/memory/ |
H A D | binaryTreeDictionary.hpp | 40 template <class Chunk_t, class FreeList_t> class TreeChunk; 52 friend class TreeChunk<Chunk_t, FreeList_t>; 99 as_TreeList(TreeChunk<Chunk_t, FreeList_t>* tc); 103 TreeChunk<Chunk_t, FreeList_t>* head_as_TreeChunk(); 107 TreeChunk<Chunk_t, FreeList_t>* first_available(); 112 TreeChunk<Chunk_t, FreeList_t>* largest_address(); 125 void return_chunk_at_head(TreeChunk<Chunk_t, FreeList_t>* tc); 143 class TreeChunk : public Chunk_t { class 174 size_t TreeChunk<Chunk_t, FreeList_t>::_min_tree_chunk_size = sizeof(TreeChunk<Chunk_t, FreeList_t>… 206 TreeChunk<Chunk_t, FreeList_t>* remove_chunk_from_tree(TreeChunk<Chunk_t, FreeList_t>* tc); [all …]
|
H A D | binaryTreeDictionary.cpp | 48 TreeChunk<Chunk_t, FreeList_t>* TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(Chunk_t* fc) { in as_TreeChunk() 50 return (TreeChunk<Chunk_t, FreeList_t>*) fc; in as_TreeChunk() 55 TreeChunk<Chunk_t, FreeList_t>* nextTC = (TreeChunk<Chunk_t, FreeList_t>*)next(); in verify_tree_chunk_list() 91 TreeChunk<Chunk_t, FreeList_t>* tc = (TreeChunk<Chunk_t, FreeList_t>*) addr; in as_TreeList() 171 TreeChunk<Chunk_t, FreeList_t>* nextTC = TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(tc->next()); in remove_chunk_replace_if_needed() 343 TreeChunk<Chunk_t, FreeList_t>* retTC; in first_available() 360 TreeChunk<Chunk_t, FreeList_t>* retTC; in largest_address() 425 TreeChunk<Chunk_t, FreeList_t>* 529 TreeChunk<Chunk_t, FreeList_t>* 535 TreeChunk<Chunk_t, FreeList_t>* retTC; in remove_chunk_from_tree() [all …]
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/memory/ |
H A D | binaryTreeDictionary.hpp | 42 template <class Chunk_t, class FreeList_t> class TreeChunk; 50 friend class TreeChunk<Chunk_t, FreeList_t>; 97 as_TreeList(TreeChunk<Chunk_t, FreeList_t>* tc); 101 TreeChunk<Chunk_t, FreeList_t>* head_as_TreeChunk(); 105 TreeChunk<Chunk_t, FreeList_t>* first_available(); 110 TreeChunk<Chunk_t, FreeList_t>* largest_address(); 123 void return_chunk_at_head(TreeChunk<Chunk_t, FreeList_t>* tc); 141 class TreeChunk : public Chunk_t { class 172 size_t TreeChunk<Chunk_t, FreeList_t>::_min_tree_chunk_size = sizeof(TreeChunk<Chunk_t, FreeList_t>… 206 TreeChunk<Chunk_t, FreeList_t>* remove_chunk_from_tree(TreeChunk<Chunk_t, FreeList_t>* tc); [all …]
|
H A D | binaryTreeDictionary.inline.hpp | 45 TreeChunk<Chunk_t, FreeList_t>* TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(Chunk_t* fc) { in as_TreeChunk() 47 return (TreeChunk<Chunk_t, FreeList_t>*) fc; in as_TreeChunk() 52 TreeChunk<Chunk_t, FreeList_t>* nextTC = (TreeChunk<Chunk_t, FreeList_t>*)next(); in verify_tree_chunk_list() 88 TreeChunk<Chunk_t, FreeList_t>* tc = (TreeChunk<Chunk_t, FreeList_t>*) addr; in as_TreeList() 124 TreeChunk<Chunk_t, FreeList_t>* nextTC = TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(tc->next()); in remove_chunk_replace_if_needed() 296 TreeChunk<Chunk_t, FreeList_t>* retTC; in first_available() 313 TreeChunk<Chunk_t, FreeList_t>* retTC; in largest_address() 378 TreeChunk<Chunk_t, FreeList_t>* 478 TreeChunk<Chunk_t, FreeList_t>* 484 TreeChunk<Chunk_t, FreeList_t>* retTC; in remove_chunk_from_tree() [all …]
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/memory/ |
H A D | binaryTreeDictionary.hpp | 42 template <class Chunk_t, class FreeList_t> class TreeChunk; 50 friend class TreeChunk<Chunk_t, FreeList_t>; 97 as_TreeList(TreeChunk<Chunk_t, FreeList_t>* tc); 101 TreeChunk<Chunk_t, FreeList_t>* head_as_TreeChunk(); 105 TreeChunk<Chunk_t, FreeList_t>* first_available(); 110 TreeChunk<Chunk_t, FreeList_t>* largest_address(); 123 void return_chunk_at_head(TreeChunk<Chunk_t, FreeList_t>* tc); 141 class TreeChunk : public Chunk_t { class 172 size_t TreeChunk<Chunk_t, FreeList_t>::_min_tree_chunk_size = sizeof(TreeChunk<Chunk_t, FreeList_t>… 206 TreeChunk<Chunk_t, FreeList_t>* remove_chunk_from_tree(TreeChunk<Chunk_t, FreeList_t>* tc); [all …]
|
H A D | binaryTreeDictionary.inline.hpp | 45 TreeChunk<Chunk_t, FreeList_t>* TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(Chunk_t* fc) { in as_TreeChunk() 47 return (TreeChunk<Chunk_t, FreeList_t>*) fc; in as_TreeChunk() 52 TreeChunk<Chunk_t, FreeList_t>* nextTC = (TreeChunk<Chunk_t, FreeList_t>*)next(); in verify_tree_chunk_list() 88 TreeChunk<Chunk_t, FreeList_t>* tc = (TreeChunk<Chunk_t, FreeList_t>*) addr; in as_TreeList() 124 TreeChunk<Chunk_t, FreeList_t>* nextTC = TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(tc->next()); in remove_chunk_replace_if_needed() 296 TreeChunk<Chunk_t, FreeList_t>* retTC; in first_available() 313 TreeChunk<Chunk_t, FreeList_t>* retTC; in largest_address() 378 TreeChunk<Chunk_t, FreeList_t>* 478 TreeChunk<Chunk_t, FreeList_t>* 484 TreeChunk<Chunk_t, FreeList_t>* retTC; in remove_chunk_from_tree() [all …]
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/memory/ |
H A D | binaryTreeDictionary.hpp | 42 template <class Chunk_t, class FreeList_t> class TreeChunk; 50 friend class TreeChunk<Chunk_t, FreeList_t>; 97 as_TreeList(TreeChunk<Chunk_t, FreeList_t>* tc); 101 TreeChunk<Chunk_t, FreeList_t>* head_as_TreeChunk(); 105 TreeChunk<Chunk_t, FreeList_t>* first_available(); 110 TreeChunk<Chunk_t, FreeList_t>* largest_address(); 123 void return_chunk_at_head(TreeChunk<Chunk_t, FreeList_t>* tc); 141 class TreeChunk : public Chunk_t { class 172 size_t TreeChunk<Chunk_t, FreeList_t>::_min_tree_chunk_size = sizeof(TreeChunk<Chunk_t, FreeList_t>… 206 TreeChunk<Chunk_t, FreeList_t>* remove_chunk_from_tree(TreeChunk<Chunk_t, FreeList_t>* tc); [all …]
|
H A D | binaryTreeDictionary.inline.hpp | 45 TreeChunk<Chunk_t, FreeList_t>* TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(Chunk_t* fc) { in as_TreeChunk() 47 return (TreeChunk<Chunk_t, FreeList_t>*) fc; in as_TreeChunk() 52 TreeChunk<Chunk_t, FreeList_t>* nextTC = (TreeChunk<Chunk_t, FreeList_t>*)next(); in verify_tree_chunk_list() 88 TreeChunk<Chunk_t, FreeList_t>* tc = (TreeChunk<Chunk_t, FreeList_t>*) addr; in as_TreeList() 124 TreeChunk<Chunk_t, FreeList_t>* nextTC = TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(tc->next()); in remove_chunk_replace_if_needed() 298 TreeChunk<Chunk_t, FreeList_t>* retTC; in first_available() 315 TreeChunk<Chunk_t, FreeList_t>* retTC; in largest_address() 380 TreeChunk<Chunk_t, FreeList_t>* 480 TreeChunk<Chunk_t, FreeList_t>* 486 TreeChunk<Chunk_t, FreeList_t>* retTC; in remove_chunk_from_tree() [all …]
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/memory/ |
H A D | binaryTreeDictionary.hpp | 42 template <class Chunk_t, class FreeList_t> class TreeChunk; 50 friend class TreeChunk<Chunk_t, FreeList_t>; 97 as_TreeList(TreeChunk<Chunk_t, FreeList_t>* tc); 101 TreeChunk<Chunk_t, FreeList_t>* head_as_TreeChunk(); 105 TreeChunk<Chunk_t, FreeList_t>* first_available(); 110 TreeChunk<Chunk_t, FreeList_t>* largest_address(); 123 void return_chunk_at_tail(TreeChunk<Chunk_t, FreeList_t>* tc); 140 class TreeChunk : public Chunk_t { class 171 size_t TreeChunk<Chunk_t, FreeList_t>::_min_tree_chunk_size = sizeof(TreeChunk<Chunk_t, FreeList_t>… 205 TreeChunk<Chunk_t, FreeList_t>* remove_chunk_from_tree(TreeChunk<Chunk_t, FreeList_t>* tc); [all …]
|
H A D | binaryTreeDictionary.inline.hpp | 45 TreeChunk<Chunk_t, FreeList_t>* TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(Chunk_t* fc) { in as_TreeChunk() 47 return (TreeChunk<Chunk_t, FreeList_t>*) fc; in as_TreeChunk() 52 TreeChunk<Chunk_t, FreeList_t>* nextTC = (TreeChunk<Chunk_t, FreeList_t>*)next(); in verify_tree_chunk_list() 88 TreeChunk<Chunk_t, FreeList_t>* tc = (TreeChunk<Chunk_t, FreeList_t>*) addr; in as_TreeList() 124 TreeChunk<Chunk_t, FreeList_t>* nextTC = TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(tc->next()); in remove_chunk_replace_if_needed() 269 TreeChunk<Chunk_t, FreeList_t>* retTC; in first_available() 286 TreeChunk<Chunk_t, FreeList_t>* retTC; in largest_address() 351 TreeChunk<Chunk_t, FreeList_t>* 451 TreeChunk<Chunk_t, FreeList_t>* 457 TreeChunk<Chunk_t, FreeList_t>* retTC; in remove_chunk_from_tree() [all …]
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/memory/ |
H A D | binaryTreeDictionary.hpp | 42 template <class Chunk_t, class FreeList_t> class TreeChunk; 50 friend class TreeChunk<Chunk_t, FreeList_t>; 97 as_TreeList(TreeChunk<Chunk_t, FreeList_t>* tc); 101 TreeChunk<Chunk_t, FreeList_t>* head_as_TreeChunk(); 105 TreeChunk<Chunk_t, FreeList_t>* first_available(); 110 TreeChunk<Chunk_t, FreeList_t>* largest_address(); 123 void return_chunk_at_tail(TreeChunk<Chunk_t, FreeList_t>* tc); 140 class TreeChunk : public Chunk_t { class 171 size_t TreeChunk<Chunk_t, FreeList_t>::_min_tree_chunk_size = sizeof(TreeChunk<Chunk_t, FreeList_t>… 205 TreeChunk<Chunk_t, FreeList_t>* remove_chunk_from_tree(TreeChunk<Chunk_t, FreeList_t>* tc); [all …]
|
H A D | binaryTreeDictionary.inline.hpp | 45 TreeChunk<Chunk_t, FreeList_t>* TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(Chunk_t* fc) { in as_TreeChunk() 47 return (TreeChunk<Chunk_t, FreeList_t>*) fc; in as_TreeChunk() 52 TreeChunk<Chunk_t, FreeList_t>* nextTC = (TreeChunk<Chunk_t, FreeList_t>*)next(); in verify_tree_chunk_list() 88 TreeChunk<Chunk_t, FreeList_t>* tc = (TreeChunk<Chunk_t, FreeList_t>*) addr; in as_TreeList() 124 TreeChunk<Chunk_t, FreeList_t>* nextTC = TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(tc->next()); in remove_chunk_replace_if_needed() 269 TreeChunk<Chunk_t, FreeList_t>* retTC; in first_available() 286 TreeChunk<Chunk_t, FreeList_t>* retTC; in largest_address() 351 TreeChunk<Chunk_t, FreeList_t>* 451 TreeChunk<Chunk_t, FreeList_t>* 457 TreeChunk<Chunk_t, FreeList_t>* retTC; in remove_chunk_from_tree() [all …]
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/memory/ |
H A D | binaryTreeDictionary.hpp | 42 template <class Chunk_t, class FreeList_t> class TreeChunk; 50 friend class TreeChunk<Chunk_t, FreeList_t>; 97 as_TreeList(TreeChunk<Chunk_t, FreeList_t>* tc); 101 TreeChunk<Chunk_t, FreeList_t>* head_as_TreeChunk(); 105 TreeChunk<Chunk_t, FreeList_t>* first_available(); 110 TreeChunk<Chunk_t, FreeList_t>* largest_address(); 123 void return_chunk_at_tail(TreeChunk<Chunk_t, FreeList_t>* tc); 140 class TreeChunk : public Chunk_t { class 171 size_t TreeChunk<Chunk_t, FreeList_t>::_min_tree_chunk_size = sizeof(TreeChunk<Chunk_t, FreeList_t>… 205 TreeChunk<Chunk_t, FreeList_t>* remove_chunk_from_tree(TreeChunk<Chunk_t, FreeList_t>* tc); [all …]
|
H A D | binaryTreeDictionary.inline.hpp | 45 TreeChunk<Chunk_t, FreeList_t>* TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(Chunk_t* fc) { in as_TreeChunk() 47 return (TreeChunk<Chunk_t, FreeList_t>*) fc; in as_TreeChunk() 52 TreeChunk<Chunk_t, FreeList_t>* nextTC = (TreeChunk<Chunk_t, FreeList_t>*)next(); in verify_tree_chunk_list() 88 TreeChunk<Chunk_t, FreeList_t>* tc = (TreeChunk<Chunk_t, FreeList_t>*) addr; in as_TreeList() 124 TreeChunk<Chunk_t, FreeList_t>* nextTC = TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(tc->next()); in remove_chunk_replace_if_needed() 269 TreeChunk<Chunk_t, FreeList_t>* retTC; in first_available() 286 TreeChunk<Chunk_t, FreeList_t>* retTC; in largest_address() 351 TreeChunk<Chunk_t, FreeList_t>* 451 TreeChunk<Chunk_t, FreeList_t>* 457 TreeChunk<Chunk_t, FreeList_t>* retTC; in remove_chunk_from_tree() [all …]
|
/dports/lang/rust/rustc-1.58.1-src/vendor/dlmalloc/src/ |
H A D | dlmalloc.rs | 16 treebins: [*mut TreeChunk; NTREEBINS], 51 struct TreeChunk { struct 53 child: [*mut TreeChunk; 2], argument 54 parent: *mut TreeChunk, argument 1578 Chunk::size(TreeChunk::chunk(left)) < Chunk::size(TreeChunk::chunk(right)) in check_tree() 1742 impl TreeChunk { impl 1743 unsafe fn leftmost_child(me: *mut TreeChunk) -> *mut TreeChunk { in leftmost_child() argument 1756 unsafe fn next(me: *mut TreeChunk) -> *mut TreeChunk { in next() argument 1757 (*TreeChunk::chunk(me)).next as *mut TreeChunk in next() 1760 unsafe fn prev(me: *mut TreeChunk) -> *mut TreeChunk { in prev() argument [all …]
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/memory/metaspace/ |
H A D | blockFreelist.hpp | 86 …static size_t min_dictionary_size() { return TreeChunk<Metablock, FreeList<Metablock> >::min_siz… in min_dictionary_size()
|
H A D | smallBlocks.hpp | 39 …const static uint _small_block_max_size = sizeof(TreeChunk<Metablock, FreeList<Metablock> >)/Heap…
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/memory/metaspace/ |
H A D | blockFreelist.hpp | 86 …static size_t min_dictionary_size() { return TreeChunk<Metablock, FreeList<Metablock> >::min_siz… in min_dictionary_size()
|
H A D | smallBlocks.hpp | 39 …const static uint _small_block_max_size = sizeof(TreeChunk<Metablock, FreeList<Metablock> >)/Heap…
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/memory/metaspace/ |
H A D | blockFreelist.hpp | 86 …static size_t min_dictionary_size() { return TreeChunk<Metablock, FreeList<Metablock> >::min_siz… in min_dictionary_size()
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/memory/metaspace/ |
H A D | blockFreelist.hpp | 86 …static size_t min_dictionary_size() { return TreeChunk<Metablock, FreeList<Metablock> >::min_siz… in min_dictionary_size()
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/memory/metaspace/ |
H A D | blockFreelist.hpp | 86 …static size_t min_dictionary_size() { return TreeChunk<Metablock, FreeList<Metablock> >::min_siz… in min_dictionary_size()
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/memory/metaspace/ |
H A D | blockFreelist.hpp | 86 …static size_t min_dictionary_size() { return TreeChunk<Metablock, FreeList<Metablock> >::min_siz… in min_dictionary_size()
|