25 
26 
27 #include "gc/shenandoah/heuristics/shenandoahStaticHeuristics.hpp"
28 #include "gc/shenandoah/shenandoahCollectionSet.hpp"
29 #include "gc/shenandoah/shenandoahFreeSet.hpp"
30 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
31 #include "gc/shenandoah/shenandoahHeapRegion.inline.hpp"
32 #include "logging/log.hpp"
33 #include "logging/logTag.hpp"
34 
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 (%zu%s) is below minimum threshold (%zu%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     accept_trigger();
59     return true;
60   }
61   return ShenandoahHeuristics::should_start_gc();
62 }
63 
64 void ShenandoahStaticHeuristics::choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
65                                                                        RegionData* data, size_t size,

25 
26 
27 #include "gc/shenandoah/heuristics/shenandoahStaticHeuristics.hpp"
28 #include "gc/shenandoah/shenandoahCollectionSet.hpp"
29 #include "gc/shenandoah/shenandoahFreeSet.hpp"
30 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
31 #include "gc/shenandoah/shenandoahHeapRegion.inline.hpp"
32 #include "logging/log.hpp"
33 #include "logging/logTag.hpp"
34 
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 = ShenandoahHeap::heap()->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 (%zu%s) is below minimum threshold (%zu%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     accept_trigger();
59     return true;
60   }
61   return ShenandoahHeuristics::should_start_gc();
62 }
63 
64 void ShenandoahStaticHeuristics::choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset,
65                                                                        RegionData* data, size_t size,