annotate hotspot/src/share/vm/services/memoryManager.cpp @ 8076:96d498ec7ae1

6990754: Use native memory and reference counting to implement SymbolTable Summary: move symbols from permgen into C heap and reference count them Reviewed-by: never, acorn, jmasa, stefank
author coleenp
date Thu, 27 Jan 2011 16:11:27 -0800
parents 5b173b4ca846
children 14bfe81f2a9d
rev   line source
duke@1 1 /*
stefank@7397 2 * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
duke@1 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@1 4 *
duke@1 5 * This code is free software; you can redistribute it and/or modify it
duke@1 6 * under the terms of the GNU General Public License version 2 only, as
duke@1 7 * published by the Free Software Foundation.
duke@1 8 *
duke@1 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@1 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@1 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@1 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@1 13 * accompanied this code).
duke@1 14 *
duke@1 15 * You should have received a copy of the GNU General Public License version
duke@1 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@1 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@1 18 *
trims@5547 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@5547 20 * or visit www.oracle.com if you need additional information or have any
trims@5547 21 * questions.
duke@1 22 *
duke@1 23 */
duke@1 24
stefank@7397 25 #include "precompiled.hpp"
stefank@7397 26 #include "classfile/systemDictionary.hpp"
stefank@7397 27 #include "classfile/vmSymbols.hpp"
stefank@7397 28 #include "oops/oop.inline.hpp"
stefank@7397 29 #include "runtime/handles.inline.hpp"
stefank@7397 30 #include "runtime/javaCalls.hpp"
stefank@7397 31 #include "services/lowMemoryDetector.hpp"
stefank@7397 32 #include "services/management.hpp"
stefank@7397 33 #include "services/memoryManager.hpp"
stefank@7397 34 #include "services/memoryPool.hpp"
stefank@7397 35 #include "services/memoryService.hpp"
stefank@7397 36 #include "utilities/dtrace.hpp"
duke@1 37
duke@1 38 HS_DTRACE_PROBE_DECL8(hotspot, mem__pool__gc__begin, char*, int, char*, int,
duke@1 39 size_t, size_t, size_t, size_t);
duke@1 40 HS_DTRACE_PROBE_DECL8(hotspot, mem__pool__gc__end, char*, int, char*, int,
duke@1 41 size_t, size_t, size_t, size_t);
duke@1 42
duke@1 43 MemoryManager::MemoryManager() {
duke@1 44 _num_pools = 0;
duke@1 45 _memory_mgr_obj = NULL;
duke@1 46 }
duke@1 47
duke@1 48 void MemoryManager::add_pool(MemoryPool* pool) {
duke@1 49 assert(_num_pools < MemoryManager::max_num_pools, "_num_pools exceeds the max");
duke@1 50 if (_num_pools < MemoryManager::max_num_pools) {
duke@1 51 _pools[_num_pools] = pool;
duke@1 52 _num_pools++;
duke@1 53 }
duke@1 54 pool->add_manager(this);
duke@1 55 }
duke@1 56
duke@1 57 MemoryManager* MemoryManager::get_code_cache_memory_manager() {
duke@1 58 return (MemoryManager*) new CodeCacheMemoryManager();
duke@1 59 }
duke@1 60
duke@1 61 GCMemoryManager* MemoryManager::get_copy_memory_manager() {
duke@1 62 return (GCMemoryManager*) new CopyMemoryManager();
duke@1 63 }
duke@1 64
duke@1 65 GCMemoryManager* MemoryManager::get_msc_memory_manager() {
duke@1 66 return (GCMemoryManager*) new MSCMemoryManager();
duke@1 67 }
duke@1 68
duke@1 69 GCMemoryManager* MemoryManager::get_parnew_memory_manager() {
duke@1 70 return (GCMemoryManager*) new ParNewMemoryManager();
duke@1 71 }
duke@1 72
duke@1 73 GCMemoryManager* MemoryManager::get_cms_memory_manager() {
duke@1 74 return (GCMemoryManager*) new CMSMemoryManager();
duke@1 75 }
duke@1 76
duke@1 77 GCMemoryManager* MemoryManager::get_psScavenge_memory_manager() {
duke@1 78 return (GCMemoryManager*) new PSScavengeMemoryManager();
duke@1 79 }
duke@1 80
duke@1 81 GCMemoryManager* MemoryManager::get_psMarkSweep_memory_manager() {
duke@1 82 return (GCMemoryManager*) new PSMarkSweepMemoryManager();
duke@1 83 }
duke@1 84
tonyp@4459 85 GCMemoryManager* MemoryManager::get_g1YoungGen_memory_manager() {
tonyp@4459 86 return (GCMemoryManager*) new G1YoungGenMemoryManager();
tonyp@4459 87 }
tonyp@4459 88
tonyp@4459 89 GCMemoryManager* MemoryManager::get_g1OldGen_memory_manager() {
tonyp@4459 90 return (GCMemoryManager*) new G1OldGenMemoryManager();
tonyp@4459 91 }
tonyp@4459 92
duke@1 93 instanceOop MemoryManager::get_memory_manager_instance(TRAPS) {
duke@1 94 // Must do an acquire so as to force ordering of subsequent
duke@1 95 // loads from anything _memory_mgr_obj points to or implies.
duke@1 96 instanceOop mgr_obj = (instanceOop)OrderAccess::load_ptr_acquire(&_memory_mgr_obj);
duke@1 97 if (mgr_obj == NULL) {
duke@1 98 // It's ok for more than one thread to execute the code up to the locked region.
duke@1 99 // Extra manager instances will just be gc'ed.
duke@1 100 klassOop k = Management::sun_management_ManagementFactory_klass(CHECK_0);
duke@1 101 instanceKlassHandle ik(THREAD, k);
duke@1 102
duke@1 103 Handle mgr_name = java_lang_String::create_from_str(name(), CHECK_0);
duke@1 104
duke@1 105 JavaValue result(T_OBJECT);
duke@1 106 JavaCallArguments args;
duke@1 107 args.push_oop(mgr_name); // Argument 1
duke@1 108
coleenp@8076 109 Symbol* method_name = NULL;
coleenp@8076 110 Symbol* signature = NULL;
duke@1 111 if (is_gc_memory_manager()) {
coleenp@8076 112 method_name = vmSymbols::createGarbageCollector_name();
coleenp@8076 113 signature = vmSymbols::createGarbageCollector_signature();
duke@1 114 args.push_oop(Handle()); // Argument 2 (for future extension)
duke@1 115 } else {
coleenp@8076 116 method_name = vmSymbols::createMemoryManager_name();
coleenp@8076 117 signature = vmSymbols::createMemoryManager_signature();
duke@1 118 }
duke@1 119
duke@1 120 JavaCalls::call_static(&result,
duke@1 121 ik,
duke@1 122 method_name,
duke@1 123 signature,
duke@1 124 &args,
duke@1 125 CHECK_0);
duke@1 126
duke@1 127 instanceOop m = (instanceOop) result.get_jobject();
duke@1 128 instanceHandle mgr(THREAD, m);
duke@1 129
duke@1 130 {
duke@1 131 // Get lock before setting _memory_mgr_obj
duke@1 132 // since another thread may have created the instance
duke@1 133 MutexLocker ml(Management_lock);
duke@1 134
duke@1 135 // Check if another thread has created the management object. We reload
duke@1 136 // _memory_mgr_obj here because some other thread may have initialized
duke@1 137 // it while we were executing the code before the lock.
duke@1 138 //
duke@1 139 // The lock has done an acquire, so the load can't float above it, but
duke@1 140 // we need to do a load_acquire as above.
duke@1 141 mgr_obj = (instanceOop)OrderAccess::load_ptr_acquire(&_memory_mgr_obj);
duke@1 142 if (mgr_obj != NULL) {
duke@1 143 return mgr_obj;
duke@1 144 }
duke@1 145
duke@1 146 // Get the address of the object we created via call_special.
duke@1 147 mgr_obj = mgr();
duke@1 148
duke@1 149 // Use store barrier to make sure the memory accesses associated
duke@1 150 // with creating the management object are visible before publishing
duke@1 151 // its address. The unlock will publish the store to _memory_mgr_obj
duke@1 152 // because it does a release first.
duke@1 153 OrderAccess::release_store_ptr(&_memory_mgr_obj, mgr_obj);
duke@1 154 }
duke@1 155 }
duke@1 156
duke@1 157 return mgr_obj;
duke@1 158 }
duke@1 159
duke@1 160 void MemoryManager::oops_do(OopClosure* f) {
duke@1 161 f->do_oop((oop*) &_memory_mgr_obj);
duke@1 162 }
duke@1 163
duke@1 164 GCStatInfo::GCStatInfo(int num_pools) {
duke@1 165 // initialize the arrays for memory usage
duke@1 166 _before_gc_usage_array = (MemoryUsage*) NEW_C_HEAP_ARRAY(MemoryUsage, num_pools);
duke@1 167 _after_gc_usage_array = (MemoryUsage*) NEW_C_HEAP_ARRAY(MemoryUsage, num_pools);
duke@1 168 size_t len = num_pools * sizeof(MemoryUsage);
duke@1 169 memset(_before_gc_usage_array, 0, len);
duke@1 170 memset(_after_gc_usage_array, 0, len);
duke@1 171 _usage_array_size = num_pools;
duke@1 172 }
duke@1 173
duke@1 174 GCStatInfo::~GCStatInfo() {
duke@1 175 FREE_C_HEAP_ARRAY(MemoryUsage*, _before_gc_usage_array);
duke@1 176 FREE_C_HEAP_ARRAY(MemoryUsage*, _after_gc_usage_array);
duke@1 177 }
duke@1 178
duke@1 179 void GCStatInfo::set_gc_usage(int pool_index, MemoryUsage usage, bool before_gc) {
duke@1 180 MemoryUsage* gc_usage_array;
duke@1 181 if (before_gc) {
duke@1 182 gc_usage_array = _before_gc_usage_array;
duke@1 183 } else {
duke@1 184 gc_usage_array = _after_gc_usage_array;
duke@1 185 }
duke@1 186 gc_usage_array[pool_index] = usage;
duke@1 187 }
duke@1 188
kevinw@6245 189 void GCStatInfo::clear() {
kevinw@6245 190 _index = 0;
kevinw@6245 191 _start_time = 0L;
kevinw@6245 192 _end_time = 0L;
kevinw@6245 193 size_t len = _usage_array_size * sizeof(MemoryUsage);
kevinw@6245 194 memset(_before_gc_usage_array, 0, len);
kevinw@6245 195 memset(_after_gc_usage_array, 0, len);
kevinw@6245 196 }
kevinw@6245 197
kevinw@6245 198
duke@1 199 GCMemoryManager::GCMemoryManager() : MemoryManager() {
duke@1 200 _num_collections = 0;
duke@1 201 _last_gc_stat = NULL;
kevinw@6245 202 _last_gc_lock = new Mutex(Mutex::leaf, "_last_gc_lock", true);
kevinw@6245 203 _current_gc_stat = NULL;
duke@1 204 _num_gc_threads = 1;
duke@1 205 }
duke@1 206
duke@1 207 GCMemoryManager::~GCMemoryManager() {
duke@1 208 delete _last_gc_stat;
kevinw@6245 209 delete _last_gc_lock;
kevinw@6245 210 delete _current_gc_stat;
duke@1 211 }
duke@1 212
duke@1 213 void GCMemoryManager::initialize_gc_stat_info() {
duke@1 214 assert(MemoryService::num_memory_pools() > 0, "should have one or more memory pools");
duke@1 215 _last_gc_stat = new GCStatInfo(MemoryService::num_memory_pools());
kevinw@6245 216 _current_gc_stat = new GCStatInfo(MemoryService::num_memory_pools());
kevinw@6245 217 // tracking concurrent collections we need two objects: one to update, and one to
kevinw@6245 218 // hold the publicly available "last (completed) gc" information.
duke@1 219 }
duke@1 220
kevinw@6245 221 void GCMemoryManager::gc_begin(bool recordGCBeginTime, bool recordPreGCUsage,
kevinw@6245 222 bool recordAccumulatedGCTime) {
kevinw@6245 223 assert(_last_gc_stat != NULL && _current_gc_stat != NULL, "Just checking");
kevinw@6245 224 if (recordAccumulatedGCTime) {
kevinw@6245 225 _accumulated_timer.start();
kevinw@6245 226 }
kevinw@6245 227 // _num_collections now increases in gc_end, to count completed collections
kevinw@6245 228 if (recordGCBeginTime) {
kevinw@6245 229 _current_gc_stat->set_index(_num_collections+1);
kevinw@6245 230 _current_gc_stat->set_start_time(Management::timestamp());
kevinw@6245 231 }
duke@1 232
kevinw@6245 233 if (recordPreGCUsage) {
kevinw@6245 234 // Keep memory usage of all memory pools
kevinw@6245 235 for (int i = 0; i < MemoryService::num_memory_pools(); i++) {
kevinw@6245 236 MemoryPool* pool = MemoryService::get_memory_pool(i);
kevinw@6245 237 MemoryUsage usage = pool->get_memory_usage();
kevinw@6245 238 _current_gc_stat->set_before_gc_usage(i, usage);
kevinw@6245 239 HS_DTRACE_PROBE8(hotspot, mem__pool__gc__begin,
kevinw@6245 240 name(), strlen(name()),
kevinw@6245 241 pool->name(), strlen(pool->name()),
kevinw@6245 242 usage.init_size(), usage.used(),
kevinw@6245 243 usage.committed(), usage.max_size());
kevinw@6245 244 }
duke@1 245 }
duke@1 246 }
duke@1 247
kevinw@6245 248 // A collector MUST, even if it does not complete for some reason,
kevinw@6245 249 // make a TraceMemoryManagerStats object where countCollection is true,
kevinw@6245 250 // to ensure the current gc stat is placed in _last_gc_stat.
kevinw@6245 251 void GCMemoryManager::gc_end(bool recordPostGCUsage,
kevinw@6245 252 bool recordAccumulatedGCTime,
kevinw@6245 253 bool recordGCEndTime, bool countCollection) {
kevinw@6245 254 if (recordAccumulatedGCTime) {
kevinw@6245 255 _accumulated_timer.stop();
kevinw@6245 256 }
kevinw@6245 257 if (recordGCEndTime) {
kevinw@6245 258 _current_gc_stat->set_end_time(Management::timestamp());
duke@1 259 }
duke@1 260
kevinw@6245 261 if (recordPostGCUsage) {
kevinw@6245 262 int i;
kevinw@6245 263 // keep the last gc statistics for all memory pools
kevinw@6245 264 for (i = 0; i < MemoryService::num_memory_pools(); i++) {
kevinw@6245 265 MemoryPool* pool = MemoryService::get_memory_pool(i);
kevinw@6245 266 MemoryUsage usage = pool->get_memory_usage();
duke@1 267
kevinw@6245 268 HS_DTRACE_PROBE8(hotspot, mem__pool__gc__end,
kevinw@6245 269 name(), strlen(name()),
kevinw@6245 270 pool->name(), strlen(pool->name()),
kevinw@6245 271 usage.init_size(), usage.used(),
kevinw@6245 272 usage.committed(), usage.max_size());
kevinw@6245 273
kevinw@6245 274 _current_gc_stat->set_after_gc_usage(i, usage);
kevinw@6245 275 }
kevinw@6245 276
kevinw@6245 277 // Set last collection usage of the memory pools managed by this collector
kevinw@6245 278 for (i = 0; i < num_memory_pools(); i++) {
kevinw@6245 279 MemoryPool* pool = get_memory_pool(i);
kevinw@6245 280 MemoryUsage usage = pool->get_memory_usage();
kevinw@6245 281
kevinw@6245 282 // Compare with GC usage threshold
kevinw@6245 283 pool->set_last_collection_usage(usage);
kevinw@6245 284 LowMemoryDetector::detect_after_gc_memory(pool);
kevinw@6245 285 }
kevinw@6245 286 }
kevinw@6245 287 if (countCollection) {
kevinw@6245 288 _num_collections++;
kevinw@6245 289 // alternately update two objects making one public when complete
kevinw@6245 290 {
kevinw@6245 291 MutexLockerEx ml(_last_gc_lock, Mutex::_no_safepoint_check_flag);
kevinw@6245 292 GCStatInfo *tmp = _last_gc_stat;
kevinw@6245 293 _last_gc_stat = _current_gc_stat;
kevinw@6245 294 _current_gc_stat = tmp;
kevinw@6245 295 // reset the current stat for diagnosability purposes
kevinw@6245 296 _current_gc_stat->clear();
kevinw@6245 297 }
duke@1 298 }
duke@1 299 }
kevinw@6245 300
kevinw@6245 301 size_t GCMemoryManager::get_last_gc_stat(GCStatInfo* dest) {
kevinw@6245 302 MutexLockerEx ml(_last_gc_lock, Mutex::_no_safepoint_check_flag);
kevinw@6245 303 if (_last_gc_stat->gc_index() != 0) {
kevinw@6245 304 dest->set_index(_last_gc_stat->gc_index());
kevinw@6245 305 dest->set_start_time(_last_gc_stat->start_time());
kevinw@6245 306 dest->set_end_time(_last_gc_stat->end_time());
kevinw@6245 307 assert(dest->usage_array_size() == _last_gc_stat->usage_array_size(),
kevinw@6245 308 "Must have same array size");
kevinw@6245 309 size_t len = dest->usage_array_size() * sizeof(MemoryUsage);
kevinw@6245 310 memcpy(dest->before_gc_usage_array(), _last_gc_stat->before_gc_usage_array(), len);
kevinw@6245 311 memcpy(dest->after_gc_usage_array(), _last_gc_stat->after_gc_usage_array(), len);
kevinw@6245 312 }
kevinw@6245 313 return _last_gc_stat->gc_index();
kevinw@6245 314 }