Wed, 03 Jul 2019 20:42:37 +0800
Merge
duke@435 | 1 | /* |
phh@9608 | 2 | * Copyright (c) 2003, 2019, 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 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "classfile/systemDictionary.hpp" |
stefank@2314 | 27 | #include "classfile/vmSymbols.hpp" |
stefank@2314 | 28 | #include "oops/oop.inline.hpp" |
stefank@2314 | 29 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 30 | #include "runtime/javaCalls.hpp" |
goetz@6911 | 31 | #include "runtime/orderAccess.inline.hpp" |
stefank@2314 | 32 | #include "services/lowMemoryDetector.hpp" |
stefank@2314 | 33 | #include "services/management.hpp" |
stefank@2314 | 34 | #include "services/memoryManager.hpp" |
stefank@2314 | 35 | #include "services/memoryPool.hpp" |
stefank@2314 | 36 | #include "services/memoryService.hpp" |
fparain@2888 | 37 | #include "services/gcNotifier.hpp" |
stefank@2314 | 38 | #include "utilities/dtrace.hpp" |
duke@435 | 39 | |
dcubed@3202 | 40 | #ifndef USDT2 |
duke@435 | 41 | HS_DTRACE_PROBE_DECL8(hotspot, mem__pool__gc__begin, char*, int, char*, int, |
duke@435 | 42 | size_t, size_t, size_t, size_t); |
duke@435 | 43 | HS_DTRACE_PROBE_DECL8(hotspot, mem__pool__gc__end, char*, int, char*, int, |
duke@435 | 44 | size_t, size_t, size_t, size_t); |
dcubed@3202 | 45 | #endif /* !USDT2 */ |
duke@435 | 46 | |
duke@435 | 47 | MemoryManager::MemoryManager() { |
duke@435 | 48 | _num_pools = 0; |
lfoltan@9314 | 49 | (void)const_cast<instanceOop&>(_memory_mgr_obj = instanceOop(NULL)); |
duke@435 | 50 | } |
duke@435 | 51 | |
phh@9608 | 52 | int MemoryManager::add_pool(MemoryPool* pool) { |
phh@9608 | 53 | int index = _num_pools; |
phh@9608 | 54 | assert(index < MemoryManager::max_num_pools, "_num_pools exceeds the max"); |
phh@9608 | 55 | if (index < MemoryManager::max_num_pools) { |
phh@9608 | 56 | _pools[index] = pool; |
duke@435 | 57 | _num_pools++; |
duke@435 | 58 | } |
duke@435 | 59 | pool->add_manager(this); |
phh@9608 | 60 | return index; |
duke@435 | 61 | } |
duke@435 | 62 | |
duke@435 | 63 | MemoryManager* MemoryManager::get_code_cache_memory_manager() { |
duke@435 | 64 | return (MemoryManager*) new CodeCacheMemoryManager(); |
duke@435 | 65 | } |
duke@435 | 66 | |
ehelin@5312 | 67 | MemoryManager* MemoryManager::get_metaspace_memory_manager() { |
ehelin@5312 | 68 | return (MemoryManager*) new MetaspaceMemoryManager(); |
ehelin@5312 | 69 | } |
ehelin@5312 | 70 | |
duke@435 | 71 | GCMemoryManager* MemoryManager::get_copy_memory_manager() { |
duke@435 | 72 | return (GCMemoryManager*) new CopyMemoryManager(); |
duke@435 | 73 | } |
duke@435 | 74 | |
duke@435 | 75 | GCMemoryManager* MemoryManager::get_msc_memory_manager() { |
duke@435 | 76 | return (GCMemoryManager*) new MSCMemoryManager(); |
duke@435 | 77 | } |
duke@435 | 78 | |
duke@435 | 79 | GCMemoryManager* MemoryManager::get_parnew_memory_manager() { |
duke@435 | 80 | return (GCMemoryManager*) new ParNewMemoryManager(); |
duke@435 | 81 | } |
duke@435 | 82 | |
duke@435 | 83 | GCMemoryManager* MemoryManager::get_cms_memory_manager() { |
duke@435 | 84 | return (GCMemoryManager*) new CMSMemoryManager(); |
duke@435 | 85 | } |
duke@435 | 86 | |
duke@435 | 87 | GCMemoryManager* MemoryManager::get_psScavenge_memory_manager() { |
duke@435 | 88 | return (GCMemoryManager*) new PSScavengeMemoryManager(); |
duke@435 | 89 | } |
duke@435 | 90 | |
duke@435 | 91 | GCMemoryManager* MemoryManager::get_psMarkSweep_memory_manager() { |
duke@435 | 92 | return (GCMemoryManager*) new PSMarkSweepMemoryManager(); |
duke@435 | 93 | } |
duke@435 | 94 | |
tonyp@1524 | 95 | GCMemoryManager* MemoryManager::get_g1YoungGen_memory_manager() { |
tonyp@1524 | 96 | return (GCMemoryManager*) new G1YoungGenMemoryManager(); |
tonyp@1524 | 97 | } |
tonyp@1524 | 98 | |
tonyp@1524 | 99 | GCMemoryManager* MemoryManager::get_g1OldGen_memory_manager() { |
tonyp@1524 | 100 | return (GCMemoryManager*) new G1OldGenMemoryManager(); |
tonyp@1524 | 101 | } |
tonyp@1524 | 102 | |
duke@435 | 103 | instanceOop MemoryManager::get_memory_manager_instance(TRAPS) { |
duke@435 | 104 | // Must do an acquire so as to force ordering of subsequent |
duke@435 | 105 | // loads from anything _memory_mgr_obj points to or implies. |
duke@435 | 106 | instanceOop mgr_obj = (instanceOop)OrderAccess::load_ptr_acquire(&_memory_mgr_obj); |
duke@435 | 107 | if (mgr_obj == NULL) { |
duke@435 | 108 | // It's ok for more than one thread to execute the code up to the locked region. |
duke@435 | 109 | // Extra manager instances will just be gc'ed. |
coleenp@4037 | 110 | Klass* k = Management::sun_management_ManagementFactory_klass(CHECK_0); |
duke@435 | 111 | instanceKlassHandle ik(THREAD, k); |
duke@435 | 112 | |
duke@435 | 113 | Handle mgr_name = java_lang_String::create_from_str(name(), CHECK_0); |
duke@435 | 114 | |
duke@435 | 115 | JavaValue result(T_OBJECT); |
duke@435 | 116 | JavaCallArguments args; |
duke@435 | 117 | args.push_oop(mgr_name); // Argument 1 |
duke@435 | 118 | |
coleenp@2497 | 119 | Symbol* method_name = NULL; |
coleenp@2497 | 120 | Symbol* signature = NULL; |
duke@435 | 121 | if (is_gc_memory_manager()) { |
coleenp@2497 | 122 | method_name = vmSymbols::createGarbageCollector_name(); |
coleenp@2497 | 123 | signature = vmSymbols::createGarbageCollector_signature(); |
duke@435 | 124 | args.push_oop(Handle()); // Argument 2 (for future extension) |
duke@435 | 125 | } else { |
coleenp@2497 | 126 | method_name = vmSymbols::createMemoryManager_name(); |
coleenp@2497 | 127 | signature = vmSymbols::createMemoryManager_signature(); |
duke@435 | 128 | } |
duke@435 | 129 | |
duke@435 | 130 | JavaCalls::call_static(&result, |
duke@435 | 131 | ik, |
duke@435 | 132 | method_name, |
duke@435 | 133 | signature, |
duke@435 | 134 | &args, |
duke@435 | 135 | CHECK_0); |
duke@435 | 136 | |
duke@435 | 137 | instanceOop m = (instanceOop) result.get_jobject(); |
duke@435 | 138 | instanceHandle mgr(THREAD, m); |
duke@435 | 139 | |
duke@435 | 140 | { |
duke@435 | 141 | // Get lock before setting _memory_mgr_obj |
duke@435 | 142 | // since another thread may have created the instance |
duke@435 | 143 | MutexLocker ml(Management_lock); |
duke@435 | 144 | |
duke@435 | 145 | // Check if another thread has created the management object. We reload |
duke@435 | 146 | // _memory_mgr_obj here because some other thread may have initialized |
duke@435 | 147 | // it while we were executing the code before the lock. |
duke@435 | 148 | // |
duke@435 | 149 | // The lock has done an acquire, so the load can't float above it, but |
duke@435 | 150 | // we need to do a load_acquire as above. |
duke@435 | 151 | mgr_obj = (instanceOop)OrderAccess::load_ptr_acquire(&_memory_mgr_obj); |
duke@435 | 152 | if (mgr_obj != NULL) { |
duke@435 | 153 | return mgr_obj; |
duke@435 | 154 | } |
duke@435 | 155 | |
duke@435 | 156 | // Get the address of the object we created via call_special. |
duke@435 | 157 | mgr_obj = mgr(); |
duke@435 | 158 | |
duke@435 | 159 | // Use store barrier to make sure the memory accesses associated |
duke@435 | 160 | // with creating the management object are visible before publishing |
duke@435 | 161 | // its address. The unlock will publish the store to _memory_mgr_obj |
duke@435 | 162 | // because it does a release first. |
duke@435 | 163 | OrderAccess::release_store_ptr(&_memory_mgr_obj, mgr_obj); |
duke@435 | 164 | } |
duke@435 | 165 | } |
duke@435 | 166 | |
duke@435 | 167 | return mgr_obj; |
duke@435 | 168 | } |
duke@435 | 169 | |
duke@435 | 170 | void MemoryManager::oops_do(OopClosure* f) { |
duke@435 | 171 | f->do_oop((oop*) &_memory_mgr_obj); |
duke@435 | 172 | } |
duke@435 | 173 | |
duke@435 | 174 | GCStatInfo::GCStatInfo(int num_pools) { |
duke@435 | 175 | // initialize the arrays for memory usage |
zgu@3900 | 176 | _before_gc_usage_array = (MemoryUsage*) NEW_C_HEAP_ARRAY(MemoryUsage, num_pools, mtInternal); |
zgu@3900 | 177 | _after_gc_usage_array = (MemoryUsage*) NEW_C_HEAP_ARRAY(MemoryUsage, num_pools, mtInternal); |
duke@435 | 178 | _usage_array_size = num_pools; |
johnc@3291 | 179 | clear(); |
duke@435 | 180 | } |
duke@435 | 181 | |
duke@435 | 182 | GCStatInfo::~GCStatInfo() { |
zgu@3900 | 183 | FREE_C_HEAP_ARRAY(MemoryUsage*, _before_gc_usage_array, mtInternal); |
zgu@3900 | 184 | FREE_C_HEAP_ARRAY(MemoryUsage*, _after_gc_usage_array, mtInternal); |
duke@435 | 185 | } |
duke@435 | 186 | |
duke@435 | 187 | void GCStatInfo::set_gc_usage(int pool_index, MemoryUsage usage, bool before_gc) { |
duke@435 | 188 | MemoryUsage* gc_usage_array; |
duke@435 | 189 | if (before_gc) { |
duke@435 | 190 | gc_usage_array = _before_gc_usage_array; |
duke@435 | 191 | } else { |
duke@435 | 192 | gc_usage_array = _after_gc_usage_array; |
duke@435 | 193 | } |
duke@435 | 194 | gc_usage_array[pool_index] = usage; |
duke@435 | 195 | } |
duke@435 | 196 | |
kevinw@2058 | 197 | void GCStatInfo::clear() { |
kevinw@2058 | 198 | _index = 0; |
kevinw@2058 | 199 | _start_time = 0L; |
kevinw@2058 | 200 | _end_time = 0L; |
kevinw@2058 | 201 | size_t len = _usage_array_size * sizeof(MemoryUsage); |
kevinw@2058 | 202 | memset(_before_gc_usage_array, 0, len); |
kevinw@2058 | 203 | memset(_after_gc_usage_array, 0, len); |
kevinw@2058 | 204 | } |
kevinw@2058 | 205 | |
kevinw@2058 | 206 | |
duke@435 | 207 | GCMemoryManager::GCMemoryManager() : MemoryManager() { |
duke@435 | 208 | _num_collections = 0; |
duke@435 | 209 | _last_gc_stat = NULL; |
kevinw@2058 | 210 | _last_gc_lock = new Mutex(Mutex::leaf, "_last_gc_lock", true); |
kevinw@2058 | 211 | _current_gc_stat = NULL; |
duke@435 | 212 | _num_gc_threads = 1; |
fparain@2888 | 213 | _notification_enabled = false; |
duke@435 | 214 | } |
duke@435 | 215 | |
duke@435 | 216 | GCMemoryManager::~GCMemoryManager() { |
duke@435 | 217 | delete _last_gc_stat; |
kevinw@2058 | 218 | delete _last_gc_lock; |
kevinw@2058 | 219 | delete _current_gc_stat; |
duke@435 | 220 | } |
duke@435 | 221 | |
phh@9608 | 222 | void GCMemoryManager::add_pool(MemoryPool* pool) { |
phh@9608 | 223 | add_pool(pool, true); |
phh@9608 | 224 | } |
phh@9608 | 225 | |
phh@9608 | 226 | void GCMemoryManager::add_pool(MemoryPool* pool, bool always_affected_by_gc) { |
phh@9608 | 227 | int index = MemoryManager::add_pool(pool); |
phh@9608 | 228 | _pool_always_affected_by_gc[index] = always_affected_by_gc; |
phh@9608 | 229 | } |
phh@9608 | 230 | |
duke@435 | 231 | void GCMemoryManager::initialize_gc_stat_info() { |
duke@435 | 232 | assert(MemoryService::num_memory_pools() > 0, "should have one or more memory pools"); |
zgu@3900 | 233 | _last_gc_stat = new(ResourceObj::C_HEAP, mtGC) GCStatInfo(MemoryService::num_memory_pools()); |
zgu@3900 | 234 | _current_gc_stat = new(ResourceObj::C_HEAP, mtGC) GCStatInfo(MemoryService::num_memory_pools()); |
kevinw@2058 | 235 | // tracking concurrent collections we need two objects: one to update, and one to |
kevinw@2058 | 236 | // hold the publicly available "last (completed) gc" information. |
duke@435 | 237 | } |
duke@435 | 238 | |
kevinw@2058 | 239 | void GCMemoryManager::gc_begin(bool recordGCBeginTime, bool recordPreGCUsage, |
kevinw@2058 | 240 | bool recordAccumulatedGCTime) { |
kevinw@2058 | 241 | assert(_last_gc_stat != NULL && _current_gc_stat != NULL, "Just checking"); |
kevinw@2058 | 242 | if (recordAccumulatedGCTime) { |
kevinw@2058 | 243 | _accumulated_timer.start(); |
kevinw@2058 | 244 | } |
kevinw@2058 | 245 | // _num_collections now increases in gc_end, to count completed collections |
kevinw@2058 | 246 | if (recordGCBeginTime) { |
kevinw@2058 | 247 | _current_gc_stat->set_index(_num_collections+1); |
kevinw@2058 | 248 | _current_gc_stat->set_start_time(Management::timestamp()); |
kevinw@2058 | 249 | } |
duke@435 | 250 | |
kevinw@2058 | 251 | if (recordPreGCUsage) { |
kevinw@2058 | 252 | // Keep memory usage of all memory pools |
kevinw@2058 | 253 | for (int i = 0; i < MemoryService::num_memory_pools(); i++) { |
kevinw@2058 | 254 | MemoryPool* pool = MemoryService::get_memory_pool(i); |
kevinw@2058 | 255 | MemoryUsage usage = pool->get_memory_usage(); |
kevinw@2058 | 256 | _current_gc_stat->set_before_gc_usage(i, usage); |
dcubed@3202 | 257 | #ifndef USDT2 |
kevinw@2058 | 258 | HS_DTRACE_PROBE8(hotspot, mem__pool__gc__begin, |
kevinw@2058 | 259 | name(), strlen(name()), |
kevinw@2058 | 260 | pool->name(), strlen(pool->name()), |
kevinw@2058 | 261 | usage.init_size(), usage.used(), |
kevinw@2058 | 262 | usage.committed(), usage.max_size()); |
dcubed@3202 | 263 | #else /* USDT2 */ |
dcubed@3202 | 264 | HOTSPOT_MEM_POOL_GC_BEGIN( |
dcubed@3202 | 265 | (char *) name(), strlen(name()), |
dcubed@3202 | 266 | (char *) pool->name(), strlen(pool->name()), |
dcubed@3202 | 267 | usage.init_size(), usage.used(), |
dcubed@3202 | 268 | usage.committed(), usage.max_size()); |
dcubed@3202 | 269 | #endif /* USDT2 */ |
kevinw@2058 | 270 | } |
duke@435 | 271 | } |
duke@435 | 272 | } |
duke@435 | 273 | |
kevinw@2058 | 274 | // A collector MUST, even if it does not complete for some reason, |
kevinw@2058 | 275 | // make a TraceMemoryManagerStats object where countCollection is true, |
kevinw@2058 | 276 | // to ensure the current gc stat is placed in _last_gc_stat. |
kevinw@2058 | 277 | void GCMemoryManager::gc_end(bool recordPostGCUsage, |
kevinw@2058 | 278 | bool recordAccumulatedGCTime, |
fparain@2888 | 279 | bool recordGCEndTime, bool countCollection, |
phh@9608 | 280 | GCCause::Cause cause, |
phh@9608 | 281 | bool allMemoryPoolsAffected) { |
kevinw@2058 | 282 | if (recordAccumulatedGCTime) { |
kevinw@2058 | 283 | _accumulated_timer.stop(); |
kevinw@2058 | 284 | } |
kevinw@2058 | 285 | if (recordGCEndTime) { |
kevinw@2058 | 286 | _current_gc_stat->set_end_time(Management::timestamp()); |
duke@435 | 287 | } |
duke@435 | 288 | |
kevinw@2058 | 289 | if (recordPostGCUsage) { |
kevinw@2058 | 290 | int i; |
kevinw@2058 | 291 | // keep the last gc statistics for all memory pools |
kevinw@2058 | 292 | for (i = 0; i < MemoryService::num_memory_pools(); i++) { |
kevinw@2058 | 293 | MemoryPool* pool = MemoryService::get_memory_pool(i); |
kevinw@2058 | 294 | MemoryUsage usage = pool->get_memory_usage(); |
duke@435 | 295 | |
dcubed@3202 | 296 | #ifndef USDT2 |
kevinw@2058 | 297 | HS_DTRACE_PROBE8(hotspot, mem__pool__gc__end, |
kevinw@2058 | 298 | name(), strlen(name()), |
kevinw@2058 | 299 | pool->name(), strlen(pool->name()), |
kevinw@2058 | 300 | usage.init_size(), usage.used(), |
kevinw@2058 | 301 | usage.committed(), usage.max_size()); |
dcubed@3202 | 302 | #else /* USDT2 */ |
dcubed@3202 | 303 | HOTSPOT_MEM_POOL_GC_END( |
dcubed@3202 | 304 | (char *) name(), strlen(name()), |
dcubed@3202 | 305 | (char *) pool->name(), strlen(pool->name()), |
dcubed@3202 | 306 | usage.init_size(), usage.used(), |
dcubed@3202 | 307 | usage.committed(), usage.max_size()); |
dcubed@3202 | 308 | #endif /* USDT2 */ |
kevinw@2058 | 309 | |
kevinw@2058 | 310 | _current_gc_stat->set_after_gc_usage(i, usage); |
kevinw@2058 | 311 | } |
kevinw@2058 | 312 | |
kevinw@2058 | 313 | // Set last collection usage of the memory pools managed by this collector |
kevinw@2058 | 314 | for (i = 0; i < num_memory_pools(); i++) { |
kevinw@2058 | 315 | MemoryPool* pool = get_memory_pool(i); |
kevinw@2058 | 316 | MemoryUsage usage = pool->get_memory_usage(); |
kevinw@2058 | 317 | |
kevinw@2058 | 318 | // Compare with GC usage threshold |
phh@9608 | 319 | if (allMemoryPoolsAffected || pool_always_affected_by_gc(i)) { |
phh@9608 | 320 | // Compare with GC usage threshold |
phh@9608 | 321 | pool->set_last_collection_usage(usage); |
phh@9608 | 322 | LowMemoryDetector::detect_after_gc_memory(pool); |
phh@9608 | 323 | } |
kevinw@2058 | 324 | } |
kevinw@2058 | 325 | } |
johnc@3291 | 326 | |
kevinw@2058 | 327 | if (countCollection) { |
kevinw@2058 | 328 | _num_collections++; |
kevinw@2058 | 329 | // alternately update two objects making one public when complete |
kevinw@2058 | 330 | { |
kevinw@2058 | 331 | MutexLockerEx ml(_last_gc_lock, Mutex::_no_safepoint_check_flag); |
kevinw@2058 | 332 | GCStatInfo *tmp = _last_gc_stat; |
kevinw@2058 | 333 | _last_gc_stat = _current_gc_stat; |
kevinw@2058 | 334 | _current_gc_stat = tmp; |
kevinw@2058 | 335 | // reset the current stat for diagnosability purposes |
kevinw@2058 | 336 | _current_gc_stat->clear(); |
kevinw@2058 | 337 | } |
johnc@3291 | 338 | |
johnc@3291 | 339 | if (is_notification_enabled()) { |
johnc@3291 | 340 | bool isMajorGC = this == MemoryService::get_major_gc_manager(); |
johnc@3291 | 341 | GCNotifier::pushNotification(this, isMajorGC ? "end of major GC" : "end of minor GC", |
johnc@3291 | 342 | GCCause::to_string(cause)); |
johnc@3291 | 343 | } |
duke@435 | 344 | } |
duke@435 | 345 | } |
kevinw@2058 | 346 | |
kevinw@2058 | 347 | size_t GCMemoryManager::get_last_gc_stat(GCStatInfo* dest) { |
kevinw@2058 | 348 | MutexLockerEx ml(_last_gc_lock, Mutex::_no_safepoint_check_flag); |
kevinw@2058 | 349 | if (_last_gc_stat->gc_index() != 0) { |
kevinw@2058 | 350 | dest->set_index(_last_gc_stat->gc_index()); |
kevinw@2058 | 351 | dest->set_start_time(_last_gc_stat->start_time()); |
kevinw@2058 | 352 | dest->set_end_time(_last_gc_stat->end_time()); |
kevinw@2058 | 353 | assert(dest->usage_array_size() == _last_gc_stat->usage_array_size(), |
kevinw@2058 | 354 | "Must have same array size"); |
kevinw@2058 | 355 | size_t len = dest->usage_array_size() * sizeof(MemoryUsage); |
kevinw@2058 | 356 | memcpy(dest->before_gc_usage_array(), _last_gc_stat->before_gc_usage_array(), len); |
kevinw@2058 | 357 | memcpy(dest->after_gc_usage_array(), _last_gc_stat->after_gc_usage_array(), len); |
kevinw@2058 | 358 | } |
kevinw@2058 | 359 | return _last_gc_stat->gc_index(); |
kevinw@2058 | 360 | } |