src/share/vm/services/memoryService.cpp

Mon, 25 Mar 2013 11:00:19 +0100

author
stefank
date
Mon, 25 Mar 2013 11:00:19 +0100
changeset 4826
338b3a9e29b5
parent 4761
8b4ce9870fd6
parent 4825
dbd5837b342f
child 4827
42e370795a39
permissions
-rw-r--r--

Merge

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 #include "precompiled.hpp"
stefank@2314 26 #include "classfile/systemDictionary.hpp"
stefank@2314 27 #include "classfile/vmSymbols.hpp"
stefank@2314 28 #include "gc_implementation/shared/mutableSpace.hpp"
stefank@2314 29 #include "memory/collectorPolicy.hpp"
stefank@2314 30 #include "memory/defNewGeneration.hpp"
stefank@2314 31 #include "memory/genCollectedHeap.hpp"
stefank@2314 32 #include "memory/generation.hpp"
stefank@2314 33 #include "memory/generationSpec.hpp"
stefank@2314 34 #include "memory/heap.hpp"
stefank@2314 35 #include "memory/memRegion.hpp"
stefank@2314 36 #include "memory/tenuredGeneration.hpp"
stefank@2314 37 #include "oops/oop.inline.hpp"
stefank@2314 38 #include "runtime/javaCalls.hpp"
stefank@2314 39 #include "services/classLoadingService.hpp"
stefank@2314 40 #include "services/lowMemoryDetector.hpp"
stefank@2314 41 #include "services/management.hpp"
stefank@2314 42 #include "services/memoryManager.hpp"
stefank@2314 43 #include "services/memoryPool.hpp"
stefank@2314 44 #include "services/memoryService.hpp"
stefank@2314 45 #include "utilities/growableArray.hpp"
jprovino@4542 46 #include "utilities/macros.hpp"
jprovino@4542 47 #if INCLUDE_ALL_GCS
stefank@2314 48 #include "gc_implementation/concurrentMarkSweep/concurrentMarkSweepGeneration.hpp"
stefank@2314 49 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
stefank@2314 50 #include "gc_implementation/parNew/parNewGeneration.hpp"
stefank@2314 51 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp"
stefank@2314 52 #include "gc_implementation/parallelScavenge/psOldGen.hpp"
stefank@2314 53 #include "gc_implementation/parallelScavenge/psYoungGen.hpp"
stefank@2314 54 #include "services/g1MemoryPool.hpp"
stefank@2314 55 #include "services/psMemoryPool.hpp"
jprovino@4542 56 #endif // INCLUDE_ALL_GCS
duke@435 57
duke@435 58 GrowableArray<MemoryPool*>* MemoryService::_pools_list =
zgu@3900 59 new (ResourceObj::C_HEAP, mtInternal) GrowableArray<MemoryPool*>(init_pools_list_size, true);
duke@435 60 GrowableArray<MemoryManager*>* MemoryService::_managers_list =
zgu@3900 61 new (ResourceObj::C_HEAP, mtInternal) GrowableArray<MemoryManager*>(init_managers_list_size, true);
duke@435 62
ehelin@4825 63 GCMemoryManager* MemoryService::_minor_gc_manager = NULL;
ehelin@4825 64 GCMemoryManager* MemoryService::_major_gc_manager = NULL;
ehelin@4825 65 MemoryPool* MemoryService::_code_heap_pool = NULL;
ehelin@4825 66 MemoryPool* MemoryService::_metaspace_pool = NULL;
ehelin@4825 67 MemoryPool* MemoryService::_class_metaspace_pool = NULL;
duke@435 68
duke@435 69 class GcThreadCountClosure: public ThreadClosure {
duke@435 70 private:
duke@435 71 int _count;
duke@435 72 public:
duke@435 73 GcThreadCountClosure() : _count(0) {};
duke@435 74 void do_thread(Thread* thread);
duke@435 75 int count() { return _count; }
duke@435 76 };
duke@435 77
duke@435 78 void GcThreadCountClosure::do_thread(Thread* thread) {
duke@435 79 _count++;
duke@435 80 }
duke@435 81
duke@435 82 void MemoryService::set_universe_heap(CollectedHeap* heap) {
duke@435 83 CollectedHeap::Name kind = heap->kind();
duke@435 84 switch (kind) {
duke@435 85 case CollectedHeap::GenCollectedHeap : {
duke@435 86 add_gen_collected_heap_info(GenCollectedHeap::heap());
duke@435 87 break;
duke@435 88 }
jprovino@4542 89 #if INCLUDE_ALL_GCS
duke@435 90 case CollectedHeap::ParallelScavengeHeap : {
duke@435 91 add_parallel_scavenge_heap_info(ParallelScavengeHeap::heap());
duke@435 92 break;
duke@435 93 }
ysr@777 94 case CollectedHeap::G1CollectedHeap : {
tonyp@1524 95 add_g1_heap_info(G1CollectedHeap::heap());
tonyp@1524 96 break;
ysr@777 97 }
jprovino@4542 98 #endif // INCLUDE_ALL_GCS
duke@435 99 default: {
ysr@777 100 guarantee(false, "Unrecognized kind of heap");
duke@435 101 }
duke@435 102 }
duke@435 103
duke@435 104 // set the GC thread count
duke@435 105 GcThreadCountClosure gctcc;
duke@435 106 heap->gc_threads_do(&gctcc);
duke@435 107 int count = gctcc.count();
duke@435 108 if (count > 0) {
duke@435 109 _minor_gc_manager->set_num_gc_threads(count);
duke@435 110 _major_gc_manager->set_num_gc_threads(count);
duke@435 111 }
duke@435 112
duke@435 113 // All memory pools and memory managers are initialized.
duke@435 114 //
duke@435 115 _minor_gc_manager->initialize_gc_stat_info();
duke@435 116 _major_gc_manager->initialize_gc_stat_info();
duke@435 117 }
duke@435 118
duke@435 119 // Add memory pools for GenCollectedHeap
duke@435 120 // This function currently only supports two generations collected heap.
duke@435 121 // The collector for GenCollectedHeap will have two memory managers.
duke@435 122 void MemoryService::add_gen_collected_heap_info(GenCollectedHeap* heap) {
duke@435 123 CollectorPolicy* policy = heap->collector_policy();
duke@435 124
duke@435 125 assert(policy->is_two_generation_policy(), "Only support two generations");
duke@435 126 guarantee(heap->n_gens() == 2, "Only support two-generation heap");
duke@435 127
duke@435 128 TwoGenerationCollectorPolicy* two_gen_policy = policy->as_two_generation_policy();
duke@435 129 if (two_gen_policy != NULL) {
duke@435 130 GenerationSpec** specs = two_gen_policy->generations();
duke@435 131 Generation::Name kind = specs[0]->name();
duke@435 132 switch (kind) {
duke@435 133 case Generation::DefNew:
duke@435 134 _minor_gc_manager = MemoryManager::get_copy_memory_manager();
duke@435 135 break;
jprovino@4542 136 #if INCLUDE_ALL_GCS
duke@435 137 case Generation::ParNew:
duke@435 138 case Generation::ASParNew:
duke@435 139 _minor_gc_manager = MemoryManager::get_parnew_memory_manager();
duke@435 140 break;
jprovino@4542 141 #endif // INCLUDE_ALL_GCS
duke@435 142 default:
duke@435 143 guarantee(false, "Unrecognized generation spec");
duke@435 144 break;
duke@435 145 }
duke@435 146 if (policy->is_mark_sweep_policy()) {
duke@435 147 _major_gc_manager = MemoryManager::get_msc_memory_manager();
jprovino@4542 148 #if INCLUDE_ALL_GCS
duke@435 149 } else if (policy->is_concurrent_mark_sweep_policy()) {
duke@435 150 _major_gc_manager = MemoryManager::get_cms_memory_manager();
jprovino@4542 151 #endif // INCLUDE_ALL_GCS
duke@435 152 } else {
duke@435 153 guarantee(false, "Unknown two-gen policy");
duke@435 154 }
duke@435 155 } else {
duke@435 156 guarantee(false, "Non two-gen policy");
duke@435 157 }
duke@435 158 _managers_list->append(_minor_gc_manager);
duke@435 159 _managers_list->append(_major_gc_manager);
duke@435 160
duke@435 161 add_generation_memory_pool(heap->get_gen(minor), _major_gc_manager, _minor_gc_manager);
duke@435 162 add_generation_memory_pool(heap->get_gen(major), _major_gc_manager);
duke@435 163 }
duke@435 164
jprovino@4542 165 #if INCLUDE_ALL_GCS
duke@435 166 // Add memory pools for ParallelScavengeHeap
duke@435 167 // This function currently only supports two generations collected heap.
duke@435 168 // The collector for ParallelScavengeHeap will have two memory managers.
duke@435 169 void MemoryService::add_parallel_scavenge_heap_info(ParallelScavengeHeap* heap) {
duke@435 170 // Two managers to keep statistics about _minor_gc_manager and _major_gc_manager GC.
duke@435 171 _minor_gc_manager = MemoryManager::get_psScavenge_memory_manager();
duke@435 172 _major_gc_manager = MemoryManager::get_psMarkSweep_memory_manager();
duke@435 173 _managers_list->append(_minor_gc_manager);
duke@435 174 _managers_list->append(_major_gc_manager);
duke@435 175
duke@435 176 add_psYoung_memory_pool(heap->young_gen(), _major_gc_manager, _minor_gc_manager);
duke@435 177 add_psOld_memory_pool(heap->old_gen(), _major_gc_manager);
duke@435 178 }
tonyp@1524 179
tonyp@1524 180 void MemoryService::add_g1_heap_info(G1CollectedHeap* g1h) {
tonyp@1524 181 assert(UseG1GC, "sanity");
tonyp@1524 182
tonyp@1524 183 _minor_gc_manager = MemoryManager::get_g1YoungGen_memory_manager();
tonyp@1524 184 _major_gc_manager = MemoryManager::get_g1OldGen_memory_manager();
tonyp@1524 185 _managers_list->append(_minor_gc_manager);
tonyp@1524 186 _managers_list->append(_major_gc_manager);
tonyp@1524 187
tonyp@1524 188 add_g1YoungGen_memory_pool(g1h, _major_gc_manager, _minor_gc_manager);
tonyp@1524 189 add_g1OldGen_memory_pool(g1h, _major_gc_manager);
tonyp@1524 190 }
jprovino@4542 191 #endif // INCLUDE_ALL_GCS
duke@435 192
duke@435 193 MemoryPool* MemoryService::add_gen(Generation* gen,
duke@435 194 const char* name,
duke@435 195 bool is_heap,
duke@435 196 bool support_usage_threshold) {
duke@435 197
duke@435 198 MemoryPool::PoolType type = (is_heap ? MemoryPool::Heap : MemoryPool::NonHeap);
duke@435 199 GenerationPool* pool = new GenerationPool(gen, name, type, support_usage_threshold);
duke@435 200 _pools_list->append(pool);
duke@435 201 return (MemoryPool*) pool;
duke@435 202 }
duke@435 203
duke@435 204 MemoryPool* MemoryService::add_space(ContiguousSpace* space,
duke@435 205 const char* name,
duke@435 206 bool is_heap,
duke@435 207 size_t max_size,
duke@435 208 bool support_usage_threshold) {
duke@435 209 MemoryPool::PoolType type = (is_heap ? MemoryPool::Heap : MemoryPool::NonHeap);
duke@435 210 ContiguousSpacePool* pool = new ContiguousSpacePool(space, name, type, max_size, support_usage_threshold);
duke@435 211
duke@435 212 _pools_list->append(pool);
duke@435 213 return (MemoryPool*) pool;
duke@435 214 }
duke@435 215
duke@435 216 MemoryPool* MemoryService::add_survivor_spaces(DefNewGeneration* gen,
duke@435 217 const char* name,
duke@435 218 bool is_heap,
duke@435 219 size_t max_size,
duke@435 220 bool support_usage_threshold) {
duke@435 221 MemoryPool::PoolType type = (is_heap ? MemoryPool::Heap : MemoryPool::NonHeap);
duke@435 222 SurvivorContiguousSpacePool* pool = new SurvivorContiguousSpacePool(gen, name, type, max_size, support_usage_threshold);
duke@435 223
duke@435 224 _pools_list->append(pool);
duke@435 225 return (MemoryPool*) pool;
duke@435 226 }
duke@435 227
jprovino@4542 228 #if INCLUDE_ALL_GCS
duke@435 229 MemoryPool* MemoryService::add_cms_space(CompactibleFreeListSpace* space,
duke@435 230 const char* name,
duke@435 231 bool is_heap,
duke@435 232 size_t max_size,
duke@435 233 bool support_usage_threshold) {
duke@435 234 MemoryPool::PoolType type = (is_heap ? MemoryPool::Heap : MemoryPool::NonHeap);
duke@435 235 CompactibleFreeListSpacePool* pool = new CompactibleFreeListSpacePool(space, name, type, max_size, support_usage_threshold);
duke@435 236 _pools_list->append(pool);
duke@435 237 return (MemoryPool*) pool;
duke@435 238 }
jprovino@4542 239 #endif // INCLUDE_ALL_GCS
duke@435 240
duke@435 241 // Add memory pool(s) for one generation
duke@435 242 void MemoryService::add_generation_memory_pool(Generation* gen,
duke@435 243 MemoryManager* major_mgr,
duke@435 244 MemoryManager* minor_mgr) {
morris@4761 245 guarantee(gen != NULL, "No generation for memory pool");
duke@435 246 Generation::Name kind = gen->kind();
duke@435 247 int index = _pools_list->length();
duke@435 248
duke@435 249 switch (kind) {
duke@435 250 case Generation::DefNew: {
duke@435 251 assert(major_mgr != NULL && minor_mgr != NULL, "Should have two managers");
duke@435 252 DefNewGeneration* young_gen = (DefNewGeneration*) gen;
duke@435 253 // Add a memory pool for each space and young gen doesn't
duke@435 254 // support low memory detection as it is expected to get filled up.
duke@435 255 MemoryPool* eden = add_space(young_gen->eden(),
duke@435 256 "Eden Space",
duke@435 257 true, /* is_heap */
duke@435 258 young_gen->max_eden_size(),
duke@435 259 false /* support_usage_threshold */);
duke@435 260 MemoryPool* survivor = add_survivor_spaces(young_gen,
duke@435 261 "Survivor Space",
duke@435 262 true, /* is_heap */
duke@435 263 young_gen->max_survivor_size(),
duke@435 264 false /* support_usage_threshold */);
duke@435 265 break;
duke@435 266 }
duke@435 267
jprovino@4542 268 #if INCLUDE_ALL_GCS
duke@435 269 case Generation::ParNew:
duke@435 270 case Generation::ASParNew:
duke@435 271 {
duke@435 272 assert(major_mgr != NULL && minor_mgr != NULL, "Should have two managers");
duke@435 273 // Add a memory pool for each space and young gen doesn't
duke@435 274 // support low memory detection as it is expected to get filled up.
duke@435 275 ParNewGeneration* parnew_gen = (ParNewGeneration*) gen;
duke@435 276 MemoryPool* eden = add_space(parnew_gen->eden(),
duke@435 277 "Par Eden Space",
duke@435 278 true /* is_heap */,
duke@435 279 parnew_gen->max_eden_size(),
duke@435 280 false /* support_usage_threshold */);
duke@435 281 MemoryPool* survivor = add_survivor_spaces(parnew_gen,
duke@435 282 "Par Survivor Space",
duke@435 283 true, /* is_heap */
duke@435 284 parnew_gen->max_survivor_size(),
duke@435 285 false /* support_usage_threshold */);
duke@435 286
duke@435 287 break;
duke@435 288 }
jprovino@4542 289 #endif // INCLUDE_ALL_GCS
duke@435 290
duke@435 291 case Generation::MarkSweepCompact: {
duke@435 292 assert(major_mgr != NULL && minor_mgr == NULL, "Should have only one manager");
duke@435 293 add_gen(gen,
duke@435 294 "Tenured Gen",
duke@435 295 true, /* is_heap */
duke@435 296 true /* support_usage_threshold */);
duke@435 297 break;
duke@435 298 }
duke@435 299
jprovino@4542 300 #if INCLUDE_ALL_GCS
duke@435 301 case Generation::ConcurrentMarkSweep:
duke@435 302 case Generation::ASConcurrentMarkSweep:
duke@435 303 {
duke@435 304 assert(major_mgr != NULL && minor_mgr == NULL, "Should have only one manager");
duke@435 305 ConcurrentMarkSweepGeneration* cms = (ConcurrentMarkSweepGeneration*) gen;
duke@435 306 MemoryPool* pool = add_cms_space(cms->cmsSpace(),
duke@435 307 "CMS Old Gen",
duke@435 308 true, /* is_heap */
duke@435 309 cms->reserved().byte_size(),
duke@435 310 true /* support_usage_threshold */);
duke@435 311 break;
duke@435 312 }
jprovino@4542 313 #endif // INCLUDE_ALL_GCS
duke@435 314
duke@435 315 default:
duke@435 316 assert(false, "should not reach here");
duke@435 317 // no memory pool added for others
duke@435 318 break;
duke@435 319 }
duke@435 320
duke@435 321 assert(major_mgr != NULL, "Should have at least one manager");
duke@435 322 // Link managers and the memory pools together
duke@435 323 for (int i = index; i < _pools_list->length(); i++) {
duke@435 324 MemoryPool* pool = _pools_list->at(i);
duke@435 325 major_mgr->add_pool(pool);
duke@435 326 if (minor_mgr != NULL) {
duke@435 327 minor_mgr->add_pool(pool);
duke@435 328 }
duke@435 329 }
duke@435 330 }
duke@435 331
duke@435 332
jprovino@4542 333 #if INCLUDE_ALL_GCS
duke@435 334 void MemoryService::add_psYoung_memory_pool(PSYoungGen* gen, MemoryManager* major_mgr, MemoryManager* minor_mgr) {
duke@435 335 assert(major_mgr != NULL && minor_mgr != NULL, "Should have two managers");
duke@435 336
duke@435 337 // Add a memory pool for each space and young gen doesn't
duke@435 338 // support low memory detection as it is expected to get filled up.
duke@435 339 EdenMutableSpacePool* eden = new EdenMutableSpacePool(gen,
duke@435 340 gen->eden_space(),
duke@435 341 "PS Eden Space",
duke@435 342 MemoryPool::Heap,
duke@435 343 false /* support_usage_threshold */);
duke@435 344
duke@435 345 SurvivorMutableSpacePool* survivor = new SurvivorMutableSpacePool(gen,
duke@435 346 "PS Survivor Space",
duke@435 347 MemoryPool::Heap,
duke@435 348 false /* support_usage_threshold */);
duke@435 349
duke@435 350 major_mgr->add_pool(eden);
duke@435 351 major_mgr->add_pool(survivor);
duke@435 352 minor_mgr->add_pool(eden);
duke@435 353 minor_mgr->add_pool(survivor);
duke@435 354 _pools_list->append(eden);
duke@435 355 _pools_list->append(survivor);
duke@435 356 }
duke@435 357
duke@435 358 void MemoryService::add_psOld_memory_pool(PSOldGen* gen, MemoryManager* mgr) {
duke@435 359 PSGenerationPool* old_gen = new PSGenerationPool(gen,
duke@435 360 "PS Old Gen",
duke@435 361 MemoryPool::Heap,
duke@435 362 true /* support_usage_threshold */);
duke@435 363 mgr->add_pool(old_gen);
duke@435 364 _pools_list->append(old_gen);
duke@435 365 }
duke@435 366
tonyp@1524 367 void MemoryService::add_g1YoungGen_memory_pool(G1CollectedHeap* g1h,
tonyp@1524 368 MemoryManager* major_mgr,
tonyp@1524 369 MemoryManager* minor_mgr) {
tonyp@1524 370 assert(major_mgr != NULL && minor_mgr != NULL, "should have two managers");
tonyp@1524 371
tonyp@1524 372 G1EdenPool* eden = new G1EdenPool(g1h);
tonyp@1524 373 G1SurvivorPool* survivor = new G1SurvivorPool(g1h);
tonyp@1524 374
tonyp@1524 375 major_mgr->add_pool(eden);
tonyp@1524 376 major_mgr->add_pool(survivor);
tonyp@1524 377 minor_mgr->add_pool(eden);
tonyp@1524 378 minor_mgr->add_pool(survivor);
tonyp@1524 379 _pools_list->append(eden);
tonyp@1524 380 _pools_list->append(survivor);
tonyp@1524 381 }
tonyp@1524 382
tonyp@1524 383 void MemoryService::add_g1OldGen_memory_pool(G1CollectedHeap* g1h,
tonyp@1524 384 MemoryManager* mgr) {
tonyp@1524 385 assert(mgr != NULL, "should have one manager");
tonyp@1524 386
tonyp@1524 387 G1OldGenPool* old_gen = new G1OldGenPool(g1h);
tonyp@1524 388 mgr->add_pool(old_gen);
tonyp@1524 389 _pools_list->append(old_gen);
tonyp@1524 390 }
jprovino@4542 391 #endif // INCLUDE_ALL_GCS
duke@435 392
duke@435 393 void MemoryService::add_code_heap_memory_pool(CodeHeap* heap) {
duke@435 394 _code_heap_pool = new CodeHeapPool(heap,
duke@435 395 "Code Cache",
duke@435 396 true /* support_usage_threshold */);
duke@435 397 MemoryManager* mgr = MemoryManager::get_code_cache_memory_manager();
duke@435 398 mgr->add_pool(_code_heap_pool);
duke@435 399
duke@435 400 _pools_list->append(_code_heap_pool);
duke@435 401 _managers_list->append(mgr);
duke@435 402 }
duke@435 403
ehelin@4825 404 void MemoryService::add_metaspace_memory_pools() {
ehelin@4825 405 _metaspace_pool = new MetaspacePool();
ehelin@4825 406 _class_metaspace_pool = new ClassMetaspacePool();
ehelin@4825 407
ehelin@4825 408 MemoryManager* mgr = MemoryManager::get_metaspace_memory_manager();
ehelin@4825 409 mgr->add_pool(_metaspace_pool);
ehelin@4825 410 mgr->add_pool(_class_metaspace_pool);
ehelin@4825 411
ehelin@4825 412 _pools_list->append(_metaspace_pool);
ehelin@4825 413 _pools_list->append(_class_metaspace_pool);
ehelin@4825 414 _managers_list->append(mgr);
ehelin@4825 415 }
ehelin@4825 416
duke@435 417 MemoryManager* MemoryService::get_memory_manager(instanceHandle mh) {
duke@435 418 for (int i = 0; i < _managers_list->length(); i++) {
duke@435 419 MemoryManager* mgr = _managers_list->at(i);
duke@435 420 if (mgr->is_manager(mh)) {
duke@435 421 return mgr;
duke@435 422 }
duke@435 423 }
duke@435 424 return NULL;
duke@435 425 }
duke@435 426
duke@435 427 MemoryPool* MemoryService::get_memory_pool(instanceHandle ph) {
duke@435 428 for (int i = 0; i < _pools_list->length(); i++) {
duke@435 429 MemoryPool* pool = _pools_list->at(i);
duke@435 430 if (pool->is_pool(ph)) {
duke@435 431 return pool;
duke@435 432 }
duke@435 433 }
duke@435 434 return NULL;
duke@435 435 }
duke@435 436
duke@435 437 void MemoryService::track_memory_usage() {
duke@435 438 // Track the peak memory usage
duke@435 439 for (int i = 0; i < _pools_list->length(); i++) {
duke@435 440 MemoryPool* pool = _pools_list->at(i);
duke@435 441 pool->record_peak_memory_usage();
duke@435 442 }
duke@435 443
duke@435 444 // Detect low memory
duke@435 445 LowMemoryDetector::detect_low_memory();
duke@435 446 }
duke@435 447
duke@435 448 void MemoryService::track_memory_pool_usage(MemoryPool* pool) {
duke@435 449 // Track the peak memory usage
duke@435 450 pool->record_peak_memory_usage();
duke@435 451
duke@435 452 // Detect low memory
duke@435 453 if (LowMemoryDetector::is_enabled(pool)) {
duke@435 454 LowMemoryDetector::detect_low_memory(pool);
duke@435 455 }
duke@435 456 }
duke@435 457
kevinw@2058 458 void MemoryService::gc_begin(bool fullGC, bool recordGCBeginTime,
kevinw@2058 459 bool recordAccumulatedGCTime,
kevinw@2058 460 bool recordPreGCUsage, bool recordPeakUsage) {
kevinw@2058 461
duke@435 462 GCMemoryManager* mgr;
duke@435 463 if (fullGC) {
duke@435 464 mgr = _major_gc_manager;
duke@435 465 } else {
duke@435 466 mgr = _minor_gc_manager;
duke@435 467 }
duke@435 468 assert(mgr->is_gc_memory_manager(), "Sanity check");
kevinw@2058 469 mgr->gc_begin(recordGCBeginTime, recordPreGCUsage, recordAccumulatedGCTime);
duke@435 470
duke@435 471 // Track the peak memory usage when GC begins
kevinw@2058 472 if (recordPeakUsage) {
kevinw@2058 473 for (int i = 0; i < _pools_list->length(); i++) {
kevinw@2058 474 MemoryPool* pool = _pools_list->at(i);
kevinw@2058 475 pool->record_peak_memory_usage();
kevinw@2058 476 }
duke@435 477 }
duke@435 478 }
duke@435 479
kevinw@2058 480 void MemoryService::gc_end(bool fullGC, bool recordPostGCUsage,
kevinw@2058 481 bool recordAccumulatedGCTime,
fparain@2888 482 bool recordGCEndTime, bool countCollection,
fparain@2888 483 GCCause::Cause cause) {
kevinw@2058 484
duke@435 485 GCMemoryManager* mgr;
duke@435 486 if (fullGC) {
duke@435 487 mgr = (GCMemoryManager*) _major_gc_manager;
duke@435 488 } else {
duke@435 489 mgr = (GCMemoryManager*) _minor_gc_manager;
duke@435 490 }
duke@435 491 assert(mgr->is_gc_memory_manager(), "Sanity check");
duke@435 492
duke@435 493 // register the GC end statistics and memory usage
kevinw@2058 494 mgr->gc_end(recordPostGCUsage, recordAccumulatedGCTime, recordGCEndTime,
fparain@2888 495 countCollection, cause);
duke@435 496 }
duke@435 497
duke@435 498 void MemoryService::oops_do(OopClosure* f) {
duke@435 499 int i;
duke@435 500
duke@435 501 for (i = 0; i < _pools_list->length(); i++) {
duke@435 502 MemoryPool* pool = _pools_list->at(i);
duke@435 503 pool->oops_do(f);
duke@435 504 }
duke@435 505 for (i = 0; i < _managers_list->length(); i++) {
duke@435 506 MemoryManager* mgr = _managers_list->at(i);
duke@435 507 mgr->oops_do(f);
duke@435 508 }
duke@435 509 }
duke@435 510
duke@435 511 bool MemoryService::set_verbose(bool verbose) {
duke@435 512 MutexLocker m(Management_lock);
duke@435 513 // verbose will be set to the previous value
duke@435 514 bool succeed = CommandLineFlags::boolAtPut((char*)"PrintGC", &verbose, MANAGEMENT);
duke@435 515 assert(succeed, "Setting PrintGC flag fails");
duke@435 516 ClassLoadingService::reset_trace_class_unloading();
duke@435 517
duke@435 518 return verbose;
duke@435 519 }
duke@435 520
duke@435 521 Handle MemoryService::create_MemoryUsage_obj(MemoryUsage usage, TRAPS) {
coleenp@4037 522 Klass* k = Management::java_lang_management_MemoryUsage_klass(CHECK_NH);
duke@435 523 instanceKlassHandle ik(THREAD, k);
duke@435 524
duke@435 525 instanceHandle obj = ik->allocate_instance_handle(CHECK_NH);
duke@435 526
duke@435 527 JavaValue result(T_VOID);
duke@435 528 JavaCallArguments args(10);
duke@435 529 args.push_oop(obj); // receiver
duke@435 530 args.push_long(usage.init_size_as_jlong()); // Argument 1
duke@435 531 args.push_long(usage.used_as_jlong()); // Argument 2
duke@435 532 args.push_long(usage.committed_as_jlong()); // Argument 3
duke@435 533 args.push_long(usage.max_size_as_jlong()); // Argument 4
duke@435 534
duke@435 535 JavaCalls::call_special(&result,
duke@435 536 ik,
coleenp@2497 537 vmSymbols::object_initializer_name(),
coleenp@2497 538 vmSymbols::long_long_long_long_void_signature(),
duke@435 539 &args,
duke@435 540 CHECK_NH);
duke@435 541 return obj;
duke@435 542 }
duke@435 543 //
kevinw@2058 544 // GC manager type depends on the type of Generation. Depending on the space
kevinw@2058 545 // availablity and vm options the gc uses major gc manager or minor gc
duke@435 546 // manager or both. The type of gc manager depends on the generation kind.
kevinw@2058 547 // For DefNew, ParNew and ASParNew generation doing scavenge gc uses minor
kevinw@2058 548 // gc manager (so _fullGC is set to false ) and for other generation kinds
kevinw@2058 549 // doing mark-sweep-compact uses major gc manager (so _fullGC is set
duke@435 550 // to true).
fparain@2888 551 TraceMemoryManagerStats::TraceMemoryManagerStats(Generation::Name kind, GCCause::Cause cause) {
duke@435 552 switch (kind) {
duke@435 553 case Generation::DefNew:
jprovino@4542 554 #if INCLUDE_ALL_GCS
duke@435 555 case Generation::ParNew:
duke@435 556 case Generation::ASParNew:
jprovino@4542 557 #endif // INCLUDE_ALL_GCS
duke@435 558 _fullGC=false;
duke@435 559 break;
duke@435 560 case Generation::MarkSweepCompact:
jprovino@4542 561 #if INCLUDE_ALL_GCS
duke@435 562 case Generation::ConcurrentMarkSweep:
duke@435 563 case Generation::ASConcurrentMarkSweep:
jprovino@4542 564 #endif // INCLUDE_ALL_GCS
duke@435 565 _fullGC=true;
duke@435 566 break;
duke@435 567 default:
duke@435 568 assert(false, "Unrecognized gc generation kind.");
duke@435 569 }
kevinw@2058 570 // this has to be called in a stop the world pause and represent
kevinw@2058 571 // an entire gc pause, start to finish:
fparain@2888 572 initialize(_fullGC, cause,true, true, true, true, true, true, true);
duke@435 573 }
kevinw@2058 574 TraceMemoryManagerStats::TraceMemoryManagerStats(bool fullGC,
fparain@2888 575 GCCause::Cause cause,
kevinw@2058 576 bool recordGCBeginTime,
kevinw@2058 577 bool recordPreGCUsage,
kevinw@2058 578 bool recordPeakUsage,
kevinw@2058 579 bool recordPostGCUsage,
kevinw@2058 580 bool recordAccumulatedGCTime,
kevinw@2058 581 bool recordGCEndTime,
kevinw@2058 582 bool countCollection) {
fparain@2888 583 initialize(fullGC, cause, recordGCBeginTime, recordPreGCUsage, recordPeakUsage,
kevinw@2058 584 recordPostGCUsage, recordAccumulatedGCTime, recordGCEndTime,
kevinw@2058 585 countCollection);
kevinw@2058 586 }
kevinw@2058 587
kevinw@2058 588 // for a subclass to create then initialize an instance before invoking
kevinw@2058 589 // the MemoryService
kevinw@2058 590 void TraceMemoryManagerStats::initialize(bool fullGC,
fparain@2888 591 GCCause::Cause cause,
kevinw@2058 592 bool recordGCBeginTime,
kevinw@2058 593 bool recordPreGCUsage,
kevinw@2058 594 bool recordPeakUsage,
kevinw@2058 595 bool recordPostGCUsage,
kevinw@2058 596 bool recordAccumulatedGCTime,
kevinw@2058 597 bool recordGCEndTime,
kevinw@2058 598 bool countCollection) {
duke@435 599 _fullGC = fullGC;
kevinw@2058 600 _recordGCBeginTime = recordGCBeginTime;
kevinw@2058 601 _recordPreGCUsage = recordPreGCUsage;
kevinw@2058 602 _recordPeakUsage = recordPeakUsage;
kevinw@2058 603 _recordPostGCUsage = recordPostGCUsage;
kevinw@2058 604 _recordAccumulatedGCTime = recordAccumulatedGCTime;
kevinw@2058 605 _recordGCEndTime = recordGCEndTime;
kevinw@2058 606 _countCollection = countCollection;
fparain@2888 607 _cause = cause;
kevinw@2058 608
kevinw@2058 609 MemoryService::gc_begin(_fullGC, _recordGCBeginTime, _recordAccumulatedGCTime,
kevinw@2058 610 _recordPreGCUsage, _recordPeakUsage);
duke@435 611 }
duke@435 612
duke@435 613 TraceMemoryManagerStats::~TraceMemoryManagerStats() {
kevinw@2058 614 MemoryService::gc_end(_fullGC, _recordPostGCUsage, _recordAccumulatedGCTime,
fparain@2888 615 _recordGCEndTime, _countCollection, _cause);
duke@435 616 }
kevinw@2058 617

mercurial