35 ShenandoahStaticHeuristics::ShenandoahStaticHeuristics(ShenandoahSpaceInfo* space_info) :
36 ShenandoahHeuristics(space_info) {
37 SHENANDOAH_ERGO_ENABLE_FLAG(ExplicitGCInvokesConcurrent);
38 SHENANDOAH_ERGO_ENABLE_FLAG(ShenandoahImplicitGCInvokesConcurrent);
39 }
40
41 ShenandoahStaticHeuristics::~ShenandoahStaticHeuristics() {}
42
43 bool ShenandoahStaticHeuristics::should_start_gc() {
44 size_t max_capacity = _space_info->max_capacity();
45 size_t capacity = _space_info->soft_max_capacity();
46 size_t available = _space_info->available();
47
48 // Make sure the code below treats available without the soft tail.
49 size_t soft_tail = max_capacity - capacity;
50 available = (available > soft_tail) ? (available - soft_tail) : 0;
51
52 size_t threshold_available = capacity / 100 * ShenandoahMinFreeThreshold;
53
54 if (available < threshold_available) {
55 log_info(gc)("Trigger: Free (" SIZE_FORMAT "%s) is below minimum threshold (" SIZE_FORMAT "%s)",
56 byte_size_in_proper_unit(available), proper_unit_for_byte_size(available),
57 byte_size_in_proper_unit(threshold_available), proper_unit_for_byte_size(threshold_available));
58 return true;
59 }
60 return ShenandoahHeuristics::should_start_gc();
61 }
62
63 void ShenandoahStaticHeuristics::choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
64 RegionData* data, size_t size,
65 size_t free) {
66 size_t threshold = ShenandoahHeapRegion::region_size_bytes() * ShenandoahGarbageThreshold / 100;
67
68 for (size_t idx = 0; idx < size; idx++) {
69 ShenandoahHeapRegion* r = data[idx]._region;
70 if (r->garbage() > threshold) {
71 cset->add_region(r);
72 }
73 }
74 }
|
35 ShenandoahStaticHeuristics::ShenandoahStaticHeuristics(ShenandoahSpaceInfo* space_info) :
36 ShenandoahHeuristics(space_info) {
37 SHENANDOAH_ERGO_ENABLE_FLAG(ExplicitGCInvokesConcurrent);
38 SHENANDOAH_ERGO_ENABLE_FLAG(ShenandoahImplicitGCInvokesConcurrent);
39 }
40
41 ShenandoahStaticHeuristics::~ShenandoahStaticHeuristics() {}
42
43 bool ShenandoahStaticHeuristics::should_start_gc() {
44 size_t max_capacity = _space_info->max_capacity();
45 size_t capacity = _space_info->soft_max_capacity();
46 size_t available = _space_info->available();
47
48 // Make sure the code below treats available without the soft tail.
49 size_t soft_tail = max_capacity - capacity;
50 available = (available > soft_tail) ? (available - soft_tail) : 0;
51
52 size_t threshold_available = capacity / 100 * ShenandoahMinFreeThreshold;
53
54 if (available < threshold_available) {
55 log_trigger("Free (" SIZE_FORMAT "%s) is below minimum threshold (" SIZE_FORMAT "%s)",
56 byte_size_in_proper_unit(available), proper_unit_for_byte_size(available),
57 byte_size_in_proper_unit(threshold_available), proper_unit_for_byte_size(threshold_available));
58 return true;
59 }
60 return ShenandoahHeuristics::should_start_gc();
61 }
62
63 void ShenandoahStaticHeuristics::choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
64 RegionData* data, size_t size,
65 size_t free) {
66 size_t threshold = ShenandoahHeapRegion::region_size_bytes() * ShenandoahGarbageThreshold / 100;
67
68 for (size_t idx = 0; idx < size; idx++) {
69 ShenandoahHeapRegion* r = data[idx].get_region();
70 if (r->garbage() > threshold) {
71 cset->add_region(r);
72 }
73 }
74 }
|