< prev index next >
src/hotspot/share/gc/g1/g1CollectionSet.cpp
Print this page
rev 52675 : 8213890: Implementation of JEP 344: Abortable Mixed Collections for G1
Reviewed-by:
Contributed-by: erik.helin@oracle.com, stefan.johansson@oracle.com
rev 52676 : imported patch AMGC-impl
rev 52677 : imported patch AMGC-tsch-rev1
rev 52678 : imported patch AMGC-tsch-rev1-optcset
rev 52680 : [mq]: AMGC-tsch-rev2
*** 21,39 ****
* questions.
*
*/
#include "precompiled.hpp"
! #include "gc/g1/g1CollectedHeap.hpp"
#include "gc/g1/g1CollectionSet.hpp"
#include "gc/g1/g1CollectorState.hpp"
#include "gc/g1/g1Policy.hpp"
#include "gc/g1/heapRegion.inline.hpp"
#include "gc/g1/heapRegionRemSet.hpp"
#include "gc/g1/heapRegionSet.hpp"
#include "logging/logStream.hpp"
#include "utilities/debug.hpp"
#include "utilities/quickSort.hpp"
G1CollectorState* G1CollectionSet::collector_state() {
return _g1h->collector_state();
}
--- 21,40 ----
* questions.
*
*/
#include "precompiled.hpp"
! #include "gc/g1/g1CollectedHeap.inline.hpp"
#include "gc/g1/g1CollectionSet.hpp"
#include "gc/g1/g1CollectorState.hpp"
#include "gc/g1/g1Policy.hpp"
#include "gc/g1/heapRegion.inline.hpp"
#include "gc/g1/heapRegionRemSet.hpp"
#include "gc/g1/heapRegionSet.hpp"
#include "logging/logStream.hpp"
#include "utilities/debug.hpp"
+ #include "utilities/globalDefinitions.hpp"
#include "utilities/quickSort.hpp"
G1CollectorState* G1CollectionSet::collector_state() {
return _g1h->collector_state();
}
*** 58,67 ****
--- 59,71 ----
_survivor_region_length(0),
_old_region_length(0),
_collection_set_regions(NULL),
_collection_set_cur_length(0),
_collection_set_max_length(0),
+ _optional_regions(NULL),
+ _optional_region_length(0),
+ _optional_region_max_length(0),
_bytes_used_before(0),
_recorded_rs_lengths(0),
_inc_build_state(Inactive),
_inc_bytes_used_before(0),
_inc_recorded_rs_lengths(0),
*** 72,81 ****
--- 76,86 ----
G1CollectionSet::~G1CollectionSet() {
if (_collection_set_regions != NULL) {
FREE_C_HEAP_ARRAY(uint, _collection_set_regions);
}
+ free_optional_regions();
delete _cset_chooser;
}
void G1CollectionSet::init_region_lengths(uint eden_cset_region_length,
uint survivor_cset_region_length) {
*** 86,112 ****
assert((size_t) young_region_length() == _collection_set_cur_length,
"Young region length %u should match collection set length " SIZE_FORMAT, young_region_length(), _collection_set_cur_length);
_old_region_length = 0;
}
void G1CollectionSet::initialize(uint max_region_length) {
guarantee(_collection_set_regions == NULL, "Must only initialize once.");
_collection_set_max_length = max_region_length;
_collection_set_regions = NEW_C_HEAP_ARRAY(uint, max_region_length, mtGC);
}
void G1CollectionSet::set_recorded_rs_lengths(size_t rs_lengths) {
_recorded_rs_lengths = rs_lengths;
}
// Add the heap region at the head of the non-incremental collection set
void G1CollectionSet::add_old_region(HeapRegion* hr) {
assert_at_safepoint_on_vm_thread();
! assert(_inc_build_state == Active, "Precondition");
assert(hr->is_old(), "the region should be old");
assert(!hr->in_collection_set(), "should not already be in the CSet");
_g1h->register_old_region_with_cset(hr);
--- 91,134 ----
assert((size_t) young_region_length() == _collection_set_cur_length,
"Young region length %u should match collection set length " SIZE_FORMAT, young_region_length(), _collection_set_cur_length);
_old_region_length = 0;
+ _optional_region_length = 0;
}
void G1CollectionSet::initialize(uint max_region_length) {
guarantee(_collection_set_regions == NULL, "Must only initialize once.");
_collection_set_max_length = max_region_length;
_collection_set_regions = NEW_C_HEAP_ARRAY(uint, max_region_length, mtGC);
}
+ void G1CollectionSet::initialize_optional(uint max_length) {
+ assert(_optional_regions == NULL, "Already initialized");
+ _optional_region_max_length = max_length;
+ _optional_regions = NEW_C_HEAP_ARRAY(HeapRegion*, _optional_region_max_length, mtGC);
+ }
+
+ void G1CollectionSet::free_optional_regions() {
+ _optional_region_length = 0;
+ _optional_region_max_length = 0;
+ if (_optional_regions != NULL) {
+ FREE_C_HEAP_ARRAY(HeapRegion*, _optional_regions);
+ _optional_regions = NULL;
+ }
+ }
+
void G1CollectionSet::set_recorded_rs_lengths(size_t rs_lengths) {
_recorded_rs_lengths = rs_lengths;
}
// Add the heap region at the head of the non-incremental collection set
void G1CollectionSet::add_old_region(HeapRegion* hr) {
assert_at_safepoint_on_vm_thread();
! assert(_inc_build_state == Active || hr->index_in_opt_cset() != G1OptionalCSet::InvalidCSetIndex,
! "Precondition, actively building cset or adding optional later on");
assert(hr->is_old(), "the region should be old");
assert(!hr->in_collection_set(), "should not already be in the CSet");
_g1h->register_old_region_with_cset(hr);
*** 115,124 ****
--- 137,162 ----
_bytes_used_before += hr->used();
size_t rs_length = hr->rem_set()->occupied();
_recorded_rs_lengths += rs_length;
_old_region_length += 1;
+
+ log_trace(gc, cset)("Added old region %d to collection set", hr->hrm_index());
+ }
+
+ void G1CollectionSet::add_optional_region(HeapRegion* hr) {
+ assert(!optional_is_full(), "Precondition, must have room left for this region");
+ assert(hr->is_old(), "the region should be old");
+ assert(!hr->in_collection_set(), "should not already be in the CSet");
+
+ _g1h->register_optional_region_with_cset(hr);
+
+ _optional_regions[_optional_region_length] = hr;
+ uint index = _optional_region_length++;
+ hr->set_index_in_opt_cset(index);
+
+ log_trace(gc, cset)("Added region %d to optional collection set (%u)", hr->hrm_index(), _optional_region_length);
}
// Initialize the per-collection-set information
void G1CollectionSet::start_incremental_building() {
assert(_collection_set_cur_length == 0, "Collection set must be empty before starting a new collection set.");
*** 166,175 ****
--- 204,214 ----
}
void G1CollectionSet::clear() {
assert_at_safepoint_on_vm_thread();
_collection_set_cur_length = 0;
+ _optional_region_length = 0;
}
void G1CollectionSet::iterate(HeapRegionClosure* cl) const {
iterate_from(cl, 0, 1);
}
*** 394,403 ****
--- 433,465 ----
phase_times()->record_young_cset_choice_time_ms((young_end_time_sec - young_start_time_sec) * 1000.0);
return time_remaining_ms;
}
+ void G1CollectionSet::add_as_old(HeapRegion* hr) {
+ cset_chooser()->pop(); // already have region via peek()
+ _g1h->old_set_remove(hr);
+ add_old_region(hr);
+ }
+
+ void G1CollectionSet::add_as_optional(HeapRegion* hr) {
+ assert(_optional_regions != NULL, "Must not be called before array is allocated");
+ cset_chooser()->pop(); // already have region via peek()
+ _g1h->old_set_remove(hr);
+ add_optional_region(hr);
+ }
+
+ bool G1CollectionSet::optional_is_full() {
+ return _optional_region_length == _optional_region_max_length;
+ }
+
+ void G1CollectionSet::clear_optional_region(const HeapRegion* hr) {
+ assert(_optional_regions != NULL, "Must not be called before array is allocated");
+ uint index = hr->index_in_opt_cset();
+ _optional_regions[index] = NULL;
+ }
+
static int compare_region_idx(const uint a, const uint b) {
if (a > b) {
return 1;
} else if (a == b) {
return 0;
*** 407,431 ****
}
void G1CollectionSet::finalize_old_part(double time_remaining_ms) {
double non_young_start_time_sec = os::elapsedTime();
double predicted_old_time_ms = 0.0;
if (collector_state()->in_mixed_phase()) {
cset_chooser()->verify();
const uint min_old_cset_length = _policy->calc_min_old_cset_length();
! const uint max_old_cset_length = _policy->calc_max_old_cset_length();
!
! uint expensive_region_num = 0;
bool check_time_remaining = _policy->adaptive_young_list_length();
HeapRegion* hr = cset_chooser()->peek();
while (hr != NULL) {
! if (old_region_length() >= max_old_cset_length) {
// Added maximum number of old regions to the CSet.
! log_debug(gc, ergo, cset)("Finish adding old regions to CSet (old CSet region num reached max). old %u regions, max %u regions",
! old_region_length(), max_old_cset_length);
break;
}
// Stop adding regions if the remaining reclaimable space is
// not above G1HeapWastePercent.
--- 469,500 ----
}
void G1CollectionSet::finalize_old_part(double time_remaining_ms) {
double non_young_start_time_sec = os::elapsedTime();
double predicted_old_time_ms = 0.0;
+ double predicted_optional_time_ms = 0.0;
+ double optional_threshold_ms = time_remaining_ms * _policy->optional_prediction_fraction();
+ uint expensive_region_num = 0;
if (collector_state()->in_mixed_phase()) {
cset_chooser()->verify();
const uint min_old_cset_length = _policy->calc_min_old_cset_length();
! const uint max_old_cset_length = MAX2(min_old_cset_length, _policy->calc_max_old_cset_length());
bool check_time_remaining = _policy->adaptive_young_list_length();
+ initialize_optional(max_old_cset_length - min_old_cset_length);
+ log_debug(gc, ergo, cset)("Start adding old regions for mixed gc. min %u regions, max %u regions, "
+ "time remaining %1.2fms, optional threshold %1.2fms",
+ min_old_cset_length, max_old_cset_length, time_remaining_ms, optional_threshold_ms);
+
HeapRegion* hr = cset_chooser()->peek();
while (hr != NULL) {
! if (old_region_length() + optional_region_length() >= max_old_cset_length) {
// Added maximum number of old regions to the CSet.
! log_debug(gc, ergo, cset)("Finish adding old regions to CSet (old CSet region num reached max). "
! "old %u regions, optional %u regions",
! old_region_length(), optional_region_length());
break;
}
// Stop adding regions if the remaining reclaimable space is
// not above G1HeapWastePercent.
*** 435,514 ****
if (reclaimable_percent <= threshold) {
// We've added enough old regions that the amount of uncollected
// reclaimable space is at or below the waste threshold. Stop
// adding old regions to the CSet.
log_debug(gc, ergo, cset)("Finish adding old regions to CSet (reclaimable percentage not over threshold). "
! "old %u regions, max %u regions, reclaimable: " SIZE_FORMAT "B (%1.2f%%) threshold: " UINTX_FORMAT "%%",
! old_region_length(), max_old_cset_length, reclaimable_bytes, reclaimable_percent, G1HeapWastePercent);
break;
}
double predicted_time_ms = predict_region_elapsed_time_ms(hr);
! if (check_time_remaining) {
! if (predicted_time_ms > time_remaining_ms) {
! // Too expensive for the current CSet.
!
! if (old_region_length() >= min_old_cset_length) {
! // We have added the minimum number of old regions to the CSet,
! // we are done with this CSet.
! log_debug(gc, ergo, cset)("Finish adding old regions to CSet (predicted time is too high). "
! "predicted time: %1.2fms, remaining time: %1.2fms old %u regions, min %u regions",
! predicted_time_ms, time_remaining_ms, old_region_length(), min_old_cset_length);
! break;
! }
!
! // We'll add it anyway given that we haven't reached the
! // minimum number of old regions.
! expensive_region_num += 1;
}
} else {
- if (old_region_length() >= min_old_cset_length) {
// In the non-auto-tuning case, we'll finish adding regions
// to the CSet if we reach the minimum.
!
! log_debug(gc, ergo, cset)("Finish adding old regions to CSet (old CSet region num reached min). old %u regions, min %u regions",
! old_region_length(), min_old_cset_length);
break;
}
! }
!
! // We will add this region to the CSet.
! time_remaining_ms = MAX2(time_remaining_ms - predicted_time_ms, 0.0);
predicted_old_time_ms += predicted_time_ms;
! cset_chooser()->pop(); // already have region via peek()
! _g1h->old_set_remove(hr);
! add_old_region(hr);
!
hr = cset_chooser()->peek();
}
if (hr == NULL) {
log_debug(gc, ergo, cset)("Finish adding old regions to CSet (candidate old regions not available)");
}
- if (expensive_region_num > 0) {
- // We print the information once here at the end, predicated on
- // whether we added any apparently expensive regions or not, to
- // avoid generating output per region.
- log_debug(gc, ergo, cset)("Added expensive regions to CSet (old CSet region num not reached min)."
- "old: %u regions, expensive: %u regions, min: %u regions, remaining time: %1.2fms",
- old_region_length(), expensive_region_num, min_old_cset_length, time_remaining_ms);
- }
-
cset_chooser()->verify();
}
stop_incremental_building();
! log_debug(gc, ergo, cset)("Finish choosing CSet. old: %u regions, predicted old region time: %1.2fms, time remaining: %1.2f",
! old_region_length(), predicted_old_time_ms, time_remaining_ms);
double non_young_end_time_sec = os::elapsedTime();
phase_times()->record_non_young_cset_choice_time_ms((non_young_end_time_sec - non_young_start_time_sec) * 1000.0);
QuickSort::sort(_collection_set_regions, _collection_set_cur_length, compare_region_idx, true);
}
#ifdef ASSERT
class G1VerifyYoungCSetIndicesClosure : public HeapRegionClosure {
private:
size_t _young_length;
int* _heap_region_indices;
--- 504,659 ----
if (reclaimable_percent <= threshold) {
// We've added enough old regions that the amount of uncollected
// reclaimable space is at or below the waste threshold. Stop
// adding old regions to the CSet.
log_debug(gc, ergo, cset)("Finish adding old regions to CSet (reclaimable percentage not over threshold). "
! "reclaimable: " SIZE_FORMAT "%s (%1.2f%%) threshold: " UINTX_FORMAT "%%",
! byte_size_in_proper_unit(reclaimable_bytes), proper_unit_for_byte_size(reclaimable_bytes),
! reclaimable_percent, G1HeapWastePercent);
break;
}
double predicted_time_ms = predict_region_elapsed_time_ms(hr);
! time_remaining_ms = MAX2(time_remaining_ms - predicted_time_ms, 0.0);
! // Add regions to old set until we reach minimum amount
! if (old_region_length() < min_old_cset_length) {
! predicted_old_time_ms += predicted_time_ms;
! add_as_old(hr);
! // Record the number of regions added when no time remaining
! if (time_remaining_ms == 0.0) {
! expensive_region_num++;
}
} else {
// In the non-auto-tuning case, we'll finish adding regions
// to the CSet if we reach the minimum.
! if (!check_time_remaining) {
! log_debug(gc, ergo, cset)("Finish adding old regions to CSet (old CSet region num reached min).");
break;
}
! // Keep adding regions to old set until we reach optional threshold
! if (time_remaining_ms > optional_threshold_ms) {
predicted_old_time_ms += predicted_time_ms;
! add_as_old(hr);
! } else if (time_remaining_ms > 0) {
! // Keep adding optional regions until time is up
! if (!optional_is_full()) {
! predicted_optional_time_ms += predicted_time_ms;
! add_as_optional(hr);
! } else {
! log_debug(gc, ergo, cset)("Finish adding old regions to CSet (optional set full).");
! break;
! }
! } else {
! log_debug(gc, ergo, cset)("Finish adding old regions to CSet (predicted time is too high).");
! break;
! }
! }
hr = cset_chooser()->peek();
}
if (hr == NULL) {
log_debug(gc, ergo, cset)("Finish adding old regions to CSet (candidate old regions not available)");
}
cset_chooser()->verify();
}
stop_incremental_building();
! log_debug(gc, ergo, cset)("Finish choosing CSet regions old: %u, optional: %u, "
! "predicted old time: %1.2fms, predicted optional time: %1.2fms, time remaining: %1.2f",
! old_region_length(), optional_region_length(),
! predicted_old_time_ms, predicted_optional_time_ms, time_remaining_ms);
! if (expensive_region_num > 0) {
! log_debug(gc, ergo, cset)("CSet contains %u old regions that were added although the predicted time was too high.",
! expensive_region_num);
! }
double non_young_end_time_sec = os::elapsedTime();
phase_times()->record_non_young_cset_choice_time_ms((non_young_end_time_sec - non_young_start_time_sec) * 1000.0);
QuickSort::sort(_collection_set_regions, _collection_set_cur_length, compare_region_idx, true);
}
+ HeapRegion* G1OptionalCSet::region_at(uint index) {
+ return _cset->optional_region_at(index);
+ }
+
+ void G1OptionalCSet::prepare_evacuation(double time_limit) {
+ assert(_current_index == _current_limit, "Before prepare no regions should be ready for evac");
+
+ uint prepared_regions = 0;
+ double prediction_ms = 0;
+
+ _prepare_failed = true;
+ for (uint i = _current_index; i < _cset->optional_region_length(); i++) {
+ HeapRegion* hr = region_at(i);
+ prediction_ms += _cset->predict_region_elapsed_time_ms(hr);
+ if (prediction_ms > time_limit) {
+ log_debug(gc, cset)("Prepared %u regions for optional evacuation. Predicted time: %.3fms", prepared_regions, prediction_ms);
+ return;
+ }
+
+ // This region will be included in the next optional evacuation.
+ prepare_to_evacuate_optional_region(hr);
+ prepared_regions++;
+ _current_limit++;
+ _prepare_failed = false;
+ }
+
+ log_debug(gc, cset)("Prepared all %u regions for optional evacuation. Predicted time: %.3fms",
+ prepared_regions, prediction_ms);
+ }
+
+ bool G1OptionalCSet::prepare_failed() {
+ return _prepare_failed;
+ }
+
+ void G1OptionalCSet::complete_evacuation() {
+ _evacuation_failed = false;
+ for (uint i = _current_index; i < _current_limit; i++) {
+ HeapRegion* hr = region_at(i);
+ _cset->clear_optional_region(hr);
+ if (hr->evacuation_failed()){
+ _evacuation_failed = true;
+ }
+ }
+ _current_index = _current_limit;
+ }
+
+ bool G1OptionalCSet::evacuation_failed() {
+ return _evacuation_failed;
+ }
+
+ G1OptionalCSet::~G1OptionalCSet() {
+ G1CollectedHeap* g1h = G1CollectedHeap::heap();
+ while (!is_empty()) {
+ // We want to return regions not evacuated to the
+ // chooser in reverse order to maintain the old order.
+ HeapRegion* hr = _cset->remove_last_optional_region();
+ assert(hr != NULL, "Should be valid region left");
+ g1h->old_set_add(hr);
+ g1h->clear_in_cset(hr);
+ hr->set_index_in_opt_cset(InvalidCSetIndex);
+ _cset->cset_chooser()->push(hr);
+ }
+ _cset->free_optional_regions();
+ }
+
+ uint G1OptionalCSet::size() {
+ return _cset->optional_region_length() - _current_index;
+ }
+
+ bool G1OptionalCSet::is_empty() {
+ return size() == 0;
+ }
+
+ void G1OptionalCSet::prepare_to_evacuate_optional_region(HeapRegion* hr) {
+ log_trace(gc, cset)("Adding region %u for optional evacuation", hr->hrm_index());
+ G1CollectedHeap::heap()->clear_in_cset(hr);
+ _cset->add_old_region(hr);
+ }
+
#ifdef ASSERT
class G1VerifyYoungCSetIndicesClosure : public HeapRegionClosure {
private:
size_t _young_length;
int* _heap_region_indices;
< prev index next >