137 lines
4.9 KiB
C++
137 lines
4.9 KiB
C++
/*
|
|
* Copyright (c) 2013, 2019, Red Hat, Inc. All rights reserved.
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
*
|
|
* This code is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License version 2 only, as
|
|
* published by the Free Software Foundation.
|
|
*
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
* accompanied this code).
|
|
*
|
|
* You should have received a copy of the GNU General Public License version
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
* questions.
|
|
*
|
|
*/
|
|
|
|
#include "precompiled.hpp"
|
|
|
|
#include "gc/shenandoah/shenandoahCollectorPolicy.hpp"
|
|
#include "gc/shenandoah/shenandoahHeap.inline.hpp"
|
|
#include "runtime/os.hpp"
|
|
|
|
ShenandoahCollectorPolicy::ShenandoahCollectorPolicy() :
|
|
_success_concurrent_gcs(0),
|
|
_success_degenerated_gcs(0),
|
|
_success_full_gcs(0),
|
|
_alloc_failure_degenerated(0),
|
|
_alloc_failure_degenerated_upgrade_to_full(0),
|
|
_alloc_failure_full(0),
|
|
_explicit_concurrent(0),
|
|
_explicit_full(0),
|
|
_implicit_concurrent(0),
|
|
_implicit_full(0),
|
|
_cycle_counter(0) {
|
|
|
|
Copy::zero_to_bytes(_degen_points, sizeof(size_t) * ShenandoahHeap::_DEGENERATED_LIMIT);
|
|
|
|
_tracer = new (ResourceObj::C_HEAP, mtGC) ShenandoahTracer();
|
|
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_explicit_to_concurrent() {
|
|
_explicit_concurrent++;
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_explicit_to_full() {
|
|
_explicit_full++;
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_implicit_to_concurrent() {
|
|
_implicit_concurrent++;
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_implicit_to_full() {
|
|
_implicit_full++;
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_alloc_failure_to_full() {
|
|
_alloc_failure_full++;
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_alloc_failure_to_degenerated(ShenandoahHeap::ShenandoahDegenPoint point) {
|
|
assert(point < ShenandoahHeap::_DEGENERATED_LIMIT, "sanity");
|
|
_alloc_failure_degenerated++;
|
|
_degen_points[point]++;
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_degenerated_upgrade_to_full() {
|
|
_alloc_failure_degenerated_upgrade_to_full++;
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_success_concurrent() {
|
|
_success_concurrent_gcs++;
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_success_degenerated() {
|
|
_success_degenerated_gcs++;
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_success_full() {
|
|
_success_full_gcs++;
|
|
}
|
|
|
|
size_t ShenandoahCollectorPolicy::cycle_counter() const {
|
|
return _cycle_counter;
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_cycle_start() {
|
|
_cycle_counter++;
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::record_shutdown() {
|
|
_in_shutdown.set();
|
|
}
|
|
|
|
bool ShenandoahCollectorPolicy::is_at_shutdown() {
|
|
return _in_shutdown.is_set();
|
|
}
|
|
|
|
void ShenandoahCollectorPolicy::print_gc_stats(outputStream* out) const {
|
|
out->print_cr("Under allocation pressure, concurrent cycles may cancel, and either continue cycle");
|
|
out->print_cr("under stop-the-world pause or result in stop-the-world Full GC. Increase heap size,");
|
|
out->print_cr("tune GC heuristics, set more aggressive pacing delay, or lower allocation rate");
|
|
out->print_cr("to avoid Degenerated and Full GC cycles.");
|
|
out->cr();
|
|
|
|
out->print_cr(SIZE_FORMAT_W(5) " successful concurrent GCs", _success_concurrent_gcs);
|
|
out->print_cr(" " SIZE_FORMAT_W(5) " invoked explicitly", _explicit_concurrent);
|
|
out->print_cr(" " SIZE_FORMAT_W(5) " invoked implicitly", _implicit_concurrent);
|
|
out->cr();
|
|
|
|
out->print_cr(SIZE_FORMAT_W(5) " Degenerated GCs", _success_degenerated_gcs);
|
|
out->print_cr(" " SIZE_FORMAT_W(5) " caused by allocation failure", _alloc_failure_degenerated);
|
|
for (int c = 0; c < ShenandoahHeap::_DEGENERATED_LIMIT; c++) {
|
|
if (_degen_points[c] > 0) {
|
|
const char* desc = ShenandoahHeap::degen_point_to_string((ShenandoahHeap::ShenandoahDegenPoint)c);
|
|
out->print_cr(" " SIZE_FORMAT_W(5) " happened at %s", _degen_points[c], desc);
|
|
}
|
|
}
|
|
out->print_cr(" " SIZE_FORMAT_W(5) " upgraded to Full GC", _alloc_failure_degenerated_upgrade_to_full);
|
|
out->cr();
|
|
|
|
out->print_cr(SIZE_FORMAT_W(5) " Full GCs", _success_full_gcs + _alloc_failure_degenerated_upgrade_to_full);
|
|
out->print_cr(" " SIZE_FORMAT_W(5) " invoked explicitly", _explicit_full);
|
|
out->print_cr(" " SIZE_FORMAT_W(5) " invoked implicitly", _implicit_full);
|
|
out->print_cr(" " SIZE_FORMAT_W(5) " caused by allocation failure", _alloc_failure_full);
|
|
out->print_cr(" " SIZE_FORMAT_W(5) " upgraded from Degenerated GC", _alloc_failure_degenerated_upgrade_to_full);
|
|
}
|