Sat, 23 Nov 2013 12:25:13 +0100
8028128: Add a type safe alternative for working with counter based data
Reviewed-by: dholmes, egahlin
duke@435 | 1 | /* |
tamao@5120 | 2 | * Copyright (c) 2002, 2013, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #ifndef SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSADAPTIVESIZEPOLICY_HPP |
stefank@2314 | 26 | #define SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSADAPTIVESIZEPOLICY_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "gc_implementation/shared/adaptiveSizePolicy.hpp" |
stefank@2314 | 29 | #include "gc_implementation/shared/gcStats.hpp" |
stefank@2314 | 30 | #include "gc_implementation/shared/gcUtil.hpp" |
stefank@2314 | 31 | #include "gc_interface/gcCause.hpp" |
stefank@2314 | 32 | |
duke@435 | 33 | // This class keeps statistical information and computes the |
duke@435 | 34 | // optimal free space for both the young and old generation |
duke@435 | 35 | // based on current application characteristics (based on gc cost |
duke@435 | 36 | // and application footprint). |
duke@435 | 37 | // |
duke@435 | 38 | // It also computes an optimal tenuring threshold between the young |
duke@435 | 39 | // and old generations, so as to equalize the cost of collections |
duke@435 | 40 | // of those generations, as well as optimial survivor space sizes |
duke@435 | 41 | // for the young generation. |
duke@435 | 42 | // |
duke@435 | 43 | // While this class is specifically intended for a generational system |
duke@435 | 44 | // consisting of a young gen (containing an Eden and two semi-spaces) |
duke@435 | 45 | // and a tenured gen, as well as a perm gen for reflective data, it |
duke@435 | 46 | // makes NO references to specific generations. |
duke@435 | 47 | // |
duke@435 | 48 | // 05/02/2003 Update |
duke@435 | 49 | // The 1.5 policy makes use of data gathered for the costs of GC on |
duke@435 | 50 | // specific generations. That data does reference specific |
duke@435 | 51 | // generation. Also diagnostics specific to generations have |
duke@435 | 52 | // been added. |
duke@435 | 53 | |
duke@435 | 54 | // Forward decls |
duke@435 | 55 | class elapsedTimer; |
duke@435 | 56 | |
duke@435 | 57 | class PSAdaptiveSizePolicy : public AdaptiveSizePolicy { |
duke@435 | 58 | friend class PSGCAdaptivePolicyCounters; |
duke@435 | 59 | private: |
duke@435 | 60 | // These values are used to record decisions made during the |
duke@435 | 61 | // policy. For example, if the young generation was decreased |
duke@435 | 62 | // to decrease the GC cost of minor collections the value |
duke@435 | 63 | // decrease_young_gen_for_throughput_true is used. |
duke@435 | 64 | |
duke@435 | 65 | // Last calculated sizes, in bytes, and aligned |
duke@435 | 66 | // NEEDS_CLEANUP should use sizes.hpp, but it works in ints, not size_t's |
duke@435 | 67 | |
duke@435 | 68 | // Time statistics |
duke@435 | 69 | AdaptivePaddedAverage* _avg_major_pause; |
duke@435 | 70 | |
duke@435 | 71 | // Footprint statistics |
duke@435 | 72 | AdaptiveWeightedAverage* _avg_base_footprint; |
duke@435 | 73 | |
duke@435 | 74 | // Statistical data gathered for GC |
duke@435 | 75 | GCStats _gc_stats; |
duke@435 | 76 | |
duke@435 | 77 | size_t _survivor_size_limit; // Limit in bytes of survivor size |
duke@435 | 78 | const double _collection_cost_margin_fraction; |
duke@435 | 79 | |
duke@435 | 80 | // Variable for estimating the major and minor pause times. |
duke@435 | 81 | // These variables represent linear least-squares fits of |
duke@435 | 82 | // the data. |
duke@435 | 83 | // major pause time vs. old gen size |
duke@435 | 84 | LinearLeastSquareFit* _major_pause_old_estimator; |
duke@435 | 85 | // major pause time vs. young gen size |
duke@435 | 86 | LinearLeastSquareFit* _major_pause_young_estimator; |
duke@435 | 87 | |
duke@435 | 88 | |
duke@435 | 89 | // These record the most recent collection times. They |
duke@435 | 90 | // are available as an alternative to using the averages |
duke@435 | 91 | // for making ergonomic decisions. |
duke@435 | 92 | double _latest_major_mutator_interval_seconds; |
duke@435 | 93 | |
jwilhelm@6085 | 94 | const size_t _space_alignment; // alignment for eden, survivors |
duke@435 | 95 | |
duke@435 | 96 | const double _gc_minor_pause_goal_sec; // goal for maximum minor gc pause |
duke@435 | 97 | |
duke@435 | 98 | // The amount of live data in the heap at the last full GC, used |
duke@435 | 99 | // as a baseline to help us determine when we need to perform the |
duke@435 | 100 | // next full GC. |
duke@435 | 101 | size_t _live_at_last_full_gc; |
duke@435 | 102 | |
duke@435 | 103 | // decrease/increase the old generation for minor pause time |
duke@435 | 104 | int _change_old_gen_for_min_pauses; |
duke@435 | 105 | |
duke@435 | 106 | // increase/decrease the young generation for major pause time |
duke@435 | 107 | int _change_young_gen_for_maj_pauses; |
duke@435 | 108 | |
duke@435 | 109 | |
duke@435 | 110 | // Flag indicating that the adaptive policy is ready to use |
duke@435 | 111 | bool _old_gen_policy_is_ready; |
duke@435 | 112 | |
duke@435 | 113 | // Changing the generation sizing depends on the data that is |
duke@435 | 114 | // gathered about the effects of changes on the pause times and |
duke@435 | 115 | // throughput. These variable count the number of data points |
duke@435 | 116 | // gathered. The policy may use these counters as a threshhold |
duke@435 | 117 | // for reliable data. |
duke@435 | 118 | julong _young_gen_change_for_major_pause_count; |
duke@435 | 119 | |
duke@435 | 120 | // To facilitate faster growth at start up, supplement the normal |
duke@435 | 121 | // growth percentage for the young gen eden and the |
duke@435 | 122 | // old gen space for promotion with these value which decay |
duke@435 | 123 | // with increasing collections. |
duke@435 | 124 | uint _young_gen_size_increment_supplement; |
duke@435 | 125 | uint _old_gen_size_increment_supplement; |
duke@435 | 126 | |
duke@435 | 127 | // The number of bytes absorbed from eden into the old gen by moving the |
duke@435 | 128 | // boundary over live data. |
duke@435 | 129 | size_t _bytes_absorbed_from_eden; |
duke@435 | 130 | |
duke@435 | 131 | private: |
duke@435 | 132 | |
duke@435 | 133 | // Accessors |
duke@435 | 134 | AdaptivePaddedAverage* avg_major_pause() const { return _avg_major_pause; } |
duke@435 | 135 | double gc_minor_pause_goal_sec() const { return _gc_minor_pause_goal_sec; } |
duke@435 | 136 | |
duke@435 | 137 | // Change the young generation size to achieve a minor GC pause time goal |
tamao@5120 | 138 | void adjust_promo_for_minor_pause_time(bool is_full_gc, |
duke@435 | 139 | size_t* desired_promo_size_ptr, |
duke@435 | 140 | size_t* desired_eden_size_ptr); |
tamao@5120 | 141 | void adjust_eden_for_minor_pause_time(bool is_full_gc, |
tamao@5120 | 142 | size_t* desired_eden_size_ptr); |
duke@435 | 143 | // Change the generation sizes to achieve a GC pause time goal |
duke@435 | 144 | // Returned sizes are not necessarily aligned. |
tamao@5120 | 145 | void adjust_promo_for_pause_time(bool is_full_gc, |
tamao@5120 | 146 | size_t* desired_promo_size_ptr, |
tamao@5120 | 147 | size_t* desired_eden_size_ptr); |
tamao@5120 | 148 | void adjust_eden_for_pause_time(bool is_full_gc, |
duke@435 | 149 | size_t* desired_promo_size_ptr, |
duke@435 | 150 | size_t* desired_eden_size_ptr); |
duke@435 | 151 | // Change the generation sizes to achieve an application throughput goal |
duke@435 | 152 | // Returned sizes are not necessarily aligned. |
tamao@5120 | 153 | void adjust_promo_for_throughput(bool is_full_gc, |
tamao@5120 | 154 | size_t* desired_promo_size_ptr); |
tamao@5120 | 155 | void adjust_eden_for_throughput(bool is_full_gc, |
duke@435 | 156 | size_t* desired_eden_size_ptr); |
duke@435 | 157 | // Change the generation sizes to achieve minimum footprint |
duke@435 | 158 | // Returned sizes are not aligned. |
duke@435 | 159 | size_t adjust_promo_for_footprint(size_t desired_promo_size, |
duke@435 | 160 | size_t desired_total); |
duke@435 | 161 | size_t adjust_eden_for_footprint(size_t desired_promo_size, |
duke@435 | 162 | size_t desired_total); |
duke@435 | 163 | |
duke@435 | 164 | // Size in bytes for an increment or decrement of eden. |
duke@435 | 165 | virtual size_t eden_increment(size_t cur_eden, uint percent_change); |
duke@435 | 166 | virtual size_t eden_decrement(size_t cur_eden); |
duke@435 | 167 | size_t eden_decrement_aligned_down(size_t cur_eden); |
duke@435 | 168 | size_t eden_increment_with_supplement_aligned_up(size_t cur_eden); |
duke@435 | 169 | |
duke@435 | 170 | // Size in bytes for an increment or decrement of the promotion area |
duke@435 | 171 | virtual size_t promo_increment(size_t cur_promo, uint percent_change); |
duke@435 | 172 | virtual size_t promo_decrement(size_t cur_promo); |
duke@435 | 173 | size_t promo_decrement_aligned_down(size_t cur_promo); |
duke@435 | 174 | size_t promo_increment_with_supplement_aligned_up(size_t cur_promo); |
duke@435 | 175 | |
duke@435 | 176 | // Returns a change that has been scaled down. Result |
duke@435 | 177 | // is not aligned. (If useful, move to some shared |
duke@435 | 178 | // location.) |
duke@435 | 179 | size_t scale_down(size_t change, double part, double total); |
duke@435 | 180 | |
duke@435 | 181 | protected: |
duke@435 | 182 | // Time accessors |
duke@435 | 183 | |
duke@435 | 184 | // Footprint accessors |
duke@435 | 185 | size_t live_space() const { |
duke@435 | 186 | return (size_t)(avg_base_footprint()->average() + |
duke@435 | 187 | avg_young_live()->average() + |
duke@435 | 188 | avg_old_live()->average()); |
duke@435 | 189 | } |
duke@435 | 190 | size_t free_space() const { |
duke@435 | 191 | return _eden_size + _promo_size; |
duke@435 | 192 | } |
duke@435 | 193 | |
duke@435 | 194 | void set_promo_size(size_t new_size) { |
duke@435 | 195 | _promo_size = new_size; |
duke@435 | 196 | } |
duke@435 | 197 | void set_survivor_size(size_t new_size) { |
duke@435 | 198 | _survivor_size = new_size; |
duke@435 | 199 | } |
duke@435 | 200 | |
duke@435 | 201 | // Update estimators |
duke@435 | 202 | void update_minor_pause_old_estimator(double minor_pause_in_ms); |
duke@435 | 203 | |
duke@435 | 204 | virtual GCPolicyKind kind() const { return _gc_ps_adaptive_size_policy; } |
duke@435 | 205 | |
duke@435 | 206 | public: |
duke@435 | 207 | // Use by ASPSYoungGen and ASPSOldGen to limit boundary moving. |
duke@435 | 208 | size_t eden_increment_aligned_up(size_t cur_eden); |
duke@435 | 209 | size_t eden_increment_aligned_down(size_t cur_eden); |
duke@435 | 210 | size_t promo_increment_aligned_up(size_t cur_promo); |
duke@435 | 211 | size_t promo_increment_aligned_down(size_t cur_promo); |
duke@435 | 212 | |
duke@435 | 213 | virtual size_t eden_increment(size_t cur_eden); |
duke@435 | 214 | virtual size_t promo_increment(size_t cur_promo); |
duke@435 | 215 | |
duke@435 | 216 | // Accessors for use by performance counters |
duke@435 | 217 | AdaptivePaddedNoZeroDevAverage* avg_promoted() const { |
duke@435 | 218 | return _gc_stats.avg_promoted(); |
duke@435 | 219 | } |
duke@435 | 220 | AdaptiveWeightedAverage* avg_base_footprint() const { |
duke@435 | 221 | return _avg_base_footprint; |
duke@435 | 222 | } |
duke@435 | 223 | |
duke@435 | 224 | // Input arguments are initial free space sizes for young and old |
duke@435 | 225 | // generations, the initial survivor space size, the |
duke@435 | 226 | // alignment values and the pause & throughput goals. |
duke@435 | 227 | // |
duke@435 | 228 | // NEEDS_CLEANUP this is a singleton object |
duke@435 | 229 | PSAdaptiveSizePolicy(size_t init_eden_size, |
duke@435 | 230 | size_t init_promo_size, |
duke@435 | 231 | size_t init_survivor_size, |
jwilhelm@6085 | 232 | size_t space_alignment, |
duke@435 | 233 | double gc_pause_goal_sec, |
duke@435 | 234 | double gc_minor_pause_goal_sec, |
duke@435 | 235 | uint gc_time_ratio); |
duke@435 | 236 | |
duke@435 | 237 | // Methods indicating events of interest to the adaptive size policy, |
duke@435 | 238 | // called by GC algorithms. It is the responsibility of users of this |
duke@435 | 239 | // policy to call these methods at the correct times! |
duke@435 | 240 | void major_collection_begin(); |
duke@435 | 241 | void major_collection_end(size_t amount_live, GCCause::Cause gc_cause); |
duke@435 | 242 | |
duke@435 | 243 | // |
duke@435 | 244 | void tenured_allocation(size_t size) { |
duke@435 | 245 | _avg_pretenured->sample(size); |
duke@435 | 246 | } |
duke@435 | 247 | |
duke@435 | 248 | // Accessors |
duke@435 | 249 | // NEEDS_CLEANUP should use sizes.hpp |
duke@435 | 250 | |
duke@435 | 251 | size_t calculated_old_free_size_in_bytes() const { |
duke@435 | 252 | return (size_t)(_promo_size + avg_promoted()->padded_average()); |
duke@435 | 253 | } |
duke@435 | 254 | |
duke@435 | 255 | size_t average_old_live_in_bytes() const { |
duke@435 | 256 | return (size_t) avg_old_live()->average(); |
duke@435 | 257 | } |
duke@435 | 258 | |
duke@435 | 259 | size_t average_promoted_in_bytes() const { |
duke@435 | 260 | return (size_t)avg_promoted()->average(); |
duke@435 | 261 | } |
duke@435 | 262 | |
duke@435 | 263 | size_t padded_average_promoted_in_bytes() const { |
duke@435 | 264 | return (size_t)avg_promoted()->padded_average(); |
duke@435 | 265 | } |
duke@435 | 266 | |
duke@435 | 267 | int change_young_gen_for_maj_pauses() { |
duke@435 | 268 | return _change_young_gen_for_maj_pauses; |
duke@435 | 269 | } |
duke@435 | 270 | void set_change_young_gen_for_maj_pauses(int v) { |
duke@435 | 271 | _change_young_gen_for_maj_pauses = v; |
duke@435 | 272 | } |
duke@435 | 273 | |
duke@435 | 274 | int change_old_gen_for_min_pauses() { |
duke@435 | 275 | return _change_old_gen_for_min_pauses; |
duke@435 | 276 | } |
duke@435 | 277 | void set_change_old_gen_for_min_pauses(int v) { |
duke@435 | 278 | _change_old_gen_for_min_pauses = v; |
duke@435 | 279 | } |
duke@435 | 280 | |
duke@435 | 281 | // Return true if the old generation size was changed |
duke@435 | 282 | // to try to reach a pause time goal. |
duke@435 | 283 | bool old_gen_changed_for_pauses() { |
duke@435 | 284 | bool result = _change_old_gen_for_maj_pauses != 0 || |
duke@435 | 285 | _change_old_gen_for_min_pauses != 0; |
duke@435 | 286 | return result; |
duke@435 | 287 | } |
duke@435 | 288 | |
duke@435 | 289 | // Return true if the young generation size was changed |
duke@435 | 290 | // to try to reach a pause time goal. |
duke@435 | 291 | bool young_gen_changed_for_pauses() { |
duke@435 | 292 | bool result = _change_young_gen_for_min_pauses != 0 || |
duke@435 | 293 | _change_young_gen_for_maj_pauses != 0; |
duke@435 | 294 | return result; |
duke@435 | 295 | } |
duke@435 | 296 | // end flags for pause goal |
duke@435 | 297 | |
duke@435 | 298 | // Return true if the old generation size was changed |
duke@435 | 299 | // to try to reach a throughput goal. |
duke@435 | 300 | bool old_gen_changed_for_throughput() { |
duke@435 | 301 | bool result = _change_old_gen_for_throughput != 0; |
duke@435 | 302 | return result; |
duke@435 | 303 | } |
duke@435 | 304 | |
duke@435 | 305 | // Return true if the young generation size was changed |
duke@435 | 306 | // to try to reach a throughput goal. |
duke@435 | 307 | bool young_gen_changed_for_throughput() { |
duke@435 | 308 | bool result = _change_young_gen_for_throughput != 0; |
duke@435 | 309 | return result; |
duke@435 | 310 | } |
duke@435 | 311 | |
duke@435 | 312 | int decrease_for_footprint() { return _decrease_for_footprint; } |
duke@435 | 313 | |
duke@435 | 314 | |
duke@435 | 315 | // Accessors for estimators. The slope of the linear fit is |
duke@435 | 316 | // currently all that is used for making decisions. |
duke@435 | 317 | |
duke@435 | 318 | LinearLeastSquareFit* major_pause_old_estimator() { |
duke@435 | 319 | return _major_pause_old_estimator; |
duke@435 | 320 | } |
duke@435 | 321 | |
duke@435 | 322 | LinearLeastSquareFit* major_pause_young_estimator() { |
duke@435 | 323 | return _major_pause_young_estimator; |
duke@435 | 324 | } |
duke@435 | 325 | |
duke@435 | 326 | |
duke@435 | 327 | virtual void clear_generation_free_space_flags(); |
duke@435 | 328 | |
duke@435 | 329 | float major_pause_old_slope() { return _major_pause_old_estimator->slope(); } |
duke@435 | 330 | float major_pause_young_slope() { |
duke@435 | 331 | return _major_pause_young_estimator->slope(); |
duke@435 | 332 | } |
duke@435 | 333 | float major_collection_slope() { return _major_collection_estimator->slope();} |
duke@435 | 334 | |
duke@435 | 335 | bool old_gen_policy_is_ready() { return _old_gen_policy_is_ready; } |
duke@435 | 336 | |
duke@435 | 337 | // Given the amount of live data in the heap, should we |
duke@435 | 338 | // perform a Full GC? |
duke@435 | 339 | bool should_full_GC(size_t live_in_old_gen); |
duke@435 | 340 | |
tamao@5120 | 341 | // Calculates optimal (free) space sizes for both the young and old |
duke@435 | 342 | // generations. Stores results in _eden_size and _promo_size. |
duke@435 | 343 | // Takes current used space in all generations as input, as well |
duke@435 | 344 | // as an indication if a full gc has just been performed, for use |
duke@435 | 345 | // in deciding if an OOM error should be thrown. |
tamao@5192 | 346 | void compute_generations_free_space(size_t young_live, |
tamao@5192 | 347 | size_t eden_live, |
tamao@5192 | 348 | size_t old_live, |
tamao@5192 | 349 | size_t cur_eden, // current eden in bytes |
tamao@5192 | 350 | size_t max_old_gen_size, |
tamao@5192 | 351 | size_t max_eden_size, |
tamao@5192 | 352 | bool is_full_gc); |
tamao@5120 | 353 | |
tamao@5120 | 354 | void compute_eden_space_size(size_t young_live, |
tamao@5120 | 355 | size_t eden_live, |
tamao@5120 | 356 | size_t cur_eden, // current eden in bytes |
tamao@5120 | 357 | size_t max_eden_size, |
tamao@5120 | 358 | bool is_full_gc); |
tamao@5120 | 359 | |
tamao@5120 | 360 | void compute_old_gen_free_space(size_t old_live, |
tamao@5120 | 361 | size_t cur_eden, // current eden in bytes |
tamao@5120 | 362 | size_t max_old_gen_size, |
tamao@5120 | 363 | bool is_full_gc); |
duke@435 | 364 | |
duke@435 | 365 | // Calculates new survivor space size; returns a new tenuring threshold |
duke@435 | 366 | // value. Stores new survivor size in _survivor_size. |
jwilhelm@4129 | 367 | uint compute_survivor_space_size_and_threshold(bool is_survivor_overflow, |
jwilhelm@4129 | 368 | uint tenuring_threshold, |
jwilhelm@4129 | 369 | size_t survivor_limit); |
duke@435 | 370 | |
duke@435 | 371 | // Return the maximum size of a survivor space if the young generation were of |
duke@435 | 372 | // size gen_size. |
duke@435 | 373 | size_t max_survivor_size(size_t gen_size) { |
duke@435 | 374 | // Never allow the target survivor size to grow more than MinSurvivorRatio |
duke@435 | 375 | // of the young generation size. We cannot grow into a two semi-space |
duke@435 | 376 | // system, with Eden zero sized. Even if the survivor space grows, from() |
duke@435 | 377 | // might grow by moving the bottom boundary "down" -- so from space will |
duke@435 | 378 | // remain almost full anyway (top() will be near end(), but there will be a |
duke@435 | 379 | // large filler object at the bottom). |
duke@435 | 380 | const size_t sz = gen_size / MinSurvivorRatio; |
jwilhelm@6085 | 381 | const size_t alignment = _space_alignment; |
duke@435 | 382 | return sz > alignment ? align_size_down(sz, alignment) : alignment; |
duke@435 | 383 | } |
duke@435 | 384 | |
duke@435 | 385 | size_t live_at_last_full_gc() { |
duke@435 | 386 | return _live_at_last_full_gc; |
duke@435 | 387 | } |
duke@435 | 388 | |
duke@435 | 389 | size_t bytes_absorbed_from_eden() const { return _bytes_absorbed_from_eden; } |
duke@435 | 390 | void reset_bytes_absorbed_from_eden() { _bytes_absorbed_from_eden = 0; } |
duke@435 | 391 | |
duke@435 | 392 | void set_bytes_absorbed_from_eden(size_t val) { |
duke@435 | 393 | _bytes_absorbed_from_eden = val; |
duke@435 | 394 | } |
duke@435 | 395 | |
duke@435 | 396 | // Update averages that are always used (even |
duke@435 | 397 | // if adaptive sizing is turned off). |
duke@435 | 398 | void update_averages(bool is_survivor_overflow, |
duke@435 | 399 | size_t survived, |
duke@435 | 400 | size_t promoted); |
duke@435 | 401 | |
duke@435 | 402 | // Printing support |
duke@435 | 403 | virtual bool print_adaptive_size_policy_on(outputStream* st) const; |
tamao@5120 | 404 | |
tamao@5120 | 405 | // Decay the supplemental growth additive. |
tamao@5120 | 406 | void decay_supplemental_growth(bool is_full_gc); |
duke@435 | 407 | }; |
stefank@2314 | 408 | |
stefank@2314 | 409 | #endif // SHARE_VM_GC_IMPLEMENTATION_PARALLELSCAVENGE_PSADAPTIVESIZEPOLICY_HPP |