Tue, 19 Mar 2013 00:57:39 -0700
8009940: G1: assert(_finger == _heap_end) failed, concurrentMark.cpp:809
Summary: Skip reference processing if the global marking stack overflows during remark. Refactor and rename set_phase(); move code that sets the concurrency level into its own routine. Do not call set_phase() from within parallel reference processing; use the concurrency level routine instead. The marking state should only set reset by CMTask[0] during the concurrent phase of the marking cycle; if an overflow occurs at any stage during the remark, the marking state will be reset after reference processing.
Reviewed-by: brutisso, jmasa
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" |
brutisso@3923 | 32 | #include "gc_implementation/g1/g1GCPhaseTimes.hpp" |
brutisso@3710 | 33 | #include "gc_implementation/g1/g1Log.hpp" |
stefank@2314 | 34 | #include "gc_implementation/g1/heapRegionRemSet.hpp" |
stefank@2314 | 35 | #include "gc_implementation/shared/gcPolicyCounters.hpp" |
stefank@2314 | 36 | #include "runtime/arguments.hpp" |
stefank@2314 | 37 | #include "runtime/java.hpp" |
stefank@2314 | 38 | #include "runtime/mutexLocker.hpp" |
stefank@2314 | 39 | #include "utilities/debug.hpp" |
ysr@777 | 40 | |
ysr@777 | 41 | // Different defaults for different number of GC threads |
ysr@777 | 42 | // They were chosen by running GCOld and SPECjbb on debris with different |
ysr@777 | 43 | // numbers of GC threads and choosing them based on the results |
ysr@777 | 44 | |
ysr@777 | 45 | // all the same |
ysr@777 | 46 | static double rs_length_diff_defaults[] = { |
ysr@777 | 47 | 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0, 0.0 |
ysr@777 | 48 | }; |
ysr@777 | 49 | |
ysr@777 | 50 | static double cost_per_card_ms_defaults[] = { |
ysr@777 | 51 | 0.01, 0.005, 0.005, 0.003, 0.003, 0.002, 0.002, 0.0015 |
ysr@777 | 52 | }; |
ysr@777 | 53 | |
ysr@777 | 54 | // all the same |
tonyp@3337 | 55 | static double young_cards_per_entry_ratio_defaults[] = { |
ysr@777 | 56 | 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0 |
ysr@777 | 57 | }; |
ysr@777 | 58 | |
ysr@777 | 59 | static double cost_per_entry_ms_defaults[] = { |
ysr@777 | 60 | 0.015, 0.01, 0.01, 0.008, 0.008, 0.0055, 0.0055, 0.005 |
ysr@777 | 61 | }; |
ysr@777 | 62 | |
ysr@777 | 63 | static double cost_per_byte_ms_defaults[] = { |
ysr@777 | 64 | 0.00006, 0.00003, 0.00003, 0.000015, 0.000015, 0.00001, 0.00001, 0.000009 |
ysr@777 | 65 | }; |
ysr@777 | 66 | |
ysr@777 | 67 | // these should be pretty consistent |
ysr@777 | 68 | static double constant_other_time_ms_defaults[] = { |
ysr@777 | 69 | 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0, 5.0 |
ysr@777 | 70 | }; |
ysr@777 | 71 | |
ysr@777 | 72 | |
ysr@777 | 73 | static double young_other_cost_per_region_ms_defaults[] = { |
ysr@777 | 74 | 0.3, 0.2, 0.2, 0.15, 0.15, 0.12, 0.12, 0.1 |
ysr@777 | 75 | }; |
ysr@777 | 76 | |
ysr@777 | 77 | static double non_young_other_cost_per_region_ms_defaults[] = { |
ysr@777 | 78 | 1.0, 0.7, 0.7, 0.5, 0.5, 0.42, 0.42, 0.30 |
ysr@777 | 79 | }; |
ysr@777 | 80 | |
ysr@777 | 81 | G1CollectorPolicy::G1CollectorPolicy() : |
jmasa@2188 | 82 | _parallel_gc_threads(G1CollectedHeap::use_parallel_gc_threads() |
johnc@3021 | 83 | ? ParallelGCThreads : 1), |
jmasa@2188 | 84 | |
ysr@777 | 85 | _recent_gc_times_ms(new TruncatedSeq(NumPrevPausesForHeuristics)), |
ysr@777 | 86 | _stop_world_start(0.0), |
ysr@777 | 87 | |
ysr@777 | 88 | _concurrent_mark_remark_times_ms(new TruncatedSeq(NumPrevPausesForHeuristics)), |
ysr@777 | 89 | _concurrent_mark_cleanup_times_ms(new TruncatedSeq(NumPrevPausesForHeuristics)), |
ysr@777 | 90 | |
ysr@777 | 91 | _alloc_rate_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 92 | _prev_collection_pause_end_ms(0.0), |
ysr@777 | 93 | _rs_length_diff_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 94 | _cost_per_card_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
tonyp@3337 | 95 | _young_cards_per_entry_ratio_seq(new TruncatedSeq(TruncatedSeqLength)), |
tonyp@3337 | 96 | _mixed_cards_per_entry_ratio_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 97 | _cost_per_entry_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
tonyp@3337 | 98 | _mixed_cost_per_entry_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 99 | _cost_per_byte_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 100 | _cost_per_byte_ms_during_cm_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 101 | _constant_other_time_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 102 | _young_other_cost_per_region_ms_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 103 | _non_young_other_cost_per_region_ms_seq( |
ysr@777 | 104 | new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 105 | |
ysr@777 | 106 | _pending_cards_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 107 | _rs_lengths_seq(new TruncatedSeq(TruncatedSeqLength)), |
ysr@777 | 108 | |
johnc@1186 | 109 | _pause_time_target_ms((double) MaxGCPauseMillis), |
ysr@777 | 110 | |
tonyp@3337 | 111 | _gcs_are_young(true), |
ysr@777 | 112 | |
ysr@777 | 113 | _during_marking(false), |
ysr@777 | 114 | _in_marking_window(false), |
ysr@777 | 115 | _in_marking_window_im(false), |
ysr@777 | 116 | |
tonyp@3337 | 117 | _recent_prev_end_times_for_all_gcs_sec( |
tonyp@3337 | 118 | new TruncatedSeq(NumPrevPausesForHeuristics)), |
ysr@777 | 119 | |
ysr@777 | 120 | _recent_avg_pause_time_ratio(0.0), |
ysr@777 | 121 | |
tonyp@1794 | 122 | _initiate_conc_mark_if_possible(false), |
tonyp@1794 | 123 | _during_initial_mark_pause(false), |
tonyp@3337 | 124 | _last_young_gc(false), |
tonyp@3337 | 125 | _last_gc_was_young(false), |
ysr@777 | 126 | |
tonyp@2961 | 127 | _eden_bytes_before_gc(0), |
tonyp@2961 | 128 | _survivor_bytes_before_gc(0), |
tonyp@2961 | 129 | _capacity_before_gc(0), |
tonyp@2961 | 130 | |
tonyp@3289 | 131 | _eden_cset_region_length(0), |
tonyp@3289 | 132 | _survivor_cset_region_length(0), |
tonyp@3289 | 133 | _old_cset_region_length(0), |
tonyp@3289 | 134 | |
ysr@777 | 135 | _collection_set(NULL), |
johnc@1829 | 136 | _collection_set_bytes_used_before(0), |
johnc@1829 | 137 | |
johnc@1829 | 138 | // Incremental CSet attributes |
johnc@1829 | 139 | _inc_cset_build_state(Inactive), |
johnc@1829 | 140 | _inc_cset_head(NULL), |
johnc@1829 | 141 | _inc_cset_tail(NULL), |
johnc@1829 | 142 | _inc_cset_bytes_used_before(0), |
johnc@1829 | 143 | _inc_cset_max_finger(NULL), |
johnc@1829 | 144 | _inc_cset_recorded_rs_lengths(0), |
tonyp@3356 | 145 | _inc_cset_recorded_rs_lengths_diffs(0), |
johnc@1829 | 146 | _inc_cset_predicted_elapsed_time_ms(0.0), |
tonyp@3356 | 147 | _inc_cset_predicted_elapsed_time_ms_diffs(0.0), |
johnc@1829 | 148 | |
ysr@777 | 149 | #ifdef _MSC_VER // the use of 'this' below gets a warning, make it go away |
ysr@777 | 150 | #pragma warning( disable:4355 ) // 'this' : used in base member initializer list |
ysr@777 | 151 | #endif // _MSC_VER |
ysr@777 | 152 | |
ysr@777 | 153 | _short_lived_surv_rate_group(new SurvRateGroup(this, "Short Lived", |
ysr@777 | 154 | G1YoungSurvRateNumRegionsSummary)), |
ysr@777 | 155 | _survivor_surv_rate_group(new SurvRateGroup(this, "Survivor", |
apetrusenko@980 | 156 | G1YoungSurvRateNumRegionsSummary)), |
ysr@777 | 157 | // add here any more surv rate groups |
apetrusenko@980 | 158 | _recorded_survivor_regions(0), |
apetrusenko@980 | 159 | _recorded_survivor_head(NULL), |
apetrusenko@980 | 160 | _recorded_survivor_tail(NULL), |
tonyp@1791 | 161 | _survivors_age_table(true), |
tonyp@1791 | 162 | |
tonyp@3114 | 163 | _gc_overhead_perc(0.0) { |
tonyp@3114 | 164 | |
tonyp@1377 | 165 | // Set up the region size and associated fields. Given that the |
tonyp@1377 | 166 | // policy is created before the heap, we have to set this up here, |
tonyp@1377 | 167 | // so it's done as soon as possible. |
tonyp@1377 | 168 | HeapRegion::setup_heap_region_size(Arguments::min_heap_size()); |
iveresov@1696 | 169 | HeapRegionRemSet::setup_remset_size(); |
tonyp@1377 | 170 | |
tonyp@3114 | 171 | G1ErgoVerbose::initialize(); |
tonyp@3114 | 172 | if (PrintAdaptiveSizePolicy) { |
tonyp@3114 | 173 | // Currently, we only use a single switch for all the heuristics. |
tonyp@3114 | 174 | G1ErgoVerbose::set_enabled(true); |
tonyp@3114 | 175 | // Given that we don't currently have a verboseness level |
tonyp@3114 | 176 | // parameter, we'll hardcode this to high. This can be easily |
tonyp@3114 | 177 | // changed in the future. |
tonyp@3114 | 178 | G1ErgoVerbose::set_level(ErgoHigh); |
tonyp@3114 | 179 | } else { |
tonyp@3114 | 180 | G1ErgoVerbose::set_enabled(false); |
tonyp@3114 | 181 | } |
tonyp@3114 | 182 | |
apetrusenko@1826 | 183 | // Verify PLAB sizes |
johnc@3182 | 184 | const size_t region_size = HeapRegion::GrainWords; |
apetrusenko@1826 | 185 | if (YoungPLABSize > region_size || OldPLABSize > region_size) { |
apetrusenko@1826 | 186 | char buffer[128]; |
johnc@3182 | 187 | jio_snprintf(buffer, sizeof(buffer), "%sPLABSize should be at most "SIZE_FORMAT, |
apetrusenko@1826 | 188 | OldPLABSize > region_size ? "Old" : "Young", region_size); |
apetrusenko@1826 | 189 | vm_exit_during_initialization(buffer); |
apetrusenko@1826 | 190 | } |
apetrusenko@1826 | 191 | |
ysr@777 | 192 | _recent_prev_end_times_for_all_gcs_sec->add(os::elapsedTime()); |
ysr@777 | 193 | _prev_collection_pause_end_ms = os::elapsedTime() * 1000.0; |
ysr@777 | 194 | |
brutisso@3923 | 195 | _phase_times = new G1GCPhaseTimes(_parallel_gc_threads); |
ysr@777 | 196 | |
brutisso@3923 | 197 | int index = MIN2(_parallel_gc_threads - 1, 7); |
ysr@777 | 198 | |
ysr@777 | 199 | _rs_length_diff_seq->add(rs_length_diff_defaults[index]); |
ysr@777 | 200 | _cost_per_card_ms_seq->add(cost_per_card_ms_defaults[index]); |
tonyp@3337 | 201 | _young_cards_per_entry_ratio_seq->add( |
tonyp@3337 | 202 | young_cards_per_entry_ratio_defaults[index]); |
ysr@777 | 203 | _cost_per_entry_ms_seq->add(cost_per_entry_ms_defaults[index]); |
ysr@777 | 204 | _cost_per_byte_ms_seq->add(cost_per_byte_ms_defaults[index]); |
ysr@777 | 205 | _constant_other_time_ms_seq->add(constant_other_time_ms_defaults[index]); |
ysr@777 | 206 | _young_other_cost_per_region_ms_seq->add( |
ysr@777 | 207 | young_other_cost_per_region_ms_defaults[index]); |
ysr@777 | 208 | _non_young_other_cost_per_region_ms_seq->add( |
ysr@777 | 209 | non_young_other_cost_per_region_ms_defaults[index]); |
ysr@777 | 210 | |
tonyp@1965 | 211 | // Below, we might need to calculate the pause time target based on |
tonyp@1965 | 212 | // the pause interval. When we do so we are going to give G1 maximum |
tonyp@1965 | 213 | // flexibility and allow it to do pauses when it needs to. So, we'll |
tonyp@1965 | 214 | // arrange that the pause interval to be pause time target + 1 to |
tonyp@1965 | 215 | // ensure that a) the pause time target is maximized with respect to |
tonyp@1965 | 216 | // the pause interval and b) we maintain the invariant that pause |
tonyp@1965 | 217 | // time target < pause interval. If the user does not want this |
tonyp@1965 | 218 | // maximum flexibility, they will have to set the pause interval |
tonyp@1965 | 219 | // explicitly. |
tonyp@1965 | 220 | |
tonyp@1965 | 221 | // First make sure that, if either parameter is set, its value is |
tonyp@1965 | 222 | // reasonable. |
tonyp@1965 | 223 | if (!FLAG_IS_DEFAULT(MaxGCPauseMillis)) { |
tonyp@1965 | 224 | if (MaxGCPauseMillis < 1) { |
tonyp@1965 | 225 | vm_exit_during_initialization("MaxGCPauseMillis should be " |
tonyp@1965 | 226 | "greater than 0"); |
tonyp@1965 | 227 | } |
tonyp@1965 | 228 | } |
tonyp@1965 | 229 | if (!FLAG_IS_DEFAULT(GCPauseIntervalMillis)) { |
tonyp@1965 | 230 | if (GCPauseIntervalMillis < 1) { |
tonyp@1965 | 231 | vm_exit_during_initialization("GCPauseIntervalMillis should be " |
tonyp@1965 | 232 | "greater than 0"); |
tonyp@1965 | 233 | } |
tonyp@1965 | 234 | } |
tonyp@1965 | 235 | |
tonyp@1965 | 236 | // Then, if the pause time target parameter was not set, set it to |
tonyp@1965 | 237 | // the default value. |
tonyp@1965 | 238 | if (FLAG_IS_DEFAULT(MaxGCPauseMillis)) { |
tonyp@1965 | 239 | if (FLAG_IS_DEFAULT(GCPauseIntervalMillis)) { |
tonyp@1965 | 240 | // The default pause time target in G1 is 200ms |
tonyp@1965 | 241 | FLAG_SET_DEFAULT(MaxGCPauseMillis, 200); |
tonyp@1965 | 242 | } else { |
tonyp@1965 | 243 | // We do not allow the pause interval to be set without the |
tonyp@1965 | 244 | // pause time target |
tonyp@1965 | 245 | vm_exit_during_initialization("GCPauseIntervalMillis cannot be set " |
tonyp@1965 | 246 | "without setting MaxGCPauseMillis"); |
tonyp@1965 | 247 | } |
tonyp@1965 | 248 | } |
tonyp@1965 | 249 | |
tonyp@1965 | 250 | // Then, if the interval parameter was not set, set it according to |
tonyp@1965 | 251 | // the pause time target (this will also deal with the case when the |
tonyp@1965 | 252 | // pause time target is the default value). |
tonyp@1965 | 253 | if (FLAG_IS_DEFAULT(GCPauseIntervalMillis)) { |
tonyp@1965 | 254 | FLAG_SET_DEFAULT(GCPauseIntervalMillis, MaxGCPauseMillis + 1); |
tonyp@1965 | 255 | } |
tonyp@1965 | 256 | |
tonyp@1965 | 257 | // Finally, make sure that the two parameters are consistent. |
tonyp@1965 | 258 | if (MaxGCPauseMillis >= GCPauseIntervalMillis) { |
tonyp@1965 | 259 | char buffer[256]; |
tonyp@1965 | 260 | jio_snprintf(buffer, 256, |
tonyp@1965 | 261 | "MaxGCPauseMillis (%u) should be less than " |
tonyp@1965 | 262 | "GCPauseIntervalMillis (%u)", |
tonyp@1965 | 263 | MaxGCPauseMillis, GCPauseIntervalMillis); |
tonyp@1965 | 264 | vm_exit_during_initialization(buffer); |
tonyp@1965 | 265 | } |
tonyp@1965 | 266 | |
tonyp@1965 | 267 | double max_gc_time = (double) MaxGCPauseMillis / 1000.0; |
johnc@1186 | 268 | double time_slice = (double) GCPauseIntervalMillis / 1000.0; |
ysr@777 | 269 | _mmu_tracker = new G1MMUTrackerQueue(time_slice, max_gc_time); |
poonam@4650 | 270 | |
poonam@4650 | 271 | uintx confidence_perc = G1ConfidencePercent; |
poonam@4650 | 272 | // Put an artificial ceiling on this so that it's not set to a silly value. |
poonam@4650 | 273 | if (confidence_perc > 100) { |
poonam@4650 | 274 | confidence_perc = 100; |
poonam@4650 | 275 | warning("G1ConfidencePercent is set to a value that is too large, " |
poonam@4650 | 276 | "it's been updated to %u", confidence_perc); |
poonam@4650 | 277 | } |
poonam@4650 | 278 | _sigma = (double) confidence_perc / 100.0; |
ysr@777 | 279 | |
ysr@777 | 280 | // start conservatively (around 50ms is about right) |
ysr@777 | 281 | _concurrent_mark_remark_times_ms->add(0.05); |
ysr@777 | 282 | _concurrent_mark_cleanup_times_ms->add(0.20); |
ysr@777 | 283 | _tenuring_threshold = MaxTenuringThreshold; |
tonyp@3066 | 284 | // _max_survivor_regions will be calculated by |
tonyp@3119 | 285 | // update_young_list_target_length() during initialization. |
tonyp@3066 | 286 | _max_survivor_regions = 0; |
apetrusenko@980 | 287 | |
tonyp@1791 | 288 | assert(GCTimeRatio > 0, |
tonyp@1791 | 289 | "we should have set it to a default value set_g1_gc_flags() " |
tonyp@1791 | 290 | "if a user set it to 0"); |
tonyp@1791 | 291 | _gc_overhead_perc = 100.0 * (1.0 / (1.0 + GCTimeRatio)); |
tonyp@1791 | 292 | |
tonyp@3119 | 293 | uintx reserve_perc = G1ReservePercent; |
tonyp@3119 | 294 | // Put an artificial ceiling on this so that it's not set to a silly value. |
tonyp@3119 | 295 | if (reserve_perc > 50) { |
tonyp@3119 | 296 | reserve_perc = 50; |
tonyp@3119 | 297 | warning("G1ReservePercent is set to a value that is too large, " |
tonyp@3119 | 298 | "it's been updated to %u", reserve_perc); |
tonyp@3119 | 299 | } |
tonyp@3119 | 300 | _reserve_factor = (double) reserve_perc / 100.0; |
brutisso@3120 | 301 | // This will be set when the heap is expanded |
tonyp@3119 | 302 | // for the first time during initialization. |
tonyp@3119 | 303 | _reserve_regions = 0; |
tonyp@3119 | 304 | |
ysr@777 | 305 | initialize_all(); |
tonyp@3209 | 306 | _collectionSetChooser = new CollectionSetChooser(); |
brutisso@3358 | 307 | _young_gen_sizer = new G1YoungGenSizer(); // Must be after call to initialize_flags |
ysr@777 | 308 | } |
ysr@777 | 309 | |
ysr@777 | 310 | void G1CollectorPolicy::initialize_flags() { |
ysr@777 | 311 | set_min_alignment(HeapRegion::GrainBytes); |
ysr@777 | 312 | set_max_alignment(GenRemSet::max_alignment_constraint(rem_set_name())); |
apetrusenko@982 | 313 | if (SurvivorRatio < 1) { |
apetrusenko@982 | 314 | vm_exit_during_initialization("Invalid survivor ratio specified"); |
apetrusenko@982 | 315 | } |
ysr@777 | 316 | CollectorPolicy::initialize_flags(); |
ysr@777 | 317 | } |
ysr@777 | 318 | |
brutisso@3358 | 319 | G1YoungGenSizer::G1YoungGenSizer() : _sizer_kind(SizerDefaults), _adaptive_size(true) { |
johnc@4385 | 320 | assert(G1NewSizePercent <= G1MaxNewSizePercent, "Min larger than max"); |
johnc@4385 | 321 | assert(G1NewSizePercent > 0 && G1NewSizePercent < 100, "Min out of bounds"); |
johnc@4385 | 322 | assert(G1MaxNewSizePercent > 0 && G1MaxNewSizePercent < 100, "Max out of bounds"); |
brutisso@3120 | 323 | |
brutisso@3120 | 324 | if (FLAG_IS_CMDLINE(NewRatio)) { |
brutisso@3120 | 325 | if (FLAG_IS_CMDLINE(NewSize) || FLAG_IS_CMDLINE(MaxNewSize)) { |
tonyp@3172 | 326 | warning("-XX:NewSize and -XX:MaxNewSize override -XX:NewRatio"); |
brutisso@3120 | 327 | } else { |
brutisso@3358 | 328 | _sizer_kind = SizerNewRatio; |
brutisso@3358 | 329 | _adaptive_size = false; |
brutisso@3358 | 330 | return; |
brutisso@3120 | 331 | } |
brutisso@3120 | 332 | } |
brutisso@3120 | 333 | |
brutisso@3358 | 334 | if (FLAG_IS_CMDLINE(NewSize)) { |
tonyp@3713 | 335 | _min_desired_young_length = MAX2((uint) (NewSize / HeapRegion::GrainBytes), |
tonyp@3713 | 336 | 1U); |
brutisso@3358 | 337 | if (FLAG_IS_CMDLINE(MaxNewSize)) { |
tonyp@3713 | 338 | _max_desired_young_length = |
tonyp@3713 | 339 | MAX2((uint) (MaxNewSize / HeapRegion::GrainBytes), |
tonyp@3713 | 340 | 1U); |
brutisso@3358 | 341 | _sizer_kind = SizerMaxAndNewSize; |
brutisso@3358 | 342 | _adaptive_size = _min_desired_young_length == _max_desired_young_length; |
brutisso@3358 | 343 | } else { |
brutisso@3358 | 344 | _sizer_kind = SizerNewSizeOnly; |
brutisso@3358 | 345 | } |
brutisso@3358 | 346 | } else if (FLAG_IS_CMDLINE(MaxNewSize)) { |
tonyp@3713 | 347 | _max_desired_young_length = |
tonyp@3713 | 348 | MAX2((uint) (MaxNewSize / HeapRegion::GrainBytes), |
tonyp@3713 | 349 | 1U); |
brutisso@3358 | 350 | _sizer_kind = SizerMaxNewSizeOnly; |
brutisso@3358 | 351 | } |
brutisso@3358 | 352 | } |
brutisso@3358 | 353 | |
tonyp@3713 | 354 | uint G1YoungGenSizer::calculate_default_min_length(uint new_number_of_heap_regions) { |
johnc@4385 | 355 | uint default_value = (new_number_of_heap_regions * G1NewSizePercent) / 100; |
tonyp@3713 | 356 | return MAX2(1U, default_value); |
brutisso@3358 | 357 | } |
brutisso@3358 | 358 | |
tonyp@3713 | 359 | uint G1YoungGenSizer::calculate_default_max_length(uint new_number_of_heap_regions) { |
johnc@4385 | 360 | uint default_value = (new_number_of_heap_regions * G1MaxNewSizePercent) / 100; |
tonyp@3713 | 361 | return MAX2(1U, default_value); |
brutisso@3358 | 362 | } |
brutisso@3358 | 363 | |
tonyp@3713 | 364 | void G1YoungGenSizer::heap_size_changed(uint new_number_of_heap_regions) { |
brutisso@3358 | 365 | assert(new_number_of_heap_regions > 0, "Heap must be initialized"); |
brutisso@3358 | 366 | |
brutisso@3358 | 367 | switch (_sizer_kind) { |
brutisso@3358 | 368 | case SizerDefaults: |
brutisso@3358 | 369 | _min_desired_young_length = calculate_default_min_length(new_number_of_heap_regions); |
brutisso@3358 | 370 | _max_desired_young_length = calculate_default_max_length(new_number_of_heap_regions); |
brutisso@3358 | 371 | break; |
brutisso@3358 | 372 | case SizerNewSizeOnly: |
brutisso@3358 | 373 | _max_desired_young_length = calculate_default_max_length(new_number_of_heap_regions); |
brutisso@3358 | 374 | _max_desired_young_length = MAX2(_min_desired_young_length, _max_desired_young_length); |
brutisso@3358 | 375 | break; |
brutisso@3358 | 376 | case SizerMaxNewSizeOnly: |
brutisso@3358 | 377 | _min_desired_young_length = calculate_default_min_length(new_number_of_heap_regions); |
brutisso@3358 | 378 | _min_desired_young_length = MIN2(_min_desired_young_length, _max_desired_young_length); |
brutisso@3358 | 379 | break; |
brutisso@3358 | 380 | case SizerMaxAndNewSize: |
brutisso@3358 | 381 | // Do nothing. Values set on the command line, don't update them at runtime. |
brutisso@3358 | 382 | break; |
brutisso@3358 | 383 | case SizerNewRatio: |
brutisso@3358 | 384 | _min_desired_young_length = new_number_of_heap_regions / (NewRatio + 1); |
brutisso@3358 | 385 | _max_desired_young_length = _min_desired_young_length; |
brutisso@3358 | 386 | break; |
brutisso@3358 | 387 | default: |
brutisso@3358 | 388 | ShouldNotReachHere(); |
brutisso@3358 | 389 | } |
brutisso@3358 | 390 | |
brutisso@3120 | 391 | assert(_min_desired_young_length <= _max_desired_young_length, "Invalid min/max young gen size values"); |
brutisso@3358 | 392 | } |
brutisso@3358 | 393 | |
brutisso@3358 | 394 | void G1CollectorPolicy::init() { |
brutisso@3358 | 395 | // Set aside an initial future to_space. |
brutisso@3358 | 396 | _g1 = G1CollectedHeap::heap(); |
brutisso@3358 | 397 | |
brutisso@3358 | 398 | assert(Heap_lock->owned_by_self(), "Locking discipline."); |
brutisso@3358 | 399 | |
brutisso@3358 | 400 | initialize_gc_policy_counters(); |
brutisso@3358 | 401 | |
brutisso@3120 | 402 | if (adaptive_young_list_length()) { |
brutisso@3065 | 403 | _young_list_fixed_length = 0; |
johnc@1829 | 404 | } else { |
brutisso@3358 | 405 | _young_list_fixed_length = _young_gen_sizer->min_desired_young_length(); |
ysr@777 | 406 | } |
brutisso@3065 | 407 | _free_regions_at_end_of_collection = _g1->free_regions(); |
tonyp@3119 | 408 | update_young_list_target_length(); |
brutisso@3120 | 409 | _prev_eden_capacity = _young_list_target_length * HeapRegion::GrainBytes; |
johnc@1829 | 410 | |
johnc@1829 | 411 | // We may immediately start allocating regions and placing them on the |
johnc@1829 | 412 | // collection set list. Initialize the per-collection set info |
johnc@1829 | 413 | start_incremental_cset_building(); |
ysr@777 | 414 | } |
ysr@777 | 415 | |
apetrusenko@980 | 416 | // Create the jstat counters for the policy. |
tonyp@3119 | 417 | void G1CollectorPolicy::initialize_gc_policy_counters() { |
brutisso@3065 | 418 | _gc_policy_counters = new GCPolicyCounters("GarbageFirst", 1, 3); |
apetrusenko@980 | 419 | } |
apetrusenko@980 | 420 | |
tonyp@3713 | 421 | bool G1CollectorPolicy::predict_will_fit(uint young_length, |
tonyp@3119 | 422 | double base_time_ms, |
tonyp@3713 | 423 | uint base_free_regions, |
tonyp@3119 | 424 | double target_pause_time_ms) { |
tonyp@3119 | 425 | if (young_length >= base_free_regions) { |
tonyp@3119 | 426 | // end condition 1: not enough space for the young regions |
tonyp@3119 | 427 | return false; |
ysr@777 | 428 | } |
tonyp@3119 | 429 | |
tonyp@3713 | 430 | double accum_surv_rate = accum_yg_surv_rate_pred((int) young_length - 1); |
tonyp@3119 | 431 | size_t bytes_to_copy = |
tonyp@3119 | 432 | (size_t) (accum_surv_rate * (double) HeapRegion::GrainBytes); |
tonyp@3119 | 433 | double copy_time_ms = predict_object_copy_time_ms(bytes_to_copy); |
tonyp@3119 | 434 | double young_other_time_ms = predict_young_other_time_ms(young_length); |
tonyp@3119 | 435 | double pause_time_ms = base_time_ms + copy_time_ms + young_other_time_ms; |
tonyp@3119 | 436 | if (pause_time_ms > target_pause_time_ms) { |
tonyp@3119 | 437 | // end condition 2: prediction is over the target pause time |
tonyp@3119 | 438 | return false; |
tonyp@3119 | 439 | } |
tonyp@3119 | 440 | |
tonyp@3119 | 441 | size_t free_bytes = |
tonyp@3713 | 442 | (base_free_regions - young_length) * HeapRegion::GrainBytes; |
tonyp@3119 | 443 | if ((2.0 * sigma()) * (double) bytes_to_copy > (double) free_bytes) { |
tonyp@3119 | 444 | // end condition 3: out-of-space (conservatively!) |
tonyp@3119 | 445 | return false; |
tonyp@3119 | 446 | } |
tonyp@3119 | 447 | |
tonyp@3119 | 448 | // success! |
tonyp@3119 | 449 | return true; |
ysr@777 | 450 | } |
ysr@777 | 451 | |
tonyp@3713 | 452 | void G1CollectorPolicy::record_new_heap_size(uint new_number_of_regions) { |
brutisso@3120 | 453 | // re-calculate the necessary reserve |
brutisso@3120 | 454 | double reserve_regions_d = (double) new_number_of_regions * _reserve_factor; |
tonyp@3119 | 455 | // We use ceiling so that if reserve_regions_d is > 0.0 (but |
tonyp@3119 | 456 | // smaller than 1.0) we'll get 1. |
tonyp@3713 | 457 | _reserve_regions = (uint) ceil(reserve_regions_d); |
brutisso@3120 | 458 | |
brutisso@3358 | 459 | _young_gen_sizer->heap_size_changed(new_number_of_regions); |
tonyp@3119 | 460 | } |
tonyp@3119 | 461 | |
tonyp@3713 | 462 | uint G1CollectorPolicy::calculate_young_list_desired_min_length( |
tonyp@3713 | 463 | uint base_min_length) { |
tonyp@3713 | 464 | uint desired_min_length = 0; |
ysr@777 | 465 | if (adaptive_young_list_length()) { |
tonyp@3119 | 466 | if (_alloc_rate_ms_seq->num() > 3) { |
tonyp@3119 | 467 | double now_sec = os::elapsedTime(); |
tonyp@3119 | 468 | double when_ms = _mmu_tracker->when_max_gc_sec(now_sec) * 1000.0; |
tonyp@3119 | 469 | double alloc_rate_ms = predict_alloc_rate_ms(); |
tonyp@3713 | 470 | desired_min_length = (uint) ceil(alloc_rate_ms * when_ms); |
tonyp@3119 | 471 | } else { |
tonyp@3119 | 472 | // otherwise we don't have enough info to make the prediction |
tonyp@3119 | 473 | } |
ysr@777 | 474 | } |
brutisso@3120 | 475 | desired_min_length += base_min_length; |
brutisso@3120 | 476 | // make sure we don't go below any user-defined minimum bound |
brutisso@3358 | 477 | return MAX2(_young_gen_sizer->min_desired_young_length(), desired_min_length); |
ysr@777 | 478 | } |
ysr@777 | 479 | |
tonyp@3713 | 480 | uint G1CollectorPolicy::calculate_young_list_desired_max_length() { |
tonyp@3119 | 481 | // Here, we might want to also take into account any additional |
tonyp@3119 | 482 | // constraints (i.e., user-defined minimum bound). Currently, we |
tonyp@3119 | 483 | // effectively don't set this bound. |
brutisso@3358 | 484 | return _young_gen_sizer->max_desired_young_length(); |
tonyp@3119 | 485 | } |
tonyp@3119 | 486 | |
tonyp@3119 | 487 | void G1CollectorPolicy::update_young_list_target_length(size_t rs_lengths) { |
tonyp@3119 | 488 | if (rs_lengths == (size_t) -1) { |
tonyp@3119 | 489 | // if it's set to the default value (-1), we should predict it; |
tonyp@3119 | 490 | // otherwise, use the given value. |
tonyp@3119 | 491 | rs_lengths = (size_t) get_new_prediction(_rs_lengths_seq); |
tonyp@3119 | 492 | } |
tonyp@3119 | 493 | |
tonyp@3119 | 494 | // Calculate the absolute and desired min bounds. |
tonyp@3119 | 495 | |
tonyp@3119 | 496 | // This is how many young regions we already have (currently: the survivors). |
tonyp@3713 | 497 | uint base_min_length = recorded_survivor_regions(); |
tonyp@3119 | 498 | // This is the absolute minimum young length, which ensures that we |
tonyp@3119 | 499 | // can allocate one eden region in the worst-case. |
tonyp@3713 | 500 | uint absolute_min_length = base_min_length + 1; |
tonyp@3713 | 501 | uint desired_min_length = |
tonyp@3119 | 502 | calculate_young_list_desired_min_length(base_min_length); |
tonyp@3119 | 503 | if (desired_min_length < absolute_min_length) { |
tonyp@3119 | 504 | desired_min_length = absolute_min_length; |
tonyp@3119 | 505 | } |
tonyp@3119 | 506 | |
tonyp@3119 | 507 | // Calculate the absolute and desired max bounds. |
tonyp@3119 | 508 | |
tonyp@3119 | 509 | // We will try our best not to "eat" into the reserve. |
tonyp@3713 | 510 | uint absolute_max_length = 0; |
tonyp@3119 | 511 | if (_free_regions_at_end_of_collection > _reserve_regions) { |
tonyp@3119 | 512 | absolute_max_length = _free_regions_at_end_of_collection - _reserve_regions; |
tonyp@3119 | 513 | } |
tonyp@3713 | 514 | uint desired_max_length = calculate_young_list_desired_max_length(); |
tonyp@3119 | 515 | if (desired_max_length > absolute_max_length) { |
tonyp@3119 | 516 | desired_max_length = absolute_max_length; |
tonyp@3119 | 517 | } |
tonyp@3119 | 518 | |
tonyp@3713 | 519 | uint young_list_target_length = 0; |
tonyp@3119 | 520 | if (adaptive_young_list_length()) { |
tonyp@3337 | 521 | if (gcs_are_young()) { |
tonyp@3119 | 522 | young_list_target_length = |
tonyp@3119 | 523 | calculate_young_list_target_length(rs_lengths, |
tonyp@3119 | 524 | base_min_length, |
tonyp@3119 | 525 | desired_min_length, |
tonyp@3119 | 526 | desired_max_length); |
tonyp@3119 | 527 | _rs_lengths_prediction = rs_lengths; |
tonyp@3119 | 528 | } else { |
tonyp@3119 | 529 | // Don't calculate anything and let the code below bound it to |
tonyp@3119 | 530 | // the desired_min_length, i.e., do the next GC as soon as |
tonyp@3119 | 531 | // possible to maximize how many old regions we can add to it. |
ysr@777 | 532 | } |
ysr@777 | 533 | } else { |
tonyp@3539 | 534 | // The user asked for a fixed young gen so we'll fix the young gen |
tonyp@3539 | 535 | // whether the next GC is young or mixed. |
tonyp@3539 | 536 | young_list_target_length = _young_list_fixed_length; |
ysr@777 | 537 | } |
ysr@777 | 538 | |
tonyp@3119 | 539 | // Make sure we don't go over the desired max length, nor under the |
tonyp@3119 | 540 | // desired min length. In case they clash, desired_min_length wins |
tonyp@3119 | 541 | // which is why that test is second. |
tonyp@3119 | 542 | if (young_list_target_length > desired_max_length) { |
tonyp@3119 | 543 | young_list_target_length = desired_max_length; |
tonyp@3119 | 544 | } |
tonyp@3119 | 545 | if (young_list_target_length < desired_min_length) { |
tonyp@3119 | 546 | young_list_target_length = desired_min_length; |
tonyp@3119 | 547 | } |
tonyp@3119 | 548 | |
tonyp@3119 | 549 | assert(young_list_target_length > recorded_survivor_regions(), |
tonyp@3119 | 550 | "we should be able to allocate at least one eden region"); |
tonyp@3119 | 551 | assert(young_list_target_length >= absolute_min_length, "post-condition"); |
tonyp@3119 | 552 | _young_list_target_length = young_list_target_length; |
tonyp@3119 | 553 | |
tonyp@3119 | 554 | update_max_gc_locker_expansion(); |
ysr@777 | 555 | } |
ysr@777 | 556 | |
tonyp@3713 | 557 | uint |
tonyp@3119 | 558 | G1CollectorPolicy::calculate_young_list_target_length(size_t rs_lengths, |
tonyp@3713 | 559 | uint base_min_length, |
tonyp@3713 | 560 | uint desired_min_length, |
tonyp@3713 | 561 | uint desired_max_length) { |
tonyp@3119 | 562 | assert(adaptive_young_list_length(), "pre-condition"); |
tonyp@3337 | 563 | assert(gcs_are_young(), "only call this for young GCs"); |
tonyp@3119 | 564 | |
tonyp@3119 | 565 | // In case some edge-condition makes the desired max length too small... |
tonyp@3119 | 566 | if (desired_max_length <= desired_min_length) { |
tonyp@3119 | 567 | return desired_min_length; |
tonyp@3119 | 568 | } |
tonyp@3119 | 569 | |
tonyp@3119 | 570 | // We'll adjust min_young_length and max_young_length not to include |
tonyp@3119 | 571 | // the already allocated young regions (i.e., so they reflect the |
tonyp@3119 | 572 | // min and max eden regions we'll allocate). The base_min_length |
tonyp@3119 | 573 | // will be reflected in the predictions by the |
tonyp@3119 | 574 | // survivor_regions_evac_time prediction. |
tonyp@3119 | 575 | assert(desired_min_length > base_min_length, "invariant"); |
tonyp@3713 | 576 | uint min_young_length = desired_min_length - base_min_length; |
tonyp@3119 | 577 | assert(desired_max_length > base_min_length, "invariant"); |
tonyp@3713 | 578 | uint max_young_length = desired_max_length - base_min_length; |
tonyp@3119 | 579 | |
tonyp@3119 | 580 | double target_pause_time_ms = _mmu_tracker->max_gc_time() * 1000.0; |
tonyp@3119 | 581 | double survivor_regions_evac_time = predict_survivor_regions_evac_time(); |
tonyp@3119 | 582 | size_t pending_cards = (size_t) get_new_prediction(_pending_cards_seq); |
tonyp@3119 | 583 | size_t adj_rs_lengths = rs_lengths + predict_rs_length_diff(); |
tonyp@3119 | 584 | size_t scanned_cards = predict_young_card_num(adj_rs_lengths); |
tonyp@3119 | 585 | double base_time_ms = |
tonyp@3119 | 586 | predict_base_elapsed_time_ms(pending_cards, scanned_cards) + |
tonyp@3119 | 587 | survivor_regions_evac_time; |
tonyp@3713 | 588 | uint available_free_regions = _free_regions_at_end_of_collection; |
tonyp@3713 | 589 | uint base_free_regions = 0; |
tonyp@3119 | 590 | if (available_free_regions > _reserve_regions) { |
tonyp@3119 | 591 | base_free_regions = available_free_regions - _reserve_regions; |
tonyp@3119 | 592 | } |
tonyp@3119 | 593 | |
tonyp@3119 | 594 | // Here, we will make sure that the shortest young length that |
tonyp@3119 | 595 | // makes sense fits within the target pause time. |
tonyp@3119 | 596 | |
tonyp@3119 | 597 | if (predict_will_fit(min_young_length, base_time_ms, |
tonyp@3119 | 598 | base_free_regions, target_pause_time_ms)) { |
tonyp@3119 | 599 | // The shortest young length will fit into the target pause time; |
tonyp@3119 | 600 | // we'll now check whether the absolute maximum number of young |
tonyp@3119 | 601 | // regions will fit in the target pause time. If not, we'll do |
tonyp@3119 | 602 | // a binary search between min_young_length and max_young_length. |
tonyp@3119 | 603 | if (predict_will_fit(max_young_length, base_time_ms, |
tonyp@3119 | 604 | base_free_regions, target_pause_time_ms)) { |
tonyp@3119 | 605 | // The maximum young length will fit into the target pause time. |
tonyp@3119 | 606 | // We are done so set min young length to the maximum length (as |
tonyp@3119 | 607 | // the result is assumed to be returned in min_young_length). |
tonyp@3119 | 608 | min_young_length = max_young_length; |
tonyp@3119 | 609 | } else { |
tonyp@3119 | 610 | // The maximum possible number of young regions will not fit within |
tonyp@3119 | 611 | // the target pause time so we'll search for the optimal |
tonyp@3119 | 612 | // length. The loop invariants are: |
tonyp@3119 | 613 | // |
tonyp@3119 | 614 | // min_young_length < max_young_length |
tonyp@3119 | 615 | // min_young_length is known to fit into the target pause time |
tonyp@3119 | 616 | // max_young_length is known not to fit into the target pause time |
tonyp@3119 | 617 | // |
tonyp@3119 | 618 | // Going into the loop we know the above hold as we've just |
tonyp@3119 | 619 | // checked them. Every time around the loop we check whether |
tonyp@3119 | 620 | // the middle value between min_young_length and |
tonyp@3119 | 621 | // max_young_length fits into the target pause time. If it |
tonyp@3119 | 622 | // does, it becomes the new min. If it doesn't, it becomes |
tonyp@3119 | 623 | // the new max. This way we maintain the loop invariants. |
tonyp@3119 | 624 | |
tonyp@3119 | 625 | assert(min_young_length < max_young_length, "invariant"); |
tonyp@3713 | 626 | uint diff = (max_young_length - min_young_length) / 2; |
tonyp@3119 | 627 | while (diff > 0) { |
tonyp@3713 | 628 | uint young_length = min_young_length + diff; |
tonyp@3119 | 629 | if (predict_will_fit(young_length, base_time_ms, |
tonyp@3119 | 630 | base_free_regions, target_pause_time_ms)) { |
tonyp@3119 | 631 | min_young_length = young_length; |
tonyp@3119 | 632 | } else { |
tonyp@3119 | 633 | max_young_length = young_length; |
tonyp@3119 | 634 | } |
tonyp@3119 | 635 | assert(min_young_length < max_young_length, "invariant"); |
tonyp@3119 | 636 | diff = (max_young_length - min_young_length) / 2; |
tonyp@3119 | 637 | } |
tonyp@3119 | 638 | // The results is min_young_length which, according to the |
tonyp@3119 | 639 | // loop invariants, should fit within the target pause time. |
tonyp@3119 | 640 | |
tonyp@3119 | 641 | // These are the post-conditions of the binary search above: |
tonyp@3119 | 642 | assert(min_young_length < max_young_length, |
tonyp@3119 | 643 | "otherwise we should have discovered that max_young_length " |
tonyp@3119 | 644 | "fits into the pause target and not done the binary search"); |
tonyp@3119 | 645 | assert(predict_will_fit(min_young_length, base_time_ms, |
tonyp@3119 | 646 | base_free_regions, target_pause_time_ms), |
tonyp@3119 | 647 | "min_young_length, the result of the binary search, should " |
tonyp@3119 | 648 | "fit into the pause target"); |
tonyp@3119 | 649 | assert(!predict_will_fit(min_young_length + 1, base_time_ms, |
tonyp@3119 | 650 | base_free_regions, target_pause_time_ms), |
tonyp@3119 | 651 | "min_young_length, the result of the binary search, should be " |
tonyp@3119 | 652 | "optimal, so no larger length should fit into the pause target"); |
tonyp@3119 | 653 | } |
tonyp@3119 | 654 | } else { |
tonyp@3119 | 655 | // Even the minimum length doesn't fit into the pause time |
tonyp@3119 | 656 | // target, return it as the result nevertheless. |
tonyp@3119 | 657 | } |
tonyp@3119 | 658 | return base_min_length + min_young_length; |
ysr@777 | 659 | } |
ysr@777 | 660 | |
apetrusenko@980 | 661 | double G1CollectorPolicy::predict_survivor_regions_evac_time() { |
apetrusenko@980 | 662 | double survivor_regions_evac_time = 0.0; |
apetrusenko@980 | 663 | for (HeapRegion * r = _recorded_survivor_head; |
apetrusenko@980 | 664 | r != NULL && r != _recorded_survivor_tail->get_next_young_region(); |
apetrusenko@980 | 665 | r = r->get_next_young_region()) { |
johnc@3998 | 666 | survivor_regions_evac_time += predict_region_elapsed_time_ms(r, gcs_are_young()); |
apetrusenko@980 | 667 | } |
apetrusenko@980 | 668 | return survivor_regions_evac_time; |
apetrusenko@980 | 669 | } |
apetrusenko@980 | 670 | |
tonyp@3119 | 671 | void G1CollectorPolicy::revise_young_list_target_length_if_necessary() { |
ysr@777 | 672 | guarantee( adaptive_young_list_length(), "should not call this otherwise" ); |
ysr@777 | 673 | |
johnc@1829 | 674 | size_t rs_lengths = _g1->young_list()->sampled_rs_lengths(); |
ysr@777 | 675 | if (rs_lengths > _rs_lengths_prediction) { |
ysr@777 | 676 | // add 10% to avoid having to recalculate often |
ysr@777 | 677 | size_t rs_lengths_prediction = rs_lengths * 1100 / 1000; |
tonyp@3119 | 678 | update_young_list_target_length(rs_lengths_prediction); |
ysr@777 | 679 | } |
ysr@777 | 680 | } |
ysr@777 | 681 | |
tonyp@3119 | 682 | |
tonyp@3119 | 683 | |
ysr@777 | 684 | HeapWord* G1CollectorPolicy::mem_allocate_work(size_t size, |
ysr@777 | 685 | bool is_tlab, |
ysr@777 | 686 | bool* gc_overhead_limit_was_exceeded) { |
ysr@777 | 687 | guarantee(false, "Not using this policy feature yet."); |
ysr@777 | 688 | return NULL; |
ysr@777 | 689 | } |
ysr@777 | 690 | |
ysr@777 | 691 | // This method controls how a collector handles one or more |
ysr@777 | 692 | // of its generations being fully allocated. |
ysr@777 | 693 | HeapWord* G1CollectorPolicy::satisfy_failed_allocation(size_t size, |
ysr@777 | 694 | bool is_tlab) { |
ysr@777 | 695 | guarantee(false, "Not using this policy feature yet."); |
ysr@777 | 696 | return NULL; |
ysr@777 | 697 | } |
ysr@777 | 698 | |
ysr@777 | 699 | |
ysr@777 | 700 | #ifndef PRODUCT |
ysr@777 | 701 | bool G1CollectorPolicy::verify_young_ages() { |
johnc@1829 | 702 | HeapRegion* head = _g1->young_list()->first_region(); |
ysr@777 | 703 | return |
ysr@777 | 704 | verify_young_ages(head, _short_lived_surv_rate_group); |
ysr@777 | 705 | // also call verify_young_ages on any additional surv rate groups |
ysr@777 | 706 | } |
ysr@777 | 707 | |
ysr@777 | 708 | bool |
ysr@777 | 709 | G1CollectorPolicy::verify_young_ages(HeapRegion* head, |
ysr@777 | 710 | SurvRateGroup *surv_rate_group) { |
ysr@777 | 711 | guarantee( surv_rate_group != NULL, "pre-condition" ); |
ysr@777 | 712 | |
ysr@777 | 713 | const char* name = surv_rate_group->name(); |
ysr@777 | 714 | bool ret = true; |
ysr@777 | 715 | int prev_age = -1; |
ysr@777 | 716 | |
ysr@777 | 717 | for (HeapRegion* curr = head; |
ysr@777 | 718 | curr != NULL; |
ysr@777 | 719 | curr = curr->get_next_young_region()) { |
ysr@777 | 720 | SurvRateGroup* group = curr->surv_rate_group(); |
ysr@777 | 721 | if (group == NULL && !curr->is_survivor()) { |
ysr@777 | 722 | gclog_or_tty->print_cr("## %s: encountered NULL surv_rate_group", name); |
ysr@777 | 723 | ret = false; |
ysr@777 | 724 | } |
ysr@777 | 725 | |
ysr@777 | 726 | if (surv_rate_group == group) { |
ysr@777 | 727 | int age = curr->age_in_surv_rate_group(); |
ysr@777 | 728 | |
ysr@777 | 729 | if (age < 0) { |
ysr@777 | 730 | gclog_or_tty->print_cr("## %s: encountered negative age", name); |
ysr@777 | 731 | ret = false; |
ysr@777 | 732 | } |
ysr@777 | 733 | |
ysr@777 | 734 | if (age <= prev_age) { |
ysr@777 | 735 | gclog_or_tty->print_cr("## %s: region ages are not strictly increasing " |
ysr@777 | 736 | "(%d, %d)", name, age, prev_age); |
ysr@777 | 737 | ret = false; |
ysr@777 | 738 | } |
ysr@777 | 739 | prev_age = age; |
ysr@777 | 740 | } |
ysr@777 | 741 | } |
ysr@777 | 742 | |
ysr@777 | 743 | return ret; |
ysr@777 | 744 | } |
ysr@777 | 745 | #endif // PRODUCT |
ysr@777 | 746 | |
ysr@777 | 747 | void G1CollectorPolicy::record_full_collection_start() { |
brutisso@3923 | 748 | _full_collection_start_sec = os::elapsedTime(); |
ysr@777 | 749 | // Release the future to-space so that it is available for compaction into. |
ysr@777 | 750 | _g1->set_full_collection(); |
ysr@777 | 751 | } |
ysr@777 | 752 | |
ysr@777 | 753 | void G1CollectorPolicy::record_full_collection_end() { |
ysr@777 | 754 | // Consider this like a collection pause for the purposes of allocation |
ysr@777 | 755 | // since last pause. |
ysr@777 | 756 | double end_sec = os::elapsedTime(); |
brutisso@3923 | 757 | double full_gc_time_sec = end_sec - _full_collection_start_sec; |
ysr@777 | 758 | double full_gc_time_ms = full_gc_time_sec * 1000.0; |
ysr@777 | 759 | |
brutisso@3812 | 760 | _trace_gen1_time_data.record_full_collection(full_gc_time_ms); |
ysr@777 | 761 | |
tonyp@1030 | 762 | update_recent_gc_times(end_sec, full_gc_time_ms); |
ysr@777 | 763 | |
ysr@777 | 764 | _g1->clear_full_collection(); |
ysr@777 | 765 | |
tonyp@3337 | 766 | // "Nuke" the heuristics that control the young/mixed GC |
tonyp@3337 | 767 | // transitions and make sure we start with young GCs after the Full GC. |
tonyp@3337 | 768 | set_gcs_are_young(true); |
tonyp@3337 | 769 | _last_young_gc = false; |
tonyp@1794 | 770 | clear_initiate_conc_mark_if_possible(); |
tonyp@1794 | 771 | clear_during_initial_mark_pause(); |
ysr@777 | 772 | _in_marking_window = false; |
ysr@777 | 773 | _in_marking_window_im = false; |
ysr@777 | 774 | |
ysr@777 | 775 | _short_lived_surv_rate_group->start_adding_regions(); |
ysr@777 | 776 | // also call this on any additional surv rate groups |
ysr@777 | 777 | |
apetrusenko@980 | 778 | record_survivor_regions(0, NULL, NULL); |
apetrusenko@980 | 779 | |
ysr@777 | 780 | _free_regions_at_end_of_collection = _g1->free_regions(); |
apetrusenko@980 | 781 | // Reset survivors SurvRateGroup. |
apetrusenko@980 | 782 | _survivor_surv_rate_group->reset(); |
tonyp@3119 | 783 | update_young_list_target_length(); |
tonyp@3714 | 784 | _collectionSetChooser->clear(); |
tonyp@2315 | 785 | } |
ysr@777 | 786 | |
ysr@777 | 787 | void G1CollectorPolicy::record_stop_world_start() { |
ysr@777 | 788 | _stop_world_start = os::elapsedTime(); |
ysr@777 | 789 | } |
ysr@777 | 790 | |
ysr@777 | 791 | void G1CollectorPolicy::record_collection_pause_start(double start_time_sec, |
ysr@777 | 792 | size_t start_used) { |
tonyp@3464 | 793 | // We only need to do this here as the policy will only be applied |
tonyp@3464 | 794 | // to the GC we're about to start. so, no point is calculating this |
tonyp@3464 | 795 | // every time we calculate / recalculate the target young length. |
tonyp@3464 | 796 | update_survivors_policy(); |
tonyp@3119 | 797 | |
tonyp@2315 | 798 | assert(_g1->used() == _g1->recalculate_used(), |
tonyp@2315 | 799 | err_msg("sanity, used: "SIZE_FORMAT" recalculate_used: "SIZE_FORMAT, |
tonyp@2315 | 800 | _g1->used(), _g1->recalculate_used())); |
ysr@777 | 801 | |
ysr@777 | 802 | double s_w_t_ms = (start_time_sec - _stop_world_start) * 1000.0; |
brutisso@3812 | 803 | _trace_gen0_time_data.record_start_collection(s_w_t_ms); |
ysr@777 | 804 | _stop_world_start = 0.0; |
ysr@777 | 805 | |
brutisso@4015 | 806 | phase_times()->record_cur_collection_start_sec(start_time_sec); |
ysr@777 | 807 | _cur_collection_pause_used_at_start_bytes = start_used; |
ysr@777 | 808 | _cur_collection_pause_used_regions_at_start = _g1->used_regions(); |
ysr@777 | 809 | _pending_cards = _g1->pending_card_num(); |
ysr@777 | 810 | |
johnc@3998 | 811 | _collection_set_bytes_used_before = 0; |
tonyp@3028 | 812 | _bytes_copied_during_gc = 0; |
ysr@777 | 813 | |
tonyp@2961 | 814 | YoungList* young_list = _g1->young_list(); |
tonyp@2961 | 815 | _eden_bytes_before_gc = young_list->eden_used_bytes(); |
tonyp@2961 | 816 | _survivor_bytes_before_gc = young_list->survivor_used_bytes(); |
tonyp@2961 | 817 | _capacity_before_gc = _g1->capacity(); |
tonyp@2961 | 818 | |
tonyp@3337 | 819 | _last_gc_was_young = false; |
ysr@777 | 820 | |
ysr@777 | 821 | // do that for any other surv rate groups |
ysr@777 | 822 | _short_lived_surv_rate_group->stop_adding_regions(); |
tonyp@1717 | 823 | _survivors_age_table.clear(); |
apetrusenko@980 | 824 | |
ysr@777 | 825 | assert( verify_young_ages(), "region age verification" ); |
ysr@777 | 826 | } |
ysr@777 | 827 | |
brutisso@3065 | 828 | void G1CollectorPolicy::record_concurrent_mark_init_end(double |
ysr@777 | 829 | mark_init_elapsed_time_ms) { |
ysr@777 | 830 | _during_marking = true; |
tonyp@1794 | 831 | assert(!initiate_conc_mark_if_possible(), "we should have cleared it by now"); |
tonyp@1794 | 832 | clear_during_initial_mark_pause(); |
ysr@777 | 833 | _cur_mark_stop_world_time_ms = mark_init_elapsed_time_ms; |
ysr@777 | 834 | } |
ysr@777 | 835 | |
ysr@777 | 836 | void G1CollectorPolicy::record_concurrent_mark_remark_start() { |
ysr@777 | 837 | _mark_remark_start_sec = os::elapsedTime(); |
ysr@777 | 838 | _during_marking = false; |
ysr@777 | 839 | } |
ysr@777 | 840 | |
ysr@777 | 841 | void G1CollectorPolicy::record_concurrent_mark_remark_end() { |
ysr@777 | 842 | double end_time_sec = os::elapsedTime(); |
ysr@777 | 843 | double elapsed_time_ms = (end_time_sec - _mark_remark_start_sec)*1000.0; |
ysr@777 | 844 | _concurrent_mark_remark_times_ms->add(elapsed_time_ms); |
ysr@777 | 845 | _cur_mark_stop_world_time_ms += elapsed_time_ms; |
ysr@777 | 846 | _prev_collection_pause_end_ms += elapsed_time_ms; |
ysr@777 | 847 | |
ysr@777 | 848 | _mmu_tracker->add_pause(_mark_remark_start_sec, end_time_sec, true); |
ysr@777 | 849 | } |
ysr@777 | 850 | |
ysr@777 | 851 | void G1CollectorPolicy::record_concurrent_mark_cleanup_start() { |
ysr@777 | 852 | _mark_cleanup_start_sec = os::elapsedTime(); |
ysr@777 | 853 | } |
ysr@777 | 854 | |
tonyp@3209 | 855 | void G1CollectorPolicy::record_concurrent_mark_cleanup_completed() { |
tonyp@3337 | 856 | _last_young_gc = true; |
brutisso@3065 | 857 | _in_marking_window = false; |
ysr@777 | 858 | } |
ysr@777 | 859 | |
ysr@777 | 860 | void G1CollectorPolicy::record_concurrent_pause() { |
ysr@777 | 861 | if (_stop_world_start > 0.0) { |
ysr@777 | 862 | double yield_ms = (os::elapsedTime() - _stop_world_start) * 1000.0; |
brutisso@3812 | 863 | _trace_gen0_time_data.record_yield_time(yield_ms); |
ysr@777 | 864 | } |
ysr@777 | 865 | } |
ysr@777 | 866 | |
brutisso@3461 | 867 | bool G1CollectorPolicy::need_to_start_conc_mark(const char* source, size_t alloc_word_size) { |
brutisso@3461 | 868 | if (_g1->concurrent_mark()->cmThread()->during_cycle()) { |
brutisso@3456 | 869 | return false; |
brutisso@3456 | 870 | } |
brutisso@3456 | 871 | |
brutisso@3456 | 872 | size_t marking_initiating_used_threshold = |
brutisso@3456 | 873 | (_g1->capacity() / 100) * InitiatingHeapOccupancyPercent; |
brutisso@3456 | 874 | size_t cur_used_bytes = _g1->non_young_capacity_bytes(); |
brutisso@3461 | 875 | size_t alloc_byte_size = alloc_word_size * HeapWordSize; |
brutisso@3461 | 876 | |
brutisso@3461 | 877 | if ((cur_used_bytes + alloc_byte_size) > marking_initiating_used_threshold) { |
brutisso@3456 | 878 | if (gcs_are_young()) { |
brutisso@3461 | 879 | ergo_verbose5(ErgoConcCycles, |
brutisso@3456 | 880 | "request concurrent cycle initiation", |
brutisso@3456 | 881 | ergo_format_reason("occupancy higher than threshold") |
brutisso@3456 | 882 | ergo_format_byte("occupancy") |
brutisso@3461 | 883 | ergo_format_byte("allocation request") |
brutisso@3456 | 884 | ergo_format_byte_perc("threshold") |
brutisso@3456 | 885 | ergo_format_str("source"), |
brutisso@3456 | 886 | cur_used_bytes, |
brutisso@3461 | 887 | alloc_byte_size, |
brutisso@3456 | 888 | marking_initiating_used_threshold, |
brutisso@3456 | 889 | (double) InitiatingHeapOccupancyPercent, |
brutisso@3456 | 890 | source); |
brutisso@3456 | 891 | return true; |
brutisso@3456 | 892 | } else { |
brutisso@3461 | 893 | ergo_verbose5(ErgoConcCycles, |
brutisso@3456 | 894 | "do not request concurrent cycle initiation", |
brutisso@3456 | 895 | ergo_format_reason("still doing mixed collections") |
brutisso@3456 | 896 | ergo_format_byte("occupancy") |
brutisso@3461 | 897 | ergo_format_byte("allocation request") |
brutisso@3456 | 898 | ergo_format_byte_perc("threshold") |
brutisso@3456 | 899 | ergo_format_str("source"), |
brutisso@3456 | 900 | cur_used_bytes, |
brutisso@3461 | 901 | alloc_byte_size, |
brutisso@3456 | 902 | marking_initiating_used_threshold, |
brutisso@3456 | 903 | (double) InitiatingHeapOccupancyPercent, |
brutisso@3456 | 904 | source); |
brutisso@3456 | 905 | } |
brutisso@3456 | 906 | } |
brutisso@3456 | 907 | |
brutisso@3456 | 908 | return false; |
brutisso@3456 | 909 | } |
brutisso@3456 | 910 | |
ysr@777 | 911 | // Anything below that is considered to be zero |
ysr@777 | 912 | #define MIN_TIMER_GRANULARITY 0.0000001 |
ysr@777 | 913 | |
brutisso@3923 | 914 | void G1CollectorPolicy::record_collection_pause_end(double pause_time_ms) { |
ysr@777 | 915 | double end_time_sec = os::elapsedTime(); |
tonyp@3289 | 916 | assert(_cur_collection_pause_used_regions_at_start >= cset_region_length(), |
tonyp@3289 | 917 | "otherwise, the subtraction below does not make sense"); |
ysr@777 | 918 | size_t rs_size = |
tonyp@3289 | 919 | _cur_collection_pause_used_regions_at_start - cset_region_length(); |
ysr@777 | 920 | size_t cur_used_bytes = _g1->used(); |
ysr@777 | 921 | assert(cur_used_bytes == _g1->recalculate_used(), "It should!"); |
ysr@777 | 922 | bool last_pause_included_initial_mark = false; |
tonyp@2062 | 923 | bool update_stats = !_g1->evacuation_failed(); |
ysr@777 | 924 | |
ysr@777 | 925 | #ifndef PRODUCT |
ysr@777 | 926 | if (G1YoungSurvRateVerbose) { |
ysr@777 | 927 | gclog_or_tty->print_cr(""); |
ysr@777 | 928 | _short_lived_surv_rate_group->print(); |
ysr@777 | 929 | // do that for any other surv rate groups too |
ysr@777 | 930 | } |
ysr@777 | 931 | #endif // PRODUCT |
ysr@777 | 932 | |
brutisso@3065 | 933 | last_pause_included_initial_mark = during_initial_mark_pause(); |
brutisso@3456 | 934 | if (last_pause_included_initial_mark) { |
brutisso@3065 | 935 | record_concurrent_mark_init_end(0.0); |
tonyp@3539 | 936 | } else if (!_last_young_gc && need_to_start_conc_mark("end of GC")) { |
brutisso@3456 | 937 | // Note: this might have already been set, if during the last |
brutisso@3456 | 938 | // pause we decided to start a cycle but at the beginning of |
brutisso@3456 | 939 | // this pause we decided to postpone it. That's OK. |
brutisso@3456 | 940 | set_initiate_conc_mark_if_possible(); |
brutisso@3456 | 941 | } |
brutisso@3065 | 942 | |
brutisso@3923 | 943 | _mmu_tracker->add_pause(end_time_sec - pause_time_ms/1000.0, |
ysr@777 | 944 | end_time_sec, false); |
ysr@777 | 945 | |
ysr@777 | 946 | size_t freed_bytes = |
ysr@777 | 947 | _cur_collection_pause_used_at_start_bytes - cur_used_bytes; |
ysr@777 | 948 | size_t surviving_bytes = _collection_set_bytes_used_before - freed_bytes; |
johnc@1829 | 949 | |
ysr@777 | 950 | double survival_fraction = |
ysr@777 | 951 | (double)surviving_bytes/ |
ysr@777 | 952 | (double)_collection_set_bytes_used_before; |
ysr@777 | 953 | |
tonyp@1030 | 954 | if (update_stats) { |
brutisso@3923 | 955 | _trace_gen0_time_data.record_end_collection(pause_time_ms, phase_times()); |
ysr@777 | 956 | // this is where we update the allocation rate of the application |
ysr@777 | 957 | double app_time_ms = |
brutisso@4015 | 958 | (phase_times()->cur_collection_start_sec() * 1000.0 - _prev_collection_pause_end_ms); |
ysr@777 | 959 | if (app_time_ms < MIN_TIMER_GRANULARITY) { |
ysr@777 | 960 | // This usually happens due to the timer not having the required |
ysr@777 | 961 | // granularity. Some Linuxes are the usual culprits. |
ysr@777 | 962 | // We'll just set it to something (arbitrarily) small. |
ysr@777 | 963 | app_time_ms = 1.0; |
ysr@777 | 964 | } |
tonyp@3289 | 965 | // We maintain the invariant that all objects allocated by mutator |
tonyp@3289 | 966 | // threads will be allocated out of eden regions. So, we can use |
tonyp@3289 | 967 | // the eden region number allocated since the previous GC to |
tonyp@3289 | 968 | // calculate the application's allocate rate. The only exception |
tonyp@3289 | 969 | // to that is humongous objects that are allocated separately. But |
tonyp@3289 | 970 | // given that humongous object allocations do not really affect |
tonyp@3289 | 971 | // either the pause's duration nor when the next pause will take |
tonyp@3289 | 972 | // place we can safely ignore them here. |
tonyp@3713 | 973 | uint regions_allocated = eden_cset_region_length(); |
ysr@777 | 974 | double alloc_rate_ms = (double) regions_allocated / app_time_ms; |
ysr@777 | 975 | _alloc_rate_ms_seq->add(alloc_rate_ms); |
ysr@777 | 976 | |
ysr@777 | 977 | double interval_ms = |
ysr@777 | 978 | (end_time_sec - _recent_prev_end_times_for_all_gcs_sec->oldest()) * 1000.0; |
brutisso@3923 | 979 | update_recent_gc_times(end_time_sec, pause_time_ms); |
ysr@777 | 980 | _recent_avg_pause_time_ratio = _recent_gc_times_ms->sum()/interval_ms; |
ysr@1521 | 981 | if (recent_avg_pause_time_ratio() < 0.0 || |
ysr@1521 | 982 | (recent_avg_pause_time_ratio() - 1.0 > 0.0)) { |
ysr@1521 | 983 | #ifndef PRODUCT |
ysr@1521 | 984 | // Dump info to allow post-facto debugging |
ysr@1521 | 985 | gclog_or_tty->print_cr("recent_avg_pause_time_ratio() out of bounds"); |
ysr@1521 | 986 | gclog_or_tty->print_cr("-------------------------------------------"); |
ysr@1521 | 987 | gclog_or_tty->print_cr("Recent GC Times (ms):"); |
ysr@1521 | 988 | _recent_gc_times_ms->dump(); |
ysr@1521 | 989 | gclog_or_tty->print_cr("(End Time=%3.3f) Recent GC End Times (s):", end_time_sec); |
ysr@1521 | 990 | _recent_prev_end_times_for_all_gcs_sec->dump(); |
ysr@1521 | 991 | gclog_or_tty->print_cr("GC = %3.3f, Interval = %3.3f, Ratio = %3.3f", |
ysr@1521 | 992 | _recent_gc_times_ms->sum(), interval_ms, recent_avg_pause_time_ratio()); |
ysr@1522 | 993 | // In debug mode, terminate the JVM if the user wants to debug at this point. |
ysr@1522 | 994 | assert(!G1FailOnFPError, "Debugging data for CR 6898948 has been dumped above"); |
ysr@1522 | 995 | #endif // !PRODUCT |
ysr@1522 | 996 | // Clip ratio between 0.0 and 1.0, and continue. This will be fixed in |
ysr@1522 | 997 | // CR 6902692 by redoing the manner in which the ratio is incrementally computed. |
ysr@1521 | 998 | if (_recent_avg_pause_time_ratio < 0.0) { |
ysr@1521 | 999 | _recent_avg_pause_time_ratio = 0.0; |
ysr@1521 | 1000 | } else { |
ysr@1521 | 1001 | assert(_recent_avg_pause_time_ratio - 1.0 > 0.0, "Ctl-point invariant"); |
ysr@1521 | 1002 | _recent_avg_pause_time_ratio = 1.0; |
ysr@1521 | 1003 | } |
ysr@1521 | 1004 | } |
ysr@777 | 1005 | } |
ysr@777 | 1006 | bool new_in_marking_window = _in_marking_window; |
ysr@777 | 1007 | bool new_in_marking_window_im = false; |
tonyp@1794 | 1008 | if (during_initial_mark_pause()) { |
ysr@777 | 1009 | new_in_marking_window = true; |
ysr@777 | 1010 | new_in_marking_window_im = true; |
ysr@777 | 1011 | } |
ysr@777 | 1012 | |
tonyp@3337 | 1013 | if (_last_young_gc) { |
tonyp@3539 | 1014 | // This is supposed to to be the "last young GC" before we start |
tonyp@3539 | 1015 | // doing mixed GCs. Here we decide whether to start mixed GCs or not. |
tonyp@3539 | 1016 | |
johnc@3178 | 1017 | if (!last_pause_included_initial_mark) { |
tonyp@3539 | 1018 | if (next_gc_should_be_mixed("start mixed GCs", |
tonyp@3539 | 1019 | "do not start mixed GCs")) { |
tonyp@3539 | 1020 | set_gcs_are_young(false); |
tonyp@3539 | 1021 | } |
johnc@3178 | 1022 | } else { |
tonyp@3337 | 1023 | ergo_verbose0(ErgoMixedGCs, |
tonyp@3337 | 1024 | "do not start mixed GCs", |
johnc@3178 | 1025 | ergo_format_reason("concurrent cycle is about to start")); |
johnc@3178 | 1026 | } |
tonyp@3337 | 1027 | _last_young_gc = false; |
brutisso@3065 | 1028 | } |
brutisso@3065 | 1029 | |
tonyp@3337 | 1030 | if (!_last_gc_was_young) { |
tonyp@3539 | 1031 | // This is a mixed GC. Here we decide whether to continue doing |
tonyp@3539 | 1032 | // mixed GCs or not. |
tonyp@3539 | 1033 | |
tonyp@3539 | 1034 | if (!next_gc_should_be_mixed("continue mixed GCs", |
tonyp@3539 | 1035 | "do not continue mixed GCs")) { |
tonyp@3337 | 1036 | set_gcs_are_young(true); |
ysr@777 | 1037 | } |
brutisso@3065 | 1038 | } |
tonyp@3337 | 1039 | |
ysr@777 | 1040 | _short_lived_surv_rate_group->start_adding_regions(); |
ysr@777 | 1041 | // do that for any other surv rate groupsx |
ysr@777 | 1042 | |
apetrusenko@1112 | 1043 | if (update_stats) { |
ysr@777 | 1044 | double cost_per_card_ms = 0.0; |
ysr@777 | 1045 | if (_pending_cards > 0) { |
brutisso@4015 | 1046 | cost_per_card_ms = phase_times()->average_last_update_rs_time() / (double) _pending_cards; |
ysr@777 | 1047 | _cost_per_card_ms_seq->add(cost_per_card_ms); |
ysr@777 | 1048 | } |
ysr@777 | 1049 | |
ysr@777 | 1050 | size_t cards_scanned = _g1->cards_scanned(); |
ysr@777 | 1051 | |
ysr@777 | 1052 | double cost_per_entry_ms = 0.0; |
ysr@777 | 1053 | if (cards_scanned > 10) { |
brutisso@4015 | 1054 | cost_per_entry_ms = phase_times()->average_last_scan_rs_time() / (double) cards_scanned; |
tonyp@3337 | 1055 | if (_last_gc_was_young) { |
ysr@777 | 1056 | _cost_per_entry_ms_seq->add(cost_per_entry_ms); |
tonyp@3337 | 1057 | } else { |
tonyp@3337 | 1058 | _mixed_cost_per_entry_ms_seq->add(cost_per_entry_ms); |
tonyp@3337 | 1059 | } |
ysr@777 | 1060 | } |
ysr@777 | 1061 | |
ysr@777 | 1062 | if (_max_rs_lengths > 0) { |
ysr@777 | 1063 | double cards_per_entry_ratio = |
ysr@777 | 1064 | (double) cards_scanned / (double) _max_rs_lengths; |
tonyp@3337 | 1065 | if (_last_gc_was_young) { |
tonyp@3337 | 1066 | _young_cards_per_entry_ratio_seq->add(cards_per_entry_ratio); |
tonyp@3337 | 1067 | } else { |
tonyp@3337 | 1068 | _mixed_cards_per_entry_ratio_seq->add(cards_per_entry_ratio); |
tonyp@3337 | 1069 | } |
ysr@777 | 1070 | } |
ysr@777 | 1071 | |
tonyp@3356 | 1072 | // This is defensive. For a while _max_rs_lengths could get |
tonyp@3356 | 1073 | // smaller than _recorded_rs_lengths which was causing |
tonyp@3356 | 1074 | // rs_length_diff to get very large and mess up the RSet length |
tonyp@3356 | 1075 | // predictions. The reason was unsafe concurrent updates to the |
tonyp@3356 | 1076 | // _inc_cset_recorded_rs_lengths field which the code below guards |
tonyp@3356 | 1077 | // against (see CR 7118202). This bug has now been fixed (see CR |
tonyp@3356 | 1078 | // 7119027). However, I'm still worried that |
tonyp@3356 | 1079 | // _inc_cset_recorded_rs_lengths might still end up somewhat |
tonyp@3356 | 1080 | // inaccurate. The concurrent refinement thread calculates an |
tonyp@3356 | 1081 | // RSet's length concurrently with other CR threads updating it |
tonyp@3356 | 1082 | // which might cause it to calculate the length incorrectly (if, |
tonyp@3356 | 1083 | // say, it's in mid-coarsening). So I'll leave in the defensive |
tonyp@3356 | 1084 | // conditional below just in case. |
tonyp@3326 | 1085 | size_t rs_length_diff = 0; |
tonyp@3326 | 1086 | if (_max_rs_lengths > _recorded_rs_lengths) { |
tonyp@3326 | 1087 | rs_length_diff = _max_rs_lengths - _recorded_rs_lengths; |
tonyp@3326 | 1088 | } |
tonyp@3326 | 1089 | _rs_length_diff_seq->add((double) rs_length_diff); |
ysr@777 | 1090 | |
ysr@777 | 1091 | size_t copied_bytes = surviving_bytes; |
ysr@777 | 1092 | double cost_per_byte_ms = 0.0; |
ysr@777 | 1093 | if (copied_bytes > 0) { |
brutisso@4015 | 1094 | cost_per_byte_ms = phase_times()->average_last_obj_copy_time() / (double) copied_bytes; |
tonyp@3337 | 1095 | if (_in_marking_window) { |
ysr@777 | 1096 | _cost_per_byte_ms_during_cm_seq->add(cost_per_byte_ms); |
tonyp@3337 | 1097 | } else { |
ysr@777 | 1098 | _cost_per_byte_ms_seq->add(cost_per_byte_ms); |
tonyp@3337 | 1099 | } |
ysr@777 | 1100 | } |
ysr@777 | 1101 | |
ysr@777 | 1102 | double all_other_time_ms = pause_time_ms - |
brutisso@4015 | 1103 | (phase_times()->average_last_update_rs_time() + phase_times()->average_last_scan_rs_time() |
brutisso@4015 | 1104 | + phase_times()->average_last_obj_copy_time() + phase_times()->average_last_termination_time()); |
ysr@777 | 1105 | |
ysr@777 | 1106 | double young_other_time_ms = 0.0; |
tonyp@3289 | 1107 | if (young_cset_region_length() > 0) { |
ysr@777 | 1108 | young_other_time_ms = |
brutisso@4015 | 1109 | phase_times()->young_cset_choice_time_ms() + |
brutisso@4015 | 1110 | phase_times()->young_free_cset_time_ms(); |
ysr@777 | 1111 | _young_other_cost_per_region_ms_seq->add(young_other_time_ms / |
tonyp@3289 | 1112 | (double) young_cset_region_length()); |
ysr@777 | 1113 | } |
ysr@777 | 1114 | double non_young_other_time_ms = 0.0; |
tonyp@3289 | 1115 | if (old_cset_region_length() > 0) { |
ysr@777 | 1116 | non_young_other_time_ms = |
brutisso@4015 | 1117 | phase_times()->non_young_cset_choice_time_ms() + |
brutisso@4015 | 1118 | phase_times()->non_young_free_cset_time_ms(); |
ysr@777 | 1119 | |
ysr@777 | 1120 | _non_young_other_cost_per_region_ms_seq->add(non_young_other_time_ms / |
tonyp@3289 | 1121 | (double) old_cset_region_length()); |
ysr@777 | 1122 | } |
ysr@777 | 1123 | |
ysr@777 | 1124 | double constant_other_time_ms = all_other_time_ms - |
ysr@777 | 1125 | (young_other_time_ms + non_young_other_time_ms); |
ysr@777 | 1126 | _constant_other_time_ms_seq->add(constant_other_time_ms); |
ysr@777 | 1127 | |
ysr@777 | 1128 | double survival_ratio = 0.0; |
johnc@3998 | 1129 | if (_collection_set_bytes_used_before > 0) { |
tonyp@3028 | 1130 | survival_ratio = (double) _bytes_copied_during_gc / |
johnc@3998 | 1131 | (double) _collection_set_bytes_used_before; |
ysr@777 | 1132 | } |
ysr@777 | 1133 | |
ysr@777 | 1134 | _pending_cards_seq->add((double) _pending_cards); |
ysr@777 | 1135 | _rs_lengths_seq->add((double) _max_rs_lengths); |
ysr@777 | 1136 | } |
ysr@777 | 1137 | |
ysr@777 | 1138 | _in_marking_window = new_in_marking_window; |
ysr@777 | 1139 | _in_marking_window_im = new_in_marking_window_im; |
ysr@777 | 1140 | _free_regions_at_end_of_collection = _g1->free_regions(); |
tonyp@3119 | 1141 | update_young_list_target_length(); |
ysr@777 | 1142 | |
iveresov@1546 | 1143 | // Note that _mmu_tracker->max_gc_time() returns the time in seconds. |
tonyp@1717 | 1144 | double update_rs_time_goal_ms = _mmu_tracker->max_gc_time() * MILLIUNITS * G1RSetUpdatingPauseTimePercent / 100.0; |
brutisso@4015 | 1145 | adjust_concurrent_refinement(phase_times()->average_last_update_rs_time(), |
brutisso@4015 | 1146 | phase_times()->sum_last_update_rs_processed_buffers(), update_rs_time_goal_ms); |
tonyp@3209 | 1147 | |
tonyp@3714 | 1148 | _collectionSetChooser->verify(); |
ysr@777 | 1149 | } |
ysr@777 | 1150 | |
brutisso@3762 | 1151 | #define EXT_SIZE_FORMAT "%.1f%s" |
tonyp@2961 | 1152 | #define EXT_SIZE_PARAMS(bytes) \ |
brutisso@3762 | 1153 | byte_size_in_proper_unit((double)(bytes)), \ |
tonyp@2961 | 1154 | proper_unit_for_byte_size((bytes)) |
tonyp@2961 | 1155 | |
tonyp@2961 | 1156 | void G1CollectorPolicy::print_heap_transition() { |
brutisso@4015 | 1157 | _g1->print_size_transition(gclog_or_tty, |
brutisso@4015 | 1158 | _cur_collection_pause_used_at_start_bytes, _g1->used(), _g1->capacity()); |
brutisso@4015 | 1159 | } |
brutisso@4015 | 1160 | |
brutisso@4015 | 1161 | void G1CollectorPolicy::print_detailed_heap_transition() { |
tonyp@2961 | 1162 | YoungList* young_list = _g1->young_list(); |
tonyp@2961 | 1163 | size_t eden_bytes = young_list->eden_used_bytes(); |
tonyp@2961 | 1164 | size_t survivor_bytes = young_list->survivor_used_bytes(); |
tonyp@2961 | 1165 | size_t used_before_gc = _cur_collection_pause_used_at_start_bytes; |
tonyp@2961 | 1166 | size_t used = _g1->used(); |
tonyp@2961 | 1167 | size_t capacity = _g1->capacity(); |
brutisso@3120 | 1168 | size_t eden_capacity = |
brutisso@3120 | 1169 | (_young_list_target_length * HeapRegion::GrainBytes) - survivor_bytes; |
tonyp@2961 | 1170 | |
tonyp@2961 | 1171 | gclog_or_tty->print_cr( |
brutisso@3120 | 1172 | " [Eden: "EXT_SIZE_FORMAT"("EXT_SIZE_FORMAT")->"EXT_SIZE_FORMAT"("EXT_SIZE_FORMAT") " |
brutisso@3120 | 1173 | "Survivors: "EXT_SIZE_FORMAT"->"EXT_SIZE_FORMAT" " |
brutisso@3120 | 1174 | "Heap: "EXT_SIZE_FORMAT"("EXT_SIZE_FORMAT")->" |
brutisso@3120 | 1175 | EXT_SIZE_FORMAT"("EXT_SIZE_FORMAT")]", |
brutisso@3120 | 1176 | EXT_SIZE_PARAMS(_eden_bytes_before_gc), |
brutisso@3120 | 1177 | EXT_SIZE_PARAMS(_prev_eden_capacity), |
brutisso@3120 | 1178 | EXT_SIZE_PARAMS(eden_bytes), |
brutisso@3120 | 1179 | EXT_SIZE_PARAMS(eden_capacity), |
brutisso@3120 | 1180 | EXT_SIZE_PARAMS(_survivor_bytes_before_gc), |
brutisso@3120 | 1181 | EXT_SIZE_PARAMS(survivor_bytes), |
brutisso@3120 | 1182 | EXT_SIZE_PARAMS(used_before_gc), |
brutisso@3120 | 1183 | EXT_SIZE_PARAMS(_capacity_before_gc), |
brutisso@3120 | 1184 | EXT_SIZE_PARAMS(used), |
brutisso@3120 | 1185 | EXT_SIZE_PARAMS(capacity)); |
brutisso@3120 | 1186 | |
brutisso@3120 | 1187 | _prev_eden_capacity = eden_capacity; |
tonyp@2961 | 1188 | } |
tonyp@2961 | 1189 | |
iveresov@1546 | 1190 | void G1CollectorPolicy::adjust_concurrent_refinement(double update_rs_time, |
iveresov@1546 | 1191 | double update_rs_processed_buffers, |
iveresov@1546 | 1192 | double goal_ms) { |
iveresov@1546 | 1193 | DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set(); |
iveresov@1546 | 1194 | ConcurrentG1Refine *cg1r = G1CollectedHeap::heap()->concurrent_g1_refine(); |
iveresov@1546 | 1195 | |
tonyp@1717 | 1196 | if (G1UseAdaptiveConcRefinement) { |
iveresov@1546 | 1197 | const int k_gy = 3, k_gr = 6; |
iveresov@1546 | 1198 | const double inc_k = 1.1, dec_k = 0.9; |
iveresov@1546 | 1199 | |
iveresov@1546 | 1200 | int g = cg1r->green_zone(); |
iveresov@1546 | 1201 | if (update_rs_time > goal_ms) { |
iveresov@1546 | 1202 | g = (int)(g * dec_k); // Can become 0, that's OK. That would mean a mutator-only processing. |
iveresov@1546 | 1203 | } else { |
iveresov@1546 | 1204 | if (update_rs_time < goal_ms && update_rs_processed_buffers > g) { |
iveresov@1546 | 1205 | g = (int)MAX2(g * inc_k, g + 1.0); |
iveresov@1546 | 1206 | } |
iveresov@1546 | 1207 | } |
iveresov@1546 | 1208 | // Change the refinement threads params |
iveresov@1546 | 1209 | cg1r->set_green_zone(g); |
iveresov@1546 | 1210 | cg1r->set_yellow_zone(g * k_gy); |
iveresov@1546 | 1211 | cg1r->set_red_zone(g * k_gr); |
iveresov@1546 | 1212 | cg1r->reinitialize_threads(); |
iveresov@1546 | 1213 | |
iveresov@1546 | 1214 | int processing_threshold_delta = MAX2((int)(cg1r->green_zone() * sigma()), 1); |
iveresov@1546 | 1215 | int processing_threshold = MIN2(cg1r->green_zone() + processing_threshold_delta, |
iveresov@1546 | 1216 | cg1r->yellow_zone()); |
iveresov@1546 | 1217 | // Change the barrier params |
iveresov@1546 | 1218 | dcqs.set_process_completed_threshold(processing_threshold); |
iveresov@1546 | 1219 | dcqs.set_max_completed_queue(cg1r->red_zone()); |
iveresov@1546 | 1220 | } |
iveresov@1546 | 1221 | |
iveresov@1546 | 1222 | int curr_queue_size = dcqs.completed_buffers_num(); |
iveresov@1546 | 1223 | if (curr_queue_size >= cg1r->yellow_zone()) { |
iveresov@1546 | 1224 | dcqs.set_completed_queue_padding(curr_queue_size); |
iveresov@1546 | 1225 | } else { |
iveresov@1546 | 1226 | dcqs.set_completed_queue_padding(0); |
iveresov@1546 | 1227 | } |
iveresov@1546 | 1228 | dcqs.notify_if_necessary(); |
iveresov@1546 | 1229 | } |
iveresov@1546 | 1230 | |
ysr@777 | 1231 | double |
johnc@3998 | 1232 | G1CollectorPolicy::predict_base_elapsed_time_ms(size_t pending_cards, |
johnc@3998 | 1233 | size_t scanned_cards) { |
johnc@3998 | 1234 | return |
johnc@3998 | 1235 | predict_rs_update_time_ms(pending_cards) + |
johnc@3998 | 1236 | predict_rs_scan_time_ms(scanned_cards) + |
johnc@3998 | 1237 | predict_constant_other_time_ms(); |
johnc@3998 | 1238 | } |
johnc@3998 | 1239 | |
johnc@3998 | 1240 | double |
ysr@777 | 1241 | G1CollectorPolicy::predict_base_elapsed_time_ms(size_t pending_cards) { |
ysr@777 | 1242 | size_t rs_length = predict_rs_length_diff(); |
ysr@777 | 1243 | size_t card_num; |
tonyp@3337 | 1244 | if (gcs_are_young()) { |
ysr@777 | 1245 | card_num = predict_young_card_num(rs_length); |
tonyp@3337 | 1246 | } else { |
ysr@777 | 1247 | card_num = predict_non_young_card_num(rs_length); |
tonyp@3337 | 1248 | } |
ysr@777 | 1249 | return predict_base_elapsed_time_ms(pending_cards, card_num); |
ysr@777 | 1250 | } |
ysr@777 | 1251 | |
tonyp@3713 | 1252 | size_t G1CollectorPolicy::predict_bytes_to_copy(HeapRegion* hr) { |
ysr@777 | 1253 | size_t bytes_to_copy; |
ysr@777 | 1254 | if (hr->is_marked()) |
ysr@777 | 1255 | bytes_to_copy = hr->max_live_bytes(); |
ysr@777 | 1256 | else { |
tonyp@3539 | 1257 | assert(hr->is_young() && hr->age_in_surv_rate_group() != -1, "invariant"); |
ysr@777 | 1258 | int age = hr->age_in_surv_rate_group(); |
apetrusenko@980 | 1259 | double yg_surv_rate = predict_yg_surv_rate(age, hr->surv_rate_group()); |
ysr@777 | 1260 | bytes_to_copy = (size_t) ((double) hr->used() * yg_surv_rate); |
ysr@777 | 1261 | } |
ysr@777 | 1262 | return bytes_to_copy; |
ysr@777 | 1263 | } |
ysr@777 | 1264 | |
johnc@3998 | 1265 | double |
johnc@3998 | 1266 | G1CollectorPolicy::predict_region_elapsed_time_ms(HeapRegion* hr, |
johnc@3998 | 1267 | bool for_young_gc) { |
johnc@3998 | 1268 | size_t rs_length = hr->rem_set()->occupied(); |
johnc@3998 | 1269 | size_t card_num; |
johnc@3998 | 1270 | |
johnc@3998 | 1271 | // Predicting the number of cards is based on which type of GC |
johnc@3998 | 1272 | // we're predicting for. |
johnc@3998 | 1273 | if (for_young_gc) { |
johnc@3998 | 1274 | card_num = predict_young_card_num(rs_length); |
johnc@3998 | 1275 | } else { |
johnc@3998 | 1276 | card_num = predict_non_young_card_num(rs_length); |
johnc@3998 | 1277 | } |
johnc@3998 | 1278 | size_t bytes_to_copy = predict_bytes_to_copy(hr); |
johnc@3998 | 1279 | |
johnc@3998 | 1280 | double region_elapsed_time_ms = |
johnc@3998 | 1281 | predict_rs_scan_time_ms(card_num) + |
johnc@3998 | 1282 | predict_object_copy_time_ms(bytes_to_copy); |
johnc@3998 | 1283 | |
johnc@3998 | 1284 | // The prediction of the "other" time for this region is based |
johnc@3998 | 1285 | // upon the region type and NOT the GC type. |
johnc@3998 | 1286 | if (hr->is_young()) { |
johnc@3998 | 1287 | region_elapsed_time_ms += predict_young_other_time_ms(1); |
johnc@3998 | 1288 | } else { |
johnc@3998 | 1289 | region_elapsed_time_ms += predict_non_young_other_time_ms(1); |
johnc@3998 | 1290 | } |
johnc@3998 | 1291 | return region_elapsed_time_ms; |
johnc@3998 | 1292 | } |
johnc@3998 | 1293 | |
ysr@777 | 1294 | void |
tonyp@3713 | 1295 | G1CollectorPolicy::init_cset_region_lengths(uint eden_cset_region_length, |
tonyp@3713 | 1296 | uint survivor_cset_region_length) { |
tonyp@3289 | 1297 | _eden_cset_region_length = eden_cset_region_length; |
tonyp@3289 | 1298 | _survivor_cset_region_length = survivor_cset_region_length; |
tonyp@3289 | 1299 | _old_cset_region_length = 0; |
johnc@1829 | 1300 | } |
johnc@1829 | 1301 | |
johnc@1829 | 1302 | void G1CollectorPolicy::set_recorded_rs_lengths(size_t rs_lengths) { |
johnc@1829 | 1303 | _recorded_rs_lengths = rs_lengths; |
johnc@1829 | 1304 | } |
johnc@1829 | 1305 | |
ysr@777 | 1306 | void G1CollectorPolicy::update_recent_gc_times(double end_time_sec, |
ysr@777 | 1307 | double elapsed_ms) { |
ysr@777 | 1308 | _recent_gc_times_ms->add(elapsed_ms); |
ysr@777 | 1309 | _recent_prev_end_times_for_all_gcs_sec->add(end_time_sec); |
ysr@777 | 1310 | _prev_collection_pause_end_ms = end_time_sec * 1000.0; |
ysr@777 | 1311 | } |
ysr@777 | 1312 | |
ysr@777 | 1313 | size_t G1CollectorPolicy::expansion_amount() { |
tonyp@3114 | 1314 | double recent_gc_overhead = recent_avg_pause_time_ratio() * 100.0; |
tonyp@3114 | 1315 | double threshold = _gc_overhead_perc; |
tonyp@3114 | 1316 | if (recent_gc_overhead > threshold) { |
johnc@1186 | 1317 | // We will double the existing space, or take |
johnc@1186 | 1318 | // G1ExpandByPercentOfAvailable % of the available expansion |
johnc@1186 | 1319 | // space, whichever is smaller, bounded below by a minimum |
johnc@1186 | 1320 | // expansion (unless that's all that's left.) |
ysr@777 | 1321 | const size_t min_expand_bytes = 1*M; |
johnc@2504 | 1322 | size_t reserved_bytes = _g1->max_capacity(); |
ysr@777 | 1323 | size_t committed_bytes = _g1->capacity(); |
ysr@777 | 1324 | size_t uncommitted_bytes = reserved_bytes - committed_bytes; |
ysr@777 | 1325 | size_t expand_bytes; |
ysr@777 | 1326 | size_t expand_bytes_via_pct = |
johnc@1186 | 1327 | uncommitted_bytes * G1ExpandByPercentOfAvailable / 100; |
ysr@777 | 1328 | expand_bytes = MIN2(expand_bytes_via_pct, committed_bytes); |
ysr@777 | 1329 | expand_bytes = MAX2(expand_bytes, min_expand_bytes); |
ysr@777 | 1330 | expand_bytes = MIN2(expand_bytes, uncommitted_bytes); |
tonyp@3114 | 1331 | |
tonyp@3114 | 1332 | ergo_verbose5(ErgoHeapSizing, |
tonyp@3114 | 1333 | "attempt heap expansion", |
tonyp@3114 | 1334 | ergo_format_reason("recent GC overhead higher than " |
tonyp@3114 | 1335 | "threshold after GC") |
tonyp@3114 | 1336 | ergo_format_perc("recent GC overhead") |
tonyp@3114 | 1337 | ergo_format_perc("threshold") |
tonyp@3114 | 1338 | ergo_format_byte("uncommitted") |
tonyp@3114 | 1339 | ergo_format_byte_perc("calculated expansion amount"), |
tonyp@3114 | 1340 | recent_gc_overhead, threshold, |
tonyp@3114 | 1341 | uncommitted_bytes, |
tonyp@3114 | 1342 | expand_bytes_via_pct, (double) G1ExpandByPercentOfAvailable); |
tonyp@3114 | 1343 | |
ysr@777 | 1344 | return expand_bytes; |
ysr@777 | 1345 | } else { |
ysr@777 | 1346 | return 0; |
ysr@777 | 1347 | } |
ysr@777 | 1348 | } |
ysr@777 | 1349 | |
ysr@777 | 1350 | void G1CollectorPolicy::print_tracing_info() const { |
brutisso@3812 | 1351 | _trace_gen0_time_data.print(); |
brutisso@3812 | 1352 | _trace_gen1_time_data.print(); |
ysr@777 | 1353 | } |
ysr@777 | 1354 | |
ysr@777 | 1355 | void G1CollectorPolicy::print_yg_surv_rate_info() const { |
ysr@777 | 1356 | #ifndef PRODUCT |
ysr@777 | 1357 | _short_lived_surv_rate_group->print_surv_rate_summary(); |
ysr@777 | 1358 | // add this call for any other surv rate groups |
ysr@777 | 1359 | #endif // PRODUCT |
ysr@777 | 1360 | } |
ysr@777 | 1361 | |
ysr@777 | 1362 | #ifndef PRODUCT |
ysr@777 | 1363 | // for debugging, bit of a hack... |
ysr@777 | 1364 | static char* |
ysr@777 | 1365 | region_num_to_mbs(int length) { |
ysr@777 | 1366 | static char buffer[64]; |
ysr@777 | 1367 | double bytes = (double) (length * HeapRegion::GrainBytes); |
ysr@777 | 1368 | double mbs = bytes / (double) (1024 * 1024); |
ysr@777 | 1369 | sprintf(buffer, "%7.2lfMB", mbs); |
ysr@777 | 1370 | return buffer; |
ysr@777 | 1371 | } |
ysr@777 | 1372 | #endif // PRODUCT |
ysr@777 | 1373 | |
tonyp@3713 | 1374 | uint G1CollectorPolicy::max_regions(int purpose) { |
ysr@777 | 1375 | switch (purpose) { |
ysr@777 | 1376 | case GCAllocForSurvived: |
apetrusenko@980 | 1377 | return _max_survivor_regions; |
ysr@777 | 1378 | case GCAllocForTenured: |
apetrusenko@980 | 1379 | return REGIONS_UNLIMITED; |
ysr@777 | 1380 | default: |
apetrusenko@980 | 1381 | ShouldNotReachHere(); |
apetrusenko@980 | 1382 | return REGIONS_UNLIMITED; |
ysr@777 | 1383 | }; |
ysr@777 | 1384 | } |
ysr@777 | 1385 | |
tonyp@3119 | 1386 | void G1CollectorPolicy::update_max_gc_locker_expansion() { |
tonyp@3713 | 1387 | uint expansion_region_num = 0; |
tonyp@2333 | 1388 | if (GCLockerEdenExpansionPercent > 0) { |
tonyp@2333 | 1389 | double perc = (double) GCLockerEdenExpansionPercent / 100.0; |
tonyp@2333 | 1390 | double expansion_region_num_d = perc * (double) _young_list_target_length; |
tonyp@2333 | 1391 | // We use ceiling so that if expansion_region_num_d is > 0.0 (but |
tonyp@2333 | 1392 | // less than 1.0) we'll get 1. |
tonyp@3713 | 1393 | expansion_region_num = (uint) ceil(expansion_region_num_d); |
tonyp@2333 | 1394 | } else { |
tonyp@2333 | 1395 | assert(expansion_region_num == 0, "sanity"); |
tonyp@2333 | 1396 | } |
tonyp@2333 | 1397 | _young_list_max_length = _young_list_target_length + expansion_region_num; |
tonyp@2333 | 1398 | assert(_young_list_target_length <= _young_list_max_length, "post-condition"); |
tonyp@2333 | 1399 | } |
tonyp@2333 | 1400 | |
apetrusenko@980 | 1401 | // Calculates survivor space parameters. |
tonyp@3119 | 1402 | void G1CollectorPolicy::update_survivors_policy() { |
tonyp@3119 | 1403 | double max_survivor_regions_d = |
tonyp@3119 | 1404 | (double) _young_list_target_length / (double) SurvivorRatio; |
tonyp@3119 | 1405 | // We use ceiling so that if max_survivor_regions_d is > 0.0 (but |
tonyp@3119 | 1406 | // smaller than 1.0) we'll get 1. |
tonyp@3713 | 1407 | _max_survivor_regions = (uint) ceil(max_survivor_regions_d); |
tonyp@3119 | 1408 | |
tonyp@3066 | 1409 | _tenuring_threshold = _survivors_age_table.compute_tenuring_threshold( |
apetrusenko@980 | 1410 | HeapRegion::GrainWords * _max_survivor_regions); |
apetrusenko@980 | 1411 | } |
apetrusenko@980 | 1412 | |
tonyp@3114 | 1413 | bool G1CollectorPolicy::force_initial_mark_if_outside_cycle( |
tonyp@3114 | 1414 | GCCause::Cause gc_cause) { |
tonyp@2011 | 1415 | bool during_cycle = _g1->concurrent_mark()->cmThread()->during_cycle(); |
tonyp@2011 | 1416 | if (!during_cycle) { |
tonyp@3114 | 1417 | ergo_verbose1(ErgoConcCycles, |
tonyp@3114 | 1418 | "request concurrent cycle initiation", |
tonyp@3114 | 1419 | ergo_format_reason("requested by GC cause") |
tonyp@3114 | 1420 | ergo_format_str("GC cause"), |
tonyp@3114 | 1421 | GCCause::to_string(gc_cause)); |
tonyp@2011 | 1422 | set_initiate_conc_mark_if_possible(); |
tonyp@2011 | 1423 | return true; |
tonyp@2011 | 1424 | } else { |
tonyp@3114 | 1425 | ergo_verbose1(ErgoConcCycles, |
tonyp@3114 | 1426 | "do not request concurrent cycle initiation", |
tonyp@3114 | 1427 | ergo_format_reason("concurrent cycle already in progress") |
tonyp@3114 | 1428 | ergo_format_str("GC cause"), |
tonyp@3114 | 1429 | GCCause::to_string(gc_cause)); |
tonyp@2011 | 1430 | return false; |
tonyp@2011 | 1431 | } |
tonyp@2011 | 1432 | } |
tonyp@2011 | 1433 | |
ysr@777 | 1434 | void |
tonyp@1794 | 1435 | G1CollectorPolicy::decide_on_conc_mark_initiation() { |
tonyp@1794 | 1436 | // We are about to decide on whether this pause will be an |
tonyp@1794 | 1437 | // initial-mark pause. |
tonyp@1794 | 1438 | |
tonyp@1794 | 1439 | // First, during_initial_mark_pause() should not be already set. We |
tonyp@1794 | 1440 | // will set it here if we have to. However, it should be cleared by |
tonyp@1794 | 1441 | // the end of the pause (it's only set for the duration of an |
tonyp@1794 | 1442 | // initial-mark pause). |
tonyp@1794 | 1443 | assert(!during_initial_mark_pause(), "pre-condition"); |
tonyp@1794 | 1444 | |
tonyp@1794 | 1445 | if (initiate_conc_mark_if_possible()) { |
tonyp@1794 | 1446 | // We had noticed on a previous pause that the heap occupancy has |
tonyp@1794 | 1447 | // gone over the initiating threshold and we should start a |
tonyp@1794 | 1448 | // concurrent marking cycle. So we might initiate one. |
tonyp@1794 | 1449 | |
tonyp@1794 | 1450 | bool during_cycle = _g1->concurrent_mark()->cmThread()->during_cycle(); |
tonyp@1794 | 1451 | if (!during_cycle) { |
tonyp@1794 | 1452 | // The concurrent marking thread is not "during a cycle", i.e., |
tonyp@1794 | 1453 | // it has completed the last one. So we can go ahead and |
tonyp@1794 | 1454 | // initiate a new cycle. |
tonyp@1794 | 1455 | |
tonyp@1794 | 1456 | set_during_initial_mark_pause(); |
tonyp@3337 | 1457 | // We do not allow mixed GCs during marking. |
tonyp@3337 | 1458 | if (!gcs_are_young()) { |
tonyp@3337 | 1459 | set_gcs_are_young(true); |
tonyp@3337 | 1460 | ergo_verbose0(ErgoMixedGCs, |
tonyp@3337 | 1461 | "end mixed GCs", |
johnc@3178 | 1462 | ergo_format_reason("concurrent cycle is about to start")); |
johnc@3178 | 1463 | } |
tonyp@1794 | 1464 | |
tonyp@1794 | 1465 | // And we can now clear initiate_conc_mark_if_possible() as |
tonyp@1794 | 1466 | // we've already acted on it. |
tonyp@1794 | 1467 | clear_initiate_conc_mark_if_possible(); |
tonyp@3114 | 1468 | |
tonyp@3114 | 1469 | ergo_verbose0(ErgoConcCycles, |
tonyp@3114 | 1470 | "initiate concurrent cycle", |
tonyp@3114 | 1471 | ergo_format_reason("concurrent cycle initiation requested")); |
tonyp@1794 | 1472 | } else { |
tonyp@1794 | 1473 | // The concurrent marking thread is still finishing up the |
tonyp@1794 | 1474 | // previous cycle. If we start one right now the two cycles |
tonyp@1794 | 1475 | // overlap. In particular, the concurrent marking thread might |
tonyp@1794 | 1476 | // be in the process of clearing the next marking bitmap (which |
tonyp@1794 | 1477 | // we will use for the next cycle if we start one). Starting a |
tonyp@1794 | 1478 | // cycle now will be bad given that parts of the marking |
tonyp@1794 | 1479 | // information might get cleared by the marking thread. And we |
tonyp@1794 | 1480 | // cannot wait for the marking thread to finish the cycle as it |
tonyp@1794 | 1481 | // periodically yields while clearing the next marking bitmap |
tonyp@1794 | 1482 | // and, if it's in a yield point, it's waiting for us to |
tonyp@1794 | 1483 | // finish. So, at this point we will not start a cycle and we'll |
tonyp@1794 | 1484 | // let the concurrent marking thread complete the last one. |
tonyp@3114 | 1485 | ergo_verbose0(ErgoConcCycles, |
tonyp@3114 | 1486 | "do not initiate concurrent cycle", |
tonyp@3114 | 1487 | ergo_format_reason("concurrent cycle already in progress")); |
tonyp@1794 | 1488 | } |
tonyp@1794 | 1489 | } |
tonyp@1794 | 1490 | } |
tonyp@1794 | 1491 | |
ysr@777 | 1492 | class KnownGarbageClosure: public HeapRegionClosure { |
tonyp@3539 | 1493 | G1CollectedHeap* _g1h; |
ysr@777 | 1494 | CollectionSetChooser* _hrSorted; |
ysr@777 | 1495 | |
ysr@777 | 1496 | public: |
ysr@777 | 1497 | KnownGarbageClosure(CollectionSetChooser* hrSorted) : |
tonyp@3539 | 1498 | _g1h(G1CollectedHeap::heap()), _hrSorted(hrSorted) { } |
ysr@777 | 1499 | |
ysr@777 | 1500 | bool doHeapRegion(HeapRegion* r) { |
ysr@777 | 1501 | // We only include humongous regions in collection |
ysr@777 | 1502 | // sets when concurrent mark shows that their contained object is |
ysr@777 | 1503 | // unreachable. |
ysr@777 | 1504 | |
ysr@777 | 1505 | // Do we have any marking information for this region? |
ysr@777 | 1506 | if (r->is_marked()) { |
tonyp@3539 | 1507 | // We will skip any region that's currently used as an old GC |
tonyp@3539 | 1508 | // alloc region (we should not consider those for collection |
tonyp@3539 | 1509 | // before we fill them up). |
tonyp@3714 | 1510 | if (_hrSorted->should_add(r) && !_g1h->is_old_gc_alloc_region(r)) { |
tonyp@3714 | 1511 | _hrSorted->add_region(r); |
ysr@777 | 1512 | } |
ysr@777 | 1513 | } |
ysr@777 | 1514 | return false; |
ysr@777 | 1515 | } |
ysr@777 | 1516 | }; |
ysr@777 | 1517 | |
ysr@777 | 1518 | class ParKnownGarbageHRClosure: public HeapRegionClosure { |
tonyp@3539 | 1519 | G1CollectedHeap* _g1h; |
tonyp@3957 | 1520 | CSetChooserParUpdater _cset_updater; |
ysr@777 | 1521 | |
ysr@777 | 1522 | public: |
ysr@777 | 1523 | ParKnownGarbageHRClosure(CollectionSetChooser* hrSorted, |
tonyp@3714 | 1524 | uint chunk_size) : |
tonyp@3957 | 1525 | _g1h(G1CollectedHeap::heap()), |
tonyp@3957 | 1526 | _cset_updater(hrSorted, true /* parallel */, chunk_size) { } |
ysr@777 | 1527 | |
ysr@777 | 1528 | bool doHeapRegion(HeapRegion* r) { |
ysr@777 | 1529 | // Do we have any marking information for this region? |
ysr@777 | 1530 | if (r->is_marked()) { |
tonyp@3539 | 1531 | // We will skip any region that's currently used as an old GC |
tonyp@3539 | 1532 | // alloc region (we should not consider those for collection |
tonyp@3539 | 1533 | // before we fill them up). |
tonyp@3957 | 1534 | if (_cset_updater.should_add(r) && !_g1h->is_old_gc_alloc_region(r)) { |
tonyp@3957 | 1535 | _cset_updater.add_region(r); |
ysr@777 | 1536 | } |
ysr@777 | 1537 | } |
ysr@777 | 1538 | return false; |
ysr@777 | 1539 | } |
ysr@777 | 1540 | }; |
ysr@777 | 1541 | |
ysr@777 | 1542 | class ParKnownGarbageTask: public AbstractGangTask { |
ysr@777 | 1543 | CollectionSetChooser* _hrSorted; |
tonyp@3714 | 1544 | uint _chunk_size; |
ysr@777 | 1545 | G1CollectedHeap* _g1; |
ysr@777 | 1546 | public: |
tonyp@3714 | 1547 | ParKnownGarbageTask(CollectionSetChooser* hrSorted, uint chunk_size) : |
ysr@777 | 1548 | AbstractGangTask("ParKnownGarbageTask"), |
ysr@777 | 1549 | _hrSorted(hrSorted), _chunk_size(chunk_size), |
tonyp@3539 | 1550 | _g1(G1CollectedHeap::heap()) { } |
ysr@777 | 1551 | |
jmasa@3357 | 1552 | void work(uint worker_id) { |
tonyp@3714 | 1553 | ParKnownGarbageHRClosure parKnownGarbageCl(_hrSorted, _chunk_size); |
tonyp@3714 | 1554 | |
ysr@777 | 1555 | // Back to zero for the claim value. |
jmasa@3357 | 1556 | _g1->heap_region_par_iterate_chunked(&parKnownGarbageCl, worker_id, |
jmasa@3294 | 1557 | _g1->workers()->active_workers(), |
tonyp@790 | 1558 | HeapRegion::InitialClaimValue); |
ysr@777 | 1559 | } |
ysr@777 | 1560 | }; |
ysr@777 | 1561 | |
ysr@777 | 1562 | void |
jmasa@3294 | 1563 | G1CollectorPolicy::record_concurrent_mark_cleanup_end(int no_of_gc_threads) { |
tonyp@3714 | 1564 | _collectionSetChooser->clear(); |
tonyp@3209 | 1565 | |
tonyp@3713 | 1566 | uint region_num = _g1->n_regions(); |
jmasa@2188 | 1567 | if (G1CollectedHeap::use_parallel_gc_threads()) { |
tonyp@3713 | 1568 | const uint OverpartitionFactor = 4; |
tonyp@3713 | 1569 | uint WorkUnit; |
jmasa@3294 | 1570 | // The use of MinChunkSize = 8 in the original code |
jmasa@3294 | 1571 | // causes some assertion failures when the total number of |
jmasa@3294 | 1572 | // region is less than 8. The code here tries to fix that. |
jmasa@3294 | 1573 | // Should the original code also be fixed? |
jmasa@3294 | 1574 | if (no_of_gc_threads > 0) { |
tonyp@3713 | 1575 | const uint MinWorkUnit = MAX2(region_num / no_of_gc_threads, 1U); |
tonyp@3713 | 1576 | WorkUnit = MAX2(region_num / (no_of_gc_threads * OverpartitionFactor), |
tonyp@3713 | 1577 | MinWorkUnit); |
jmasa@3294 | 1578 | } else { |
jmasa@3294 | 1579 | assert(no_of_gc_threads > 0, |
jmasa@3294 | 1580 | "The active gc workers should be greater than 0"); |
jmasa@3294 | 1581 | // In a product build do something reasonable to avoid a crash. |
tonyp@3713 | 1582 | const uint MinWorkUnit = MAX2(region_num / (uint) ParallelGCThreads, 1U); |
jmasa@3294 | 1583 | WorkUnit = |
tonyp@3713 | 1584 | MAX2(region_num / (uint) (ParallelGCThreads * OverpartitionFactor), |
jmasa@3294 | 1585 | MinWorkUnit); |
jmasa@3294 | 1586 | } |
tonyp@3714 | 1587 | _collectionSetChooser->prepare_for_par_region_addition(_g1->n_regions(), |
tonyp@3714 | 1588 | WorkUnit); |
ysr@777 | 1589 | ParKnownGarbageTask parKnownGarbageTask(_collectionSetChooser, |
kvn@1926 | 1590 | (int) WorkUnit); |
ysr@777 | 1591 | _g1->workers()->run_task(&parKnownGarbageTask); |
tonyp@790 | 1592 | |
tonyp@790 | 1593 | assert(_g1->check_heap_region_claim_values(HeapRegion::InitialClaimValue), |
tonyp@790 | 1594 | "sanity check"); |
ysr@777 | 1595 | } else { |
ysr@777 | 1596 | KnownGarbageClosure knownGarbagecl(_collectionSetChooser); |
ysr@777 | 1597 | _g1->heap_region_iterate(&knownGarbagecl); |
ysr@777 | 1598 | } |
tonyp@3209 | 1599 | |
tonyp@3714 | 1600 | _collectionSetChooser->sort_regions(); |
tonyp@3714 | 1601 | |
tonyp@3209 | 1602 | double end_sec = os::elapsedTime(); |
tonyp@3209 | 1603 | double elapsed_time_ms = (end_sec - _mark_cleanup_start_sec) * 1000.0; |
tonyp@3209 | 1604 | _concurrent_mark_cleanup_times_ms->add(elapsed_time_ms); |
tonyp@3209 | 1605 | _cur_mark_stop_world_time_ms += elapsed_time_ms; |
tonyp@3209 | 1606 | _prev_collection_pause_end_ms += elapsed_time_ms; |
tonyp@3209 | 1607 | _mmu_tracker->add_pause(_mark_cleanup_start_sec, end_sec, true); |
ysr@777 | 1608 | } |
ysr@777 | 1609 | |
johnc@1829 | 1610 | // Add the heap region at the head of the non-incremental collection set |
tonyp@3289 | 1611 | void G1CollectorPolicy::add_old_region_to_cset(HeapRegion* hr) { |
johnc@1829 | 1612 | assert(_inc_cset_build_state == Active, "Precondition"); |
johnc@1829 | 1613 | assert(!hr->is_young(), "non-incremental add of young region"); |
johnc@1829 | 1614 | |
johnc@1829 | 1615 | assert(!hr->in_collection_set(), "should not already be in the CSet"); |
ysr@777 | 1616 | hr->set_in_collection_set(true); |
ysr@777 | 1617 | hr->set_next_in_collection_set(_collection_set); |
ysr@777 | 1618 | _collection_set = hr; |
ysr@777 | 1619 | _collection_set_bytes_used_before += hr->used(); |
tonyp@961 | 1620 | _g1->register_region_with_in_cset_fast_test(hr); |
tonyp@3289 | 1621 | size_t rs_length = hr->rem_set()->occupied(); |
tonyp@3289 | 1622 | _recorded_rs_lengths += rs_length; |
tonyp@3289 | 1623 | _old_cset_region_length += 1; |
ysr@777 | 1624 | } |
ysr@777 | 1625 | |
johnc@1829 | 1626 | // Initialize the per-collection-set information |
johnc@1829 | 1627 | void G1CollectorPolicy::start_incremental_cset_building() { |
johnc@1829 | 1628 | assert(_inc_cset_build_state == Inactive, "Precondition"); |
johnc@1829 | 1629 | |
johnc@1829 | 1630 | _inc_cset_head = NULL; |
johnc@1829 | 1631 | _inc_cset_tail = NULL; |
johnc@1829 | 1632 | _inc_cset_bytes_used_before = 0; |
johnc@1829 | 1633 | |
johnc@1829 | 1634 | _inc_cset_max_finger = 0; |
johnc@1829 | 1635 | _inc_cset_recorded_rs_lengths = 0; |
tonyp@3356 | 1636 | _inc_cset_recorded_rs_lengths_diffs = 0; |
tonyp@3356 | 1637 | _inc_cset_predicted_elapsed_time_ms = 0.0; |
tonyp@3356 | 1638 | _inc_cset_predicted_elapsed_time_ms_diffs = 0.0; |
johnc@1829 | 1639 | _inc_cset_build_state = Active; |
johnc@1829 | 1640 | } |
johnc@1829 | 1641 | |
tonyp@3356 | 1642 | void G1CollectorPolicy::finalize_incremental_cset_building() { |
tonyp@3356 | 1643 | assert(_inc_cset_build_state == Active, "Precondition"); |
tonyp@3356 | 1644 | assert(SafepointSynchronize::is_at_safepoint(), "should be at a safepoint"); |
tonyp@3356 | 1645 | |
tonyp@3356 | 1646 | // The two "main" fields, _inc_cset_recorded_rs_lengths and |
tonyp@3356 | 1647 | // _inc_cset_predicted_elapsed_time_ms, are updated by the thread |
tonyp@3356 | 1648 | // that adds a new region to the CSet. Further updates by the |
tonyp@3356 | 1649 | // concurrent refinement thread that samples the young RSet lengths |
tonyp@3356 | 1650 | // are accumulated in the *_diffs fields. Here we add the diffs to |
tonyp@3356 | 1651 | // the "main" fields. |
tonyp@3356 | 1652 | |
tonyp@3356 | 1653 | if (_inc_cset_recorded_rs_lengths_diffs >= 0) { |
tonyp@3356 | 1654 | _inc_cset_recorded_rs_lengths += _inc_cset_recorded_rs_lengths_diffs; |
tonyp@3356 | 1655 | } else { |
tonyp@3356 | 1656 | // This is defensive. The diff should in theory be always positive |
tonyp@3356 | 1657 | // as RSets can only grow between GCs. However, given that we |
tonyp@3356 | 1658 | // sample their size concurrently with other threads updating them |
tonyp@3356 | 1659 | // it's possible that we might get the wrong size back, which |
tonyp@3356 | 1660 | // could make the calculations somewhat inaccurate. |
tonyp@3356 | 1661 | size_t diffs = (size_t) (-_inc_cset_recorded_rs_lengths_diffs); |
tonyp@3356 | 1662 | if (_inc_cset_recorded_rs_lengths >= diffs) { |
tonyp@3356 | 1663 | _inc_cset_recorded_rs_lengths -= diffs; |
tonyp@3356 | 1664 | } else { |
tonyp@3356 | 1665 | _inc_cset_recorded_rs_lengths = 0; |
tonyp@3356 | 1666 | } |
tonyp@3356 | 1667 | } |
tonyp@3356 | 1668 | _inc_cset_predicted_elapsed_time_ms += |
tonyp@3356 | 1669 | _inc_cset_predicted_elapsed_time_ms_diffs; |
tonyp@3356 | 1670 | |
tonyp@3356 | 1671 | _inc_cset_recorded_rs_lengths_diffs = 0; |
tonyp@3356 | 1672 | _inc_cset_predicted_elapsed_time_ms_diffs = 0.0; |
tonyp@3356 | 1673 | } |
tonyp@3356 | 1674 | |
johnc@1829 | 1675 | void G1CollectorPolicy::add_to_incremental_cset_info(HeapRegion* hr, size_t rs_length) { |
johnc@1829 | 1676 | // This routine is used when: |
johnc@1829 | 1677 | // * adding survivor regions to the incremental cset at the end of an |
johnc@1829 | 1678 | // evacuation pause, |
johnc@1829 | 1679 | // * adding the current allocation region to the incremental cset |
johnc@1829 | 1680 | // when it is retired, and |
johnc@1829 | 1681 | // * updating existing policy information for a region in the |
johnc@1829 | 1682 | // incremental cset via young list RSet sampling. |
johnc@1829 | 1683 | // Therefore this routine may be called at a safepoint by the |
johnc@1829 | 1684 | // VM thread, or in-between safepoints by mutator threads (when |
johnc@1829 | 1685 | // retiring the current allocation region) or a concurrent |
johnc@1829 | 1686 | // refine thread (RSet sampling). |
johnc@1829 | 1687 | |
johnc@3998 | 1688 | double region_elapsed_time_ms = predict_region_elapsed_time_ms(hr, gcs_are_young()); |
johnc@1829 | 1689 | size_t used_bytes = hr->used(); |
johnc@1829 | 1690 | _inc_cset_recorded_rs_lengths += rs_length; |
johnc@1829 | 1691 | _inc_cset_predicted_elapsed_time_ms += region_elapsed_time_ms; |
johnc@1829 | 1692 | _inc_cset_bytes_used_before += used_bytes; |
johnc@1829 | 1693 | |
johnc@1829 | 1694 | // Cache the values we have added to the aggregated informtion |
johnc@1829 | 1695 | // in the heap region in case we have to remove this region from |
johnc@1829 | 1696 | // the incremental collection set, or it is updated by the |
johnc@1829 | 1697 | // rset sampling code |
johnc@1829 | 1698 | hr->set_recorded_rs_length(rs_length); |
johnc@1829 | 1699 | hr->set_predicted_elapsed_time_ms(region_elapsed_time_ms); |
johnc@1829 | 1700 | } |
johnc@1829 | 1701 | |
tonyp@3356 | 1702 | void G1CollectorPolicy::update_incremental_cset_info(HeapRegion* hr, |
tonyp@3356 | 1703 | size_t new_rs_length) { |
tonyp@3356 | 1704 | // Update the CSet information that is dependent on the new RS length |
tonyp@3356 | 1705 | assert(hr->is_young(), "Precondition"); |
tonyp@3356 | 1706 | assert(!SafepointSynchronize::is_at_safepoint(), |
tonyp@3356 | 1707 | "should not be at a safepoint"); |
tonyp@3356 | 1708 | |
tonyp@3356 | 1709 | // We could have updated _inc_cset_recorded_rs_lengths and |
tonyp@3356 | 1710 | // _inc_cset_predicted_elapsed_time_ms directly but we'd need to do |
tonyp@3356 | 1711 | // that atomically, as this code is executed by a concurrent |
tonyp@3356 | 1712 | // refinement thread, potentially concurrently with a mutator thread |
tonyp@3356 | 1713 | // allocating a new region and also updating the same fields. To |
tonyp@3356 | 1714 | // avoid the atomic operations we accumulate these updates on two |
tonyp@3356 | 1715 | // separate fields (*_diffs) and we'll just add them to the "main" |
tonyp@3356 | 1716 | // fields at the start of a GC. |
tonyp@3356 | 1717 | |
tonyp@3356 | 1718 | ssize_t old_rs_length = (ssize_t) hr->recorded_rs_length(); |
tonyp@3356 | 1719 | ssize_t rs_lengths_diff = (ssize_t) new_rs_length - old_rs_length; |
tonyp@3356 | 1720 | _inc_cset_recorded_rs_lengths_diffs += rs_lengths_diff; |
tonyp@3356 | 1721 | |
johnc@1829 | 1722 | double old_elapsed_time_ms = hr->predicted_elapsed_time_ms(); |
johnc@3998 | 1723 | double new_region_elapsed_time_ms = predict_region_elapsed_time_ms(hr, gcs_are_young()); |
tonyp@3356 | 1724 | double elapsed_ms_diff = new_region_elapsed_time_ms - old_elapsed_time_ms; |
tonyp@3356 | 1725 | _inc_cset_predicted_elapsed_time_ms_diffs += elapsed_ms_diff; |
tonyp@3356 | 1726 | |
tonyp@3356 | 1727 | hr->set_recorded_rs_length(new_rs_length); |
tonyp@3356 | 1728 | hr->set_predicted_elapsed_time_ms(new_region_elapsed_time_ms); |
johnc@1829 | 1729 | } |
johnc@1829 | 1730 | |
johnc@1829 | 1731 | void G1CollectorPolicy::add_region_to_incremental_cset_common(HeapRegion* hr) { |
tonyp@3289 | 1732 | assert(hr->is_young(), "invariant"); |
tonyp@3289 | 1733 | assert(hr->young_index_in_cset() > -1, "should have already been set"); |
johnc@1829 | 1734 | assert(_inc_cset_build_state == Active, "Precondition"); |
johnc@1829 | 1735 | |
johnc@1829 | 1736 | // We need to clear and set the cached recorded/cached collection set |
johnc@1829 | 1737 | // information in the heap region here (before the region gets added |
johnc@1829 | 1738 | // to the collection set). An individual heap region's cached values |
johnc@1829 | 1739 | // are calculated, aggregated with the policy collection set info, |
johnc@1829 | 1740 | // and cached in the heap region here (initially) and (subsequently) |
johnc@1829 | 1741 | // by the Young List sampling code. |
johnc@1829 | 1742 | |
johnc@1829 | 1743 | size_t rs_length = hr->rem_set()->occupied(); |
johnc@1829 | 1744 | add_to_incremental_cset_info(hr, rs_length); |
johnc@1829 | 1745 | |
johnc@1829 | 1746 | HeapWord* hr_end = hr->end(); |
johnc@1829 | 1747 | _inc_cset_max_finger = MAX2(_inc_cset_max_finger, hr_end); |
johnc@1829 | 1748 | |
johnc@1829 | 1749 | assert(!hr->in_collection_set(), "invariant"); |
johnc@1829 | 1750 | hr->set_in_collection_set(true); |
johnc@1829 | 1751 | assert( hr->next_in_collection_set() == NULL, "invariant"); |
johnc@1829 | 1752 | |
johnc@1829 | 1753 | _g1->register_region_with_in_cset_fast_test(hr); |
johnc@1829 | 1754 | } |
johnc@1829 | 1755 | |
johnc@1829 | 1756 | // Add the region at the RHS of the incremental cset |
johnc@1829 | 1757 | void G1CollectorPolicy::add_region_to_incremental_cset_rhs(HeapRegion* hr) { |
johnc@1829 | 1758 | // We should only ever be appending survivors at the end of a pause |
johnc@1829 | 1759 | assert( hr->is_survivor(), "Logic"); |
johnc@1829 | 1760 | |
johnc@1829 | 1761 | // Do the 'common' stuff |
johnc@1829 | 1762 | add_region_to_incremental_cset_common(hr); |
johnc@1829 | 1763 | |
johnc@1829 | 1764 | // Now add the region at the right hand side |
johnc@1829 | 1765 | if (_inc_cset_tail == NULL) { |
johnc@1829 | 1766 | assert(_inc_cset_head == NULL, "invariant"); |
johnc@1829 | 1767 | _inc_cset_head = hr; |
johnc@1829 | 1768 | } else { |
johnc@1829 | 1769 | _inc_cset_tail->set_next_in_collection_set(hr); |
johnc@1829 | 1770 | } |
johnc@1829 | 1771 | _inc_cset_tail = hr; |
johnc@1829 | 1772 | } |
johnc@1829 | 1773 | |
johnc@1829 | 1774 | // Add the region to the LHS of the incremental cset |
johnc@1829 | 1775 | void G1CollectorPolicy::add_region_to_incremental_cset_lhs(HeapRegion* hr) { |
johnc@1829 | 1776 | // Survivors should be added to the RHS at the end of a pause |
johnc@1829 | 1777 | assert(!hr->is_survivor(), "Logic"); |
johnc@1829 | 1778 | |
johnc@1829 | 1779 | // Do the 'common' stuff |
johnc@1829 | 1780 | add_region_to_incremental_cset_common(hr); |
johnc@1829 | 1781 | |
johnc@1829 | 1782 | // Add the region at the left hand side |
johnc@1829 | 1783 | hr->set_next_in_collection_set(_inc_cset_head); |
johnc@1829 | 1784 | if (_inc_cset_head == NULL) { |
johnc@1829 | 1785 | assert(_inc_cset_tail == NULL, "Invariant"); |
johnc@1829 | 1786 | _inc_cset_tail = hr; |
johnc@1829 | 1787 | } |
johnc@1829 | 1788 | _inc_cset_head = hr; |
johnc@1829 | 1789 | } |
johnc@1829 | 1790 | |
johnc@1829 | 1791 | #ifndef PRODUCT |
johnc@1829 | 1792 | void G1CollectorPolicy::print_collection_set(HeapRegion* list_head, outputStream* st) { |
johnc@1829 | 1793 | assert(list_head == inc_cset_head() || list_head == collection_set(), "must be"); |
johnc@1829 | 1794 | |
johnc@1829 | 1795 | st->print_cr("\nCollection_set:"); |
johnc@1829 | 1796 | HeapRegion* csr = list_head; |
johnc@1829 | 1797 | while (csr != NULL) { |
johnc@1829 | 1798 | HeapRegion* next = csr->next_in_collection_set(); |
johnc@1829 | 1799 | assert(csr->in_collection_set(), "bad CS"); |
johnc@3731 | 1800 | st->print_cr(" "HR_FORMAT", P: "PTR_FORMAT "N: "PTR_FORMAT", age: %4d", |
johnc@3731 | 1801 | HR_FORMAT_PARAMS(csr), |
johnc@3731 | 1802 | csr->prev_top_at_mark_start(), csr->next_top_at_mark_start(), |
johnc@3731 | 1803 | csr->age_in_surv_rate_group_cond()); |
johnc@1829 | 1804 | csr = next; |
johnc@1829 | 1805 | } |
johnc@1829 | 1806 | } |
johnc@1829 | 1807 | #endif // !PRODUCT |
johnc@1829 | 1808 | |
johnc@4681 | 1809 | double G1CollectorPolicy::reclaimable_bytes_perc(size_t reclaimable_bytes) { |
johnc@4681 | 1810 | // Returns the given amount of reclaimable bytes (that represents |
johnc@4681 | 1811 | // the amount of reclaimable space still to be collected) as a |
johnc@4681 | 1812 | // percentage of the current heap capacity. |
johnc@4681 | 1813 | size_t capacity_bytes = _g1->capacity(); |
johnc@4681 | 1814 | return (double) reclaimable_bytes * 100.0 / (double) capacity_bytes; |
johnc@4681 | 1815 | } |
johnc@4681 | 1816 | |
tonyp@3539 | 1817 | bool G1CollectorPolicy::next_gc_should_be_mixed(const char* true_action_str, |
tonyp@3539 | 1818 | const char* false_action_str) { |
tonyp@3539 | 1819 | CollectionSetChooser* cset_chooser = _collectionSetChooser; |
tonyp@3714 | 1820 | if (cset_chooser->is_empty()) { |
tonyp@3539 | 1821 | ergo_verbose0(ErgoMixedGCs, |
tonyp@3539 | 1822 | false_action_str, |
tonyp@3539 | 1823 | ergo_format_reason("candidate old regions not available")); |
tonyp@3539 | 1824 | return false; |
tonyp@3539 | 1825 | } |
johnc@4681 | 1826 | |
johnc@4681 | 1827 | // Is the amount of uncollected reclaimable space above G1HeapWastePercent? |
tonyp@3714 | 1828 | size_t reclaimable_bytes = cset_chooser->remaining_reclaimable_bytes(); |
johnc@4681 | 1829 | double reclaimable_perc = reclaimable_bytes_perc(reclaimable_bytes); |
tonyp@3667 | 1830 | double threshold = (double) G1HeapWastePercent; |
johnc@4681 | 1831 | if (reclaimable_perc <= threshold) { |
tonyp@3539 | 1832 | ergo_verbose4(ErgoMixedGCs, |
tonyp@3539 | 1833 | false_action_str, |
johnc@4681 | 1834 | ergo_format_reason("reclaimable percentage not over threshold") |
tonyp@3539 | 1835 | ergo_format_region("candidate old regions") |
tonyp@3539 | 1836 | ergo_format_byte_perc("reclaimable") |
tonyp@3539 | 1837 | ergo_format_perc("threshold"), |
tonyp@3714 | 1838 | cset_chooser->remaining_regions(), |
johnc@4681 | 1839 | reclaimable_bytes, |
johnc@4681 | 1840 | reclaimable_perc, threshold); |
tonyp@3539 | 1841 | return false; |
tonyp@3539 | 1842 | } |
tonyp@3539 | 1843 | |
tonyp@3539 | 1844 | ergo_verbose4(ErgoMixedGCs, |
tonyp@3539 | 1845 | true_action_str, |
tonyp@3539 | 1846 | ergo_format_reason("candidate old regions available") |
tonyp@3539 | 1847 | ergo_format_region("candidate old regions") |
tonyp@3539 | 1848 | ergo_format_byte_perc("reclaimable") |
tonyp@3539 | 1849 | ergo_format_perc("threshold"), |
tonyp@3714 | 1850 | cset_chooser->remaining_regions(), |
johnc@4681 | 1851 | reclaimable_bytes, |
johnc@4681 | 1852 | reclaimable_perc, threshold); |
tonyp@3539 | 1853 | return true; |
tonyp@3539 | 1854 | } |
tonyp@3539 | 1855 | |
johnc@4681 | 1856 | uint G1CollectorPolicy::calc_min_old_cset_length() { |
johnc@4681 | 1857 | // The min old CSet region bound is based on the maximum desired |
johnc@4681 | 1858 | // number of mixed GCs after a cycle. I.e., even if some old regions |
johnc@4681 | 1859 | // look expensive, we should add them to the CSet anyway to make |
johnc@4681 | 1860 | // sure we go through the available old regions in no more than the |
johnc@4681 | 1861 | // maximum desired number of mixed GCs. |
johnc@4681 | 1862 | // |
johnc@4681 | 1863 | // The calculation is based on the number of marked regions we added |
johnc@4681 | 1864 | // to the CSet chooser in the first place, not how many remain, so |
johnc@4681 | 1865 | // that the result is the same during all mixed GCs that follow a cycle. |
johnc@4681 | 1866 | |
johnc@4681 | 1867 | const size_t region_num = (size_t) _collectionSetChooser->length(); |
johnc@4681 | 1868 | const size_t gc_num = (size_t) MAX2(G1MixedGCCountTarget, (uintx) 1); |
johnc@4681 | 1869 | size_t result = region_num / gc_num; |
johnc@4681 | 1870 | // emulate ceiling |
johnc@4681 | 1871 | if (result * gc_num < region_num) { |
johnc@4681 | 1872 | result += 1; |
johnc@4681 | 1873 | } |
johnc@4681 | 1874 | return (uint) result; |
johnc@4681 | 1875 | } |
johnc@4681 | 1876 | |
johnc@4681 | 1877 | uint G1CollectorPolicy::calc_max_old_cset_length() { |
johnc@4681 | 1878 | // The max old CSet region bound is based on the threshold expressed |
johnc@4681 | 1879 | // as a percentage of the heap size. I.e., it should bound the |
johnc@4681 | 1880 | // number of old regions added to the CSet irrespective of how many |
johnc@4681 | 1881 | // of them are available. |
johnc@4681 | 1882 | |
johnc@4681 | 1883 | G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
johnc@4681 | 1884 | const size_t region_num = g1h->n_regions(); |
johnc@4681 | 1885 | const size_t perc = (size_t) G1OldCSetRegionThresholdPercent; |
johnc@4681 | 1886 | size_t result = region_num * perc / 100; |
johnc@4681 | 1887 | // emulate ceiling |
johnc@4681 | 1888 | if (100 * result < region_num * perc) { |
johnc@4681 | 1889 | result += 1; |
johnc@4681 | 1890 | } |
johnc@4681 | 1891 | return (uint) result; |
johnc@4681 | 1892 | } |
johnc@4681 | 1893 | |
johnc@4681 | 1894 | |
tonyp@3539 | 1895 | void G1CollectorPolicy::finalize_cset(double target_pause_time_ms) { |
johnc@3998 | 1896 | double young_start_time_sec = os::elapsedTime(); |
johnc@1829 | 1897 | |
tonyp@3114 | 1898 | YoungList* young_list = _g1->young_list(); |
tonyp@3356 | 1899 | finalize_incremental_cset_building(); |
tonyp@3114 | 1900 | |
tonyp@2011 | 1901 | guarantee(target_pause_time_ms > 0.0, |
tonyp@2011 | 1902 | err_msg("target_pause_time_ms = %1.6lf should be positive", |
tonyp@2011 | 1903 | target_pause_time_ms)); |
tonyp@2011 | 1904 | guarantee(_collection_set == NULL, "Precondition"); |
ysr@777 | 1905 | |
ysr@777 | 1906 | double base_time_ms = predict_base_elapsed_time_ms(_pending_cards); |
ysr@777 | 1907 | double predicted_pause_time_ms = base_time_ms; |
johnc@4681 | 1908 | double time_remaining_ms = MAX2(target_pause_time_ms - base_time_ms, 0.0); |
ysr@777 | 1909 | |
johnc@3998 | 1910 | ergo_verbose4(ErgoCSetConstruction | ErgoHigh, |
tonyp@3114 | 1911 | "start choosing CSet", |
johnc@3998 | 1912 | ergo_format_size("_pending_cards") |
tonyp@3114 | 1913 | ergo_format_ms("predicted base time") |
tonyp@3114 | 1914 | ergo_format_ms("remaining time") |
tonyp@3114 | 1915 | ergo_format_ms("target pause time"), |
johnc@3998 | 1916 | _pending_cards, base_time_ms, time_remaining_ms, target_pause_time_ms); |
tonyp@3114 | 1917 | |
tonyp@3337 | 1918 | _last_gc_was_young = gcs_are_young() ? true : false; |
tonyp@3337 | 1919 | |
tonyp@3337 | 1920 | if (_last_gc_was_young) { |
brutisso@3812 | 1921 | _trace_gen0_time_data.increment_young_collection_count(); |
tonyp@3114 | 1922 | } else { |
brutisso@3812 | 1923 | _trace_gen0_time_data.increment_mixed_collection_count(); |
tonyp@3114 | 1924 | } |
brutisso@3065 | 1925 | |
brutisso@3065 | 1926 | // The young list is laid with the survivor regions from the previous |
brutisso@3065 | 1927 | // pause are appended to the RHS of the young list, i.e. |
brutisso@3065 | 1928 | // [Newly Young Regions ++ Survivors from last pause]. |
brutisso@3065 | 1929 | |
tonyp@3713 | 1930 | uint survivor_region_length = young_list->survivor_length(); |
tonyp@3713 | 1931 | uint eden_region_length = young_list->length() - survivor_region_length; |
tonyp@3289 | 1932 | init_cset_region_lengths(eden_region_length, survivor_region_length); |
johnc@3998 | 1933 | |
johnc@3998 | 1934 | HeapRegion* hr = young_list->first_survivor_region(); |
brutisso@3065 | 1935 | while (hr != NULL) { |
brutisso@3065 | 1936 | assert(hr->is_survivor(), "badly formed young list"); |
brutisso@3065 | 1937 | hr->set_young(); |
brutisso@3065 | 1938 | hr = hr->get_next_young_region(); |
brutisso@3065 | 1939 | } |
brutisso@3065 | 1940 | |
tonyp@3114 | 1941 | // Clear the fields that point to the survivor list - they are all young now. |
tonyp@3114 | 1942 | young_list->clear_survivors(); |
brutisso@3065 | 1943 | |
brutisso@3065 | 1944 | _collection_set = _inc_cset_head; |
brutisso@3065 | 1945 | _collection_set_bytes_used_before = _inc_cset_bytes_used_before; |
johnc@4681 | 1946 | time_remaining_ms = MAX2(time_remaining_ms - _inc_cset_predicted_elapsed_time_ms, 0.0); |
brutisso@3065 | 1947 | predicted_pause_time_ms += _inc_cset_predicted_elapsed_time_ms; |
brutisso@3065 | 1948 | |
tonyp@3114 | 1949 | ergo_verbose3(ErgoCSetConstruction | ErgoHigh, |
tonyp@3114 | 1950 | "add young regions to CSet", |
tonyp@3114 | 1951 | ergo_format_region("eden") |
tonyp@3114 | 1952 | ergo_format_region("survivors") |
tonyp@3114 | 1953 | ergo_format_ms("predicted young region time"), |
tonyp@3289 | 1954 | eden_region_length, survivor_region_length, |
tonyp@3114 | 1955 | _inc_cset_predicted_elapsed_time_ms); |
tonyp@3114 | 1956 | |
brutisso@3065 | 1957 | // The number of recorded young regions is the incremental |
brutisso@3065 | 1958 | // collection set's current size |
brutisso@3065 | 1959 | set_recorded_rs_lengths(_inc_cset_recorded_rs_lengths); |
brutisso@3065 | 1960 | |
brutisso@3065 | 1961 | double young_end_time_sec = os::elapsedTime(); |
brutisso@4015 | 1962 | phase_times()->record_young_cset_choice_time_ms((young_end_time_sec - young_start_time_sec) * 1000.0); |
brutisso@3065 | 1963 | |
johnc@3998 | 1964 | // Set the start of the non-young choice time. |
johnc@3998 | 1965 | double non_young_start_time_sec = young_end_time_sec; |
brutisso@3065 | 1966 | |
tonyp@3337 | 1967 | if (!gcs_are_young()) { |
tonyp@3539 | 1968 | CollectionSetChooser* cset_chooser = _collectionSetChooser; |
tonyp@3714 | 1969 | cset_chooser->verify(); |
johnc@4681 | 1970 | const uint min_old_cset_length = calc_min_old_cset_length(); |
johnc@4681 | 1971 | const uint max_old_cset_length = calc_max_old_cset_length(); |
tonyp@3713 | 1972 | |
tonyp@3713 | 1973 | uint expensive_region_num = 0; |
tonyp@3539 | 1974 | bool check_time_remaining = adaptive_young_list_length(); |
johnc@3998 | 1975 | |
tonyp@3539 | 1976 | HeapRegion* hr = cset_chooser->peek(); |
tonyp@3539 | 1977 | while (hr != NULL) { |
tonyp@3539 | 1978 | if (old_cset_region_length() >= max_old_cset_length) { |
tonyp@3539 | 1979 | // Added maximum number of old regions to the CSet. |
tonyp@3539 | 1980 | ergo_verbose2(ErgoCSetConstruction, |
tonyp@3539 | 1981 | "finish adding old regions to CSet", |
tonyp@3539 | 1982 | ergo_format_reason("old CSet region num reached max") |
tonyp@3539 | 1983 | ergo_format_region("old") |
tonyp@3539 | 1984 | ergo_format_region("max"), |
tonyp@3539 | 1985 | old_cset_region_length(), max_old_cset_length); |
tonyp@3539 | 1986 | break; |
ysr@777 | 1987 | } |
tonyp@3114 | 1988 | |
johnc@4681 | 1989 | |
johnc@4681 | 1990 | // Stop adding regions if the remaining reclaimable space is |
johnc@4681 | 1991 | // not above G1HeapWastePercent. |
johnc@4681 | 1992 | size_t reclaimable_bytes = cset_chooser->remaining_reclaimable_bytes(); |
johnc@4681 | 1993 | double reclaimable_perc = reclaimable_bytes_perc(reclaimable_bytes); |
johnc@4681 | 1994 | double threshold = (double) G1HeapWastePercent; |
johnc@4681 | 1995 | if (reclaimable_perc <= threshold) { |
johnc@4681 | 1996 | // We've added enough old regions that the amount of uncollected |
johnc@4681 | 1997 | // reclaimable space is at or below the waste threshold. Stop |
johnc@4681 | 1998 | // adding old regions to the CSet. |
johnc@4681 | 1999 | ergo_verbose5(ErgoCSetConstruction, |
johnc@4681 | 2000 | "finish adding old regions to CSet", |
johnc@4681 | 2001 | ergo_format_reason("reclaimable percentage not over threshold") |
johnc@4681 | 2002 | ergo_format_region("old") |
johnc@4681 | 2003 | ergo_format_region("max") |
johnc@4681 | 2004 | ergo_format_byte_perc("reclaimable") |
johnc@4681 | 2005 | ergo_format_perc("threshold"), |
johnc@4681 | 2006 | old_cset_region_length(), |
johnc@4681 | 2007 | max_old_cset_length, |
johnc@4681 | 2008 | reclaimable_bytes, |
johnc@4681 | 2009 | reclaimable_perc, threshold); |
johnc@4681 | 2010 | break; |
johnc@4681 | 2011 | } |
johnc@4681 | 2012 | |
johnc@3998 | 2013 | double predicted_time_ms = predict_region_elapsed_time_ms(hr, gcs_are_young()); |
tonyp@3539 | 2014 | if (check_time_remaining) { |
tonyp@3539 | 2015 | if (predicted_time_ms > time_remaining_ms) { |
tonyp@3539 | 2016 | // Too expensive for the current CSet. |
tonyp@3539 | 2017 | |
tonyp@3539 | 2018 | if (old_cset_region_length() >= min_old_cset_length) { |
tonyp@3539 | 2019 | // We have added the minimum number of old regions to the CSet, |
tonyp@3539 | 2020 | // we are done with this CSet. |
tonyp@3539 | 2021 | ergo_verbose4(ErgoCSetConstruction, |
tonyp@3539 | 2022 | "finish adding old regions to CSet", |
tonyp@3539 | 2023 | ergo_format_reason("predicted time is too high") |
tonyp@3539 | 2024 | ergo_format_ms("predicted time") |
tonyp@3539 | 2025 | ergo_format_ms("remaining time") |
tonyp@3539 | 2026 | ergo_format_region("old") |
tonyp@3539 | 2027 | ergo_format_region("min"), |
tonyp@3539 | 2028 | predicted_time_ms, time_remaining_ms, |
tonyp@3539 | 2029 | old_cset_region_length(), min_old_cset_length); |
tonyp@3539 | 2030 | break; |
tonyp@3539 | 2031 | } |
tonyp@3539 | 2032 | |
tonyp@3539 | 2033 | // We'll add it anyway given that we haven't reached the |
tonyp@3539 | 2034 | // minimum number of old regions. |
tonyp@3539 | 2035 | expensive_region_num += 1; |
tonyp@3539 | 2036 | } |
tonyp@3114 | 2037 | } else { |
tonyp@3539 | 2038 | if (old_cset_region_length() >= min_old_cset_length) { |
tonyp@3539 | 2039 | // In the non-auto-tuning case, we'll finish adding regions |
tonyp@3539 | 2040 | // to the CSet if we reach the minimum. |
tonyp@3539 | 2041 | ergo_verbose2(ErgoCSetConstruction, |
tonyp@3539 | 2042 | "finish adding old regions to CSet", |
tonyp@3539 | 2043 | ergo_format_reason("old CSet region num reached min") |
tonyp@3539 | 2044 | ergo_format_region("old") |
tonyp@3539 | 2045 | ergo_format_region("min"), |
tonyp@3539 | 2046 | old_cset_region_length(), min_old_cset_length); |
tonyp@3539 | 2047 | break; |
tonyp@3114 | 2048 | } |
tonyp@3114 | 2049 | } |
tonyp@3539 | 2050 | |
tonyp@3539 | 2051 | // We will add this region to the CSet. |
johnc@4681 | 2052 | time_remaining_ms = MAX2(time_remaining_ms - predicted_time_ms, 0.0); |
tonyp@3539 | 2053 | predicted_pause_time_ms += predicted_time_ms; |
tonyp@3539 | 2054 | cset_chooser->remove_and_move_to_next(hr); |
tonyp@3539 | 2055 | _g1->old_set_remove(hr); |
tonyp@3539 | 2056 | add_old_region_to_cset(hr); |
tonyp@3539 | 2057 | |
tonyp@3539 | 2058 | hr = cset_chooser->peek(); |
tonyp@3114 | 2059 | } |
tonyp@3539 | 2060 | if (hr == NULL) { |
tonyp@3539 | 2061 | ergo_verbose0(ErgoCSetConstruction, |
tonyp@3539 | 2062 | "finish adding old regions to CSet", |
tonyp@3539 | 2063 | ergo_format_reason("candidate old regions not available")); |
tonyp@3539 | 2064 | } |
tonyp@3539 | 2065 | |
tonyp@3539 | 2066 | if (expensive_region_num > 0) { |
tonyp@3539 | 2067 | // We print the information once here at the end, predicated on |
tonyp@3539 | 2068 | // whether we added any apparently expensive regions or not, to |
tonyp@3539 | 2069 | // avoid generating output per region. |
tonyp@3539 | 2070 | ergo_verbose4(ErgoCSetConstruction, |
tonyp@3539 | 2071 | "added expensive regions to CSet", |
tonyp@3539 | 2072 | ergo_format_reason("old CSet region num not reached min") |
tonyp@3539 | 2073 | ergo_format_region("old") |
tonyp@3539 | 2074 | ergo_format_region("expensive") |
tonyp@3539 | 2075 | ergo_format_region("min") |
tonyp@3539 | 2076 | ergo_format_ms("remaining time"), |
tonyp@3539 | 2077 | old_cset_region_length(), |
tonyp@3539 | 2078 | expensive_region_num, |
tonyp@3539 | 2079 | min_old_cset_length, |
tonyp@3539 | 2080 | time_remaining_ms); |
tonyp@3539 | 2081 | } |
tonyp@3539 | 2082 | |
tonyp@3714 | 2083 | cset_chooser->verify(); |
ysr@777 | 2084 | } |
ysr@777 | 2085 | |
johnc@1829 | 2086 | stop_incremental_cset_building(); |
johnc@1829 | 2087 | |
tonyp@3114 | 2088 | ergo_verbose5(ErgoCSetConstruction, |
tonyp@3114 | 2089 | "finish choosing CSet", |
tonyp@3114 | 2090 | ergo_format_region("eden") |
tonyp@3114 | 2091 | ergo_format_region("survivors") |
tonyp@3114 | 2092 | ergo_format_region("old") |
tonyp@3114 | 2093 | ergo_format_ms("predicted pause time") |
tonyp@3114 | 2094 | ergo_format_ms("target pause time"), |
tonyp@3289 | 2095 | eden_region_length, survivor_region_length, |
tonyp@3289 | 2096 | old_cset_region_length(), |
tonyp@3114 | 2097 | predicted_pause_time_ms, target_pause_time_ms); |
tonyp@3114 | 2098 | |
ysr@777 | 2099 | double non_young_end_time_sec = os::elapsedTime(); |
brutisso@4015 | 2100 | phase_times()->record_non_young_cset_choice_time_ms((non_young_end_time_sec - non_young_start_time_sec) * 1000.0); |
ysr@777 | 2101 | } |
brutisso@3812 | 2102 | |
brutisso@3812 | 2103 | void TraceGen0TimeData::record_start_collection(double time_to_stop_the_world_ms) { |
brutisso@3812 | 2104 | if(TraceGen0Time) { |
brutisso@3812 | 2105 | _all_stop_world_times_ms.add(time_to_stop_the_world_ms); |
brutisso@3812 | 2106 | } |
brutisso@3812 | 2107 | } |
brutisso@3812 | 2108 | |
brutisso@3812 | 2109 | void TraceGen0TimeData::record_yield_time(double yield_time_ms) { |
brutisso@3812 | 2110 | if(TraceGen0Time) { |
brutisso@3812 | 2111 | _all_yield_times_ms.add(yield_time_ms); |
brutisso@3812 | 2112 | } |
brutisso@3812 | 2113 | } |
brutisso@3812 | 2114 | |
brutisso@3923 | 2115 | void TraceGen0TimeData::record_end_collection(double pause_time_ms, G1GCPhaseTimes* phase_times) { |
brutisso@3812 | 2116 | if(TraceGen0Time) { |
brutisso@3923 | 2117 | _total.add(pause_time_ms); |
brutisso@3923 | 2118 | _other.add(pause_time_ms - phase_times->accounted_time_ms()); |
brutisso@4015 | 2119 | _root_region_scan_wait.add(phase_times->root_region_scan_wait_time_ms()); |
brutisso@4015 | 2120 | _parallel.add(phase_times->cur_collection_par_time_ms()); |
brutisso@4015 | 2121 | _ext_root_scan.add(phase_times->average_last_ext_root_scan_time()); |
brutisso@4015 | 2122 | _satb_filtering.add(phase_times->average_last_satb_filtering_times_ms()); |
brutisso@4015 | 2123 | _update_rs.add(phase_times->average_last_update_rs_time()); |
brutisso@4015 | 2124 | _scan_rs.add(phase_times->average_last_scan_rs_time()); |
brutisso@4015 | 2125 | _obj_copy.add(phase_times->average_last_obj_copy_time()); |
brutisso@4015 | 2126 | _termination.add(phase_times->average_last_termination_time()); |
brutisso@3923 | 2127 | |
brutisso@4015 | 2128 | double parallel_known_time = phase_times->average_last_ext_root_scan_time() + |
brutisso@4015 | 2129 | phase_times->average_last_satb_filtering_times_ms() + |
brutisso@4015 | 2130 | phase_times->average_last_update_rs_time() + |
brutisso@4015 | 2131 | phase_times->average_last_scan_rs_time() + |
brutisso@4015 | 2132 | phase_times->average_last_obj_copy_time() + |
brutisso@4015 | 2133 | + phase_times->average_last_termination_time(); |
brutisso@3923 | 2134 | |
brutisso@4015 | 2135 | double parallel_other_time = phase_times->cur_collection_par_time_ms() - parallel_known_time; |
brutisso@3923 | 2136 | _parallel_other.add(parallel_other_time); |
brutisso@4015 | 2137 | _clear_ct.add(phase_times->cur_clear_ct_time_ms()); |
brutisso@3812 | 2138 | } |
brutisso@3812 | 2139 | } |
brutisso@3812 | 2140 | |
brutisso@3812 | 2141 | void TraceGen0TimeData::increment_young_collection_count() { |
brutisso@3812 | 2142 | if(TraceGen0Time) { |
brutisso@3812 | 2143 | ++_young_pause_num; |
brutisso@3812 | 2144 | } |
brutisso@3812 | 2145 | } |
brutisso@3812 | 2146 | |
brutisso@3812 | 2147 | void TraceGen0TimeData::increment_mixed_collection_count() { |
brutisso@3812 | 2148 | if(TraceGen0Time) { |
brutisso@3812 | 2149 | ++_mixed_pause_num; |
brutisso@3812 | 2150 | } |
brutisso@3812 | 2151 | } |
brutisso@3812 | 2152 | |
brutisso@3923 | 2153 | void TraceGen0TimeData::print_summary(const char* str, |
brutisso@3812 | 2154 | const NumberSeq* seq) const { |
brutisso@3812 | 2155 | double sum = seq->sum(); |
brutisso@3923 | 2156 | gclog_or_tty->print_cr("%-27s = %8.2lf s (avg = %8.2lf ms)", |
brutisso@3812 | 2157 | str, sum / 1000.0, seq->avg()); |
brutisso@3812 | 2158 | } |
brutisso@3812 | 2159 | |
brutisso@3923 | 2160 | void TraceGen0TimeData::print_summary_sd(const char* str, |
brutisso@3812 | 2161 | const NumberSeq* seq) const { |
brutisso@3923 | 2162 | print_summary(str, seq); |
brutisso@3923 | 2163 | gclog_or_tty->print_cr("%+45s = %5d, std dev = %8.2lf ms, max = %8.2lf ms)", |
brutisso@3923 | 2164 | "(num", seq->num(), seq->sd(), seq->maximum()); |
brutisso@3812 | 2165 | } |
brutisso@3812 | 2166 | |
brutisso@3812 | 2167 | void TraceGen0TimeData::print() const { |
brutisso@3812 | 2168 | if (!TraceGen0Time) { |
brutisso@3812 | 2169 | return; |
brutisso@3812 | 2170 | } |
brutisso@3812 | 2171 | |
brutisso@3812 | 2172 | gclog_or_tty->print_cr("ALL PAUSES"); |
brutisso@3923 | 2173 | print_summary_sd(" Total", &_total); |
brutisso@3812 | 2174 | gclog_or_tty->print_cr(""); |
brutisso@3812 | 2175 | gclog_or_tty->print_cr(""); |
brutisso@3812 | 2176 | gclog_or_tty->print_cr(" Young GC Pauses: %8d", _young_pause_num); |
brutisso@3812 | 2177 | gclog_or_tty->print_cr(" Mixed GC Pauses: %8d", _mixed_pause_num); |
brutisso@3812 | 2178 | gclog_or_tty->print_cr(""); |
brutisso@3812 | 2179 | |
brutisso@3812 | 2180 | gclog_or_tty->print_cr("EVACUATION PAUSES"); |
brutisso@3812 | 2181 | |
brutisso@3812 | 2182 | if (_young_pause_num == 0 && _mixed_pause_num == 0) { |
brutisso@3812 | 2183 | gclog_or_tty->print_cr("none"); |
brutisso@3812 | 2184 | } else { |
brutisso@3923 | 2185 | print_summary_sd(" Evacuation Pauses", &_total); |
brutisso@3923 | 2186 | print_summary(" Root Region Scan Wait", &_root_region_scan_wait); |
brutisso@3923 | 2187 | print_summary(" Parallel Time", &_parallel); |
brutisso@3923 | 2188 | print_summary(" Ext Root Scanning", &_ext_root_scan); |
brutisso@3923 | 2189 | print_summary(" SATB Filtering", &_satb_filtering); |
brutisso@3923 | 2190 | print_summary(" Update RS", &_update_rs); |
brutisso@3923 | 2191 | print_summary(" Scan RS", &_scan_rs); |
brutisso@3923 | 2192 | print_summary(" Object Copy", &_obj_copy); |
brutisso@3923 | 2193 | print_summary(" Termination", &_termination); |
brutisso@3923 | 2194 | print_summary(" Parallel Other", &_parallel_other); |
brutisso@3923 | 2195 | print_summary(" Clear CT", &_clear_ct); |
brutisso@3923 | 2196 | print_summary(" Other", &_other); |
brutisso@3812 | 2197 | } |
brutisso@3812 | 2198 | gclog_or_tty->print_cr(""); |
brutisso@3812 | 2199 | |
brutisso@3812 | 2200 | gclog_or_tty->print_cr("MISC"); |
brutisso@3923 | 2201 | print_summary_sd(" Stop World", &_all_stop_world_times_ms); |
brutisso@3923 | 2202 | print_summary_sd(" Yields", &_all_yield_times_ms); |
brutisso@3812 | 2203 | } |
brutisso@3812 | 2204 | |
brutisso@3812 | 2205 | void TraceGen1TimeData::record_full_collection(double full_gc_time_ms) { |
brutisso@3812 | 2206 | if (TraceGen1Time) { |
brutisso@3812 | 2207 | _all_full_gc_times.add(full_gc_time_ms); |
brutisso@3812 | 2208 | } |
brutisso@3812 | 2209 | } |
brutisso@3812 | 2210 | |
brutisso@3812 | 2211 | void TraceGen1TimeData::print() const { |
brutisso@3812 | 2212 | if (!TraceGen1Time) { |
brutisso@3812 | 2213 | return; |
brutisso@3812 | 2214 | } |
brutisso@3812 | 2215 | |
brutisso@3812 | 2216 | if (_all_full_gc_times.num() > 0) { |
brutisso@3812 | 2217 | gclog_or_tty->print("\n%4d full_gcs: total time = %8.2f s", |
brutisso@3812 | 2218 | _all_full_gc_times.num(), |
brutisso@3812 | 2219 | _all_full_gc_times.sum() / 1000.0); |
brutisso@3812 | 2220 | gclog_or_tty->print_cr(" (avg = %8.2fms).", _all_full_gc_times.avg()); |
brutisso@3812 | 2221 | gclog_or_tty->print_cr(" [std. dev = %8.2f ms, max = %8.2f ms]", |
brutisso@3812 | 2222 | _all_full_gc_times.sd(), |
brutisso@3812 | 2223 | _all_full_gc_times.maximum()); |
brutisso@3812 | 2224 | } |
brutisso@3812 | 2225 | } |