Wed, 21 Dec 2011 07:53:53 -0500
7119027: G1: use atomics to update RS length / predict time of inc CSet
Summary: Make sure that the updates to the RS length and inc CSet predicted time are updated in an MT-safe way.
Reviewed-by: brutisso, iveresov
ysr@777 | 1 | /* |
tonyp@3028 | 2 | * Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved. |
ysr@777 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
ysr@777 | 4 | * |
ysr@777 | 5 | * This code is free software; you can redistribute it and/or modify it |
ysr@777 | 6 | * under the terms of the GNU General Public License version 2 only, as |
ysr@777 | 7 | * published by the Free Software Foundation. |
ysr@777 | 8 | * |
ysr@777 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
ysr@777 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
ysr@777 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
ysr@777 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
ysr@777 | 13 | * accompanied this code). |
ysr@777 | 14 | * |
ysr@777 | 15 | * You should have received a copy of the GNU General Public License version |
ysr@777 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
ysr@777 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
ysr@777 | 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. |
ysr@777 | 22 | * |
ysr@777 | 23 | */ |
ysr@777 | 24 | |
stefank@2314 | 25 | #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTORPOLICY_HPP |
stefank@2314 | 26 | #define SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTORPOLICY_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "gc_implementation/g1/collectionSetChooser.hpp" |
stefank@2314 | 29 | #include "gc_implementation/g1/g1MMUTracker.hpp" |
stefank@2314 | 30 | #include "memory/collectorPolicy.hpp" |
stefank@2314 | 31 | |
ysr@777 | 32 | // A G1CollectorPolicy makes policy decisions that determine the |
ysr@777 | 33 | // characteristics of the collector. Examples include: |
ysr@777 | 34 | // * choice of collection set. |
ysr@777 | 35 | // * when to collect. |
ysr@777 | 36 | |
ysr@777 | 37 | class HeapRegion; |
ysr@777 | 38 | class CollectionSetChooser; |
ysr@777 | 39 | |
ysr@777 | 40 | // Yes, this is a bit unpleasant... but it saves replicating the same thing |
ysr@777 | 41 | // over and over again and introducing subtle problems through small typos and |
ysr@777 | 42 | // cutting and pasting mistakes. The macros below introduces a number |
ysr@777 | 43 | // sequnce into the following two classes and the methods that access it. |
ysr@777 | 44 | |
ysr@777 | 45 | #define define_num_seq(name) \ |
ysr@777 | 46 | private: \ |
ysr@777 | 47 | NumberSeq _all_##name##_times_ms; \ |
ysr@777 | 48 | public: \ |
ysr@777 | 49 | void record_##name##_time_ms(double ms) { \ |
ysr@777 | 50 | _all_##name##_times_ms.add(ms); \ |
ysr@777 | 51 | } \ |
ysr@777 | 52 | NumberSeq* get_##name##_seq() { \ |
ysr@777 | 53 | return &_all_##name##_times_ms; \ |
ysr@777 | 54 | } |
ysr@777 | 55 | |
ysr@777 | 56 | class MainBodySummary; |
ysr@777 | 57 | |
apetrusenko@984 | 58 | class PauseSummary: public CHeapObj { |
ysr@777 | 59 | define_num_seq(total) |
ysr@777 | 60 | define_num_seq(other) |
ysr@777 | 61 | |
ysr@777 | 62 | public: |
ysr@777 | 63 | virtual MainBodySummary* main_body_summary() { return NULL; } |
ysr@777 | 64 | }; |
ysr@777 | 65 | |
apetrusenko@984 | 66 | class MainBodySummary: public CHeapObj { |
ysr@777 | 67 | define_num_seq(satb_drain) // optional |
ysr@777 | 68 | define_num_seq(parallel) // parallel only |
ysr@777 | 69 | define_num_seq(ext_root_scan) |
ysr@777 | 70 | define_num_seq(mark_stack_scan) |
ysr@777 | 71 | define_num_seq(update_rs) |
ysr@777 | 72 | define_num_seq(scan_rs) |
ysr@777 | 73 | define_num_seq(obj_copy) |
ysr@777 | 74 | define_num_seq(termination) // parallel only |
ysr@777 | 75 | define_num_seq(parallel_other) // parallel only |
ysr@777 | 76 | define_num_seq(mark_closure) |
johnc@3219 | 77 | define_num_seq(clear_ct) |
ysr@777 | 78 | }; |
ysr@777 | 79 | |
apetrusenko@1112 | 80 | class Summary: public PauseSummary, |
apetrusenko@1112 | 81 | public MainBodySummary { |
ysr@777 | 82 | public: |
ysr@777 | 83 | virtual MainBodySummary* main_body_summary() { return this; } |
ysr@777 | 84 | }; |
ysr@777 | 85 | |
ysr@777 | 86 | class G1CollectorPolicy: public CollectorPolicy { |
tonyp@3209 | 87 | private: |
ysr@777 | 88 | // either equal to the number of parallel threads, if ParallelGCThreads |
ysr@777 | 89 | // has been set, or 1 otherwise |
ysr@777 | 90 | int _parallel_gc_threads; |
ysr@777 | 91 | |
jmasa@3294 | 92 | // The number of GC threads currently active. |
jmasa@3294 | 93 | uintx _no_of_gc_threads; |
jmasa@3294 | 94 | |
ysr@777 | 95 | enum SomePrivateConstants { |
tonyp@1377 | 96 | NumPrevPausesForHeuristics = 10 |
ysr@777 | 97 | }; |
ysr@777 | 98 | |
ysr@777 | 99 | G1MMUTracker* _mmu_tracker; |
ysr@777 | 100 | |
ysr@777 | 101 | void initialize_flags(); |
ysr@777 | 102 | |
ysr@777 | 103 | void initialize_all() { |
ysr@777 | 104 | initialize_flags(); |
ysr@777 | 105 | initialize_size_info(); |
ysr@777 | 106 | initialize_perm_generation(PermGen::MarkSweepCompact); |
ysr@777 | 107 | } |
ysr@777 | 108 | |
tonyp@3209 | 109 | CollectionSetChooser* _collectionSetChooser; |
ysr@777 | 110 | |
ysr@777 | 111 | double _cur_collection_start_sec; |
ysr@777 | 112 | size_t _cur_collection_pause_used_at_start_bytes; |
ysr@777 | 113 | size_t _cur_collection_pause_used_regions_at_start; |
ysr@777 | 114 | size_t _prev_collection_pause_used_at_end_bytes; |
ysr@777 | 115 | double _cur_collection_par_time_ms; |
ysr@777 | 116 | double _cur_satb_drain_time_ms; |
ysr@777 | 117 | double _cur_clear_ct_time_ms; |
johnc@3175 | 118 | double _cur_ref_proc_time_ms; |
johnc@3175 | 119 | double _cur_ref_enq_time_ms; |
ysr@777 | 120 | |
johnc@1325 | 121 | #ifndef PRODUCT |
johnc@1325 | 122 | // Card Table Count Cache stats |
johnc@1325 | 123 | double _min_clear_cc_time_ms; // min |
johnc@1325 | 124 | double _max_clear_cc_time_ms; // max |
johnc@1325 | 125 | double _cur_clear_cc_time_ms; // clearing time during current pause |
johnc@1325 | 126 | double _cum_clear_cc_time_ms; // cummulative clearing time |
johnc@1325 | 127 | jlong _num_cc_clears; // number of times the card count cache has been cleared |
johnc@1325 | 128 | #endif |
johnc@1325 | 129 | |
ysr@777 | 130 | // These exclude marking times. |
ysr@777 | 131 | TruncatedSeq* _recent_gc_times_ms; |
ysr@777 | 132 | |
ysr@777 | 133 | TruncatedSeq* _concurrent_mark_remark_times_ms; |
ysr@777 | 134 | TruncatedSeq* _concurrent_mark_cleanup_times_ms; |
ysr@777 | 135 | |
apetrusenko@1112 | 136 | Summary* _summary; |
ysr@777 | 137 | |
ysr@777 | 138 | NumberSeq* _all_pause_times_ms; |
ysr@777 | 139 | NumberSeq* _all_full_gc_times_ms; |
ysr@777 | 140 | double _stop_world_start; |
ysr@777 | 141 | NumberSeq* _all_stop_world_times_ms; |
ysr@777 | 142 | NumberSeq* _all_yield_times_ms; |
ysr@777 | 143 | |
ysr@777 | 144 | int _aux_num; |
ysr@777 | 145 | NumberSeq* _all_aux_times_ms; |
ysr@777 | 146 | double* _cur_aux_start_times_ms; |
ysr@777 | 147 | double* _cur_aux_times_ms; |
ysr@777 | 148 | bool* _cur_aux_times_set; |
ysr@777 | 149 | |
tonyp@1966 | 150 | double* _par_last_gc_worker_start_times_ms; |
ysr@777 | 151 | double* _par_last_ext_root_scan_times_ms; |
ysr@777 | 152 | double* _par_last_mark_stack_scan_times_ms; |
ysr@777 | 153 | double* _par_last_update_rs_times_ms; |
ysr@777 | 154 | double* _par_last_update_rs_processed_buffers; |
ysr@777 | 155 | double* _par_last_scan_rs_times_ms; |
ysr@777 | 156 | double* _par_last_obj_copy_times_ms; |
ysr@777 | 157 | double* _par_last_termination_times_ms; |
tonyp@1966 | 158 | double* _par_last_termination_attempts; |
tonyp@1966 | 159 | double* _par_last_gc_worker_end_times_ms; |
brutisso@2712 | 160 | double* _par_last_gc_worker_times_ms; |
ysr@777 | 161 | |
johnc@3219 | 162 | // Each workers 'other' time i.e. the elapsed time of the parallel |
johnc@3219 | 163 | // phase of the pause minus the sum of the individual sub-phase |
johnc@3219 | 164 | // times for a given worker thread. |
johnc@3219 | 165 | double* _par_last_gc_worker_other_times_ms; |
johnc@3219 | 166 | |
tonyp@3337 | 167 | // indicates whether we are in young or mixed GC mode |
tonyp@3337 | 168 | bool _gcs_are_young; |
ysr@777 | 169 | |
ysr@777 | 170 | // if true, then it tries to dynamically adjust the length of the |
ysr@777 | 171 | // young list |
ysr@777 | 172 | bool _adaptive_young_list_length; |
ysr@777 | 173 | size_t _young_list_target_length; |
ysr@777 | 174 | size_t _young_list_fixed_length; |
brutisso@3120 | 175 | size_t _prev_eden_capacity; // used for logging |
ysr@777 | 176 | |
tonyp@2333 | 177 | // The max number of regions we can extend the eden by while the GC |
tonyp@2333 | 178 | // locker is active. This should be >= _young_list_target_length; |
tonyp@2333 | 179 | size_t _young_list_max_length; |
tonyp@2333 | 180 | |
tonyp@3337 | 181 | bool _last_gc_was_young; |
ysr@777 | 182 | |
tonyp@3337 | 183 | unsigned _young_pause_num; |
tonyp@3337 | 184 | unsigned _mixed_pause_num; |
ysr@777 | 185 | |
ysr@777 | 186 | bool _during_marking; |
ysr@777 | 187 | bool _in_marking_window; |
ysr@777 | 188 | bool _in_marking_window_im; |
ysr@777 | 189 | |
ysr@777 | 190 | SurvRateGroup* _short_lived_surv_rate_group; |
ysr@777 | 191 | SurvRateGroup* _survivor_surv_rate_group; |
ysr@777 | 192 | // add here any more surv rate groups |
ysr@777 | 193 | |
tonyp@1791 | 194 | double _gc_overhead_perc; |
tonyp@1791 | 195 | |
tonyp@3119 | 196 | double _reserve_factor; |
tonyp@3119 | 197 | size_t _reserve_regions; |
tonyp@3119 | 198 | |
ysr@777 | 199 | bool during_marking() { |
ysr@777 | 200 | return _during_marking; |
ysr@777 | 201 | } |
ysr@777 | 202 | |
ysr@777 | 203 | private: |
ysr@777 | 204 | enum PredictionConstants { |
ysr@777 | 205 | TruncatedSeqLength = 10 |
ysr@777 | 206 | }; |
ysr@777 | 207 | |
ysr@777 | 208 | TruncatedSeq* _alloc_rate_ms_seq; |
ysr@777 | 209 | double _prev_collection_pause_end_ms; |
ysr@777 | 210 | |
ysr@777 | 211 | TruncatedSeq* _pending_card_diff_seq; |
ysr@777 | 212 | TruncatedSeq* _rs_length_diff_seq; |
ysr@777 | 213 | TruncatedSeq* _cost_per_card_ms_seq; |
tonyp@3337 | 214 | TruncatedSeq* _young_cards_per_entry_ratio_seq; |
tonyp@3337 | 215 | TruncatedSeq* _mixed_cards_per_entry_ratio_seq; |
ysr@777 | 216 | TruncatedSeq* _cost_per_entry_ms_seq; |
tonyp@3337 | 217 | TruncatedSeq* _mixed_cost_per_entry_ms_seq; |
ysr@777 | 218 | TruncatedSeq* _cost_per_byte_ms_seq; |
ysr@777 | 219 | TruncatedSeq* _constant_other_time_ms_seq; |
ysr@777 | 220 | TruncatedSeq* _young_other_cost_per_region_ms_seq; |
ysr@777 | 221 | TruncatedSeq* _non_young_other_cost_per_region_ms_seq; |
ysr@777 | 222 | |
ysr@777 | 223 | TruncatedSeq* _pending_cards_seq; |
ysr@777 | 224 | TruncatedSeq* _rs_lengths_seq; |
ysr@777 | 225 | |
ysr@777 | 226 | TruncatedSeq* _cost_per_byte_ms_during_cm_seq; |
ysr@777 | 227 | |
ysr@777 | 228 | TruncatedSeq* _young_gc_eff_seq; |
ysr@777 | 229 | |
brutisso@3120 | 230 | bool _using_new_ratio_calculations; |
brutisso@3120 | 231 | size_t _min_desired_young_length; // as set on the command line or default calculations |
brutisso@3120 | 232 | size_t _max_desired_young_length; // as set on the command line or default calculations |
brutisso@3120 | 233 | |
tonyp@3289 | 234 | size_t _eden_cset_region_length; |
tonyp@3289 | 235 | size_t _survivor_cset_region_length; |
tonyp@3289 | 236 | size_t _old_cset_region_length; |
tonyp@3289 | 237 | |
tonyp@3289 | 238 | void init_cset_region_lengths(size_t eden_cset_region_length, |
tonyp@3289 | 239 | size_t survivor_cset_region_length); |
tonyp@3289 | 240 | |
tonyp@3289 | 241 | size_t eden_cset_region_length() { return _eden_cset_region_length; } |
tonyp@3289 | 242 | size_t survivor_cset_region_length() { return _survivor_cset_region_length; } |
tonyp@3289 | 243 | size_t old_cset_region_length() { return _old_cset_region_length; } |
ysr@777 | 244 | |
ysr@777 | 245 | size_t _free_regions_at_end_of_collection; |
ysr@777 | 246 | |
ysr@777 | 247 | size_t _recorded_rs_lengths; |
ysr@777 | 248 | size_t _max_rs_lengths; |
ysr@777 | 249 | |
ysr@777 | 250 | double _recorded_young_free_cset_time_ms; |
ysr@777 | 251 | double _recorded_non_young_free_cset_time_ms; |
ysr@777 | 252 | |
ysr@777 | 253 | double _sigma; |
ysr@777 | 254 | double _expensive_region_limit_ms; |
ysr@777 | 255 | |
ysr@777 | 256 | size_t _rs_lengths_prediction; |
ysr@777 | 257 | |
ysr@777 | 258 | size_t _known_garbage_bytes; |
ysr@777 | 259 | double _known_garbage_ratio; |
ysr@777 | 260 | |
ysr@777 | 261 | double sigma() { |
ysr@777 | 262 | return _sigma; |
ysr@777 | 263 | } |
ysr@777 | 264 | |
ysr@777 | 265 | // A function that prevents us putting too much stock in small sample |
ysr@777 | 266 | // sets. Returns a number between 2.0 and 1.0, depending on the number |
ysr@777 | 267 | // of samples. 5 or more samples yields one; fewer scales linearly from |
ysr@777 | 268 | // 2.0 at 1 sample to 1.0 at 5. |
ysr@777 | 269 | double confidence_factor(int samples) { |
ysr@777 | 270 | if (samples > 4) return 1.0; |
ysr@777 | 271 | else return 1.0 + sigma() * ((double)(5 - samples))/2.0; |
ysr@777 | 272 | } |
ysr@777 | 273 | |
ysr@777 | 274 | double get_new_neg_prediction(TruncatedSeq* seq) { |
ysr@777 | 275 | return seq->davg() - sigma() * seq->dsd(); |
ysr@777 | 276 | } |
ysr@777 | 277 | |
ysr@777 | 278 | #ifndef PRODUCT |
ysr@777 | 279 | bool verify_young_ages(HeapRegion* head, SurvRateGroup *surv_rate_group); |
ysr@777 | 280 | #endif // PRODUCT |
ysr@777 | 281 | |
iveresov@1546 | 282 | void adjust_concurrent_refinement(double update_rs_time, |
iveresov@1546 | 283 | double update_rs_processed_buffers, |
iveresov@1546 | 284 | double goal_ms); |
iveresov@1546 | 285 | |
jmasa@3294 | 286 | uintx no_of_gc_threads() { return _no_of_gc_threads; } |
jmasa@3294 | 287 | void set_no_of_gc_threads(uintx v) { _no_of_gc_threads = v; } |
jmasa@3294 | 288 | |
ysr@777 | 289 | double _pause_time_target_ms; |
ysr@777 | 290 | double _recorded_young_cset_choice_time_ms; |
ysr@777 | 291 | double _recorded_non_young_cset_choice_time_ms; |
ysr@777 | 292 | size_t _pending_cards; |
ysr@777 | 293 | size_t _max_pending_cards; |
ysr@777 | 294 | |
ysr@777 | 295 | public: |
jmasa@3294 | 296 | // Accessors |
ysr@777 | 297 | |
tonyp@3289 | 298 | void set_region_eden(HeapRegion* hr, int young_index_in_cset) { |
tonyp@3289 | 299 | hr->set_young(); |
ysr@777 | 300 | hr->install_surv_rate_group(_short_lived_surv_rate_group); |
tonyp@3289 | 301 | hr->set_young_index_in_cset(young_index_in_cset); |
ysr@777 | 302 | } |
ysr@777 | 303 | |
tonyp@3289 | 304 | void set_region_survivor(HeapRegion* hr, int young_index_in_cset) { |
tonyp@3289 | 305 | assert(hr->is_young() && hr->is_survivor(), "pre-condition"); |
ysr@777 | 306 | hr->install_surv_rate_group(_survivor_surv_rate_group); |
tonyp@3289 | 307 | hr->set_young_index_in_cset(young_index_in_cset); |
ysr@777 | 308 | } |
ysr@777 | 309 | |
ysr@777 | 310 | #ifndef PRODUCT |
ysr@777 | 311 | bool verify_young_ages(); |
ysr@777 | 312 | #endif // PRODUCT |
ysr@777 | 313 | |
ysr@777 | 314 | double get_new_prediction(TruncatedSeq* seq) { |
ysr@777 | 315 | return MAX2(seq->davg() + sigma() * seq->dsd(), |
ysr@777 | 316 | seq->davg() * confidence_factor(seq->num())); |
ysr@777 | 317 | } |
ysr@777 | 318 | |
ysr@777 | 319 | void record_max_rs_lengths(size_t rs_lengths) { |
ysr@777 | 320 | _max_rs_lengths = rs_lengths; |
ysr@777 | 321 | } |
ysr@777 | 322 | |
ysr@777 | 323 | size_t predict_pending_card_diff() { |
ysr@777 | 324 | double prediction = get_new_neg_prediction(_pending_card_diff_seq); |
tonyp@3337 | 325 | if (prediction < 0.00001) { |
ysr@777 | 326 | return 0; |
tonyp@3337 | 327 | } else { |
ysr@777 | 328 | return (size_t) prediction; |
tonyp@3337 | 329 | } |
ysr@777 | 330 | } |
ysr@777 | 331 | |
ysr@777 | 332 | size_t predict_pending_cards() { |
ysr@777 | 333 | size_t max_pending_card_num = _g1->max_pending_card_num(); |
ysr@777 | 334 | size_t diff = predict_pending_card_diff(); |
ysr@777 | 335 | size_t prediction; |
tonyp@3337 | 336 | if (diff > max_pending_card_num) { |
ysr@777 | 337 | prediction = max_pending_card_num; |
tonyp@3337 | 338 | } else { |
ysr@777 | 339 | prediction = max_pending_card_num - diff; |
tonyp@3337 | 340 | } |
ysr@777 | 341 | |
ysr@777 | 342 | return prediction; |
ysr@777 | 343 | } |
ysr@777 | 344 | |
ysr@777 | 345 | size_t predict_rs_length_diff() { |
ysr@777 | 346 | return (size_t) get_new_prediction(_rs_length_diff_seq); |
ysr@777 | 347 | } |
ysr@777 | 348 | |
ysr@777 | 349 | double predict_alloc_rate_ms() { |
ysr@777 | 350 | return get_new_prediction(_alloc_rate_ms_seq); |
ysr@777 | 351 | } |
ysr@777 | 352 | |
ysr@777 | 353 | double predict_cost_per_card_ms() { |
ysr@777 | 354 | return get_new_prediction(_cost_per_card_ms_seq); |
ysr@777 | 355 | } |
ysr@777 | 356 | |
ysr@777 | 357 | double predict_rs_update_time_ms(size_t pending_cards) { |
ysr@777 | 358 | return (double) pending_cards * predict_cost_per_card_ms(); |
ysr@777 | 359 | } |
ysr@777 | 360 | |
tonyp@3337 | 361 | double predict_young_cards_per_entry_ratio() { |
tonyp@3337 | 362 | return get_new_prediction(_young_cards_per_entry_ratio_seq); |
ysr@777 | 363 | } |
ysr@777 | 364 | |
tonyp@3337 | 365 | double predict_mixed_cards_per_entry_ratio() { |
tonyp@3337 | 366 | if (_mixed_cards_per_entry_ratio_seq->num() < 2) { |
tonyp@3337 | 367 | return predict_young_cards_per_entry_ratio(); |
tonyp@3337 | 368 | } else { |
tonyp@3337 | 369 | return get_new_prediction(_mixed_cards_per_entry_ratio_seq); |
tonyp@3337 | 370 | } |
ysr@777 | 371 | } |
ysr@777 | 372 | |
ysr@777 | 373 | size_t predict_young_card_num(size_t rs_length) { |
ysr@777 | 374 | return (size_t) ((double) rs_length * |
tonyp@3337 | 375 | predict_young_cards_per_entry_ratio()); |
ysr@777 | 376 | } |
ysr@777 | 377 | |
ysr@777 | 378 | size_t predict_non_young_card_num(size_t rs_length) { |
ysr@777 | 379 | return (size_t) ((double) rs_length * |
tonyp@3337 | 380 | predict_mixed_cards_per_entry_ratio()); |
ysr@777 | 381 | } |
ysr@777 | 382 | |
ysr@777 | 383 | double predict_rs_scan_time_ms(size_t card_num) { |
tonyp@3337 | 384 | if (gcs_are_young()) { |
ysr@777 | 385 | return (double) card_num * get_new_prediction(_cost_per_entry_ms_seq); |
tonyp@3337 | 386 | } else { |
tonyp@3337 | 387 | return predict_mixed_rs_scan_time_ms(card_num); |
tonyp@3337 | 388 | } |
ysr@777 | 389 | } |
ysr@777 | 390 | |
tonyp@3337 | 391 | double predict_mixed_rs_scan_time_ms(size_t card_num) { |
tonyp@3337 | 392 | if (_mixed_cost_per_entry_ms_seq->num() < 3) { |
ysr@777 | 393 | return (double) card_num * get_new_prediction(_cost_per_entry_ms_seq); |
tonyp@3337 | 394 | } else { |
tonyp@3337 | 395 | return (double) (card_num * |
tonyp@3337 | 396 | get_new_prediction(_mixed_cost_per_entry_ms_seq)); |
tonyp@3337 | 397 | } |
ysr@777 | 398 | } |
ysr@777 | 399 | |
ysr@777 | 400 | double predict_object_copy_time_ms_during_cm(size_t bytes_to_copy) { |
tonyp@3337 | 401 | if (_cost_per_byte_ms_during_cm_seq->num() < 3) { |
tonyp@3337 | 402 | return (1.1 * (double) bytes_to_copy) * |
tonyp@3337 | 403 | get_new_prediction(_cost_per_byte_ms_seq); |
tonyp@3337 | 404 | } else { |
ysr@777 | 405 | return (double) bytes_to_copy * |
tonyp@3337 | 406 | get_new_prediction(_cost_per_byte_ms_during_cm_seq); |
tonyp@3337 | 407 | } |
ysr@777 | 408 | } |
ysr@777 | 409 | |
ysr@777 | 410 | double predict_object_copy_time_ms(size_t bytes_to_copy) { |
tonyp@3337 | 411 | if (_in_marking_window && !_in_marking_window_im) { |
ysr@777 | 412 | return predict_object_copy_time_ms_during_cm(bytes_to_copy); |
tonyp@3337 | 413 | } else { |
ysr@777 | 414 | return (double) bytes_to_copy * |
tonyp@3337 | 415 | get_new_prediction(_cost_per_byte_ms_seq); |
tonyp@3337 | 416 | } |
ysr@777 | 417 | } |
ysr@777 | 418 | |
ysr@777 | 419 | double predict_constant_other_time_ms() { |
ysr@777 | 420 | return get_new_prediction(_constant_other_time_ms_seq); |
ysr@777 | 421 | } |
ysr@777 | 422 | |
ysr@777 | 423 | double predict_young_other_time_ms(size_t young_num) { |
tonyp@3337 | 424 | return (double) young_num * |
tonyp@3337 | 425 | get_new_prediction(_young_other_cost_per_region_ms_seq); |
ysr@777 | 426 | } |
ysr@777 | 427 | |
ysr@777 | 428 | double predict_non_young_other_time_ms(size_t non_young_num) { |
tonyp@3337 | 429 | return (double) non_young_num * |
tonyp@3337 | 430 | get_new_prediction(_non_young_other_cost_per_region_ms_seq); |
ysr@777 | 431 | } |
ysr@777 | 432 | |
ysr@777 | 433 | void check_if_region_is_too_expensive(double predicted_time_ms); |
ysr@777 | 434 | |
ysr@777 | 435 | double predict_young_collection_elapsed_time_ms(size_t adjustment); |
ysr@777 | 436 | double predict_base_elapsed_time_ms(size_t pending_cards); |
ysr@777 | 437 | double predict_base_elapsed_time_ms(size_t pending_cards, |
ysr@777 | 438 | size_t scanned_cards); |
ysr@777 | 439 | size_t predict_bytes_to_copy(HeapRegion* hr); |
ysr@777 | 440 | double predict_region_elapsed_time_ms(HeapRegion* hr, bool young); |
ysr@777 | 441 | |
tonyp@3289 | 442 | void set_recorded_rs_lengths(size_t rs_lengths); |
johnc@1829 | 443 | |
tonyp@3289 | 444 | size_t cset_region_length() { return young_cset_region_length() + |
tonyp@3289 | 445 | old_cset_region_length(); } |
tonyp@3289 | 446 | size_t young_cset_region_length() { return eden_cset_region_length() + |
tonyp@3289 | 447 | survivor_cset_region_length(); } |
ysr@777 | 448 | |
ysr@777 | 449 | void record_young_free_cset_time_ms(double time_ms) { |
ysr@777 | 450 | _recorded_young_free_cset_time_ms = time_ms; |
ysr@777 | 451 | } |
ysr@777 | 452 | |
ysr@777 | 453 | void record_non_young_free_cset_time_ms(double time_ms) { |
ysr@777 | 454 | _recorded_non_young_free_cset_time_ms = time_ms; |
ysr@777 | 455 | } |
ysr@777 | 456 | |
ysr@777 | 457 | double predict_young_gc_eff() { |
ysr@777 | 458 | return get_new_neg_prediction(_young_gc_eff_seq); |
ysr@777 | 459 | } |
ysr@777 | 460 | |
apetrusenko@980 | 461 | double predict_survivor_regions_evac_time(); |
apetrusenko@980 | 462 | |
ysr@777 | 463 | void cset_regions_freed() { |
tonyp@3337 | 464 | bool propagate = _last_gc_was_young && !_in_marking_window; |
ysr@777 | 465 | _short_lived_surv_rate_group->all_surviving_words_recorded(propagate); |
ysr@777 | 466 | _survivor_surv_rate_group->all_surviving_words_recorded(propagate); |
ysr@777 | 467 | // also call it on any more surv rate groups |
ysr@777 | 468 | } |
ysr@777 | 469 | |
ysr@777 | 470 | void set_known_garbage_bytes(size_t known_garbage_bytes) { |
ysr@777 | 471 | _known_garbage_bytes = known_garbage_bytes; |
ysr@777 | 472 | size_t heap_bytes = _g1->capacity(); |
ysr@777 | 473 | _known_garbage_ratio = (double) _known_garbage_bytes / (double) heap_bytes; |
ysr@777 | 474 | } |
ysr@777 | 475 | |
ysr@777 | 476 | void decrease_known_garbage_bytes(size_t known_garbage_bytes) { |
ysr@777 | 477 | guarantee( _known_garbage_bytes >= known_garbage_bytes, "invariant" ); |
ysr@777 | 478 | |
ysr@777 | 479 | _known_garbage_bytes -= known_garbage_bytes; |
ysr@777 | 480 | size_t heap_bytes = _g1->capacity(); |
ysr@777 | 481 | _known_garbage_ratio = (double) _known_garbage_bytes / (double) heap_bytes; |
ysr@777 | 482 | } |
ysr@777 | 483 | |
ysr@777 | 484 | G1MMUTracker* mmu_tracker() { |
ysr@777 | 485 | return _mmu_tracker; |
ysr@777 | 486 | } |
ysr@777 | 487 | |
tonyp@2011 | 488 | double max_pause_time_ms() { |
tonyp@2011 | 489 | return _mmu_tracker->max_gc_time() * 1000.0; |
tonyp@2011 | 490 | } |
tonyp@2011 | 491 | |
ysr@777 | 492 | double predict_remark_time_ms() { |
ysr@777 | 493 | return get_new_prediction(_concurrent_mark_remark_times_ms); |
ysr@777 | 494 | } |
ysr@777 | 495 | |
ysr@777 | 496 | double predict_cleanup_time_ms() { |
ysr@777 | 497 | return get_new_prediction(_concurrent_mark_cleanup_times_ms); |
ysr@777 | 498 | } |
ysr@777 | 499 | |
ysr@777 | 500 | // Returns an estimate of the survival rate of the region at yg-age |
ysr@777 | 501 | // "yg_age". |
apetrusenko@980 | 502 | double predict_yg_surv_rate(int age, SurvRateGroup* surv_rate_group) { |
apetrusenko@980 | 503 | TruncatedSeq* seq = surv_rate_group->get_seq(age); |
ysr@777 | 504 | if (seq->num() == 0) |
ysr@777 | 505 | gclog_or_tty->print("BARF! age is %d", age); |
ysr@777 | 506 | guarantee( seq->num() > 0, "invariant" ); |
ysr@777 | 507 | double pred = get_new_prediction(seq); |
ysr@777 | 508 | if (pred > 1.0) |
ysr@777 | 509 | pred = 1.0; |
ysr@777 | 510 | return pred; |
ysr@777 | 511 | } |
ysr@777 | 512 | |
apetrusenko@980 | 513 | double predict_yg_surv_rate(int age) { |
apetrusenko@980 | 514 | return predict_yg_surv_rate(age, _short_lived_surv_rate_group); |
apetrusenko@980 | 515 | } |
apetrusenko@980 | 516 | |
ysr@777 | 517 | double accum_yg_surv_rate_pred(int age) { |
ysr@777 | 518 | return _short_lived_surv_rate_group->accum_surv_rate_pred(age); |
ysr@777 | 519 | } |
ysr@777 | 520 | |
tonyp@3209 | 521 | private: |
tonyp@1966 | 522 | void print_stats(int level, const char* str, double value); |
tonyp@1966 | 523 | void print_stats(int level, const char* str, int value); |
tonyp@1966 | 524 | |
brutisso@2712 | 525 | void print_par_stats(int level, const char* str, double* data); |
brutisso@2712 | 526 | void print_par_sizes(int level, const char* str, double* data); |
ysr@777 | 527 | |
ysr@777 | 528 | void check_other_times(int level, |
ysr@777 | 529 | NumberSeq* other_times_ms, |
ysr@777 | 530 | NumberSeq* calc_other_times_ms) const; |
ysr@777 | 531 | |
ysr@777 | 532 | void print_summary (PauseSummary* stats) const; |
ysr@777 | 533 | |
ysr@777 | 534 | void print_summary (int level, const char* str, NumberSeq* seq) const; |
ysr@777 | 535 | void print_summary_sd (int level, const char* str, NumberSeq* seq) const; |
ysr@777 | 536 | |
ysr@777 | 537 | double avg_value (double* data); |
ysr@777 | 538 | double max_value (double* data); |
ysr@777 | 539 | double sum_of_values (double* data); |
ysr@777 | 540 | double max_sum (double* data1, double* data2); |
ysr@777 | 541 | |
ysr@777 | 542 | double _last_pause_time_ms; |
ysr@777 | 543 | |
ysr@777 | 544 | size_t _bytes_in_collection_set_before_gc; |
tonyp@3028 | 545 | size_t _bytes_copied_during_gc; |
tonyp@3028 | 546 | |
ysr@777 | 547 | // Used to count used bytes in CS. |
ysr@777 | 548 | friend class CountCSClosure; |
ysr@777 | 549 | |
ysr@777 | 550 | // Statistics kept per GC stoppage, pause or full. |
ysr@777 | 551 | TruncatedSeq* _recent_prev_end_times_for_all_gcs_sec; |
ysr@777 | 552 | |
ysr@777 | 553 | // Add a new GC of the given duration and end time to the record. |
ysr@777 | 554 | void update_recent_gc_times(double end_time_sec, double elapsed_ms); |
ysr@777 | 555 | |
ysr@777 | 556 | // The head of the list (via "next_in_collection_set()") representing the |
johnc@1829 | 557 | // current collection set. Set from the incrementally built collection |
johnc@1829 | 558 | // set at the start of the pause. |
ysr@777 | 559 | HeapRegion* _collection_set; |
johnc@1829 | 560 | |
johnc@1829 | 561 | // The number of bytes in the collection set before the pause. Set from |
johnc@1829 | 562 | // the incrementally built collection set at the start of an evacuation |
johnc@1829 | 563 | // pause. |
ysr@777 | 564 | size_t _collection_set_bytes_used_before; |
ysr@777 | 565 | |
johnc@1829 | 566 | // The associated information that is maintained while the incremental |
johnc@1829 | 567 | // collection set is being built with young regions. Used to populate |
johnc@1829 | 568 | // the recorded info for the evacuation pause. |
johnc@1829 | 569 | |
johnc@1829 | 570 | enum CSetBuildType { |
johnc@1829 | 571 | Active, // We are actively building the collection set |
johnc@1829 | 572 | Inactive // We are not actively building the collection set |
johnc@1829 | 573 | }; |
johnc@1829 | 574 | |
johnc@1829 | 575 | CSetBuildType _inc_cset_build_state; |
johnc@1829 | 576 | |
johnc@1829 | 577 | // The head of the incrementally built collection set. |
johnc@1829 | 578 | HeapRegion* _inc_cset_head; |
johnc@1829 | 579 | |
johnc@1829 | 580 | // The tail of the incrementally built collection set. |
johnc@1829 | 581 | HeapRegion* _inc_cset_tail; |
johnc@1829 | 582 | |
johnc@1829 | 583 | // The number of bytes in the incrementally built collection set. |
johnc@1829 | 584 | // Used to set _collection_set_bytes_used_before at the start of |
johnc@1829 | 585 | // an evacuation pause. |
johnc@1829 | 586 | size_t _inc_cset_bytes_used_before; |
johnc@1829 | 587 | |
johnc@1829 | 588 | // Used to record the highest end of heap region in collection set |
johnc@1829 | 589 | HeapWord* _inc_cset_max_finger; |
johnc@1829 | 590 | |
tonyp@3356 | 591 | // The RSet lengths recorded for regions in the CSet. It is updated |
tonyp@3356 | 592 | // by the thread that adds a new region to the CSet. We assume that |
tonyp@3356 | 593 | // only one thread can be allocating a new CSet region (currently, |
tonyp@3356 | 594 | // it does so after taking the Heap_lock) hence no need to |
tonyp@3356 | 595 | // synchronize updates to this field. |
johnc@1829 | 596 | size_t _inc_cset_recorded_rs_lengths; |
johnc@1829 | 597 | |
tonyp@3356 | 598 | // A concurrent refinement thread periodcially samples the young |
tonyp@3356 | 599 | // region RSets and needs to update _inc_cset_recorded_rs_lengths as |
tonyp@3356 | 600 | // the RSets grow. Instead of having to syncronize updates to that |
tonyp@3356 | 601 | // field we accumulate them in this field and add it to |
tonyp@3356 | 602 | // _inc_cset_recorded_rs_lengths_diffs at the start of a GC. |
tonyp@3356 | 603 | ssize_t _inc_cset_recorded_rs_lengths_diffs; |
tonyp@3356 | 604 | |
tonyp@3356 | 605 | // The predicted elapsed time it will take to collect the regions in |
tonyp@3356 | 606 | // the CSet. This is updated by the thread that adds a new region to |
tonyp@3356 | 607 | // the CSet. See the comment for _inc_cset_recorded_rs_lengths about |
tonyp@3356 | 608 | // MT-safety assumptions. |
johnc@1829 | 609 | double _inc_cset_predicted_elapsed_time_ms; |
johnc@1829 | 610 | |
tonyp@3356 | 611 | // See the comment for _inc_cset_recorded_rs_lengths_diffs. |
tonyp@3356 | 612 | double _inc_cset_predicted_elapsed_time_ms_diffs; |
tonyp@3356 | 613 | |
ysr@777 | 614 | // Stash a pointer to the g1 heap. |
ysr@777 | 615 | G1CollectedHeap* _g1; |
ysr@777 | 616 | |
ysr@777 | 617 | // The ratio of gc time to elapsed time, computed over recent pauses. |
ysr@777 | 618 | double _recent_avg_pause_time_ratio; |
ysr@777 | 619 | |
ysr@777 | 620 | double recent_avg_pause_time_ratio() { |
ysr@777 | 621 | return _recent_avg_pause_time_ratio; |
ysr@777 | 622 | } |
ysr@777 | 623 | |
tonyp@1794 | 624 | // At the end of a pause we check the heap occupancy and we decide |
tonyp@1794 | 625 | // whether we will start a marking cycle during the next pause. If |
tonyp@1794 | 626 | // we decide that we want to do that, we will set this parameter to |
tonyp@1794 | 627 | // true. So, this parameter will stay true between the end of a |
tonyp@1794 | 628 | // pause and the beginning of a subsequent pause (not necessarily |
tonyp@1794 | 629 | // the next one, see the comments on the next field) when we decide |
tonyp@1794 | 630 | // that we will indeed start a marking cycle and do the initial-mark |
tonyp@1794 | 631 | // work. |
tonyp@1794 | 632 | volatile bool _initiate_conc_mark_if_possible; |
ysr@777 | 633 | |
tonyp@1794 | 634 | // If initiate_conc_mark_if_possible() is set at the beginning of a |
tonyp@1794 | 635 | // pause, it is a suggestion that the pause should start a marking |
tonyp@1794 | 636 | // cycle by doing the initial-mark work. However, it is possible |
tonyp@1794 | 637 | // that the concurrent marking thread is still finishing up the |
tonyp@1794 | 638 | // previous marking cycle (e.g., clearing the next marking |
tonyp@1794 | 639 | // bitmap). If that is the case we cannot start a new cycle and |
tonyp@1794 | 640 | // we'll have to wait for the concurrent marking thread to finish |
tonyp@1794 | 641 | // what it is doing. In this case we will postpone the marking cycle |
tonyp@1794 | 642 | // initiation decision for the next pause. When we eventually decide |
tonyp@1794 | 643 | // to start a cycle, we will set _during_initial_mark_pause which |
tonyp@1794 | 644 | // will stay true until the end of the initial-mark pause and it's |
tonyp@1794 | 645 | // the condition that indicates that a pause is doing the |
tonyp@1794 | 646 | // initial-mark work. |
tonyp@1794 | 647 | volatile bool _during_initial_mark_pause; |
tonyp@1794 | 648 | |
tonyp@3337 | 649 | bool _should_revert_to_young_gcs; |
tonyp@3337 | 650 | bool _last_young_gc; |
ysr@777 | 651 | |
ysr@777 | 652 | // This set of variables tracks the collector efficiency, in order to |
ysr@777 | 653 | // determine whether we should initiate a new marking. |
ysr@777 | 654 | double _cur_mark_stop_world_time_ms; |
ysr@777 | 655 | double _mark_remark_start_sec; |
ysr@777 | 656 | double _mark_cleanup_start_sec; |
ysr@777 | 657 | double _mark_closure_time_ms; |
ysr@777 | 658 | |
tonyp@3119 | 659 | // Update the young list target length either by setting it to the |
tonyp@3119 | 660 | // desired fixed value or by calculating it using G1's pause |
tonyp@3119 | 661 | // prediction model. If no rs_lengths parameter is passed, predict |
tonyp@3119 | 662 | // the RS lengths using the prediction model, otherwise use the |
tonyp@3119 | 663 | // given rs_lengths as the prediction. |
tonyp@3119 | 664 | void update_young_list_target_length(size_t rs_lengths = (size_t) -1); |
tonyp@3119 | 665 | |
tonyp@3119 | 666 | // Calculate and return the minimum desired young list target |
tonyp@3119 | 667 | // length. This is the minimum desired young list length according |
tonyp@3119 | 668 | // to the user's inputs. |
tonyp@3119 | 669 | size_t calculate_young_list_desired_min_length(size_t base_min_length); |
tonyp@3119 | 670 | |
tonyp@3119 | 671 | // Calculate and return the maximum desired young list target |
tonyp@3119 | 672 | // length. This is the maximum desired young list length according |
tonyp@3119 | 673 | // to the user's inputs. |
tonyp@3119 | 674 | size_t calculate_young_list_desired_max_length(); |
tonyp@3119 | 675 | |
tonyp@3119 | 676 | // Calculate and return the maximum young list target length that |
tonyp@3119 | 677 | // can fit into the pause time goal. The parameters are: rs_lengths |
tonyp@3119 | 678 | // represent the prediction of how large the young RSet lengths will |
tonyp@3119 | 679 | // be, base_min_length is the alreay existing number of regions in |
tonyp@3119 | 680 | // the young list, min_length and max_length are the desired min and |
tonyp@3119 | 681 | // max young list length according to the user's inputs. |
tonyp@3119 | 682 | size_t calculate_young_list_target_length(size_t rs_lengths, |
tonyp@3119 | 683 | size_t base_min_length, |
tonyp@3119 | 684 | size_t desired_min_length, |
tonyp@3119 | 685 | size_t desired_max_length); |
tonyp@3119 | 686 | |
tonyp@3119 | 687 | // Check whether a given young length (young_length) fits into the |
tonyp@3119 | 688 | // given target pause time and whether the prediction for the amount |
tonyp@3119 | 689 | // of objects to be copied for the given length will fit into the |
tonyp@3119 | 690 | // given free space (expressed by base_free_regions). It is used by |
tonyp@3119 | 691 | // calculate_young_list_target_length(). |
tonyp@3119 | 692 | bool predict_will_fit(size_t young_length, double base_time_ms, |
tonyp@3119 | 693 | size_t base_free_regions, double target_pause_time_ms); |
ysr@777 | 694 | |
tonyp@3209 | 695 | // Count the number of bytes used in the CS. |
tonyp@3209 | 696 | void count_CS_bytes_used(); |
tonyp@3209 | 697 | |
tonyp@3209 | 698 | void update_young_list_size_using_newratio(size_t number_of_heap_regions); |
tonyp@3209 | 699 | |
ysr@777 | 700 | public: |
ysr@777 | 701 | |
ysr@777 | 702 | G1CollectorPolicy(); |
ysr@777 | 703 | |
ysr@777 | 704 | virtual G1CollectorPolicy* as_g1_policy() { return this; } |
ysr@777 | 705 | |
ysr@777 | 706 | virtual CollectorPolicy::Name kind() { |
ysr@777 | 707 | return CollectorPolicy::G1CollectorPolicyKind; |
ysr@777 | 708 | } |
ysr@777 | 709 | |
tonyp@3119 | 710 | // Check the current value of the young list RSet lengths and |
tonyp@3119 | 711 | // compare it against the last prediction. If the current value is |
tonyp@3119 | 712 | // higher, recalculate the young list target length prediction. |
tonyp@3119 | 713 | void revise_young_list_target_length_if_necessary(); |
ysr@777 | 714 | |
ysr@777 | 715 | size_t bytes_in_collection_set() { |
ysr@777 | 716 | return _bytes_in_collection_set_before_gc; |
ysr@777 | 717 | } |
ysr@777 | 718 | |
ysr@777 | 719 | unsigned calc_gc_alloc_time_stamp() { |
ysr@777 | 720 | return _all_pause_times_ms->num() + 1; |
ysr@777 | 721 | } |
ysr@777 | 722 | |
brutisso@3120 | 723 | // This should be called after the heap is resized. |
brutisso@3120 | 724 | void record_new_heap_size(size_t new_number_of_regions); |
tonyp@3119 | 725 | |
ysr@777 | 726 | public: |
ysr@777 | 727 | |
tonyp@3209 | 728 | void init(); |
ysr@777 | 729 | |
apetrusenko@980 | 730 | // Create jstat counters for the policy. |
apetrusenko@980 | 731 | virtual void initialize_gc_policy_counters(); |
apetrusenko@980 | 732 | |
ysr@777 | 733 | virtual HeapWord* mem_allocate_work(size_t size, |
ysr@777 | 734 | bool is_tlab, |
ysr@777 | 735 | bool* gc_overhead_limit_was_exceeded); |
ysr@777 | 736 | |
ysr@777 | 737 | // This method controls how a collector handles one or more |
ysr@777 | 738 | // of its generations being fully allocated. |
ysr@777 | 739 | virtual HeapWord* satisfy_failed_allocation(size_t size, |
ysr@777 | 740 | bool is_tlab); |
ysr@777 | 741 | |
ysr@777 | 742 | BarrierSet::Name barrier_set_name() { return BarrierSet::G1SATBCTLogging; } |
ysr@777 | 743 | |
ysr@777 | 744 | GenRemSet::Name rem_set_name() { return GenRemSet::CardTable; } |
ysr@777 | 745 | |
ysr@777 | 746 | // Update the heuristic info to record a collection pause of the given |
ysr@777 | 747 | // start time, where the given number of bytes were used at the start. |
ysr@777 | 748 | // This may involve changing the desired size of a collection set. |
ysr@777 | 749 | |
tonyp@3209 | 750 | void record_stop_world_start(); |
ysr@777 | 751 | |
tonyp@3209 | 752 | void record_collection_pause_start(double start_time_sec, size_t start_used); |
ysr@777 | 753 | |
ysr@777 | 754 | // Must currently be called while the world is stopped. |
brutisso@3065 | 755 | void record_concurrent_mark_init_end(double |
ysr@777 | 756 | mark_init_elapsed_time_ms); |
ysr@777 | 757 | |
johnc@3296 | 758 | void record_mark_closure_time(double mark_closure_time_ms) { |
johnc@3296 | 759 | _mark_closure_time_ms = mark_closure_time_ms; |
johnc@3296 | 760 | } |
ysr@777 | 761 | |
tonyp@3209 | 762 | void record_concurrent_mark_remark_start(); |
tonyp@3209 | 763 | void record_concurrent_mark_remark_end(); |
ysr@777 | 764 | |
tonyp@3209 | 765 | void record_concurrent_mark_cleanup_start(); |
jmasa@3294 | 766 | void record_concurrent_mark_cleanup_end(int no_of_gc_threads); |
tonyp@3209 | 767 | void record_concurrent_mark_cleanup_completed(); |
ysr@777 | 768 | |
tonyp@3209 | 769 | void record_concurrent_pause(); |
tonyp@3209 | 770 | void record_concurrent_pause_end(); |
ysr@777 | 771 | |
jmasa@3294 | 772 | void record_collection_pause_end(int no_of_gc_threads); |
tonyp@2961 | 773 | void print_heap_transition(); |
ysr@777 | 774 | |
ysr@777 | 775 | // Record the fact that a full collection occurred. |
tonyp@3209 | 776 | void record_full_collection_start(); |
tonyp@3209 | 777 | void record_full_collection_end(); |
ysr@777 | 778 | |
tonyp@1966 | 779 | void record_gc_worker_start_time(int worker_i, double ms) { |
tonyp@1966 | 780 | _par_last_gc_worker_start_times_ms[worker_i] = ms; |
tonyp@1966 | 781 | } |
tonyp@1966 | 782 | |
ysr@777 | 783 | void record_ext_root_scan_time(int worker_i, double ms) { |
ysr@777 | 784 | _par_last_ext_root_scan_times_ms[worker_i] = ms; |
ysr@777 | 785 | } |
ysr@777 | 786 | |
ysr@777 | 787 | void record_mark_stack_scan_time(int worker_i, double ms) { |
ysr@777 | 788 | _par_last_mark_stack_scan_times_ms[worker_i] = ms; |
ysr@777 | 789 | } |
ysr@777 | 790 | |
ysr@777 | 791 | void record_satb_drain_time(double ms) { |
johnc@3219 | 792 | assert(_g1->mark_in_progress(), "shouldn't be here otherwise"); |
ysr@777 | 793 | _cur_satb_drain_time_ms = ms; |
ysr@777 | 794 | } |
ysr@777 | 795 | |
ysr@777 | 796 | void record_update_rs_time(int thread, double ms) { |
ysr@777 | 797 | _par_last_update_rs_times_ms[thread] = ms; |
ysr@777 | 798 | } |
ysr@777 | 799 | |
ysr@777 | 800 | void record_update_rs_processed_buffers (int thread, |
ysr@777 | 801 | double processed_buffers) { |
ysr@777 | 802 | _par_last_update_rs_processed_buffers[thread] = processed_buffers; |
ysr@777 | 803 | } |
ysr@777 | 804 | |
ysr@777 | 805 | void record_scan_rs_time(int thread, double ms) { |
ysr@777 | 806 | _par_last_scan_rs_times_ms[thread] = ms; |
ysr@777 | 807 | } |
ysr@777 | 808 | |
ysr@777 | 809 | void reset_obj_copy_time(int thread) { |
ysr@777 | 810 | _par_last_obj_copy_times_ms[thread] = 0.0; |
ysr@777 | 811 | } |
ysr@777 | 812 | |
ysr@777 | 813 | void reset_obj_copy_time() { |
ysr@777 | 814 | reset_obj_copy_time(0); |
ysr@777 | 815 | } |
ysr@777 | 816 | |
ysr@777 | 817 | void record_obj_copy_time(int thread, double ms) { |
ysr@777 | 818 | _par_last_obj_copy_times_ms[thread] += ms; |
ysr@777 | 819 | } |
ysr@777 | 820 | |
tonyp@1966 | 821 | void record_termination(int thread, double ms, size_t attempts) { |
tonyp@1966 | 822 | _par_last_termination_times_ms[thread] = ms; |
tonyp@1966 | 823 | _par_last_termination_attempts[thread] = (double) attempts; |
ysr@777 | 824 | } |
ysr@777 | 825 | |
tonyp@1966 | 826 | void record_gc_worker_end_time(int worker_i, double ms) { |
tonyp@1966 | 827 | _par_last_gc_worker_end_times_ms[worker_i] = ms; |
ysr@777 | 828 | } |
ysr@777 | 829 | |
tonyp@1030 | 830 | void record_pause_time_ms(double ms) { |
ysr@777 | 831 | _last_pause_time_ms = ms; |
ysr@777 | 832 | } |
ysr@777 | 833 | |
ysr@777 | 834 | void record_clear_ct_time(double ms) { |
ysr@777 | 835 | _cur_clear_ct_time_ms = ms; |
ysr@777 | 836 | } |
ysr@777 | 837 | |
ysr@777 | 838 | void record_par_time(double ms) { |
ysr@777 | 839 | _cur_collection_par_time_ms = ms; |
ysr@777 | 840 | } |
ysr@777 | 841 | |
ysr@777 | 842 | void record_aux_start_time(int i) { |
ysr@777 | 843 | guarantee(i < _aux_num, "should be within range"); |
ysr@777 | 844 | _cur_aux_start_times_ms[i] = os::elapsedTime() * 1000.0; |
ysr@777 | 845 | } |
ysr@777 | 846 | |
ysr@777 | 847 | void record_aux_end_time(int i) { |
ysr@777 | 848 | guarantee(i < _aux_num, "should be within range"); |
ysr@777 | 849 | double ms = os::elapsedTime() * 1000.0 - _cur_aux_start_times_ms[i]; |
ysr@777 | 850 | _cur_aux_times_set[i] = true; |
ysr@777 | 851 | _cur_aux_times_ms[i] += ms; |
ysr@777 | 852 | } |
ysr@777 | 853 | |
johnc@3175 | 854 | void record_ref_proc_time(double ms) { |
johnc@3175 | 855 | _cur_ref_proc_time_ms = ms; |
johnc@3175 | 856 | } |
johnc@3175 | 857 | |
johnc@3175 | 858 | void record_ref_enq_time(double ms) { |
johnc@3175 | 859 | _cur_ref_enq_time_ms = ms; |
johnc@3175 | 860 | } |
johnc@3175 | 861 | |
johnc@1325 | 862 | #ifndef PRODUCT |
johnc@1325 | 863 | void record_cc_clear_time(double ms) { |
johnc@1325 | 864 | if (_min_clear_cc_time_ms < 0.0 || ms <= _min_clear_cc_time_ms) |
johnc@1325 | 865 | _min_clear_cc_time_ms = ms; |
johnc@1325 | 866 | if (_max_clear_cc_time_ms < 0.0 || ms >= _max_clear_cc_time_ms) |
johnc@1325 | 867 | _max_clear_cc_time_ms = ms; |
johnc@1325 | 868 | _cur_clear_cc_time_ms = ms; |
johnc@1325 | 869 | _cum_clear_cc_time_ms += ms; |
johnc@1325 | 870 | _num_cc_clears++; |
johnc@1325 | 871 | } |
johnc@1325 | 872 | #endif |
johnc@1325 | 873 | |
tonyp@3028 | 874 | // Record how much space we copied during a GC. This is typically |
tonyp@3028 | 875 | // called when a GC alloc region is being retired. |
tonyp@3028 | 876 | void record_bytes_copied_during_gc(size_t bytes) { |
tonyp@3028 | 877 | _bytes_copied_during_gc += bytes; |
tonyp@3028 | 878 | } |
tonyp@3028 | 879 | |
tonyp@3028 | 880 | // The amount of space we copied during a GC. |
tonyp@3028 | 881 | size_t bytes_copied_during_gc() { |
tonyp@3028 | 882 | return _bytes_copied_during_gc; |
tonyp@3028 | 883 | } |
ysr@777 | 884 | |
ysr@777 | 885 | // Choose a new collection set. Marks the chosen regions as being |
ysr@777 | 886 | // "in_collection_set", and links them together. The head and number of |
ysr@777 | 887 | // the collection set are available via access methods. |
tonyp@3209 | 888 | void choose_collection_set(double target_pause_time_ms); |
ysr@777 | 889 | |
ysr@777 | 890 | // The head of the list (via "next_in_collection_set()") representing the |
ysr@777 | 891 | // current collection set. |
ysr@777 | 892 | HeapRegion* collection_set() { return _collection_set; } |
ysr@777 | 893 | |
johnc@1829 | 894 | void clear_collection_set() { _collection_set = NULL; } |
johnc@1829 | 895 | |
tonyp@3289 | 896 | // Add old region "hr" to the CSet. |
tonyp@3289 | 897 | void add_old_region_to_cset(HeapRegion* hr); |
ysr@777 | 898 | |
johnc@1829 | 899 | // Incremental CSet Support |
johnc@1829 | 900 | |
johnc@1829 | 901 | // The head of the incrementally built collection set. |
johnc@1829 | 902 | HeapRegion* inc_cset_head() { return _inc_cset_head; } |
johnc@1829 | 903 | |
johnc@1829 | 904 | // The tail of the incrementally built collection set. |
johnc@1829 | 905 | HeapRegion* inc_set_tail() { return _inc_cset_tail; } |
johnc@1829 | 906 | |
johnc@1829 | 907 | // Initialize incremental collection set info. |
johnc@1829 | 908 | void start_incremental_cset_building(); |
johnc@1829 | 909 | |
tonyp@3356 | 910 | // Perform any final calculations on the incremental CSet fields |
tonyp@3356 | 911 | // before we can use them. |
tonyp@3356 | 912 | void finalize_incremental_cset_building(); |
tonyp@3356 | 913 | |
johnc@1829 | 914 | void clear_incremental_cset() { |
johnc@1829 | 915 | _inc_cset_head = NULL; |
johnc@1829 | 916 | _inc_cset_tail = NULL; |
johnc@1829 | 917 | } |
johnc@1829 | 918 | |
johnc@1829 | 919 | // Stop adding regions to the incremental collection set |
johnc@1829 | 920 | void stop_incremental_cset_building() { _inc_cset_build_state = Inactive; } |
johnc@1829 | 921 | |
tonyp@3356 | 922 | // Add information about hr to the aggregated information for the |
tonyp@3356 | 923 | // incrementally built collection set. |
johnc@1829 | 924 | void add_to_incremental_cset_info(HeapRegion* hr, size_t rs_length); |
johnc@1829 | 925 | |
johnc@1829 | 926 | // Update information about hr in the aggregated information for |
johnc@1829 | 927 | // the incrementally built collection set. |
johnc@1829 | 928 | void update_incremental_cset_info(HeapRegion* hr, size_t new_rs_length); |
johnc@1829 | 929 | |
johnc@1829 | 930 | private: |
johnc@1829 | 931 | // Update the incremental cset information when adding a region |
johnc@1829 | 932 | // (should not be called directly). |
johnc@1829 | 933 | void add_region_to_incremental_cset_common(HeapRegion* hr); |
johnc@1829 | 934 | |
johnc@1829 | 935 | public: |
johnc@1829 | 936 | // Add hr to the LHS of the incremental collection set. |
johnc@1829 | 937 | void add_region_to_incremental_cset_lhs(HeapRegion* hr); |
johnc@1829 | 938 | |
johnc@1829 | 939 | // Add hr to the RHS of the incremental collection set. |
johnc@1829 | 940 | void add_region_to_incremental_cset_rhs(HeapRegion* hr); |
johnc@1829 | 941 | |
johnc@1829 | 942 | #ifndef PRODUCT |
johnc@1829 | 943 | void print_collection_set(HeapRegion* list_head, outputStream* st); |
johnc@1829 | 944 | #endif // !PRODUCT |
johnc@1829 | 945 | |
tonyp@1794 | 946 | bool initiate_conc_mark_if_possible() { return _initiate_conc_mark_if_possible; } |
tonyp@1794 | 947 | void set_initiate_conc_mark_if_possible() { _initiate_conc_mark_if_possible = true; } |
tonyp@1794 | 948 | void clear_initiate_conc_mark_if_possible() { _initiate_conc_mark_if_possible = false; } |
tonyp@1794 | 949 | |
tonyp@1794 | 950 | bool during_initial_mark_pause() { return _during_initial_mark_pause; } |
tonyp@1794 | 951 | void set_during_initial_mark_pause() { _during_initial_mark_pause = true; } |
tonyp@1794 | 952 | void clear_during_initial_mark_pause(){ _during_initial_mark_pause = false; } |
tonyp@1794 | 953 | |
tonyp@2011 | 954 | // This sets the initiate_conc_mark_if_possible() flag to start a |
tonyp@2011 | 955 | // new cycle, as long as we are not already in one. It's best if it |
tonyp@2011 | 956 | // is called during a safepoint when the test whether a cycle is in |
tonyp@2011 | 957 | // progress or not is stable. |
tonyp@3114 | 958 | bool force_initial_mark_if_outside_cycle(GCCause::Cause gc_cause); |
tonyp@2011 | 959 | |
tonyp@1794 | 960 | // This is called at the very beginning of an evacuation pause (it |
tonyp@1794 | 961 | // has to be the first thing that the pause does). If |
tonyp@1794 | 962 | // initiate_conc_mark_if_possible() is true, and the concurrent |
tonyp@1794 | 963 | // marking thread has completed its work during the previous cycle, |
tonyp@1794 | 964 | // it will set during_initial_mark_pause() to so that the pause does |
tonyp@1794 | 965 | // the initial-mark work and start a marking cycle. |
tonyp@1794 | 966 | void decide_on_conc_mark_initiation(); |
ysr@777 | 967 | |
ysr@777 | 968 | // If an expansion would be appropriate, because recent GC overhead had |
ysr@777 | 969 | // exceeded the desired limit, return an amount to expand by. |
tonyp@3209 | 970 | size_t expansion_amount(); |
ysr@777 | 971 | |
ysr@777 | 972 | #ifndef PRODUCT |
ysr@777 | 973 | // Check any appropriate marked bytes info, asserting false if |
ysr@777 | 974 | // something's wrong, else returning "true". |
tonyp@3209 | 975 | bool assertMarkedBytesDataOK(); |
ysr@777 | 976 | #endif |
ysr@777 | 977 | |
ysr@777 | 978 | // Print tracing information. |
ysr@777 | 979 | void print_tracing_info() const; |
ysr@777 | 980 | |
ysr@777 | 981 | // Print stats on young survival ratio |
ysr@777 | 982 | void print_yg_surv_rate_info() const; |
ysr@777 | 983 | |
apetrusenko@980 | 984 | void finished_recalculating_age_indexes(bool is_survivors) { |
apetrusenko@980 | 985 | if (is_survivors) { |
apetrusenko@980 | 986 | _survivor_surv_rate_group->finished_recalculating_age_indexes(); |
apetrusenko@980 | 987 | } else { |
apetrusenko@980 | 988 | _short_lived_surv_rate_group->finished_recalculating_age_indexes(); |
apetrusenko@980 | 989 | } |
ysr@777 | 990 | // do that for any other surv rate groups |
ysr@777 | 991 | } |
ysr@777 | 992 | |
tonyp@2315 | 993 | bool is_young_list_full() { |
tonyp@2315 | 994 | size_t young_list_length = _g1->young_list()->length(); |
tonyp@2333 | 995 | size_t young_list_target_length = _young_list_target_length; |
tonyp@2333 | 996 | return young_list_length >= young_list_target_length; |
tonyp@2333 | 997 | } |
tonyp@2333 | 998 | |
tonyp@2333 | 999 | bool can_expand_young_list() { |
tonyp@2333 | 1000 | size_t young_list_length = _g1->young_list()->length(); |
tonyp@2333 | 1001 | size_t young_list_max_length = _young_list_max_length; |
tonyp@2333 | 1002 | return young_list_length < young_list_max_length; |
tonyp@2333 | 1003 | } |
tonyp@2315 | 1004 | |
tonyp@3176 | 1005 | size_t young_list_max_length() { |
tonyp@3176 | 1006 | return _young_list_max_length; |
tonyp@3176 | 1007 | } |
tonyp@3176 | 1008 | |
tonyp@3337 | 1009 | bool gcs_are_young() { |
tonyp@3337 | 1010 | return _gcs_are_young; |
ysr@777 | 1011 | } |
tonyp@3337 | 1012 | void set_gcs_are_young(bool gcs_are_young) { |
tonyp@3337 | 1013 | _gcs_are_young = gcs_are_young; |
ysr@777 | 1014 | } |
ysr@777 | 1015 | |
ysr@777 | 1016 | bool adaptive_young_list_length() { |
ysr@777 | 1017 | return _adaptive_young_list_length; |
ysr@777 | 1018 | } |
ysr@777 | 1019 | void set_adaptive_young_list_length(bool adaptive_young_list_length) { |
ysr@777 | 1020 | _adaptive_young_list_length = adaptive_young_list_length; |
ysr@777 | 1021 | } |
ysr@777 | 1022 | |
ysr@777 | 1023 | inline double get_gc_eff_factor() { |
ysr@777 | 1024 | double ratio = _known_garbage_ratio; |
ysr@777 | 1025 | |
ysr@777 | 1026 | double square = ratio * ratio; |
ysr@777 | 1027 | // square = square * square; |
ysr@777 | 1028 | double ret = square * 9.0 + 1.0; |
ysr@777 | 1029 | #if 0 |
ysr@777 | 1030 | gclog_or_tty->print_cr("ratio = %1.2lf, ret = %1.2lf", ratio, ret); |
ysr@777 | 1031 | #endif // 0 |
ysr@777 | 1032 | guarantee(0.0 <= ret && ret < 10.0, "invariant!"); |
ysr@777 | 1033 | return ret; |
ysr@777 | 1034 | } |
ysr@777 | 1035 | |
tonyp@3209 | 1036 | private: |
ysr@777 | 1037 | // |
ysr@777 | 1038 | // Survivor regions policy. |
ysr@777 | 1039 | // |
ysr@777 | 1040 | |
ysr@777 | 1041 | // Current tenuring threshold, set to 0 if the collector reaches the |
ysr@777 | 1042 | // maximum amount of suvivors regions. |
ysr@777 | 1043 | int _tenuring_threshold; |
ysr@777 | 1044 | |
apetrusenko@980 | 1045 | // The limit on the number of regions allocated for survivors. |
apetrusenko@980 | 1046 | size_t _max_survivor_regions; |
apetrusenko@980 | 1047 | |
tonyp@2961 | 1048 | // For reporting purposes. |
tonyp@2961 | 1049 | size_t _eden_bytes_before_gc; |
tonyp@2961 | 1050 | size_t _survivor_bytes_before_gc; |
tonyp@2961 | 1051 | size_t _capacity_before_gc; |
tonyp@2961 | 1052 | |
apetrusenko@980 | 1053 | // The amount of survor regions after a collection. |
apetrusenko@980 | 1054 | size_t _recorded_survivor_regions; |
apetrusenko@980 | 1055 | // List of survivor regions. |
apetrusenko@980 | 1056 | HeapRegion* _recorded_survivor_head; |
apetrusenko@980 | 1057 | HeapRegion* _recorded_survivor_tail; |
apetrusenko@980 | 1058 | |
apetrusenko@980 | 1059 | ageTable _survivors_age_table; |
apetrusenko@980 | 1060 | |
ysr@777 | 1061 | public: |
ysr@777 | 1062 | |
ysr@777 | 1063 | inline GCAllocPurpose |
ysr@777 | 1064 | evacuation_destination(HeapRegion* src_region, int age, size_t word_sz) { |
ysr@777 | 1065 | if (age < _tenuring_threshold && src_region->is_young()) { |
ysr@777 | 1066 | return GCAllocForSurvived; |
ysr@777 | 1067 | } else { |
ysr@777 | 1068 | return GCAllocForTenured; |
ysr@777 | 1069 | } |
ysr@777 | 1070 | } |
ysr@777 | 1071 | |
ysr@777 | 1072 | inline bool track_object_age(GCAllocPurpose purpose) { |
ysr@777 | 1073 | return purpose == GCAllocForSurvived; |
ysr@777 | 1074 | } |
ysr@777 | 1075 | |
apetrusenko@980 | 1076 | static const size_t REGIONS_UNLIMITED = ~(size_t)0; |
apetrusenko@980 | 1077 | |
apetrusenko@980 | 1078 | size_t max_regions(int purpose); |
ysr@777 | 1079 | |
ysr@777 | 1080 | // The limit on regions for a particular purpose is reached. |
ysr@777 | 1081 | void note_alloc_region_limit_reached(int purpose) { |
ysr@777 | 1082 | if (purpose == GCAllocForSurvived) { |
ysr@777 | 1083 | _tenuring_threshold = 0; |
ysr@777 | 1084 | } |
ysr@777 | 1085 | } |
ysr@777 | 1086 | |
ysr@777 | 1087 | void note_start_adding_survivor_regions() { |
ysr@777 | 1088 | _survivor_surv_rate_group->start_adding_regions(); |
ysr@777 | 1089 | } |
ysr@777 | 1090 | |
ysr@777 | 1091 | void note_stop_adding_survivor_regions() { |
ysr@777 | 1092 | _survivor_surv_rate_group->stop_adding_regions(); |
ysr@777 | 1093 | } |
apetrusenko@980 | 1094 | |
apetrusenko@980 | 1095 | void record_survivor_regions(size_t regions, |
apetrusenko@980 | 1096 | HeapRegion* head, |
apetrusenko@980 | 1097 | HeapRegion* tail) { |
apetrusenko@980 | 1098 | _recorded_survivor_regions = regions; |
apetrusenko@980 | 1099 | _recorded_survivor_head = head; |
apetrusenko@980 | 1100 | _recorded_survivor_tail = tail; |
apetrusenko@980 | 1101 | } |
apetrusenko@980 | 1102 | |
tonyp@1273 | 1103 | size_t recorded_survivor_regions() { |
tonyp@1273 | 1104 | return _recorded_survivor_regions; |
tonyp@1273 | 1105 | } |
tonyp@1273 | 1106 | |
apetrusenko@980 | 1107 | void record_thread_age_table(ageTable* age_table) |
apetrusenko@980 | 1108 | { |
apetrusenko@980 | 1109 | _survivors_age_table.merge_par(age_table); |
apetrusenko@980 | 1110 | } |
apetrusenko@980 | 1111 | |
tonyp@3119 | 1112 | void update_max_gc_locker_expansion(); |
tonyp@2333 | 1113 | |
apetrusenko@980 | 1114 | // Calculates survivor space parameters. |
tonyp@3119 | 1115 | void update_survivors_policy(); |
apetrusenko@980 | 1116 | |
ysr@777 | 1117 | }; |
ysr@777 | 1118 | |
ysr@777 | 1119 | // This should move to some place more general... |
ysr@777 | 1120 | |
ysr@777 | 1121 | // If we have "n" measurements, and we've kept track of their "sum" and the |
ysr@777 | 1122 | // "sum_of_squares" of the measurements, this returns the variance of the |
ysr@777 | 1123 | // sequence. |
ysr@777 | 1124 | inline double variance(int n, double sum_of_squares, double sum) { |
ysr@777 | 1125 | double n_d = (double)n; |
ysr@777 | 1126 | double avg = sum/n_d; |
ysr@777 | 1127 | return (sum_of_squares - 2.0 * avg * sum + n_d * avg * avg) / n_d; |
ysr@777 | 1128 | } |
ysr@777 | 1129 | |
stefank@2314 | 1130 | #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTORPOLICY_HPP |