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