src/share/vm/services/memoryService.cpp

Fri, 25 Jan 2013 10:04:08 -0500

author
zgu
date
Fri, 25 Jan 2013 10:04:08 -0500
changeset 4492
8b46b0196eb0
parent 4037
da91efe96a93
child 4542
db9981fd3124
permissions
-rw-r--r--

8000692: Remove old KERNEL code
Summary: Removed depreciated kernel VM source code from hotspot VM
Reviewed-by: dholmes, acorn

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

mercurial