src/share/vm/services/memoryService.cpp

Thu, 12 Mar 2009 18:16:36 -0700

author
trims
date
Thu, 12 Mar 2009 18:16:36 -0700
changeset 1063
7bb995fbd3c0
parent 777
37f87013dfd8
child 1524
db0d5eba9d20
permissions
-rw-r--r--

Merge

duke@435 1 /*
duke@435 2 * Copyright 2003-2006 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 # include "incls/_precompiled.incl"
duke@435 26 # include "incls/_memoryService.cpp.incl"
duke@435 27
duke@435 28 GrowableArray<MemoryPool*>* MemoryService::_pools_list =
duke@435 29 new (ResourceObj::C_HEAP) GrowableArray<MemoryPool*>(init_pools_list_size, true);
duke@435 30 GrowableArray<MemoryManager*>* MemoryService::_managers_list =
duke@435 31 new (ResourceObj::C_HEAP) GrowableArray<MemoryManager*>(init_managers_list_size, true);
duke@435 32
duke@435 33 GCMemoryManager* MemoryService::_minor_gc_manager = NULL;
duke@435 34 GCMemoryManager* MemoryService::_major_gc_manager = NULL;
duke@435 35 MemoryPool* MemoryService::_code_heap_pool = NULL;
duke@435 36
duke@435 37 class GcThreadCountClosure: public ThreadClosure {
duke@435 38 private:
duke@435 39 int _count;
duke@435 40 public:
duke@435 41 GcThreadCountClosure() : _count(0) {};
duke@435 42 void do_thread(Thread* thread);
duke@435 43 int count() { return _count; }
duke@435 44 };
duke@435 45
duke@435 46 void GcThreadCountClosure::do_thread(Thread* thread) {
duke@435 47 _count++;
duke@435 48 }
duke@435 49
duke@435 50 void MemoryService::set_universe_heap(CollectedHeap* heap) {
duke@435 51 CollectedHeap::Name kind = heap->kind();
duke@435 52 switch (kind) {
duke@435 53 case CollectedHeap::GenCollectedHeap : {
duke@435 54 add_gen_collected_heap_info(GenCollectedHeap::heap());
duke@435 55 break;
duke@435 56 }
duke@435 57 #ifndef SERIALGC
duke@435 58 case CollectedHeap::ParallelScavengeHeap : {
duke@435 59 add_parallel_scavenge_heap_info(ParallelScavengeHeap::heap());
duke@435 60 break;
duke@435 61 }
ysr@777 62 case CollectedHeap::G1CollectedHeap : {
ysr@777 63 G1CollectedHeap::g1_unimplemented();
ysr@777 64 return;
ysr@777 65 }
duke@435 66 #endif // SERIALGC
duke@435 67 default: {
ysr@777 68 guarantee(false, "Unrecognized kind of heap");
duke@435 69 }
duke@435 70 }
duke@435 71
duke@435 72 // set the GC thread count
duke@435 73 GcThreadCountClosure gctcc;
duke@435 74 heap->gc_threads_do(&gctcc);
duke@435 75 int count = gctcc.count();
duke@435 76 if (count > 0) {
duke@435 77 _minor_gc_manager->set_num_gc_threads(count);
duke@435 78 _major_gc_manager->set_num_gc_threads(count);
duke@435 79 }
duke@435 80
duke@435 81 // All memory pools and memory managers are initialized.
duke@435 82 //
duke@435 83 _minor_gc_manager->initialize_gc_stat_info();
duke@435 84 _major_gc_manager->initialize_gc_stat_info();
duke@435 85 }
duke@435 86
duke@435 87 // Add memory pools for GenCollectedHeap
duke@435 88 // This function currently only supports two generations collected heap.
duke@435 89 // The collector for GenCollectedHeap will have two memory managers.
duke@435 90 void MemoryService::add_gen_collected_heap_info(GenCollectedHeap* heap) {
duke@435 91 CollectorPolicy* policy = heap->collector_policy();
duke@435 92
duke@435 93 assert(policy->is_two_generation_policy(), "Only support two generations");
duke@435 94 guarantee(heap->n_gens() == 2, "Only support two-generation heap");
duke@435 95
duke@435 96 TwoGenerationCollectorPolicy* two_gen_policy = policy->as_two_generation_policy();
duke@435 97 if (two_gen_policy != NULL) {
duke@435 98 GenerationSpec** specs = two_gen_policy->generations();
duke@435 99 Generation::Name kind = specs[0]->name();
duke@435 100 switch (kind) {
duke@435 101 case Generation::DefNew:
duke@435 102 _minor_gc_manager = MemoryManager::get_copy_memory_manager();
duke@435 103 break;
duke@435 104 #ifndef SERIALGC
duke@435 105 case Generation::ParNew:
duke@435 106 case Generation::ASParNew:
duke@435 107 _minor_gc_manager = MemoryManager::get_parnew_memory_manager();
duke@435 108 break;
duke@435 109 #endif // SERIALGC
duke@435 110 default:
duke@435 111 guarantee(false, "Unrecognized generation spec");
duke@435 112 break;
duke@435 113 }
duke@435 114 if (policy->is_mark_sweep_policy()) {
duke@435 115 _major_gc_manager = MemoryManager::get_msc_memory_manager();
duke@435 116 #ifndef SERIALGC
duke@435 117 } else if (policy->is_concurrent_mark_sweep_policy()) {
duke@435 118 _major_gc_manager = MemoryManager::get_cms_memory_manager();
duke@435 119 #endif // SERIALGC
duke@435 120 } else {
duke@435 121 guarantee(false, "Unknown two-gen policy");
duke@435 122 }
duke@435 123 } else {
duke@435 124 guarantee(false, "Non two-gen policy");
duke@435 125 }
duke@435 126 _managers_list->append(_minor_gc_manager);
duke@435 127 _managers_list->append(_major_gc_manager);
duke@435 128
duke@435 129 add_generation_memory_pool(heap->get_gen(minor), _major_gc_manager, _minor_gc_manager);
duke@435 130 add_generation_memory_pool(heap->get_gen(major), _major_gc_manager);
duke@435 131
duke@435 132 PermGen::Name name = policy->permanent_generation()->name();
duke@435 133 switch (name) {
duke@435 134 case PermGen::MarkSweepCompact: {
duke@435 135 CompactingPermGenGen* perm_gen = (CompactingPermGenGen*) heap->perm_gen();
duke@435 136 add_compact_perm_gen_memory_pool(perm_gen, _major_gc_manager);
duke@435 137 break;
duke@435 138 }
duke@435 139 #ifndef SERIALGC
duke@435 140 case PermGen::ConcurrentMarkSweep: {
duke@435 141 CMSPermGenGen* cms_gen = (CMSPermGenGen*) heap->perm_gen();
duke@435 142 add_cms_perm_gen_memory_pool(cms_gen, _major_gc_manager);
duke@435 143 break;
duke@435 144 }
duke@435 145 #endif // SERIALGC
duke@435 146 default:
duke@435 147 guarantee(false, "Unrecognized perm generation");
duke@435 148 break;
duke@435 149 }
duke@435 150 }
duke@435 151
duke@435 152 #ifndef SERIALGC
duke@435 153 // Add memory pools for ParallelScavengeHeap
duke@435 154 // This function currently only supports two generations collected heap.
duke@435 155 // The collector for ParallelScavengeHeap will have two memory managers.
duke@435 156 void MemoryService::add_parallel_scavenge_heap_info(ParallelScavengeHeap* heap) {
duke@435 157 // Two managers to keep statistics about _minor_gc_manager and _major_gc_manager GC.
duke@435 158 _minor_gc_manager = MemoryManager::get_psScavenge_memory_manager();
duke@435 159 _major_gc_manager = MemoryManager::get_psMarkSweep_memory_manager();
duke@435 160 _managers_list->append(_minor_gc_manager);
duke@435 161 _managers_list->append(_major_gc_manager);
duke@435 162
duke@435 163 add_psYoung_memory_pool(heap->young_gen(), _major_gc_manager, _minor_gc_manager);
duke@435 164 add_psOld_memory_pool(heap->old_gen(), _major_gc_manager);
duke@435 165 add_psPerm_memory_pool(heap->perm_gen(), _major_gc_manager);
duke@435 166 }
duke@435 167 #endif // SERIALGC
duke@435 168
duke@435 169 MemoryPool* MemoryService::add_gen(Generation* gen,
duke@435 170 const char* name,
duke@435 171 bool is_heap,
duke@435 172 bool support_usage_threshold) {
duke@435 173
duke@435 174 MemoryPool::PoolType type = (is_heap ? MemoryPool::Heap : MemoryPool::NonHeap);
duke@435 175 GenerationPool* pool = new GenerationPool(gen, name, type, support_usage_threshold);
duke@435 176 _pools_list->append(pool);
duke@435 177 return (MemoryPool*) pool;
duke@435 178 }
duke@435 179
duke@435 180 MemoryPool* MemoryService::add_space(ContiguousSpace* space,
duke@435 181 const char* name,
duke@435 182 bool is_heap,
duke@435 183 size_t max_size,
duke@435 184 bool support_usage_threshold) {
duke@435 185 MemoryPool::PoolType type = (is_heap ? MemoryPool::Heap : MemoryPool::NonHeap);
duke@435 186 ContiguousSpacePool* pool = new ContiguousSpacePool(space, name, type, max_size, support_usage_threshold);
duke@435 187
duke@435 188 _pools_list->append(pool);
duke@435 189 return (MemoryPool*) pool;
duke@435 190 }
duke@435 191
duke@435 192 MemoryPool* MemoryService::add_survivor_spaces(DefNewGeneration* gen,
duke@435 193 const char* name,
duke@435 194 bool is_heap,
duke@435 195 size_t max_size,
duke@435 196 bool support_usage_threshold) {
duke@435 197 MemoryPool::PoolType type = (is_heap ? MemoryPool::Heap : MemoryPool::NonHeap);
duke@435 198 SurvivorContiguousSpacePool* pool = new SurvivorContiguousSpacePool(gen, name, type, max_size, support_usage_threshold);
duke@435 199
duke@435 200 _pools_list->append(pool);
duke@435 201 return (MemoryPool*) pool;
duke@435 202 }
duke@435 203
duke@435 204 #ifndef SERIALGC
duke@435 205 MemoryPool* MemoryService::add_cms_space(CompactibleFreeListSpace* space,
duke@435 206 const char* name,
duke@435 207 bool is_heap,
duke@435 208 size_t max_size,
duke@435 209 bool support_usage_threshold) {
duke@435 210 MemoryPool::PoolType type = (is_heap ? MemoryPool::Heap : MemoryPool::NonHeap);
duke@435 211 CompactibleFreeListSpacePool* pool = new CompactibleFreeListSpacePool(space, name, type, max_size, support_usage_threshold);
duke@435 212 _pools_list->append(pool);
duke@435 213 return (MemoryPool*) pool;
duke@435 214 }
duke@435 215 #endif // SERIALGC
duke@435 216
duke@435 217 // Add memory pool(s) for one generation
duke@435 218 void MemoryService::add_generation_memory_pool(Generation* gen,
duke@435 219 MemoryManager* major_mgr,
duke@435 220 MemoryManager* minor_mgr) {
duke@435 221 Generation::Name kind = gen->kind();
duke@435 222 int index = _pools_list->length();
duke@435 223
duke@435 224 switch (kind) {
duke@435 225 case Generation::DefNew: {
duke@435 226 assert(major_mgr != NULL && minor_mgr != NULL, "Should have two managers");
duke@435 227 DefNewGeneration* young_gen = (DefNewGeneration*) gen;
duke@435 228 // Add a memory pool for each space and young gen doesn't
duke@435 229 // support low memory detection as it is expected to get filled up.
duke@435 230 MemoryPool* eden = add_space(young_gen->eden(),
duke@435 231 "Eden Space",
duke@435 232 true, /* is_heap */
duke@435 233 young_gen->max_eden_size(),
duke@435 234 false /* support_usage_threshold */);
duke@435 235 MemoryPool* survivor = add_survivor_spaces(young_gen,
duke@435 236 "Survivor Space",
duke@435 237 true, /* is_heap */
duke@435 238 young_gen->max_survivor_size(),
duke@435 239 false /* support_usage_threshold */);
duke@435 240 break;
duke@435 241 }
duke@435 242
duke@435 243 #ifndef SERIALGC
duke@435 244 case Generation::ParNew:
duke@435 245 case Generation::ASParNew:
duke@435 246 {
duke@435 247 assert(major_mgr != NULL && minor_mgr != NULL, "Should have two managers");
duke@435 248 // Add a memory pool for each space and young gen doesn't
duke@435 249 // support low memory detection as it is expected to get filled up.
duke@435 250 ParNewGeneration* parnew_gen = (ParNewGeneration*) gen;
duke@435 251 MemoryPool* eden = add_space(parnew_gen->eden(),
duke@435 252 "Par Eden Space",
duke@435 253 true /* is_heap */,
duke@435 254 parnew_gen->max_eden_size(),
duke@435 255 false /* support_usage_threshold */);
duke@435 256 MemoryPool* survivor = add_survivor_spaces(parnew_gen,
duke@435 257 "Par Survivor Space",
duke@435 258 true, /* is_heap */
duke@435 259 parnew_gen->max_survivor_size(),
duke@435 260 false /* support_usage_threshold */);
duke@435 261
duke@435 262 break;
duke@435 263 }
duke@435 264 #endif // SERIALGC
duke@435 265
duke@435 266 case Generation::MarkSweepCompact: {
duke@435 267 assert(major_mgr != NULL && minor_mgr == NULL, "Should have only one manager");
duke@435 268 add_gen(gen,
duke@435 269 "Tenured Gen",
duke@435 270 true, /* is_heap */
duke@435 271 true /* support_usage_threshold */);
duke@435 272 break;
duke@435 273 }
duke@435 274
duke@435 275 #ifndef SERIALGC
duke@435 276 case Generation::ConcurrentMarkSweep:
duke@435 277 case Generation::ASConcurrentMarkSweep:
duke@435 278 {
duke@435 279 assert(major_mgr != NULL && minor_mgr == NULL, "Should have only one manager");
duke@435 280 ConcurrentMarkSweepGeneration* cms = (ConcurrentMarkSweepGeneration*) gen;
duke@435 281 MemoryPool* pool = add_cms_space(cms->cmsSpace(),
duke@435 282 "CMS Old Gen",
duke@435 283 true, /* is_heap */
duke@435 284 cms->reserved().byte_size(),
duke@435 285 true /* support_usage_threshold */);
duke@435 286 break;
duke@435 287 }
duke@435 288 #endif // SERIALGC
duke@435 289
duke@435 290 default:
duke@435 291 assert(false, "should not reach here");
duke@435 292 // no memory pool added for others
duke@435 293 break;
duke@435 294 }
duke@435 295
duke@435 296 assert(major_mgr != NULL, "Should have at least one manager");
duke@435 297 // Link managers and the memory pools together
duke@435 298 for (int i = index; i < _pools_list->length(); i++) {
duke@435 299 MemoryPool* pool = _pools_list->at(i);
duke@435 300 major_mgr->add_pool(pool);
duke@435 301 if (minor_mgr != NULL) {
duke@435 302 minor_mgr->add_pool(pool);
duke@435 303 }
duke@435 304 }
duke@435 305 }
duke@435 306
duke@435 307 void MemoryService::add_compact_perm_gen_memory_pool(CompactingPermGenGen* perm_gen,
duke@435 308 MemoryManager* mgr) {
duke@435 309 PermanentGenerationSpec* spec = perm_gen->spec();
duke@435 310 size_t max_size = spec->max_size() - spec->read_only_size() - spec->read_write_size();
duke@435 311 MemoryPool* pool = add_space(perm_gen->unshared_space(),
duke@435 312 "Perm Gen",
duke@435 313 false, /* is_heap */
duke@435 314 max_size,
duke@435 315 true /* support_usage_threshold */);
duke@435 316 mgr->add_pool(pool);
duke@435 317 if (UseSharedSpaces) {
duke@435 318 pool = add_space(perm_gen->ro_space(),
duke@435 319 "Perm Gen [shared-ro]",
duke@435 320 false, /* is_heap */
duke@435 321 spec->read_only_size(),
duke@435 322 true /* support_usage_threshold */);
duke@435 323 mgr->add_pool(pool);
duke@435 324
duke@435 325 pool = add_space(perm_gen->rw_space(),
duke@435 326 "Perm Gen [shared-rw]",
duke@435 327 false, /* is_heap */
duke@435 328 spec->read_write_size(),
duke@435 329 true /* support_usage_threshold */);
duke@435 330 mgr->add_pool(pool);
duke@435 331 }
duke@435 332 }
duke@435 333
duke@435 334 #ifndef SERIALGC
duke@435 335 void MemoryService::add_cms_perm_gen_memory_pool(CMSPermGenGen* cms_gen,
duke@435 336 MemoryManager* mgr) {
duke@435 337
duke@435 338 MemoryPool* pool = add_cms_space(cms_gen->cmsSpace(),
duke@435 339 "CMS Perm Gen",
duke@435 340 false, /* is_heap */
duke@435 341 cms_gen->reserved().byte_size(),
duke@435 342 true /* support_usage_threshold */);
duke@435 343 mgr->add_pool(pool);
duke@435 344 }
duke@435 345
duke@435 346 void MemoryService::add_psYoung_memory_pool(PSYoungGen* gen, MemoryManager* major_mgr, MemoryManager* minor_mgr) {
duke@435 347 assert(major_mgr != NULL && minor_mgr != NULL, "Should have two managers");
duke@435 348
duke@435 349 // Add a memory pool for each space and young gen doesn't
duke@435 350 // support low memory detection as it is expected to get filled up.
duke@435 351 EdenMutableSpacePool* eden = new EdenMutableSpacePool(gen,
duke@435 352 gen->eden_space(),
duke@435 353 "PS Eden Space",
duke@435 354 MemoryPool::Heap,
duke@435 355 false /* support_usage_threshold */);
duke@435 356
duke@435 357 SurvivorMutableSpacePool* survivor = new SurvivorMutableSpacePool(gen,
duke@435 358 "PS Survivor Space",
duke@435 359 MemoryPool::Heap,
duke@435 360 false /* support_usage_threshold */);
duke@435 361
duke@435 362 major_mgr->add_pool(eden);
duke@435 363 major_mgr->add_pool(survivor);
duke@435 364 minor_mgr->add_pool(eden);
duke@435 365 minor_mgr->add_pool(survivor);
duke@435 366 _pools_list->append(eden);
duke@435 367 _pools_list->append(survivor);
duke@435 368 }
duke@435 369
duke@435 370 void MemoryService::add_psOld_memory_pool(PSOldGen* gen, MemoryManager* mgr) {
duke@435 371 PSGenerationPool* old_gen = new PSGenerationPool(gen,
duke@435 372 "PS Old Gen",
duke@435 373 MemoryPool::Heap,
duke@435 374 true /* support_usage_threshold */);
duke@435 375 mgr->add_pool(old_gen);
duke@435 376 _pools_list->append(old_gen);
duke@435 377 }
duke@435 378
duke@435 379 void MemoryService::add_psPerm_memory_pool(PSPermGen* gen, MemoryManager* mgr) {
duke@435 380 PSGenerationPool* perm_gen = new PSGenerationPool(gen,
duke@435 381 "PS Perm Gen",
duke@435 382 MemoryPool::NonHeap,
duke@435 383 true /* support_usage_threshold */);
duke@435 384 mgr->add_pool(perm_gen);
duke@435 385 _pools_list->append(perm_gen);
duke@435 386 }
duke@435 387 #endif // SERIALGC
duke@435 388
duke@435 389 void MemoryService::add_code_heap_memory_pool(CodeHeap* heap) {
duke@435 390 _code_heap_pool = new CodeHeapPool(heap,
duke@435 391 "Code Cache",
duke@435 392 true /* support_usage_threshold */);
duke@435 393 MemoryManager* mgr = MemoryManager::get_code_cache_memory_manager();
duke@435 394 mgr->add_pool(_code_heap_pool);
duke@435 395
duke@435 396 _pools_list->append(_code_heap_pool);
duke@435 397 _managers_list->append(mgr);
duke@435 398 }
duke@435 399
duke@435 400 MemoryManager* MemoryService::get_memory_manager(instanceHandle mh) {
duke@435 401 for (int i = 0; i < _managers_list->length(); i++) {
duke@435 402 MemoryManager* mgr = _managers_list->at(i);
duke@435 403 if (mgr->is_manager(mh)) {
duke@435 404 return mgr;
duke@435 405 }
duke@435 406 }
duke@435 407 return NULL;
duke@435 408 }
duke@435 409
duke@435 410 MemoryPool* MemoryService::get_memory_pool(instanceHandle ph) {
duke@435 411 for (int i = 0; i < _pools_list->length(); i++) {
duke@435 412 MemoryPool* pool = _pools_list->at(i);
duke@435 413 if (pool->is_pool(ph)) {
duke@435 414 return pool;
duke@435 415 }
duke@435 416 }
duke@435 417 return NULL;
duke@435 418 }
duke@435 419
duke@435 420 void MemoryService::track_memory_usage() {
duke@435 421 // Track the peak memory usage
duke@435 422 for (int i = 0; i < _pools_list->length(); i++) {
duke@435 423 MemoryPool* pool = _pools_list->at(i);
duke@435 424 pool->record_peak_memory_usage();
duke@435 425 }
duke@435 426
duke@435 427 // Detect low memory
duke@435 428 LowMemoryDetector::detect_low_memory();
duke@435 429 }
duke@435 430
duke@435 431 void MemoryService::track_memory_pool_usage(MemoryPool* pool) {
duke@435 432 // Track the peak memory usage
duke@435 433 pool->record_peak_memory_usage();
duke@435 434
duke@435 435 // Detect low memory
duke@435 436 if (LowMemoryDetector::is_enabled(pool)) {
duke@435 437 LowMemoryDetector::detect_low_memory(pool);
duke@435 438 }
duke@435 439 }
duke@435 440
duke@435 441 void MemoryService::gc_begin(bool fullGC) {
duke@435 442 GCMemoryManager* mgr;
duke@435 443 if (fullGC) {
duke@435 444 mgr = _major_gc_manager;
duke@435 445 } else {
duke@435 446 mgr = _minor_gc_manager;
duke@435 447 }
duke@435 448 assert(mgr->is_gc_memory_manager(), "Sanity check");
duke@435 449 mgr->gc_begin();
duke@435 450
duke@435 451 // Track the peak memory usage when GC begins
duke@435 452 for (int i = 0; i < _pools_list->length(); i++) {
duke@435 453 MemoryPool* pool = _pools_list->at(i);
duke@435 454 pool->record_peak_memory_usage();
duke@435 455 }
duke@435 456 }
duke@435 457
duke@435 458 void MemoryService::gc_end(bool fullGC) {
duke@435 459 GCMemoryManager* mgr;
duke@435 460 if (fullGC) {
duke@435 461 mgr = (GCMemoryManager*) _major_gc_manager;
duke@435 462 } else {
duke@435 463 mgr = (GCMemoryManager*) _minor_gc_manager;
duke@435 464 }
duke@435 465 assert(mgr->is_gc_memory_manager(), "Sanity check");
duke@435 466
duke@435 467 // register the GC end statistics and memory usage
duke@435 468 mgr->gc_end();
duke@435 469 }
duke@435 470
duke@435 471 void MemoryService::oops_do(OopClosure* f) {
duke@435 472 int i;
duke@435 473
duke@435 474 for (i = 0; i < _pools_list->length(); i++) {
duke@435 475 MemoryPool* pool = _pools_list->at(i);
duke@435 476 pool->oops_do(f);
duke@435 477 }
duke@435 478 for (i = 0; i < _managers_list->length(); i++) {
duke@435 479 MemoryManager* mgr = _managers_list->at(i);
duke@435 480 mgr->oops_do(f);
duke@435 481 }
duke@435 482 }
duke@435 483
duke@435 484 bool MemoryService::set_verbose(bool verbose) {
duke@435 485 MutexLocker m(Management_lock);
duke@435 486 // verbose will be set to the previous value
duke@435 487 bool succeed = CommandLineFlags::boolAtPut((char*)"PrintGC", &verbose, MANAGEMENT);
duke@435 488 assert(succeed, "Setting PrintGC flag fails");
duke@435 489 ClassLoadingService::reset_trace_class_unloading();
duke@435 490
duke@435 491 return verbose;
duke@435 492 }
duke@435 493
duke@435 494 Handle MemoryService::create_MemoryUsage_obj(MemoryUsage usage, TRAPS) {
duke@435 495 klassOop k = Management::java_lang_management_MemoryUsage_klass(CHECK_NH);
duke@435 496 instanceKlassHandle ik(THREAD, k);
duke@435 497
duke@435 498 instanceHandle obj = ik->allocate_instance_handle(CHECK_NH);
duke@435 499
duke@435 500 JavaValue result(T_VOID);
duke@435 501 JavaCallArguments args(10);
duke@435 502 args.push_oop(obj); // receiver
duke@435 503 args.push_long(usage.init_size_as_jlong()); // Argument 1
duke@435 504 args.push_long(usage.used_as_jlong()); // Argument 2
duke@435 505 args.push_long(usage.committed_as_jlong()); // Argument 3
duke@435 506 args.push_long(usage.max_size_as_jlong()); // Argument 4
duke@435 507
duke@435 508 JavaCalls::call_special(&result,
duke@435 509 ik,
duke@435 510 vmSymbolHandles::object_initializer_name(),
duke@435 511 vmSymbolHandles::long_long_long_long_void_signature(),
duke@435 512 &args,
duke@435 513 CHECK_NH);
duke@435 514 return obj;
duke@435 515 }
duke@435 516 //
duke@435 517 // GC manager type depends on the type of Generation. Depending the space
duke@435 518 // availablity and vm option the gc uses major gc manager or minor gc
duke@435 519 // manager or both. The type of gc manager depends on the generation kind.
duke@435 520 // For DefNew, ParNew and ASParNew generation doing scavange gc uses minor
duke@435 521 // gc manager (so _fullGC is set to false ) and for other generation kind
duke@435 522 // DOing mark-sweep-compact uses major gc manager (so _fullGC is set
duke@435 523 // to true).
duke@435 524 TraceMemoryManagerStats::TraceMemoryManagerStats(Generation::Name kind) {
duke@435 525 switch (kind) {
duke@435 526 case Generation::DefNew:
duke@435 527 #ifndef SERIALGC
duke@435 528 case Generation::ParNew:
duke@435 529 case Generation::ASParNew:
duke@435 530 #endif // SERIALGC
duke@435 531 _fullGC=false;
duke@435 532 break;
duke@435 533 case Generation::MarkSweepCompact:
duke@435 534 #ifndef SERIALGC
duke@435 535 case Generation::ConcurrentMarkSweep:
duke@435 536 case Generation::ASConcurrentMarkSweep:
duke@435 537 #endif // SERIALGC
duke@435 538 _fullGC=true;
duke@435 539 break;
duke@435 540 default:
duke@435 541 assert(false, "Unrecognized gc generation kind.");
duke@435 542 }
duke@435 543 MemoryService::gc_begin(_fullGC);
duke@435 544 }
duke@435 545 TraceMemoryManagerStats::TraceMemoryManagerStats(bool fullGC) {
duke@435 546 _fullGC = fullGC;
duke@435 547 MemoryService::gc_begin(_fullGC);
duke@435 548 }
duke@435 549
duke@435 550 TraceMemoryManagerStats::~TraceMemoryManagerStats() {
duke@435 551 MemoryService::gc_end(_fullGC);
duke@435 552 }

mercurial