Mon, 15 Dec 2008 13:58:57 -0800
6653214: MemoryPoolMXBean.setUsageThreshold() does not support large heap sizes.
Reviewed-by: ysr, mchung
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 2003-2004 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | // A memory pool represents the memory area that the VM manages. |
duke@435 | 26 | // The Java virtual machine has at least one memory pool |
duke@435 | 27 | // and it may create or remove memory pools during execution. |
duke@435 | 28 | // A memory pool can belong to the heap or the non-heap memory. |
duke@435 | 29 | // A Java virtual machine may also have memory pools belonging to |
duke@435 | 30 | // both heap and non-heap memory. |
duke@435 | 31 | |
duke@435 | 32 | // Forward declaration |
duke@435 | 33 | class MemoryManager; |
duke@435 | 34 | class SensorInfo; |
duke@435 | 35 | class Generation; |
duke@435 | 36 | class DefNewGeneration; |
duke@435 | 37 | class PSPermGen; |
duke@435 | 38 | class PermGen; |
duke@435 | 39 | class ThresholdSupport; |
duke@435 | 40 | |
duke@435 | 41 | class MemoryPool : public CHeapObj { |
duke@435 | 42 | friend class MemoryManager; |
duke@435 | 43 | public: |
duke@435 | 44 | enum PoolType { |
duke@435 | 45 | Heap = 1, |
duke@435 | 46 | NonHeap = 2 |
duke@435 | 47 | }; |
duke@435 | 48 | |
duke@435 | 49 | private: |
duke@435 | 50 | enum { |
duke@435 | 51 | max_num_managers = 5 |
duke@435 | 52 | }; |
duke@435 | 53 | |
duke@435 | 54 | // We could make some of the following as performance counters |
duke@435 | 55 | // for external monitoring. |
duke@435 | 56 | const char* _name; |
duke@435 | 57 | PoolType _type; |
duke@435 | 58 | size_t _initial_size; |
duke@435 | 59 | size_t _max_size; |
duke@435 | 60 | bool _available_for_allocation; // Default is true |
duke@435 | 61 | MemoryManager* _managers[max_num_managers]; |
duke@435 | 62 | int _num_managers; |
duke@435 | 63 | MemoryUsage _peak_usage; // Peak memory usage |
duke@435 | 64 | MemoryUsage _after_gc_usage; // After GC memory usage |
duke@435 | 65 | |
duke@435 | 66 | ThresholdSupport* _usage_threshold; |
duke@435 | 67 | ThresholdSupport* _gc_usage_threshold; |
duke@435 | 68 | |
duke@435 | 69 | SensorInfo* _usage_sensor; |
duke@435 | 70 | SensorInfo* _gc_usage_sensor; |
duke@435 | 71 | |
duke@435 | 72 | volatile instanceOop _memory_pool_obj; |
duke@435 | 73 | |
duke@435 | 74 | void add_manager(MemoryManager* mgr); |
duke@435 | 75 | |
duke@435 | 76 | public: |
duke@435 | 77 | MemoryPool(const char* name, |
duke@435 | 78 | PoolType type, |
duke@435 | 79 | size_t init_size, |
duke@435 | 80 | size_t max_size, |
duke@435 | 81 | bool support_usage_threshold, |
duke@435 | 82 | bool support_gc_threshold); |
duke@435 | 83 | |
duke@435 | 84 | const char* name() { return _name; } |
duke@435 | 85 | bool is_heap() { return _type == Heap; } |
duke@435 | 86 | bool is_non_heap() { return _type == NonHeap; } |
duke@435 | 87 | size_t initial_size() const { return _initial_size; } |
duke@435 | 88 | int num_memory_managers() const { return _num_managers; } |
duke@435 | 89 | // max size could be changed |
duke@435 | 90 | virtual size_t max_size() const { return _max_size; } |
duke@435 | 91 | |
duke@435 | 92 | bool is_pool(instanceHandle pool) { return (pool() == _memory_pool_obj); } |
duke@435 | 93 | |
duke@435 | 94 | bool available_for_allocation() { return _available_for_allocation; } |
duke@435 | 95 | bool set_available_for_allocation(bool value) { |
duke@435 | 96 | bool prev = _available_for_allocation; |
duke@435 | 97 | _available_for_allocation = value; |
duke@435 | 98 | return prev; |
duke@435 | 99 | } |
duke@435 | 100 | |
duke@435 | 101 | MemoryManager* get_memory_manager(int index) { |
duke@435 | 102 | assert(index >= 0 && index < _num_managers, "Invalid index"); |
duke@435 | 103 | return _managers[index]; |
duke@435 | 104 | } |
duke@435 | 105 | |
duke@435 | 106 | // Records current memory usage if it's a peak usage |
duke@435 | 107 | void record_peak_memory_usage(); |
duke@435 | 108 | |
duke@435 | 109 | MemoryUsage get_peak_memory_usage() { |
duke@435 | 110 | // check current memory usage first and then return peak usage |
duke@435 | 111 | record_peak_memory_usage(); |
duke@435 | 112 | return _peak_usage; |
duke@435 | 113 | } |
duke@435 | 114 | void reset_peak_memory_usage() { |
duke@435 | 115 | _peak_usage = get_memory_usage(); |
duke@435 | 116 | } |
duke@435 | 117 | |
duke@435 | 118 | ThresholdSupport* usage_threshold() { return _usage_threshold; } |
duke@435 | 119 | ThresholdSupport* gc_usage_threshold() { return _gc_usage_threshold; } |
duke@435 | 120 | |
duke@435 | 121 | SensorInfo* usage_sensor() { return _usage_sensor; } |
duke@435 | 122 | SensorInfo* gc_usage_sensor() { return _gc_usage_sensor; } |
duke@435 | 123 | |
duke@435 | 124 | void set_usage_sensor_obj(instanceHandle s); |
duke@435 | 125 | void set_gc_usage_sensor_obj(instanceHandle s); |
duke@435 | 126 | void set_last_collection_usage(MemoryUsage u) { _after_gc_usage = u; } |
duke@435 | 127 | |
duke@435 | 128 | virtual instanceOop get_memory_pool_instance(TRAPS); |
duke@435 | 129 | virtual MemoryUsage get_memory_usage() = 0; |
duke@435 | 130 | virtual size_t used_in_bytes() = 0; |
duke@435 | 131 | virtual bool is_collected_pool() { return false; } |
duke@435 | 132 | virtual MemoryUsage get_last_collection_usage() { return _after_gc_usage; } |
duke@435 | 133 | |
duke@435 | 134 | // GC support |
duke@435 | 135 | void oops_do(OopClosure* f); |
duke@435 | 136 | }; |
duke@435 | 137 | |
duke@435 | 138 | class CollectedMemoryPool : public MemoryPool { |
duke@435 | 139 | public: |
duke@435 | 140 | CollectedMemoryPool(const char* name, PoolType type, size_t init_size, size_t max_size, bool support_usage_threshold) : |
duke@435 | 141 | MemoryPool(name, type, init_size, max_size, support_usage_threshold, true) {}; |
duke@435 | 142 | bool is_collected_pool() { return true; } |
duke@435 | 143 | }; |
duke@435 | 144 | |
duke@435 | 145 | class ContiguousSpacePool : public CollectedMemoryPool { |
duke@435 | 146 | private: |
duke@435 | 147 | ContiguousSpace* _space; |
duke@435 | 148 | |
duke@435 | 149 | public: |
duke@435 | 150 | ContiguousSpacePool(ContiguousSpace* space, const char* name, PoolType type, size_t max_size, bool support_usage_threshold); |
duke@435 | 151 | |
duke@435 | 152 | ContiguousSpace* space() { return _space; } |
duke@435 | 153 | MemoryUsage get_memory_usage(); |
duke@435 | 154 | size_t used_in_bytes() { return space()->used(); } |
duke@435 | 155 | }; |
duke@435 | 156 | |
duke@435 | 157 | class SurvivorContiguousSpacePool : public CollectedMemoryPool { |
duke@435 | 158 | private: |
duke@435 | 159 | DefNewGeneration* _gen; |
duke@435 | 160 | |
duke@435 | 161 | public: |
duke@435 | 162 | SurvivorContiguousSpacePool(DefNewGeneration* gen, |
duke@435 | 163 | const char* name, |
duke@435 | 164 | PoolType type, |
duke@435 | 165 | size_t max_size, |
duke@435 | 166 | bool support_usage_threshold); |
duke@435 | 167 | |
duke@435 | 168 | MemoryUsage get_memory_usage(); |
duke@435 | 169 | |
duke@435 | 170 | size_t used_in_bytes() { |
duke@435 | 171 | return _gen->from()->used(); |
duke@435 | 172 | } |
duke@435 | 173 | size_t committed_in_bytes() { |
duke@435 | 174 | return _gen->from()->capacity(); |
duke@435 | 175 | } |
duke@435 | 176 | }; |
duke@435 | 177 | |
duke@435 | 178 | #ifndef SERIALGC |
duke@435 | 179 | class CompactibleFreeListSpacePool : public CollectedMemoryPool { |
duke@435 | 180 | private: |
duke@435 | 181 | CompactibleFreeListSpace* _space; |
duke@435 | 182 | public: |
duke@435 | 183 | CompactibleFreeListSpacePool(CompactibleFreeListSpace* space, |
duke@435 | 184 | const char* name, |
duke@435 | 185 | PoolType type, |
duke@435 | 186 | size_t max_size, |
duke@435 | 187 | bool support_usage_threshold); |
duke@435 | 188 | |
duke@435 | 189 | MemoryUsage get_memory_usage(); |
duke@435 | 190 | size_t used_in_bytes() { return _space->used(); } |
duke@435 | 191 | }; |
duke@435 | 192 | #endif // SERIALGC |
duke@435 | 193 | |
duke@435 | 194 | |
duke@435 | 195 | class GenerationPool : public CollectedMemoryPool { |
duke@435 | 196 | private: |
duke@435 | 197 | Generation* _gen; |
duke@435 | 198 | public: |
duke@435 | 199 | GenerationPool(Generation* gen, const char* name, PoolType type, bool support_usage_threshold); |
duke@435 | 200 | |
duke@435 | 201 | MemoryUsage get_memory_usage(); |
duke@435 | 202 | size_t used_in_bytes() { return _gen->used(); } |
duke@435 | 203 | }; |
duke@435 | 204 | |
duke@435 | 205 | class CodeHeapPool: public MemoryPool { |
duke@435 | 206 | private: |
duke@435 | 207 | CodeHeap* _codeHeap; |
duke@435 | 208 | public: |
duke@435 | 209 | CodeHeapPool(CodeHeap* codeHeap, const char* name, bool support_usage_threshold); |
duke@435 | 210 | MemoryUsage get_memory_usage(); |
duke@435 | 211 | size_t used_in_bytes() { return _codeHeap->allocated_capacity(); } |
duke@435 | 212 | }; |