Sun, 03 Feb 2013 22:28:08 +0400
8002048: Protocol to discovery of manageable Java processes on a network
Summary: Introduce a protocol to discover manageble Java instances across a network subnet, JDP
Reviewed-by: sla, dfuchs
duke@435 | 1 | /* |
coleenp@4037 | 2 | * Copyright (c) 2003, 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 | |
stefank@2314 | 25 | #ifndef SHARE_VM_SERVICES_MEMORYPOOL_HPP |
stefank@2314 | 26 | #define SHARE_VM_SERVICES_MEMORYPOOL_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "gc_implementation/shared/mutableSpace.hpp" |
stefank@2314 | 29 | #include "memory/defNewGeneration.hpp" |
stefank@2314 | 30 | #include "memory/heap.hpp" |
stefank@2314 | 31 | #include "memory/space.hpp" |
stefank@2314 | 32 | #include "services/memoryUsage.hpp" |
stefank@2314 | 33 | #ifndef SERIALGC |
stefank@2314 | 34 | #include "gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp" |
stefank@2314 | 35 | #endif |
stefank@2314 | 36 | |
duke@435 | 37 | // A memory pool represents the memory area that the VM manages. |
duke@435 | 38 | // The Java virtual machine has at least one memory pool |
duke@435 | 39 | // and it may create or remove memory pools during execution. |
duke@435 | 40 | // A memory pool can belong to the heap or the non-heap memory. |
duke@435 | 41 | // A Java virtual machine may also have memory pools belonging to |
duke@435 | 42 | // both heap and non-heap memory. |
duke@435 | 43 | |
duke@435 | 44 | // Forward declaration |
duke@435 | 45 | class MemoryManager; |
duke@435 | 46 | class SensorInfo; |
duke@435 | 47 | class Generation; |
duke@435 | 48 | class DefNewGeneration; |
duke@435 | 49 | class ThresholdSupport; |
duke@435 | 50 | |
zgu@3900 | 51 | class MemoryPool : public CHeapObj<mtInternal> { |
duke@435 | 52 | friend class MemoryManager; |
duke@435 | 53 | public: |
duke@435 | 54 | enum PoolType { |
duke@435 | 55 | Heap = 1, |
duke@435 | 56 | NonHeap = 2 |
duke@435 | 57 | }; |
duke@435 | 58 | |
duke@435 | 59 | private: |
duke@435 | 60 | enum { |
duke@435 | 61 | max_num_managers = 5 |
duke@435 | 62 | }; |
duke@435 | 63 | |
duke@435 | 64 | // We could make some of the following as performance counters |
duke@435 | 65 | // for external monitoring. |
duke@435 | 66 | const char* _name; |
duke@435 | 67 | PoolType _type; |
duke@435 | 68 | size_t _initial_size; |
duke@435 | 69 | size_t _max_size; |
duke@435 | 70 | bool _available_for_allocation; // Default is true |
duke@435 | 71 | MemoryManager* _managers[max_num_managers]; |
duke@435 | 72 | int _num_managers; |
duke@435 | 73 | MemoryUsage _peak_usage; // Peak memory usage |
duke@435 | 74 | MemoryUsage _after_gc_usage; // After GC memory usage |
duke@435 | 75 | |
duke@435 | 76 | ThresholdSupport* _usage_threshold; |
duke@435 | 77 | ThresholdSupport* _gc_usage_threshold; |
duke@435 | 78 | |
duke@435 | 79 | SensorInfo* _usage_sensor; |
duke@435 | 80 | SensorInfo* _gc_usage_sensor; |
duke@435 | 81 | |
duke@435 | 82 | volatile instanceOop _memory_pool_obj; |
duke@435 | 83 | |
duke@435 | 84 | void add_manager(MemoryManager* mgr); |
duke@435 | 85 | |
duke@435 | 86 | public: |
duke@435 | 87 | MemoryPool(const char* name, |
duke@435 | 88 | PoolType type, |
duke@435 | 89 | size_t init_size, |
duke@435 | 90 | size_t max_size, |
duke@435 | 91 | bool support_usage_threshold, |
duke@435 | 92 | bool support_gc_threshold); |
duke@435 | 93 | |
duke@435 | 94 | const char* name() { return _name; } |
duke@435 | 95 | bool is_heap() { return _type == Heap; } |
duke@435 | 96 | bool is_non_heap() { return _type == NonHeap; } |
duke@435 | 97 | size_t initial_size() const { return _initial_size; } |
duke@435 | 98 | int num_memory_managers() const { return _num_managers; } |
duke@435 | 99 | // max size could be changed |
duke@435 | 100 | virtual size_t max_size() const { return _max_size; } |
duke@435 | 101 | |
duke@435 | 102 | bool is_pool(instanceHandle pool) { return (pool() == _memory_pool_obj); } |
duke@435 | 103 | |
duke@435 | 104 | bool available_for_allocation() { return _available_for_allocation; } |
duke@435 | 105 | bool set_available_for_allocation(bool value) { |
duke@435 | 106 | bool prev = _available_for_allocation; |
duke@435 | 107 | _available_for_allocation = value; |
duke@435 | 108 | return prev; |
duke@435 | 109 | } |
duke@435 | 110 | |
duke@435 | 111 | MemoryManager* get_memory_manager(int index) { |
duke@435 | 112 | assert(index >= 0 && index < _num_managers, "Invalid index"); |
duke@435 | 113 | return _managers[index]; |
duke@435 | 114 | } |
duke@435 | 115 | |
duke@435 | 116 | // Records current memory usage if it's a peak usage |
duke@435 | 117 | void record_peak_memory_usage(); |
duke@435 | 118 | |
duke@435 | 119 | MemoryUsage get_peak_memory_usage() { |
duke@435 | 120 | // check current memory usage first and then return peak usage |
duke@435 | 121 | record_peak_memory_usage(); |
duke@435 | 122 | return _peak_usage; |
duke@435 | 123 | } |
duke@435 | 124 | void reset_peak_memory_usage() { |
duke@435 | 125 | _peak_usage = get_memory_usage(); |
duke@435 | 126 | } |
duke@435 | 127 | |
duke@435 | 128 | ThresholdSupport* usage_threshold() { return _usage_threshold; } |
duke@435 | 129 | ThresholdSupport* gc_usage_threshold() { return _gc_usage_threshold; } |
duke@435 | 130 | |
duke@435 | 131 | SensorInfo* usage_sensor() { return _usage_sensor; } |
duke@435 | 132 | SensorInfo* gc_usage_sensor() { return _gc_usage_sensor; } |
duke@435 | 133 | |
duke@435 | 134 | void set_usage_sensor_obj(instanceHandle s); |
duke@435 | 135 | void set_gc_usage_sensor_obj(instanceHandle s); |
duke@435 | 136 | void set_last_collection_usage(MemoryUsage u) { _after_gc_usage = u; } |
duke@435 | 137 | |
duke@435 | 138 | virtual instanceOop get_memory_pool_instance(TRAPS); |
duke@435 | 139 | virtual MemoryUsage get_memory_usage() = 0; |
duke@435 | 140 | virtual size_t used_in_bytes() = 0; |
duke@435 | 141 | virtual bool is_collected_pool() { return false; } |
duke@435 | 142 | virtual MemoryUsage get_last_collection_usage() { return _after_gc_usage; } |
duke@435 | 143 | |
duke@435 | 144 | // GC support |
duke@435 | 145 | void oops_do(OopClosure* f); |
duke@435 | 146 | }; |
duke@435 | 147 | |
duke@435 | 148 | class CollectedMemoryPool : public MemoryPool { |
duke@435 | 149 | public: |
duke@435 | 150 | CollectedMemoryPool(const char* name, PoolType type, size_t init_size, size_t max_size, bool support_usage_threshold) : |
duke@435 | 151 | MemoryPool(name, type, init_size, max_size, support_usage_threshold, true) {}; |
duke@435 | 152 | bool is_collected_pool() { return true; } |
duke@435 | 153 | }; |
duke@435 | 154 | |
duke@435 | 155 | class ContiguousSpacePool : public CollectedMemoryPool { |
duke@435 | 156 | private: |
duke@435 | 157 | ContiguousSpace* _space; |
duke@435 | 158 | |
duke@435 | 159 | public: |
duke@435 | 160 | ContiguousSpacePool(ContiguousSpace* space, const char* name, PoolType type, size_t max_size, bool support_usage_threshold); |
duke@435 | 161 | |
duke@435 | 162 | ContiguousSpace* space() { return _space; } |
duke@435 | 163 | MemoryUsage get_memory_usage(); |
duke@435 | 164 | size_t used_in_bytes() { return space()->used(); } |
duke@435 | 165 | }; |
duke@435 | 166 | |
duke@435 | 167 | class SurvivorContiguousSpacePool : public CollectedMemoryPool { |
duke@435 | 168 | private: |
duke@435 | 169 | DefNewGeneration* _gen; |
duke@435 | 170 | |
duke@435 | 171 | public: |
duke@435 | 172 | SurvivorContiguousSpacePool(DefNewGeneration* gen, |
duke@435 | 173 | const char* name, |
duke@435 | 174 | PoolType type, |
duke@435 | 175 | size_t max_size, |
duke@435 | 176 | bool support_usage_threshold); |
duke@435 | 177 | |
duke@435 | 178 | MemoryUsage get_memory_usage(); |
duke@435 | 179 | |
duke@435 | 180 | size_t used_in_bytes() { |
duke@435 | 181 | return _gen->from()->used(); |
duke@435 | 182 | } |
duke@435 | 183 | size_t committed_in_bytes() { |
duke@435 | 184 | return _gen->from()->capacity(); |
duke@435 | 185 | } |
duke@435 | 186 | }; |
duke@435 | 187 | |
duke@435 | 188 | #ifndef SERIALGC |
duke@435 | 189 | class CompactibleFreeListSpacePool : public CollectedMemoryPool { |
duke@435 | 190 | private: |
duke@435 | 191 | CompactibleFreeListSpace* _space; |
duke@435 | 192 | public: |
duke@435 | 193 | CompactibleFreeListSpacePool(CompactibleFreeListSpace* space, |
duke@435 | 194 | const char* name, |
duke@435 | 195 | PoolType type, |
duke@435 | 196 | size_t max_size, |
duke@435 | 197 | bool support_usage_threshold); |
duke@435 | 198 | |
duke@435 | 199 | MemoryUsage get_memory_usage(); |
duke@435 | 200 | size_t used_in_bytes() { return _space->used(); } |
duke@435 | 201 | }; |
duke@435 | 202 | #endif // SERIALGC |
duke@435 | 203 | |
duke@435 | 204 | |
duke@435 | 205 | class GenerationPool : public CollectedMemoryPool { |
duke@435 | 206 | private: |
duke@435 | 207 | Generation* _gen; |
duke@435 | 208 | public: |
duke@435 | 209 | GenerationPool(Generation* gen, const char* name, PoolType type, bool support_usage_threshold); |
duke@435 | 210 | |
duke@435 | 211 | MemoryUsage get_memory_usage(); |
duke@435 | 212 | size_t used_in_bytes() { return _gen->used(); } |
duke@435 | 213 | }; |
duke@435 | 214 | |
duke@435 | 215 | class CodeHeapPool: public MemoryPool { |
duke@435 | 216 | private: |
duke@435 | 217 | CodeHeap* _codeHeap; |
duke@435 | 218 | public: |
duke@435 | 219 | CodeHeapPool(CodeHeap* codeHeap, const char* name, bool support_usage_threshold); |
duke@435 | 220 | MemoryUsage get_memory_usage(); |
duke@435 | 221 | size_t used_in_bytes() { return _codeHeap->allocated_capacity(); } |
duke@435 | 222 | }; |
stefank@2314 | 223 | |
stefank@2314 | 224 | #endif // SHARE_VM_SERVICES_MEMORYPOOL_HPP |