Wed, 26 Jun 2013 16:58:37 +0200
8013590: NPG: Add a memory pool MXBean for Metaspace
Reviewed-by: jmasa, mgerdin
duke@435 | 1 | /* |
mikael@4153 | 2 | * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
jmasa@3730 | 25 | #ifndef SHARE_VM_MEMORY_FREELIST_HPP |
jmasa@3730 | 26 | #define SHARE_VM_MEMORY_FREELIST_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "gc_implementation/shared/allocationStats.hpp" |
stefank@2314 | 29 | |
duke@435 | 30 | class CompactibleFreeListSpace; |
duke@435 | 31 | |
jmasa@3730 | 32 | // A class for maintaining a free list of Chunk's. The FreeList |
duke@435 | 33 | // maintains a the structure of the list (head, tail, etc.) plus |
duke@435 | 34 | // statistics for allocations from the list. The links between items |
duke@435 | 35 | // are not part of FreeList. The statistics are |
jmasa@3730 | 36 | // used to make decisions about coalescing Chunk's when they |
duke@435 | 37 | // are swept during collection. |
duke@435 | 38 | // |
duke@435 | 39 | // See the corresponding .cpp file for a description of the specifics |
duke@435 | 40 | // for that implementation. |
duke@435 | 41 | |
duke@435 | 42 | class Mutex; |
duke@435 | 43 | |
jmasa@4196 | 44 | template <class Chunk_t> |
duke@435 | 45 | class FreeList VALUE_OBJ_CLASS_SPEC { |
duke@435 | 46 | friend class CompactibleFreeListSpace; |
dcubed@587 | 47 | friend class VMStructs; |
ysr@1580 | 48 | |
ysr@1580 | 49 | private: |
jmasa@4196 | 50 | Chunk_t* _head; // Head of list of free chunks |
jmasa@4196 | 51 | Chunk_t* _tail; // Tail of list of free chunks |
ysr@1580 | 52 | size_t _size; // Size in Heap words of each chunk |
duke@435 | 53 | ssize_t _count; // Number of entries in list |
duke@435 | 54 | |
jmasa@4196 | 55 | protected: |
duke@435 | 56 | |
duke@435 | 57 | #ifdef ASSERT |
duke@435 | 58 | Mutex* _protecting_lock; |
duke@435 | 59 | #endif |
duke@435 | 60 | |
duke@435 | 61 | // Asserts false if the protecting lock (if any) is not held. |
duke@435 | 62 | void assert_proper_lock_protection_work() const PRODUCT_RETURN; |
duke@435 | 63 | void assert_proper_lock_protection() const { |
duke@435 | 64 | #ifdef ASSERT |
duke@435 | 65 | if (_protecting_lock != NULL) |
duke@435 | 66 | assert_proper_lock_protection_work(); |
duke@435 | 67 | #endif |
duke@435 | 68 | } |
duke@435 | 69 | |
ysr@1580 | 70 | void increment_count() { |
ysr@1580 | 71 | _count++; |
ysr@1580 | 72 | } |
ysr@1580 | 73 | |
duke@435 | 74 | void decrement_count() { |
duke@435 | 75 | _count--; |
ysr@447 | 76 | assert(_count >= 0, "Count should not be negative"); |
ysr@447 | 77 | } |
duke@435 | 78 | |
duke@435 | 79 | public: |
duke@435 | 80 | // Constructor |
duke@435 | 81 | // Construct a list without any entries. |
duke@435 | 82 | FreeList(); |
duke@435 | 83 | |
jmasa@4196 | 84 | // Do initialization |
jmasa@4196 | 85 | void initialize(); |
jmasa@4196 | 86 | |
jmasa@4196 | 87 | // Reset the head, tail, and count of a free list. |
jmasa@4196 | 88 | void reset(); |
duke@435 | 89 | |
duke@435 | 90 | // Declare the current free list to be protected by the given lock. |
duke@435 | 91 | #ifdef ASSERT |
jmasa@4196 | 92 | Mutex* protecting_lock() const { return _protecting_lock; } |
jmasa@4196 | 93 | void set_protecting_lock(Mutex* v) { |
jmasa@4196 | 94 | _protecting_lock = v; |
duke@435 | 95 | } |
duke@435 | 96 | #endif |
duke@435 | 97 | |
duke@435 | 98 | // Accessors. |
jmasa@4196 | 99 | Chunk_t* head() const { |
duke@435 | 100 | assert_proper_lock_protection(); |
duke@435 | 101 | return _head; |
duke@435 | 102 | } |
jmasa@4196 | 103 | void set_head(Chunk_t* v) { |
duke@435 | 104 | assert_proper_lock_protection(); |
duke@435 | 105 | _head = v; |
duke@435 | 106 | assert(!_head || _head->size() == _size, "bad chunk size"); |
duke@435 | 107 | } |
duke@435 | 108 | // Set the head of the list and set the prev field of non-null |
duke@435 | 109 | // values to NULL. |
jmasa@4196 | 110 | void link_head(Chunk_t* v); |
duke@435 | 111 | |
jmasa@4196 | 112 | Chunk_t* tail() const { |
duke@435 | 113 | assert_proper_lock_protection(); |
duke@435 | 114 | return _tail; |
duke@435 | 115 | } |
jmasa@4196 | 116 | void set_tail(Chunk_t* v) { |
duke@435 | 117 | assert_proper_lock_protection(); |
duke@435 | 118 | _tail = v; |
duke@435 | 119 | assert(!_tail || _tail->size() == _size, "bad chunk size"); |
duke@435 | 120 | } |
duke@435 | 121 | // Set the tail of the list and set the next field of non-null |
duke@435 | 122 | // values to NULL. |
jmasa@4196 | 123 | void link_tail(Chunk_t* v) { |
duke@435 | 124 | assert_proper_lock_protection(); |
duke@435 | 125 | set_tail(v); |
duke@435 | 126 | if (v != NULL) { |
jmasa@3732 | 127 | v->clear_next(); |
duke@435 | 128 | } |
duke@435 | 129 | } |
duke@435 | 130 | |
duke@435 | 131 | // No locking checks in read-accessors: lock-free reads (only) are benign. |
duke@435 | 132 | // Readers are expected to have the lock if they are doing work that |
duke@435 | 133 | // requires atomicity guarantees in sections of code. |
duke@435 | 134 | size_t size() const { |
duke@435 | 135 | return _size; |
duke@435 | 136 | } |
duke@435 | 137 | void set_size(size_t v) { |
duke@435 | 138 | assert_proper_lock_protection(); |
duke@435 | 139 | _size = v; |
duke@435 | 140 | } |
jmasa@4196 | 141 | ssize_t count() const { return _count; } |
jmasa@4196 | 142 | void set_count(ssize_t v) { _count = v;} |
duke@435 | 143 | |
jmasa@4196 | 144 | size_t get_better_size() { return size(); } |
duke@435 | 145 | |
jmasa@4196 | 146 | size_t returned_bytes() const { ShouldNotReachHere(); return 0; } |
jmasa@4196 | 147 | void set_returned_bytes(size_t v) {} |
jmasa@4196 | 148 | void increment_returned_bytes_by(size_t v) {} |
duke@435 | 149 | |
duke@435 | 150 | // Unlink head of list and return it. Returns NULL if |
duke@435 | 151 | // the list is empty. |
jmasa@4196 | 152 | Chunk_t* get_chunk_at_head(); |
duke@435 | 153 | |
duke@435 | 154 | // Remove the first "n" or "count", whichever is smaller, chunks from the |
duke@435 | 155 | // list, setting "fl", which is required to be empty, to point to them. |
jmasa@4196 | 156 | void getFirstNChunksFromList(size_t n, FreeList<Chunk_t>* fl); |
duke@435 | 157 | |
duke@435 | 158 | // Unlink this chunk from it's free list |
jmasa@4196 | 159 | void remove_chunk(Chunk_t* fc); |
duke@435 | 160 | |
duke@435 | 161 | // Add this chunk to this free list. |
jmasa@4196 | 162 | void return_chunk_at_head(Chunk_t* fc); |
jmasa@4196 | 163 | void return_chunk_at_tail(Chunk_t* fc); |
duke@435 | 164 | |
duke@435 | 165 | // Similar to returnChunk* but also records some diagnostic |
duke@435 | 166 | // information. |
jmasa@4196 | 167 | void return_chunk_at_head(Chunk_t* fc, bool record_return); |
jmasa@4196 | 168 | void return_chunk_at_tail(Chunk_t* fc, bool record_return); |
duke@435 | 169 | |
duke@435 | 170 | // Prepend "fl" (whose size is required to be the same as that of "this") |
duke@435 | 171 | // to the front of "this" list. |
jmasa@4196 | 172 | void prepend(FreeList<Chunk_t>* fl); |
duke@435 | 173 | |
duke@435 | 174 | // Verify that the chunk is in the list. |
duke@435 | 175 | // found. Return NULL if "fc" is not found. |
jmasa@4196 | 176 | bool verify_chunk_in_free_list(Chunk_t* fc) const; |
ysr@447 | 177 | |
ysr@447 | 178 | // Printing support |
ysr@447 | 179 | static void print_labels_on(outputStream* st, const char* c); |
ysr@447 | 180 | void print_on(outputStream* st, const char* c = NULL) const; |
duke@435 | 181 | }; |
stefank@2314 | 182 | |
jmasa@3730 | 183 | #endif // SHARE_VM_MEMORY_FREELIST_HPP |