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