Tue, 08 Aug 2017 15:57:29 +0800
merge
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. |
aoqi@0 | 8 | * |
aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 13 | * accompanied this code). |
aoqi@0 | 14 | * |
aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 18 | * |
aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 21 | * questions. |
aoqi@0 | 22 | * |
aoqi@0 | 23 | */ |
aoqi@0 | 24 | |
aoqi@0 | 25 | #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTORPOLICY_HPP |
aoqi@0 | 26 | #define SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTORPOLICY_HPP |
aoqi@0 | 27 | |
aoqi@0 | 28 | #include "gc_implementation/g1/collectionSetChooser.hpp" |
aoqi@0 | 29 | #include "gc_implementation/g1/g1MMUTracker.hpp" |
aoqi@0 | 30 | #include "memory/collectorPolicy.hpp" |
aoqi@0 | 31 | |
aoqi@0 | 32 | // A G1CollectorPolicy makes policy decisions that determine the |
aoqi@0 | 33 | // characteristics of the collector. Examples include: |
aoqi@0 | 34 | // * choice of collection set. |
aoqi@0 | 35 | // * when to collect. |
aoqi@0 | 36 | |
aoqi@0 | 37 | class HeapRegion; |
aoqi@0 | 38 | class CollectionSetChooser; |
aoqi@0 | 39 | class G1GCPhaseTimes; |
aoqi@0 | 40 | |
aoqi@0 | 41 | // TraceGen0Time collects data on _both_ young and mixed evacuation pauses |
aoqi@0 | 42 | // (the latter may contain non-young regions - i.e. regions that are |
aoqi@0 | 43 | // technically in Gen1) while TraceGen1Time collects data about full GCs. |
aoqi@0 | 44 | class TraceGen0TimeData : public CHeapObj<mtGC> { |
aoqi@0 | 45 | private: |
aoqi@0 | 46 | unsigned _young_pause_num; |
aoqi@0 | 47 | unsigned _mixed_pause_num; |
aoqi@0 | 48 | |
aoqi@0 | 49 | NumberSeq _all_stop_world_times_ms; |
aoqi@0 | 50 | NumberSeq _all_yield_times_ms; |
aoqi@0 | 51 | |
aoqi@0 | 52 | NumberSeq _total; |
aoqi@0 | 53 | NumberSeq _other; |
aoqi@0 | 54 | NumberSeq _root_region_scan_wait; |
aoqi@0 | 55 | NumberSeq _parallel; |
aoqi@0 | 56 | NumberSeq _ext_root_scan; |
aoqi@0 | 57 | NumberSeq _satb_filtering; |
aoqi@0 | 58 | NumberSeq _update_rs; |
aoqi@0 | 59 | NumberSeq _scan_rs; |
aoqi@0 | 60 | NumberSeq _obj_copy; |
aoqi@0 | 61 | NumberSeq _termination; |
aoqi@0 | 62 | NumberSeq _parallel_other; |
aoqi@0 | 63 | NumberSeq _clear_ct; |
aoqi@0 | 64 | |
aoqi@0 | 65 | void print_summary(const char* str, const NumberSeq* seq) const; |
aoqi@0 | 66 | void print_summary_sd(const char* str, const NumberSeq* seq) const; |
aoqi@0 | 67 | |
aoqi@0 | 68 | public: |
aoqi@0 | 69 | TraceGen0TimeData() : _young_pause_num(0), _mixed_pause_num(0) {}; |
aoqi@0 | 70 | void record_start_collection(double time_to_stop_the_world_ms); |
aoqi@0 | 71 | void record_yield_time(double yield_time_ms); |
aoqi@0 | 72 | void record_end_collection(double pause_time_ms, G1GCPhaseTimes* phase_times); |
aoqi@0 | 73 | void increment_young_collection_count(); |
aoqi@0 | 74 | void increment_mixed_collection_count(); |
aoqi@0 | 75 | void print() const; |
aoqi@0 | 76 | }; |
aoqi@0 | 77 | |
aoqi@0 | 78 | class TraceGen1TimeData : public CHeapObj<mtGC> { |
aoqi@0 | 79 | private: |
aoqi@0 | 80 | NumberSeq _all_full_gc_times; |
aoqi@0 | 81 | |
aoqi@0 | 82 | public: |
aoqi@0 | 83 | void record_full_collection(double full_gc_time_ms); |
aoqi@0 | 84 | void print() const; |
aoqi@0 | 85 | }; |
aoqi@0 | 86 | |
aoqi@0 | 87 | // There are three command line options related to the young gen size: |
aoqi@0 | 88 | // NewSize, MaxNewSize and NewRatio (There is also -Xmn, but that is |
aoqi@0 | 89 | // just a short form for NewSize==MaxNewSize). G1 will use its internal |
aoqi@0 | 90 | // heuristics to calculate the actual young gen size, so these options |
aoqi@0 | 91 | // basically only limit the range within which G1 can pick a young gen |
aoqi@0 | 92 | // size. Also, these are general options taking byte sizes. G1 will |
aoqi@0 | 93 | // internally work with a number of regions instead. So, some rounding |
aoqi@0 | 94 | // will occur. |
aoqi@0 | 95 | // |
aoqi@0 | 96 | // If nothing related to the the young gen size is set on the command |
aoqi@0 | 97 | // line we should allow the young gen to be between G1NewSizePercent |
aoqi@0 | 98 | // and G1MaxNewSizePercent of the heap size. This means that every time |
aoqi@0 | 99 | // the heap size changes, the limits for the young gen size will be |
aoqi@0 | 100 | // recalculated. |
aoqi@0 | 101 | // |
aoqi@0 | 102 | // If only -XX:NewSize is set we should use the specified value as the |
aoqi@0 | 103 | // minimum size for young gen. Still using G1MaxNewSizePercent of the |
aoqi@0 | 104 | // heap as maximum. |
aoqi@0 | 105 | // |
aoqi@0 | 106 | // If only -XX:MaxNewSize is set we should use the specified value as the |
aoqi@0 | 107 | // maximum size for young gen. Still using G1NewSizePercent of the heap |
aoqi@0 | 108 | // as minimum. |
aoqi@0 | 109 | // |
aoqi@0 | 110 | // If -XX:NewSize and -XX:MaxNewSize are both specified we use these values. |
aoqi@0 | 111 | // No updates when the heap size changes. There is a special case when |
aoqi@0 | 112 | // NewSize==MaxNewSize. This is interpreted as "fixed" and will use a |
aoqi@0 | 113 | // different heuristic for calculating the collection set when we do mixed |
aoqi@0 | 114 | // collection. |
aoqi@0 | 115 | // |
aoqi@0 | 116 | // If only -XX:NewRatio is set we should use the specified ratio of the heap |
aoqi@0 | 117 | // as both min and max. This will be interpreted as "fixed" just like the |
aoqi@0 | 118 | // NewSize==MaxNewSize case above. But we will update the min and max |
aoqi@0 | 119 | // everytime the heap size changes. |
aoqi@0 | 120 | // |
aoqi@0 | 121 | // NewSize and MaxNewSize override NewRatio. So, NewRatio is ignored if it is |
aoqi@0 | 122 | // combined with either NewSize or MaxNewSize. (A warning message is printed.) |
aoqi@0 | 123 | class G1YoungGenSizer : public CHeapObj<mtGC> { |
aoqi@0 | 124 | private: |
aoqi@0 | 125 | enum SizerKind { |
aoqi@0 | 126 | SizerDefaults, |
aoqi@0 | 127 | SizerNewSizeOnly, |
aoqi@0 | 128 | SizerMaxNewSizeOnly, |
aoqi@0 | 129 | SizerMaxAndNewSize, |
aoqi@0 | 130 | SizerNewRatio |
aoqi@0 | 131 | }; |
aoqi@0 | 132 | SizerKind _sizer_kind; |
aoqi@0 | 133 | uint _min_desired_young_length; |
aoqi@0 | 134 | uint _max_desired_young_length; |
aoqi@0 | 135 | bool _adaptive_size; |
aoqi@0 | 136 | uint calculate_default_min_length(uint new_number_of_heap_regions); |
aoqi@0 | 137 | uint calculate_default_max_length(uint new_number_of_heap_regions); |
aoqi@0 | 138 | |
aoqi@0 | 139 | // Update the given values for minimum and maximum young gen length in regions |
aoqi@0 | 140 | // given the number of heap regions depending on the kind of sizing algorithm. |
aoqi@0 | 141 | void recalculate_min_max_young_length(uint number_of_heap_regions, uint* min_young_length, uint* max_young_length); |
aoqi@0 | 142 | |
aoqi@0 | 143 | public: |
aoqi@0 | 144 | G1YoungGenSizer(); |
aoqi@0 | 145 | // Calculate the maximum length of the young gen given the number of regions |
aoqi@0 | 146 | // depending on the sizing algorithm. |
aoqi@0 | 147 | uint max_young_length(uint number_of_heap_regions); |
aoqi@0 | 148 | |
aoqi@0 | 149 | void heap_size_changed(uint new_number_of_heap_regions); |
aoqi@0 | 150 | uint min_desired_young_length() { |
aoqi@0 | 151 | return _min_desired_young_length; |
aoqi@0 | 152 | } |
aoqi@0 | 153 | uint max_desired_young_length() { |
aoqi@0 | 154 | return _max_desired_young_length; |
aoqi@0 | 155 | } |
aoqi@0 | 156 | bool adaptive_young_list_length() { |
aoqi@0 | 157 | return _adaptive_size; |
aoqi@0 | 158 | } |
aoqi@0 | 159 | }; |
aoqi@0 | 160 | |
aoqi@0 | 161 | class G1CollectorPolicy: public CollectorPolicy { |
aoqi@0 | 162 | private: |
aoqi@0 | 163 | // either equal to the number of parallel threads, if ParallelGCThreads |
aoqi@0 | 164 | // has been set, or 1 otherwise |
aoqi@0 | 165 | int _parallel_gc_threads; |
aoqi@0 | 166 | |
aoqi@0 | 167 | // The number of GC threads currently active. |
aoqi@0 | 168 | uintx _no_of_gc_threads; |
aoqi@0 | 169 | |
aoqi@0 | 170 | enum SomePrivateConstants { |
aoqi@0 | 171 | NumPrevPausesForHeuristics = 10 |
aoqi@0 | 172 | }; |
aoqi@0 | 173 | |
aoqi@0 | 174 | G1MMUTracker* _mmu_tracker; |
aoqi@0 | 175 | |
aoqi@0 | 176 | void initialize_alignments(); |
aoqi@0 | 177 | void initialize_flags(); |
aoqi@0 | 178 | |
aoqi@0 | 179 | CollectionSetChooser* _collectionSetChooser; |
aoqi@0 | 180 | |
aoqi@0 | 181 | double _full_collection_start_sec; |
aoqi@0 | 182 | uint _cur_collection_pause_used_regions_at_start; |
aoqi@0 | 183 | |
aoqi@0 | 184 | // These exclude marking times. |
aoqi@0 | 185 | TruncatedSeq* _recent_gc_times_ms; |
aoqi@0 | 186 | |
aoqi@0 | 187 | TruncatedSeq* _concurrent_mark_remark_times_ms; |
aoqi@0 | 188 | TruncatedSeq* _concurrent_mark_cleanup_times_ms; |
aoqi@0 | 189 | |
aoqi@0 | 190 | TraceGen0TimeData _trace_gen0_time_data; |
aoqi@0 | 191 | TraceGen1TimeData _trace_gen1_time_data; |
aoqi@0 | 192 | |
aoqi@0 | 193 | double _stop_world_start; |
aoqi@0 | 194 | |
aoqi@0 | 195 | // indicates whether we are in young or mixed GC mode |
aoqi@0 | 196 | bool _gcs_are_young; |
aoqi@0 | 197 | |
aoqi@0 | 198 | uint _young_list_target_length; |
aoqi@0 | 199 | uint _young_list_fixed_length; |
aoqi@0 | 200 | |
aoqi@0 | 201 | // The max number of regions we can extend the eden by while the GC |
aoqi@0 | 202 | // locker is active. This should be >= _young_list_target_length; |
aoqi@0 | 203 | uint _young_list_max_length; |
aoqi@0 | 204 | |
aoqi@0 | 205 | bool _last_gc_was_young; |
aoqi@0 | 206 | |
aoqi@0 | 207 | bool _during_marking; |
aoqi@0 | 208 | bool _in_marking_window; |
aoqi@0 | 209 | bool _in_marking_window_im; |
aoqi@0 | 210 | |
aoqi@0 | 211 | SurvRateGroup* _short_lived_surv_rate_group; |
aoqi@0 | 212 | SurvRateGroup* _survivor_surv_rate_group; |
aoqi@0 | 213 | // add here any more surv rate groups |
aoqi@0 | 214 | |
aoqi@0 | 215 | double _gc_overhead_perc; |
aoqi@0 | 216 | |
aoqi@0 | 217 | double _reserve_factor; |
aoqi@0 | 218 | uint _reserve_regions; |
aoqi@0 | 219 | |
aoqi@0 | 220 | bool during_marking() { |
aoqi@0 | 221 | return _during_marking; |
aoqi@0 | 222 | } |
aoqi@0 | 223 | |
aoqi@0 | 224 | enum PredictionConstants { |
aoqi@0 | 225 | TruncatedSeqLength = 10 |
aoqi@0 | 226 | }; |
aoqi@0 | 227 | |
aoqi@0 | 228 | TruncatedSeq* _alloc_rate_ms_seq; |
aoqi@0 | 229 | double _prev_collection_pause_end_ms; |
aoqi@0 | 230 | |
aoqi@0 | 231 | TruncatedSeq* _rs_length_diff_seq; |
aoqi@0 | 232 | TruncatedSeq* _cost_per_card_ms_seq; |
aoqi@0 | 233 | TruncatedSeq* _young_cards_per_entry_ratio_seq; |
aoqi@0 | 234 | TruncatedSeq* _mixed_cards_per_entry_ratio_seq; |
aoqi@0 | 235 | TruncatedSeq* _cost_per_entry_ms_seq; |
aoqi@0 | 236 | TruncatedSeq* _mixed_cost_per_entry_ms_seq; |
aoqi@0 | 237 | TruncatedSeq* _cost_per_byte_ms_seq; |
aoqi@0 | 238 | TruncatedSeq* _constant_other_time_ms_seq; |
aoqi@0 | 239 | TruncatedSeq* _young_other_cost_per_region_ms_seq; |
aoqi@0 | 240 | TruncatedSeq* _non_young_other_cost_per_region_ms_seq; |
aoqi@0 | 241 | |
aoqi@0 | 242 | TruncatedSeq* _pending_cards_seq; |
aoqi@0 | 243 | TruncatedSeq* _rs_lengths_seq; |
aoqi@0 | 244 | |
aoqi@0 | 245 | TruncatedSeq* _cost_per_byte_ms_during_cm_seq; |
aoqi@0 | 246 | |
aoqi@0 | 247 | G1YoungGenSizer* _young_gen_sizer; |
aoqi@0 | 248 | |
aoqi@0 | 249 | uint _eden_cset_region_length; |
aoqi@0 | 250 | uint _survivor_cset_region_length; |
aoqi@0 | 251 | uint _old_cset_region_length; |
aoqi@0 | 252 | |
aoqi@0 | 253 | void init_cset_region_lengths(uint eden_cset_region_length, |
aoqi@0 | 254 | uint survivor_cset_region_length); |
aoqi@0 | 255 | |
aoqi@0 | 256 | uint eden_cset_region_length() { return _eden_cset_region_length; } |
aoqi@0 | 257 | uint survivor_cset_region_length() { return _survivor_cset_region_length; } |
aoqi@0 | 258 | uint old_cset_region_length() { return _old_cset_region_length; } |
aoqi@0 | 259 | |
aoqi@0 | 260 | uint _free_regions_at_end_of_collection; |
aoqi@0 | 261 | |
aoqi@0 | 262 | size_t _recorded_rs_lengths; |
aoqi@0 | 263 | size_t _max_rs_lengths; |
aoqi@0 | 264 | double _sigma; |
aoqi@0 | 265 | |
aoqi@0 | 266 | size_t _rs_lengths_prediction; |
aoqi@0 | 267 | |
aoqi@0 | 268 | double sigma() { return _sigma; } |
aoqi@0 | 269 | |
aoqi@0 | 270 | // A function that prevents us putting too much stock in small sample |
aoqi@0 | 271 | // sets. Returns a number between 2.0 and 1.0, depending on the number |
aoqi@0 | 272 | // of samples. 5 or more samples yields one; fewer scales linearly from |
aoqi@0 | 273 | // 2.0 at 1 sample to 1.0 at 5. |
aoqi@0 | 274 | double confidence_factor(int samples) { |
aoqi@0 | 275 | if (samples > 4) return 1.0; |
aoqi@0 | 276 | else return 1.0 + sigma() * ((double)(5 - samples))/2.0; |
aoqi@0 | 277 | } |
aoqi@0 | 278 | |
aoqi@0 | 279 | double get_new_neg_prediction(TruncatedSeq* seq) { |
aoqi@0 | 280 | return seq->davg() - sigma() * seq->dsd(); |
aoqi@0 | 281 | } |
aoqi@0 | 282 | |
aoqi@0 | 283 | #ifndef PRODUCT |
aoqi@0 | 284 | bool verify_young_ages(HeapRegion* head, SurvRateGroup *surv_rate_group); |
aoqi@0 | 285 | #endif // PRODUCT |
aoqi@0 | 286 | |
aoqi@0 | 287 | void adjust_concurrent_refinement(double update_rs_time, |
aoqi@0 | 288 | double update_rs_processed_buffers, |
aoqi@0 | 289 | double goal_ms); |
aoqi@0 | 290 | |
aoqi@0 | 291 | uintx no_of_gc_threads() { return _no_of_gc_threads; } |
aoqi@0 | 292 | void set_no_of_gc_threads(uintx v) { _no_of_gc_threads = v; } |
aoqi@0 | 293 | |
aoqi@0 | 294 | double _pause_time_target_ms; |
aoqi@0 | 295 | |
aoqi@0 | 296 | size_t _pending_cards; |
aoqi@0 | 297 | |
aoqi@0 | 298 | public: |
aoqi@0 | 299 | // Accessors |
aoqi@0 | 300 | |
aoqi@0 | 301 | void set_region_eden(HeapRegion* hr, int young_index_in_cset) { |
aoqi@0 | 302 | hr->set_young(); |
aoqi@0 | 303 | hr->install_surv_rate_group(_short_lived_surv_rate_group); |
aoqi@0 | 304 | hr->set_young_index_in_cset(young_index_in_cset); |
aoqi@0 | 305 | } |
aoqi@0 | 306 | |
aoqi@0 | 307 | void set_region_survivor(HeapRegion* hr, int young_index_in_cset) { |
aoqi@0 | 308 | assert(hr->is_young() && hr->is_survivor(), "pre-condition"); |
aoqi@0 | 309 | hr->install_surv_rate_group(_survivor_surv_rate_group); |
aoqi@0 | 310 | hr->set_young_index_in_cset(young_index_in_cset); |
aoqi@0 | 311 | } |
aoqi@0 | 312 | |
aoqi@0 | 313 | #ifndef PRODUCT |
aoqi@0 | 314 | bool verify_young_ages(); |
aoqi@0 | 315 | #endif // PRODUCT |
aoqi@0 | 316 | |
aoqi@0 | 317 | double get_new_prediction(TruncatedSeq* seq) { |
aoqi@0 | 318 | return MAX2(seq->davg() + sigma() * seq->dsd(), |
aoqi@0 | 319 | seq->davg() * confidence_factor(seq->num())); |
aoqi@0 | 320 | } |
aoqi@0 | 321 | |
aoqi@0 | 322 | void record_max_rs_lengths(size_t rs_lengths) { |
aoqi@0 | 323 | _max_rs_lengths = rs_lengths; |
aoqi@0 | 324 | } |
aoqi@0 | 325 | |
aoqi@0 | 326 | size_t predict_rs_length_diff() { |
aoqi@0 | 327 | return (size_t) get_new_prediction(_rs_length_diff_seq); |
aoqi@0 | 328 | } |
aoqi@0 | 329 | |
aoqi@0 | 330 | double predict_alloc_rate_ms() { |
aoqi@0 | 331 | return get_new_prediction(_alloc_rate_ms_seq); |
aoqi@0 | 332 | } |
aoqi@0 | 333 | |
aoqi@0 | 334 | double predict_cost_per_card_ms() { |
aoqi@0 | 335 | return get_new_prediction(_cost_per_card_ms_seq); |
aoqi@0 | 336 | } |
aoqi@0 | 337 | |
aoqi@0 | 338 | double predict_rs_update_time_ms(size_t pending_cards) { |
aoqi@0 | 339 | return (double) pending_cards * predict_cost_per_card_ms(); |
aoqi@0 | 340 | } |
aoqi@0 | 341 | |
aoqi@0 | 342 | double predict_young_cards_per_entry_ratio() { |
aoqi@0 | 343 | return get_new_prediction(_young_cards_per_entry_ratio_seq); |
aoqi@0 | 344 | } |
aoqi@0 | 345 | |
aoqi@0 | 346 | double predict_mixed_cards_per_entry_ratio() { |
aoqi@0 | 347 | if (_mixed_cards_per_entry_ratio_seq->num() < 2) { |
aoqi@0 | 348 | return predict_young_cards_per_entry_ratio(); |
aoqi@0 | 349 | } else { |
aoqi@0 | 350 | return get_new_prediction(_mixed_cards_per_entry_ratio_seq); |
aoqi@0 | 351 | } |
aoqi@0 | 352 | } |
aoqi@0 | 353 | |
aoqi@0 | 354 | size_t predict_young_card_num(size_t rs_length) { |
aoqi@0 | 355 | return (size_t) ((double) rs_length * |
aoqi@0 | 356 | predict_young_cards_per_entry_ratio()); |
aoqi@0 | 357 | } |
aoqi@0 | 358 | |
aoqi@0 | 359 | size_t predict_non_young_card_num(size_t rs_length) { |
aoqi@0 | 360 | return (size_t) ((double) rs_length * |
aoqi@0 | 361 | predict_mixed_cards_per_entry_ratio()); |
aoqi@0 | 362 | } |
aoqi@0 | 363 | |
aoqi@0 | 364 | double predict_rs_scan_time_ms(size_t card_num) { |
aoqi@0 | 365 | if (gcs_are_young()) { |
aoqi@0 | 366 | return (double) card_num * get_new_prediction(_cost_per_entry_ms_seq); |
aoqi@0 | 367 | } else { |
aoqi@0 | 368 | return predict_mixed_rs_scan_time_ms(card_num); |
aoqi@0 | 369 | } |
aoqi@0 | 370 | } |
aoqi@0 | 371 | |
aoqi@0 | 372 | double predict_mixed_rs_scan_time_ms(size_t card_num) { |
aoqi@0 | 373 | if (_mixed_cost_per_entry_ms_seq->num() < 3) { |
aoqi@0 | 374 | return (double) card_num * get_new_prediction(_cost_per_entry_ms_seq); |
aoqi@0 | 375 | } else { |
aoqi@0 | 376 | return (double) (card_num * |
aoqi@0 | 377 | get_new_prediction(_mixed_cost_per_entry_ms_seq)); |
aoqi@0 | 378 | } |
aoqi@0 | 379 | } |
aoqi@0 | 380 | |
aoqi@0 | 381 | double predict_object_copy_time_ms_during_cm(size_t bytes_to_copy) { |
aoqi@0 | 382 | if (_cost_per_byte_ms_during_cm_seq->num() < 3) { |
aoqi@0 | 383 | return (1.1 * (double) bytes_to_copy) * |
aoqi@0 | 384 | get_new_prediction(_cost_per_byte_ms_seq); |
aoqi@0 | 385 | } else { |
aoqi@0 | 386 | return (double) bytes_to_copy * |
aoqi@0 | 387 | get_new_prediction(_cost_per_byte_ms_during_cm_seq); |
aoqi@0 | 388 | } |
aoqi@0 | 389 | } |
aoqi@0 | 390 | |
aoqi@0 | 391 | double predict_object_copy_time_ms(size_t bytes_to_copy) { |
aoqi@0 | 392 | if (_in_marking_window && !_in_marking_window_im) { |
aoqi@0 | 393 | return predict_object_copy_time_ms_during_cm(bytes_to_copy); |
aoqi@0 | 394 | } else { |
aoqi@0 | 395 | return (double) bytes_to_copy * |
aoqi@0 | 396 | get_new_prediction(_cost_per_byte_ms_seq); |
aoqi@0 | 397 | } |
aoqi@0 | 398 | } |
aoqi@0 | 399 | |
aoqi@0 | 400 | double predict_constant_other_time_ms() { |
aoqi@0 | 401 | return get_new_prediction(_constant_other_time_ms_seq); |
aoqi@0 | 402 | } |
aoqi@0 | 403 | |
aoqi@0 | 404 | double predict_young_other_time_ms(size_t young_num) { |
aoqi@0 | 405 | return (double) young_num * |
aoqi@0 | 406 | get_new_prediction(_young_other_cost_per_region_ms_seq); |
aoqi@0 | 407 | } |
aoqi@0 | 408 | |
aoqi@0 | 409 | double predict_non_young_other_time_ms(size_t non_young_num) { |
aoqi@0 | 410 | return (double) non_young_num * |
aoqi@0 | 411 | get_new_prediction(_non_young_other_cost_per_region_ms_seq); |
aoqi@0 | 412 | } |
aoqi@0 | 413 | |
aoqi@0 | 414 | double predict_base_elapsed_time_ms(size_t pending_cards); |
aoqi@0 | 415 | double predict_base_elapsed_time_ms(size_t pending_cards, |
aoqi@0 | 416 | size_t scanned_cards); |
aoqi@0 | 417 | size_t predict_bytes_to_copy(HeapRegion* hr); |
aoqi@0 | 418 | double predict_region_elapsed_time_ms(HeapRegion* hr, bool for_young_gc); |
aoqi@0 | 419 | |
aoqi@0 | 420 | void set_recorded_rs_lengths(size_t rs_lengths); |
aoqi@0 | 421 | |
aoqi@0 | 422 | uint cset_region_length() { return young_cset_region_length() + |
aoqi@0 | 423 | old_cset_region_length(); } |
aoqi@0 | 424 | uint young_cset_region_length() { return eden_cset_region_length() + |
aoqi@0 | 425 | survivor_cset_region_length(); } |
aoqi@0 | 426 | |
aoqi@0 | 427 | double predict_survivor_regions_evac_time(); |
aoqi@0 | 428 | |
aoqi@0 | 429 | void cset_regions_freed() { |
aoqi@0 | 430 | bool propagate = _last_gc_was_young && !_in_marking_window; |
aoqi@0 | 431 | _short_lived_surv_rate_group->all_surviving_words_recorded(propagate); |
aoqi@0 | 432 | _survivor_surv_rate_group->all_surviving_words_recorded(propagate); |
aoqi@0 | 433 | // also call it on any more surv rate groups |
aoqi@0 | 434 | } |
aoqi@0 | 435 | |
aoqi@0 | 436 | G1MMUTracker* mmu_tracker() { |
aoqi@0 | 437 | return _mmu_tracker; |
aoqi@0 | 438 | } |
aoqi@0 | 439 | |
aoqi@0 | 440 | double max_pause_time_ms() { |
aoqi@0 | 441 | return _mmu_tracker->max_gc_time() * 1000.0; |
aoqi@0 | 442 | } |
aoqi@0 | 443 | |
aoqi@0 | 444 | double predict_remark_time_ms() { |
aoqi@0 | 445 | return get_new_prediction(_concurrent_mark_remark_times_ms); |
aoqi@0 | 446 | } |
aoqi@0 | 447 | |
aoqi@0 | 448 | double predict_cleanup_time_ms() { |
aoqi@0 | 449 | return get_new_prediction(_concurrent_mark_cleanup_times_ms); |
aoqi@0 | 450 | } |
aoqi@0 | 451 | |
aoqi@0 | 452 | // Returns an estimate of the survival rate of the region at yg-age |
aoqi@0 | 453 | // "yg_age". |
aoqi@0 | 454 | double predict_yg_surv_rate(int age, SurvRateGroup* surv_rate_group) { |
aoqi@0 | 455 | TruncatedSeq* seq = surv_rate_group->get_seq(age); |
aoqi@0 | 456 | if (seq->num() == 0) |
aoqi@0 | 457 | gclog_or_tty->print("BARF! age is %d", age); |
aoqi@0 | 458 | guarantee( seq->num() > 0, "invariant" ); |
aoqi@0 | 459 | double pred = get_new_prediction(seq); |
aoqi@0 | 460 | if (pred > 1.0) |
aoqi@0 | 461 | pred = 1.0; |
aoqi@0 | 462 | return pred; |
aoqi@0 | 463 | } |
aoqi@0 | 464 | |
aoqi@0 | 465 | double predict_yg_surv_rate(int age) { |
aoqi@0 | 466 | return predict_yg_surv_rate(age, _short_lived_surv_rate_group); |
aoqi@0 | 467 | } |
aoqi@0 | 468 | |
aoqi@0 | 469 | double accum_yg_surv_rate_pred(int age) { |
aoqi@0 | 470 | return _short_lived_surv_rate_group->accum_surv_rate_pred(age); |
aoqi@0 | 471 | } |
aoqi@0 | 472 | |
aoqi@0 | 473 | private: |
aoqi@0 | 474 | // Statistics kept per GC stoppage, pause or full. |
aoqi@0 | 475 | TruncatedSeq* _recent_prev_end_times_for_all_gcs_sec; |
aoqi@0 | 476 | |
aoqi@0 | 477 | // Add a new GC of the given duration and end time to the record. |
aoqi@0 | 478 | void update_recent_gc_times(double end_time_sec, double elapsed_ms); |
aoqi@0 | 479 | |
aoqi@0 | 480 | // The head of the list (via "next_in_collection_set()") representing the |
aoqi@0 | 481 | // current collection set. Set from the incrementally built collection |
aoqi@0 | 482 | // set at the start of the pause. |
aoqi@0 | 483 | HeapRegion* _collection_set; |
aoqi@0 | 484 | |
aoqi@0 | 485 | // The number of bytes in the collection set before the pause. Set from |
aoqi@0 | 486 | // the incrementally built collection set at the start of an evacuation |
aoqi@0 | 487 | // pause, and incremented in finalize_cset() when adding old regions |
aoqi@0 | 488 | // (if any) to the collection set. |
aoqi@0 | 489 | size_t _collection_set_bytes_used_before; |
aoqi@0 | 490 | |
aoqi@0 | 491 | // The number of bytes copied during the GC. |
aoqi@0 | 492 | size_t _bytes_copied_during_gc; |
aoqi@0 | 493 | |
aoqi@0 | 494 | // The associated information that is maintained while the incremental |
aoqi@0 | 495 | // collection set is being built with young regions. Used to populate |
aoqi@0 | 496 | // the recorded info for the evacuation pause. |
aoqi@0 | 497 | |
aoqi@0 | 498 | enum CSetBuildType { |
aoqi@0 | 499 | Active, // We are actively building the collection set |
aoqi@0 | 500 | Inactive // We are not actively building the collection set |
aoqi@0 | 501 | }; |
aoqi@0 | 502 | |
aoqi@0 | 503 | CSetBuildType _inc_cset_build_state; |
aoqi@0 | 504 | |
aoqi@0 | 505 | // The head of the incrementally built collection set. |
aoqi@0 | 506 | HeapRegion* _inc_cset_head; |
aoqi@0 | 507 | |
aoqi@0 | 508 | // The tail of the incrementally built collection set. |
aoqi@0 | 509 | HeapRegion* _inc_cset_tail; |
aoqi@0 | 510 | |
aoqi@0 | 511 | // The number of bytes in the incrementally built collection set. |
aoqi@0 | 512 | // Used to set _collection_set_bytes_used_before at the start of |
aoqi@0 | 513 | // an evacuation pause. |
aoqi@0 | 514 | size_t _inc_cset_bytes_used_before; |
aoqi@0 | 515 | |
aoqi@0 | 516 | // Used to record the highest end of heap region in collection set |
aoqi@0 | 517 | HeapWord* _inc_cset_max_finger; |
aoqi@0 | 518 | |
aoqi@0 | 519 | // The RSet lengths recorded for regions in the CSet. It is updated |
aoqi@0 | 520 | // by the thread that adds a new region to the CSet. We assume that |
aoqi@0 | 521 | // only one thread can be allocating a new CSet region (currently, |
aoqi@0 | 522 | // it does so after taking the Heap_lock) hence no need to |
aoqi@0 | 523 | // synchronize updates to this field. |
aoqi@0 | 524 | size_t _inc_cset_recorded_rs_lengths; |
aoqi@0 | 525 | |
aoqi@0 | 526 | // A concurrent refinement thread periodcially samples the young |
aoqi@0 | 527 | // region RSets and needs to update _inc_cset_recorded_rs_lengths as |
aoqi@0 | 528 | // the RSets grow. Instead of having to syncronize updates to that |
aoqi@0 | 529 | // field we accumulate them in this field and add it to |
aoqi@0 | 530 | // _inc_cset_recorded_rs_lengths_diffs at the start of a GC. |
aoqi@0 | 531 | ssize_t _inc_cset_recorded_rs_lengths_diffs; |
aoqi@0 | 532 | |
aoqi@0 | 533 | // The predicted elapsed time it will take to collect the regions in |
aoqi@0 | 534 | // the CSet. This is updated by the thread that adds a new region to |
aoqi@0 | 535 | // the CSet. See the comment for _inc_cset_recorded_rs_lengths about |
aoqi@0 | 536 | // MT-safety assumptions. |
aoqi@0 | 537 | double _inc_cset_predicted_elapsed_time_ms; |
aoqi@0 | 538 | |
aoqi@0 | 539 | // See the comment for _inc_cset_recorded_rs_lengths_diffs. |
aoqi@0 | 540 | double _inc_cset_predicted_elapsed_time_ms_diffs; |
aoqi@0 | 541 | |
aoqi@0 | 542 | // Stash a pointer to the g1 heap. |
aoqi@0 | 543 | G1CollectedHeap* _g1; |
aoqi@0 | 544 | |
aoqi@0 | 545 | G1GCPhaseTimes* _phase_times; |
aoqi@0 | 546 | |
aoqi@0 | 547 | // The ratio of gc time to elapsed time, computed over recent pauses. |
aoqi@0 | 548 | double _recent_avg_pause_time_ratio; |
aoqi@0 | 549 | |
aoqi@0 | 550 | double recent_avg_pause_time_ratio() { |
aoqi@0 | 551 | return _recent_avg_pause_time_ratio; |
aoqi@0 | 552 | } |
aoqi@0 | 553 | |
aoqi@0 | 554 | // At the end of a pause we check the heap occupancy and we decide |
aoqi@0 | 555 | // whether we will start a marking cycle during the next pause. If |
aoqi@0 | 556 | // we decide that we want to do that, we will set this parameter to |
aoqi@0 | 557 | // true. So, this parameter will stay true between the end of a |
aoqi@0 | 558 | // pause and the beginning of a subsequent pause (not necessarily |
aoqi@0 | 559 | // the next one, see the comments on the next field) when we decide |
aoqi@0 | 560 | // that we will indeed start a marking cycle and do the initial-mark |
aoqi@0 | 561 | // work. |
aoqi@0 | 562 | volatile bool _initiate_conc_mark_if_possible; |
aoqi@0 | 563 | |
aoqi@0 | 564 | // If initiate_conc_mark_if_possible() is set at the beginning of a |
aoqi@0 | 565 | // pause, it is a suggestion that the pause should start a marking |
aoqi@0 | 566 | // cycle by doing the initial-mark work. However, it is possible |
aoqi@0 | 567 | // that the concurrent marking thread is still finishing up the |
aoqi@0 | 568 | // previous marking cycle (e.g., clearing the next marking |
aoqi@0 | 569 | // bitmap). If that is the case we cannot start a new cycle and |
aoqi@0 | 570 | // we'll have to wait for the concurrent marking thread to finish |
aoqi@0 | 571 | // what it is doing. In this case we will postpone the marking cycle |
aoqi@0 | 572 | // initiation decision for the next pause. When we eventually decide |
aoqi@0 | 573 | // to start a cycle, we will set _during_initial_mark_pause which |
aoqi@0 | 574 | // will stay true until the end of the initial-mark pause and it's |
aoqi@0 | 575 | // the condition that indicates that a pause is doing the |
aoqi@0 | 576 | // initial-mark work. |
aoqi@0 | 577 | volatile bool _during_initial_mark_pause; |
aoqi@0 | 578 | |
aoqi@0 | 579 | bool _last_young_gc; |
aoqi@0 | 580 | |
aoqi@0 | 581 | // This set of variables tracks the collector efficiency, in order to |
aoqi@0 | 582 | // determine whether we should initiate a new marking. |
aoqi@0 | 583 | double _cur_mark_stop_world_time_ms; |
aoqi@0 | 584 | double _mark_remark_start_sec; |
aoqi@0 | 585 | double _mark_cleanup_start_sec; |
aoqi@0 | 586 | |
aoqi@0 | 587 | // Update the young list target length either by setting it to the |
aoqi@0 | 588 | // desired fixed value or by calculating it using G1's pause |
aoqi@0 | 589 | // prediction model. If no rs_lengths parameter is passed, predict |
aoqi@0 | 590 | // the RS lengths using the prediction model, otherwise use the |
aoqi@0 | 591 | // given rs_lengths as the prediction. |
aoqi@0 | 592 | void update_young_list_target_length(size_t rs_lengths = (size_t) -1); |
aoqi@0 | 593 | |
aoqi@0 | 594 | // Calculate and return the minimum desired young list target |
aoqi@0 | 595 | // length. This is the minimum desired young list length according |
aoqi@0 | 596 | // to the user's inputs. |
aoqi@0 | 597 | uint calculate_young_list_desired_min_length(uint base_min_length); |
aoqi@0 | 598 | |
aoqi@0 | 599 | // Calculate and return the maximum desired young list target |
aoqi@0 | 600 | // length. This is the maximum desired young list length according |
aoqi@0 | 601 | // to the user's inputs. |
aoqi@0 | 602 | uint calculate_young_list_desired_max_length(); |
aoqi@0 | 603 | |
aoqi@0 | 604 | // Calculate and return the maximum young list target length that |
aoqi@0 | 605 | // can fit into the pause time goal. The parameters are: rs_lengths |
aoqi@0 | 606 | // represent the prediction of how large the young RSet lengths will |
aoqi@0 | 607 | // be, base_min_length is the alreay existing number of regions in |
aoqi@0 | 608 | // the young list, min_length and max_length are the desired min and |
aoqi@0 | 609 | // max young list length according to the user's inputs. |
aoqi@0 | 610 | uint calculate_young_list_target_length(size_t rs_lengths, |
aoqi@0 | 611 | uint base_min_length, |
aoqi@0 | 612 | uint desired_min_length, |
aoqi@0 | 613 | uint desired_max_length); |
aoqi@0 | 614 | |
aoqi@0 | 615 | // Check whether a given young length (young_length) fits into the |
aoqi@0 | 616 | // given target pause time and whether the prediction for the amount |
aoqi@0 | 617 | // of objects to be copied for the given length will fit into the |
aoqi@0 | 618 | // given free space (expressed by base_free_regions). It is used by |
aoqi@0 | 619 | // calculate_young_list_target_length(). |
aoqi@0 | 620 | bool predict_will_fit(uint young_length, double base_time_ms, |
aoqi@0 | 621 | uint base_free_regions, double target_pause_time_ms); |
aoqi@0 | 622 | |
aoqi@0 | 623 | // Calculate the minimum number of old regions we'll add to the CSet |
aoqi@0 | 624 | // during a mixed GC. |
aoqi@0 | 625 | uint calc_min_old_cset_length(); |
aoqi@0 | 626 | |
aoqi@0 | 627 | // Calculate the maximum number of old regions we'll add to the CSet |
aoqi@0 | 628 | // during a mixed GC. |
aoqi@0 | 629 | uint calc_max_old_cset_length(); |
aoqi@0 | 630 | |
aoqi@0 | 631 | // Returns the given amount of uncollected reclaimable space |
aoqi@0 | 632 | // as a percentage of the current heap capacity. |
aoqi@0 | 633 | double reclaimable_bytes_perc(size_t reclaimable_bytes); |
aoqi@0 | 634 | |
aoqi@0 | 635 | public: |
aoqi@0 | 636 | |
aoqi@0 | 637 | G1CollectorPolicy(); |
aoqi@0 | 638 | |
aoqi@0 | 639 | virtual G1CollectorPolicy* as_g1_policy() { return this; } |
aoqi@0 | 640 | |
aoqi@0 | 641 | virtual CollectorPolicy::Name kind() { |
aoqi@0 | 642 | return CollectorPolicy::G1CollectorPolicyKind; |
aoqi@0 | 643 | } |
aoqi@0 | 644 | |
aoqi@0 | 645 | G1GCPhaseTimes* phase_times() const { return _phase_times; } |
aoqi@0 | 646 | |
aoqi@0 | 647 | // Check the current value of the young list RSet lengths and |
aoqi@0 | 648 | // compare it against the last prediction. If the current value is |
aoqi@0 | 649 | // higher, recalculate the young list target length prediction. |
aoqi@0 | 650 | void revise_young_list_target_length_if_necessary(); |
aoqi@0 | 651 | |
aoqi@0 | 652 | // This should be called after the heap is resized. |
aoqi@0 | 653 | void record_new_heap_size(uint new_number_of_regions); |
aoqi@0 | 654 | |
aoqi@0 | 655 | void init(); |
aoqi@0 | 656 | |
aoqi@0 | 657 | // Create jstat counters for the policy. |
aoqi@0 | 658 | virtual void initialize_gc_policy_counters(); |
aoqi@0 | 659 | |
aoqi@0 | 660 | virtual HeapWord* mem_allocate_work(size_t size, |
aoqi@0 | 661 | bool is_tlab, |
aoqi@0 | 662 | bool* gc_overhead_limit_was_exceeded); |
aoqi@0 | 663 | |
aoqi@0 | 664 | // This method controls how a collector handles one or more |
aoqi@0 | 665 | // of its generations being fully allocated. |
aoqi@0 | 666 | virtual HeapWord* satisfy_failed_allocation(size_t size, |
aoqi@0 | 667 | bool is_tlab); |
aoqi@0 | 668 | |
aoqi@0 | 669 | BarrierSet::Name barrier_set_name() { return BarrierSet::G1SATBCTLogging; } |
aoqi@0 | 670 | |
aoqi@0 | 671 | bool need_to_start_conc_mark(const char* source, size_t alloc_word_size = 0); |
aoqi@0 | 672 | |
aoqi@0 | 673 | // Record the start and end of an evacuation pause. |
aoqi@0 | 674 | void record_collection_pause_start(double start_time_sec); |
aoqi@0 | 675 | void record_collection_pause_end(double pause_time_ms, EvacuationInfo& evacuation_info); |
aoqi@0 | 676 | |
aoqi@0 | 677 | // Record the start and end of a full collection. |
aoqi@0 | 678 | void record_full_collection_start(); |
aoqi@0 | 679 | void record_full_collection_end(); |
aoqi@0 | 680 | |
aoqi@0 | 681 | // Must currently be called while the world is stopped. |
aoqi@0 | 682 | void record_concurrent_mark_init_end(double mark_init_elapsed_time_ms); |
aoqi@0 | 683 | |
aoqi@0 | 684 | // Record start and end of remark. |
aoqi@0 | 685 | void record_concurrent_mark_remark_start(); |
aoqi@0 | 686 | void record_concurrent_mark_remark_end(); |
aoqi@0 | 687 | |
aoqi@0 | 688 | // Record start, end, and completion of cleanup. |
aoqi@0 | 689 | void record_concurrent_mark_cleanup_start(); |
aoqi@0 | 690 | void record_concurrent_mark_cleanup_end(int no_of_gc_threads); |
aoqi@0 | 691 | void record_concurrent_mark_cleanup_completed(); |
aoqi@0 | 692 | |
aoqi@0 | 693 | // Records the information about the heap size for reporting in |
aoqi@0 | 694 | // print_detailed_heap_transition |
aoqi@0 | 695 | void record_heap_size_info_at_start(bool full); |
aoqi@0 | 696 | |
aoqi@0 | 697 | // Print heap sizing transition (with less and more detail). |
aoqi@0 | 698 | void print_heap_transition(); |
aoqi@0 | 699 | void print_detailed_heap_transition(bool full = false); |
aoqi@0 | 700 | |
aoqi@0 | 701 | void record_stop_world_start(); |
aoqi@0 | 702 | void record_concurrent_pause(); |
aoqi@0 | 703 | |
aoqi@0 | 704 | // Record how much space we copied during a GC. This is typically |
aoqi@0 | 705 | // called when a GC alloc region is being retired. |
aoqi@0 | 706 | void record_bytes_copied_during_gc(size_t bytes) { |
aoqi@0 | 707 | _bytes_copied_during_gc += bytes; |
aoqi@0 | 708 | } |
aoqi@0 | 709 | |
aoqi@0 | 710 | // The amount of space we copied during a GC. |
aoqi@0 | 711 | size_t bytes_copied_during_gc() { |
aoqi@0 | 712 | return _bytes_copied_during_gc; |
aoqi@0 | 713 | } |
aoqi@0 | 714 | |
aoqi@0 | 715 | // Determine whether there are candidate regions so that the |
aoqi@0 | 716 | // next GC should be mixed. The two action strings are used |
aoqi@0 | 717 | // in the ergo output when the method returns true or false. |
aoqi@0 | 718 | bool next_gc_should_be_mixed(const char* true_action_str, |
aoqi@0 | 719 | const char* false_action_str); |
aoqi@0 | 720 | |
aoqi@0 | 721 | // Choose a new collection set. Marks the chosen regions as being |
aoqi@0 | 722 | // "in_collection_set", and links them together. The head and number of |
aoqi@0 | 723 | // the collection set are available via access methods. |
aoqi@0 | 724 | void finalize_cset(double target_pause_time_ms, EvacuationInfo& evacuation_info); |
aoqi@0 | 725 | |
aoqi@0 | 726 | // The head of the list (via "next_in_collection_set()") representing the |
aoqi@0 | 727 | // current collection set. |
aoqi@0 | 728 | HeapRegion* collection_set() { return _collection_set; } |
aoqi@0 | 729 | |
aoqi@0 | 730 | void clear_collection_set() { _collection_set = NULL; } |
aoqi@0 | 731 | |
aoqi@0 | 732 | // Add old region "hr" to the CSet. |
aoqi@0 | 733 | void add_old_region_to_cset(HeapRegion* hr); |
aoqi@0 | 734 | |
aoqi@0 | 735 | // Incremental CSet Support |
aoqi@0 | 736 | |
aoqi@0 | 737 | // The head of the incrementally built collection set. |
aoqi@0 | 738 | HeapRegion* inc_cset_head() { return _inc_cset_head; } |
aoqi@0 | 739 | |
aoqi@0 | 740 | // The tail of the incrementally built collection set. |
aoqi@0 | 741 | HeapRegion* inc_set_tail() { return _inc_cset_tail; } |
aoqi@0 | 742 | |
aoqi@0 | 743 | // Initialize incremental collection set info. |
aoqi@0 | 744 | void start_incremental_cset_building(); |
aoqi@0 | 745 | |
aoqi@0 | 746 | // Perform any final calculations on the incremental CSet fields |
aoqi@0 | 747 | // before we can use them. |
aoqi@0 | 748 | void finalize_incremental_cset_building(); |
aoqi@0 | 749 | |
aoqi@0 | 750 | void clear_incremental_cset() { |
aoqi@0 | 751 | _inc_cset_head = NULL; |
aoqi@0 | 752 | _inc_cset_tail = NULL; |
aoqi@0 | 753 | } |
aoqi@0 | 754 | |
aoqi@0 | 755 | // Stop adding regions to the incremental collection set |
aoqi@0 | 756 | void stop_incremental_cset_building() { _inc_cset_build_state = Inactive; } |
aoqi@0 | 757 | |
aoqi@0 | 758 | // Add information about hr to the aggregated information for the |
aoqi@0 | 759 | // incrementally built collection set. |
aoqi@0 | 760 | void add_to_incremental_cset_info(HeapRegion* hr, size_t rs_length); |
aoqi@0 | 761 | |
aoqi@0 | 762 | // Update information about hr in the aggregated information for |
aoqi@0 | 763 | // the incrementally built collection set. |
aoqi@0 | 764 | void update_incremental_cset_info(HeapRegion* hr, size_t new_rs_length); |
aoqi@0 | 765 | |
aoqi@0 | 766 | private: |
aoqi@0 | 767 | // Update the incremental cset information when adding a region |
aoqi@0 | 768 | // (should not be called directly). |
aoqi@0 | 769 | void add_region_to_incremental_cset_common(HeapRegion* hr); |
aoqi@0 | 770 | |
aoqi@0 | 771 | public: |
aoqi@0 | 772 | // Add hr to the LHS of the incremental collection set. |
aoqi@0 | 773 | void add_region_to_incremental_cset_lhs(HeapRegion* hr); |
aoqi@0 | 774 | |
aoqi@0 | 775 | // Add hr to the RHS of the incremental collection set. |
aoqi@0 | 776 | void add_region_to_incremental_cset_rhs(HeapRegion* hr); |
aoqi@0 | 777 | |
aoqi@0 | 778 | #ifndef PRODUCT |
aoqi@0 | 779 | void print_collection_set(HeapRegion* list_head, outputStream* st); |
aoqi@0 | 780 | #endif // !PRODUCT |
aoqi@0 | 781 | |
aoqi@0 | 782 | bool initiate_conc_mark_if_possible() { return _initiate_conc_mark_if_possible; } |
aoqi@0 | 783 | void set_initiate_conc_mark_if_possible() { _initiate_conc_mark_if_possible = true; } |
aoqi@0 | 784 | void clear_initiate_conc_mark_if_possible() { _initiate_conc_mark_if_possible = false; } |
aoqi@0 | 785 | |
aoqi@0 | 786 | bool during_initial_mark_pause() { return _during_initial_mark_pause; } |
aoqi@0 | 787 | void set_during_initial_mark_pause() { _during_initial_mark_pause = true; } |
aoqi@0 | 788 | void clear_during_initial_mark_pause(){ _during_initial_mark_pause = false; } |
aoqi@0 | 789 | |
aoqi@0 | 790 | // This sets the initiate_conc_mark_if_possible() flag to start a |
aoqi@0 | 791 | // new cycle, as long as we are not already in one. It's best if it |
aoqi@0 | 792 | // is called during a safepoint when the test whether a cycle is in |
aoqi@0 | 793 | // progress or not is stable. |
aoqi@0 | 794 | bool force_initial_mark_if_outside_cycle(GCCause::Cause gc_cause); |
aoqi@0 | 795 | |
aoqi@0 | 796 | // This is called at the very beginning of an evacuation pause (it |
aoqi@0 | 797 | // has to be the first thing that the pause does). If |
aoqi@0 | 798 | // initiate_conc_mark_if_possible() is true, and the concurrent |
aoqi@0 | 799 | // marking thread has completed its work during the previous cycle, |
aoqi@0 | 800 | // it will set during_initial_mark_pause() to so that the pause does |
aoqi@0 | 801 | // the initial-mark work and start a marking cycle. |
aoqi@0 | 802 | void decide_on_conc_mark_initiation(); |
aoqi@0 | 803 | |
aoqi@0 | 804 | // If an expansion would be appropriate, because recent GC overhead had |
aoqi@0 | 805 | // exceeded the desired limit, return an amount to expand by. |
aoqi@0 | 806 | size_t expansion_amount(); |
aoqi@0 | 807 | |
aoqi@0 | 808 | // Print tracing information. |
aoqi@0 | 809 | void print_tracing_info() const; |
aoqi@0 | 810 | |
aoqi@0 | 811 | // Print stats on young survival ratio |
aoqi@0 | 812 | void print_yg_surv_rate_info() const; |
aoqi@0 | 813 | |
aoqi@0 | 814 | void finished_recalculating_age_indexes(bool is_survivors) { |
aoqi@0 | 815 | if (is_survivors) { |
aoqi@0 | 816 | _survivor_surv_rate_group->finished_recalculating_age_indexes(); |
aoqi@0 | 817 | } else { |
aoqi@0 | 818 | _short_lived_surv_rate_group->finished_recalculating_age_indexes(); |
aoqi@0 | 819 | } |
aoqi@0 | 820 | // do that for any other surv rate groups |
aoqi@0 | 821 | } |
aoqi@0 | 822 | |
aoqi@0 | 823 | size_t young_list_target_length() const { return _young_list_target_length; } |
aoqi@0 | 824 | |
aoqi@0 | 825 | bool is_young_list_full() { |
aoqi@0 | 826 | uint young_list_length = _g1->young_list()->length(); |
aoqi@0 | 827 | uint young_list_target_length = _young_list_target_length; |
aoqi@0 | 828 | return young_list_length >= young_list_target_length; |
aoqi@0 | 829 | } |
aoqi@0 | 830 | |
aoqi@0 | 831 | bool can_expand_young_list() { |
aoqi@0 | 832 | uint young_list_length = _g1->young_list()->length(); |
aoqi@0 | 833 | uint young_list_max_length = _young_list_max_length; |
aoqi@0 | 834 | return young_list_length < young_list_max_length; |
aoqi@0 | 835 | } |
aoqi@0 | 836 | |
aoqi@0 | 837 | uint young_list_max_length() { |
aoqi@0 | 838 | return _young_list_max_length; |
aoqi@0 | 839 | } |
aoqi@0 | 840 | |
aoqi@0 | 841 | bool gcs_are_young() { |
aoqi@0 | 842 | return _gcs_are_young; |
aoqi@0 | 843 | } |
aoqi@0 | 844 | void set_gcs_are_young(bool gcs_are_young) { |
aoqi@0 | 845 | _gcs_are_young = gcs_are_young; |
aoqi@0 | 846 | } |
aoqi@0 | 847 | |
aoqi@0 | 848 | bool adaptive_young_list_length() { |
aoqi@0 | 849 | return _young_gen_sizer->adaptive_young_list_length(); |
aoqi@0 | 850 | } |
aoqi@0 | 851 | |
aoqi@0 | 852 | private: |
aoqi@0 | 853 | // |
aoqi@0 | 854 | // Survivor regions policy. |
aoqi@0 | 855 | // |
aoqi@0 | 856 | |
aoqi@0 | 857 | // Current tenuring threshold, set to 0 if the collector reaches the |
aoqi@0 | 858 | // maximum amount of survivors regions. |
aoqi@0 | 859 | uint _tenuring_threshold; |
aoqi@0 | 860 | |
aoqi@0 | 861 | // The limit on the number of regions allocated for survivors. |
aoqi@0 | 862 | uint _max_survivor_regions; |
aoqi@0 | 863 | |
aoqi@0 | 864 | // For reporting purposes. |
aoqi@0 | 865 | // The value of _heap_bytes_before_gc is also used to calculate |
aoqi@0 | 866 | // the cost of copying. |
aoqi@0 | 867 | |
aoqi@0 | 868 | size_t _eden_used_bytes_before_gc; // Eden occupancy before GC |
aoqi@0 | 869 | size_t _survivor_used_bytes_before_gc; // Survivor occupancy before GC |
aoqi@0 | 870 | size_t _heap_used_bytes_before_gc; // Heap occupancy before GC |
aoqi@0 | 871 | size_t _metaspace_used_bytes_before_gc; // Metaspace occupancy before GC |
aoqi@0 | 872 | |
aoqi@0 | 873 | size_t _eden_capacity_bytes_before_gc; // Eden capacity before GC |
aoqi@0 | 874 | size_t _heap_capacity_bytes_before_gc; // Heap capacity before GC |
aoqi@0 | 875 | |
aoqi@0 | 876 | // The amount of survivor regions after a collection. |
aoqi@0 | 877 | uint _recorded_survivor_regions; |
aoqi@0 | 878 | // List of survivor regions. |
aoqi@0 | 879 | HeapRegion* _recorded_survivor_head; |
aoqi@0 | 880 | HeapRegion* _recorded_survivor_tail; |
aoqi@0 | 881 | |
aoqi@0 | 882 | ageTable _survivors_age_table; |
aoqi@0 | 883 | |
aoqi@0 | 884 | public: |
aoqi@0 | 885 | uint tenuring_threshold() const { return _tenuring_threshold; } |
aoqi@0 | 886 | |
aoqi@0 | 887 | inline GCAllocPurpose |
aoqi@0 | 888 | evacuation_destination(HeapRegion* src_region, uint age, size_t word_sz) { |
aoqi@0 | 889 | if (age < _tenuring_threshold && src_region->is_young()) { |
aoqi@0 | 890 | return GCAllocForSurvived; |
aoqi@0 | 891 | } else { |
aoqi@0 | 892 | return GCAllocForTenured; |
aoqi@0 | 893 | } |
aoqi@0 | 894 | } |
aoqi@0 | 895 | |
aoqi@0 | 896 | inline bool track_object_age(GCAllocPurpose purpose) { |
aoqi@0 | 897 | return purpose == GCAllocForSurvived; |
aoqi@0 | 898 | } |
aoqi@0 | 899 | |
aoqi@0 | 900 | static const uint REGIONS_UNLIMITED = (uint) -1; |
aoqi@0 | 901 | |
aoqi@0 | 902 | uint max_regions(int purpose); |
aoqi@0 | 903 | |
aoqi@0 | 904 | // The limit on regions for a particular purpose is reached. |
aoqi@0 | 905 | void note_alloc_region_limit_reached(int purpose) { |
aoqi@0 | 906 | if (purpose == GCAllocForSurvived) { |
aoqi@0 | 907 | _tenuring_threshold = 0; |
aoqi@0 | 908 | } |
aoqi@0 | 909 | } |
aoqi@0 | 910 | |
aoqi@0 | 911 | void note_start_adding_survivor_regions() { |
aoqi@0 | 912 | _survivor_surv_rate_group->start_adding_regions(); |
aoqi@0 | 913 | } |
aoqi@0 | 914 | |
aoqi@0 | 915 | void note_stop_adding_survivor_regions() { |
aoqi@0 | 916 | _survivor_surv_rate_group->stop_adding_regions(); |
aoqi@0 | 917 | } |
aoqi@0 | 918 | |
aoqi@0 | 919 | void record_survivor_regions(uint regions, |
aoqi@0 | 920 | HeapRegion* head, |
aoqi@0 | 921 | HeapRegion* tail) { |
aoqi@0 | 922 | _recorded_survivor_regions = regions; |
aoqi@0 | 923 | _recorded_survivor_head = head; |
aoqi@0 | 924 | _recorded_survivor_tail = tail; |
aoqi@0 | 925 | } |
aoqi@0 | 926 | |
aoqi@0 | 927 | uint recorded_survivor_regions() { |
aoqi@0 | 928 | return _recorded_survivor_regions; |
aoqi@0 | 929 | } |
aoqi@0 | 930 | |
aoqi@0 | 931 | void record_thread_age_table(ageTable* age_table) { |
aoqi@0 | 932 | _survivors_age_table.merge_par(age_table); |
aoqi@0 | 933 | } |
aoqi@0 | 934 | |
aoqi@0 | 935 | void update_max_gc_locker_expansion(); |
aoqi@0 | 936 | |
aoqi@0 | 937 | // Calculates survivor space parameters. |
aoqi@0 | 938 | void update_survivors_policy(); |
aoqi@0 | 939 | |
aoqi@0 | 940 | virtual void post_heap_initialize(); |
aoqi@0 | 941 | }; |
aoqi@0 | 942 | |
aoqi@0 | 943 | // This should move to some place more general... |
aoqi@0 | 944 | |
aoqi@0 | 945 | // If we have "n" measurements, and we've kept track of their "sum" and the |
aoqi@0 | 946 | // "sum_of_squares" of the measurements, this returns the variance of the |
aoqi@0 | 947 | // sequence. |
aoqi@0 | 948 | inline double variance(int n, double sum_of_squares, double sum) { |
aoqi@0 | 949 | double n_d = (double)n; |
aoqi@0 | 950 | double avg = sum/n_d; |
aoqi@0 | 951 | return (sum_of_squares - 2.0 * avg * sum + n_d * avg * avg) / n_d; |
aoqi@0 | 952 | } |
aoqi@0 | 953 | |
aoqi@0 | 954 | #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTORPOLICY_HPP |