1 /*
   2  * Copyright (c) 2016, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "gc/g1/g1CollectedHeap.hpp"
  27 #include "gc/g1/g1HeapSizingPolicy.hpp"
  28 #include "gc/g1/g1Analytics.hpp"
  29 #include "logging/log.hpp"
  30 #include "runtime/globals.hpp"
  31 #include "utilities/debug.hpp"
  32 #include "utilities/globalDefinitions.hpp"
  33 
  34 G1HeapSizingPolicy* G1HeapSizingPolicy::create(const G1CollectedHeap* g1h, const G1Analytics* analytics) {
  35   return new G1HeapSizingPolicy(g1h, analytics);
  36 }
  37 
  38 G1HeapSizingPolicy::G1HeapSizingPolicy(const G1CollectedHeap* g1h, const G1Analytics* analytics) :
  39   _g1h(g1h),
  40   _analytics(analytics),
  41   _num_prev_pauses_for_heuristics(analytics->number_of_recorded_pause_times()) {
  42 
  43   assert(MinOverThresholdForGrowth < _num_prev_pauses_for_heuristics, "Threshold must be less than %u", _num_prev_pauses_for_heuristics);
  44   clear_ratio_check_data();
  45 }
  46 
  47 void G1HeapSizingPolicy::clear_ratio_check_data() {
  48   _ratio_over_threshold_count = 0;
  49   _ratio_over_threshold_sum = 0.0;
  50   _pauses_since_start = 0;
  51 }
  52 
  53 size_t G1HeapSizingPolicy::expansion_amount() {
  54   double recent_gc_overhead = _analytics->recent_avg_pause_time_ratio() * 100.0;
  55   double last_gc_overhead = _analytics->last_pause_time_ratio() * 100.0;
  56   assert(GCTimeRatio > 0,
  57          "we should have set it to a default value set_g1_gc_flags() "
  58          "if a user set it to 0");
  59   const double gc_overhead_percent = 100.0 * (1.0 / (1.0 + GCTimeRatio));
  60 
  61   double threshold = gc_overhead_percent;
  62   size_t expand_bytes = 0;
  63 
  64   // If the heap is at less than half its maximum size, scale the threshold down,
  65   // to a limit of 1. Thus the smaller the heap is, the more likely it is to expand,
  66   // though the scaling code will likely keep the increase small.
  67   if (_g1h->capacity() <= _g1h->max_capacity() / 2) {
  68     threshold *= (double)_g1h->capacity() / (double)(_g1h->max_capacity() / 2);
  69     threshold = MAX2(threshold, 1.0);
  70   }
  71 
  72   // If the last GC time ratio is over the threshold, increment the count of
  73   // times it has been exceeded, and add this ratio to the sum of exceeded
  74   // ratios.
  75   if (last_gc_overhead > threshold) {
  76     _ratio_over_threshold_count++;
  77     _ratio_over_threshold_sum += last_gc_overhead;
  78   }
  79 
  80   // Check if we've had enough GC time ratio checks that were over the
  81   // threshold to trigger an expansion. We'll also expand if we've
  82   // reached the end of the history buffer and the average of all entries
  83   // is still over the threshold. This indicates a smaller number of GCs were
  84   // long enough to make the average exceed the threshold.
  85   bool filled_history_buffer = _pauses_since_start == _num_prev_pauses_for_heuristics;
  86   if ((_ratio_over_threshold_count == MinOverThresholdForGrowth) ||
  87       (filled_history_buffer && (recent_gc_overhead > threshold))) {
  88     size_t min_expand_bytes = HeapRegion::GrainBytes;
  89     size_t reserved_bytes = _g1h->max_capacity();
  90     size_t committed_bytes = _g1h->capacity();
  91     size_t uncommitted_bytes = reserved_bytes - committed_bytes;
  92     size_t expand_bytes_via_pct =
  93       uncommitted_bytes * G1ExpandByPercentOfAvailable / 100;
  94     double scale_factor = 1.0;
  95 
  96     // If the current size is less than 1/4 of the Initial heap size, expand
  97     // by half of the delta between the current and Initial sizes. IE, grow
  98     // back quickly.
  99     //
 100     // Otherwise, take the current size, or G1ExpandByPercentOfAvailable % of
 101     // the available expansion space, whichever is smaller, as the base
 102     // expansion size. Then possibly scale this size according to how much the
 103     // threshold has (on average) been exceeded by. If the delta is small
 104     // (less than the StartScaleDownAt value), scale the size down linearly, but
 105     // not by less than MinScaleDownFactor. If the delta is large (greater than
 106     // the StartScaleUpAt value), scale up, but adding no more than MaxScaleUpFactor
 107     // times the base size. The scaling will be linear in the range from
 108     // StartScaleUpAt to (StartScaleUpAt + ScaleUpRange). In other words,
 109     // ScaleUpRange sets the rate of scaling up.
 110     if (committed_bytes < InitialHeapSize / 4) {
 111       expand_bytes = (InitialHeapSize - committed_bytes) / 2;
 112     } else {
 113       double const MinScaleDownFactor = 0.2;
 114       double const MaxScaleUpFactor = 2;
 115       double const StartScaleDownAt = gc_overhead_percent;
 116       double const StartScaleUpAt = gc_overhead_percent * 1.5;
 117       double const ScaleUpRange = gc_overhead_percent * 2.0;
 118 
 119       double ratio_delta;
 120       if (filled_history_buffer) {
 121         ratio_delta = recent_gc_overhead - threshold;
 122       } else {
 123         ratio_delta = (_ratio_over_threshold_sum/_ratio_over_threshold_count) - threshold;
 124       }
 125 
 126       expand_bytes = MIN2(expand_bytes_via_pct, committed_bytes);
 127       if (ratio_delta < StartScaleDownAt) {
 128         scale_factor = ratio_delta / StartScaleDownAt;
 129         scale_factor = MAX2(scale_factor, MinScaleDownFactor);
 130       } else if (ratio_delta > StartScaleUpAt) {
 131         scale_factor = 1 + ((ratio_delta - StartScaleUpAt) / ScaleUpRange);
 132         scale_factor = MIN2(scale_factor, MaxScaleUpFactor);
 133       }
 134     }
 135 
 136     log_debug(gc, ergo, heap)("Attempt heap expansion (recent GC overhead higher than threshold after GC) "
 137                               "recent GC overhead: %1.2f %% threshold: %1.2f %% uncommitted: " SIZE_FORMAT "B base expansion amount and scale: " SIZE_FORMAT "B (%1.2f%%)",
 138                               recent_gc_overhead, threshold, uncommitted_bytes, expand_bytes, scale_factor * 100);
 139 
 140     expand_bytes = static_cast<size_t>(expand_bytes * scale_factor);
 141 
 142     // Ensure the expansion size is at least the minimum growth amount
 143     // and at most the remaining uncommitted byte size.
 144     expand_bytes = MAX2(expand_bytes, min_expand_bytes);
 145     expand_bytes = MIN2(expand_bytes, uncommitted_bytes);
 146 
 147     clear_ratio_check_data();
 148   } else {
 149     // An expansion was not triggered. If we've started counting, increment
 150     // the number of checks we've made in the current window.  If we've
 151     // reached the end of the window without resizing, clear the counters to
 152     // start again the next time we see a ratio above the threshold.
 153     if (_ratio_over_threshold_count > 0) {
 154       _pauses_since_start++;
 155       if (_pauses_since_start > _num_prev_pauses_for_heuristics) {
 156         clear_ratio_check_data();
 157       }
 158     }
 159   }
 160 
 161   return expand_bytes;
 162 }