Mon, 23 Jan 2012 20:36:16 +0100
7132311: G1: assert((s == klass->oop_size(this)) || (Universe::heap()->is_gc_active() && ((is_typeArray()...
Summary: Move the check for when to call collect() to before we do a humongous object allocation
Reviewed-by: stefank, tonyp
ysr@777 | 1 | /* |
tonyp@3416 | 2 | * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved. |
ysr@777 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
ysr@777 | 4 | * |
ysr@777 | 5 | * This code is free software; you can redistribute it and/or modify it |
ysr@777 | 6 | * under the terms of the GNU General Public License version 2 only, as |
ysr@777 | 7 | * published by the Free Software Foundation. |
ysr@777 | 8 | * |
ysr@777 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
ysr@777 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
ysr@777 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
ysr@777 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
ysr@777 | 13 | * accompanied this code). |
ysr@777 | 14 | * |
ysr@777 | 15 | * You should have received a copy of the GNU General Public License version |
ysr@777 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
ysr@777 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
ysr@777 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
ysr@777 | 22 | * |
ysr@777 | 23 | */ |
ysr@777 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "gc_implementation/g1/concurrentG1Refine.hpp" |
stefank@2314 | 27 | #include "gc_implementation/g1/concurrentMark.hpp" |
stefank@2314 | 28 | #include "gc_implementation/g1/concurrentMarkThread.inline.hpp" |
stefank@2314 | 29 | #include "gc_implementation/g1/g1CollectedHeap.inline.hpp" |
stefank@2314 | 30 | #include "gc_implementation/g1/g1CollectorPolicy.hpp" |
tonyp@3114 | 31 | #include "gc_implementation/g1/g1ErgoVerbose.hpp" |
stefank@2314 | 32 | #include "gc_implementation/g1/heapRegionRemSet.hpp" |
stefank@2314 | 33 | #include "gc_implementation/shared/gcPolicyCounters.hpp" |
stefank@2314 | 34 | #include "runtime/arguments.hpp" |
stefank@2314 | 35 | #include "runtime/java.hpp" |
stefank@2314 | 36 | #include "runtime/mutexLocker.hpp" |
stefank@2314 | 37 | #include "utilities/debug.hpp" |
ysr@777 | 38 | |
ysr@777 | 39 | // Different defaults for different number of GC threads |
ysr@777 | 40 | // They were chosen by running GCOld and SPECjbb on debris with different |
ysr@777 | 41 | // numbers of GC threads and choosing them based on the results |
ysr@777 | 42 | |
ysr@777 | 43 | // all the same |
ysr@777 | 44 | static double rs_length_diff_defaults[] = { |
ysr@777 | 45 | 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 |
ysr@777 | 46 | }; |
ysr@777 | 47 | |
ysr@777 | 48 | static double cost_per_card_ms_defaults[] = { |
ysr@777 | 49 | 0.01, 0.005, 0.005, 0.003, 0.003, 0.002, 0.002, 0.0015 |
ysr@777 | 50 | }; |
ysr@777 | 51 | |
ysr@777 | 52 | // all the same |
tonyp@3337 | 53 | static double young_cards_per_entry_ratio_defaults[] = { |
ysr@777 | 54 | 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 |
ysr@777 | 55 | }; |
ysr@777 | 56 | |
ysr@777 | 57 | static double cost_per_entry_ms_defaults[] = { |
ysr@777 | 58 | 0.015, 0.01, 0.01, 0.008, 0.008, 0.0055, 0.0055, 0.005 |
ysr@777 | 59 | }; |
ysr@777 | 60 | |
ysr@777 | 61 | static double cost_per_byte_ms_defaults[] = { |
ysr@777 | 62 | 0.00006, 0.00003, 0.00003, 0.000015, 0.000015, 0.00001, 0.00001, 0.000009 |
ysr@777 | 63 | }; |
ysr@777 | 64 | |
ysr@777 | 65 | // these should be pretty consistent |
ysr@777 | 66 | static double constant_other_time_ms_defaults[] = { |
ysr@777 | 67 | 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0 |
ysr@777 | 68 | }; |
ysr@777 | 69 | |
ysr@777 | 70 | |
ysr@777 | 71 | static double young_other_cost_per_region_ms_defaults[] = { |
ysr@777 | 72 | 0.3, 0.2, 0.2, 0.15, 0.15, 0.12, 0.12, 0.1 |
ysr@777 | 73 | }; |
ysr@777 | 74 | |
ysr@777 | 75 | static double non_young_other_cost_per_region_ms_defaults[] = { |
ysr@777 | 76 | 1.0, 0.7, 0.7, 0.5, 0.5, 0.42, 0.42, 0.30 |
ysr@777 | 77 | }; |
ysr@777 | 78 | |
brutisso@2645 | 79 | // Help class for avoiding interleaved logging |
brutisso@2645 | 80 | class LineBuffer: public StackObj { |
brutisso@2645 | 81 | |
brutisso@2645 | 82 | private: |
brutisso@2645 | 83 | static const int BUFFER_LEN = 1024; |
brutisso@2645 | 84 | static const int INDENT_CHARS = 3; |
brutisso@2645 | 85 | char _buffer[BUFFER_LEN]; |
brutisso@2645 | 86 | int _indent_level; |
brutisso@2645 | 87 | int _cur; |
brutisso@2645 | 88 | |
brutisso@2645 | 89 | void vappend(const char* format, va_list ap) { |
brutisso@2645 | 90 | int res = vsnprintf(&_buffer[_cur], BUFFER_LEN - _cur, format, ap); |
brutisso@2645 | 91 | if (res != -1) { |
brutisso@2645 | 92 | _cur += res; |
brutisso@2645 | 93 | } else { |
brutisso@2645 | 94 | DEBUG_ONLY(warning("buffer too small in LineBuffer");) |
brutisso@2645 | 95 | _buffer[BUFFER_LEN -1] = 0; |
brutisso@2645 | 96 | _cur = BUFFER_LEN; // vsnprintf above should not add to _buffer if we are called again |
brutisso@2645 | 97 | } |
brutisso@2645 | 98 | } |
brutisso@2645 | 99 | |
brutisso@2645 | 100 | public: |
brutisso@2645 | 101 | explicit LineBuffer(int indent_level): _indent_level(indent_level), _cur(0) { |
brutisso@2645 | 102 | for (; (_cur < BUFFER_LEN && _cur < (_indent_level * INDENT_CHARS)); _cur++) { |
brutisso@2645 | 103 | _buffer[_cur] = ' '; |
brutisso@2645 | 104 | } |
brutisso@2645 | 105 | } |
brutisso@2645 | 106 | |
brutisso@2645 | 107 | #ifndef PRODUCT |
brutisso@2645 | 108 | ~LineBuffer() { |
brutisso@2645 | 109 | assert(_cur == _indent_level * INDENT_CHARS, "pending data in buffer - append_and_print_cr() not called?"); |
brutisso@2645 | 110 | } |
brutisso@2645 | 111 | #endif |
brutisso@2645 | 112 | |
brutisso@2645 | 113 | void append(const char* format, ...) { |
brutisso@2645 | 114 | va_list ap; |
brutisso@2645 | 115 | va_start(ap, format); |
brutisso@2645 | 116 | vappend(format, ap); |
brutisso@2645 | 117 | va_end(ap); |
brutisso@2645 | 118 | } |
brutisso@2645 | 119 | |
brutisso@2645 | 120 | void append_and_print_cr(const char* format, ...) { |
brutisso@2645 | 121 | va_list ap; |
brutisso@2645 | 122 | va_start(ap, format); |
brutisso@2645 | 123 | vappend(format, ap); |
brutisso@2645 | 124 | va_end(ap); |
brutisso@2645 | 125 | gclog_or_tty->print_cr("%s", _buffer); |
brutisso@2645 | 126 | _cur = _indent_level * INDENT_CHARS; |
brutisso@2645 | 127 | } |
brutisso@2645 | 128 | }; |
brutisso@2645 | 129 | |
ysr@777 | 130 | G1CollectorPolicy::G1CollectorPolicy() : |
jmasa@2188 | 131 | _parallel_gc_threads(G1CollectedHeap::use_parallel_gc_threads() |
johnc@3021 | 132 | ? ParallelGCThreads : 1), |
jmasa@2188 | 133 | |
ysr@777 | 134 | _recent_gc_times_ms(new TruncatedSeq(NumPrevPausesForHeuristics)), |
ysr@777 | 135 | _all_pause_times_ms(new NumberSeq()), |
ysr@777 | 136 | _stop_world_start(0.0), |
ysr@777 | 137 | _all_stop_world_times_ms(new NumberSeq()), |
ysr@777 | 138 | _all_yield_times_ms(new NumberSeq()), |
ysr@777 | 139 | |
apetrusenko@1112 | 140 | _summary(new Summary()), |
ysr@777 | 141 | |
johnc@3175 | 142 | _cur_clear_ct_time_ms(0.0), |
johnc@3296 | 143 | _mark_closure_time_ms(0.0), |
johnc@3175 | 144 | |
johnc@3175 | 145 | _cur_ref_proc_time_ms(0.0), |
johnc@3175 | 146 | _cur_ref_enq_time_ms(0.0), |
johnc@3175 | 147 | |
johnc@1325 | 148 | #ifndef PRODUCT |
johnc@1325 | 149 | _min_clear_cc_time_ms(-1.0), |
johnc@1325 | 150 | _max_clear_cc_time_ms(-1.0), |
johnc@1325 | 151 | _cur_clear_cc_time_ms(0.0), |
johnc@1325 | 152 | _cum_clear_cc_time_ms(0.0), |
johnc@1325 | 153 | _num_cc_clears(0L), |
johnc@1325 | 154 | #endif |
ysr@777 | 155 | |
ysr@777 | 156 | _aux_num(10), |
ysr@777 | 157 | _all_aux_times_ms(new NumberSeq[_aux_num]), |
ysr@777 | 158 | _cur_aux_start_times_ms(new double[_aux_num]), |
ysr@777 | 159 | _cur_aux_times_ms(new double[_aux_num]), |
ysr@777 | 160 | _cur_aux_times_set(new bool[_aux_num]), |
ysr@777 | 161 | |
ysr@777 | 162 | _concurrent_mark_remark_times_ms(new TruncatedSeq(NumPrevPausesForHeuristics)), |
ysr@777 | 163 | _concurrent_mark_cleanup_times_ms(new TruncatedSeq(NumPrevPausesForHeuristics)), |
ysr@777 | 164 | |
ysr@777 | 165 | _alloc_rate_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 166 | _prev_collection_pause_end_ms(0.0), |
ysr@777 | 167 | _pending_card_diff_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 168 | _rs_length_diff_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 169 | _cost_per_card_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
tonyp@3337 | 170 | _young_cards_per_entry_ratio_seq(new TruncatedSeq(TruncatedSeqLength)), |
tonyp@3337 | 171 | _mixed_cards_per_entry_ratio_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 172 | _cost_per_entry_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
tonyp@3337 | 173 | _mixed_cost_per_entry_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 174 | _cost_per_byte_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 175 | _cost_per_byte_ms_during_cm_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 176 | _constant_other_time_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 177 | _young_other_cost_per_region_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 178 | _non_young_other_cost_per_region_ms_seq( |
ysr@777 | 179 | new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 180 | |
ysr@777 | 181 | _pending_cards_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 182 | _rs_lengths_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 183 | |
johnc@1186 | 184 | _pause_time_target_ms((double) MaxGCPauseMillis), |
ysr@777 | 185 | |
tonyp@3337 | 186 | _gcs_are_young(true), |
tonyp@3337 | 187 | _young_pause_num(0), |
tonyp@3337 | 188 | _mixed_pause_num(0), |
ysr@777 | 189 | |
ysr@777 | 190 | _during_marking(false), |
ysr@777 | 191 | _in_marking_window(false), |
ysr@777 | 192 | _in_marking_window_im(false), |
ysr@777 | 193 | |
ysr@777 | 194 | _known_garbage_ratio(0.0), |
ysr@777 | 195 | _known_garbage_bytes(0), |
ysr@777 | 196 | |
ysr@777 | 197 | _young_gc_eff_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 198 | |
tonyp@3337 | 199 | _recent_prev_end_times_for_all_gcs_sec( |
tonyp@3337 | 200 | new TruncatedSeq(NumPrevPausesForHeuristics)), |
ysr@777 | 201 | |
ysr@777 | 202 | _recent_avg_pause_time_ratio(0.0), |
ysr@777 | 203 | |
ysr@777 | 204 | _all_full_gc_times_ms(new NumberSeq()), |
ysr@777 | 205 | |
tonyp@1794 | 206 | _initiate_conc_mark_if_possible(false), |
tonyp@1794 | 207 | _during_initial_mark_pause(false), |
tonyp@3337 | 208 | _should_revert_to_young_gcs(false), |
tonyp@3337 | 209 | _last_young_gc(false), |
tonyp@3337 | 210 | _last_gc_was_young(false), |
ysr@777 | 211 | |
tonyp@2961 | 212 | _eden_bytes_before_gc(0), |
tonyp@2961 | 213 | _survivor_bytes_before_gc(0), |
tonyp@2961 | 214 | _capacity_before_gc(0), |
tonyp@2961 | 215 | |
tonyp@3289 | 216 | _eden_cset_region_length(0), |
tonyp@3289 | 217 | _survivor_cset_region_length(0), |
tonyp@3289 | 218 | _old_cset_region_length(0), |
tonyp@3289 | 219 | |
ysr@777 | 220 | _collection_set(NULL), |
johnc@1829 | 221 | _collection_set_bytes_used_before(0), |
johnc@1829 | 222 | |
johnc@1829 | 223 | // Incremental CSet attributes |
johnc@1829 | 224 | _inc_cset_build_state(Inactive), |
johnc@1829 | 225 | _inc_cset_head(NULL), |
johnc@1829 | 226 | _inc_cset_tail(NULL), |
johnc@1829 | 227 | _inc_cset_bytes_used_before(0), |
johnc@1829 | 228 | _inc_cset_max_finger(NULL), |
johnc@1829 | 229 | _inc_cset_recorded_rs_lengths(0), |
tonyp@3356 | 230 | _inc_cset_recorded_rs_lengths_diffs(0), |
johnc@1829 | 231 | _inc_cset_predicted_elapsed_time_ms(0.0), |
tonyp@3356 | 232 | _inc_cset_predicted_elapsed_time_ms_diffs(0.0), |
johnc@1829 | 233 | |
ysr@777 | 234 | #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away |
ysr@777 | 235 | #pragma warning( disable:4355 ) // 'this' : used in base member initializer list |
ysr@777 | 236 | #endif // _MSC_VER |
ysr@777 | 237 | |
ysr@777 | 238 | _short_lived_surv_rate_group(new SurvRateGroup(this, "Short Lived", |
ysr@777 | 239 | G1YoungSurvRateNumRegionsSummary)), |
ysr@777 | 240 | _survivor_surv_rate_group(new SurvRateGroup(this, "Survivor", |
apetrusenko@980 | 241 | G1YoungSurvRateNumRegionsSummary)), |
ysr@777 | 242 | // add here any more surv rate groups |
apetrusenko@980 | 243 | _recorded_survivor_regions(0), |
apetrusenko@980 | 244 | _recorded_survivor_head(NULL), |
apetrusenko@980 | 245 | _recorded_survivor_tail(NULL), |
tonyp@1791 | 246 | _survivors_age_table(true), |
tonyp@1791 | 247 | |
tonyp@3114 | 248 | _gc_overhead_perc(0.0) { |
tonyp@3114 | 249 | |
tonyp@1377 | 250 | // Set up the region size and associated fields. Given that the |
tonyp@1377 | 251 | // policy is created before the heap, we have to set this up here, |
tonyp@1377 | 252 | // so it's done as soon as possible. |
tonyp@1377 | 253 | HeapRegion::setup_heap_region_size(Arguments::min_heap_size()); |
iveresov@1696 | 254 | HeapRegionRemSet::setup_remset_size(); |
tonyp@1377 | 255 | |
tonyp@3114 | 256 | G1ErgoVerbose::initialize(); |
tonyp@3114 | 257 | if (PrintAdaptiveSizePolicy) { |
tonyp@3114 | 258 | // Currently, we only use a single switch for all the heuristics. |
tonyp@3114 | 259 | G1ErgoVerbose::set_enabled(true); |
tonyp@3114 | 260 | // Given that we don't currently have a verboseness level |
tonyp@3114 | 261 | // parameter, we'll hardcode this to high. This can be easily |
tonyp@3114 | 262 | // changed in the future. |
tonyp@3114 | 263 | G1ErgoVerbose::set_level(ErgoHigh); |
tonyp@3114 | 264 | } else { |
tonyp@3114 | 265 | G1ErgoVerbose::set_enabled(false); |
tonyp@3114 | 266 | } |
tonyp@3114 | 267 | |
apetrusenko@1826 | 268 | // Verify PLAB sizes |
johnc@3182 | 269 | const size_t region_size = HeapRegion::GrainWords; |
apetrusenko@1826 | 270 | if (YoungPLABSize > region_size || OldPLABSize > region_size) { |
apetrusenko@1826 | 271 | char buffer[128]; |
johnc@3182 | 272 | jio_snprintf(buffer, sizeof(buffer), "%sPLABSize should be at most "SIZE_FORMAT, |
apetrusenko@1826 | 273 | OldPLABSize > region_size ? "Old" : "Young", region_size); |
apetrusenko@1826 | 274 | vm_exit_during_initialization(buffer); |
apetrusenko@1826 | 275 | } |
apetrusenko@1826 | 276 | |
ysr@777 | 277 | _recent_prev_end_times_for_all_gcs_sec->add(os::elapsedTime()); |
ysr@777 | 278 | _prev_collection_pause_end_ms = os::elapsedTime() * 1000.0; |
ysr@777 | 279 | |
tonyp@1966 | 280 | _par_last_gc_worker_start_times_ms = new double[_parallel_gc_threads]; |
ysr@777 | 281 | _par_last_ext_root_scan_times_ms = new double[_parallel_gc_threads]; |
tonyp@3416 | 282 | _par_last_satb_filtering_times_ms = new double[_parallel_gc_threads]; |
ysr@777 | 283 | |
ysr@777 | 284 | _par_last_update_rs_times_ms = new double[_parallel_gc_threads]; |
ysr@777 | 285 | _par_last_update_rs_processed_buffers = new double[_parallel_gc_threads]; |
ysr@777 | 286 | |
ysr@777 | 287 | _par_last_scan_rs_times_ms = new double[_parallel_gc_threads]; |
ysr@777 | 288 | |
ysr@777 | 289 | _par_last_obj_copy_times_ms = new double[_parallel_gc_threads]; |
ysr@777 | 290 | |
ysr@777 | 291 | _par_last_termination_times_ms = new double[_parallel_gc_threads]; |
tonyp@1966 | 292 | _par_last_termination_attempts = new double[_parallel_gc_threads]; |
tonyp@1966 | 293 | _par_last_gc_worker_end_times_ms = new double[_parallel_gc_threads]; |
brutisso@2712 | 294 | _par_last_gc_worker_times_ms = new double[_parallel_gc_threads]; |
johnc@3219 | 295 | _par_last_gc_worker_other_times_ms = new double[_parallel_gc_threads]; |
ysr@777 | 296 | |
ysr@777 | 297 | // start conservatively |
johnc@1186 | 298 | _expensive_region_limit_ms = 0.5 * (double) MaxGCPauseMillis; |
ysr@777 | 299 | |
ysr@777 | 300 | int index; |
ysr@777 | 301 | if (ParallelGCThreads == 0) |
ysr@777 | 302 | index = 0; |
ysr@777 | 303 | else if (ParallelGCThreads > 8) |
ysr@777 | 304 | index = 7; |
ysr@777 | 305 | else |
ysr@777 | 306 | index = ParallelGCThreads - 1; |
ysr@777 | 307 | |
ysr@777 | 308 | _pending_card_diff_seq->add(0.0); |
ysr@777 | 309 | _rs_length_diff_seq->add(rs_length_diff_defaults[index]); |
ysr@777 | 310 | _cost_per_card_ms_seq->add(cost_per_card_ms_defaults[index]); |
tonyp@3337 | 311 | _young_cards_per_entry_ratio_seq->add( |
tonyp@3337 | 312 | young_cards_per_entry_ratio_defaults[index]); |
ysr@777 | 313 | _cost_per_entry_ms_seq->add(cost_per_entry_ms_defaults[index]); |
ysr@777 | 314 | _cost_per_byte_ms_seq->add(cost_per_byte_ms_defaults[index]); |
ysr@777 | 315 | _constant_other_time_ms_seq->add(constant_other_time_ms_defaults[index]); |
ysr@777 | 316 | _young_other_cost_per_region_ms_seq->add( |
ysr@777 | 317 | young_other_cost_per_region_ms_defaults[index]); |
ysr@777 | 318 | _non_young_other_cost_per_region_ms_seq->add( |
ysr@777 | 319 | non_young_other_cost_per_region_ms_defaults[index]); |
ysr@777 | 320 | |
tonyp@1965 | 321 | // Below, we might need to calculate the pause time target based on |
tonyp@1965 | 322 | // the pause interval. When we do so we are going to give G1 maximum |
tonyp@1965 | 323 | // flexibility and allow it to do pauses when it needs to. So, we'll |
tonyp@1965 | 324 | // arrange that the pause interval to be pause time target + 1 to |
tonyp@1965 | 325 | // ensure that a) the pause time target is maximized with respect to |
tonyp@1965 | 326 | // the pause interval and b) we maintain the invariant that pause |
tonyp@1965 | 327 | // time target < pause interval. If the user does not want this |
tonyp@1965 | 328 | // maximum flexibility, they will have to set the pause interval |
tonyp@1965 | 329 | // explicitly. |
tonyp@1965 | 330 | |
tonyp@1965 | 331 | // First make sure that, if either parameter is set, its value is |
tonyp@1965 | 332 | // reasonable. |
tonyp@1965 | 333 | if (!FLAG_IS_DEFAULT(MaxGCPauseMillis)) { |
tonyp@1965 | 334 | if (MaxGCPauseMillis < 1) { |
tonyp@1965 | 335 | vm_exit_during_initialization("MaxGCPauseMillis should be " |
tonyp@1965 | 336 | "greater than 0"); |
tonyp@1965 | 337 | } |
tonyp@1965 | 338 | } |
tonyp@1965 | 339 | if (!FLAG_IS_DEFAULT(GCPauseIntervalMillis)) { |
tonyp@1965 | 340 | if (GCPauseIntervalMillis < 1) { |
tonyp@1965 | 341 | vm_exit_during_initialization("GCPauseIntervalMillis should be " |
tonyp@1965 | 342 | "greater than 0"); |
tonyp@1965 | 343 | } |
tonyp@1965 | 344 | } |
tonyp@1965 | 345 | |
tonyp@1965 | 346 | // Then, if the pause time target parameter was not set, set it to |
tonyp@1965 | 347 | // the default value. |
tonyp@1965 | 348 | if (FLAG_IS_DEFAULT(MaxGCPauseMillis)) { |
tonyp@1965 | 349 | if (FLAG_IS_DEFAULT(GCPauseIntervalMillis)) { |
tonyp@1965 | 350 | // The default pause time target in G1 is 200ms |
tonyp@1965 | 351 | FLAG_SET_DEFAULT(MaxGCPauseMillis, 200); |
tonyp@1965 | 352 | } else { |
tonyp@1965 | 353 | // We do not allow the pause interval to be set without the |
tonyp@1965 | 354 | // pause time target |
tonyp@1965 | 355 | vm_exit_during_initialization("GCPauseIntervalMillis cannot be set " |
tonyp@1965 | 356 | "without setting MaxGCPauseMillis"); |
tonyp@1965 | 357 | } |
tonyp@1965 | 358 | } |
tonyp@1965 | 359 | |
tonyp@1965 | 360 | // Then, if the interval parameter was not set, set it according to |
tonyp@1965 | 361 | // the pause time target (this will also deal with the case when the |
tonyp@1965 | 362 | // pause time target is the default value). |
tonyp@1965 | 363 | if (FLAG_IS_DEFAULT(GCPauseIntervalMillis)) { |
tonyp@1965 | 364 | FLAG_SET_DEFAULT(GCPauseIntervalMillis, MaxGCPauseMillis + 1); |
tonyp@1965 | 365 | } |
tonyp@1965 | 366 | |
tonyp@1965 | 367 | // Finally, make sure that the two parameters are consistent. |
tonyp@1965 | 368 | if (MaxGCPauseMillis >= GCPauseIntervalMillis) { |
tonyp@1965 | 369 | char buffer[256]; |
tonyp@1965 | 370 | jio_snprintf(buffer, 256, |
tonyp@1965 | 371 | "MaxGCPauseMillis (%u) should be less than " |
tonyp@1965 | 372 | "GCPauseIntervalMillis (%u)", |
tonyp@1965 | 373 | MaxGCPauseMillis, GCPauseIntervalMillis); |
tonyp@1965 | 374 | vm_exit_during_initialization(buffer); |
tonyp@1965 | 375 | } |
tonyp@1965 | 376 | |
tonyp@1965 | 377 | double max_gc_time = (double) MaxGCPauseMillis / 1000.0; |
johnc@1186 | 378 | double time_slice = (double) GCPauseIntervalMillis / 1000.0; |
ysr@777 | 379 | _mmu_tracker = new G1MMUTrackerQueue(time_slice, max_gc_time); |
johnc@1186 | 380 | _sigma = (double) G1ConfidencePercent / 100.0; |
ysr@777 | 381 | |
ysr@777 | 382 | // start conservatively (around 50ms is about right) |
ysr@777 | 383 | _concurrent_mark_remark_times_ms->add(0.05); |
ysr@777 | 384 | _concurrent_mark_cleanup_times_ms->add(0.20); |
ysr@777 | 385 | _tenuring_threshold = MaxTenuringThreshold; |
tonyp@3066 | 386 | // _max_survivor_regions will be calculated by |
tonyp@3119 | 387 | // update_young_list_target_length() during initialization. |
tonyp@3066 | 388 | _max_survivor_regions = 0; |
apetrusenko@980 | 389 | |
tonyp@1791 | 390 | assert(GCTimeRatio > 0, |
tonyp@1791 | 391 | "we should have set it to a default value set_g1_gc_flags() " |
tonyp@1791 | 392 | "if a user set it to 0"); |
tonyp@1791 | 393 | _gc_overhead_perc = 100.0 * (1.0 / (1.0 + GCTimeRatio)); |
tonyp@1791 | 394 | |
tonyp@3119 | 395 | uintx reserve_perc = G1ReservePercent; |
tonyp@3119 | 396 | // Put an artificial ceiling on this so that it's not set to a silly value. |
tonyp@3119 | 397 | if (reserve_perc > 50) { |
tonyp@3119 | 398 | reserve_perc = 50; |
tonyp@3119 | 399 | warning("G1ReservePercent is set to a value that is too large, " |
tonyp@3119 | 400 | "it's been updated to %u", reserve_perc); |
tonyp@3119 | 401 | } |
tonyp@3119 | 402 | _reserve_factor = (double) reserve_perc / 100.0; |
brutisso@3120 | 403 | // This will be set when the heap is expanded |
tonyp@3119 | 404 | // for the first time during initialization. |
tonyp@3119 | 405 | _reserve_regions = 0; |
tonyp@3119 | 406 | |
ysr@777 | 407 | initialize_all(); |
tonyp@3209 | 408 | _collectionSetChooser = new CollectionSetChooser(); |
brutisso@3358 | 409 | _young_gen_sizer = new G1YoungGenSizer(); // Must be after call to initialize_flags |
ysr@777 | 410 | } |
ysr@777 | 411 | |
ysr@777 | 412 | void G1CollectorPolicy::initialize_flags() { |
ysr@777 | 413 | set_min_alignment(HeapRegion::GrainBytes); |
ysr@777 | 414 | set_max_alignment(GenRemSet::max_alignment_constraint(rem_set_name())); |
apetrusenko@982 | 415 | if (SurvivorRatio < 1) { |
apetrusenko@982 | 416 | vm_exit_during_initialization("Invalid survivor ratio specified"); |
apetrusenko@982 | 417 | } |
ysr@777 | 418 | CollectorPolicy::initialize_flags(); |
ysr@777 | 419 | } |
ysr@777 | 420 | |
brutisso@3358 | 421 | G1YoungGenSizer::G1YoungGenSizer() : _sizer_kind(SizerDefaults), _adaptive_size(true) { |
brutisso@3358 | 422 | assert(G1DefaultMinNewGenPercent <= G1DefaultMaxNewGenPercent, "Min larger than max"); |
brutisso@3358 | 423 | assert(G1DefaultMinNewGenPercent > 0 && G1DefaultMinNewGenPercent < 100, "Min out of bounds"); |
brutisso@3358 | 424 | assert(G1DefaultMaxNewGenPercent > 0 && G1DefaultMaxNewGenPercent < 100, "Max out of bounds"); |
brutisso@3120 | 425 | |
brutisso@3120 | 426 | if (FLAG_IS_CMDLINE(NewRatio)) { |
brutisso@3120 | 427 | if (FLAG_IS_CMDLINE(NewSize) || FLAG_IS_CMDLINE(MaxNewSize)) { |
tonyp@3172 | 428 | warning("-XX:NewSize and -XX:MaxNewSize override -XX:NewRatio"); |
brutisso@3120 | 429 | } else { |
brutisso@3358 | 430 | _sizer_kind = SizerNewRatio; |
brutisso@3358 | 431 | _adaptive_size = false; |
brutisso@3358 | 432 | return; |
brutisso@3120 | 433 | } |
brutisso@3120 | 434 | } |
brutisso@3120 | 435 | |
brutisso@3358 | 436 | if (FLAG_IS_CMDLINE(NewSize)) { |
brutisso@3358 | 437 | _min_desired_young_length = MAX2((size_t) 1, NewSize / HeapRegion::GrainBytes); |
brutisso@3358 | 438 | if (FLAG_IS_CMDLINE(MaxNewSize)) { |
brutisso@3358 | 439 | _max_desired_young_length = MAX2((size_t) 1, MaxNewSize / HeapRegion::GrainBytes); |
brutisso@3358 | 440 | _sizer_kind = SizerMaxAndNewSize; |
brutisso@3358 | 441 | _adaptive_size = _min_desired_young_length == _max_desired_young_length; |
brutisso@3358 | 442 | } else { |
brutisso@3358 | 443 | _sizer_kind = SizerNewSizeOnly; |
brutisso@3358 | 444 | } |
brutisso@3358 | 445 | } else if (FLAG_IS_CMDLINE(MaxNewSize)) { |
brutisso@3358 | 446 | _max_desired_young_length = MAX2((size_t) 1, MaxNewSize / HeapRegion::GrainBytes); |
brutisso@3358 | 447 | _sizer_kind = SizerMaxNewSizeOnly; |
brutisso@3358 | 448 | } |
brutisso@3358 | 449 | } |
brutisso@3358 | 450 | |
brutisso@3358 | 451 | size_t G1YoungGenSizer::calculate_default_min_length(size_t new_number_of_heap_regions) { |
brutisso@3358 | 452 | size_t default_value = (new_number_of_heap_regions * G1DefaultMinNewGenPercent) / 100; |
brutisso@3358 | 453 | return MAX2((size_t)1, default_value); |
brutisso@3358 | 454 | } |
brutisso@3358 | 455 | |
brutisso@3358 | 456 | size_t G1YoungGenSizer::calculate_default_max_length(size_t new_number_of_heap_regions) { |
brutisso@3358 | 457 | size_t default_value = (new_number_of_heap_regions * G1DefaultMaxNewGenPercent) / 100; |
brutisso@3358 | 458 | return MAX2((size_t)1, default_value); |
brutisso@3358 | 459 | } |
brutisso@3358 | 460 | |
brutisso@3358 | 461 | void G1YoungGenSizer::heap_size_changed(size_t new_number_of_heap_regions) { |
brutisso@3358 | 462 | assert(new_number_of_heap_regions > 0, "Heap must be initialized"); |
brutisso@3358 | 463 | |
brutisso@3358 | 464 | switch (_sizer_kind) { |
brutisso@3358 | 465 | case SizerDefaults: |
brutisso@3358 | 466 | _min_desired_young_length = calculate_default_min_length(new_number_of_heap_regions); |
brutisso@3358 | 467 | _max_desired_young_length = calculate_default_max_length(new_number_of_heap_regions); |
brutisso@3358 | 468 | break; |
brutisso@3358 | 469 | case SizerNewSizeOnly: |
brutisso@3358 | 470 | _max_desired_young_length = calculate_default_max_length(new_number_of_heap_regions); |
brutisso@3358 | 471 | _max_desired_young_length = MAX2(_min_desired_young_length, _max_desired_young_length); |
brutisso@3358 | 472 | break; |
brutisso@3358 | 473 | case SizerMaxNewSizeOnly: |
brutisso@3358 | 474 | _min_desired_young_length = calculate_default_min_length(new_number_of_heap_regions); |
brutisso@3358 | 475 | _min_desired_young_length = MIN2(_min_desired_young_length, _max_desired_young_length); |
brutisso@3358 | 476 | break; |
brutisso@3358 | 477 | case SizerMaxAndNewSize: |
brutisso@3358 | 478 | // Do nothing. Values set on the command line, don't update them at runtime. |
brutisso@3358 | 479 | break; |
brutisso@3358 | 480 | case SizerNewRatio: |
brutisso@3358 | 481 | _min_desired_young_length = new_number_of_heap_regions / (NewRatio + 1); |
brutisso@3358 | 482 | _max_desired_young_length = _min_desired_young_length; |
brutisso@3358 | 483 | break; |
brutisso@3358 | 484 | default: |
brutisso@3358 | 485 | ShouldNotReachHere(); |
brutisso@3358 | 486 | } |
brutisso@3358 | 487 | |
brutisso@3120 | 488 | assert(_min_desired_young_length <= _max_desired_young_length, "Invalid min/max young gen size values"); |
brutisso@3358 | 489 | } |
brutisso@3358 | 490 | |
brutisso@3358 | 491 | void G1CollectorPolicy::init() { |
brutisso@3358 | 492 | // Set aside an initial future to_space. |
brutisso@3358 | 493 | _g1 = G1CollectedHeap::heap(); |
brutisso@3358 | 494 | |
brutisso@3358 | 495 | assert(Heap_lock->owned_by_self(), "Locking discipline."); |
brutisso@3358 | 496 | |
brutisso@3358 | 497 | initialize_gc_policy_counters(); |
brutisso@3358 | 498 | |
brutisso@3120 | 499 | if (adaptive_young_list_length()) { |
brutisso@3065 | 500 | _young_list_fixed_length = 0; |
johnc@1829 | 501 | } else { |
brutisso@3358 | 502 | _young_list_fixed_length = _young_gen_sizer->min_desired_young_length(); |
ysr@777 | 503 | } |
brutisso@3065 | 504 | _free_regions_at_end_of_collection = _g1->free_regions(); |
tonyp@3119 | 505 | update_young_list_target_length(); |
brutisso@3120 | 506 | _prev_eden_capacity = _young_list_target_length * HeapRegion::GrainBytes; |
johnc@1829 | 507 | |
johnc@1829 | 508 | // We may immediately start allocating regions and placing them on the |
johnc@1829 | 509 | // collection set list. Initialize the per-collection set info |
johnc@1829 | 510 | start_incremental_cset_building(); |
ysr@777 | 511 | } |
ysr@777 | 512 | |
apetrusenko@980 | 513 | // Create the jstat counters for the policy. |
tonyp@3119 | 514 | void G1CollectorPolicy::initialize_gc_policy_counters() { |
brutisso@3065 | 515 | _gc_policy_counters = new GCPolicyCounters("GarbageFirst", 1, 3); |
apetrusenko@980 | 516 | } |
apetrusenko@980 | 517 | |
tonyp@3119 | 518 | bool G1CollectorPolicy::predict_will_fit(size_t young_length, |
tonyp@3119 | 519 | double base_time_ms, |
tonyp@3119 | 520 | size_t base_free_regions, |
tonyp@3119 | 521 | double target_pause_time_ms) { |
tonyp@3119 | 522 | if (young_length >= base_free_regions) { |
tonyp@3119 | 523 | // end condition 1: not enough space for the young regions |
tonyp@3119 | 524 | return false; |
ysr@777 | 525 | } |
tonyp@3119 | 526 | |
tonyp@3119 | 527 | double accum_surv_rate = accum_yg_surv_rate_pred((int)(young_length - 1)); |
tonyp@3119 | 528 | size_t bytes_to_copy = |
tonyp@3119 | 529 | (size_t) (accum_surv_rate * (double) HeapRegion::GrainBytes); |
tonyp@3119 | 530 | double copy_time_ms = predict_object_copy_time_ms(bytes_to_copy); |
tonyp@3119 | 531 | double young_other_time_ms = predict_young_other_time_ms(young_length); |
tonyp@3119 | 532 | double pause_time_ms = base_time_ms + copy_time_ms + young_other_time_ms; |
tonyp@3119 | 533 | if (pause_time_ms > target_pause_time_ms) { |
tonyp@3119 | 534 | // end condition 2: prediction is over the target pause time |
tonyp@3119 | 535 | return false; |
tonyp@3119 | 536 | } |
tonyp@3119 | 537 | |
tonyp@3119 | 538 | size_t free_bytes = |
tonyp@3119 | 539 | (base_free_regions - young_length) * HeapRegion::GrainBytes; |
tonyp@3119 | 540 | if ((2.0 * sigma()) * (double) bytes_to_copy > (double) free_bytes) { |
tonyp@3119 | 541 | // end condition 3: out-of-space (conservatively!) |
tonyp@3119 | 542 | return false; |
tonyp@3119 | 543 | } |
tonyp@3119 | 544 | |
tonyp@3119 | 545 | // success! |
tonyp@3119 | 546 | return true; |
ysr@777 | 547 | } |
ysr@777 | 548 | |
brutisso@3120 | 549 | void G1CollectorPolicy::record_new_heap_size(size_t new_number_of_regions) { |
brutisso@3120 | 550 | // re-calculate the necessary reserve |
brutisso@3120 | 551 | double reserve_regions_d = (double) new_number_of_regions * _reserve_factor; |
tonyp@3119 | 552 | // We use ceiling so that if reserve_regions_d is > 0.0 (but |
tonyp@3119 | 553 | // smaller than 1.0) we'll get 1. |
tonyp@3119 | 554 | _reserve_regions = (size_t) ceil(reserve_regions_d); |
brutisso@3120 | 555 | |
brutisso@3358 | 556 | _young_gen_sizer->heap_size_changed(new_number_of_regions); |
tonyp@3119 | 557 | } |
tonyp@3119 | 558 | |
tonyp@3119 | 559 | size_t G1CollectorPolicy::calculate_young_list_desired_min_length( |
tonyp@3119 | 560 | size_t base_min_length) { |
tonyp@3119 | 561 | size_t desired_min_length = 0; |
ysr@777 | 562 | if (adaptive_young_list_length()) { |
tonyp@3119 | 563 | if (_alloc_rate_ms_seq->num() > 3) { |
tonyp@3119 | 564 | double now_sec = os::elapsedTime(); |
tonyp@3119 | 565 | double when_ms = _mmu_tracker->when_max_gc_sec(now_sec) * 1000.0; |
tonyp@3119 | 566 | double alloc_rate_ms = predict_alloc_rate_ms(); |
tonyp@3119 | 567 | desired_min_length = (size_t) ceil(alloc_rate_ms * when_ms); |
tonyp@3119 | 568 | } else { |
tonyp@3119 | 569 | // otherwise we don't have enough info to make the prediction |
tonyp@3119 | 570 | } |
ysr@777 | 571 | } |
brutisso@3120 | 572 | desired_min_length += base_min_length; |
brutisso@3120 | 573 | // make sure we don't go below any user-defined minimum bound |
brutisso@3358 | 574 | return MAX2(_young_gen_sizer->min_desired_young_length(), desired_min_length); |
ysr@777 | 575 | } |
ysr@777 | 576 | |
tonyp@3119 | 577 | size_t G1CollectorPolicy::calculate_young_list_desired_max_length() { |
tonyp@3119 | 578 | // Here, we might want to also take into account any additional |
tonyp@3119 | 579 | // constraints (i.e., user-defined minimum bound). Currently, we |
tonyp@3119 | 580 | // effectively don't set this bound. |
brutisso@3358 | 581 | return _young_gen_sizer->max_desired_young_length(); |
tonyp@3119 | 582 | } |
tonyp@3119 | 583 | |
tonyp@3119 | 584 | void G1CollectorPolicy::update_young_list_target_length(size_t rs_lengths) { |
tonyp@3119 | 585 | if (rs_lengths == (size_t) -1) { |
tonyp@3119 | 586 | // if it's set to the default value (-1), we should predict it; |
tonyp@3119 | 587 | // otherwise, use the given value. |
tonyp@3119 | 588 | rs_lengths = (size_t) get_new_prediction(_rs_lengths_seq); |
tonyp@3119 | 589 | } |
tonyp@3119 | 590 | |
tonyp@3119 | 591 | // Calculate the absolute and desired min bounds. |
tonyp@3119 | 592 | |
tonyp@3119 | 593 | // This is how many young regions we already have (currently: the survivors). |
tonyp@3119 | 594 | size_t base_min_length = recorded_survivor_regions(); |
tonyp@3119 | 595 | // This is the absolute minimum young length, which ensures that we |
tonyp@3119 | 596 | // can allocate one eden region in the worst-case. |
tonyp@3119 | 597 | size_t absolute_min_length = base_min_length + 1; |
tonyp@3119 | 598 | size_t desired_min_length = |
tonyp@3119 | 599 | calculate_young_list_desired_min_length(base_min_length); |
tonyp@3119 | 600 | if (desired_min_length < absolute_min_length) { |
tonyp@3119 | 601 | desired_min_length = absolute_min_length; |
tonyp@3119 | 602 | } |
tonyp@3119 | 603 | |
tonyp@3119 | 604 | // Calculate the absolute and desired max bounds. |
tonyp@3119 | 605 | |
tonyp@3119 | 606 | // We will try our best not to "eat" into the reserve. |
tonyp@3119 | 607 | size_t absolute_max_length = 0; |
tonyp@3119 | 608 | if (_free_regions_at_end_of_collection > _reserve_regions) { |
tonyp@3119 | 609 | absolute_max_length = _free_regions_at_end_of_collection - _reserve_regions; |
tonyp@3119 | 610 | } |
tonyp@3119 | 611 | size_t desired_max_length = calculate_young_list_desired_max_length(); |
tonyp@3119 | 612 | if (desired_max_length > absolute_max_length) { |
tonyp@3119 | 613 | desired_max_length = absolute_max_length; |
tonyp@3119 | 614 | } |
tonyp@3119 | 615 | |
tonyp@3119 | 616 | size_t young_list_target_length = 0; |
tonyp@3119 | 617 | if (adaptive_young_list_length()) { |
tonyp@3337 | 618 | if (gcs_are_young()) { |
tonyp@3119 | 619 | young_list_target_length = |
tonyp@3119 | 620 | calculate_young_list_target_length(rs_lengths, |
tonyp@3119 | 621 | base_min_length, |
tonyp@3119 | 622 | desired_min_length, |
tonyp@3119 | 623 | desired_max_length); |
tonyp@3119 | 624 | _rs_lengths_prediction = rs_lengths; |
tonyp@3119 | 625 | } else { |
tonyp@3119 | 626 | // Don't calculate anything and let the code below bound it to |
tonyp@3119 | 627 | // the desired_min_length, i.e., do the next GC as soon as |
tonyp@3119 | 628 | // possible to maximize how many old regions we can add to it. |
ysr@777 | 629 | } |
ysr@777 | 630 | } else { |
tonyp@3337 | 631 | if (gcs_are_young()) { |
tonyp@3119 | 632 | young_list_target_length = _young_list_fixed_length; |
tonyp@3119 | 633 | } else { |
tonyp@3337 | 634 | // A bit arbitrary: during mixed GCs we allocate half |
tonyp@3119 | 635 | // the young regions to try to add old regions to the CSet. |
tonyp@3119 | 636 | young_list_target_length = _young_list_fixed_length / 2; |
tonyp@3119 | 637 | // We choose to accept that we might go under the desired min |
tonyp@3119 | 638 | // length given that we intentionally ask for a smaller young gen. |
tonyp@3119 | 639 | desired_min_length = absolute_min_length; |
tonyp@3119 | 640 | } |
ysr@777 | 641 | } |
ysr@777 | 642 | |
tonyp@3119 | 643 | // Make sure we don't go over the desired max length, nor under the |
tonyp@3119 | 644 | // desired min length. In case they clash, desired_min_length wins |
tonyp@3119 | 645 | // which is why that test is second. |
tonyp@3119 | 646 | if (young_list_target_length > desired_max_length) { |
tonyp@3119 | 647 | young_list_target_length = desired_max_length; |
tonyp@3119 | 648 | } |
tonyp@3119 | 649 | if (young_list_target_length < desired_min_length) { |
tonyp@3119 | 650 | young_list_target_length = desired_min_length; |
tonyp@3119 | 651 | } |
tonyp@3119 | 652 | |
tonyp@3119 | 653 | assert(young_list_target_length > recorded_survivor_regions(), |
tonyp@3119 | 654 | "we should be able to allocate at least one eden region"); |
tonyp@3119 | 655 | assert(young_list_target_length >= absolute_min_length, "post-condition"); |
tonyp@3119 | 656 | _young_list_target_length = young_list_target_length; |
tonyp@3119 | 657 | |
tonyp@3119 | 658 | update_max_gc_locker_expansion(); |
ysr@777 | 659 | } |
ysr@777 | 660 | |
tonyp@3119 | 661 | size_t |
tonyp@3119 | 662 | G1CollectorPolicy::calculate_young_list_target_length(size_t rs_lengths, |
tonyp@3119 | 663 | size_t base_min_length, |
tonyp@3119 | 664 | size_t desired_min_length, |
tonyp@3119 | 665 | size_t desired_max_length) { |
tonyp@3119 | 666 | assert(adaptive_young_list_length(), "pre-condition"); |
tonyp@3337 | 667 | assert(gcs_are_young(), "only call this for young GCs"); |
tonyp@3119 | 668 | |
tonyp@3119 | 669 | // In case some edge-condition makes the desired max length too small... |
tonyp@3119 | 670 | if (desired_max_length <= desired_min_length) { |
tonyp@3119 | 671 | return desired_min_length; |
tonyp@3119 | 672 | } |
tonyp@3119 | 673 | |
tonyp@3119 | 674 | // We'll adjust min_young_length and max_young_length not to include |
tonyp@3119 | 675 | // the already allocated young regions (i.e., so they reflect the |
tonyp@3119 | 676 | // min and max eden regions we'll allocate). The base_min_length |
tonyp@3119 | 677 | // will be reflected in the predictions by the |
tonyp@3119 | 678 | // survivor_regions_evac_time prediction. |
tonyp@3119 | 679 | assert(desired_min_length > base_min_length, "invariant"); |
tonyp@3119 | 680 | size_t min_young_length = desired_min_length - base_min_length; |
tonyp@3119 | 681 | assert(desired_max_length > base_min_length, "invariant"); |
tonyp@3119 | 682 | size_t max_young_length = desired_max_length - base_min_length; |
tonyp@3119 | 683 | |
tonyp@3119 | 684 | double target_pause_time_ms = _mmu_tracker->max_gc_time() * 1000.0; |
tonyp@3119 | 685 | double survivor_regions_evac_time = predict_survivor_regions_evac_time(); |
tonyp@3119 | 686 | size_t pending_cards = (size_t) get_new_prediction(_pending_cards_seq); |
tonyp@3119 | 687 | size_t adj_rs_lengths = rs_lengths + predict_rs_length_diff(); |
tonyp@3119 | 688 | size_t scanned_cards = predict_young_card_num(adj_rs_lengths); |
tonyp@3119 | 689 | double base_time_ms = |
tonyp@3119 | 690 | predict_base_elapsed_time_ms(pending_cards, scanned_cards) + |
tonyp@3119 | 691 | survivor_regions_evac_time; |
tonyp@3119 | 692 | size_t available_free_regions = _free_regions_at_end_of_collection; |
tonyp@3119 | 693 | size_t base_free_regions = 0; |
tonyp@3119 | 694 | if (available_free_regions > _reserve_regions) { |
tonyp@3119 | 695 | base_free_regions = available_free_regions - _reserve_regions; |
tonyp@3119 | 696 | } |
tonyp@3119 | 697 | |
tonyp@3119 | 698 | // Here, we will make sure that the shortest young length that |
tonyp@3119 | 699 | // makes sense fits within the target pause time. |
tonyp@3119 | 700 | |
tonyp@3119 | 701 | if (predict_will_fit(min_young_length, base_time_ms, |
tonyp@3119 | 702 | base_free_regions, target_pause_time_ms)) { |
tonyp@3119 | 703 | // The shortest young length will fit into the target pause time; |
tonyp@3119 | 704 | // we'll now check whether the absolute maximum number of young |
tonyp@3119 | 705 | // regions will fit in the target pause time. If not, we'll do |
tonyp@3119 | 706 | // a binary search between min_young_length and max_young_length. |
tonyp@3119 | 707 | if (predict_will_fit(max_young_length, base_time_ms, |
tonyp@3119 | 708 | base_free_regions, target_pause_time_ms)) { |
tonyp@3119 | 709 | // The maximum young length will fit into the target pause time. |
tonyp@3119 | 710 | // We are done so set min young length to the maximum length (as |
tonyp@3119 | 711 | // the result is assumed to be returned in min_young_length). |
tonyp@3119 | 712 | min_young_length = max_young_length; |
tonyp@3119 | 713 | } else { |
tonyp@3119 | 714 | // The maximum possible number of young regions will not fit within |
tonyp@3119 | 715 | // the target pause time so we'll search for the optimal |
tonyp@3119 | 716 | // length. The loop invariants are: |
tonyp@3119 | 717 | // |
tonyp@3119 | 718 | // min_young_length < max_young_length |
tonyp@3119 | 719 | // min_young_length is known to fit into the target pause time |
tonyp@3119 | 720 | // max_young_length is known not to fit into the target pause time |
tonyp@3119 | 721 | // |
tonyp@3119 | 722 | // Going into the loop we know the above hold as we've just |
tonyp@3119 | 723 | // checked them. Every time around the loop we check whether |
tonyp@3119 | 724 | // the middle value between min_young_length and |
tonyp@3119 | 725 | // max_young_length fits into the target pause time. If it |
tonyp@3119 | 726 | // does, it becomes the new min. If it doesn't, it becomes |
tonyp@3119 | 727 | // the new max. This way we maintain the loop invariants. |
tonyp@3119 | 728 | |
tonyp@3119 | 729 | assert(min_young_length < max_young_length, "invariant"); |
tonyp@3119 | 730 | size_t diff = (max_young_length - min_young_length) / 2; |
tonyp@3119 | 731 | while (diff > 0) { |
tonyp@3119 | 732 | size_t young_length = min_young_length + diff; |
tonyp@3119 | 733 | if (predict_will_fit(young_length, base_time_ms, |
tonyp@3119 | 734 | base_free_regions, target_pause_time_ms)) { |
tonyp@3119 | 735 | min_young_length = young_length; |
tonyp@3119 | 736 | } else { |
tonyp@3119 | 737 | max_young_length = young_length; |
tonyp@3119 | 738 | } |
tonyp@3119 | 739 | assert(min_young_length < max_young_length, "invariant"); |
tonyp@3119 | 740 | diff = (max_young_length - min_young_length) / 2; |
tonyp@3119 | 741 | } |
tonyp@3119 | 742 | // The results is min_young_length which, according to the |
tonyp@3119 | 743 | // loop invariants, should fit within the target pause time. |
tonyp@3119 | 744 | |
tonyp@3119 | 745 | // These are the post-conditions of the binary search above: |
tonyp@3119 | 746 | assert(min_young_length < max_young_length, |
tonyp@3119 | 747 | "otherwise we should have discovered that max_young_length " |
tonyp@3119 | 748 | "fits into the pause target and not done the binary search"); |
tonyp@3119 | 749 | assert(predict_will_fit(min_young_length, base_time_ms, |
tonyp@3119 | 750 | base_free_regions, target_pause_time_ms), |
tonyp@3119 | 751 | "min_young_length, the result of the binary search, should " |
tonyp@3119 | 752 | "fit into the pause target"); |
tonyp@3119 | 753 | assert(!predict_will_fit(min_young_length + 1, base_time_ms, |
tonyp@3119 | 754 | base_free_regions, target_pause_time_ms), |
tonyp@3119 | 755 | "min_young_length, the result of the binary search, should be " |
tonyp@3119 | 756 | "optimal, so no larger length should fit into the pause target"); |
tonyp@3119 | 757 | } |
tonyp@3119 | 758 | } else { |
tonyp@3119 | 759 | // Even the minimum length doesn't fit into the pause time |
tonyp@3119 | 760 | // target, return it as the result nevertheless. |
tonyp@3119 | 761 | } |
tonyp@3119 | 762 | return base_min_length + min_young_length; |
ysr@777 | 763 | } |
ysr@777 | 764 | |
apetrusenko@980 | 765 | double G1CollectorPolicy::predict_survivor_regions_evac_time() { |
apetrusenko@980 | 766 | double survivor_regions_evac_time = 0.0; |
apetrusenko@980 | 767 | for (HeapRegion * r = _recorded_survivor_head; |
apetrusenko@980 | 768 | r != NULL && r != _recorded_survivor_tail->get_next_young_region(); |
apetrusenko@980 | 769 | r = r->get_next_young_region()) { |
apetrusenko@980 | 770 | survivor_regions_evac_time += predict_region_elapsed_time_ms(r, true); |
apetrusenko@980 | 771 | } |
apetrusenko@980 | 772 | return survivor_regions_evac_time; |
apetrusenko@980 | 773 | } |
apetrusenko@980 | 774 | |
tonyp@3119 | 775 | void G1CollectorPolicy::revise_young_list_target_length_if_necessary() { |
ysr@777 | 776 | guarantee( adaptive_young_list_length(), "should not call this otherwise" ); |
ysr@777 | 777 | |
johnc@1829 | 778 | size_t rs_lengths = _g1->young_list()->sampled_rs_lengths(); |
ysr@777 | 779 | if (rs_lengths > _rs_lengths_prediction) { |
ysr@777 | 780 | // add 10% to avoid having to recalculate often |
ysr@777 | 781 | size_t rs_lengths_prediction = rs_lengths * 1100 / 1000; |
tonyp@3119 | 782 | update_young_list_target_length(rs_lengths_prediction); |
ysr@777 | 783 | } |
ysr@777 | 784 | } |
ysr@777 | 785 | |
tonyp@3119 | 786 | |
tonyp@3119 | 787 | |
ysr@777 | 788 | HeapWord* G1CollectorPolicy::mem_allocate_work(size_t size, |
ysr@777 | 789 | bool is_tlab, |
ysr@777 | 790 | bool* gc_overhead_limit_was_exceeded) { |
ysr@777 | 791 | guarantee(false, "Not using this policy feature yet."); |
ysr@777 | 792 | return NULL; |
ysr@777 | 793 | } |
ysr@777 | 794 | |
ysr@777 | 795 | // This method controls how a collector handles one or more |
ysr@777 | 796 | // of its generations being fully allocated. |
ysr@777 | 797 | HeapWord* G1CollectorPolicy::satisfy_failed_allocation(size_t size, |
ysr@777 | 798 | bool is_tlab) { |
ysr@777 | 799 | guarantee(false, "Not using this policy feature yet."); |
ysr@777 | 800 | return NULL; |
ysr@777 | 801 | } |
ysr@777 | 802 | |
ysr@777 | 803 | |
ysr@777 | 804 | #ifndef PRODUCT |
ysr@777 | 805 | bool G1CollectorPolicy::verify_young_ages() { |
johnc@1829 | 806 | HeapRegion* head = _g1->young_list()->first_region(); |
ysr@777 | 807 | return |
ysr@777 | 808 | verify_young_ages(head, _short_lived_surv_rate_group); |
ysr@777 | 809 | // also call verify_young_ages on any additional surv rate groups |
ysr@777 | 810 | } |
ysr@777 | 811 | |
ysr@777 | 812 | bool |
ysr@777 | 813 | G1CollectorPolicy::verify_young_ages(HeapRegion* head, |
ysr@777 | 814 | SurvRateGroup *surv_rate_group) { |
ysr@777 | 815 | guarantee( surv_rate_group != NULL, "pre-condition" ); |
ysr@777 | 816 | |
ysr@777 | 817 | const char* name = surv_rate_group->name(); |
ysr@777 | 818 | bool ret = true; |
ysr@777 | 819 | int prev_age = -1; |
ysr@777 | 820 | |
ysr@777 | 821 | for (HeapRegion* curr = head; |
ysr@777 | 822 | curr != NULL; |
ysr@777 | 823 | curr = curr->get_next_young_region()) { |
ysr@777 | 824 | SurvRateGroup* group = curr->surv_rate_group(); |
ysr@777 | 825 | if (group == NULL && !curr->is_survivor()) { |
ysr@777 | 826 | gclog_or_tty->print_cr("## %s: encountered NULL surv_rate_group", name); |
ysr@777 | 827 | ret = false; |
ysr@777 | 828 | } |
ysr@777 | 829 | |
ysr@777 | 830 | if (surv_rate_group == group) { |
ysr@777 | 831 | int age = curr->age_in_surv_rate_group(); |
ysr@777 | 832 | |
ysr@777 | 833 | if (age < 0) { |
ysr@777 | 834 | gclog_or_tty->print_cr("## %s: encountered negative age", name); |
ysr@777 | 835 | ret = false; |
ysr@777 | 836 | } |
ysr@777 | 837 | |
ysr@777 | 838 | if (age <= prev_age) { |
ysr@777 | 839 | gclog_or_tty->print_cr("## %s: region ages are not strictly increasing " |
ysr@777 | 840 | "(%d, %d)", name, age, prev_age); |
ysr@777 | 841 | ret = false; |
ysr@777 | 842 | } |
ysr@777 | 843 | prev_age = age; |
ysr@777 | 844 | } |
ysr@777 | 845 | } |
ysr@777 | 846 | |
ysr@777 | 847 | return ret; |
ysr@777 | 848 | } |
ysr@777 | 849 | #endif // PRODUCT |
ysr@777 | 850 | |
ysr@777 | 851 | void G1CollectorPolicy::record_full_collection_start() { |
ysr@777 | 852 | _cur_collection_start_sec = os::elapsedTime(); |
ysr@777 | 853 | // Release the future to-space so that it is available for compaction into. |
ysr@777 | 854 | _g1->set_full_collection(); |
ysr@777 | 855 | } |
ysr@777 | 856 | |
ysr@777 | 857 | void G1CollectorPolicy::record_full_collection_end() { |
ysr@777 | 858 | // Consider this like a collection pause for the purposes of allocation |
ysr@777 | 859 | // since last pause. |
ysr@777 | 860 | double end_sec = os::elapsedTime(); |
ysr@777 | 861 | double full_gc_time_sec = end_sec - _cur_collection_start_sec; |
ysr@777 | 862 | double full_gc_time_ms = full_gc_time_sec * 1000.0; |
ysr@777 | 863 | |
ysr@777 | 864 | _all_full_gc_times_ms->add(full_gc_time_ms); |
ysr@777 | 865 | |
tonyp@1030 | 866 | update_recent_gc_times(end_sec, full_gc_time_ms); |
ysr@777 | 867 | |
ysr@777 | 868 | _g1->clear_full_collection(); |
ysr@777 | 869 | |
tonyp@3337 | 870 | // "Nuke" the heuristics that control the young/mixed GC |
tonyp@3337 | 871 | // transitions and make sure we start with young GCs after the Full GC. |
tonyp@3337 | 872 | set_gcs_are_young(true); |
tonyp@3337 | 873 | _last_young_gc = false; |
tonyp@3337 | 874 | _should_revert_to_young_gcs = false; |
tonyp@1794 | 875 | clear_initiate_conc_mark_if_possible(); |
tonyp@1794 | 876 | clear_during_initial_mark_pause(); |
ysr@777 | 877 | _known_garbage_bytes = 0; |
ysr@777 | 878 | _known_garbage_ratio = 0.0; |
ysr@777 | 879 | _in_marking_window = false; |
ysr@777 | 880 | _in_marking_window_im = false; |
ysr@777 | 881 | |
ysr@777 | 882 | _short_lived_surv_rate_group->start_adding_regions(); |
ysr@777 | 883 | // also call this on any additional surv rate groups |
ysr@777 | 884 | |
apetrusenko@980 | 885 | record_survivor_regions(0, NULL, NULL); |
apetrusenko@980 | 886 | |
ysr@777 | 887 | _free_regions_at_end_of_collection = _g1->free_regions(); |
apetrusenko@980 | 888 | // Reset survivors SurvRateGroup. |
apetrusenko@980 | 889 | _survivor_surv_rate_group->reset(); |
tonyp@3119 | 890 | update_young_list_target_length(); |
tonyp@3209 | 891 | _collectionSetChooser->updateAfterFullCollection(); |
tonyp@2315 | 892 | } |
ysr@777 | 893 | |
ysr@777 | 894 | void G1CollectorPolicy::record_stop_world_start() { |
ysr@777 | 895 | _stop_world_start = os::elapsedTime(); |
ysr@777 | 896 | } |
ysr@777 | 897 | |
ysr@777 | 898 | void G1CollectorPolicy::record_collection_pause_start(double start_time_sec, |
ysr@777 | 899 | size_t start_used) { |
ysr@777 | 900 | if (PrintGCDetails) { |
ysr@777 | 901 | gclog_or_tty->stamp(PrintGCTimeStamps); |
ysr@777 | 902 | gclog_or_tty->print("[GC pause"); |
tonyp@3337 | 903 | gclog_or_tty->print(" (%s)", gcs_are_young() ? "young" : "mixed"); |
ysr@777 | 904 | } |
ysr@777 | 905 | |
tonyp@3416 | 906 | if (!during_initial_mark_pause()) { |
tonyp@3416 | 907 | // We only need to do this here as the policy will only be applied |
tonyp@3416 | 908 | // to the GC we're about to start. so, no point is calculating this |
tonyp@3416 | 909 | // every time we calculate / recalculate the target young length. |
tonyp@3416 | 910 | update_survivors_policy(); |
tonyp@3416 | 911 | } else { |
tonyp@3416 | 912 | // The marking phase has a "we only copy implicitly live |
tonyp@3416 | 913 | // objects during marking" invariant. The easiest way to ensure it |
tonyp@3416 | 914 | // holds is not to allocate any survivor regions and tenure all |
tonyp@3416 | 915 | // objects. In the future we might change this and handle survivor |
tonyp@3416 | 916 | // regions specially during marking. |
tonyp@3416 | 917 | tenure_all_objects(); |
tonyp@3416 | 918 | } |
tonyp@3119 | 919 | |
tonyp@2315 | 920 | assert(_g1->used() == _g1->recalculate_used(), |
tonyp@2315 | 921 | err_msg("sanity, used: "SIZE_FORMAT" recalculate_used: "SIZE_FORMAT, |
tonyp@2315 | 922 | _g1->used(), _g1->recalculate_used())); |
ysr@777 | 923 | |
ysr@777 | 924 | double s_w_t_ms = (start_time_sec - _stop_world_start) * 1000.0; |
ysr@777 | 925 | _all_stop_world_times_ms->add(s_w_t_ms); |
ysr@777 | 926 | _stop_world_start = 0.0; |
ysr@777 | 927 | |
ysr@777 | 928 | _cur_collection_start_sec = start_time_sec; |
ysr@777 | 929 | _cur_collection_pause_used_at_start_bytes = start_used; |
ysr@777 | 930 | _cur_collection_pause_used_regions_at_start = _g1->used_regions(); |
ysr@777 | 931 | _pending_cards = _g1->pending_card_num(); |
ysr@777 | 932 | _max_pending_cards = _g1->max_pending_card_num(); |
ysr@777 | 933 | |
ysr@777 | 934 | _bytes_in_collection_set_before_gc = 0; |
tonyp@3028 | 935 | _bytes_copied_during_gc = 0; |
ysr@777 | 936 | |
tonyp@2961 | 937 | YoungList* young_list = _g1->young_list(); |
tonyp@2961 | 938 | _eden_bytes_before_gc = young_list->eden_used_bytes(); |
tonyp@2961 | 939 | _survivor_bytes_before_gc = young_list->survivor_used_bytes(); |
tonyp@2961 | 940 | _capacity_before_gc = _g1->capacity(); |
tonyp@2961 | 941 | |
ysr@777 | 942 | #ifdef DEBUG |
ysr@777 | 943 | // initialise these to something well known so that we can spot |
ysr@777 | 944 | // if they are not set properly |
ysr@777 | 945 | |
ysr@777 | 946 | for (int i = 0; i < _parallel_gc_threads; ++i) { |
tonyp@1966 | 947 | _par_last_gc_worker_start_times_ms[i] = -1234.0; |
tonyp@1966 | 948 | _par_last_ext_root_scan_times_ms[i] = -1234.0; |
tonyp@3416 | 949 | _par_last_satb_filtering_times_ms[i] = -1234.0; |
tonyp@1966 | 950 | _par_last_update_rs_times_ms[i] = -1234.0; |
tonyp@1966 | 951 | _par_last_update_rs_processed_buffers[i] = -1234.0; |
tonyp@1966 | 952 | _par_last_scan_rs_times_ms[i] = -1234.0; |
tonyp@1966 | 953 | _par_last_obj_copy_times_ms[i] = -1234.0; |
tonyp@1966 | 954 | _par_last_termination_times_ms[i] = -1234.0; |
tonyp@1966 | 955 | _par_last_termination_attempts[i] = -1234.0; |
tonyp@1966 | 956 | _par_last_gc_worker_end_times_ms[i] = -1234.0; |
brutisso@2712 | 957 | _par_last_gc_worker_times_ms[i] = -1234.0; |
johnc@3219 | 958 | _par_last_gc_worker_other_times_ms[i] = -1234.0; |
ysr@777 | 959 | } |
ysr@777 | 960 | #endif |
ysr@777 | 961 | |
ysr@777 | 962 | for (int i = 0; i < _aux_num; ++i) { |
ysr@777 | 963 | _cur_aux_times_ms[i] = 0.0; |
ysr@777 | 964 | _cur_aux_times_set[i] = false; |
ysr@777 | 965 | } |
ysr@777 | 966 | |
johnc@3295 | 967 | // This is initialized to zero here and is set during |
johnc@3219 | 968 | // the evacuation pause if marking is in progress. |
johnc@3219 | 969 | _cur_satb_drain_time_ms = 0.0; |
ysr@777 | 970 | |
tonyp@3337 | 971 | _last_gc_was_young = false; |
ysr@777 | 972 | |
ysr@777 | 973 | // do that for any other surv rate groups |
ysr@777 | 974 | _short_lived_surv_rate_group->stop_adding_regions(); |
tonyp@1717 | 975 | _survivors_age_table.clear(); |
apetrusenko@980 | 976 | |
ysr@777 | 977 | assert( verify_young_ages(), "region age verification" ); |
ysr@777 | 978 | } |
ysr@777 | 979 | |
brutisso@3065 | 980 | void G1CollectorPolicy::record_concurrent_mark_init_end(double |
ysr@777 | 981 | mark_init_elapsed_time_ms) { |
ysr@777 | 982 | _during_marking = true; |
tonyp@1794 | 983 | assert(!initiate_conc_mark_if_possible(), "we should have cleared it by now"); |
tonyp@1794 | 984 | clear_during_initial_mark_pause(); |
ysr@777 | 985 | _cur_mark_stop_world_time_ms = mark_init_elapsed_time_ms; |
ysr@777 | 986 | } |
ysr@777 | 987 | |
ysr@777 | 988 | void G1CollectorPolicy::record_concurrent_mark_remark_start() { |
ysr@777 | 989 | _mark_remark_start_sec = os::elapsedTime(); |
ysr@777 | 990 | _during_marking = false; |
ysr@777 | 991 | } |
ysr@777 | 992 | |
ysr@777 | 993 | void G1CollectorPolicy::record_concurrent_mark_remark_end() { |
ysr@777 | 994 | double end_time_sec = os::elapsedTime(); |
ysr@777 | 995 | double elapsed_time_ms = (end_time_sec - _mark_remark_start_sec)*1000.0; |
ysr@777 | 996 | _concurrent_mark_remark_times_ms->add(elapsed_time_ms); |
ysr@777 | 997 | _cur_mark_stop_world_time_ms += elapsed_time_ms; |
ysr@777 | 998 | _prev_collection_pause_end_ms += elapsed_time_ms; |
ysr@777 | 999 | |
ysr@777 | 1000 | _mmu_tracker->add_pause(_mark_remark_start_sec, end_time_sec, true); |
ysr@777 | 1001 | } |
ysr@777 | 1002 | |
ysr@777 | 1003 | void G1CollectorPolicy::record_concurrent_mark_cleanup_start() { |
ysr@777 | 1004 | _mark_cleanup_start_sec = os::elapsedTime(); |
ysr@777 | 1005 | } |
ysr@777 | 1006 | |
tonyp@3209 | 1007 | void G1CollectorPolicy::record_concurrent_mark_cleanup_completed() { |
tonyp@3337 | 1008 | _should_revert_to_young_gcs = false; |
tonyp@3337 | 1009 | _last_young_gc = true; |
brutisso@3065 | 1010 | _in_marking_window = false; |
ysr@777 | 1011 | } |
ysr@777 | 1012 | |
ysr@777 | 1013 | void G1CollectorPolicy::record_concurrent_pause() { |
ysr@777 | 1014 | if (_stop_world_start > 0.0) { |
ysr@777 | 1015 | double yield_ms = (os::elapsedTime() - _stop_world_start) * 1000.0; |
ysr@777 | 1016 | _all_yield_times_ms->add(yield_ms); |
ysr@777 | 1017 | } |
ysr@777 | 1018 | } |
ysr@777 | 1019 | |
ysr@777 | 1020 | void G1CollectorPolicy::record_concurrent_pause_end() { |
ysr@777 | 1021 | } |
ysr@777 | 1022 | |
ysr@777 | 1023 | template<class T> |
ysr@777 | 1024 | T sum_of(T* sum_arr, int start, int n, int N) { |
ysr@777 | 1025 | T sum = (T)0; |
ysr@777 | 1026 | for (int i = 0; i < n; i++) { |
ysr@777 | 1027 | int j = (start + i) % N; |
ysr@777 | 1028 | sum += sum_arr[j]; |
ysr@777 | 1029 | } |
ysr@777 | 1030 | return sum; |
ysr@777 | 1031 | } |
ysr@777 | 1032 | |
tonyp@1966 | 1033 | void G1CollectorPolicy::print_par_stats(int level, |
tonyp@1966 | 1034 | const char* str, |
brutisso@2712 | 1035 | double* data) { |
ysr@777 | 1036 | double min = data[0], max = data[0]; |
ysr@777 | 1037 | double total = 0.0; |
brutisso@2645 | 1038 | LineBuffer buf(level); |
brutisso@2645 | 1039 | buf.append("[%s (ms):", str); |
jmasa@3294 | 1040 | for (uint i = 0; i < no_of_gc_threads(); ++i) { |
ysr@777 | 1041 | double val = data[i]; |
ysr@777 | 1042 | if (val < min) |
ysr@777 | 1043 | min = val; |
ysr@777 | 1044 | if (val > max) |
ysr@777 | 1045 | max = val; |
ysr@777 | 1046 | total += val; |
brutisso@2645 | 1047 | buf.append(" %3.1lf", val); |
ysr@777 | 1048 | } |
brutisso@2712 | 1049 | buf.append_and_print_cr(""); |
jmasa@3294 | 1050 | double avg = total / (double) no_of_gc_threads(); |
brutisso@2712 | 1051 | buf.append_and_print_cr(" Avg: %5.1lf, Min: %5.1lf, Max: %5.1lf, Diff: %5.1lf]", |
brutisso@2712 | 1052 | avg, min, max, max - min); |
ysr@777 | 1053 | } |
ysr@777 | 1054 | |
tonyp@1966 | 1055 | void G1CollectorPolicy::print_par_sizes(int level, |
tonyp@1966 | 1056 | const char* str, |
brutisso@2712 | 1057 | double* data) { |
ysr@777 | 1058 | double min = data[0], max = data[0]; |
ysr@777 | 1059 | double total = 0.0; |
brutisso@2645 | 1060 | LineBuffer buf(level); |
brutisso@2645 | 1061 | buf.append("[%s :", str); |
jmasa@3294 | 1062 | for (uint i = 0; i < no_of_gc_threads(); ++i) { |
ysr@777 | 1063 | double val = data[i]; |
ysr@777 | 1064 | if (val < min) |
ysr@777 | 1065 | min = val; |
ysr@777 | 1066 | if (val > max) |
ysr@777 | 1067 | max = val; |
ysr@777 | 1068 | total += val; |
brutisso@2645 | 1069 | buf.append(" %d", (int) val); |
ysr@777 | 1070 | } |
brutisso@2712 | 1071 | buf.append_and_print_cr(""); |
jmasa@3294 | 1072 | double avg = total / (double) no_of_gc_threads(); |
brutisso@2712 | 1073 | buf.append_and_print_cr(" Sum: %d, Avg: %d, Min: %d, Max: %d, Diff: %d]", |
brutisso@2712 | 1074 | (int)total, (int)avg, (int)min, (int)max, (int)max - (int)min); |
ysr@777 | 1075 | } |
ysr@777 | 1076 | |
johnc@3219 | 1077 | void G1CollectorPolicy::print_stats(int level, |
johnc@3219 | 1078 | const char* str, |
johnc@3219 | 1079 | double value) { |
brutisso@2645 | 1080 | LineBuffer(level).append_and_print_cr("[%s: %5.1lf ms]", str, value); |
ysr@777 | 1081 | } |
ysr@777 | 1082 | |
johnc@3219 | 1083 | void G1CollectorPolicy::print_stats(int level, |
johnc@3219 | 1084 | const char* str, |
johnc@3219 | 1085 | int value) { |
brutisso@2645 | 1086 | LineBuffer(level).append_and_print_cr("[%s: %d]", str, value); |
ysr@777 | 1087 | } |
ysr@777 | 1088 | |
johnc@3219 | 1089 | double G1CollectorPolicy::avg_value(double* data) { |
jmasa@2188 | 1090 | if (G1CollectedHeap::use_parallel_gc_threads()) { |
ysr@777 | 1091 | double ret = 0.0; |
jmasa@3294 | 1092 | for (uint i = 0; i < no_of_gc_threads(); ++i) { |
ysr@777 | 1093 | ret += data[i]; |
johnc@3219 | 1094 | } |
jmasa@3294 | 1095 | return ret / (double) no_of_gc_threads(); |
ysr@777 | 1096 | } else { |
ysr@777 | 1097 | return data[0]; |
ysr@777 | 1098 | } |
ysr@777 | 1099 | } |
ysr@777 | 1100 | |
johnc@3219 | 1101 | double G1CollectorPolicy::max_value(double* data) { |
jmasa@2188 | 1102 | if (G1CollectedHeap::use_parallel_gc_threads()) { |
ysr@777 | 1103 | double ret = data[0]; |
jmasa@3294 | 1104 | for (uint i = 1; i < no_of_gc_threads(); ++i) { |
johnc@3219 | 1105 | if (data[i] > ret) { |
ysr@777 | 1106 | ret = data[i]; |
johnc@3219 | 1107 | } |
johnc@3219 | 1108 | } |
ysr@777 | 1109 | return ret; |
ysr@777 | 1110 | } else { |
ysr@777 | 1111 | return data[0]; |
ysr@777 | 1112 | } |
ysr@777 | 1113 | } |
ysr@777 | 1114 | |
johnc@3219 | 1115 | double G1CollectorPolicy::sum_of_values(double* data) { |
jmasa@2188 | 1116 | if (G1CollectedHeap::use_parallel_gc_threads()) { |
ysr@777 | 1117 | double sum = 0.0; |
jmasa@3294 | 1118 | for (uint i = 0; i < no_of_gc_threads(); i++) { |
ysr@777 | 1119 | sum += data[i]; |
johnc@3219 | 1120 | } |
ysr@777 | 1121 | return sum; |
ysr@777 | 1122 | } else { |
ysr@777 | 1123 | return data[0]; |
ysr@777 | 1124 | } |
ysr@777 | 1125 | } |
ysr@777 | 1126 | |
johnc@3219 | 1127 | double G1CollectorPolicy::max_sum(double* data1, double* data2) { |
ysr@777 | 1128 | double ret = data1[0] + data2[0]; |
ysr@777 | 1129 | |
jmasa@2188 | 1130 | if (G1CollectedHeap::use_parallel_gc_threads()) { |
jmasa@3294 | 1131 | for (uint i = 1; i < no_of_gc_threads(); ++i) { |
ysr@777 | 1132 | double data = data1[i] + data2[i]; |
johnc@3219 | 1133 | if (data > ret) { |
ysr@777 | 1134 | ret = data; |
johnc@3219 | 1135 | } |
ysr@777 | 1136 | } |
ysr@777 | 1137 | } |
ysr@777 | 1138 | return ret; |
ysr@777 | 1139 | } |
ysr@777 | 1140 | |
brutisso@3461 | 1141 | bool G1CollectorPolicy::need_to_start_conc_mark(const char* source, size_t alloc_word_size) { |
brutisso@3461 | 1142 | if (_g1->concurrent_mark()->cmThread()->during_cycle()) { |
brutisso@3456 | 1143 | return false; |
brutisso@3456 | 1144 | } |
brutisso@3456 | 1145 | |
brutisso@3456 | 1146 | size_t marking_initiating_used_threshold = |
brutisso@3456 | 1147 | (_g1->capacity() / 100) * InitiatingHeapOccupancyPercent; |
brutisso@3456 | 1148 | size_t cur_used_bytes = _g1->non_young_capacity_bytes(); |
brutisso@3461 | 1149 | size_t alloc_byte_size = alloc_word_size * HeapWordSize; |
brutisso@3461 | 1150 | |
brutisso@3461 | 1151 | if ((cur_used_bytes + alloc_byte_size) > marking_initiating_used_threshold) { |
brutisso@3456 | 1152 | if (gcs_are_young()) { |
brutisso@3461 | 1153 | ergo_verbose5(ErgoConcCycles, |
brutisso@3456 | 1154 | "request concurrent cycle initiation", |
brutisso@3456 | 1155 | ergo_format_reason("occupancy higher than threshold") |
brutisso@3456 | 1156 | ergo_format_byte("occupancy") |
brutisso@3461 | 1157 | ergo_format_byte("allocation request") |
brutisso@3456 | 1158 | ergo_format_byte_perc("threshold") |
brutisso@3456 | 1159 | ergo_format_str("source"), |
brutisso@3456 | 1160 | cur_used_bytes, |
brutisso@3461 | 1161 | alloc_byte_size, |
brutisso@3456 | 1162 | marking_initiating_used_threshold, |
brutisso@3456 | 1163 | (double) InitiatingHeapOccupancyPercent, |
brutisso@3456 | 1164 | source); |
brutisso@3456 | 1165 | return true; |
brutisso@3456 | 1166 | } else { |
brutisso@3461 | 1167 | ergo_verbose5(ErgoConcCycles, |
brutisso@3456 | 1168 | "do not request concurrent cycle initiation", |
brutisso@3456 | 1169 | ergo_format_reason("still doing mixed collections") |
brutisso@3456 | 1170 | ergo_format_byte("occupancy") |
brutisso@3461 | 1171 | ergo_format_byte("allocation request") |
brutisso@3456 | 1172 | ergo_format_byte_perc("threshold") |
brutisso@3456 | 1173 | ergo_format_str("source"), |
brutisso@3456 | 1174 | cur_used_bytes, |
brutisso@3461 | 1175 | alloc_byte_size, |
brutisso@3456 | 1176 | marking_initiating_used_threshold, |
brutisso@3456 | 1177 | (double) InitiatingHeapOccupancyPercent, |
brutisso@3456 | 1178 | source); |
brutisso@3456 | 1179 | } |
brutisso@3456 | 1180 | } |
brutisso@3456 | 1181 | |
brutisso@3456 | 1182 | return false; |
brutisso@3456 | 1183 | } |
brutisso@3456 | 1184 | |
ysr@777 | 1185 | // Anything below that is considered to be zero |
ysr@777 | 1186 | #define MIN_TIMER_GRANULARITY 0.0000001 |
ysr@777 | 1187 | |
jmasa@3294 | 1188 | void G1CollectorPolicy::record_collection_pause_end(int no_of_gc_threads) { |
ysr@777 | 1189 | double end_time_sec = os::elapsedTime(); |
ysr@777 | 1190 | double elapsed_ms = _last_pause_time_ms; |
jmasa@2188 | 1191 | bool parallel = G1CollectedHeap::use_parallel_gc_threads(); |
tonyp@3289 | 1192 | assert(_cur_collection_pause_used_regions_at_start >= cset_region_length(), |
tonyp@3289 | 1193 | "otherwise, the subtraction below does not make sense"); |
ysr@777 | 1194 | size_t rs_size = |
tonyp@3289 | 1195 | _cur_collection_pause_used_regions_at_start - cset_region_length(); |
ysr@777 | 1196 | size_t cur_used_bytes = _g1->used(); |
ysr@777 | 1197 | assert(cur_used_bytes == _g1->recalculate_used(), "It should!"); |
ysr@777 | 1198 | bool last_pause_included_initial_mark = false; |
tonyp@2062 | 1199 | bool update_stats = !_g1->evacuation_failed(); |
jmasa@3294 | 1200 | set_no_of_gc_threads(no_of_gc_threads); |
ysr@777 | 1201 | |
ysr@777 | 1202 | #ifndef PRODUCT |
ysr@777 | 1203 | if (G1YoungSurvRateVerbose) { |
ysr@777 | 1204 | gclog_or_tty->print_cr(""); |
ysr@777 | 1205 | _short_lived_surv_rate_group->print(); |
ysr@777 | 1206 | // do that for any other surv rate groups too |
ysr@777 | 1207 | } |
ysr@777 | 1208 | #endif // PRODUCT |
ysr@777 | 1209 | |
brutisso@3065 | 1210 | last_pause_included_initial_mark = during_initial_mark_pause(); |
brutisso@3456 | 1211 | if (last_pause_included_initial_mark) { |
brutisso@3065 | 1212 | record_concurrent_mark_init_end(0.0); |
ysr@777 | 1213 | } |
ysr@777 | 1214 | |
brutisso@3456 | 1215 | if (!_last_young_gc && need_to_start_conc_mark("end of GC")) { |
brutisso@3456 | 1216 | // Note: this might have already been set, if during the last |
brutisso@3456 | 1217 | // pause we decided to start a cycle but at the beginning of |
brutisso@3456 | 1218 | // this pause we decided to postpone it. That's OK. |
brutisso@3456 | 1219 | set_initiate_conc_mark_if_possible(); |
brutisso@3456 | 1220 | } |
brutisso@3065 | 1221 | |
ysr@777 | 1222 | _mmu_tracker->add_pause(end_time_sec - elapsed_ms/1000.0, |
ysr@777 | 1223 | end_time_sec, false); |
ysr@777 | 1224 | |
ysr@777 | 1225 | // This assert is exempted when we're doing parallel collection pauses, |
ysr@777 | 1226 | // because the fragmentation caused by the parallel GC allocation buffers |
ysr@777 | 1227 | // can lead to more memory being used during collection than was used |
ysr@777 | 1228 | // before. Best leave this out until the fragmentation problem is fixed. |
ysr@777 | 1229 | // Pauses in which evacuation failed can also lead to negative |
ysr@777 | 1230 | // collections, since no space is reclaimed from a region containing an |
ysr@777 | 1231 | // object whose evacuation failed. |
ysr@777 | 1232 | // Further, we're now always doing parallel collection. But I'm still |
ysr@777 | 1233 | // leaving this here as a placeholder for a more precise assertion later. |
ysr@777 | 1234 | // (DLD, 10/05.) |
ysr@777 | 1235 | assert((true || parallel) // Always using GC LABs now. |
ysr@777 | 1236 | || _g1->evacuation_failed() |
ysr@777 | 1237 | || _cur_collection_pause_used_at_start_bytes >= cur_used_bytes, |
ysr@777 | 1238 | "Negative collection"); |
ysr@777 | 1239 | |
ysr@777 | 1240 | size_t freed_bytes = |
ysr@777 | 1241 | _cur_collection_pause_used_at_start_bytes - cur_used_bytes; |
ysr@777 | 1242 | size_t surviving_bytes = _collection_set_bytes_used_before - freed_bytes; |
johnc@1829 | 1243 | |
ysr@777 | 1244 | double survival_fraction = |
ysr@777 | 1245 | (double)surviving_bytes/ |
ysr@777 | 1246 | (double)_collection_set_bytes_used_before; |
ysr@777 | 1247 | |
johnc@3219 | 1248 | // These values are used to update the summary information that is |
johnc@3219 | 1249 | // displayed when TraceGen0Time is enabled, and are output as part |
johnc@3219 | 1250 | // of the PrintGCDetails output, in the non-parallel case. |
johnc@3219 | 1251 | |
johnc@3021 | 1252 | double ext_root_scan_time = avg_value(_par_last_ext_root_scan_times_ms); |
tonyp@3416 | 1253 | double satb_filtering_time = avg_value(_par_last_satb_filtering_times_ms); |
johnc@3021 | 1254 | double update_rs_time = avg_value(_par_last_update_rs_times_ms); |
johnc@3021 | 1255 | double update_rs_processed_buffers = |
johnc@3021 | 1256 | sum_of_values(_par_last_update_rs_processed_buffers); |
johnc@3021 | 1257 | double scan_rs_time = avg_value(_par_last_scan_rs_times_ms); |
johnc@3021 | 1258 | double obj_copy_time = avg_value(_par_last_obj_copy_times_ms); |
johnc@3021 | 1259 | double termination_time = avg_value(_par_last_termination_times_ms); |
johnc@3021 | 1260 | |
johnc@3219 | 1261 | double known_time = ext_root_scan_time + |
tonyp@3416 | 1262 | satb_filtering_time + |
johnc@3219 | 1263 | update_rs_time + |
johnc@3219 | 1264 | scan_rs_time + |
johnc@3219 | 1265 | obj_copy_time; |
johnc@3219 | 1266 | |
johnc@3219 | 1267 | double other_time_ms = elapsed_ms; |
johnc@3219 | 1268 | |
johnc@3219 | 1269 | // Subtract the SATB drain time. It's initialized to zero at the |
johnc@3219 | 1270 | // start of the pause and is updated during the pause if marking |
johnc@3219 | 1271 | // is in progress. |
johnc@3219 | 1272 | other_time_ms -= _cur_satb_drain_time_ms; |
johnc@3219 | 1273 | |
johnc@3219 | 1274 | if (parallel) { |
johnc@3219 | 1275 | other_time_ms -= _cur_collection_par_time_ms; |
johnc@3219 | 1276 | } else { |
johnc@3219 | 1277 | other_time_ms -= known_time; |
johnc@3219 | 1278 | } |
johnc@3219 | 1279 | |
johnc@3219 | 1280 | // Subtract the time taken to clean the card table from the |
johnc@3219 | 1281 | // current value of "other time" |
johnc@3219 | 1282 | other_time_ms -= _cur_clear_ct_time_ms; |
johnc@3219 | 1283 | |
johnc@3296 | 1284 | // Subtract the time spent completing marking in the collection |
johnc@3296 | 1285 | // set. Note if marking is not in progress during the pause |
johnc@3296 | 1286 | // the value of _mark_closure_time_ms will be zero. |
johnc@3296 | 1287 | other_time_ms -= _mark_closure_time_ms; |
johnc@3296 | 1288 | |
johnc@3219 | 1289 | // TraceGen0Time and TraceGen1Time summary info updating. |
johnc@3219 | 1290 | _all_pause_times_ms->add(elapsed_ms); |
johnc@3021 | 1291 | |
tonyp@1030 | 1292 | if (update_stats) { |
johnc@3219 | 1293 | _summary->record_total_time_ms(elapsed_ms); |
johnc@3219 | 1294 | _summary->record_other_time_ms(other_time_ms); |
johnc@3219 | 1295 | |
johnc@3219 | 1296 | MainBodySummary* body_summary = _summary->main_body_summary(); |
johnc@3219 | 1297 | assert(body_summary != NULL, "should not be null!"); |
johnc@3219 | 1298 | |
johnc@3219 | 1299 | // This will be non-zero iff marking is currently in progress (i.e. |
johnc@3219 | 1300 | // _g1->mark_in_progress() == true) and the currrent pause was not |
johnc@3219 | 1301 | // an initial mark pause. Since the body_summary items are NumberSeqs, |
johnc@3219 | 1302 | // however, they have to be consistent and updated in lock-step with |
johnc@3219 | 1303 | // each other. Therefore we unconditionally record the SATB drain |
johnc@3219 | 1304 | // time - even if it's zero. |
johnc@3219 | 1305 | body_summary->record_satb_drain_time_ms(_cur_satb_drain_time_ms); |
johnc@3021 | 1306 | |
johnc@3021 | 1307 | body_summary->record_ext_root_scan_time_ms(ext_root_scan_time); |
tonyp@3416 | 1308 | body_summary->record_satb_filtering_time_ms(satb_filtering_time); |
johnc@3021 | 1309 | body_summary->record_update_rs_time_ms(update_rs_time); |
johnc@3021 | 1310 | body_summary->record_scan_rs_time_ms(scan_rs_time); |
johnc@3021 | 1311 | body_summary->record_obj_copy_time_ms(obj_copy_time); |
johnc@3219 | 1312 | |
johnc@3021 | 1313 | if (parallel) { |
johnc@3021 | 1314 | body_summary->record_parallel_time_ms(_cur_collection_par_time_ms); |
johnc@3021 | 1315 | body_summary->record_termination_time_ms(termination_time); |
johnc@3219 | 1316 | |
johnc@3219 | 1317 | double parallel_known_time = known_time + termination_time; |
johnc@3219 | 1318 | double parallel_other_time = _cur_collection_par_time_ms - parallel_known_time; |
johnc@3021 | 1319 | body_summary->record_parallel_other_time_ms(parallel_other_time); |
johnc@3021 | 1320 | } |
johnc@3219 | 1321 | |
johnc@3021 | 1322 | body_summary->record_mark_closure_time_ms(_mark_closure_time_ms); |
johnc@3219 | 1323 | body_summary->record_clear_ct_time_ms(_cur_clear_ct_time_ms); |
johnc@3021 | 1324 | |
ysr@777 | 1325 | // We exempt parallel collection from this check because Alloc Buffer |
ysr@777 | 1326 | // fragmentation can produce negative collections. Same with evac |
ysr@777 | 1327 | // failure. |
ysr@777 | 1328 | // Further, we're now always doing parallel collection. But I'm still |
ysr@777 | 1329 | // leaving this here as a placeholder for a more precise assertion later. |
ysr@777 | 1330 | // (DLD, 10/05. |
ysr@777 | 1331 | assert((true || parallel) |
ysr@777 | 1332 | || _g1->evacuation_failed() |
ysr@777 | 1333 | || surviving_bytes <= _collection_set_bytes_used_before, |
ysr@777 | 1334 | "Or else negative collection!"); |
johnc@3219 | 1335 | |
ysr@777 | 1336 | // this is where we update the allocation rate of the application |
ysr@777 | 1337 | double app_time_ms = |
ysr@777 | 1338 | (_cur_collection_start_sec * 1000.0 - _prev_collection_pause_end_ms); |
ysr@777 | 1339 | if (app_time_ms < MIN_TIMER_GRANULARITY) { |
ysr@777 | 1340 | // This usually happens due to the timer not having the required |
ysr@777 | 1341 | // granularity. Some Linuxes are the usual culprits. |
ysr@777 | 1342 | // We'll just set it to something (arbitrarily) small. |
ysr@777 | 1343 | app_time_ms = 1.0; |
ysr@777 | 1344 | } |
tonyp@3289 | 1345 | // We maintain the invariant that all objects allocated by mutator |
tonyp@3289 | 1346 | // threads will be allocated out of eden regions. So, we can use |
tonyp@3289 | 1347 | // the eden region number allocated since the previous GC to |
tonyp@3289 | 1348 | // calculate the application's allocate rate. The only exception |
tonyp@3289 | 1349 | // to that is humongous objects that are allocated separately. But |
tonyp@3289 | 1350 | // given that humongous object allocations do not really affect |
tonyp@3289 | 1351 | // either the pause's duration nor when the next pause will take |
tonyp@3289 | 1352 | // place we can safely ignore them here. |
tonyp@3289 | 1353 | size_t regions_allocated = eden_cset_region_length(); |
ysr@777 | 1354 | double alloc_rate_ms = (double) regions_allocated / app_time_ms; |
ysr@777 | 1355 | _alloc_rate_ms_seq->add(alloc_rate_ms); |
ysr@777 | 1356 | |
ysr@777 | 1357 | double interval_ms = |
ysr@777 | 1358 | (end_time_sec - _recent_prev_end_times_for_all_gcs_sec->oldest()) * 1000.0; |
ysr@777 | 1359 | update_recent_gc_times(end_time_sec, elapsed_ms); |
ysr@777 | 1360 | _recent_avg_pause_time_ratio = _recent_gc_times_ms->sum()/interval_ms; |
ysr@1521 | 1361 | if (recent_avg_pause_time_ratio() < 0.0 || |
ysr@1521 | 1362 | (recent_avg_pause_time_ratio() - 1.0 > 0.0)) { |
ysr@1521 | 1363 | #ifndef PRODUCT |
ysr@1521 | 1364 | // Dump info to allow post-facto debugging |
ysr@1521 | 1365 | gclog_or_tty->print_cr("recent_avg_pause_time_ratio() out of bounds"); |
ysr@1521 | 1366 | gclog_or_tty->print_cr("-------------------------------------------"); |
ysr@1521 | 1367 | gclog_or_tty->print_cr("Recent GC Times (ms):"); |
ysr@1521 | 1368 | _recent_gc_times_ms->dump(); |
ysr@1521 | 1369 | gclog_or_tty->print_cr("(End Time=%3.3f) Recent GC End Times (s):", end_time_sec); |
ysr@1521 | 1370 | _recent_prev_end_times_for_all_gcs_sec->dump(); |
ysr@1521 | 1371 | gclog_or_tty->print_cr("GC = %3.3f, Interval = %3.3f, Ratio = %3.3f", |
ysr@1521 | 1372 | _recent_gc_times_ms->sum(), interval_ms, recent_avg_pause_time_ratio()); |
ysr@1522 | 1373 | // In debug mode, terminate the JVM if the user wants to debug at this point. |
ysr@1522 | 1374 | assert(!G1FailOnFPError, "Debugging data for CR 6898948 has been dumped above"); |
ysr@1522 | 1375 | #endif // !PRODUCT |
ysr@1522 | 1376 | // Clip ratio between 0.0 and 1.0, and continue. This will be fixed in |
ysr@1522 | 1377 | // CR 6902692 by redoing the manner in which the ratio is incrementally computed. |
ysr@1521 | 1378 | if (_recent_avg_pause_time_ratio < 0.0) { |
ysr@1521 | 1379 | _recent_avg_pause_time_ratio = 0.0; |
ysr@1521 | 1380 | } else { |
ysr@1521 | 1381 | assert(_recent_avg_pause_time_ratio - 1.0 > 0.0, "Ctl-point invariant"); |
ysr@1521 | 1382 | _recent_avg_pause_time_ratio = 1.0; |
ysr@1521 | 1383 | } |
ysr@1521 | 1384 | } |
ysr@777 | 1385 | } |
ysr@777 | 1386 | |
johnc@3219 | 1387 | for (int i = 0; i < _aux_num; ++i) { |
johnc@3219 | 1388 | if (_cur_aux_times_set[i]) { |
johnc@3219 | 1389 | _all_aux_times_ms[i].add(_cur_aux_times_ms[i]); |
johnc@3219 | 1390 | } |
johnc@3219 | 1391 | } |
johnc@3219 | 1392 | |
johnc@3219 | 1393 | // PrintGCDetails output |
ysr@777 | 1394 | if (PrintGCDetails) { |
johnc@3219 | 1395 | bool print_marking_info = |
johnc@3219 | 1396 | _g1->mark_in_progress() && !last_pause_included_initial_mark; |
johnc@3219 | 1397 | |
tonyp@2062 | 1398 | gclog_or_tty->print_cr("%s, %1.8lf secs]", |
ysr@777 | 1399 | (last_pause_included_initial_mark) ? " (initial-mark)" : "", |
ysr@777 | 1400 | elapsed_ms / 1000.0); |
ysr@777 | 1401 | |
tonyp@2062 | 1402 | if (parallel) { |
tonyp@2062 | 1403 | print_stats(1, "Parallel Time", _cur_collection_par_time_ms); |
johnc@3219 | 1404 | print_par_stats(2, "GC Worker Start", _par_last_gc_worker_start_times_ms); |
johnc@3219 | 1405 | print_par_stats(2, "Ext Root Scanning", _par_last_ext_root_scan_times_ms); |
johnc@3219 | 1406 | if (print_marking_info) { |
tonyp@3416 | 1407 | print_par_stats(2, "SATB Filtering", _par_last_satb_filtering_times_ms); |
johnc@3219 | 1408 | } |
tonyp@2062 | 1409 | print_par_stats(2, "Update RS", _par_last_update_rs_times_ms); |
brutisso@2712 | 1410 | print_par_sizes(3, "Processed Buffers", _par_last_update_rs_processed_buffers); |
tonyp@2062 | 1411 | print_par_stats(2, "Scan RS", _par_last_scan_rs_times_ms); |
tonyp@2062 | 1412 | print_par_stats(2, "Object Copy", _par_last_obj_copy_times_ms); |
tonyp@2062 | 1413 | print_par_stats(2, "Termination", _par_last_termination_times_ms); |
brutisso@2712 | 1414 | print_par_sizes(3, "Termination Attempts", _par_last_termination_attempts); |
johnc@3219 | 1415 | print_par_stats(2, "GC Worker End", _par_last_gc_worker_end_times_ms); |
brutisso@2712 | 1416 | |
brutisso@2712 | 1417 | for (int i = 0; i < _parallel_gc_threads; i++) { |
brutisso@2712 | 1418 | _par_last_gc_worker_times_ms[i] = _par_last_gc_worker_end_times_ms[i] - _par_last_gc_worker_start_times_ms[i]; |
johnc@3219 | 1419 | |
johnc@3219 | 1420 | double worker_known_time = _par_last_ext_root_scan_times_ms[i] + |
tonyp@3416 | 1421 | _par_last_satb_filtering_times_ms[i] + |
johnc@3219 | 1422 | _par_last_update_rs_times_ms[i] + |
johnc@3219 | 1423 | _par_last_scan_rs_times_ms[i] + |
johnc@3219 | 1424 | _par_last_obj_copy_times_ms[i] + |
johnc@3219 | 1425 | _par_last_termination_times_ms[i]; |
johnc@3219 | 1426 | |
johnc@3219 | 1427 | _par_last_gc_worker_other_times_ms[i] = _cur_collection_par_time_ms - worker_known_time; |
brutisso@2712 | 1428 | } |
johnc@3219 | 1429 | print_par_stats(2, "GC Worker", _par_last_gc_worker_times_ms); |
johnc@3219 | 1430 | print_par_stats(2, "GC Worker Other", _par_last_gc_worker_other_times_ms); |
tonyp@2062 | 1431 | } else { |
johnc@3219 | 1432 | print_stats(1, "Ext Root Scanning", ext_root_scan_time); |
johnc@3219 | 1433 | if (print_marking_info) { |
tonyp@3416 | 1434 | print_stats(1, "SATB Filtering", satb_filtering_time); |
johnc@3219 | 1435 | } |
tonyp@2062 | 1436 | print_stats(1, "Update RS", update_rs_time); |
johnc@3219 | 1437 | print_stats(2, "Processed Buffers", (int)update_rs_processed_buffers); |
tonyp@2062 | 1438 | print_stats(1, "Scan RS", scan_rs_time); |
tonyp@2062 | 1439 | print_stats(1, "Object Copying", obj_copy_time); |
ysr@777 | 1440 | } |
johnc@3296 | 1441 | if (print_marking_info) { |
johnc@3296 | 1442 | print_stats(1, "Complete CSet Marking", _mark_closure_time_ms); |
johnc@3296 | 1443 | } |
johnc@3219 | 1444 | print_stats(1, "Clear CT", _cur_clear_ct_time_ms); |
johnc@1325 | 1445 | #ifndef PRODUCT |
johnc@1325 | 1446 | print_stats(1, "Cur Clear CC", _cur_clear_cc_time_ms); |
johnc@1325 | 1447 | print_stats(1, "Cum Clear CC", _cum_clear_cc_time_ms); |
johnc@1325 | 1448 | print_stats(1, "Min Clear CC", _min_clear_cc_time_ms); |
johnc@1325 | 1449 | print_stats(1, "Max Clear CC", _max_clear_cc_time_ms); |
johnc@1325 | 1450 | if (_num_cc_clears > 0) { |
johnc@1325 | 1451 | print_stats(1, "Avg Clear CC", _cum_clear_cc_time_ms / ((double)_num_cc_clears)); |
johnc@1325 | 1452 | } |
johnc@1325 | 1453 | #endif |
ysr@777 | 1454 | print_stats(1, "Other", other_time_ms); |
johnc@3296 | 1455 | print_stats(2, "Choose CSet", |
johnc@3296 | 1456 | (_recorded_young_cset_choice_time_ms + |
johnc@3296 | 1457 | _recorded_non_young_cset_choice_time_ms)); |
johnc@3175 | 1458 | print_stats(2, "Ref Proc", _cur_ref_proc_time_ms); |
johnc@3175 | 1459 | print_stats(2, "Ref Enq", _cur_ref_enq_time_ms); |
johnc@3296 | 1460 | print_stats(2, "Free CSet", |
johnc@3296 | 1461 | (_recorded_young_free_cset_time_ms + |
johnc@3296 | 1462 | _recorded_non_young_free_cset_time_ms)); |
johnc@1829 | 1463 | |
ysr@777 | 1464 | for (int i = 0; i < _aux_num; ++i) { |
ysr@777 | 1465 | if (_cur_aux_times_set[i]) { |
ysr@777 | 1466 | char buffer[96]; |
ysr@777 | 1467 | sprintf(buffer, "Aux%d", i); |
ysr@777 | 1468 | print_stats(1, buffer, _cur_aux_times_ms[i]); |
ysr@777 | 1469 | } |
ysr@777 | 1470 | } |
ysr@777 | 1471 | } |
ysr@777 | 1472 | |
ysr@777 | 1473 | // Update the efficiency-since-mark vars. |
ysr@777 | 1474 | double proc_ms = elapsed_ms * (double) _parallel_gc_threads; |
ysr@777 | 1475 | if (elapsed_ms < MIN_TIMER_GRANULARITY) { |
ysr@777 | 1476 | // This usually happens due to the timer not having the required |
ysr@777 | 1477 | // granularity. Some Linuxes are the usual culprits. |
ysr@777 | 1478 | // We'll just set it to something (arbitrarily) small. |
ysr@777 | 1479 | proc_ms = 1.0; |
ysr@777 | 1480 | } |
ysr@777 | 1481 | double cur_efficiency = (double) freed_bytes / proc_ms; |
ysr@777 | 1482 | |
ysr@777 | 1483 | bool new_in_marking_window = _in_marking_window; |
ysr@777 | 1484 | bool new_in_marking_window_im = false; |
tonyp@1794 | 1485 | if (during_initial_mark_pause()) { |
ysr@777 | 1486 | new_in_marking_window = true; |
ysr@777 | 1487 | new_in_marking_window_im = true; |
ysr@777 | 1488 | } |
ysr@777 | 1489 | |
tonyp@3337 | 1490 | if (_last_young_gc) { |
johnc@3178 | 1491 | if (!last_pause_included_initial_mark) { |
tonyp@3337 | 1492 | ergo_verbose2(ErgoMixedGCs, |
tonyp@3337 | 1493 | "start mixed GCs", |
johnc@3178 | 1494 | ergo_format_byte_perc("known garbage"), |
johnc@3178 | 1495 | _known_garbage_bytes, _known_garbage_ratio * 100.0); |
tonyp@3337 | 1496 | set_gcs_are_young(false); |
johnc@3178 | 1497 | } else { |
tonyp@3337 | 1498 | ergo_verbose0(ErgoMixedGCs, |
tonyp@3337 | 1499 | "do not start mixed GCs", |
johnc@3178 | 1500 | ergo_format_reason("concurrent cycle is about to start")); |
johnc@3178 | 1501 | } |
tonyp@3337 | 1502 | _last_young_gc = false; |
brutisso@3065 | 1503 | } |
brutisso@3065 | 1504 | |
tonyp@3337 | 1505 | if (!_last_gc_was_young) { |
tonyp@3337 | 1506 | if (_should_revert_to_young_gcs) { |
tonyp@3337 | 1507 | ergo_verbose2(ErgoMixedGCs, |
tonyp@3337 | 1508 | "end mixed GCs", |
tonyp@3337 | 1509 | ergo_format_reason("mixed GCs end requested") |
tonyp@3114 | 1510 | ergo_format_byte_perc("known garbage"), |
tonyp@3114 | 1511 | _known_garbage_bytes, _known_garbage_ratio * 100.0); |
tonyp@3337 | 1512 | set_gcs_are_young(true); |
tonyp@3114 | 1513 | } else if (_known_garbage_ratio < 0.05) { |
tonyp@3337 | 1514 | ergo_verbose3(ErgoMixedGCs, |
tonyp@3337 | 1515 | "end mixed GCs", |
tonyp@3114 | 1516 | ergo_format_reason("known garbage percent lower than threshold") |
tonyp@3114 | 1517 | ergo_format_byte_perc("known garbage") |
tonyp@3114 | 1518 | ergo_format_perc("threshold"), |
tonyp@3114 | 1519 | _known_garbage_bytes, _known_garbage_ratio * 100.0, |
tonyp@3114 | 1520 | 0.05 * 100.0); |
tonyp@3337 | 1521 | set_gcs_are_young(true); |
tonyp@3114 | 1522 | } else if (adaptive_young_list_length() && |
tonyp@3114 | 1523 | (get_gc_eff_factor() * cur_efficiency < predict_young_gc_eff())) { |
tonyp@3337 | 1524 | ergo_verbose5(ErgoMixedGCs, |
tonyp@3337 | 1525 | "end mixed GCs", |
tonyp@3114 | 1526 | ergo_format_reason("current GC efficiency lower than " |
tonyp@3337 | 1527 | "predicted young GC efficiency") |
tonyp@3114 | 1528 | ergo_format_double("GC efficiency factor") |
tonyp@3114 | 1529 | ergo_format_double("current GC efficiency") |
tonyp@3337 | 1530 | ergo_format_double("predicted young GC efficiency") |
tonyp@3114 | 1531 | ergo_format_byte_perc("known garbage"), |
tonyp@3114 | 1532 | get_gc_eff_factor(), cur_efficiency, |
tonyp@3114 | 1533 | predict_young_gc_eff(), |
tonyp@3114 | 1534 | _known_garbage_bytes, _known_garbage_ratio * 100.0); |
tonyp@3337 | 1535 | set_gcs_are_young(true); |
ysr@777 | 1536 | } |
brutisso@3065 | 1537 | } |
tonyp@3337 | 1538 | _should_revert_to_young_gcs = false; |
tonyp@3337 | 1539 | |
tonyp@3337 | 1540 | if (_last_gc_was_young && !_during_marking) { |
brutisso@3065 | 1541 | _young_gc_eff_seq->add(cur_efficiency); |
ysr@777 | 1542 | } |
ysr@777 | 1543 | |
ysr@777 | 1544 | _short_lived_surv_rate_group->start_adding_regions(); |
ysr@777 | 1545 | // do that for any other surv rate groupsx |
ysr@777 | 1546 | |
apetrusenko@1112 | 1547 | if (update_stats) { |
ysr@777 | 1548 | double pause_time_ms = elapsed_ms; |
ysr@777 | 1549 | |
ysr@777 | 1550 | size_t diff = 0; |
ysr@777 | 1551 | if (_max_pending_cards >= _pending_cards) |
ysr@777 | 1552 | diff = _max_pending_cards - _pending_cards; |
ysr@777 | 1553 | _pending_card_diff_seq->add((double) diff); |
ysr@777 | 1554 | |
ysr@777 | 1555 | double cost_per_card_ms = 0.0; |
ysr@777 | 1556 | if (_pending_cards > 0) { |
ysr@777 | 1557 | cost_per_card_ms = update_rs_time / (double) _pending_cards; |
ysr@777 | 1558 | _cost_per_card_ms_seq->add(cost_per_card_ms); |
ysr@777 | 1559 | } |
ysr@777 | 1560 | |
ysr@777 | 1561 | size_t cards_scanned = _g1->cards_scanned(); |
ysr@777 | 1562 | |
ysr@777 | 1563 | double cost_per_entry_ms = 0.0; |
ysr@777 | 1564 | if (cards_scanned > 10) { |
ysr@777 | 1565 | cost_per_entry_ms = scan_rs_time / (double) cards_scanned; |
tonyp@3337 | 1566 | if (_last_gc_was_young) { |
ysr@777 | 1567 | _cost_per_entry_ms_seq->add(cost_per_entry_ms); |
tonyp@3337 | 1568 | } else { |
tonyp@3337 | 1569 | _mixed_cost_per_entry_ms_seq->add(cost_per_entry_ms); |
tonyp@3337 | 1570 | } |
ysr@777 | 1571 | } |
ysr@777 | 1572 | |
ysr@777 | 1573 | if (_max_rs_lengths > 0) { |
ysr@777 | 1574 | double cards_per_entry_ratio = |
ysr@777 | 1575 | (double) cards_scanned / (double) _max_rs_lengths; |
tonyp@3337 | 1576 | if (_last_gc_was_young) { |
tonyp@3337 | 1577 | _young_cards_per_entry_ratio_seq->add(cards_per_entry_ratio); |
tonyp@3337 | 1578 | } else { |
tonyp@3337 | 1579 | _mixed_cards_per_entry_ratio_seq->add(cards_per_entry_ratio); |
tonyp@3337 | 1580 | } |
ysr@777 | 1581 | } |
ysr@777 | 1582 | |
tonyp@3356 | 1583 | // This is defensive. For a while _max_rs_lengths could get |
tonyp@3356 | 1584 | // smaller than _recorded_rs_lengths which was causing |
tonyp@3356 | 1585 | // rs_length_diff to get very large and mess up the RSet length |
tonyp@3356 | 1586 | // predictions. The reason was unsafe concurrent updates to the |
tonyp@3356 | 1587 | // _inc_cset_recorded_rs_lengths field which the code below guards |
tonyp@3356 | 1588 | // against (see CR 7118202). This bug has now been fixed (see CR |
tonyp@3356 | 1589 | // 7119027). However, I'm still worried that |
tonyp@3356 | 1590 | // _inc_cset_recorded_rs_lengths might still end up somewhat |
tonyp@3356 | 1591 | // inaccurate. The concurrent refinement thread calculates an |
tonyp@3356 | 1592 | // RSet's length concurrently with other CR threads updating it |
tonyp@3356 | 1593 | // which might cause it to calculate the length incorrectly (if, |
tonyp@3356 | 1594 | // say, it's in mid-coarsening). So I'll leave in the defensive |
tonyp@3356 | 1595 | // conditional below just in case. |
tonyp@3326 | 1596 | size_t rs_length_diff = 0; |
tonyp@3326 | 1597 | if (_max_rs_lengths > _recorded_rs_lengths) { |
tonyp@3326 | 1598 | rs_length_diff = _max_rs_lengths - _recorded_rs_lengths; |
tonyp@3326 | 1599 | } |
tonyp@3326 | 1600 | _rs_length_diff_seq->add((double) rs_length_diff); |
ysr@777 | 1601 | |
ysr@777 | 1602 | size_t copied_bytes = surviving_bytes; |
ysr@777 | 1603 | double cost_per_byte_ms = 0.0; |
ysr@777 | 1604 | if (copied_bytes > 0) { |
ysr@777 | 1605 | cost_per_byte_ms = obj_copy_time / (double) copied_bytes; |
tonyp@3337 | 1606 | if (_in_marking_window) { |
ysr@777 | 1607 | _cost_per_byte_ms_during_cm_seq->add(cost_per_byte_ms); |
tonyp@3337 | 1608 | } else { |
ysr@777 | 1609 | _cost_per_byte_ms_seq->add(cost_per_byte_ms); |
tonyp@3337 | 1610 | } |
ysr@777 | 1611 | } |
ysr@777 | 1612 | |
ysr@777 | 1613 | double all_other_time_ms = pause_time_ms - |
johnc@1829 | 1614 | (update_rs_time + scan_rs_time + obj_copy_time + |
ysr@777 | 1615 | _mark_closure_time_ms + termination_time); |
ysr@777 | 1616 | |
ysr@777 | 1617 | double young_other_time_ms = 0.0; |
tonyp@3289 | 1618 | if (young_cset_region_length() > 0) { |
ysr@777 | 1619 | young_other_time_ms = |
ysr@777 | 1620 | _recorded_young_cset_choice_time_ms + |
ysr@777 | 1621 | _recorded_young_free_cset_time_ms; |
ysr@777 | 1622 | _young_other_cost_per_region_ms_seq->add(young_other_time_ms / |
tonyp@3289 | 1623 | (double) young_cset_region_length()); |
ysr@777 | 1624 | } |
ysr@777 | 1625 | double non_young_other_time_ms = 0.0; |
tonyp@3289 | 1626 | if (old_cset_region_length() > 0) { |
ysr@777 | 1627 | non_young_other_time_ms = |
ysr@777 | 1628 | _recorded_non_young_cset_choice_time_ms + |
ysr@777 | 1629 | _recorded_non_young_free_cset_time_ms; |
ysr@777 | 1630 | |
ysr@777 | 1631 | _non_young_other_cost_per_region_ms_seq->add(non_young_other_time_ms / |
tonyp@3289 | 1632 | (double) old_cset_region_length()); |
ysr@777 | 1633 | } |
ysr@777 | 1634 | |
ysr@777 | 1635 | double constant_other_time_ms = all_other_time_ms - |
ysr@777 | 1636 | (young_other_time_ms + non_young_other_time_ms); |
ysr@777 | 1637 | _constant_other_time_ms_seq->add(constant_other_time_ms); |
ysr@777 | 1638 | |
ysr@777 | 1639 | double survival_ratio = 0.0; |
ysr@777 | 1640 | if (_bytes_in_collection_set_before_gc > 0) { |
tonyp@3028 | 1641 | survival_ratio = (double) _bytes_copied_during_gc / |
tonyp@3028 | 1642 | (double) _bytes_in_collection_set_before_gc; |
ysr@777 | 1643 | } |
ysr@777 | 1644 | |
ysr@777 | 1645 | _pending_cards_seq->add((double) _pending_cards); |
ysr@777 | 1646 | _rs_lengths_seq->add((double) _max_rs_lengths); |
ysr@777 | 1647 | |
ysr@777 | 1648 | double expensive_region_limit_ms = |
johnc@1186 | 1649 | (double) MaxGCPauseMillis - predict_constant_other_time_ms(); |
ysr@777 | 1650 | if (expensive_region_limit_ms < 0.0) { |
ysr@777 | 1651 | // this means that the other time was predicted to be longer than |
ysr@777 | 1652 | // than the max pause time |
johnc@1186 | 1653 | expensive_region_limit_ms = (double) MaxGCPauseMillis; |
ysr@777 | 1654 | } |
ysr@777 | 1655 | _expensive_region_limit_ms = expensive_region_limit_ms; |
ysr@777 | 1656 | } |
ysr@777 | 1657 | |
ysr@777 | 1658 | _in_marking_window = new_in_marking_window; |
ysr@777 | 1659 | _in_marking_window_im = new_in_marking_window_im; |
ysr@777 | 1660 | _free_regions_at_end_of_collection = _g1->free_regions(); |
tonyp@3119 | 1661 | update_young_list_target_length(); |
ysr@777 | 1662 | |
iveresov@1546 | 1663 | // Note that _mmu_tracker->max_gc_time() returns the time in seconds. |
tonyp@1717 | 1664 | double update_rs_time_goal_ms = _mmu_tracker->max_gc_time() * MILLIUNITS * G1RSetUpdatingPauseTimePercent / 100.0; |
iveresov@1546 | 1665 | adjust_concurrent_refinement(update_rs_time, update_rs_processed_buffers, update_rs_time_goal_ms); |
tonyp@3209 | 1666 | |
tonyp@3209 | 1667 | assert(assertMarkedBytesDataOK(), "Marked regions not OK at pause end."); |
ysr@777 | 1668 | } |
ysr@777 | 1669 | |
tonyp@2961 | 1670 | #define EXT_SIZE_FORMAT "%d%s" |
tonyp@2961 | 1671 | #define EXT_SIZE_PARAMS(bytes) \ |
tonyp@2961 | 1672 | byte_size_in_proper_unit((bytes)), \ |
tonyp@2961 | 1673 | proper_unit_for_byte_size((bytes)) |
tonyp@2961 | 1674 | |
tonyp@2961 | 1675 | void G1CollectorPolicy::print_heap_transition() { |
tonyp@2961 | 1676 | if (PrintGCDetails) { |
tonyp@2961 | 1677 | YoungList* young_list = _g1->young_list(); |
tonyp@2961 | 1678 | size_t eden_bytes = young_list->eden_used_bytes(); |
tonyp@2961 | 1679 | size_t survivor_bytes = young_list->survivor_used_bytes(); |
tonyp@2961 | 1680 | size_t used_before_gc = _cur_collection_pause_used_at_start_bytes; |
tonyp@2961 | 1681 | size_t used = _g1->used(); |
tonyp@2961 | 1682 | size_t capacity = _g1->capacity(); |
brutisso@3120 | 1683 | size_t eden_capacity = |
brutisso@3120 | 1684 | (_young_list_target_length * HeapRegion::GrainBytes) - survivor_bytes; |
tonyp@2961 | 1685 | |
tonyp@2961 | 1686 | gclog_or_tty->print_cr( |
brutisso@3120 | 1687 | " [Eden: "EXT_SIZE_FORMAT"("EXT_SIZE_FORMAT")->"EXT_SIZE_FORMAT"("EXT_SIZE_FORMAT") " |
brutisso@3120 | 1688 | "Survivors: "EXT_SIZE_FORMAT"->"EXT_SIZE_FORMAT" " |
brutisso@3120 | 1689 | "Heap: "EXT_SIZE_FORMAT"("EXT_SIZE_FORMAT")->" |
brutisso@3120 | 1690 | EXT_SIZE_FORMAT"("EXT_SIZE_FORMAT")]", |
brutisso@3120 | 1691 | EXT_SIZE_PARAMS(_eden_bytes_before_gc), |
brutisso@3120 | 1692 | EXT_SIZE_PARAMS(_prev_eden_capacity), |
brutisso@3120 | 1693 | EXT_SIZE_PARAMS(eden_bytes), |
brutisso@3120 | 1694 | EXT_SIZE_PARAMS(eden_capacity), |
brutisso@3120 | 1695 | EXT_SIZE_PARAMS(_survivor_bytes_before_gc), |
brutisso@3120 | 1696 | EXT_SIZE_PARAMS(survivor_bytes), |
brutisso@3120 | 1697 | EXT_SIZE_PARAMS(used_before_gc), |
brutisso@3120 | 1698 | EXT_SIZE_PARAMS(_capacity_before_gc), |
brutisso@3120 | 1699 | EXT_SIZE_PARAMS(used), |
brutisso@3120 | 1700 | EXT_SIZE_PARAMS(capacity)); |
brutisso@3120 | 1701 | |
brutisso@3120 | 1702 | _prev_eden_capacity = eden_capacity; |
tonyp@2961 | 1703 | } else if (PrintGC) { |
tonyp@2961 | 1704 | _g1->print_size_transition(gclog_or_tty, |
tonyp@2961 | 1705 | _cur_collection_pause_used_at_start_bytes, |
tonyp@2961 | 1706 | _g1->used(), _g1->capacity()); |
tonyp@2961 | 1707 | } |
tonyp@2961 | 1708 | } |
tonyp@2961 | 1709 | |
iveresov@1546 | 1710 | void G1CollectorPolicy::adjust_concurrent_refinement(double update_rs_time, |
iveresov@1546 | 1711 | double update_rs_processed_buffers, |
iveresov@1546 | 1712 | double goal_ms) { |
iveresov@1546 | 1713 | DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set(); |
iveresov@1546 | 1714 | ConcurrentG1Refine *cg1r = G1CollectedHeap::heap()->concurrent_g1_refine(); |
iveresov@1546 | 1715 | |
tonyp@1717 | 1716 | if (G1UseAdaptiveConcRefinement) { |
iveresov@1546 | 1717 | const int k_gy = 3, k_gr = 6; |
iveresov@1546 | 1718 | const double inc_k = 1.1, dec_k = 0.9; |
iveresov@1546 | 1719 | |
iveresov@1546 | 1720 | int g = cg1r->green_zone(); |
iveresov@1546 | 1721 | if (update_rs_time > goal_ms) { |
iveresov@1546 | 1722 | g = (int)(g * dec_k); // Can become 0, that's OK. That would mean a mutator-only processing. |
iveresov@1546 | 1723 | } else { |
iveresov@1546 | 1724 | if (update_rs_time < goal_ms && update_rs_processed_buffers > g) { |
iveresov@1546 | 1725 | g = (int)MAX2(g * inc_k, g + 1.0); |
iveresov@1546 | 1726 | } |
iveresov@1546 | 1727 | } |
iveresov@1546 | 1728 | // Change the refinement threads params |
iveresov@1546 | 1729 | cg1r->set_green_zone(g); |
iveresov@1546 | 1730 | cg1r->set_yellow_zone(g * k_gy); |
iveresov@1546 | 1731 | cg1r->set_red_zone(g * k_gr); |
iveresov@1546 | 1732 | cg1r->reinitialize_threads(); |
iveresov@1546 | 1733 | |
iveresov@1546 | 1734 | int processing_threshold_delta = MAX2((int)(cg1r->green_zone() * sigma()), 1); |
iveresov@1546 | 1735 | int processing_threshold = MIN2(cg1r->green_zone() + processing_threshold_delta, |
iveresov@1546 | 1736 | cg1r->yellow_zone()); |
iveresov@1546 | 1737 | // Change the barrier params |
iveresov@1546 | 1738 | dcqs.set_process_completed_threshold(processing_threshold); |
iveresov@1546 | 1739 | dcqs.set_max_completed_queue(cg1r->red_zone()); |
iveresov@1546 | 1740 | } |
iveresov@1546 | 1741 | |
iveresov@1546 | 1742 | int curr_queue_size = dcqs.completed_buffers_num(); |
iveresov@1546 | 1743 | if (curr_queue_size >= cg1r->yellow_zone()) { |
iveresov@1546 | 1744 | dcqs.set_completed_queue_padding(curr_queue_size); |
iveresov@1546 | 1745 | } else { |
iveresov@1546 | 1746 | dcqs.set_completed_queue_padding(0); |
iveresov@1546 | 1747 | } |
iveresov@1546 | 1748 | dcqs.notify_if_necessary(); |
iveresov@1546 | 1749 | } |
iveresov@1546 | 1750 | |
ysr@777 | 1751 | double |
ysr@777 | 1752 | G1CollectorPolicy:: |
ysr@777 | 1753 | predict_young_collection_elapsed_time_ms(size_t adjustment) { |
ysr@777 | 1754 | guarantee( adjustment == 0 || adjustment == 1, "invariant" ); |
ysr@777 | 1755 | |
ysr@777 | 1756 | G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
johnc@1829 | 1757 | size_t young_num = g1h->young_list()->length(); |
ysr@777 | 1758 | if (young_num == 0) |
ysr@777 | 1759 | return 0.0; |
ysr@777 | 1760 | |
ysr@777 | 1761 | young_num += adjustment; |
ysr@777 | 1762 | size_t pending_cards = predict_pending_cards(); |
johnc@1829 | 1763 | size_t rs_lengths = g1h->young_list()->sampled_rs_lengths() + |
ysr@777 | 1764 | predict_rs_length_diff(); |
ysr@777 | 1765 | size_t card_num; |
tonyp@3337 | 1766 | if (gcs_are_young()) { |
ysr@777 | 1767 | card_num = predict_young_card_num(rs_lengths); |
tonyp@3337 | 1768 | } else { |
ysr@777 | 1769 | card_num = predict_non_young_card_num(rs_lengths); |
tonyp@3337 | 1770 | } |
ysr@777 | 1771 | size_t young_byte_size = young_num * HeapRegion::GrainBytes; |
ysr@777 | 1772 | double accum_yg_surv_rate = |
ysr@777 | 1773 | _short_lived_surv_rate_group->accum_surv_rate(adjustment); |
ysr@777 | 1774 | |
ysr@777 | 1775 | size_t bytes_to_copy = |
ysr@777 | 1776 | (size_t) (accum_yg_surv_rate * (double) HeapRegion::GrainBytes); |
ysr@777 | 1777 | |
ysr@777 | 1778 | return |
ysr@777 | 1779 | predict_rs_update_time_ms(pending_cards) + |
ysr@777 | 1780 | predict_rs_scan_time_ms(card_num) + |
ysr@777 | 1781 | predict_object_copy_time_ms(bytes_to_copy) + |
ysr@777 | 1782 | predict_young_other_time_ms(young_num) + |
ysr@777 | 1783 | predict_constant_other_time_ms(); |
ysr@777 | 1784 | } |
ysr@777 | 1785 | |
ysr@777 | 1786 | double |
ysr@777 | 1787 | G1CollectorPolicy::predict_base_elapsed_time_ms(size_t pending_cards) { |
ysr@777 | 1788 | size_t rs_length = predict_rs_length_diff(); |
ysr@777 | 1789 | size_t card_num; |
tonyp@3337 | 1790 | if (gcs_are_young()) { |
ysr@777 | 1791 | card_num = predict_young_card_num(rs_length); |
tonyp@3337 | 1792 | } else { |
ysr@777 | 1793 | card_num = predict_non_young_card_num(rs_length); |
tonyp@3337 | 1794 | } |
ysr@777 | 1795 | return predict_base_elapsed_time_ms(pending_cards, card_num); |
ysr@777 | 1796 | } |
ysr@777 | 1797 | |
ysr@777 | 1798 | double |
ysr@777 | 1799 | G1CollectorPolicy::predict_base_elapsed_time_ms(size_t pending_cards, |
ysr@777 | 1800 | size_t scanned_cards) { |
ysr@777 | 1801 | return |
ysr@777 | 1802 | predict_rs_update_time_ms(pending_cards) + |
ysr@777 | 1803 | predict_rs_scan_time_ms(scanned_cards) + |
ysr@777 | 1804 | predict_constant_other_time_ms(); |
ysr@777 | 1805 | } |
ysr@777 | 1806 | |
ysr@777 | 1807 | double |
ysr@777 | 1808 | G1CollectorPolicy::predict_region_elapsed_time_ms(HeapRegion* hr, |
ysr@777 | 1809 | bool young) { |
ysr@777 | 1810 | size_t rs_length = hr->rem_set()->occupied(); |
ysr@777 | 1811 | size_t card_num; |
tonyp@3337 | 1812 | if (gcs_are_young()) { |
ysr@777 | 1813 | card_num = predict_young_card_num(rs_length); |
tonyp@3337 | 1814 | } else { |
ysr@777 | 1815 | card_num = predict_non_young_card_num(rs_length); |
tonyp@3337 | 1816 | } |
ysr@777 | 1817 | size_t bytes_to_copy = predict_bytes_to_copy(hr); |
ysr@777 | 1818 | |
ysr@777 | 1819 | double region_elapsed_time_ms = |
ysr@777 | 1820 | predict_rs_scan_time_ms(card_num) + |
ysr@777 | 1821 | predict_object_copy_time_ms(bytes_to_copy); |
ysr@777 | 1822 | |
ysr@777 | 1823 | if (young) |
ysr@777 | 1824 | region_elapsed_time_ms += predict_young_other_time_ms(1); |
ysr@777 | 1825 | else |
ysr@777 | 1826 | region_elapsed_time_ms += predict_non_young_other_time_ms(1); |
ysr@777 | 1827 | |
ysr@777 | 1828 | return region_elapsed_time_ms; |
ysr@777 | 1829 | } |
ysr@777 | 1830 | |
ysr@777 | 1831 | size_t |
ysr@777 | 1832 | G1CollectorPolicy::predict_bytes_to_copy(HeapRegion* hr) { |
ysr@777 | 1833 | size_t bytes_to_copy; |
ysr@777 | 1834 | if (hr->is_marked()) |
ysr@777 | 1835 | bytes_to_copy = hr->max_live_bytes(); |
ysr@777 | 1836 | else { |
ysr@777 | 1837 | guarantee( hr->is_young() && hr->age_in_surv_rate_group() != -1, |
ysr@777 | 1838 | "invariant" ); |
ysr@777 | 1839 | int age = hr->age_in_surv_rate_group(); |
apetrusenko@980 | 1840 | double yg_surv_rate = predict_yg_surv_rate(age, hr->surv_rate_group()); |
ysr@777 | 1841 | bytes_to_copy = (size_t) ((double) hr->used() * yg_surv_rate); |
ysr@777 | 1842 | } |
ysr@777 | 1843 | |
ysr@777 | 1844 | return bytes_to_copy; |
ysr@777 | 1845 | } |
ysr@777 | 1846 | |
ysr@777 | 1847 | void |
tonyp@3289 | 1848 | G1CollectorPolicy::init_cset_region_lengths(size_t eden_cset_region_length, |
tonyp@3289 | 1849 | size_t survivor_cset_region_length) { |
tonyp@3289 | 1850 | _eden_cset_region_length = eden_cset_region_length; |
tonyp@3289 | 1851 | _survivor_cset_region_length = survivor_cset_region_length; |
tonyp@3289 | 1852 | _old_cset_region_length = 0; |
johnc@1829 | 1853 | } |
johnc@1829 | 1854 | |
johnc@1829 | 1855 | void G1CollectorPolicy::set_recorded_rs_lengths(size_t rs_lengths) { |
johnc@1829 | 1856 | _recorded_rs_lengths = rs_lengths; |
johnc@1829 | 1857 | } |
johnc@1829 | 1858 | |
ysr@777 | 1859 | void G1CollectorPolicy::check_if_region_is_too_expensive(double |
ysr@777 | 1860 | predicted_time_ms) { |
ysr@777 | 1861 | // I don't think we need to do this when in young GC mode since |
ysr@777 | 1862 | // marking will be initiated next time we hit the soft limit anyway... |
ysr@777 | 1863 | if (predicted_time_ms > _expensive_region_limit_ms) { |
tonyp@3337 | 1864 | ergo_verbose2(ErgoMixedGCs, |
tonyp@3337 | 1865 | "request mixed GCs end", |
tonyp@3114 | 1866 | ergo_format_reason("predicted region time higher than threshold") |
tonyp@3114 | 1867 | ergo_format_ms("predicted region time") |
tonyp@3114 | 1868 | ergo_format_ms("threshold"), |
tonyp@3114 | 1869 | predicted_time_ms, _expensive_region_limit_ms); |
tonyp@3337 | 1870 | // no point in doing another mixed GC |
tonyp@3337 | 1871 | _should_revert_to_young_gcs = true; |
ysr@777 | 1872 | } |
ysr@777 | 1873 | } |
ysr@777 | 1874 | |
ysr@777 | 1875 | void G1CollectorPolicy::update_recent_gc_times(double end_time_sec, |
ysr@777 | 1876 | double elapsed_ms) { |
ysr@777 | 1877 | _recent_gc_times_ms->add(elapsed_ms); |
ysr@777 | 1878 | _recent_prev_end_times_for_all_gcs_sec->add(end_time_sec); |
ysr@777 | 1879 | _prev_collection_pause_end_ms = end_time_sec * 1000.0; |
ysr@777 | 1880 | } |
ysr@777 | 1881 | |
ysr@777 | 1882 | size_t G1CollectorPolicy::expansion_amount() { |
tonyp@3114 | 1883 | double recent_gc_overhead = recent_avg_pause_time_ratio() * 100.0; |
tonyp@3114 | 1884 | double threshold = _gc_overhead_perc; |
tonyp@3114 | 1885 | if (recent_gc_overhead > threshold) { |
johnc@1186 | 1886 | // We will double the existing space, or take |
johnc@1186 | 1887 | // G1ExpandByPercentOfAvailable % of the available expansion |
johnc@1186 | 1888 | // space, whichever is smaller, bounded below by a minimum |
johnc@1186 | 1889 | // expansion (unless that's all that's left.) |
ysr@777 | 1890 | const size_t min_expand_bytes = 1*M; |
johnc@2504 | 1891 | size_t reserved_bytes = _g1->max_capacity(); |
ysr@777 | 1892 | size_t committed_bytes = _g1->capacity(); |
ysr@777 | 1893 | size_t uncommitted_bytes = reserved_bytes - committed_bytes; |
ysr@777 | 1894 | size_t expand_bytes; |
ysr@777 | 1895 | size_t expand_bytes_via_pct = |
johnc@1186 | 1896 | uncommitted_bytes * G1ExpandByPercentOfAvailable / 100; |
ysr@777 | 1897 | expand_bytes = MIN2(expand_bytes_via_pct, committed_bytes); |
ysr@777 | 1898 | expand_bytes = MAX2(expand_bytes, min_expand_bytes); |
ysr@777 | 1899 | expand_bytes = MIN2(expand_bytes, uncommitted_bytes); |
tonyp@3114 | 1900 | |
tonyp@3114 | 1901 | ergo_verbose5(ErgoHeapSizing, |
tonyp@3114 | 1902 | "attempt heap expansion", |
tonyp@3114 | 1903 | ergo_format_reason("recent GC overhead higher than " |
tonyp@3114 | 1904 | "threshold after GC") |
tonyp@3114 | 1905 | ergo_format_perc("recent GC overhead") |
tonyp@3114 | 1906 | ergo_format_perc("threshold") |
tonyp@3114 | 1907 | ergo_format_byte("uncommitted") |
tonyp@3114 | 1908 | ergo_format_byte_perc("calculated expansion amount"), |
tonyp@3114 | 1909 | recent_gc_overhead, threshold, |
tonyp@3114 | 1910 | uncommitted_bytes, |
tonyp@3114 | 1911 | expand_bytes_via_pct, (double) G1ExpandByPercentOfAvailable); |
tonyp@3114 | 1912 | |
ysr@777 | 1913 | return expand_bytes; |
ysr@777 | 1914 | } else { |
ysr@777 | 1915 | return 0; |
ysr@777 | 1916 | } |
ysr@777 | 1917 | } |
ysr@777 | 1918 | |
ysr@777 | 1919 | class CountCSClosure: public HeapRegionClosure { |
ysr@777 | 1920 | G1CollectorPolicy* _g1_policy; |
ysr@777 | 1921 | public: |
ysr@777 | 1922 | CountCSClosure(G1CollectorPolicy* g1_policy) : |
ysr@777 | 1923 | _g1_policy(g1_policy) {} |
ysr@777 | 1924 | bool doHeapRegion(HeapRegion* r) { |
ysr@777 | 1925 | _g1_policy->_bytes_in_collection_set_before_gc += r->used(); |
ysr@777 | 1926 | return false; |
ysr@777 | 1927 | } |
ysr@777 | 1928 | }; |
ysr@777 | 1929 | |
ysr@777 | 1930 | void G1CollectorPolicy::count_CS_bytes_used() { |
ysr@777 | 1931 | CountCSClosure cs_closure(this); |
ysr@777 | 1932 | _g1->collection_set_iterate(&cs_closure); |
ysr@777 | 1933 | } |
ysr@777 | 1934 | |
johnc@3219 | 1935 | void G1CollectorPolicy::print_summary(int level, |
johnc@3219 | 1936 | const char* str, |
johnc@3219 | 1937 | NumberSeq* seq) const { |
ysr@777 | 1938 | double sum = seq->sum(); |
brutisso@2645 | 1939 | LineBuffer(level + 1).append_and_print_cr("%-24s = %8.2lf s (avg = %8.2lf ms)", |
ysr@777 | 1940 | str, sum / 1000.0, seq->avg()); |
ysr@777 | 1941 | } |
ysr@777 | 1942 | |
johnc@3219 | 1943 | void G1CollectorPolicy::print_summary_sd(int level, |
johnc@3219 | 1944 | const char* str, |
johnc@3219 | 1945 | NumberSeq* seq) const { |
ysr@777 | 1946 | print_summary(level, str, seq); |
brutisso@2645 | 1947 | LineBuffer(level + 6).append_and_print_cr("(num = %5d, std dev = %8.2lf ms, max = %8.2lf ms)", |
ysr@777 | 1948 | seq->num(), seq->sd(), seq->maximum()); |
ysr@777 | 1949 | } |
ysr@777 | 1950 | |
ysr@777 | 1951 | void G1CollectorPolicy::check_other_times(int level, |
ysr@777 | 1952 | NumberSeq* other_times_ms, |
ysr@777 | 1953 | NumberSeq* calc_other_times_ms) const { |
ysr@777 | 1954 | bool should_print = false; |
brutisso@2645 | 1955 | LineBuffer buf(level + 2); |
ysr@777 | 1956 | |
ysr@777 | 1957 | double max_sum = MAX2(fabs(other_times_ms->sum()), |
ysr@777 | 1958 | fabs(calc_other_times_ms->sum())); |
ysr@777 | 1959 | double min_sum = MIN2(fabs(other_times_ms->sum()), |
ysr@777 | 1960 | fabs(calc_other_times_ms->sum())); |
ysr@777 | 1961 | double sum_ratio = max_sum / min_sum; |
ysr@777 | 1962 | if (sum_ratio > 1.1) { |
ysr@777 | 1963 | should_print = true; |
brutisso@2645 | 1964 | buf.append_and_print_cr("## CALCULATED OTHER SUM DOESN'T MATCH RECORDED ###"); |
ysr@777 | 1965 | } |
ysr@777 | 1966 | |
ysr@777 | 1967 | double max_avg = MAX2(fabs(other_times_ms->avg()), |
ysr@777 | 1968 | fabs(calc_other_times_ms->avg())); |
ysr@777 | 1969 | double min_avg = MIN2(fabs(other_times_ms->avg()), |
ysr@777 | 1970 | fabs(calc_other_times_ms->avg())); |
ysr@777 | 1971 | double avg_ratio = max_avg / min_avg; |
ysr@777 | 1972 | if (avg_ratio > 1.1) { |
ysr@777 | 1973 | should_print = true; |
brutisso@2645 | 1974 | buf.append_and_print_cr("## CALCULATED OTHER AVG DOESN'T MATCH RECORDED ###"); |
ysr@777 | 1975 | } |
ysr@777 | 1976 | |
ysr@777 | 1977 | if (other_times_ms->sum() < -0.01) { |
brutisso@2645 | 1978 | buf.append_and_print_cr("## RECORDED OTHER SUM IS NEGATIVE ###"); |
ysr@777 | 1979 | } |
ysr@777 | 1980 | |
ysr@777 | 1981 | if (other_times_ms->avg() < -0.01) { |
brutisso@2645 | 1982 | buf.append_and_print_cr("## RECORDED OTHER AVG IS NEGATIVE ###"); |
ysr@777 | 1983 | } |
ysr@777 | 1984 | |
ysr@777 | 1985 | if (calc_other_times_ms->sum() < -0.01) { |
ysr@777 | 1986 | should_print = true; |
brutisso@2645 | 1987 | buf.append_and_print_cr("## CALCULATED OTHER SUM IS NEGATIVE ###"); |
ysr@777 | 1988 | } |
ysr@777 | 1989 | |
ysr@777 | 1990 | if (calc_other_times_ms->avg() < -0.01) { |
ysr@777 | 1991 | should_print = true; |
brutisso@2645 | 1992 | buf.append_and_print_cr("## CALCULATED OTHER AVG IS NEGATIVE ###"); |
ysr@777 | 1993 | } |
ysr@777 | 1994 | |
ysr@777 | 1995 | if (should_print) |
ysr@777 | 1996 | print_summary(level, "Other(Calc)", calc_other_times_ms); |
ysr@777 | 1997 | } |
ysr@777 | 1998 | |
ysr@777 | 1999 | void G1CollectorPolicy::print_summary(PauseSummary* summary) const { |
jmasa@2188 | 2000 | bool parallel = G1CollectedHeap::use_parallel_gc_threads(); |
ysr@777 | 2001 | MainBodySummary* body_summary = summary->main_body_summary(); |
ysr@777 | 2002 | if (summary->get_total_seq()->num() > 0) { |
apetrusenko@1112 | 2003 | print_summary_sd(0, "Evacuation Pauses", summary->get_total_seq()); |
ysr@777 | 2004 | if (body_summary != NULL) { |
ysr@777 | 2005 | if (parallel) { |
ysr@777 | 2006 | print_summary(1, "Parallel Time", body_summary->get_parallel_seq()); |
johnc@3219 | 2007 | print_summary(2, "Ext Root Scanning", body_summary->get_ext_root_scan_seq()); |
tonyp@3416 | 2008 | print_summary(2, "SATB Filtering", body_summary->get_satb_filtering_seq()); |
ysr@777 | 2009 | print_summary(2, "Update RS", body_summary->get_update_rs_seq()); |
ysr@777 | 2010 | print_summary(2, "Scan RS", body_summary->get_scan_rs_seq()); |
ysr@777 | 2011 | print_summary(2, "Object Copy", body_summary->get_obj_copy_seq()); |
ysr@777 | 2012 | print_summary(2, "Termination", body_summary->get_termination_seq()); |
johnc@3219 | 2013 | print_summary(2, "Parallel Other", body_summary->get_parallel_other_seq()); |
ysr@777 | 2014 | { |
ysr@777 | 2015 | NumberSeq* other_parts[] = { |
ysr@777 | 2016 | body_summary->get_ext_root_scan_seq(), |
tonyp@3416 | 2017 | body_summary->get_satb_filtering_seq(), |
johnc@3219 | 2018 | body_summary->get_update_rs_seq(), |
ysr@777 | 2019 | body_summary->get_scan_rs_seq(), |
ysr@777 | 2020 | body_summary->get_obj_copy_seq(), |
ysr@777 | 2021 | body_summary->get_termination_seq() |
ysr@777 | 2022 | }; |
ysr@777 | 2023 | NumberSeq calc_other_times_ms(body_summary->get_parallel_seq(), |
johnc@2134 | 2024 | 6, other_parts); |
ysr@777 | 2025 | check_other_times(2, body_summary->get_parallel_other_seq(), |
ysr@777 | 2026 | &calc_other_times_ms); |
ysr@777 | 2027 | } |
ysr@777 | 2028 | } else { |
johnc@3219 | 2029 | print_summary(1, "Ext Root Scanning", body_summary->get_ext_root_scan_seq()); |
tonyp@3416 | 2030 | print_summary(1, "SATB Filtering", body_summary->get_satb_filtering_seq()); |
ysr@777 | 2031 | print_summary(1, "Update RS", body_summary->get_update_rs_seq()); |
ysr@777 | 2032 | print_summary(1, "Scan RS", body_summary->get_scan_rs_seq()); |
ysr@777 | 2033 | print_summary(1, "Object Copy", body_summary->get_obj_copy_seq()); |
ysr@777 | 2034 | } |
ysr@777 | 2035 | } |
johnc@3219 | 2036 | print_summary(1, "Mark Closure", body_summary->get_mark_closure_seq()); |
johnc@3219 | 2037 | print_summary(1, "Clear CT", body_summary->get_clear_ct_seq()); |
ysr@777 | 2038 | print_summary(1, "Other", summary->get_other_seq()); |
ysr@777 | 2039 | { |
johnc@2134 | 2040 | if (body_summary != NULL) { |
johnc@2134 | 2041 | NumberSeq calc_other_times_ms; |
johnc@2134 | 2042 | if (parallel) { |
johnc@2134 | 2043 | // parallel |
johnc@2134 | 2044 | NumberSeq* other_parts[] = { |
johnc@2134 | 2045 | body_summary->get_satb_drain_seq(), |
johnc@2134 | 2046 | body_summary->get_parallel_seq(), |
johnc@2134 | 2047 | body_summary->get_clear_ct_seq() |
johnc@2134 | 2048 | }; |
johnc@2134 | 2049 | calc_other_times_ms = NumberSeq(summary->get_total_seq(), |
johnc@2134 | 2050 | 3, other_parts); |
johnc@2134 | 2051 | } else { |
johnc@2134 | 2052 | // serial |
johnc@2134 | 2053 | NumberSeq* other_parts[] = { |
johnc@2134 | 2054 | body_summary->get_satb_drain_seq(), |
johnc@2134 | 2055 | body_summary->get_update_rs_seq(), |
johnc@2134 | 2056 | body_summary->get_ext_root_scan_seq(), |
tonyp@3416 | 2057 | body_summary->get_satb_filtering_seq(), |
johnc@2134 | 2058 | body_summary->get_scan_rs_seq(), |
johnc@2134 | 2059 | body_summary->get_obj_copy_seq() |
johnc@2134 | 2060 | }; |
johnc@2134 | 2061 | calc_other_times_ms = NumberSeq(summary->get_total_seq(), |
johnc@2134 | 2062 | 6, other_parts); |
johnc@2134 | 2063 | } |
johnc@2134 | 2064 | check_other_times(1, summary->get_other_seq(), &calc_other_times_ms); |
ysr@777 | 2065 | } |
ysr@777 | 2066 | } |
ysr@777 | 2067 | } else { |
brutisso@2645 | 2068 | LineBuffer(1).append_and_print_cr("none"); |
ysr@777 | 2069 | } |
brutisso@2645 | 2070 | LineBuffer(0).append_and_print_cr(""); |
ysr@777 | 2071 | } |
ysr@777 | 2072 | |
ysr@777 | 2073 | void G1CollectorPolicy::print_tracing_info() const { |
ysr@777 | 2074 | if (TraceGen0Time) { |
ysr@777 | 2075 | gclog_or_tty->print_cr("ALL PAUSES"); |
ysr@777 | 2076 | print_summary_sd(0, "Total", _all_pause_times_ms); |
ysr@777 | 2077 | gclog_or_tty->print_cr(""); |
ysr@777 | 2078 | gclog_or_tty->print_cr(""); |
tonyp@3337 | 2079 | gclog_or_tty->print_cr(" Young GC Pauses: %8d", _young_pause_num); |
tonyp@3337 | 2080 | gclog_or_tty->print_cr(" Mixed GC Pauses: %8d", _mixed_pause_num); |
ysr@777 | 2081 | gclog_or_tty->print_cr(""); |
ysr@777 | 2082 | |
apetrusenko@1112 | 2083 | gclog_or_tty->print_cr("EVACUATION PAUSES"); |
apetrusenko@1112 | 2084 | print_summary(_summary); |
ysr@777 | 2085 | |
ysr@777 | 2086 | gclog_or_tty->print_cr("MISC"); |
ysr@777 | 2087 | print_summary_sd(0, "Stop World", _all_stop_world_times_ms); |
ysr@777 | 2088 | print_summary_sd(0, "Yields", _all_yield_times_ms); |
ysr@777 | 2089 | for (int i = 0; i < _aux_num; ++i) { |
ysr@777 | 2090 | if (_all_aux_times_ms[i].num() > 0) { |
ysr@777 | 2091 | char buffer[96]; |
ysr@777 | 2092 | sprintf(buffer, "Aux%d", i); |
ysr@777 | 2093 | print_summary_sd(0, buffer, &_all_aux_times_ms[i]); |
ysr@777 | 2094 | } |
ysr@777 | 2095 | } |
ysr@777 | 2096 | } |
ysr@777 | 2097 | if (TraceGen1Time) { |
ysr@777 | 2098 | if (_all_full_gc_times_ms->num() > 0) { |
ysr@777 | 2099 | gclog_or_tty->print("\n%4d full_gcs: total time = %8.2f s", |
ysr@777 | 2100 | _all_full_gc_times_ms->num(), |
ysr@777 | 2101 | _all_full_gc_times_ms->sum() / 1000.0); |
ysr@777 | 2102 | gclog_or_tty->print_cr(" (avg = %8.2fms).", _all_full_gc_times_ms->avg()); |
ysr@777 | 2103 | gclog_or_tty->print_cr(" [std. dev = %8.2f ms, max = %8.2f ms]", |
ysr@777 | 2104 | _all_full_gc_times_ms->sd(), |
ysr@777 | 2105 | _all_full_gc_times_ms->maximum()); |
ysr@777 | 2106 | } |
ysr@777 | 2107 | } |
ysr@777 | 2108 | } |
ysr@777 | 2109 | |
ysr@777 | 2110 | void G1CollectorPolicy::print_yg_surv_rate_info() const { |
ysr@777 | 2111 | #ifndef PRODUCT |
ysr@777 | 2112 | _short_lived_surv_rate_group->print_surv_rate_summary(); |
ysr@777 | 2113 | // add this call for any other surv rate groups |
ysr@777 | 2114 | #endif // PRODUCT |
ysr@777 | 2115 | } |
ysr@777 | 2116 | |
ysr@777 | 2117 | #ifndef PRODUCT |
ysr@777 | 2118 | // for debugging, bit of a hack... |
ysr@777 | 2119 | static char* |
ysr@777 | 2120 | region_num_to_mbs(int length) { |
ysr@777 | 2121 | static char buffer[64]; |
ysr@777 | 2122 | double bytes = (double) (length * HeapRegion::GrainBytes); |
ysr@777 | 2123 | double mbs = bytes / (double) (1024 * 1024); |
ysr@777 | 2124 | sprintf(buffer, "%7.2lfMB", mbs); |
ysr@777 | 2125 | return buffer; |
ysr@777 | 2126 | } |
ysr@777 | 2127 | #endif // PRODUCT |
ysr@777 | 2128 | |
apetrusenko@980 | 2129 | size_t G1CollectorPolicy::max_regions(int purpose) { |
ysr@777 | 2130 | switch (purpose) { |
ysr@777 | 2131 | case GCAllocForSurvived: |
apetrusenko@980 | 2132 | return _max_survivor_regions; |
ysr@777 | 2133 | case GCAllocForTenured: |
apetrusenko@980 | 2134 | return REGIONS_UNLIMITED; |
ysr@777 | 2135 | default: |
apetrusenko@980 | 2136 | ShouldNotReachHere(); |
apetrusenko@980 | 2137 | return REGIONS_UNLIMITED; |
ysr@777 | 2138 | }; |
ysr@777 | 2139 | } |
ysr@777 | 2140 | |
tonyp@3119 | 2141 | void G1CollectorPolicy::update_max_gc_locker_expansion() { |
tonyp@2333 | 2142 | size_t expansion_region_num = 0; |
tonyp@2333 | 2143 | if (GCLockerEdenExpansionPercent > 0) { |
tonyp@2333 | 2144 | double perc = (double) GCLockerEdenExpansionPercent / 100.0; |
tonyp@2333 | 2145 | double expansion_region_num_d = perc * (double) _young_list_target_length; |
tonyp@2333 | 2146 | // We use ceiling so that if expansion_region_num_d is > 0.0 (but |
tonyp@2333 | 2147 | // less than 1.0) we'll get 1. |
tonyp@2333 | 2148 | expansion_region_num = (size_t) ceil(expansion_region_num_d); |
tonyp@2333 | 2149 | } else { |
tonyp@2333 | 2150 | assert(expansion_region_num == 0, "sanity"); |
tonyp@2333 | 2151 | } |
tonyp@2333 | 2152 | _young_list_max_length = _young_list_target_length + expansion_region_num; |
tonyp@2333 | 2153 | assert(_young_list_target_length <= _young_list_max_length, "post-condition"); |
tonyp@2333 | 2154 | } |
tonyp@2333 | 2155 | |
apetrusenko@980 | 2156 | // Calculates survivor space parameters. |
tonyp@3119 | 2157 | void G1CollectorPolicy::update_survivors_policy() { |
tonyp@3119 | 2158 | double max_survivor_regions_d = |
tonyp@3119 | 2159 | (double) _young_list_target_length / (double) SurvivorRatio; |
tonyp@3119 | 2160 | // We use ceiling so that if max_survivor_regions_d is > 0.0 (but |
tonyp@3119 | 2161 | // smaller than 1.0) we'll get 1. |
tonyp@3119 | 2162 | _max_survivor_regions = (size_t) ceil(max_survivor_regions_d); |
tonyp@3119 | 2163 | |
tonyp@3066 | 2164 | _tenuring_threshold = _survivors_age_table.compute_tenuring_threshold( |
apetrusenko@980 | 2165 | HeapRegion::GrainWords * _max_survivor_regions); |
apetrusenko@980 | 2166 | } |
apetrusenko@980 | 2167 | |
ysr@777 | 2168 | #ifndef PRODUCT |
ysr@777 | 2169 | class HRSortIndexIsOKClosure: public HeapRegionClosure { |
ysr@777 | 2170 | CollectionSetChooser* _chooser; |
ysr@777 | 2171 | public: |
ysr@777 | 2172 | HRSortIndexIsOKClosure(CollectionSetChooser* chooser) : |
ysr@777 | 2173 | _chooser(chooser) {} |
ysr@777 | 2174 | |
ysr@777 | 2175 | bool doHeapRegion(HeapRegion* r) { |
ysr@777 | 2176 | if (!r->continuesHumongous()) { |
ysr@777 | 2177 | assert(_chooser->regionProperlyOrdered(r), "Ought to be."); |
ysr@777 | 2178 | } |
ysr@777 | 2179 | return false; |
ysr@777 | 2180 | } |
ysr@777 | 2181 | }; |
ysr@777 | 2182 | |
tonyp@3209 | 2183 | bool G1CollectorPolicy::assertMarkedBytesDataOK() { |
ysr@777 | 2184 | HRSortIndexIsOKClosure cl(_collectionSetChooser); |
ysr@777 | 2185 | _g1->heap_region_iterate(&cl); |
ysr@777 | 2186 | return true; |
ysr@777 | 2187 | } |
ysr@777 | 2188 | #endif |
ysr@777 | 2189 | |
tonyp@3114 | 2190 | bool G1CollectorPolicy::force_initial_mark_if_outside_cycle( |
tonyp@3114 | 2191 | GCCause::Cause gc_cause) { |
tonyp@2011 | 2192 | bool during_cycle = _g1->concurrent_mark()->cmThread()->during_cycle(); |
tonyp@2011 | 2193 | if (!during_cycle) { |
tonyp@3114 | 2194 | ergo_verbose1(ErgoConcCycles, |
tonyp@3114 | 2195 | "request concurrent cycle initiation", |
tonyp@3114 | 2196 | ergo_format_reason("requested by GC cause") |
tonyp@3114 | 2197 | ergo_format_str("GC cause"), |
tonyp@3114 | 2198 | GCCause::to_string(gc_cause)); |
tonyp@2011 | 2199 | set_initiate_conc_mark_if_possible(); |
tonyp@2011 | 2200 | return true; |
tonyp@2011 | 2201 | } else { |
tonyp@3114 | 2202 | ergo_verbose1(ErgoConcCycles, |
tonyp@3114 | 2203 | "do not request concurrent cycle initiation", |
tonyp@3114 | 2204 | ergo_format_reason("concurrent cycle already in progress") |
tonyp@3114 | 2205 | ergo_format_str("GC cause"), |
tonyp@3114 | 2206 | GCCause::to_string(gc_cause)); |
tonyp@2011 | 2207 | return false; |
tonyp@2011 | 2208 | } |
tonyp@2011 | 2209 | } |
tonyp@2011 | 2210 | |
ysr@777 | 2211 | void |
tonyp@1794 | 2212 | G1CollectorPolicy::decide_on_conc_mark_initiation() { |
tonyp@1794 | 2213 | // We are about to decide on whether this pause will be an |
tonyp@1794 | 2214 | // initial-mark pause. |
tonyp@1794 | 2215 | |
tonyp@1794 | 2216 | // First, during_initial_mark_pause() should not be already set. We |
tonyp@1794 | 2217 | // will set it here if we have to. However, it should be cleared by |
tonyp@1794 | 2218 | // the end of the pause (it's only set for the duration of an |
tonyp@1794 | 2219 | // initial-mark pause). |
tonyp@1794 | 2220 | assert(!during_initial_mark_pause(), "pre-condition"); |
tonyp@1794 | 2221 | |
tonyp@1794 | 2222 | if (initiate_conc_mark_if_possible()) { |
tonyp@1794 | 2223 | // We had noticed on a previous pause that the heap occupancy has |
tonyp@1794 | 2224 | // gone over the initiating threshold and we should start a |
tonyp@1794 | 2225 | // concurrent marking cycle. So we might initiate one. |
tonyp@1794 | 2226 | |
tonyp@1794 | 2227 | bool during_cycle = _g1->concurrent_mark()->cmThread()->during_cycle(); |
tonyp@1794 | 2228 | if (!during_cycle) { |
tonyp@1794 | 2229 | // The concurrent marking thread is not "during a cycle", i.e., |
tonyp@1794 | 2230 | // it has completed the last one. So we can go ahead and |
tonyp@1794 | 2231 | // initiate a new cycle. |
tonyp@1794 | 2232 | |
tonyp@1794 | 2233 | set_during_initial_mark_pause(); |
tonyp@3337 | 2234 | // We do not allow mixed GCs during marking. |
tonyp@3337 | 2235 | if (!gcs_are_young()) { |
tonyp@3337 | 2236 | set_gcs_are_young(true); |
tonyp@3337 | 2237 | ergo_verbose0(ErgoMixedGCs, |
tonyp@3337 | 2238 | "end mixed GCs", |
johnc@3178 | 2239 | ergo_format_reason("concurrent cycle is about to start")); |
johnc@3178 | 2240 | } |
tonyp@1794 | 2241 | |
tonyp@1794 | 2242 | // And we can now clear initiate_conc_mark_if_possible() as |
tonyp@1794 | 2243 | // we've already acted on it. |
tonyp@1794 | 2244 | clear_initiate_conc_mark_if_possible(); |
tonyp@3114 | 2245 | |
tonyp@3114 | 2246 | ergo_verbose0(ErgoConcCycles, |
tonyp@3114 | 2247 | "initiate concurrent cycle", |
tonyp@3114 | 2248 | ergo_format_reason("concurrent cycle initiation requested")); |
tonyp@1794 | 2249 | } else { |
tonyp@1794 | 2250 | // The concurrent marking thread is still finishing up the |
tonyp@1794 | 2251 | // previous cycle. If we start one right now the two cycles |
tonyp@1794 | 2252 | // overlap. In particular, the concurrent marking thread might |
tonyp@1794 | 2253 | // be in the process of clearing the next marking bitmap (which |
tonyp@1794 | 2254 | // we will use for the next cycle if we start one). Starting a |
tonyp@1794 | 2255 | // cycle now will be bad given that parts of the marking |
tonyp@1794 | 2256 | // information might get cleared by the marking thread. And we |
tonyp@1794 | 2257 | // cannot wait for the marking thread to finish the cycle as it |
tonyp@1794 | 2258 | // periodically yields while clearing the next marking bitmap |
tonyp@1794 | 2259 | // and, if it's in a yield point, it's waiting for us to |
tonyp@1794 | 2260 | // finish. So, at this point we will not start a cycle and we'll |
tonyp@1794 | 2261 | // let the concurrent marking thread complete the last one. |
tonyp@3114 | 2262 | ergo_verbose0(ErgoConcCycles, |
tonyp@3114 | 2263 | "do not initiate concurrent cycle", |
tonyp@3114 | 2264 | ergo_format_reason("concurrent cycle already in progress")); |
tonyp@1794 | 2265 | } |
tonyp@1794 | 2266 | } |
tonyp@1794 | 2267 | } |
tonyp@1794 | 2268 | |
ysr@777 | 2269 | class KnownGarbageClosure: public HeapRegionClosure { |
ysr@777 | 2270 | CollectionSetChooser* _hrSorted; |
ysr@777 | 2271 | |
ysr@777 | 2272 | public: |
ysr@777 | 2273 | KnownGarbageClosure(CollectionSetChooser* hrSorted) : |
ysr@777 | 2274 | _hrSorted(hrSorted) |
ysr@777 | 2275 | {} |
ysr@777 | 2276 | |
ysr@777 | 2277 | bool doHeapRegion(HeapRegion* r) { |
ysr@777 | 2278 | // We only include humongous regions in collection |
ysr@777 | 2279 | // sets when concurrent mark shows that their contained object is |
ysr@777 | 2280 | // unreachable. |
ysr@777 | 2281 | |
ysr@777 | 2282 | // Do we have any marking information for this region? |
ysr@777 | 2283 | if (r->is_marked()) { |
ysr@777 | 2284 | // We don't include humongous regions in collection |
ysr@777 | 2285 | // sets because we collect them immediately at the end of a marking |
ysr@777 | 2286 | // cycle. We also don't include young regions because we *must* |
ysr@777 | 2287 | // include them in the next collection pause. |
ysr@777 | 2288 | if (!r->isHumongous() && !r->is_young()) { |
ysr@777 | 2289 | _hrSorted->addMarkedHeapRegion(r); |
ysr@777 | 2290 | } |
ysr@777 | 2291 | } |
ysr@777 | 2292 | return false; |
ysr@777 | 2293 | } |
ysr@777 | 2294 | }; |
ysr@777 | 2295 | |
ysr@777 | 2296 | class ParKnownGarbageHRClosure: public HeapRegionClosure { |
ysr@777 | 2297 | CollectionSetChooser* _hrSorted; |
ysr@777 | 2298 | jint _marked_regions_added; |
ysr@777 | 2299 | jint _chunk_size; |
ysr@777 | 2300 | jint _cur_chunk_idx; |
ysr@777 | 2301 | jint _cur_chunk_end; // Cur chunk [_cur_chunk_idx, _cur_chunk_end) |
ysr@777 | 2302 | int _worker; |
ysr@777 | 2303 | int _invokes; |
ysr@777 | 2304 | |
ysr@777 | 2305 | void get_new_chunk() { |
ysr@777 | 2306 | _cur_chunk_idx = _hrSorted->getParMarkedHeapRegionChunk(_chunk_size); |
ysr@777 | 2307 | _cur_chunk_end = _cur_chunk_idx + _chunk_size; |
ysr@777 | 2308 | } |
ysr@777 | 2309 | void add_region(HeapRegion* r) { |
ysr@777 | 2310 | if (_cur_chunk_idx == _cur_chunk_end) { |
ysr@777 | 2311 | get_new_chunk(); |
ysr@777 | 2312 | } |
ysr@777 | 2313 | assert(_cur_chunk_idx < _cur_chunk_end, "postcondition"); |
ysr@777 | 2314 | _hrSorted->setMarkedHeapRegion(_cur_chunk_idx, r); |
ysr@777 | 2315 | _marked_regions_added++; |
ysr@777 | 2316 | _cur_chunk_idx++; |
ysr@777 | 2317 | } |
ysr@777 | 2318 | |
ysr@777 | 2319 | public: |
ysr@777 | 2320 | ParKnownGarbageHRClosure(CollectionSetChooser* hrSorted, |
ysr@777 | 2321 | jint chunk_size, |
ysr@777 | 2322 | int worker) : |
ysr@777 | 2323 | _hrSorted(hrSorted), _chunk_size(chunk_size), _worker(worker), |
ysr@777 | 2324 | _marked_regions_added(0), _cur_chunk_idx(0), _cur_chunk_end(0), |
ysr@777 | 2325 | _invokes(0) |
ysr@777 | 2326 | {} |
ysr@777 | 2327 | |
ysr@777 | 2328 | bool doHeapRegion(HeapRegion* r) { |
ysr@777 | 2329 | // We only include humongous regions in collection |
ysr@777 | 2330 | // sets when concurrent mark shows that their contained object is |
ysr@777 | 2331 | // unreachable. |
ysr@777 | 2332 | _invokes++; |
ysr@777 | 2333 | |
ysr@777 | 2334 | // Do we have any marking information for this region? |
ysr@777 | 2335 | if (r->is_marked()) { |
ysr@777 | 2336 | // We don't include humongous regions in collection |
ysr@777 | 2337 | // sets because we collect them immediately at the end of a marking |
ysr@777 | 2338 | // cycle. |
ysr@777 | 2339 | // We also do not include young regions in collection sets |
ysr@777 | 2340 | if (!r->isHumongous() && !r->is_young()) { |
ysr@777 | 2341 | add_region(r); |
ysr@777 | 2342 | } |
ysr@777 | 2343 | } |
ysr@777 | 2344 | return false; |
ysr@777 | 2345 | } |
ysr@777 | 2346 | jint marked_regions_added() { return _marked_regions_added; } |
ysr@777 | 2347 | int invokes() { return _invokes; } |
ysr@777 | 2348 | }; |
ysr@777 | 2349 | |
ysr@777 | 2350 | class ParKnownGarbageTask: public AbstractGangTask { |
ysr@777 | 2351 | CollectionSetChooser* _hrSorted; |
ysr@777 | 2352 | jint _chunk_size; |
ysr@777 | 2353 | G1CollectedHeap* _g1; |
ysr@777 | 2354 | public: |
ysr@777 | 2355 | ParKnownGarbageTask(CollectionSetChooser* hrSorted, jint chunk_size) : |
ysr@777 | 2356 | AbstractGangTask("ParKnownGarbageTask"), |
ysr@777 | 2357 | _hrSorted(hrSorted), _chunk_size(chunk_size), |
ysr@777 | 2358 | _g1(G1CollectedHeap::heap()) |
ysr@777 | 2359 | {} |
ysr@777 | 2360 | |
jmasa@3357 | 2361 | void work(uint worker_id) { |
jmasa@3357 | 2362 | ParKnownGarbageHRClosure parKnownGarbageCl(_hrSorted, |
jmasa@3357 | 2363 | _chunk_size, |
jmasa@3357 | 2364 | worker_id); |
ysr@777 | 2365 | // Back to zero for the claim value. |
jmasa@3357 | 2366 | _g1->heap_region_par_iterate_chunked(&parKnownGarbageCl, worker_id, |
jmasa@3294 | 2367 | _g1->workers()->active_workers(), |
tonyp@790 | 2368 | HeapRegion::InitialClaimValue); |
ysr@777 | 2369 | jint regions_added = parKnownGarbageCl.marked_regions_added(); |
ysr@777 | 2370 | _hrSorted->incNumMarkedHeapRegions(regions_added); |
ysr@777 | 2371 | if (G1PrintParCleanupStats) { |
brutisso@2645 | 2372 | gclog_or_tty->print_cr(" Thread %d called %d times, added %d regions to list.", |
jmasa@3357 | 2373 | worker_id, parKnownGarbageCl.invokes(), regions_added); |
ysr@777 | 2374 | } |
ysr@777 | 2375 | } |
ysr@777 | 2376 | }; |
ysr@777 | 2377 | |
ysr@777 | 2378 | void |
jmasa@3294 | 2379 | G1CollectorPolicy::record_concurrent_mark_cleanup_end(int no_of_gc_threads) { |
tonyp@3209 | 2380 | double start_sec; |
tonyp@3209 | 2381 | if (G1PrintParCleanupStats) { |
tonyp@3209 | 2382 | start_sec = os::elapsedTime(); |
tonyp@3209 | 2383 | } |
ysr@777 | 2384 | |
ysr@777 | 2385 | _collectionSetChooser->clearMarkedHeapRegions(); |
tonyp@3209 | 2386 | double clear_marked_end_sec; |
ysr@777 | 2387 | if (G1PrintParCleanupStats) { |
tonyp@3209 | 2388 | clear_marked_end_sec = os::elapsedTime(); |
tonyp@3209 | 2389 | gclog_or_tty->print_cr(" clear marked regions: %8.3f ms.", |
tonyp@3209 | 2390 | (clear_marked_end_sec - start_sec) * 1000.0); |
ysr@777 | 2391 | } |
tonyp@3209 | 2392 | |
jmasa@2188 | 2393 | if (G1CollectedHeap::use_parallel_gc_threads()) { |
ysr@777 | 2394 | const size_t OverpartitionFactor = 4; |
jmasa@3294 | 2395 | size_t WorkUnit; |
jmasa@3294 | 2396 | // The use of MinChunkSize = 8 in the original code |
jmasa@3294 | 2397 | // causes some assertion failures when the total number of |
jmasa@3294 | 2398 | // region is less than 8. The code here tries to fix that. |
jmasa@3294 | 2399 | // Should the original code also be fixed? |
jmasa@3294 | 2400 | if (no_of_gc_threads > 0) { |
jmasa@3294 | 2401 | const size_t MinWorkUnit = |
jmasa@3294 | 2402 | MAX2(_g1->n_regions() / no_of_gc_threads, (size_t) 1U); |
jmasa@3294 | 2403 | WorkUnit = |
jmasa@3294 | 2404 | MAX2(_g1->n_regions() / (no_of_gc_threads * OverpartitionFactor), |
jmasa@3294 | 2405 | MinWorkUnit); |
jmasa@3294 | 2406 | } else { |
jmasa@3294 | 2407 | assert(no_of_gc_threads > 0, |
jmasa@3294 | 2408 | "The active gc workers should be greater than 0"); |
jmasa@3294 | 2409 | // In a product build do something reasonable to avoid a crash. |
jmasa@3294 | 2410 | const size_t MinWorkUnit = |
jmasa@3294 | 2411 | MAX2(_g1->n_regions() / ParallelGCThreads, (size_t) 1U); |
jmasa@3294 | 2412 | WorkUnit = |
jmasa@3294 | 2413 | MAX2(_g1->n_regions() / (ParallelGCThreads * OverpartitionFactor), |
jmasa@3294 | 2414 | MinWorkUnit); |
jmasa@3294 | 2415 | } |
ysr@777 | 2416 | _collectionSetChooser->prepareForAddMarkedHeapRegionsPar(_g1->n_regions(), |
kvn@1926 | 2417 | WorkUnit); |
ysr@777 | 2418 | ParKnownGarbageTask parKnownGarbageTask(_collectionSetChooser, |
kvn@1926 | 2419 | (int) WorkUnit); |
ysr@777 | 2420 | _g1->workers()->run_task(&parKnownGarbageTask); |
tonyp@790 | 2421 | |
tonyp@790 | 2422 | assert(_g1->check_heap_region_claim_values(HeapRegion::InitialClaimValue), |
tonyp@790 | 2423 | "sanity check"); |
ysr@777 | 2424 | } else { |
ysr@777 | 2425 | KnownGarbageClosure knownGarbagecl(_collectionSetChooser); |
ysr@777 | 2426 | _g1->heap_region_iterate(&knownGarbagecl); |
ysr@777 | 2427 | } |
tonyp@3209 | 2428 | double known_garbage_end_sec; |
ysr@777 | 2429 | if (G1PrintParCleanupStats) { |
tonyp@3209 | 2430 | known_garbage_end_sec = os::elapsedTime(); |
ysr@777 | 2431 | gclog_or_tty->print_cr(" compute known garbage: %8.3f ms.", |
tonyp@3209 | 2432 | (known_garbage_end_sec - clear_marked_end_sec) * 1000.0); |
ysr@777 | 2433 | } |
tonyp@3209 | 2434 | |
ysr@777 | 2435 | _collectionSetChooser->sortMarkedHeapRegions(); |
tonyp@3209 | 2436 | double end_sec = os::elapsedTime(); |
ysr@777 | 2437 | if (G1PrintParCleanupStats) { |
ysr@777 | 2438 | gclog_or_tty->print_cr(" sorting: %8.3f ms.", |
tonyp@3209 | 2439 | (end_sec - known_garbage_end_sec) * 1000.0); |
ysr@777 | 2440 | } |
ysr@777 | 2441 | |
tonyp@3209 | 2442 | double elapsed_time_ms = (end_sec - _mark_cleanup_start_sec) * 1000.0; |
tonyp@3209 | 2443 | _concurrent_mark_cleanup_times_ms->add(elapsed_time_ms); |
tonyp@3209 | 2444 | _cur_mark_stop_world_time_ms += elapsed_time_ms; |
tonyp@3209 | 2445 | _prev_collection_pause_end_ms += elapsed_time_ms; |
tonyp@3209 | 2446 | _mmu_tracker->add_pause(_mark_cleanup_start_sec, end_sec, true); |
ysr@777 | 2447 | } |
ysr@777 | 2448 | |
johnc@1829 | 2449 | // Add the heap region at the head of the non-incremental collection set |
tonyp@3289 | 2450 | void G1CollectorPolicy::add_old_region_to_cset(HeapRegion* hr) { |
johnc@1829 | 2451 | assert(_inc_cset_build_state == Active, "Precondition"); |
johnc@1829 | 2452 | assert(!hr->is_young(), "non-incremental add of young region"); |
johnc@1829 | 2453 | |
johnc@1829 | 2454 | assert(!hr->in_collection_set(), "should not already be in the CSet"); |
ysr@777 | 2455 | hr->set_in_collection_set(true); |
ysr@777 | 2456 | hr->set_next_in_collection_set(_collection_set); |
ysr@777 | 2457 | _collection_set = hr; |
ysr@777 | 2458 | _collection_set_bytes_used_before += hr->used(); |
tonyp@961 | 2459 | _g1->register_region_with_in_cset_fast_test(hr); |
tonyp@3289 | 2460 | size_t rs_length = hr->rem_set()->occupied(); |
tonyp@3289 | 2461 | _recorded_rs_lengths += rs_length; |
tonyp@3289 | 2462 | _old_cset_region_length += 1; |
ysr@777 | 2463 | } |
ysr@777 | 2464 | |
johnc@1829 | 2465 | // Initialize the per-collection-set information |
johnc@1829 | 2466 | void G1CollectorPolicy::start_incremental_cset_building() { |
johnc@1829 | 2467 | assert(_inc_cset_build_state == Inactive, "Precondition"); |
johnc@1829 | 2468 | |
johnc@1829 | 2469 | _inc_cset_head = NULL; |
johnc@1829 | 2470 | _inc_cset_tail = NULL; |
johnc@1829 | 2471 | _inc_cset_bytes_used_before = 0; |
johnc@1829 | 2472 | |
johnc@1829 | 2473 | _inc_cset_max_finger = 0; |
johnc@1829 | 2474 | _inc_cset_recorded_rs_lengths = 0; |
tonyp@3356 | 2475 | _inc_cset_recorded_rs_lengths_diffs = 0; |
tonyp@3356 | 2476 | _inc_cset_predicted_elapsed_time_ms = 0.0; |
tonyp@3356 | 2477 | _inc_cset_predicted_elapsed_time_ms_diffs = 0.0; |
johnc@1829 | 2478 | _inc_cset_build_state = Active; |
johnc@1829 | 2479 | } |
johnc@1829 | 2480 | |
tonyp@3356 | 2481 | void G1CollectorPolicy::finalize_incremental_cset_building() { |
tonyp@3356 | 2482 | assert(_inc_cset_build_state == Active, "Precondition"); |
tonyp@3356 | 2483 | assert(SafepointSynchronize::is_at_safepoint(), "should be at a safepoint"); |
tonyp@3356 | 2484 | |
tonyp@3356 | 2485 | // The two "main" fields, _inc_cset_recorded_rs_lengths and |
tonyp@3356 | 2486 | // _inc_cset_predicted_elapsed_time_ms, are updated by the thread |
tonyp@3356 | 2487 | // that adds a new region to the CSet. Further updates by the |
tonyp@3356 | 2488 | // concurrent refinement thread that samples the young RSet lengths |
tonyp@3356 | 2489 | // are accumulated in the *_diffs fields. Here we add the diffs to |
tonyp@3356 | 2490 | // the "main" fields. |
tonyp@3356 | 2491 | |
tonyp@3356 | 2492 | if (_inc_cset_recorded_rs_lengths_diffs >= 0) { |
tonyp@3356 | 2493 | _inc_cset_recorded_rs_lengths += _inc_cset_recorded_rs_lengths_diffs; |
tonyp@3356 | 2494 | } else { |
tonyp@3356 | 2495 | // This is defensive. The diff should in theory be always positive |
tonyp@3356 | 2496 | // as RSets can only grow between GCs. However, given that we |
tonyp@3356 | 2497 | // sample their size concurrently with other threads updating them |
tonyp@3356 | 2498 | // it's possible that we might get the wrong size back, which |
tonyp@3356 | 2499 | // could make the calculations somewhat inaccurate. |
tonyp@3356 | 2500 | size_t diffs = (size_t) (-_inc_cset_recorded_rs_lengths_diffs); |
tonyp@3356 | 2501 | if (_inc_cset_recorded_rs_lengths >= diffs) { |
tonyp@3356 | 2502 | _inc_cset_recorded_rs_lengths -= diffs; |
tonyp@3356 | 2503 | } else { |
tonyp@3356 | 2504 | _inc_cset_recorded_rs_lengths = 0; |
tonyp@3356 | 2505 | } |
tonyp@3356 | 2506 | } |
tonyp@3356 | 2507 | _inc_cset_predicted_elapsed_time_ms += |
tonyp@3356 | 2508 | _inc_cset_predicted_elapsed_time_ms_diffs; |
tonyp@3356 | 2509 | |
tonyp@3356 | 2510 | _inc_cset_recorded_rs_lengths_diffs = 0; |
tonyp@3356 | 2511 | _inc_cset_predicted_elapsed_time_ms_diffs = 0.0; |
tonyp@3356 | 2512 | } |
tonyp@3356 | 2513 | |
johnc@1829 | 2514 | void G1CollectorPolicy::add_to_incremental_cset_info(HeapRegion* hr, size_t rs_length) { |
johnc@1829 | 2515 | // This routine is used when: |
johnc@1829 | 2516 | // * adding survivor regions to the incremental cset at the end of an |
johnc@1829 | 2517 | // evacuation pause, |
johnc@1829 | 2518 | // * adding the current allocation region to the incremental cset |
johnc@1829 | 2519 | // when it is retired, and |
johnc@1829 | 2520 | // * updating existing policy information for a region in the |
johnc@1829 | 2521 | // incremental cset via young list RSet sampling. |
johnc@1829 | 2522 | // Therefore this routine may be called at a safepoint by the |
johnc@1829 | 2523 | // VM thread, or in-between safepoints by mutator threads (when |
johnc@1829 | 2524 | // retiring the current allocation region) or a concurrent |
johnc@1829 | 2525 | // refine thread (RSet sampling). |
johnc@1829 | 2526 | |
johnc@1829 | 2527 | double region_elapsed_time_ms = predict_region_elapsed_time_ms(hr, true); |
johnc@1829 | 2528 | size_t used_bytes = hr->used(); |
johnc@1829 | 2529 | _inc_cset_recorded_rs_lengths += rs_length; |
johnc@1829 | 2530 | _inc_cset_predicted_elapsed_time_ms += region_elapsed_time_ms; |
johnc@1829 | 2531 | _inc_cset_bytes_used_before += used_bytes; |
johnc@1829 | 2532 | |
johnc@1829 | 2533 | // Cache the values we have added to the aggregated informtion |
johnc@1829 | 2534 | // in the heap region in case we have to remove this region from |
johnc@1829 | 2535 | // the incremental collection set, or it is updated by the |
johnc@1829 | 2536 | // rset sampling code |
johnc@1829 | 2537 | hr->set_recorded_rs_length(rs_length); |
johnc@1829 | 2538 | hr->set_predicted_elapsed_time_ms(region_elapsed_time_ms); |
johnc@1829 | 2539 | } |
johnc@1829 | 2540 | |
tonyp@3356 | 2541 | void G1CollectorPolicy::update_incremental_cset_info(HeapRegion* hr, |
tonyp@3356 | 2542 | size_t new_rs_length) { |
tonyp@3356 | 2543 | // Update the CSet information that is dependent on the new RS length |
tonyp@3356 | 2544 | assert(hr->is_young(), "Precondition"); |
tonyp@3356 | 2545 | assert(!SafepointSynchronize::is_at_safepoint(), |
tonyp@3356 | 2546 | "should not be at a safepoint"); |
tonyp@3356 | 2547 | |
tonyp@3356 | 2548 | // We could have updated _inc_cset_recorded_rs_lengths and |
tonyp@3356 | 2549 | // _inc_cset_predicted_elapsed_time_ms directly but we'd need to do |
tonyp@3356 | 2550 | // that atomically, as this code is executed by a concurrent |
tonyp@3356 | 2551 | // refinement thread, potentially concurrently with a mutator thread |
tonyp@3356 | 2552 | // allocating a new region and also updating the same fields. To |
tonyp@3356 | 2553 | // avoid the atomic operations we accumulate these updates on two |
tonyp@3356 | 2554 | // separate fields (*_diffs) and we'll just add them to the "main" |
tonyp@3356 | 2555 | // fields at the start of a GC. |
tonyp@3356 | 2556 | |
tonyp@3356 | 2557 | ssize_t old_rs_length = (ssize_t) hr->recorded_rs_length(); |
tonyp@3356 | 2558 | ssize_t rs_lengths_diff = (ssize_t) new_rs_length - old_rs_length; |
tonyp@3356 | 2559 | _inc_cset_recorded_rs_lengths_diffs += rs_lengths_diff; |
tonyp@3356 | 2560 | |
johnc@1829 | 2561 | double old_elapsed_time_ms = hr->predicted_elapsed_time_ms(); |
tonyp@3356 | 2562 | double new_region_elapsed_time_ms = predict_region_elapsed_time_ms(hr, true); |
tonyp@3356 | 2563 | double elapsed_ms_diff = new_region_elapsed_time_ms - old_elapsed_time_ms; |
tonyp@3356 | 2564 | _inc_cset_predicted_elapsed_time_ms_diffs += elapsed_ms_diff; |
tonyp@3356 | 2565 | |
tonyp@3356 | 2566 | hr->set_recorded_rs_length(new_rs_length); |
tonyp@3356 | 2567 | hr->set_predicted_elapsed_time_ms(new_region_elapsed_time_ms); |
johnc@1829 | 2568 | } |
johnc@1829 | 2569 | |
johnc@1829 | 2570 | void G1CollectorPolicy::add_region_to_incremental_cset_common(HeapRegion* hr) { |
tonyp@3289 | 2571 | assert(hr->is_young(), "invariant"); |
tonyp@3289 | 2572 | assert(hr->young_index_in_cset() > -1, "should have already been set"); |
johnc@1829 | 2573 | assert(_inc_cset_build_state == Active, "Precondition"); |
johnc@1829 | 2574 | |
johnc@1829 | 2575 | // We need to clear and set the cached recorded/cached collection set |
johnc@1829 | 2576 | // information in the heap region here (before the region gets added |
johnc@1829 | 2577 | // to the collection set). An individual heap region's cached values |
johnc@1829 | 2578 | // are calculated, aggregated with the policy collection set info, |
johnc@1829 | 2579 | // and cached in the heap region here (initially) and (subsequently) |
johnc@1829 | 2580 | // by the Young List sampling code. |
johnc@1829 | 2581 | |
johnc@1829 | 2582 | size_t rs_length = hr->rem_set()->occupied(); |
johnc@1829 | 2583 | add_to_incremental_cset_info(hr, rs_length); |
johnc@1829 | 2584 | |
johnc@1829 | 2585 | HeapWord* hr_end = hr->end(); |
johnc@1829 | 2586 | _inc_cset_max_finger = MAX2(_inc_cset_max_finger, hr_end); |
johnc@1829 | 2587 | |
johnc@1829 | 2588 | assert(!hr->in_collection_set(), "invariant"); |
johnc@1829 | 2589 | hr->set_in_collection_set(true); |
johnc@1829 | 2590 | assert( hr->next_in_collection_set() == NULL, "invariant"); |
johnc@1829 | 2591 | |
johnc@1829 | 2592 | _g1->register_region_with_in_cset_fast_test(hr); |
johnc@1829 | 2593 | } |
johnc@1829 | 2594 | |
johnc@1829 | 2595 | // Add the region at the RHS of the incremental cset |
johnc@1829 | 2596 | void G1CollectorPolicy::add_region_to_incremental_cset_rhs(HeapRegion* hr) { |
johnc@1829 | 2597 | // We should only ever be appending survivors at the end of a pause |
johnc@1829 | 2598 | assert( hr->is_survivor(), "Logic"); |
johnc@1829 | 2599 | |
johnc@1829 | 2600 | // Do the 'common' stuff |
johnc@1829 | 2601 | add_region_to_incremental_cset_common(hr); |
johnc@1829 | 2602 | |
johnc@1829 | 2603 | // Now add the region at the right hand side |
johnc@1829 | 2604 | if (_inc_cset_tail == NULL) { |
johnc@1829 | 2605 | assert(_inc_cset_head == NULL, "invariant"); |
johnc@1829 | 2606 | _inc_cset_head = hr; |
johnc@1829 | 2607 | } else { |
johnc@1829 | 2608 | _inc_cset_tail->set_next_in_collection_set(hr); |
johnc@1829 | 2609 | } |
johnc@1829 | 2610 | _inc_cset_tail = hr; |
johnc@1829 | 2611 | } |
johnc@1829 | 2612 | |
johnc@1829 | 2613 | // Add the region to the LHS of the incremental cset |
johnc@1829 | 2614 | void G1CollectorPolicy::add_region_to_incremental_cset_lhs(HeapRegion* hr) { |
johnc@1829 | 2615 | // Survivors should be added to the RHS at the end of a pause |
johnc@1829 | 2616 | assert(!hr->is_survivor(), "Logic"); |
johnc@1829 | 2617 | |
johnc@1829 | 2618 | // Do the 'common' stuff |
johnc@1829 | 2619 | add_region_to_incremental_cset_common(hr); |
johnc@1829 | 2620 | |
johnc@1829 | 2621 | // Add the region at the left hand side |
johnc@1829 | 2622 | hr->set_next_in_collection_set(_inc_cset_head); |
johnc@1829 | 2623 | if (_inc_cset_head == NULL) { |
johnc@1829 | 2624 | assert(_inc_cset_tail == NULL, "Invariant"); |
johnc@1829 | 2625 | _inc_cset_tail = hr; |
johnc@1829 | 2626 | } |
johnc@1829 | 2627 | _inc_cset_head = hr; |
johnc@1829 | 2628 | } |
johnc@1829 | 2629 | |
johnc@1829 | 2630 | #ifndef PRODUCT |
johnc@1829 | 2631 | void G1CollectorPolicy::print_collection_set(HeapRegion* list_head, outputStream* st) { |
johnc@1829 | 2632 | assert(list_head == inc_cset_head() || list_head == collection_set(), "must be"); |
johnc@1829 | 2633 | |
johnc@1829 | 2634 | st->print_cr("\nCollection_set:"); |
johnc@1829 | 2635 | HeapRegion* csr = list_head; |
johnc@1829 | 2636 | while (csr != NULL) { |
johnc@1829 | 2637 | HeapRegion* next = csr->next_in_collection_set(); |
johnc@1829 | 2638 | assert(csr->in_collection_set(), "bad CS"); |
johnc@1829 | 2639 | st->print_cr(" [%08x-%08x], t: %08x, P: %08x, N: %08x, C: %08x, " |
johnc@1829 | 2640 | "age: %4d, y: %d, surv: %d", |
johnc@1829 | 2641 | csr->bottom(), csr->end(), |
johnc@1829 | 2642 | csr->top(), |
johnc@1829 | 2643 | csr->prev_top_at_mark_start(), |
johnc@1829 | 2644 | csr->next_top_at_mark_start(), |
johnc@1829 | 2645 | csr->top_at_conc_mark_count(), |
johnc@1829 | 2646 | csr->age_in_surv_rate_group_cond(), |
johnc@1829 | 2647 | csr->is_young(), |
johnc@1829 | 2648 | csr->is_survivor()); |
johnc@1829 | 2649 | csr = next; |
johnc@1829 | 2650 | } |
johnc@1829 | 2651 | } |
johnc@1829 | 2652 | #endif // !PRODUCT |
johnc@1829 | 2653 | |
tonyp@3209 | 2654 | void G1CollectorPolicy::choose_collection_set(double target_pause_time_ms) { |
johnc@1829 | 2655 | // Set this here - in case we're not doing young collections. |
johnc@1829 | 2656 | double non_young_start_time_sec = os::elapsedTime(); |
johnc@1829 | 2657 | |
tonyp@3114 | 2658 | YoungList* young_list = _g1->young_list(); |
tonyp@3356 | 2659 | finalize_incremental_cset_building(); |
tonyp@3114 | 2660 | |
tonyp@2011 | 2661 | guarantee(target_pause_time_ms > 0.0, |
tonyp@2011 | 2662 | err_msg("target_pause_time_ms = %1.6lf should be positive", |
tonyp@2011 | 2663 | target_pause_time_ms)); |
tonyp@2011 | 2664 | guarantee(_collection_set == NULL, "Precondition"); |
ysr@777 | 2665 | |
ysr@777 | 2666 | double base_time_ms = predict_base_elapsed_time_ms(_pending_cards); |
ysr@777 | 2667 | double predicted_pause_time_ms = base_time_ms; |
ysr@777 | 2668 | |
tonyp@2011 | 2669 | double time_remaining_ms = target_pause_time_ms - base_time_ms; |
ysr@777 | 2670 | |
tonyp@3114 | 2671 | ergo_verbose3(ErgoCSetConstruction | ErgoHigh, |
tonyp@3114 | 2672 | "start choosing CSet", |
tonyp@3114 | 2673 | ergo_format_ms("predicted base time") |
tonyp@3114 | 2674 | ergo_format_ms("remaining time") |
tonyp@3114 | 2675 | ergo_format_ms("target pause time"), |
tonyp@3114 | 2676 | base_time_ms, time_remaining_ms, target_pause_time_ms); |
tonyp@3114 | 2677 | |
ysr@777 | 2678 | // the 10% and 50% values are arbitrary... |
tonyp@3114 | 2679 | double threshold = 0.10 * target_pause_time_ms; |
tonyp@3114 | 2680 | if (time_remaining_ms < threshold) { |
tonyp@3114 | 2681 | double prev_time_remaining_ms = time_remaining_ms; |
tonyp@2011 | 2682 | time_remaining_ms = 0.50 * target_pause_time_ms; |
tonyp@3114 | 2683 | ergo_verbose3(ErgoCSetConstruction, |
tonyp@3114 | 2684 | "adjust remaining time", |
tonyp@3114 | 2685 | ergo_format_reason("remaining time lower than threshold") |
tonyp@3114 | 2686 | ergo_format_ms("remaining time") |
tonyp@3114 | 2687 | ergo_format_ms("threshold") |
tonyp@3114 | 2688 | ergo_format_ms("adjusted remaining time"), |
tonyp@3114 | 2689 | prev_time_remaining_ms, threshold, time_remaining_ms); |
ysr@777 | 2690 | } |
ysr@777 | 2691 | |
tonyp@3114 | 2692 | size_t expansion_bytes = _g1->expansion_regions() * HeapRegion::GrainBytes; |
tonyp@3114 | 2693 | |
tonyp@3114 | 2694 | HeapRegion* hr; |
tonyp@3114 | 2695 | double young_start_time_sec = os::elapsedTime(); |
ysr@777 | 2696 | |
apetrusenko@1112 | 2697 | _collection_set_bytes_used_before = 0; |
tonyp@3337 | 2698 | _last_gc_was_young = gcs_are_young() ? true : false; |
tonyp@3337 | 2699 | |
tonyp@3337 | 2700 | if (_last_gc_was_young) { |
tonyp@3337 | 2701 | ++_young_pause_num; |
tonyp@3114 | 2702 | } else { |
tonyp@3337 | 2703 | ++_mixed_pause_num; |
tonyp@3114 | 2704 | } |
brutisso@3065 | 2705 | |
brutisso@3065 | 2706 | // The young list is laid with the survivor regions from the previous |
brutisso@3065 | 2707 | // pause are appended to the RHS of the young list, i.e. |
brutisso@3065 | 2708 | // [Newly Young Regions ++ Survivors from last pause]. |
brutisso@3065 | 2709 | |
tonyp@3289 | 2710 | size_t survivor_region_length = young_list->survivor_length(); |
tonyp@3289 | 2711 | size_t eden_region_length = young_list->length() - survivor_region_length; |
tonyp@3289 | 2712 | init_cset_region_lengths(eden_region_length, survivor_region_length); |
tonyp@3114 | 2713 | hr = young_list->first_survivor_region(); |
brutisso@3065 | 2714 | while (hr != NULL) { |
brutisso@3065 | 2715 | assert(hr->is_survivor(), "badly formed young list"); |
brutisso@3065 | 2716 | hr->set_young(); |
brutisso@3065 | 2717 | hr = hr->get_next_young_region(); |
brutisso@3065 | 2718 | } |
brutisso@3065 | 2719 | |
tonyp@3114 | 2720 | // Clear the fields that point to the survivor list - they are all young now. |
tonyp@3114 | 2721 | young_list->clear_survivors(); |
brutisso@3065 | 2722 | |
brutisso@3065 | 2723 | _collection_set = _inc_cset_head; |
brutisso@3065 | 2724 | _collection_set_bytes_used_before = _inc_cset_bytes_used_before; |
brutisso@3065 | 2725 | time_remaining_ms -= _inc_cset_predicted_elapsed_time_ms; |
brutisso@3065 | 2726 | predicted_pause_time_ms += _inc_cset_predicted_elapsed_time_ms; |
brutisso@3065 | 2727 | |
tonyp@3114 | 2728 | ergo_verbose3(ErgoCSetConstruction | ErgoHigh, |
tonyp@3114 | 2729 | "add young regions to CSet", |
tonyp@3114 | 2730 | ergo_format_region("eden") |
tonyp@3114 | 2731 | ergo_format_region("survivors") |
tonyp@3114 | 2732 | ergo_format_ms("predicted young region time"), |
tonyp@3289 | 2733 | eden_region_length, survivor_region_length, |
tonyp@3114 | 2734 | _inc_cset_predicted_elapsed_time_ms); |
tonyp@3114 | 2735 | |
brutisso@3065 | 2736 | // The number of recorded young regions is the incremental |
brutisso@3065 | 2737 | // collection set's current size |
brutisso@3065 | 2738 | set_recorded_rs_lengths(_inc_cset_recorded_rs_lengths); |
brutisso@3065 | 2739 | |
brutisso@3065 | 2740 | double young_end_time_sec = os::elapsedTime(); |
brutisso@3065 | 2741 | _recorded_young_cset_choice_time_ms = |
brutisso@3065 | 2742 | (young_end_time_sec - young_start_time_sec) * 1000.0; |
brutisso@3065 | 2743 | |
brutisso@3065 | 2744 | // We are doing young collections so reset this. |
brutisso@3065 | 2745 | non_young_start_time_sec = young_end_time_sec; |
brutisso@3065 | 2746 | |
tonyp@3337 | 2747 | if (!gcs_are_young()) { |
ysr@777 | 2748 | bool should_continue = true; |
ysr@777 | 2749 | NumberSeq seq; |
ysr@777 | 2750 | double avg_prediction = 100000000000000000.0; // something very large |
johnc@1829 | 2751 | |
tonyp@3114 | 2752 | double prev_predicted_pause_time_ms = predicted_pause_time_ms; |
ysr@777 | 2753 | do { |
tonyp@3289 | 2754 | // Note that add_old_region_to_cset() increments the |
tonyp@3289 | 2755 | // _old_cset_region_length field and cset_region_length() returns the |
tonyp@3289 | 2756 | // sum of _eden_cset_region_length, _survivor_cset_region_length, and |
tonyp@3289 | 2757 | // _old_cset_region_length. So, as old regions are added to the |
tonyp@3289 | 2758 | // CSet, _old_cset_region_length will be incremented and |
tonyp@3289 | 2759 | // cset_region_length(), which is used below, will always reflect |
tonyp@3289 | 2760 | // the the total number of regions added up to this point to the CSet. |
tonyp@3289 | 2761 | |
ysr@777 | 2762 | hr = _collectionSetChooser->getNextMarkedRegion(time_remaining_ms, |
ysr@777 | 2763 | avg_prediction); |
apetrusenko@1112 | 2764 | if (hr != NULL) { |
tonyp@3268 | 2765 | _g1->old_set_remove(hr); |
ysr@777 | 2766 | double predicted_time_ms = predict_region_elapsed_time_ms(hr, false); |
ysr@777 | 2767 | time_remaining_ms -= predicted_time_ms; |
ysr@777 | 2768 | predicted_pause_time_ms += predicted_time_ms; |
tonyp@3289 | 2769 | add_old_region_to_cset(hr); |
ysr@777 | 2770 | seq.add(predicted_time_ms); |
ysr@777 | 2771 | avg_prediction = seq.avg() + seq.sd(); |
ysr@777 | 2772 | } |
tonyp@3114 | 2773 | |
tonyp@3114 | 2774 | should_continue = true; |
tonyp@3114 | 2775 | if (hr == NULL) { |
tonyp@3114 | 2776 | // No need for an ergo verbose message here, |
tonyp@3114 | 2777 | // getNextMarkRegion() does this when it returns NULL. |
tonyp@3114 | 2778 | should_continue = false; |
tonyp@3114 | 2779 | } else { |
tonyp@3114 | 2780 | if (adaptive_young_list_length()) { |
tonyp@3114 | 2781 | if (time_remaining_ms < 0.0) { |
tonyp@3114 | 2782 | ergo_verbose1(ErgoCSetConstruction, |
tonyp@3114 | 2783 | "stop adding old regions to CSet", |
tonyp@3114 | 2784 | ergo_format_reason("remaining time is lower than 0") |
tonyp@3114 | 2785 | ergo_format_ms("remaining time"), |
tonyp@3114 | 2786 | time_remaining_ms); |
tonyp@3114 | 2787 | should_continue = false; |
tonyp@3114 | 2788 | } |
tonyp@3114 | 2789 | } else { |
tonyp@3289 | 2790 | if (cset_region_length() >= _young_list_fixed_length) { |
tonyp@3114 | 2791 | ergo_verbose2(ErgoCSetConstruction, |
tonyp@3114 | 2792 | "stop adding old regions to CSet", |
tonyp@3126 | 2793 | ergo_format_reason("CSet length reached target") |
tonyp@3114 | 2794 | ergo_format_region("CSet") |
tonyp@3114 | 2795 | ergo_format_region("young target"), |
tonyp@3289 | 2796 | cset_region_length(), _young_list_fixed_length); |
tonyp@3114 | 2797 | should_continue = false; |
tonyp@3114 | 2798 | } |
tonyp@3114 | 2799 | } |
tonyp@3114 | 2800 | } |
ysr@777 | 2801 | } while (should_continue); |
ysr@777 | 2802 | |
ysr@777 | 2803 | if (!adaptive_young_list_length() && |
tonyp@3337 | 2804 | cset_region_length() < _young_list_fixed_length) { |
tonyp@3114 | 2805 | ergo_verbose2(ErgoCSetConstruction, |
tonyp@3337 | 2806 | "request mixed GCs end", |
tonyp@3114 | 2807 | ergo_format_reason("CSet length lower than target") |
tonyp@3114 | 2808 | ergo_format_region("CSet") |
tonyp@3114 | 2809 | ergo_format_region("young target"), |
tonyp@3289 | 2810 | cset_region_length(), _young_list_fixed_length); |
tonyp@3337 | 2811 | _should_revert_to_young_gcs = true; |
tonyp@3114 | 2812 | } |
tonyp@3114 | 2813 | |
tonyp@3114 | 2814 | ergo_verbose2(ErgoCSetConstruction | ErgoHigh, |
tonyp@3114 | 2815 | "add old regions to CSet", |
tonyp@3114 | 2816 | ergo_format_region("old") |
tonyp@3114 | 2817 | ergo_format_ms("predicted old region time"), |
tonyp@3289 | 2818 | old_cset_region_length(), |
tonyp@3114 | 2819 | predicted_pause_time_ms - prev_predicted_pause_time_ms); |
ysr@777 | 2820 | } |
ysr@777 | 2821 | |
johnc@1829 | 2822 | stop_incremental_cset_building(); |
johnc@1829 | 2823 | |
ysr@777 | 2824 | count_CS_bytes_used(); |
ysr@777 | 2825 | |
tonyp@3114 | 2826 | ergo_verbose5(ErgoCSetConstruction, |
tonyp@3114 | 2827 | "finish choosing CSet", |
tonyp@3114 | 2828 | ergo_format_region("eden") |
tonyp@3114 | 2829 | ergo_format_region("survivors") |
tonyp@3114 | 2830 | ergo_format_region("old") |
tonyp@3114 | 2831 | ergo_format_ms("predicted pause time") |
tonyp@3114 | 2832 | ergo_format_ms("target pause time"), |
tonyp@3289 | 2833 | eden_region_length, survivor_region_length, |
tonyp@3289 | 2834 | old_cset_region_length(), |
tonyp@3114 | 2835 | predicted_pause_time_ms, target_pause_time_ms); |
tonyp@3114 | 2836 | |
ysr@777 | 2837 | double non_young_end_time_sec = os::elapsedTime(); |
ysr@777 | 2838 | _recorded_non_young_cset_choice_time_ms = |
ysr@777 | 2839 | (non_young_end_time_sec - non_young_start_time_sec) * 1000.0; |
ysr@777 | 2840 | } |