Mercurial > hg > graal-compiler
annotate src/share/vm/memory/binaryTreeDictionary.hpp @ 6885:685df3c6f84b
7045397: NPG: Add freelists to class loader arenas.
Reviewed-by: coleenp, stefank, jprovino, ohair
| author | jmasa |
|---|---|
| date | Tue, 18 Sep 2012 23:35:42 -0700 |
| parents | da91efe96a93 |
| children | 476718ea6759 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 6026 | 2 * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved. |
| 0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 * | |
| 5 * This code is free software; you can redistribute it and/or modify it | |
| 6 * under the terms of the GNU General Public License version 2 only, as | |
| 7 * published by the Free Software Foundation. | |
| 8 * | |
| 9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
| 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 12 * version 2 for more details (a copy is included in the LICENSE file that | |
| 13 * accompanied this code). | |
| 14 * | |
| 15 * You should have received a copy of the GNU General Public License version | |
| 16 * 2 along with this work; if not, write to the Free Software Foundation, | |
| 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
| 18 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1145
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1145
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1145
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 6026 | 25 #ifndef SHARE_VM_MEMORY_BINARYTREEDICTIONARY_HPP |
| 26 #define SHARE_VM_MEMORY_BINARYTREEDICTIONARY_HPP | |
| 1972 | 27 |
| 6026 | 28 #include "memory/freeBlockDictionary.hpp" |
| 29 #include "memory/freeList.hpp" | |
| 1972 | 30 |
| 0 | 31 /* |
| 32 * A binary tree based search structure for free blocks. | |
| 6026 | 33 * This is currently used in the Concurrent Mark&Sweep implementation, but |
| 34 * will be used for free block management for metadata. | |
| 0 | 35 */ |
| 36 | |
| 37 // A TreeList is a FreeList which can be used to maintain a | |
| 38 // binary tree of free lists. | |
| 39 | |
| 6885 | 40 template <class Chunk_t, template <class> class FreeList_t> class TreeChunk; |
| 41 template <class Chunk_t, template <class> class FreeList_t> class BinaryTreeDictionary; | |
| 42 template <class Chunk_t, template <class> class FreeList_t> class AscendTreeCensusClosure; | |
| 43 template <class Chunk_t, template <class> class FreeList_t> class DescendTreeCensusClosure; | |
| 44 template <class Chunk_t, template <class> class FreeList_t> class DescendTreeSearchClosure; | |
| 0 | 45 |
| 6885 | 46 template <class Chunk_t, template <class> class FreeList_t> |
| 47 class TreeList : public FreeList_t<Chunk_t> { | |
| 48 friend class TreeChunk<Chunk_t, FreeList_t>; | |
| 49 friend class BinaryTreeDictionary<Chunk_t, FreeList_t>; | |
| 50 friend class AscendTreeCensusClosure<Chunk_t, FreeList_t>; | |
| 51 friend class DescendTreeCensusClosure<Chunk_t, FreeList_t>; | |
| 52 friend class DescendTreeSearchClosure<Chunk_t, FreeList_t>; | |
| 6026 | 53 |
| 6885 | 54 TreeList<Chunk_t, FreeList_t>* _parent; |
| 55 TreeList<Chunk_t, FreeList_t>* _left; | |
| 56 TreeList<Chunk_t, FreeList_t>* _right; | |
| 0 | 57 |
| 58 protected: | |
| 6026 | 59 |
| 6885 | 60 TreeList<Chunk_t, FreeList_t>* parent() const { return _parent; } |
| 61 TreeList<Chunk_t, FreeList_t>* left() const { return _left; } | |
| 62 TreeList<Chunk_t, FreeList_t>* right() const { return _right; } | |
| 6026 | 63 |
| 6885 | 64 // Wrapper on call to base class, to get the template to compile. |
| 65 Chunk_t* head() const { return FreeList_t<Chunk_t>::head(); } | |
| 66 Chunk_t* tail() const { return FreeList_t<Chunk_t>::tail(); } | |
| 67 void set_head(Chunk_t* head) { FreeList_t<Chunk_t>::set_head(head); } | |
| 68 void set_tail(Chunk_t* tail) { FreeList_t<Chunk_t>::set_tail(tail); } | |
|
6119
a297b0e14605
7172226: HotSpot fails to build with GCC 4.7 because of stricter c++ argument dependent lookup
mgerdin
parents:
6028
diff
changeset
|
69 |
| 6885 | 70 size_t size() const { return FreeList_t<Chunk_t>::size(); } |
| 0 | 71 |
| 72 // Accessors for links in tree. | |
| 73 | |
| 6885 | 74 void set_left(TreeList<Chunk_t, FreeList_t>* tl) { |
| 0 | 75 _left = tl; |
| 76 if (tl != NULL) | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
77 tl->set_parent(this); |
| 0 | 78 } |
| 6885 | 79 void set_right(TreeList<Chunk_t, FreeList_t>* tl) { |
| 0 | 80 _right = tl; |
| 81 if (tl != NULL) | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
82 tl->set_parent(this); |
| 0 | 83 } |
| 6885 | 84 void set_parent(TreeList<Chunk_t, FreeList_t>* tl) { _parent = tl; } |
| 0 | 85 |
| 6885 | 86 void clear_left() { _left = NULL; } |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
87 void clear_right() { _right = NULL; } |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
88 void clear_parent() { _parent = NULL; } |
| 6885 | 89 void initialize() { clear_left(); clear_right(), clear_parent(); FreeList_t<Chunk_t>::initialize(); } |
| 0 | 90 |
| 91 // For constructing a TreeList from a Tree chunk or | |
| 92 // address and size. | |
| 6885 | 93 TreeList(); |
| 94 static TreeList<Chunk_t, FreeList_t>* | |
| 95 as_TreeList(TreeChunk<Chunk_t, FreeList_t>* tc); | |
| 96 static TreeList<Chunk_t, FreeList_t>* as_TreeList(HeapWord* addr, size_t size); | |
| 0 | 97 |
| 98 // Returns the head of the free list as a pointer to a TreeChunk. | |
| 6885 | 99 TreeChunk<Chunk_t, FreeList_t>* head_as_TreeChunk(); |
| 0 | 100 |
| 101 // Returns the first available chunk in the free list as a pointer | |
| 102 // to a TreeChunk. | |
| 6885 | 103 TreeChunk<Chunk_t, FreeList_t>* first_available(); |
| 0 | 104 |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
105 // Returns the block with the largest heap address amongst |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
106 // those in the list for this size; potentially slow and expensive, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
107 // use with caution! |
| 6885 | 108 TreeChunk<Chunk_t, FreeList_t>* largest_address(); |
| 109 | |
| 110 TreeList<Chunk_t, FreeList_t>* get_better_list( | |
| 111 BinaryTreeDictionary<Chunk_t, FreeList_t>* dictionary); | |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
112 |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
113 // remove_chunk_replace_if_needed() removes the given "tc" from the TreeList. |
| 0 | 114 // If "tc" is the first chunk in the list, it is also the |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
115 // TreeList that is the node in the tree. remove_chunk_replace_if_needed() |
| 0 | 116 // returns the possibly replaced TreeList* for the node in |
| 117 // the tree. It also updates the parent of the original | |
| 118 // node to point to the new node. | |
| 6885 | 119 TreeList<Chunk_t, FreeList_t>* remove_chunk_replace_if_needed(TreeChunk<Chunk_t, FreeList_t>* tc); |
| 0 | 120 // See FreeList. |
| 6885 | 121 void return_chunk_at_head(TreeChunk<Chunk_t, FreeList_t>* tc); |
| 122 void return_chunk_at_tail(TreeChunk<Chunk_t, FreeList_t>* tc); | |
| 0 | 123 }; |
| 124 | |
| 6026 | 125 // A TreeChunk is a subclass of a Chunk that additionally |
| 0 | 126 // maintains a pointer to the free list on which it is currently |
| 127 // linked. | |
| 128 // A TreeChunk is also used as a node in the binary tree. This | |
| 129 // allows the binary tree to be maintained without any additional | |
| 130 // storage (the free chunks are used). In a binary tree the first | |
| 131 // chunk in the free list is also the tree node. Note that the | |
| 132 // TreeChunk has an embedded TreeList for this purpose. Because | |
| 133 // the first chunk in the list is distinguished in this fashion | |
| 134 // (also is the node in the tree), it is the last chunk to be found | |
| 135 // on the free list for a node in the tree and is only removed if | |
| 136 // it is the last chunk on the free list. | |
| 137 | |
| 6885 | 138 template <class Chunk_t, template <class> class FreeList_t> |
| 139 class TreeChunk : public Chunk_t { | |
| 140 friend class TreeList<Chunk_t, FreeList_t>; | |
| 141 TreeList<Chunk_t, FreeList_t>* _list; | |
| 142 TreeList<Chunk_t, FreeList_t> _embedded_list; // if non-null, this chunk is on _list | |
| 143 | |
| 144 static size_t _min_tree_chunk_size; | |
| 145 | |
| 0 | 146 protected: |
| 6885 | 147 TreeList<Chunk_t, FreeList_t>* embedded_list() const { return (TreeList<Chunk_t, FreeList_t>*) &_embedded_list; } |
| 148 void set_embedded_list(TreeList<Chunk_t, FreeList_t>* v) { _embedded_list = *v; } | |
| 0 | 149 public: |
| 6885 | 150 TreeList<Chunk_t, FreeList_t>* list() { return _list; } |
| 151 void set_list(TreeList<Chunk_t, FreeList_t>* v) { _list = v; } | |
| 152 static TreeChunk<Chunk_t, FreeList_t>* as_TreeChunk(Chunk_t* fc); | |
| 0 | 153 // Initialize fields in a TreeChunk that should be |
| 154 // initialized when the TreeChunk is being added to | |
| 155 // a free list in the tree. | |
| 156 void initialize() { embedded_list()->initialize(); } | |
| 157 | |
| 6885 | 158 Chunk_t* next() const { return Chunk_t::next(); } |
| 159 Chunk_t* prev() const { return Chunk_t::prev(); } | |
| 160 size_t size() const volatile { return Chunk_t::size(); } | |
| 161 | |
| 162 static size_t min_size() { | |
| 163 return _min_tree_chunk_size; | |
| 164 } | |
| 6026 | 165 |
| 0 | 166 // debugging |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
167 void verify_tree_chunk_list() const; |
| 6885 | 168 void assert_is_mangled() const; |
| 0 | 169 }; |
| 170 | |
| 171 | |
| 6885 | 172 template <class Chunk_t, template <class> class FreeList_t> |
| 173 class BinaryTreeDictionary: public FreeBlockDictionary<Chunk_t> { | |
|
152
c70a245cad3a
6670684: 4/5 SA command universe did not print out CMS space information
dcubed
parents:
0
diff
changeset
|
174 friend class VMStructs; |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
175 size_t _total_size; |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
176 size_t _total_free_blocks; |
| 6885 | 177 TreeList<Chunk_t, FreeList_t>* _root; |
| 0 | 178 |
| 179 // private accessors | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
180 void set_total_size(size_t v) { _total_size = v; } |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
181 virtual void inc_total_size(size_t v); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
182 virtual void dec_total_size(size_t v); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
183 void set_total_free_blocks(size_t v) { _total_free_blocks = v; } |
| 6885 | 184 TreeList<Chunk_t, FreeList_t>* root() const { return _root; } |
| 185 void set_root(TreeList<Chunk_t, FreeList_t>* v) { _root = v; } | |
| 6026 | 186 |
| 187 // This field is added and can be set to point to the | |
| 188 // the Mutex used to synchronize access to the | |
| 189 // dictionary so that assertion checking can be done. | |
| 190 // For example it is set to point to _parDictionaryAllocLock. | |
| 191 NOT_PRODUCT(Mutex* _lock;) | |
| 0 | 192 |
| 193 // Remove a chunk of size "size" or larger from the tree and | |
| 194 // return it. If the chunk | |
| 195 // is the last chunk of that size, remove the node for that size | |
| 196 // from the tree. | |
| 6885 | 197 TreeChunk<Chunk_t, FreeList_t>* get_chunk_from_tree(size_t size, enum FreeBlockDictionary<Chunk_t>::Dither dither); |
| 0 | 198 // Remove this chunk from the tree. If the removal results |
| 199 // in an empty list in the tree, remove the empty list. | |
| 6885 | 200 TreeChunk<Chunk_t, FreeList_t>* remove_chunk_from_tree(TreeChunk<Chunk_t, FreeList_t>* tc); |
| 0 | 201 // Remove the node in the trees starting at tl that has the |
| 202 // minimum value and return it. Repair the tree as needed. | |
| 6885 | 203 TreeList<Chunk_t, FreeList_t>* remove_tree_minimum(TreeList<Chunk_t, FreeList_t>* tl); |
| 0 | 204 // Add this free chunk to the tree. |
| 6885 | 205 void insert_chunk_in_tree(Chunk_t* freeChunk); |
| 0 | 206 public: |
| 6026 | 207 |
| 6885 | 208 // Return a list of the specified size or NULL from the tree. |
| 209 // The list is not removed from the tree. | |
| 210 TreeList<Chunk_t, FreeList_t>* find_list (size_t size) const; | |
| 6026 | 211 |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
212 void verify_tree() const; |
| 0 | 213 // verify that the given chunk is in the tree. |
| 6885 | 214 bool verify_chunk_in_free_list(Chunk_t* tc) const; |
| 0 | 215 private: |
| 6885 | 216 void verify_tree_helper(TreeList<Chunk_t, FreeList_t>* tl) const; |
| 217 static size_t verify_prev_free_ptrs(TreeList<Chunk_t, FreeList_t>* tl); | |
| 0 | 218 |
| 219 // Returns the total number of chunks in the list. | |
| 6885 | 220 size_t total_list_length(TreeList<Chunk_t, FreeList_t>* tl) const; |
| 0 | 221 // Returns the total number of words in the chunks in the tree |
| 222 // starting at "tl". | |
| 6885 | 223 size_t total_size_in_tree(TreeList<Chunk_t, FreeList_t>* tl) const; |
| 0 | 224 // Returns the sum of the square of the size of each block |
| 225 // in the tree starting at "tl". | |
| 6885 | 226 double sum_of_squared_block_sizes(TreeList<Chunk_t, FreeList_t>* const tl) const; |
| 0 | 227 // Returns the total number of free blocks in the tree starting |
| 228 // at "tl". | |
| 6885 | 229 size_t total_free_blocks_in_tree(TreeList<Chunk_t, FreeList_t>* tl) const; |
| 230 size_t num_free_blocks() const; | |
| 231 size_t tree_height() const; | |
| 232 size_t tree_height_helper(TreeList<Chunk_t, FreeList_t>* tl) const; | |
| 233 size_t total_nodes_in_tree(TreeList<Chunk_t, FreeList_t>* tl) const; | |
| 234 size_t total_nodes_helper(TreeList<Chunk_t, FreeList_t>* tl) const; | |
| 0 | 235 |
| 236 public: | |
| 237 // Constructor | |
| 6885 | 238 BinaryTreeDictionary() : |
| 239 _total_size(0), _total_free_blocks(0), _root(0) {} | |
| 240 | |
| 241 BinaryTreeDictionary(MemRegion mr); | |
| 6026 | 242 |
| 243 // Public accessors | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
244 size_t total_size() const { return _total_size; } |
| 6885 | 245 size_t total_free_blocks() const { return _total_free_blocks; } |
| 0 | 246 |
| 247 // Reset the dictionary to the initial conditions with | |
| 248 // a single free chunk. | |
| 249 void reset(MemRegion mr); | |
| 250 void reset(HeapWord* addr, size_t size); | |
| 251 // Reset the dictionary to be empty. | |
| 252 void reset(); | |
| 253 | |
| 254 // Return a chunk of size "size" or greater from | |
| 255 // the tree. | |
| 6885 | 256 Chunk_t* get_chunk(size_t size, enum FreeBlockDictionary<Chunk_t>::Dither dither) { |
| 257 FreeBlockDictionary<Chunk_t>::verify_par_locked(); | |
| 258 Chunk_t* res = get_chunk_from_tree(size, dither); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
259 assert(res == NULL || res->is_free(), |
| 0 | 260 "Should be returning a free chunk"); |
| 6885 | 261 assert(dither != FreeBlockDictionary<Chunk_t>::exactly || |
| 262 res->size() == size, "Not correct size"); | |
| 0 | 263 return res; |
| 264 } | |
| 265 | |
| 6885 | 266 void return_chunk(Chunk_t* chunk) { |
| 267 FreeBlockDictionary<Chunk_t>::verify_par_locked(); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
268 insert_chunk_in_tree(chunk); |
| 0 | 269 } |
| 270 | |
| 6885 | 271 void remove_chunk(Chunk_t* chunk) { |
| 272 FreeBlockDictionary<Chunk_t>::verify_par_locked(); | |
| 273 remove_chunk_from_tree((TreeChunk<Chunk_t, FreeList_t>*)chunk); | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
274 assert(chunk->is_free(), "Should still be a free chunk"); |
| 0 | 275 } |
| 276 | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
277 size_t max_chunk_size() const; |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
278 size_t total_chunk_size(debug_only(const Mutex* lock)) const { |
| 0 | 279 debug_only( |
| 280 if (lock != NULL && lock->owned_by_self()) { | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
281 assert(total_size_in_tree(root()) == total_size(), |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
282 "_total_size inconsistency"); |
| 0 | 283 } |
| 284 ) | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
285 return total_size(); |
| 0 | 286 } |
| 287 | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
288 size_t min_size() const { |
| 6885 | 289 return TreeChunk<Chunk_t, FreeList_t>::min_size(); |
| 0 | 290 } |
| 291 | |
| 292 double sum_of_squared_block_sizes() const { | |
| 293 return sum_of_squared_block_sizes(root()); | |
| 294 } | |
| 295 | |
| 6885 | 296 Chunk_t* find_chunk_ends_at(HeapWord* target) const; |
| 0 | 297 |
| 298 // Find the list with size "size" in the binary tree and update | |
| 299 // the statistics in the list according to "split" (chunk was | |
| 300 // split or coalesce) and "birth" (chunk was added or removed). | |
| 6885 | 301 void dict_census_update(size_t size, bool split, bool birth); |
| 0 | 302 // Return true if the dictionary is overpopulated (more chunks of |
| 303 // this size than desired) for size "size". | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
304 bool coal_dict_over_populated(size_t size); |
| 0 | 305 // Methods called at the beginning of a sweep to prepare the |
| 306 // statistics for the sweep. | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
307 void begin_sweep_dict_census(double coalSurplusPercent, |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
308 float inter_sweep_current, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
309 float inter_sweep_estimate, |
|
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
310 float intra_sweep_estimate); |
| 0 | 311 // Methods called after the end of a sweep to modify the |
| 312 // statistics for the sweep. | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
313 void end_sweep_dict_census(double splitSurplusPercent); |
| 0 | 314 // Return the largest free chunk in the tree. |
| 6885 | 315 Chunk_t* find_largest_dict() const; |
| 0 | 316 // Accessors for statistics |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
317 void set_tree_surplus(double splitSurplusPercent); |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
318 void set_tree_hints(void); |
| 0 | 319 // Reset statistics for all the lists in the tree. |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
320 void clear_tree_census(void); |
| 0 | 321 // Print the statistcis for all the lists in the tree. Also may |
| 322 // print out summaries. | |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
323 void print_dict_census(void) const; |
|
1145
e018e6884bd8
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
196
diff
changeset
|
324 void print_free_lists(outputStream* st) const; |
| 0 | 325 |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
326 // For debugging. Returns the sum of the _returned_bytes for |
| 0 | 327 // all lists in the tree. |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
328 size_t sum_dict_returned_bytes() PRODUCT_RETURN0; |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
329 // Sets the _returned_bytes for all the lists in the tree to zero. |
|
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
330 void initialize_dict_returned_bytes() PRODUCT_RETURN; |
| 0 | 331 // For debugging. Return the total number of chunks in the dictionary. |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
332 size_t total_count() PRODUCT_RETURN0; |
| 0 | 333 |
|
6028
f69a5d43dc19
7164144: Fix variable naming style in freeBlockDictionary.* and binaryTreeDictionary*
jmasa
parents:
6026
diff
changeset
|
334 void report_statistics() const; |
| 0 | 335 |
| 336 void verify() const; | |
| 337 }; | |
| 1972 | 338 |
| 6026 | 339 #endif // SHARE_VM_MEMORY_BINARYTREEDICTIONARY_HPP |