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