src/hotspot/share/gc/shenandoah/heuristics/shenandoahCompactHeuristics.cpp

*** 30,11 ***
  #include "gc/shenandoah/shenandoahHeap.inline.hpp"
  #include "gc/shenandoah/shenandoahHeapRegion.inline.hpp"
  #include "logging/log.hpp"
  #include "logging/logTag.hpp"
  
! ShenandoahCompactHeuristics::ShenandoahCompactHeuristics() : ShenandoahHeuristics() {
    SHENANDOAH_ERGO_ENABLE_FLAG(ExplicitGCInvokesConcurrent);
    SHENANDOAH_ERGO_ENABLE_FLAG(ShenandoahImplicitGCInvokesConcurrent);
    SHENANDOAH_ERGO_ENABLE_FLAG(ShenandoahUncommit);
    SHENANDOAH_ERGO_ENABLE_FLAG(ShenandoahAlwaysClearSoftRefs);
    SHENANDOAH_ERGO_OVERRIDE_DEFAULT(ShenandoahAllocationThreshold,  10);
--- 30,12 ---
  #include "gc/shenandoah/shenandoahHeap.inline.hpp"
  #include "gc/shenandoah/shenandoahHeapRegion.inline.hpp"
  #include "logging/log.hpp"
  #include "logging/logTag.hpp"
  
! ShenandoahCompactHeuristics::ShenandoahCompactHeuristics(ShenandoahSpaceInfo* space_info) :
+   ShenandoahHeuristics(space_info) {
    SHENANDOAH_ERGO_ENABLE_FLAG(ExplicitGCInvokesConcurrent);
    SHENANDOAH_ERGO_ENABLE_FLAG(ShenandoahImplicitGCInvokesConcurrent);
    SHENANDOAH_ERGO_ENABLE_FLAG(ShenandoahUncommit);
    SHENANDOAH_ERGO_ENABLE_FLAG(ShenandoahAlwaysClearSoftRefs);
    SHENANDOAH_ERGO_OVERRIDE_DEFAULT(ShenandoahAllocationThreshold,  10);

*** 43,35 ***
    SHENANDOAH_ERGO_OVERRIDE_DEFAULT(ShenandoahGuaranteedGCInterval, 30000);
    SHENANDOAH_ERGO_OVERRIDE_DEFAULT(ShenandoahGarbageThreshold,     10);
  }
  
  bool ShenandoahCompactHeuristics::should_start_gc() {
!   ShenandoahHeap* heap = ShenandoahHeap::heap();
! 
!   size_t max_capacity = heap->max_capacity();
-   size_t capacity = heap->soft_max_capacity();
-   size_t available = heap->free_set()->available();
  
    // Make sure the code below treats available without the soft tail.
    size_t soft_tail = max_capacity - capacity;
    available = (available > soft_tail) ? (available - soft_tail) : 0;
  
    size_t threshold_bytes_allocated = capacity / 100 * ShenandoahAllocationThreshold;
    size_t min_threshold = capacity / 100 * ShenandoahMinFreeThreshold;
  
    if (available < min_threshold) {
!     log_info(gc)("Trigger: Free (" SIZE_FORMAT "%s) is below minimum threshold (" SIZE_FORMAT "%s)",
!                  byte_size_in_proper_unit(available),     proper_unit_for_byte_size(available),
!                  byte_size_in_proper_unit(min_threshold), proper_unit_for_byte_size(min_threshold));
      return true;
    }
  
!   size_t bytes_allocated = heap->bytes_allocated_since_gc_start();
    if (bytes_allocated > threshold_bytes_allocated) {
!     log_info(gc)("Trigger: Allocated since last cycle (" SIZE_FORMAT "%s) is larger than allocation threshold (" SIZE_FORMAT "%s)",
!                  byte_size_in_proper_unit(bytes_allocated),           proper_unit_for_byte_size(bytes_allocated),
!                  byte_size_in_proper_unit(threshold_bytes_allocated), proper_unit_for_byte_size(threshold_bytes_allocated));
      return true;
    }
  
    return ShenandoahHeuristics::should_start_gc();
  }
--- 44,33 ---
    SHENANDOAH_ERGO_OVERRIDE_DEFAULT(ShenandoahGuaranteedGCInterval, 30000);
    SHENANDOAH_ERGO_OVERRIDE_DEFAULT(ShenandoahGarbageThreshold,     10);
  }
  
  bool ShenandoahCompactHeuristics::should_start_gc() {
!   size_t max_capacity = _space_info->max_capacity();
!   size_t capacity = _space_info->soft_max_capacity();
!   size_t available = _space_info->available();
  
    // Make sure the code below treats available without the soft tail.
    size_t soft_tail = max_capacity - capacity;
    available = (available > soft_tail) ? (available - soft_tail) : 0;
  
    size_t threshold_bytes_allocated = capacity / 100 * ShenandoahAllocationThreshold;
    size_t min_threshold = capacity / 100 * ShenandoahMinFreeThreshold;
  
    if (available < min_threshold) {
!     log_trigger("Free (" SIZE_FORMAT "%s) is below minimum threshold (" SIZE_FORMAT "%s)",
!                 byte_size_in_proper_unit(available),     proper_unit_for_byte_size(available),
!                 byte_size_in_proper_unit(min_threshold), proper_unit_for_byte_size(min_threshold));
      return true;
    }
  
!   size_t bytes_allocated = _space_info->bytes_allocated_since_gc_start();
    if (bytes_allocated > threshold_bytes_allocated) {
!     log_trigger("Allocated since last cycle (" SIZE_FORMAT "%s) is larger than allocation threshold (" SIZE_FORMAT "%s)",
!                 byte_size_in_proper_unit(bytes_allocated),           proper_unit_for_byte_size(bytes_allocated),
!                 byte_size_in_proper_unit(threshold_bytes_allocated), proper_unit_for_byte_size(threshold_bytes_allocated));
      return true;
    }
  
    return ShenandoahHeuristics::should_start_gc();
  }

*** 88,11 ***
  
    size_t threshold = ShenandoahHeapRegion::region_size_bytes() * ShenandoahGarbageThreshold / 100;
  
    size_t live_cset = 0;
    for (size_t idx = 0; idx < size; idx++) {
!     ShenandoahHeapRegion* r = data[idx]._region;
      size_t new_cset = live_cset + r->get_live_data_bytes();
      if (new_cset < max_cset && r->garbage() > threshold) {
        live_cset = new_cset;
        cset->add_region(r);
      }
--- 87,11 ---
  
    size_t threshold = ShenandoahHeapRegion::region_size_bytes() * ShenandoahGarbageThreshold / 100;
  
    size_t live_cset = 0;
    for (size_t idx = 0; idx < size; idx++) {
!     ShenandoahHeapRegion* r = data[idx].get_region();
      size_t new_cset = live_cset + r->get_live_data_bytes();
      if (new_cset < max_cset && r->garbage() > threshold) {
        live_cset = new_cset;
        cset->add_region(r);
      }