Mercurial > hg > graal-compiler
annotate src/share/vm/gc_implementation/g1/g1CollectorPolicy.hpp @ 1705:2d160770d2e5
6814437: G1: remove the _new_refs array
Summary: The per-worker _new_refs array is used to hold references that point into the collection set. It is populated during RSet updating and subsequently processed. In the event of an evacuation failure it processed again to recreate the RSets of regions in the collection set. Remove the per-worker _new_refs array by processing the references directly. Use a DirtyCardQueue to hold the cards containing the references so that the RSets of regions in the collection set can be recreated when handling an evacuation failure.
Reviewed-by: iveresov, jmasa, tonyp
| author | johnc |
|---|---|
| date | Mon, 02 Aug 2010 12:51:43 -0700 |
| parents | 4e5661ba9d98 |
| children | 0ce1569c90e5 |
| rev | line source |
|---|---|
| 342 | 1 /* |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1394
diff
changeset
|
2 * Copyright (c) 2001, 2010, 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 | |
| 25 // A G1CollectorPolicy makes policy decisions that determine the | |
| 26 // characteristics of the collector. Examples include: | |
| 27 // * choice of collection set. | |
| 28 // * when to collect. | |
| 29 | |
| 30 class HeapRegion; | |
| 31 class CollectionSetChooser; | |
| 32 | |
| 33 // Yes, this is a bit unpleasant... but it saves replicating the same thing | |
| 34 // over and over again and introducing subtle problems through small typos and | |
| 35 // cutting and pasting mistakes. The macros below introduces a number | |
| 36 // sequnce into the following two classes and the methods that access it. | |
| 37 | |
| 38 #define define_num_seq(name) \ | |
| 39 private: \ | |
| 40 NumberSeq _all_##name##_times_ms; \ | |
| 41 public: \ | |
| 42 void record_##name##_time_ms(double ms) { \ | |
| 43 _all_##name##_times_ms.add(ms); \ | |
| 44 } \ | |
| 45 NumberSeq* get_##name##_seq() { \ | |
| 46 return &_all_##name##_times_ms; \ | |
| 47 } | |
| 48 | |
| 49 class MainBodySummary; | |
| 50 | |
|
549
fe3d7c11b4b7
6700941: G1: allocation spec missing for some G1 classes
apetrusenko
parents:
545
diff
changeset
|
51 class PauseSummary: public CHeapObj { |
| 342 | 52 define_num_seq(total) |
| 53 define_num_seq(other) | |
| 54 | |
| 55 public: | |
| 56 virtual MainBodySummary* main_body_summary() { return NULL; } | |
| 57 }; | |
| 58 | |
|
549
fe3d7c11b4b7
6700941: G1: allocation spec missing for some G1 classes
apetrusenko
parents:
545
diff
changeset
|
59 class MainBodySummary: public CHeapObj { |
| 342 | 60 define_num_seq(satb_drain) // optional |
| 61 define_num_seq(parallel) // parallel only | |
| 62 define_num_seq(ext_root_scan) | |
| 63 define_num_seq(mark_stack_scan) | |
| 64 define_num_seq(update_rs) | |
| 65 define_num_seq(scan_rs) | |
| 66 define_num_seq(obj_copy) | |
| 67 define_num_seq(termination) // parallel only | |
| 68 define_num_seq(parallel_other) // parallel only | |
| 69 define_num_seq(mark_closure) | |
| 70 define_num_seq(clear_ct) // parallel only | |
| 71 }; | |
| 72 | |
| 677 | 73 class Summary: public PauseSummary, |
| 74 public MainBodySummary { | |
| 342 | 75 public: |
| 76 virtual MainBodySummary* main_body_summary() { return this; } | |
| 77 }; | |
| 78 | |
| 677 | 79 class AbandonedSummary: public PauseSummary { |
| 342 | 80 }; |
| 81 | |
| 82 class G1CollectorPolicy: public CollectorPolicy { | |
| 83 protected: | |
| 84 // The number of pauses during the execution. | |
| 85 long _n_pauses; | |
| 86 | |
| 87 // either equal to the number of parallel threads, if ParallelGCThreads | |
| 88 // has been set, or 1 otherwise | |
| 89 int _parallel_gc_threads; | |
| 90 | |
| 91 enum SomePrivateConstants { | |
|
942
2c79770d1f6e
6819085: G1: use larger and/or user settable region size
tonyp
parents:
936
diff
changeset
|
92 NumPrevPausesForHeuristics = 10 |
| 342 | 93 }; |
| 94 | |
| 95 G1MMUTracker* _mmu_tracker; | |
| 96 | |
| 97 void initialize_flags(); | |
| 98 | |
| 99 void initialize_all() { | |
| 100 initialize_flags(); | |
| 101 initialize_size_info(); | |
| 102 initialize_perm_generation(PermGen::MarkSweepCompact); | |
| 103 } | |
| 104 | |
| 105 virtual size_t default_init_heap_size() { | |
| 106 // Pick some reasonable default. | |
| 107 return 8*M; | |
| 108 } | |
| 109 | |
| 110 double _cur_collection_start_sec; | |
| 111 size_t _cur_collection_pause_used_at_start_bytes; | |
| 112 size_t _cur_collection_pause_used_regions_at_start; | |
| 113 size_t _prev_collection_pause_used_at_end_bytes; | |
| 114 double _cur_collection_par_time_ms; | |
| 115 double _cur_satb_drain_time_ms; | |
| 116 double _cur_clear_ct_time_ms; | |
| 117 bool _satb_drain_time_set; | |
| 118 | |
|
890
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
119 #ifndef PRODUCT |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
120 // Card Table Count Cache stats |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
121 double _min_clear_cc_time_ms; // min |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
122 double _max_clear_cc_time_ms; // max |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
123 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
|
124 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
|
125 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
|
126 #endif |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
127 |
| 342 | 128 double _cur_CH_strong_roots_end_sec; |
| 129 double _cur_CH_strong_roots_dur_ms; | |
| 130 double _cur_G1_strong_roots_end_sec; | |
| 131 double _cur_G1_strong_roots_dur_ms; | |
| 132 | |
| 133 // Statistics for recent GC pauses. See below for how indexed. | |
| 134 TruncatedSeq* _recent_CH_strong_roots_times_ms; | |
| 135 TruncatedSeq* _recent_G1_strong_roots_times_ms; | |
| 136 TruncatedSeq* _recent_evac_times_ms; | |
| 137 // These exclude marking times. | |
| 138 TruncatedSeq* _recent_pause_times_ms; | |
| 139 TruncatedSeq* _recent_gc_times_ms; | |
| 140 | |
| 141 TruncatedSeq* _recent_CS_bytes_used_before; | |
| 142 TruncatedSeq* _recent_CS_bytes_surviving; | |
| 143 | |
| 144 TruncatedSeq* _recent_rs_sizes; | |
| 145 | |
| 146 TruncatedSeq* _concurrent_mark_init_times_ms; | |
| 147 TruncatedSeq* _concurrent_mark_remark_times_ms; | |
| 148 TruncatedSeq* _concurrent_mark_cleanup_times_ms; | |
| 149 | |
| 677 | 150 Summary* _summary; |
| 151 AbandonedSummary* _abandoned_summary; | |
| 342 | 152 |
| 153 NumberSeq* _all_pause_times_ms; | |
| 154 NumberSeq* _all_full_gc_times_ms; | |
| 155 double _stop_world_start; | |
| 156 NumberSeq* _all_stop_world_times_ms; | |
| 157 NumberSeq* _all_yield_times_ms; | |
| 158 | |
| 159 size_t _region_num_young; | |
| 160 size_t _region_num_tenured; | |
| 161 size_t _prev_region_num_young; | |
| 162 size_t _prev_region_num_tenured; | |
| 163 | |
| 164 NumberSeq* _all_mod_union_times_ms; | |
| 165 | |
| 166 int _aux_num; | |
| 167 NumberSeq* _all_aux_times_ms; | |
| 168 double* _cur_aux_start_times_ms; | |
| 169 double* _cur_aux_times_ms; | |
| 170 bool* _cur_aux_times_set; | |
| 171 | |
| 1611 | 172 double* _par_last_gc_worker_start_times_ms; |
| 342 | 173 double* _par_last_ext_root_scan_times_ms; |
| 174 double* _par_last_mark_stack_scan_times_ms; | |
| 175 double* _par_last_update_rs_times_ms; | |
| 176 double* _par_last_update_rs_processed_buffers; | |
| 177 double* _par_last_scan_rs_times_ms; | |
| 178 double* _par_last_obj_copy_times_ms; | |
| 179 double* _par_last_termination_times_ms; | |
| 1611 | 180 double* _par_last_termination_attempts; |
| 181 double* _par_last_gc_worker_end_times_ms; | |
| 342 | 182 |
| 183 // indicates that we are in young GC mode | |
| 184 bool _in_young_gc_mode; | |
| 185 | |
| 186 // indicates whether we are in full young or partially young GC mode | |
| 187 bool _full_young_gcs; | |
| 188 | |
| 189 // if true, then it tries to dynamically adjust the length of the | |
| 190 // young list | |
| 191 bool _adaptive_young_list_length; | |
| 192 size_t _young_list_min_length; | |
| 193 size_t _young_list_target_length; | |
| 194 size_t _young_list_fixed_length; | |
| 195 | |
| 196 size_t _young_cset_length; | |
| 197 bool _last_young_gc_full; | |
| 198 | |
| 199 unsigned _full_young_pause_num; | |
| 200 unsigned _partial_young_pause_num; | |
| 201 | |
| 202 bool _during_marking; | |
| 203 bool _in_marking_window; | |
| 204 bool _in_marking_window_im; | |
| 205 | |
| 206 SurvRateGroup* _short_lived_surv_rate_group; | |
| 207 SurvRateGroup* _survivor_surv_rate_group; | |
| 208 // add here any more surv rate groups | |
| 209 | |
| 1356 | 210 double _gc_overhead_perc; |
| 211 | |
| 342 | 212 bool during_marking() { |
| 213 return _during_marking; | |
| 214 } | |
| 215 | |
| 216 // <NEW PREDICTION> | |
| 217 | |
| 218 private: | |
| 219 enum PredictionConstants { | |
| 220 TruncatedSeqLength = 10 | |
| 221 }; | |
| 222 | |
| 223 TruncatedSeq* _alloc_rate_ms_seq; | |
| 224 double _prev_collection_pause_end_ms; | |
| 225 | |
| 226 TruncatedSeq* _pending_card_diff_seq; | |
| 227 TruncatedSeq* _rs_length_diff_seq; | |
| 228 TruncatedSeq* _cost_per_card_ms_seq; | |
| 229 TruncatedSeq* _fully_young_cards_per_entry_ratio_seq; | |
| 230 TruncatedSeq* _partially_young_cards_per_entry_ratio_seq; | |
| 231 TruncatedSeq* _cost_per_entry_ms_seq; | |
| 232 TruncatedSeq* _partially_young_cost_per_entry_ms_seq; | |
| 233 TruncatedSeq* _cost_per_byte_ms_seq; | |
| 234 TruncatedSeq* _constant_other_time_ms_seq; | |
| 235 TruncatedSeq* _young_other_cost_per_region_ms_seq; | |
| 236 TruncatedSeq* _non_young_other_cost_per_region_ms_seq; | |
| 237 | |
| 238 TruncatedSeq* _pending_cards_seq; | |
| 239 TruncatedSeq* _scanned_cards_seq; | |
| 240 TruncatedSeq* _rs_lengths_seq; | |
| 241 | |
| 242 TruncatedSeq* _cost_per_byte_ms_during_cm_seq; | |
| 243 | |
| 244 TruncatedSeq* _young_gc_eff_seq; | |
| 245 | |
| 246 TruncatedSeq* _max_conc_overhead_seq; | |
| 247 | |
| 248 size_t _recorded_young_regions; | |
| 249 size_t _recorded_non_young_regions; | |
| 250 size_t _recorded_region_num; | |
| 251 | |
| 252 size_t _free_regions_at_end_of_collection; | |
| 253 | |
| 254 size_t _recorded_rs_lengths; | |
| 255 size_t _max_rs_lengths; | |
| 256 | |
| 257 size_t _recorded_marked_bytes; | |
| 258 size_t _recorded_young_bytes; | |
| 259 | |
| 260 size_t _predicted_pending_cards; | |
| 261 size_t _predicted_cards_scanned; | |
| 262 size_t _predicted_rs_lengths; | |
| 263 size_t _predicted_bytes_to_copy; | |
| 264 | |
| 265 double _predicted_survival_ratio; | |
| 266 double _predicted_rs_update_time_ms; | |
| 267 double _predicted_rs_scan_time_ms; | |
| 268 double _predicted_object_copy_time_ms; | |
| 269 double _predicted_constant_other_time_ms; | |
| 270 double _predicted_young_other_time_ms; | |
| 271 double _predicted_non_young_other_time_ms; | |
| 272 double _predicted_pause_time_ms; | |
| 273 | |
| 274 double _vtime_diff_ms; | |
| 275 | |
| 276 double _recorded_young_free_cset_time_ms; | |
| 277 double _recorded_non_young_free_cset_time_ms; | |
| 278 | |
| 279 double _sigma; | |
| 280 double _expensive_region_limit_ms; | |
| 281 | |
| 282 size_t _rs_lengths_prediction; | |
| 283 | |
| 284 size_t _known_garbage_bytes; | |
| 285 double _known_garbage_ratio; | |
| 286 | |
| 287 double sigma() { | |
| 288 return _sigma; | |
| 289 } | |
| 290 | |
| 291 // A function that prevents us putting too much stock in small sample | |
| 292 // sets. Returns a number between 2.0 and 1.0, depending on the number | |
| 293 // of samples. 5 or more samples yields one; fewer scales linearly from | |
| 294 // 2.0 at 1 sample to 1.0 at 5. | |
| 295 double confidence_factor(int samples) { | |
| 296 if (samples > 4) return 1.0; | |
| 297 else return 1.0 + sigma() * ((double)(5 - samples))/2.0; | |
| 298 } | |
| 299 | |
| 300 double get_new_neg_prediction(TruncatedSeq* seq) { | |
| 301 return seq->davg() - sigma() * seq->dsd(); | |
| 302 } | |
| 303 | |
| 304 #ifndef PRODUCT | |
| 305 bool verify_young_ages(HeapRegion* head, SurvRateGroup *surv_rate_group); | |
| 306 #endif // PRODUCT | |
| 307 | |
| 1111 | 308 void adjust_concurrent_refinement(double update_rs_time, |
| 309 double update_rs_processed_buffers, | |
| 310 double goal_ms); | |
| 311 | |
| 342 | 312 protected: |
| 313 double _pause_time_target_ms; | |
| 314 double _recorded_young_cset_choice_time_ms; | |
| 315 double _recorded_non_young_cset_choice_time_ms; | |
| 316 bool _within_target; | |
| 317 size_t _pending_cards; | |
| 318 size_t _max_pending_cards; | |
| 319 | |
| 320 public: | |
| 321 | |
| 322 void set_region_short_lived(HeapRegion* hr) { | |
| 323 hr->install_surv_rate_group(_short_lived_surv_rate_group); | |
| 324 } | |
| 325 | |
| 326 void set_region_survivors(HeapRegion* hr) { | |
| 327 hr->install_surv_rate_group(_survivor_surv_rate_group); | |
| 328 } | |
| 329 | |
| 330 #ifndef PRODUCT | |
| 331 bool verify_young_ages(); | |
| 332 #endif // PRODUCT | |
| 333 | |
| 334 double get_new_prediction(TruncatedSeq* seq) { | |
| 335 return MAX2(seq->davg() + sigma() * seq->dsd(), | |
| 336 seq->davg() * confidence_factor(seq->num())); | |
| 337 } | |
| 338 | |
| 339 size_t young_cset_length() { | |
| 340 return _young_cset_length; | |
| 341 } | |
| 342 | |
| 343 void record_max_rs_lengths(size_t rs_lengths) { | |
| 344 _max_rs_lengths = rs_lengths; | |
| 345 } | |
| 346 | |
| 347 size_t predict_pending_card_diff() { | |
| 348 double prediction = get_new_neg_prediction(_pending_card_diff_seq); | |
| 349 if (prediction < 0.00001) | |
| 350 return 0; | |
| 351 else | |
| 352 return (size_t) prediction; | |
| 353 } | |
| 354 | |
| 355 size_t predict_pending_cards() { | |
| 356 size_t max_pending_card_num = _g1->max_pending_card_num(); | |
| 357 size_t diff = predict_pending_card_diff(); | |
| 358 size_t prediction; | |
| 359 if (diff > max_pending_card_num) | |
| 360 prediction = max_pending_card_num; | |
| 361 else | |
| 362 prediction = max_pending_card_num - diff; | |
| 363 | |
| 364 return prediction; | |
| 365 } | |
| 366 | |
| 367 size_t predict_rs_length_diff() { | |
| 368 return (size_t) get_new_prediction(_rs_length_diff_seq); | |
| 369 } | |
| 370 | |
| 371 double predict_alloc_rate_ms() { | |
| 372 return get_new_prediction(_alloc_rate_ms_seq); | |
| 373 } | |
| 374 | |
| 375 double predict_cost_per_card_ms() { | |
| 376 return get_new_prediction(_cost_per_card_ms_seq); | |
| 377 } | |
| 378 | |
| 379 double predict_rs_update_time_ms(size_t pending_cards) { | |
| 380 return (double) pending_cards * predict_cost_per_card_ms(); | |
| 381 } | |
| 382 | |
| 383 double predict_fully_young_cards_per_entry_ratio() { | |
| 384 return get_new_prediction(_fully_young_cards_per_entry_ratio_seq); | |
| 385 } | |
| 386 | |
| 387 double predict_partially_young_cards_per_entry_ratio() { | |
| 388 if (_partially_young_cards_per_entry_ratio_seq->num() < 2) | |
| 389 return predict_fully_young_cards_per_entry_ratio(); | |
| 390 else | |
| 391 return get_new_prediction(_partially_young_cards_per_entry_ratio_seq); | |
| 392 } | |
| 393 | |
| 394 size_t predict_young_card_num(size_t rs_length) { | |
| 395 return (size_t) ((double) rs_length * | |
| 396 predict_fully_young_cards_per_entry_ratio()); | |
| 397 } | |
| 398 | |
| 399 size_t predict_non_young_card_num(size_t rs_length) { | |
| 400 return (size_t) ((double) rs_length * | |
| 401 predict_partially_young_cards_per_entry_ratio()); | |
| 402 } | |
| 403 | |
| 404 double predict_rs_scan_time_ms(size_t card_num) { | |
| 405 if (full_young_gcs()) | |
| 406 return (double) card_num * get_new_prediction(_cost_per_entry_ms_seq); | |
| 407 else | |
| 408 return predict_partially_young_rs_scan_time_ms(card_num); | |
| 409 } | |
| 410 | |
| 411 double predict_partially_young_rs_scan_time_ms(size_t card_num) { | |
| 412 if (_partially_young_cost_per_entry_ms_seq->num() < 3) | |
| 413 return (double) card_num * get_new_prediction(_cost_per_entry_ms_seq); | |
| 414 else | |
| 415 return (double) card_num * | |
| 416 get_new_prediction(_partially_young_cost_per_entry_ms_seq); | |
| 417 } | |
| 418 | |
| 419 double predict_object_copy_time_ms_during_cm(size_t bytes_to_copy) { | |
| 420 if (_cost_per_byte_ms_during_cm_seq->num() < 3) | |
| 421 return 1.1 * (double) bytes_to_copy * | |
| 422 get_new_prediction(_cost_per_byte_ms_seq); | |
| 423 else | |
| 424 return (double) bytes_to_copy * | |
| 425 get_new_prediction(_cost_per_byte_ms_during_cm_seq); | |
| 426 } | |
| 427 | |
| 428 double predict_object_copy_time_ms(size_t bytes_to_copy) { | |
| 429 if (_in_marking_window && !_in_marking_window_im) | |
| 430 return predict_object_copy_time_ms_during_cm(bytes_to_copy); | |
| 431 else | |
| 432 return (double) bytes_to_copy * | |
| 433 get_new_prediction(_cost_per_byte_ms_seq); | |
| 434 } | |
| 435 | |
| 436 double predict_constant_other_time_ms() { | |
| 437 return get_new_prediction(_constant_other_time_ms_seq); | |
| 438 } | |
| 439 | |
| 440 double predict_young_other_time_ms(size_t young_num) { | |
| 441 return | |
| 442 (double) young_num * | |
| 443 get_new_prediction(_young_other_cost_per_region_ms_seq); | |
| 444 } | |
| 445 | |
| 446 double predict_non_young_other_time_ms(size_t non_young_num) { | |
| 447 return | |
| 448 (double) non_young_num * | |
| 449 get_new_prediction(_non_young_other_cost_per_region_ms_seq); | |
| 450 } | |
| 451 | |
| 452 void check_if_region_is_too_expensive(double predicted_time_ms); | |
| 453 | |
| 454 double predict_young_collection_elapsed_time_ms(size_t adjustment); | |
| 455 double predict_base_elapsed_time_ms(size_t pending_cards); | |
| 456 double predict_base_elapsed_time_ms(size_t pending_cards, | |
| 457 size_t scanned_cards); | |
| 458 size_t predict_bytes_to_copy(HeapRegion* hr); | |
| 459 double predict_region_elapsed_time_ms(HeapRegion* hr, bool young); | |
| 460 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
461 // for use by: calculate_young_list_target_length(rs_length) |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
462 bool predict_will_fit(size_t young_region_num, |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
463 double base_time_ms, |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
464 size_t init_free_regions, |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
465 double target_pause_time_ms); |
| 342 | 466 |
| 467 void start_recording_regions(); | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
468 void record_cset_region_info(HeapRegion* hr, bool young); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
469 void record_non_young_cset_region(HeapRegion* hr); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
470 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
471 void set_recorded_young_regions(size_t n_regions); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
472 void set_recorded_young_bytes(size_t bytes); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
473 void set_recorded_rs_lengths(size_t rs_lengths); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
474 void set_predicted_bytes_to_copy(size_t bytes); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
475 |
| 342 | 476 void end_recording_regions(); |
| 477 | |
| 478 void record_vtime_diff_ms(double vtime_diff_ms) { | |
| 479 _vtime_diff_ms = vtime_diff_ms; | |
| 480 } | |
| 481 | |
| 482 void record_young_free_cset_time_ms(double time_ms) { | |
| 483 _recorded_young_free_cset_time_ms = time_ms; | |
| 484 } | |
| 485 | |
| 486 void record_non_young_free_cset_time_ms(double time_ms) { | |
| 487 _recorded_non_young_free_cset_time_ms = time_ms; | |
| 488 } | |
| 489 | |
| 490 double predict_young_gc_eff() { | |
| 491 return get_new_neg_prediction(_young_gc_eff_seq); | |
| 492 } | |
| 493 | |
| 545 | 494 double predict_survivor_regions_evac_time(); |
| 495 | |
| 342 | 496 // </NEW PREDICTION> |
| 497 | |
| 498 public: | |
| 499 void cset_regions_freed() { | |
| 500 bool propagate = _last_young_gc_full && !_in_marking_window; | |
| 501 _short_lived_surv_rate_group->all_surviving_words_recorded(propagate); | |
| 502 _survivor_surv_rate_group->all_surviving_words_recorded(propagate); | |
| 503 // also call it on any more surv rate groups | |
| 504 } | |
| 505 | |
| 506 void set_known_garbage_bytes(size_t known_garbage_bytes) { | |
| 507 _known_garbage_bytes = known_garbage_bytes; | |
| 508 size_t heap_bytes = _g1->capacity(); | |
| 509 _known_garbage_ratio = (double) _known_garbage_bytes / (double) heap_bytes; | |
| 510 } | |
| 511 | |
| 512 void decrease_known_garbage_bytes(size_t known_garbage_bytes) { | |
| 513 guarantee( _known_garbage_bytes >= known_garbage_bytes, "invariant" ); | |
| 514 | |
| 515 _known_garbage_bytes -= known_garbage_bytes; | |
| 516 size_t heap_bytes = _g1->capacity(); | |
| 517 _known_garbage_ratio = (double) _known_garbage_bytes / (double) heap_bytes; | |
| 518 } | |
| 519 | |
| 520 G1MMUTracker* mmu_tracker() { | |
| 521 return _mmu_tracker; | |
| 522 } | |
| 523 | |
|
1656
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
524 double max_pause_time_ms() { |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
525 return _mmu_tracker->max_gc_time() * 1000.0; |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
526 } |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
527 |
| 342 | 528 double predict_init_time_ms() { |
| 529 return get_new_prediction(_concurrent_mark_init_times_ms); | |
| 530 } | |
| 531 | |
| 532 double predict_remark_time_ms() { | |
| 533 return get_new_prediction(_concurrent_mark_remark_times_ms); | |
| 534 } | |
| 535 | |
| 536 double predict_cleanup_time_ms() { | |
| 537 return get_new_prediction(_concurrent_mark_cleanup_times_ms); | |
| 538 } | |
| 539 | |
| 540 // Returns an estimate of the survival rate of the region at yg-age | |
| 541 // "yg_age". | |
| 545 | 542 double predict_yg_surv_rate(int age, SurvRateGroup* surv_rate_group) { |
| 543 TruncatedSeq* seq = surv_rate_group->get_seq(age); | |
| 342 | 544 if (seq->num() == 0) |
| 545 gclog_or_tty->print("BARF! age is %d", age); | |
| 546 guarantee( seq->num() > 0, "invariant" ); | |
| 547 double pred = get_new_prediction(seq); | |
| 548 if (pred > 1.0) | |
| 549 pred = 1.0; | |
| 550 return pred; | |
| 551 } | |
| 552 | |
| 545 | 553 double predict_yg_surv_rate(int age) { |
| 554 return predict_yg_surv_rate(age, _short_lived_surv_rate_group); | |
| 555 } | |
| 556 | |
| 342 | 557 double accum_yg_surv_rate_pred(int age) { |
| 558 return _short_lived_surv_rate_group->accum_surv_rate_pred(age); | |
| 559 } | |
| 560 | |
| 561 protected: | |
| 1611 | 562 void print_stats(int level, const char* str, double value); |
| 563 void print_stats(int level, const char* str, int value); | |
| 564 | |
| 565 void print_par_stats(int level, const char* str, double* data) { | |
| 342 | 566 print_par_stats(level, str, data, true); |
| 567 } | |
| 1611 | 568 void print_par_stats(int level, const char* str, double* data, bool summary); |
| 569 void print_par_sizes(int level, const char* str, double* data, bool summary); | |
| 342 | 570 |
| 571 void check_other_times(int level, | |
| 572 NumberSeq* other_times_ms, | |
| 573 NumberSeq* calc_other_times_ms) const; | |
| 574 | |
| 575 void print_summary (PauseSummary* stats) const; | |
| 677 | 576 void print_abandoned_summary(PauseSummary* summary) const; |
| 342 | 577 |
| 578 void print_summary (int level, const char* str, NumberSeq* seq) const; | |
| 579 void print_summary_sd (int level, const char* str, NumberSeq* seq) const; | |
| 580 | |
| 581 double avg_value (double* data); | |
| 582 double max_value (double* data); | |
| 583 double sum_of_values (double* data); | |
| 584 double max_sum (double* data1, double* data2); | |
| 585 | |
| 586 int _last_satb_drain_processed_buffers; | |
| 587 int _last_update_rs_processed_buffers; | |
| 588 double _last_pause_time_ms; | |
| 589 | |
| 590 size_t _bytes_in_to_space_before_gc; | |
| 591 size_t _bytes_in_to_space_after_gc; | |
| 592 size_t bytes_in_to_space_during_gc() { | |
| 593 return | |
| 594 _bytes_in_to_space_after_gc - _bytes_in_to_space_before_gc; | |
| 595 } | |
| 596 size_t _bytes_in_collection_set_before_gc; | |
| 597 // Used to count used bytes in CS. | |
| 598 friend class CountCSClosure; | |
| 599 | |
| 600 // Statistics kept per GC stoppage, pause or full. | |
| 601 TruncatedSeq* _recent_prev_end_times_for_all_gcs_sec; | |
| 602 | |
| 603 // We track markings. | |
| 604 int _num_markings; | |
| 605 double _mark_thread_startup_sec; // Time at startup of marking thread | |
| 606 | |
| 607 // Add a new GC of the given duration and end time to the record. | |
| 608 void update_recent_gc_times(double end_time_sec, double elapsed_ms); | |
| 609 | |
| 610 // 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
|
611 // 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
|
612 // set at the start of the pause. |
| 342 | 613 HeapRegion* _collection_set; |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
614 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
615 // The number of regions in the collection set. Set from the incrementally |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
616 // built collection set at the start of an evacuation pause. |
| 342 | 617 size_t _collection_set_size; |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
618 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
619 // 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
|
620 // 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
|
621 // pause. |
| 342 | 622 size_t _collection_set_bytes_used_before; |
| 623 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
624 // 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
|
625 // 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
|
626 // 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
|
627 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
628 enum CSetBuildType { |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
629 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
|
630 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
|
631 }; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
632 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
633 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
|
634 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
635 // 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
|
636 HeapRegion* _inc_cset_head; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
637 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
638 // 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
|
639 HeapRegion* _inc_cset_tail; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
640 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
641 // The number of regions 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
|
642 // Used to set _collection_set_size 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
|
643 // pause. |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
644 size_t _inc_cset_size; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
645 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
646 // Used as the index in the surving young words structure |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
647 // which tracks the amount of space, for each young region, |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
648 // that survives the pause. |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
649 size_t _inc_cset_young_index; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
650 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
651 // 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
|
652 // 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
|
653 // an evacuation pause. |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
654 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
|
655 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
656 // 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
|
657 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
|
658 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
659 // The number of recorded used bytes in the young regions |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
660 // of the collection set. This is the sum of the used() bytes |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
661 // of retired young 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
|
662 size_t _inc_cset_recorded_young_bytes; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
663 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
664 // 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
|
665 // (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
|
666 // young list/collection set). |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
667 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
|
668 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
669 // 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
|
670 // 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
|
671 // 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
|
672 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
|
673 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
674 // The predicted bytes to copy for the regions in the collection |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
675 // set (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
|
676 // young list/collection set). |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
677 size_t _inc_cset_predicted_bytes_to_copy; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
678 |
| 342 | 679 // Info about marking. |
| 680 int _n_marks; // Sticky at 2, so we know when we've done at least 2. | |
| 681 | |
| 682 // The number of collection pauses at the end of the last mark. | |
| 683 size_t _n_pauses_at_mark_end; | |
| 684 | |
| 685 // Stash a pointer to the g1 heap. | |
| 686 G1CollectedHeap* _g1; | |
| 687 | |
| 688 // The average time in ms per collection pause, averaged over recent pauses. | |
| 689 double recent_avg_time_for_pauses_ms(); | |
| 690 | |
| 691 // The average time in ms for processing CollectedHeap strong roots, per | |
| 692 // collection pause, averaged over recent pauses. | |
| 693 double recent_avg_time_for_CH_strong_ms(); | |
| 694 | |
| 695 // The average time in ms for processing the G1 remembered set, per | |
| 696 // pause, averaged over recent pauses. | |
| 697 double recent_avg_time_for_G1_strong_ms(); | |
| 698 | |
| 699 // The average time in ms for "evacuating followers", per pause, averaged | |
| 700 // over recent pauses. | |
| 701 double recent_avg_time_for_evac_ms(); | |
| 702 | |
| 703 // The number of "recent" GCs recorded in the number sequences | |
| 704 int number_of_recent_gcs(); | |
| 705 | |
| 706 // The average survival ratio, computed by the total number of bytes | |
| 707 // suriviving / total number of bytes before collection over the last | |
| 708 // several recent pauses. | |
| 709 double recent_avg_survival_fraction(); | |
| 710 // The survival fraction of the most recent pause; if there have been no | |
| 711 // pauses, returns 1.0. | |
| 712 double last_survival_fraction(); | |
| 713 | |
| 714 // Returns a "conservative" estimate of the recent survival rate, i.e., | |
| 715 // one that may be higher than "recent_avg_survival_fraction". | |
| 716 // This is conservative in several ways: | |
| 717 // If there have been few pauses, it will assume a potential high | |
| 718 // variance, and err on the side of caution. | |
| 719 // It puts a lower bound (currently 0.1) on the value it will return. | |
| 720 // To try to detect phase changes, if the most recent pause ("latest") has a | |
| 721 // higher-than average ("avg") survival rate, it returns that rate. | |
| 722 // "work" version is a utility function; young is restricted to young regions. | |
| 723 double conservative_avg_survival_fraction_work(double avg, | |
| 724 double latest); | |
| 725 | |
| 726 // The arguments are the two sequences that keep track of the number of bytes | |
| 727 // surviving and the total number of bytes before collection, resp., | |
| 728 // over the last evereal recent pauses | |
| 729 // Returns the survival rate for the category in the most recent pause. | |
| 730 // If there have been no pauses, returns 1.0. | |
| 731 double last_survival_fraction_work(TruncatedSeq* surviving, | |
| 732 TruncatedSeq* before); | |
| 733 | |
| 734 // The arguments are the two sequences that keep track of the number of bytes | |
| 735 // surviving and the total number of bytes before collection, resp., | |
| 736 // over the last several recent pauses | |
| 737 // Returns the average survival ration over the last several recent pauses | |
| 738 // If there have been no pauses, return 1.0 | |
| 739 double recent_avg_survival_fraction_work(TruncatedSeq* surviving, | |
| 740 TruncatedSeq* before); | |
| 741 | |
| 742 double conservative_avg_survival_fraction() { | |
| 743 double avg = recent_avg_survival_fraction(); | |
| 744 double latest = last_survival_fraction(); | |
| 745 return conservative_avg_survival_fraction_work(avg, latest); | |
| 746 } | |
| 747 | |
| 748 // The ratio of gc time to elapsed time, computed over recent pauses. | |
| 749 double _recent_avg_pause_time_ratio; | |
| 750 | |
| 751 double recent_avg_pause_time_ratio() { | |
| 752 return _recent_avg_pause_time_ratio; | |
| 753 } | |
| 754 | |
| 755 // Number of pauses between concurrent marking. | |
| 756 size_t _pauses_btwn_concurrent_mark; | |
| 757 | |
| 758 size_t _n_marks_since_last_pause; | |
| 759 | |
|
1359
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1356
diff
changeset
|
760 // 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
|
761 // 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
|
762 // 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
|
763 // 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
|
764 // 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
|
765 // 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
|
766 // 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
|
767 // work. |
|
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1356
diff
changeset
|
768 volatile bool _initiate_conc_mark_if_possible; |
| 342 | 769 |
|
1359
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1356
diff
changeset
|
770 // 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
|
771 // 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
|
772 // 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
|
773 // 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
|
774 // previous marking cycle (e.g., clearing the next marking |
|
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1356
diff
changeset
|
775 // 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
|
776 // 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
|
777 // 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
|
778 // 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
|
779 // 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
|
780 // 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
|
781 // 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
|
782 // initial-mark work. |
|
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1356
diff
changeset
|
783 volatile bool _during_initial_mark_pause; |
|
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1356
diff
changeset
|
784 |
| 342 | 785 bool _should_revert_to_full_young_gcs; |
| 786 bool _last_full_young_gc; | |
| 787 | |
| 788 // This set of variables tracks the collector efficiency, in order to | |
| 789 // determine whether we should initiate a new marking. | |
| 790 double _cur_mark_stop_world_time_ms; | |
| 791 double _mark_init_start_sec; | |
| 792 double _mark_remark_start_sec; | |
| 793 double _mark_cleanup_start_sec; | |
| 794 double _mark_closure_time_ms; | |
| 795 | |
| 796 void calculate_young_list_min_length(); | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
797 void calculate_young_list_target_length(); |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
798 void calculate_young_list_target_length(size_t rs_lengths); |
| 342 | 799 |
| 800 public: | |
| 801 | |
| 802 G1CollectorPolicy(); | |
| 803 | |
| 804 virtual G1CollectorPolicy* as_g1_policy() { return this; } | |
| 805 | |
| 806 virtual CollectorPolicy::Name kind() { | |
| 807 return CollectorPolicy::G1CollectorPolicyKind; | |
| 808 } | |
| 809 | |
| 810 void check_prediction_validity(); | |
| 811 | |
| 812 size_t bytes_in_collection_set() { | |
| 813 return _bytes_in_collection_set_before_gc; | |
| 814 } | |
| 815 | |
| 816 size_t bytes_in_to_space() { | |
| 817 return bytes_in_to_space_during_gc(); | |
| 818 } | |
| 819 | |
| 820 unsigned calc_gc_alloc_time_stamp() { | |
| 821 return _all_pause_times_ms->num() + 1; | |
| 822 } | |
| 823 | |
| 824 protected: | |
| 825 | |
| 826 // Count the number of bytes used in the CS. | |
| 827 void count_CS_bytes_used(); | |
| 828 | |
| 829 // Together these do the base cleanup-recording work. Subclasses might | |
| 830 // want to put something between them. | |
| 831 void record_concurrent_mark_cleanup_end_work1(size_t freed_bytes, | |
| 832 size_t max_live_bytes); | |
| 833 void record_concurrent_mark_cleanup_end_work2(); | |
| 834 | |
| 835 public: | |
| 836 | |
| 837 virtual void init(); | |
| 838 | |
| 545 | 839 // Create jstat counters for the policy. |
| 840 virtual void initialize_gc_policy_counters(); | |
| 841 | |
| 342 | 842 virtual HeapWord* mem_allocate_work(size_t size, |
| 843 bool is_tlab, | |
| 844 bool* gc_overhead_limit_was_exceeded); | |
| 845 | |
| 846 // This method controls how a collector handles one or more | |
| 847 // of its generations being fully allocated. | |
| 848 virtual HeapWord* satisfy_failed_allocation(size_t size, | |
| 849 bool is_tlab); | |
| 850 | |
| 851 BarrierSet::Name barrier_set_name() { return BarrierSet::G1SATBCTLogging; } | |
| 852 | |
| 853 GenRemSet::Name rem_set_name() { return GenRemSet::CardTable; } | |
| 854 | |
| 855 // The number of collection pauses so far. | |
| 856 long n_pauses() const { return _n_pauses; } | |
| 857 | |
| 858 // Update the heuristic info to record a collection pause of the given | |
| 859 // start time, where the given number of bytes were used at the start. | |
| 860 // This may involve changing the desired size of a collection set. | |
| 861 | |
| 862 virtual void record_stop_world_start(); | |
| 863 | |
| 864 virtual void record_collection_pause_start(double start_time_sec, | |
| 865 size_t start_used); | |
| 866 | |
| 867 // Must currently be called while the world is stopped. | |
| 868 virtual void record_concurrent_mark_init_start(); | |
| 869 virtual void record_concurrent_mark_init_end(); | |
| 870 void record_concurrent_mark_init_end_pre(double | |
| 871 mark_init_elapsed_time_ms); | |
| 872 | |
| 873 void record_mark_closure_time(double mark_closure_time_ms); | |
| 874 | |
| 875 virtual void record_concurrent_mark_remark_start(); | |
| 876 virtual void record_concurrent_mark_remark_end(); | |
| 877 | |
| 878 virtual void record_concurrent_mark_cleanup_start(); | |
| 879 virtual void record_concurrent_mark_cleanup_end(size_t freed_bytes, | |
| 880 size_t max_live_bytes); | |
| 881 virtual void record_concurrent_mark_cleanup_completed(); | |
| 882 | |
| 883 virtual void record_concurrent_pause(); | |
| 884 virtual void record_concurrent_pause_end(); | |
| 885 | |
| 886 virtual void record_collection_pause_end_CH_strong_roots(); | |
| 887 virtual void record_collection_pause_end_G1_strong_roots(); | |
| 888 | |
| 677 | 889 virtual void record_collection_pause_end(bool abandoned); |
| 342 | 890 |
| 891 // Record the fact that a full collection occurred. | |
| 892 virtual void record_full_collection_start(); | |
| 893 virtual void record_full_collection_end(); | |
| 894 | |
| 1611 | 895 void record_gc_worker_start_time(int worker_i, double ms) { |
| 896 _par_last_gc_worker_start_times_ms[worker_i] = ms; | |
| 897 } | |
| 898 | |
| 342 | 899 void record_ext_root_scan_time(int worker_i, double ms) { |
| 900 _par_last_ext_root_scan_times_ms[worker_i] = ms; | |
| 901 } | |
| 902 | |
| 903 void record_mark_stack_scan_time(int worker_i, double ms) { | |
| 904 _par_last_mark_stack_scan_times_ms[worker_i] = ms; | |
| 905 } | |
| 906 | |
| 907 void record_satb_drain_time(double ms) { | |
| 908 _cur_satb_drain_time_ms = ms; | |
| 909 _satb_drain_time_set = true; | |
| 910 } | |
| 911 | |
| 912 void record_satb_drain_processed_buffers (int processed_buffers) { | |
| 913 _last_satb_drain_processed_buffers = processed_buffers; | |
| 914 } | |
| 915 | |
| 916 void record_mod_union_time(double ms) { | |
| 917 _all_mod_union_times_ms->add(ms); | |
| 918 } | |
| 919 | |
| 920 void record_update_rs_time(int thread, double ms) { | |
| 921 _par_last_update_rs_times_ms[thread] = ms; | |
| 922 } | |
| 923 | |
| 924 void record_update_rs_processed_buffers (int thread, | |
| 925 double processed_buffers) { | |
| 926 _par_last_update_rs_processed_buffers[thread] = processed_buffers; | |
| 927 } | |
| 928 | |
| 929 void record_scan_rs_time(int thread, double ms) { | |
| 930 _par_last_scan_rs_times_ms[thread] = ms; | |
| 931 } | |
| 932 | |
| 933 void reset_obj_copy_time(int thread) { | |
| 934 _par_last_obj_copy_times_ms[thread] = 0.0; | |
| 935 } | |
| 936 | |
| 937 void reset_obj_copy_time() { | |
| 938 reset_obj_copy_time(0); | |
| 939 } | |
| 940 | |
| 941 void record_obj_copy_time(int thread, double ms) { | |
| 942 _par_last_obj_copy_times_ms[thread] += ms; | |
| 943 } | |
| 944 | |
| 1611 | 945 void record_termination(int thread, double ms, size_t attempts) { |
| 946 _par_last_termination_times_ms[thread] = ms; | |
| 947 _par_last_termination_attempts[thread] = (double) attempts; | |
| 342 | 948 } |
| 949 | |
| 1611 | 950 void record_gc_worker_end_time(int worker_i, double ms) { |
| 951 _par_last_gc_worker_end_times_ms[worker_i] = ms; | |
| 342 | 952 } |
| 953 | |
|
595
3698e8f47799
6804746: G1: guarantee(variance() > -1.0,"variance should be >= 0") (due to evacuation failure)
tonyp
parents:
549
diff
changeset
|
954 void record_pause_time_ms(double ms) { |
| 342 | 955 _last_pause_time_ms = ms; |
| 956 } | |
| 957 | |
| 958 void record_clear_ct_time(double ms) { | |
| 959 _cur_clear_ct_time_ms = ms; | |
| 960 } | |
| 961 | |
| 962 void record_par_time(double ms) { | |
| 963 _cur_collection_par_time_ms = ms; | |
| 964 } | |
| 965 | |
| 966 void record_aux_start_time(int i) { | |
| 967 guarantee(i < _aux_num, "should be within range"); | |
| 968 _cur_aux_start_times_ms[i] = os::elapsedTime() * 1000.0; | |
| 969 } | |
| 970 | |
| 971 void record_aux_end_time(int i) { | |
| 972 guarantee(i < _aux_num, "should be within range"); | |
| 973 double ms = os::elapsedTime() * 1000.0 - _cur_aux_start_times_ms[i]; | |
| 974 _cur_aux_times_set[i] = true; | |
| 975 _cur_aux_times_ms[i] += ms; | |
| 976 } | |
| 977 | |
|
890
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
978 #ifndef PRODUCT |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
979 void record_cc_clear_time(double ms) { |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
980 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
|
981 _min_clear_cc_time_ms = ms; |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
982 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
|
983 _max_clear_cc_time_ms = ms; |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
984 _cur_clear_cc_time_ms = ms; |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
985 _cum_clear_cc_time_ms += ms; |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
986 _num_cc_clears++; |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
987 } |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
988 #endif |
|
6cb8e9df7174
6819077: G1: first GC thread coming late into the GC.
johnc
parents:
838
diff
changeset
|
989 |
| 342 | 990 // Record the fact that "bytes" bytes allocated in a region. |
| 991 void record_before_bytes(size_t bytes); | |
| 992 void record_after_bytes(size_t bytes); | |
| 993 | |
| 994 // Returns "true" if this is a good time to do a collection pause. | |
| 995 // The "word_size" argument, if non-zero, indicates the size of an | |
| 996 // allocation request that is prompting this query. | |
| 997 virtual bool should_do_collection_pause(size_t word_size) = 0; | |
| 998 | |
| 999 // Choose a new collection set. Marks the chosen regions as being | |
| 1000 // "in_collection_set", and links them together. The head and number of | |
| 1001 // the collection set are available via access methods. | |
|
1656
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
1002 virtual bool choose_collection_set(double target_pause_time_ms) = 0; |
| 342 | 1003 |
| 1004 // The head of the list (via "next_in_collection_set()") representing the | |
| 1005 // current collection set. | |
| 1006 HeapRegion* collection_set() { return _collection_set; } | |
| 1007 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1008 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
|
1009 |
| 342 | 1010 // The number of elements in the current collection set. |
| 1011 size_t collection_set_size() { return _collection_set_size; } | |
| 1012 | |
| 1013 // Add "hr" to the CS. | |
| 1014 void add_to_collection_set(HeapRegion* hr); | |
| 1015 | |
|
1394
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1016 // Incremental CSet Support |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1017 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1018 // 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
|
1019 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
|
1020 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1021 // 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
|
1022 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
|
1023 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1024 // The number of elements 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
|
1025 size_t inc_cset_size() { return _inc_cset_size; } |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1026 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1027 // 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
|
1028 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
|
1029 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1030 void clear_incremental_cset() { |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1031 _inc_cset_head = NULL; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1032 _inc_cset_tail = NULL; |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1033 } |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1034 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1035 // 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
|
1036 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
|
1037 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1038 // 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
|
1039 // 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
|
1040 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
|
1041 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
|
1042 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1043 // 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
|
1044 // 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
|
1045 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
|
1046 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1047 private: |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1048 // 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
|
1049 // (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
|
1050 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
|
1051 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1052 public: |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1053 // 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
|
1054 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
|
1055 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1056 // 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
|
1057 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
|
1058 |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1059 #ifndef PRODUCT |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1060 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
|
1061 #endif // !PRODUCT |
|
1316cec51b4d
6819061: G1: eliminate serial Other times that are proportional to the collection set length
johnc
parents:
1359
diff
changeset
|
1062 |
|
1359
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1356
diff
changeset
|
1063 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
|
1064 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
|
1065 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
|
1066 |
|
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1356
diff
changeset
|
1067 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
|
1068 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
|
1069 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
|
1070 |
|
1656
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
1071 // 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
|
1072 // 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
|
1073 // 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
|
1074 // progress or not is stable. |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
1075 bool force_initial_mark_if_outside_cycle(); |
|
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
1076 |
|
1359
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1356
diff
changeset
|
1077 // 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
|
1078 // 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
|
1079 // 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
|
1080 // 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
|
1081 // 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
|
1082 // the initial-mark work and start a marking cycle. |
|
23b1b27ac76c
6909756: G1: guarantee(G1CollectedHeap::heap()->mark_in_progress(),"Precondition.")
tonyp
parents:
1356
diff
changeset
|
1083 void decide_on_conc_mark_initiation(); |
| 342 | 1084 |
| 1085 // If an expansion would be appropriate, because recent GC overhead had | |
| 1086 // exceeded the desired limit, return an amount to expand by. | |
| 1087 virtual size_t expansion_amount(); | |
| 1088 | |
| 1089 // note start of mark thread | |
| 1090 void note_start_of_mark_thread(); | |
| 1091 | |
| 1092 // The marked bytes of the "r" has changed; reclassify it's desirability | |
| 1093 // for marking. Also asserts that "r" is eligible for a CS. | |
| 1094 virtual void note_change_in_marked_bytes(HeapRegion* r) = 0; | |
| 1095 | |
| 1096 #ifndef PRODUCT | |
| 1097 // Check any appropriate marked bytes info, asserting false if | |
| 1098 // something's wrong, else returning "true". | |
| 1099 virtual bool assertMarkedBytesDataOK() = 0; | |
| 1100 #endif | |
| 1101 | |
| 1102 // Print tracing information. | |
| 1103 void print_tracing_info() const; | |
| 1104 | |
| 1105 // Print stats on young survival ratio | |
| 1106 void print_yg_surv_rate_info() const; | |
| 1107 | |
| 545 | 1108 void finished_recalculating_age_indexes(bool is_survivors) { |
| 1109 if (is_survivors) { | |
| 1110 _survivor_surv_rate_group->finished_recalculating_age_indexes(); | |
| 1111 } else { | |
| 1112 _short_lived_surv_rate_group->finished_recalculating_age_indexes(); | |
| 1113 } | |
| 342 | 1114 // do that for any other surv rate groups |
| 1115 } | |
| 1116 | |
| 1117 bool should_add_next_region_to_young_list(); | |
| 1118 | |
| 1119 bool in_young_gc_mode() { | |
| 1120 return _in_young_gc_mode; | |
| 1121 } | |
| 1122 void set_in_young_gc_mode(bool in_young_gc_mode) { | |
| 1123 _in_young_gc_mode = in_young_gc_mode; | |
| 1124 } | |
| 1125 | |
| 1126 bool full_young_gcs() { | |
| 1127 return _full_young_gcs; | |
| 1128 } | |
| 1129 void set_full_young_gcs(bool full_young_gcs) { | |
| 1130 _full_young_gcs = full_young_gcs; | |
| 1131 } | |
| 1132 | |
| 1133 bool adaptive_young_list_length() { | |
| 1134 return _adaptive_young_list_length; | |
| 1135 } | |
| 1136 void set_adaptive_young_list_length(bool adaptive_young_list_length) { | |
| 1137 _adaptive_young_list_length = adaptive_young_list_length; | |
| 1138 } | |
| 1139 | |
| 1140 inline double get_gc_eff_factor() { | |
| 1141 double ratio = _known_garbage_ratio; | |
| 1142 | |
| 1143 double square = ratio * ratio; | |
| 1144 // square = square * square; | |
| 1145 double ret = square * 9.0 + 1.0; | |
| 1146 #if 0 | |
| 1147 gclog_or_tty->print_cr("ratio = %1.2lf, ret = %1.2lf", ratio, ret); | |
| 1148 #endif // 0 | |
| 1149 guarantee(0.0 <= ret && ret < 10.0, "invariant!"); | |
| 1150 return ret; | |
| 1151 } | |
| 1152 | |
| 1153 // | |
| 1154 // Survivor regions policy. | |
| 1155 // | |
| 1156 protected: | |
| 1157 | |
| 1158 // Current tenuring threshold, set to 0 if the collector reaches the | |
| 1159 // maximum amount of suvivors regions. | |
| 1160 int _tenuring_threshold; | |
| 1161 | |
| 545 | 1162 // The limit on the number of regions allocated for survivors. |
| 1163 size_t _max_survivor_regions; | |
| 1164 | |
| 1165 // The amount of survor regions after a collection. | |
| 1166 size_t _recorded_survivor_regions; | |
| 1167 // List of survivor regions. | |
| 1168 HeapRegion* _recorded_survivor_head; | |
| 1169 HeapRegion* _recorded_survivor_tail; | |
| 1170 | |
| 1171 ageTable _survivors_age_table; | |
| 1172 | |
| 342 | 1173 public: |
| 1174 | |
| 1175 inline GCAllocPurpose | |
| 1176 evacuation_destination(HeapRegion* src_region, int age, size_t word_sz) { | |
| 1177 if (age < _tenuring_threshold && src_region->is_young()) { | |
| 1178 return GCAllocForSurvived; | |
| 1179 } else { | |
| 1180 return GCAllocForTenured; | |
| 1181 } | |
| 1182 } | |
| 1183 | |
| 1184 inline bool track_object_age(GCAllocPurpose purpose) { | |
| 1185 return purpose == GCAllocForSurvived; | |
| 1186 } | |
| 1187 | |
| 1188 inline GCAllocPurpose alternative_purpose(int purpose) { | |
| 1189 return GCAllocForTenured; | |
| 1190 } | |
| 1191 | |
| 545 | 1192 static const size_t REGIONS_UNLIMITED = ~(size_t)0; |
| 1193 | |
| 1194 size_t max_regions(int purpose); | |
| 342 | 1195 |
| 1196 // The limit on regions for a particular purpose is reached. | |
| 1197 void note_alloc_region_limit_reached(int purpose) { | |
| 1198 if (purpose == GCAllocForSurvived) { | |
| 1199 _tenuring_threshold = 0; | |
| 1200 } | |
| 1201 } | |
| 1202 | |
| 1203 void note_start_adding_survivor_regions() { | |
| 1204 _survivor_surv_rate_group->start_adding_regions(); | |
| 1205 } | |
| 1206 | |
| 1207 void note_stop_adding_survivor_regions() { | |
| 1208 _survivor_surv_rate_group->stop_adding_regions(); | |
| 1209 } | |
| 545 | 1210 |
| 1211 void record_survivor_regions(size_t regions, | |
| 1212 HeapRegion* head, | |
| 1213 HeapRegion* tail) { | |
| 1214 _recorded_survivor_regions = regions; | |
| 1215 _recorded_survivor_head = head; | |
| 1216 _recorded_survivor_tail = tail; | |
| 1217 } | |
| 1218 | |
|
838
0316eac49d5a
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
tonyp
parents:
794
diff
changeset
|
1219 size_t recorded_survivor_regions() { |
|
0316eac49d5a
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
tonyp
parents:
794
diff
changeset
|
1220 return _recorded_survivor_regions; |
|
0316eac49d5a
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
tonyp
parents:
794
diff
changeset
|
1221 } |
|
0316eac49d5a
6855834: G1: minimize the output when -XX:+PrintHeapAtGC is set
tonyp
parents:
794
diff
changeset
|
1222 |
| 545 | 1223 void record_thread_age_table(ageTable* age_table) |
| 1224 { | |
| 1225 _survivors_age_table.merge_par(age_table); | |
| 1226 } | |
| 1227 | |
| 1228 // Calculates survivor space parameters. | |
| 1229 void calculate_survivors_policy(); | |
| 1230 | |
| 342 | 1231 }; |
| 1232 | |
| 1233 // This encapsulates a particular strategy for a g1 Collector. | |
| 1234 // | |
| 1235 // Start a concurrent mark when our heap size is n bytes | |
| 1236 // greater then our heap size was at the last concurrent | |
| 1237 // mark. Where n is a function of the CMSTriggerRatio | |
| 1238 // and the MinHeapFreeRatio. | |
| 1239 // | |
| 1240 // Start a g1 collection pause when we have allocated the | |
| 1241 // average number of bytes currently being freed in | |
| 1242 // a collection, but only if it is at least one region | |
| 1243 // full | |
| 1244 // | |
| 1245 // Resize Heap based on desired | |
| 1246 // allocation space, where desired allocation space is | |
| 1247 // a function of survival rate and desired future to size. | |
| 1248 // | |
| 1249 // Choose collection set by first picking all older regions | |
| 1250 // which have a survival rate which beats our projected young | |
| 1251 // survival rate. Then fill out the number of needed regions | |
| 1252 // with young regions. | |
| 1253 | |
| 1254 class G1CollectorPolicy_BestRegionsFirst: public G1CollectorPolicy { | |
| 1255 CollectionSetChooser* _collectionSetChooser; | |
| 1256 // If the estimated is less then desirable, resize if possible. | |
| 1257 void expand_if_possible(size_t numRegions); | |
| 1258 | |
|
1656
4e5661ba9d98
6944166: G1: explicit GCs are not always handled correctly
tonyp
parents:
1611
diff
changeset
|
1259 virtual bool choose_collection_set(double target_pause_time_ms); |
| 342 | 1260 virtual void record_collection_pause_start(double start_time_sec, |
| 1261 size_t start_used); | |
| 1262 virtual void record_concurrent_mark_cleanup_end(size_t freed_bytes, | |
| 1263 size_t max_live_bytes); | |
| 1264 virtual void record_full_collection_end(); | |
| 1265 | |
| 1266 public: | |
| 1267 G1CollectorPolicy_BestRegionsFirst() { | |
| 1268 _collectionSetChooser = new CollectionSetChooser(); | |
| 1269 } | |
| 677 | 1270 void record_collection_pause_end(bool abandoned); |
| 342 | 1271 bool should_do_collection_pause(size_t word_size); |
| 1272 // This is not needed any more, after the CSet choosing code was | |
| 1273 // changed to use the pause prediction work. But let's leave the | |
| 1274 // hook in just in case. | |
| 1275 void note_change_in_marked_bytes(HeapRegion* r) { } | |
| 1276 #ifndef PRODUCT | |
| 1277 bool assertMarkedBytesDataOK(); | |
| 1278 #endif | |
| 1279 }; | |
| 1280 | |
| 1281 // This should move to some place more general... | |
| 1282 | |
| 1283 // If we have "n" measurements, and we've kept track of their "sum" and the | |
| 1284 // "sum_of_squares" of the measurements, this returns the variance of the | |
| 1285 // sequence. | |
| 1286 inline double variance(int n, double sum_of_squares, double sum) { | |
| 1287 double n_d = (double)n; | |
| 1288 double avg = sum/n_d; | |
| 1289 return (sum_of_squares - 2.0 * avg * sum + n_d * avg * avg) / n_d; | |
| 1290 } | |
| 1291 | |
| 1292 // Local Variables: *** | |
| 1293 // c-indentation-style: gnu *** | |
| 1294 // End: *** |