author | lkorinth |
Tue, 03 Apr 2018 12:05:49 +0200 | |
changeset 49659 | 0ed1370f52bb |
parent 49643 | a3453bbd5418 |
child 49664 | 9a04cc89dde0 |
permissions | -rw-r--r-- |
38076 | 1 |
/* |
49375 | 2 |
* Copyright (c) 2001, 2018, Oracle and/or its affiliates. All rights reserved. |
38076 | 3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 |
* |
|
5 |
* This code is free software; you can redistribute it and/or modify it |
|
6 |
* under the terms of the GNU General Public License version 2 only, as |
|
7 |
* published by the Free Software Foundation. |
|
8 |
* |
|
9 |
* This code is distributed in the hope that it will be useful, but WITHOUT |
|
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that |
|
13 |
* accompanied this code). |
|
14 |
* |
|
15 |
* You should have received a copy of the GNU General Public License version |
|
16 |
* 2 along with this work; if not, write to the Free Software Foundation, |
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
|
18 |
* |
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
20 |
* or visit www.oracle.com if you need additional information or have any |
|
21 |
* questions. |
|
22 |
* |
|
23 |
*/ |
|
24 |
||
25 |
#include "precompiled.hpp" |
|
26 |
#include "gc/g1/g1Analytics.hpp" |
|
27 |
#include "gc/g1/g1CollectedHeap.inline.hpp" |
|
28 |
#include "gc/g1/g1CollectionSet.hpp" |
|
29 |
#include "gc/g1/g1ConcurrentMark.hpp" |
|
49659
0ed1370f52bb
8200371: In g1, rename ConcurrentMarkThread to G1ConcurrentMarkThread
lkorinth
parents:
49643
diff
changeset
|
30 |
#include "gc/g1/g1ConcurrentMarkThread.inline.hpp" |
47789
a77a7d3bc4f6
8149127: Rename g1/concurrentMarkThread.* to g1/g1ConcurrentMarkThread.*
tschatzl
parents:
47681
diff
changeset
|
31 |
#include "gc/g1/g1ConcurrentRefine.hpp" |
38172
90f405aac699
8155524: HotCardCache shouldn't be part of ConcurrentG1Refine
kbarrett
parents:
38162
diff
changeset
|
32 |
#include "gc/g1/g1HotCardCache.hpp" |
38076 | 33 |
#include "gc/g1/g1IHOPControl.hpp" |
34 |
#include "gc/g1/g1GCPhaseTimes.hpp" |
|
35 |
#include "gc/g1/g1Policy.hpp" |
|
38186
ccaa890f8617
8155943: Move G1Eden/SurvivorRegions into their own source files
mgerdin
parents:
38185
diff
changeset
|
36 |
#include "gc/g1/g1SurvivorRegions.hpp" |
38076 | 37 |
#include "gc/g1/g1YoungGenSizer.hpp" |
38 |
#include "gc/g1/heapRegion.inline.hpp" |
|
39 |
#include "gc/g1/heapRegionRemSet.hpp" |
|
40 |
#include "gc/shared/gcPolicyCounters.hpp" |
|
38183
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
41 |
#include "logging/logStream.hpp" |
38076 | 42 |
#include "runtime/arguments.hpp" |
43 |
#include "runtime/java.hpp" |
|
44 |
#include "runtime/mutexLocker.hpp" |
|
45 |
#include "utilities/debug.hpp" |
|
38162
4e2c3433a3ae
8150393: Maintain the set of survivor regions in an array between GCs
mgerdin
parents:
38107
diff
changeset
|
46 |
#include "utilities/growableArray.hpp" |
38076 | 47 |
#include "utilities/pair.hpp" |
48 |
||
49375 | 49 |
G1Policy::G1Policy(STWGCTimer* gc_timer) : |
38076 | 50 |
_predictor(G1ConfidencePercent / 100.0), |
51 |
_analytics(new G1Analytics(&_predictor)), |
|
49607
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
52 |
_remset_tracker(), |
38076 | 53 |
_mmu_tracker(new G1MMUTrackerQueue(GCPauseIntervalMillis / 1000.0, MaxGCPauseMillis / 1000.0)), |
54 |
_ihop_control(create_ihop_control(&_predictor)), |
|
48117
d64722b0b371
8080345: With perm gen gone, perfdata counter sun.gc.policy.generations should be 2, not 3
ehelin
parents:
47789
diff
changeset
|
55 |
_policy_counters(new GCPolicyCounters("GarbageFirst", 1, 2)), |
38076 | 56 |
_young_list_fixed_length(0), |
38185
c432f8466c73
8155634: Clean out old logging and dead code from SurvRateGroup
mgerdin
parents:
38183
diff
changeset
|
57 |
_short_lived_surv_rate_group(new SurvRateGroup()), |
c432f8466c73
8155634: Clean out old logging and dead code from SurvRateGroup
mgerdin
parents:
38183
diff
changeset
|
58 |
_survivor_surv_rate_group(new SurvRateGroup()), |
38076 | 59 |
_reserve_factor((double) G1ReservePercent / 100.0), |
60 |
_reserve_regions(0), |
|
61 |
_rs_lengths_prediction(0), |
|
62 |
_bytes_allocated_in_old_since_last_gc(0), |
|
63 |
_initial_mark_to_mixed(), |
|
64 |
_collection_set(NULL), |
|
65 |
_g1(NULL), |
|
46795
623a5e42deb6
8173335: Improve logging for j.l.ref.reference processing
sangheki
parents:
41284
diff
changeset
|
66 |
_phase_times(new G1GCPhaseTimes(gc_timer, ParallelGCThreads)), |
38076 | 67 |
_tenuring_threshold(MaxTenuringThreshold), |
68 |
_max_survivor_regions(0), |
|
41284
b4276ec89d0d
8164482: [REDO] G1 does not implement millis_since_last_gc which is needed by RMI GC
jprovino
parents:
40914
diff
changeset
|
69 |
_survivors_age_table(true), |
49607
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
70 |
_collection_pause_end_millis(os::javaTimeNanos() / NANOSECS_PER_MILLISEC) { |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
71 |
} |
38076 | 72 |
|
49375 | 73 |
G1Policy::~G1Policy() { |
38076 | 74 |
delete _ihop_control; |
75 |
} |
|
76 |
||
49375 | 77 |
G1CollectorState* G1Policy::collector_state() const { return _g1->collector_state(); } |
38076 | 78 |
|
49375 | 79 |
void G1Policy::init(G1CollectedHeap* g1h, G1CollectionSet* collection_set) { |
38076 | 80 |
_g1 = g1h; |
81 |
_collection_set = collection_set; |
|
82 |
||
83 |
assert(Heap_lock->owned_by_self(), "Locking discipline."); |
|
84 |
||
85 |
if (!adaptive_young_list_length()) { |
|
86 |
_young_list_fixed_length = _young_gen_sizer.min_desired_young_length(); |
|
87 |
} |
|
88 |
_young_gen_sizer.adjust_max_new_size(_g1->max_regions()); |
|
89 |
||
90 |
_free_regions_at_end_of_collection = _g1->num_free_regions(); |
|
91 |
||
92 |
update_young_list_max_and_target_length(); |
|
93 |
// We may immediately start allocating regions and placing them on the |
|
94 |
// collection set list. Initialize the per-collection set info |
|
95 |
_collection_set->start_incremental_building(); |
|
96 |
} |
|
97 |
||
49375 | 98 |
void G1Policy::note_gc_start() { |
38076 | 99 |
phase_times()->note_gc_start(); |
100 |
} |
|
101 |
||
49392
2956d0ece7a9
8199282: Remove ValueObj class for allocation subclassing for gc code
coleenp
parents:
49375
diff
changeset
|
102 |
class G1YoungLengthPredictor { |
40000 | 103 |
const bool _during_cm; |
104 |
const double _base_time_ms; |
|
105 |
const double _base_free_regions; |
|
106 |
const double _target_pause_time_ms; |
|
49375 | 107 |
const G1Policy* const _policy; |
38076 | 108 |
|
40000 | 109 |
public: |
110 |
G1YoungLengthPredictor(bool during_cm, |
|
111 |
double base_time_ms, |
|
112 |
double base_free_regions, |
|
113 |
double target_pause_time_ms, |
|
49375 | 114 |
const G1Policy* policy) : |
40000 | 115 |
_during_cm(during_cm), |
116 |
_base_time_ms(base_time_ms), |
|
117 |
_base_free_regions(base_free_regions), |
|
118 |
_target_pause_time_ms(target_pause_time_ms), |
|
119 |
_policy(policy) {} |
|
120 |
||
121 |
bool will_fit(uint young_length) const { |
|
122 |
if (young_length >= _base_free_regions) { |
|
123 |
// end condition 1: not enough space for the young regions |
|
124 |
return false; |
|
125 |
} |
|
38076 | 126 |
|
40000 | 127 |
const double accum_surv_rate = _policy->accum_yg_surv_rate_pred((int) young_length - 1); |
128 |
const size_t bytes_to_copy = |
|
129 |
(size_t) (accum_surv_rate * (double) HeapRegion::GrainBytes); |
|
130 |
const double copy_time_ms = |
|
131 |
_policy->analytics()->predict_object_copy_time_ms(bytes_to_copy, _during_cm); |
|
132 |
const double young_other_time_ms = _policy->analytics()->predict_young_other_time_ms(young_length); |
|
133 |
const double pause_time_ms = _base_time_ms + copy_time_ms + young_other_time_ms; |
|
134 |
if (pause_time_ms > _target_pause_time_ms) { |
|
135 |
// end condition 2: prediction is over the target pause time |
|
136 |
return false; |
|
137 |
} |
|
138 |
||
139 |
const size_t free_bytes = (_base_free_regions - young_length) * HeapRegion::GrainBytes; |
|
38076 | 140 |
|
40000 | 141 |
// When copying, we will likely need more bytes free than is live in the region. |
142 |
// Add some safety margin to factor in the confidence of our guess, and the |
|
143 |
// natural expected waste. |
|
144 |
// (100.0 / G1ConfidencePercent) is a scale factor that expresses the uncertainty |
|
145 |
// of the calculation: the lower the confidence, the more headroom. |
|
146 |
// (100 + TargetPLABWastePct) represents the increase in expected bytes during |
|
147 |
// copying due to anticipated waste in the PLABs. |
|
148 |
const double safety_factor = (100.0 / G1ConfidencePercent) * (100 + TargetPLABWastePct) / 100.0; |
|
149 |
const size_t expected_bytes_to_copy = (size_t)(safety_factor * bytes_to_copy); |
|
38076 | 150 |
|
40000 | 151 |
if (expected_bytes_to_copy > free_bytes) { |
152 |
// end condition 3: out-of-space |
|
153 |
return false; |
|
154 |
} |
|
155 |
||
156 |
// success! |
|
157 |
return true; |
|
38076 | 158 |
} |
40000 | 159 |
}; |
38076 | 160 |
|
49375 | 161 |
void G1Policy::record_new_heap_size(uint new_number_of_regions) { |
38076 | 162 |
// re-calculate the necessary reserve |
163 |
double reserve_regions_d = (double) new_number_of_regions * _reserve_factor; |
|
164 |
// We use ceiling so that if reserve_regions_d is > 0.0 (but |
|
165 |
// smaller than 1.0) we'll get 1. |
|
166 |
_reserve_regions = (uint) ceil(reserve_regions_d); |
|
167 |
||
168 |
_young_gen_sizer.heap_size_changed(new_number_of_regions); |
|
169 |
||
170 |
_ihop_control->update_target_occupancy(new_number_of_regions * HeapRegion::GrainBytes); |
|
171 |
} |
|
172 |
||
49375 | 173 |
uint G1Policy::calculate_young_list_desired_min_length(uint base_min_length) const { |
38076 | 174 |
uint desired_min_length = 0; |
175 |
if (adaptive_young_list_length()) { |
|
176 |
if (_analytics->num_alloc_rate_ms() > 3) { |
|
177 |
double now_sec = os::elapsedTime(); |
|
178 |
double when_ms = _mmu_tracker->when_max_gc_sec(now_sec) * 1000.0; |
|
179 |
double alloc_rate_ms = _analytics->predict_alloc_rate_ms(); |
|
180 |
desired_min_length = (uint) ceil(alloc_rate_ms * when_ms); |
|
181 |
} else { |
|
182 |
// otherwise we don't have enough info to make the prediction |
|
183 |
} |
|
184 |
} |
|
185 |
desired_min_length += base_min_length; |
|
186 |
// make sure we don't go below any user-defined minimum bound |
|
187 |
return MAX2(_young_gen_sizer.min_desired_young_length(), desired_min_length); |
|
188 |
} |
|
189 |
||
49375 | 190 |
uint G1Policy::calculate_young_list_desired_max_length() const { |
38076 | 191 |
// Here, we might want to also take into account any additional |
192 |
// constraints (i.e., user-defined minimum bound). Currently, we |
|
193 |
// effectively don't set this bound. |
|
194 |
return _young_gen_sizer.max_desired_young_length(); |
|
195 |
} |
|
196 |
||
49375 | 197 |
uint G1Policy::update_young_list_max_and_target_length() { |
38076 | 198 |
return update_young_list_max_and_target_length(_analytics->predict_rs_lengths()); |
199 |
} |
|
200 |
||
49375 | 201 |
uint G1Policy::update_young_list_max_and_target_length(size_t rs_lengths) { |
38076 | 202 |
uint unbounded_target_length = update_young_list_target_length(rs_lengths); |
203 |
update_max_gc_locker_expansion(); |
|
204 |
return unbounded_target_length; |
|
205 |
} |
|
206 |
||
49375 | 207 |
uint G1Policy::update_young_list_target_length(size_t rs_lengths) { |
38076 | 208 |
YoungTargetLengths young_lengths = young_list_target_lengths(rs_lengths); |
209 |
_young_list_target_length = young_lengths.first; |
|
210 |
return young_lengths.second; |
|
211 |
} |
|
212 |
||
49375 | 213 |
G1Policy::YoungTargetLengths G1Policy::young_list_target_lengths(size_t rs_lengths) const { |
38076 | 214 |
YoungTargetLengths result; |
215 |
||
216 |
// Calculate the absolute and desired min bounds first. |
|
217 |
||
218 |
// This is how many young regions we already have (currently: the survivors). |
|
38183
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
219 |
const uint base_min_length = _g1->survivor_regions_count(); |
38076 | 220 |
uint desired_min_length = calculate_young_list_desired_min_length(base_min_length); |
221 |
// This is the absolute minimum young length. Ensure that we |
|
222 |
// will at least have one eden region available for allocation. |
|
38183
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
223 |
uint absolute_min_length = base_min_length + MAX2(_g1->eden_regions_count(), (uint)1); |
38076 | 224 |
// If we shrank the young list target it should not shrink below the current size. |
225 |
desired_min_length = MAX2(desired_min_length, absolute_min_length); |
|
226 |
// Calculate the absolute and desired max bounds. |
|
227 |
||
228 |
uint desired_max_length = calculate_young_list_desired_max_length(); |
|
229 |
||
230 |
uint young_list_target_length = 0; |
|
231 |
if (adaptive_young_list_length()) { |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
232 |
if (collector_state()->in_young_only_phase()) { |
38076 | 233 |
young_list_target_length = |
234 |
calculate_young_list_target_length(rs_lengths, |
|
235 |
base_min_length, |
|
236 |
desired_min_length, |
|
237 |
desired_max_length); |
|
238 |
} else { |
|
239 |
// Don't calculate anything and let the code below bound it to |
|
240 |
// the desired_min_length, i.e., do the next GC as soon as |
|
241 |
// possible to maximize how many old regions we can add to it. |
|
242 |
} |
|
243 |
} else { |
|
244 |
// The user asked for a fixed young gen so we'll fix the young gen |
|
245 |
// whether the next GC is young or mixed. |
|
246 |
young_list_target_length = _young_list_fixed_length; |
|
247 |
} |
|
248 |
||
249 |
result.second = young_list_target_length; |
|
250 |
||
251 |
// We will try our best not to "eat" into the reserve. |
|
252 |
uint absolute_max_length = 0; |
|
253 |
if (_free_regions_at_end_of_collection > _reserve_regions) { |
|
254 |
absolute_max_length = _free_regions_at_end_of_collection - _reserve_regions; |
|
255 |
} |
|
256 |
if (desired_max_length > absolute_max_length) { |
|
257 |
desired_max_length = absolute_max_length; |
|
258 |
} |
|
259 |
||
260 |
// Make sure we don't go over the desired max length, nor under the |
|
261 |
// desired min length. In case they clash, desired_min_length wins |
|
262 |
// which is why that test is second. |
|
263 |
if (young_list_target_length > desired_max_length) { |
|
264 |
young_list_target_length = desired_max_length; |
|
265 |
} |
|
266 |
if (young_list_target_length < desired_min_length) { |
|
267 |
young_list_target_length = desired_min_length; |
|
268 |
} |
|
269 |
||
270 |
assert(young_list_target_length > base_min_length, |
|
271 |
"we should be able to allocate at least one eden region"); |
|
272 |
assert(young_list_target_length >= absolute_min_length, "post-condition"); |
|
273 |
||
274 |
result.first = young_list_target_length; |
|
275 |
return result; |
|
276 |
} |
|
277 |
||
278 |
uint |
|
49375 | 279 |
G1Policy::calculate_young_list_target_length(size_t rs_lengths, |
38076 | 280 |
uint base_min_length, |
281 |
uint desired_min_length, |
|
282 |
uint desired_max_length) const { |
|
283 |
assert(adaptive_young_list_length(), "pre-condition"); |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
284 |
assert(collector_state()->in_young_only_phase(), "only call this for young GCs"); |
38076 | 285 |
|
286 |
// In case some edge-condition makes the desired max length too small... |
|
287 |
if (desired_max_length <= desired_min_length) { |
|
288 |
return desired_min_length; |
|
289 |
} |
|
290 |
||
291 |
// We'll adjust min_young_length and max_young_length not to include |
|
292 |
// the already allocated young regions (i.e., so they reflect the |
|
293 |
// min and max eden regions we'll allocate). The base_min_length |
|
294 |
// will be reflected in the predictions by the |
|
295 |
// survivor_regions_evac_time prediction. |
|
296 |
assert(desired_min_length > base_min_length, "invariant"); |
|
297 |
uint min_young_length = desired_min_length - base_min_length; |
|
298 |
assert(desired_max_length > base_min_length, "invariant"); |
|
299 |
uint max_young_length = desired_max_length - base_min_length; |
|
300 |
||
40000 | 301 |
const double target_pause_time_ms = _mmu_tracker->max_gc_time() * 1000.0; |
302 |
const double survivor_regions_evac_time = predict_survivor_regions_evac_time(); |
|
303 |
const size_t pending_cards = _analytics->predict_pending_cards(); |
|
304 |
const size_t adj_rs_lengths = rs_lengths + _analytics->predict_rs_length_diff(); |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
305 |
const size_t scanned_cards = _analytics->predict_card_num(adj_rs_lengths, true /* for_young_gc */); |
40000 | 306 |
const double base_time_ms = |
38076 | 307 |
predict_base_elapsed_time_ms(pending_cards, scanned_cards) + |
308 |
survivor_regions_evac_time; |
|
40000 | 309 |
const uint available_free_regions = _free_regions_at_end_of_collection; |
310 |
const uint base_free_regions = |
|
311 |
available_free_regions > _reserve_regions ? available_free_regions - _reserve_regions : 0; |
|
38076 | 312 |
|
313 |
// Here, we will make sure that the shortest young length that |
|
314 |
// makes sense fits within the target pause time. |
|
315 |
||
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
316 |
G1YoungLengthPredictor p(collector_state()->mark_or_rebuild_in_progress(), |
40000 | 317 |
base_time_ms, |
318 |
base_free_regions, |
|
319 |
target_pause_time_ms, |
|
320 |
this); |
|
321 |
if (p.will_fit(min_young_length)) { |
|
38076 | 322 |
// The shortest young length will fit into the target pause time; |
323 |
// we'll now check whether the absolute maximum number of young |
|
324 |
// regions will fit in the target pause time. If not, we'll do |
|
325 |
// a binary search between min_young_length and max_young_length. |
|
40000 | 326 |
if (p.will_fit(max_young_length)) { |
38076 | 327 |
// The maximum young length will fit into the target pause time. |
328 |
// We are done so set min young length to the maximum length (as |
|
329 |
// the result is assumed to be returned in min_young_length). |
|
330 |
min_young_length = max_young_length; |
|
331 |
} else { |
|
332 |
// The maximum possible number of young regions will not fit within |
|
333 |
// the target pause time so we'll search for the optimal |
|
334 |
// length. The loop invariants are: |
|
335 |
// |
|
336 |
// min_young_length < max_young_length |
|
337 |
// min_young_length is known to fit into the target pause time |
|
338 |
// max_young_length is known not to fit into the target pause time |
|
339 |
// |
|
340 |
// Going into the loop we know the above hold as we've just |
|
341 |
// checked them. Every time around the loop we check whether |
|
342 |
// the middle value between min_young_length and |
|
343 |
// max_young_length fits into the target pause time. If it |
|
344 |
// does, it becomes the new min. If it doesn't, it becomes |
|
345 |
// the new max. This way we maintain the loop invariants. |
|
346 |
||
347 |
assert(min_young_length < max_young_length, "invariant"); |
|
348 |
uint diff = (max_young_length - min_young_length) / 2; |
|
349 |
while (diff > 0) { |
|
350 |
uint young_length = min_young_length + diff; |
|
40000 | 351 |
if (p.will_fit(young_length)) { |
38076 | 352 |
min_young_length = young_length; |
353 |
} else { |
|
354 |
max_young_length = young_length; |
|
355 |
} |
|
356 |
assert(min_young_length < max_young_length, "invariant"); |
|
357 |
diff = (max_young_length - min_young_length) / 2; |
|
358 |
} |
|
359 |
// The results is min_young_length which, according to the |
|
360 |
// loop invariants, should fit within the target pause time. |
|
361 |
||
362 |
// These are the post-conditions of the binary search above: |
|
363 |
assert(min_young_length < max_young_length, |
|
364 |
"otherwise we should have discovered that max_young_length " |
|
365 |
"fits into the pause target and not done the binary search"); |
|
40000 | 366 |
assert(p.will_fit(min_young_length), |
38076 | 367 |
"min_young_length, the result of the binary search, should " |
368 |
"fit into the pause target"); |
|
40000 | 369 |
assert(!p.will_fit(min_young_length + 1), |
38076 | 370 |
"min_young_length, the result of the binary search, should be " |
371 |
"optimal, so no larger length should fit into the pause target"); |
|
372 |
} |
|
373 |
} else { |
|
374 |
// Even the minimum length doesn't fit into the pause time |
|
375 |
// target, return it as the result nevertheless. |
|
376 |
} |
|
377 |
return base_min_length + min_young_length; |
|
378 |
} |
|
379 |
||
49375 | 380 |
double G1Policy::predict_survivor_regions_evac_time() const { |
38076 | 381 |
double survivor_regions_evac_time = 0.0; |
38183
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
382 |
const GrowableArray<HeapRegion*>* survivor_regions = _g1->survivor()->regions(); |
38162
4e2c3433a3ae
8150393: Maintain the set of survivor regions in an array between GCs
mgerdin
parents:
38107
diff
changeset
|
383 |
|
4e2c3433a3ae
8150393: Maintain the set of survivor regions in an array between GCs
mgerdin
parents:
38107
diff
changeset
|
384 |
for (GrowableArrayIterator<HeapRegion*> it = survivor_regions->begin(); |
4e2c3433a3ae
8150393: Maintain the set of survivor regions in an array between GCs
mgerdin
parents:
38107
diff
changeset
|
385 |
it != survivor_regions->end(); |
4e2c3433a3ae
8150393: Maintain the set of survivor regions in an array between GCs
mgerdin
parents:
38107
diff
changeset
|
386 |
++it) { |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
387 |
survivor_regions_evac_time += predict_region_elapsed_time_ms(*it, collector_state()->in_young_only_phase()); |
38076 | 388 |
} |
389 |
return survivor_regions_evac_time; |
|
390 |
} |
|
391 |
||
49375 | 392 |
void G1Policy::revise_young_list_target_length_if_necessary(size_t rs_lengths) { |
38076 | 393 |
guarantee( adaptive_young_list_length(), "should not call this otherwise" ); |
394 |
||
395 |
if (rs_lengths > _rs_lengths_prediction) { |
|
396 |
// add 10% to avoid having to recalculate often |
|
397 |
size_t rs_lengths_prediction = rs_lengths * 1100 / 1000; |
|
398 |
update_rs_lengths_prediction(rs_lengths_prediction); |
|
399 |
||
400 |
update_young_list_max_and_target_length(rs_lengths_prediction); |
|
401 |
} |
|
402 |
} |
|
403 |
||
49375 | 404 |
void G1Policy::update_rs_lengths_prediction() { |
38076 | 405 |
update_rs_lengths_prediction(_analytics->predict_rs_lengths()); |
406 |
} |
|
407 |
||
49375 | 408 |
void G1Policy::update_rs_lengths_prediction(size_t prediction) { |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
409 |
if (collector_state()->in_young_only_phase() && adaptive_young_list_length()) { |
38076 | 410 |
_rs_lengths_prediction = prediction; |
411 |
} |
|
412 |
} |
|
413 |
||
49375 | 414 |
void G1Policy::record_full_collection_start() { |
38076 | 415 |
_full_collection_start_sec = os::elapsedTime(); |
416 |
// Release the future to-space so that it is available for compaction into. |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
417 |
collector_state()->set_in_young_only_phase(false); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
418 |
collector_state()->set_in_full_gc(true); |
49607
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
419 |
cset_chooser()->clear(); |
38076 | 420 |
} |
421 |
||
49375 | 422 |
void G1Policy::record_full_collection_end() { |
38076 | 423 |
// Consider this like a collection pause for the purposes of allocation |
424 |
// since last pause. |
|
425 |
double end_sec = os::elapsedTime(); |
|
426 |
double full_gc_time_sec = end_sec - _full_collection_start_sec; |
|
427 |
double full_gc_time_ms = full_gc_time_sec * 1000.0; |
|
428 |
||
429 |
_analytics->update_recent_gc_times(end_sec, full_gc_time_ms); |
|
430 |
||
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
431 |
collector_state()->set_in_full_gc(false); |
38076 | 432 |
|
433 |
// "Nuke" the heuristics that control the young/mixed GC |
|
434 |
// transitions and make sure we start with young GCs after the Full GC. |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
435 |
collector_state()->set_in_young_only_phase(true); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
436 |
collector_state()->set_in_young_gc_before_mixed(false); |
38076 | 437 |
collector_state()->set_initiate_conc_mark_if_possible(need_to_start_conc_mark("end of Full GC", 0)); |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
438 |
collector_state()->set_in_initial_mark_gc(false); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
439 |
collector_state()->set_mark_or_rebuild_in_progress(false); |
38076 | 440 |
|
441 |
_short_lived_surv_rate_group->start_adding_regions(); |
|
442 |
// also call this on any additional surv rate groups |
|
443 |
||
444 |
_free_regions_at_end_of_collection = _g1->num_free_regions(); |
|
445 |
// Reset survivors SurvRateGroup. |
|
446 |
_survivor_surv_rate_group->reset(); |
|
447 |
update_young_list_max_and_target_length(); |
|
448 |
update_rs_lengths_prediction(); |
|
449 |
||
450 |
_bytes_allocated_in_old_since_last_gc = 0; |
|
451 |
||
452 |
record_pause(FullGC, _full_collection_start_sec, end_sec); |
|
453 |
} |
|
454 |
||
49375 | 455 |
void G1Policy::record_collection_pause_start(double start_time_sec) { |
38076 | 456 |
// We only need to do this here as the policy will only be applied |
457 |
// to the GC we're about to start. so, no point is calculating this |
|
458 |
// every time we calculate / recalculate the target young length. |
|
459 |
update_survivors_policy(); |
|
460 |
||
461 |
assert(_g1->used() == _g1->recalculate_used(), |
|
462 |
"sanity, used: " SIZE_FORMAT " recalculate_used: " SIZE_FORMAT, |
|
463 |
_g1->used(), _g1->recalculate_used()); |
|
464 |
||
465 |
phase_times()->record_cur_collection_start_sec(start_time_sec); |
|
466 |
_pending_cards = _g1->pending_card_num(); |
|
467 |
||
468 |
_collection_set->reset_bytes_used_before(); |
|
469 |
_bytes_copied_during_gc = 0; |
|
470 |
||
471 |
// do that for any other surv rate groups |
|
472 |
_short_lived_surv_rate_group->stop_adding_regions(); |
|
473 |
_survivors_age_table.clear(); |
|
474 |
||
39698
4016de4e596b
8159978: Use an array to store the collection set regions instead of linking through regions
tschatzl
parents:
38201
diff
changeset
|
475 |
assert(_g1->collection_set()->verify_young_ages(), "region age verification failed"); |
38076 | 476 |
} |
477 |
||
49375 | 478 |
void G1Policy::record_concurrent_mark_init_end(double mark_init_elapsed_time_ms) { |
38076 | 479 |
assert(!collector_state()->initiate_conc_mark_if_possible(), "we should have cleared it by now"); |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
480 |
collector_state()->set_in_initial_mark_gc(false); |
38076 | 481 |
} |
482 |
||
49375 | 483 |
void G1Policy::record_concurrent_mark_remark_start() { |
38076 | 484 |
_mark_remark_start_sec = os::elapsedTime(); |
485 |
} |
|
486 |
||
49375 | 487 |
void G1Policy::record_concurrent_mark_remark_end() { |
38076 | 488 |
double end_time_sec = os::elapsedTime(); |
489 |
double elapsed_time_ms = (end_time_sec - _mark_remark_start_sec)*1000.0; |
|
490 |
_analytics->report_concurrent_mark_remark_times_ms(elapsed_time_ms); |
|
491 |
_analytics->append_prev_collection_pause_end_ms(elapsed_time_ms); |
|
492 |
||
493 |
record_pause(Remark, _mark_remark_start_sec, end_time_sec); |
|
494 |
} |
|
495 |
||
49375 | 496 |
void G1Policy::record_concurrent_mark_cleanup_start() { |
38076 | 497 |
_mark_cleanup_start_sec = os::elapsedTime(); |
498 |
} |
|
499 |
||
49375 | 500 |
double G1Policy::average_time_ms(G1GCPhaseTimes::GCParPhases phase) const { |
38076 | 501 |
return phase_times()->average_time_ms(phase); |
502 |
} |
|
503 |
||
49375 | 504 |
double G1Policy::young_other_time_ms() const { |
38076 | 505 |
return phase_times()->young_cset_choice_time_ms() + |
39979 | 506 |
phase_times()->average_time_ms(G1GCPhaseTimes::YoungFreeCSet); |
38076 | 507 |
} |
508 |
||
49375 | 509 |
double G1Policy::non_young_other_time_ms() const { |
38076 | 510 |
return phase_times()->non_young_cset_choice_time_ms() + |
39979 | 511 |
phase_times()->average_time_ms(G1GCPhaseTimes::NonYoungFreeCSet); |
38076 | 512 |
} |
513 |
||
49375 | 514 |
double G1Policy::other_time_ms(double pause_time_ms) const { |
38107
aee6db99b6c7
8155087: Calculation in other_time_ms() is incorrect
sjohanss
parents:
38106
diff
changeset
|
515 |
return pause_time_ms - phase_times()->cur_collection_par_time_ms(); |
38076 | 516 |
} |
517 |
||
49375 | 518 |
double G1Policy::constant_other_time_ms(double pause_time_ms) const { |
39979 | 519 |
return other_time_ms(pause_time_ms) - phase_times()->total_free_cset_time_ms(); |
38076 | 520 |
} |
521 |
||
49375 | 522 |
CollectionSetChooser* G1Policy::cset_chooser() const { |
38076 | 523 |
return _collection_set->cset_chooser(); |
524 |
} |
|
525 |
||
49375 | 526 |
bool G1Policy::about_to_start_mixed_phase() const { |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
527 |
return _g1->concurrent_mark()->cm_thread()->during_cycle() || collector_state()->in_young_gc_before_mixed(); |
38076 | 528 |
} |
529 |
||
49375 | 530 |
bool G1Policy::need_to_start_conc_mark(const char* source, size_t alloc_word_size) { |
38076 | 531 |
if (about_to_start_mixed_phase()) { |
532 |
return false; |
|
533 |
} |
|
534 |
||
535 |
size_t marking_initiating_used_threshold = _ihop_control->get_conc_mark_start_threshold(); |
|
536 |
||
537 |
size_t cur_used_bytes = _g1->non_young_capacity_bytes(); |
|
538 |
size_t alloc_byte_size = alloc_word_size * HeapWordSize; |
|
539 |
size_t marking_request_bytes = cur_used_bytes + alloc_byte_size; |
|
540 |
||
541 |
bool result = false; |
|
542 |
if (marking_request_bytes > marking_initiating_used_threshold) { |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
543 |
result = collector_state()->in_young_only_phase() && !collector_state()->in_young_gc_before_mixed(); |
38076 | 544 |
log_debug(gc, ergo, ihop)("%s occupancy: " SIZE_FORMAT "B allocation request: " SIZE_FORMAT "B threshold: " SIZE_FORMAT "B (%1.2f) source: %s", |
545 |
result ? "Request concurrent cycle initiation (occupancy higher than threshold)" : "Do not request concurrent cycle initiation (still doing mixed collections)", |
|
546 |
cur_used_bytes, alloc_byte_size, marking_initiating_used_threshold, (double) marking_initiating_used_threshold / _g1->capacity() * 100, source); |
|
547 |
} |
|
548 |
||
549 |
return result; |
|
550 |
} |
|
551 |
||
552 |
// Anything below that is considered to be zero |
|
553 |
#define MIN_TIMER_GRANULARITY 0.0000001 |
|
554 |
||
49375 | 555 |
void G1Policy::record_collection_pause_end(double pause_time_ms, size_t cards_scanned, size_t heap_used_bytes_before_gc) { |
38076 | 556 |
double end_time_sec = os::elapsedTime(); |
557 |
||
558 |
size_t cur_used_bytes = _g1->used(); |
|
559 |
assert(cur_used_bytes == _g1->recalculate_used(), "It should!"); |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
560 |
bool this_pause_included_initial_mark = false; |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
561 |
bool this_pause_was_young_only = collector_state()->in_young_only_phase(); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
562 |
|
38076 | 563 |
bool update_stats = !_g1->evacuation_failed(); |
564 |
||
565 |
record_pause(young_gc_pause_kind(), end_time_sec - pause_time_ms / 1000.0, end_time_sec); |
|
566 |
||
41284
b4276ec89d0d
8164482: [REDO] G1 does not implement millis_since_last_gc which is needed by RMI GC
jprovino
parents:
40914
diff
changeset
|
567 |
_collection_pause_end_millis = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; |
b4276ec89d0d
8164482: [REDO] G1 does not implement millis_since_last_gc which is needed by RMI GC
jprovino
parents:
40914
diff
changeset
|
568 |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
569 |
this_pause_included_initial_mark = collector_state()->in_initial_mark_gc(); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
570 |
if (this_pause_included_initial_mark) { |
38076 | 571 |
record_concurrent_mark_init_end(0.0); |
572 |
} else { |
|
573 |
maybe_start_marking(); |
|
574 |
} |
|
575 |
||
576 |
double app_time_ms = (phase_times()->cur_collection_start_sec() * 1000.0 - _analytics->prev_collection_pause_end_ms()); |
|
577 |
if (app_time_ms < MIN_TIMER_GRANULARITY) { |
|
578 |
// This usually happens due to the timer not having the required |
|
579 |
// granularity. Some Linuxes are the usual culprits. |
|
580 |
// We'll just set it to something (arbitrarily) small. |
|
581 |
app_time_ms = 1.0; |
|
582 |
} |
|
583 |
||
584 |
if (update_stats) { |
|
585 |
// We maintain the invariant that all objects allocated by mutator |
|
586 |
// threads will be allocated out of eden regions. So, we can use |
|
587 |
// the eden region number allocated since the previous GC to |
|
588 |
// calculate the application's allocate rate. The only exception |
|
589 |
// to that is humongous objects that are allocated separately. But |
|
590 |
// given that humongous object allocations do not really affect |
|
591 |
// either the pause's duration nor when the next pause will take |
|
592 |
// place we can safely ignore them here. |
|
593 |
uint regions_allocated = _collection_set->eden_region_length(); |
|
594 |
double alloc_rate_ms = (double) regions_allocated / app_time_ms; |
|
595 |
_analytics->report_alloc_rate_ms(alloc_rate_ms); |
|
596 |
||
597 |
double interval_ms = |
|
40523
20873f6704de
8164124: [BACKOUT] G1 does not implement millis_since_last_gc which is needed by RMI GC
jwilhelm
parents:
40328
diff
changeset
|
598 |
(end_time_sec - _analytics->last_known_gc_end_time_sec()) * 1000.0; |
38076 | 599 |
_analytics->update_recent_gc_times(end_time_sec, pause_time_ms); |
600 |
_analytics->compute_pause_time_ratio(interval_ms, pause_time_ms); |
|
601 |
} |
|
602 |
||
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
603 |
if (collector_state()->in_young_gc_before_mixed()) { |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
604 |
assert(!this_pause_included_initial_mark, "The young GC before mixed is not allowed to be an initial mark GC"); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
605 |
// This has been the young GC before we start doing mixed GCs. We already |
49607
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
606 |
// decided to start mixed GCs much earlier, so there is nothing to do except |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
607 |
// advancing the state. |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
608 |
collector_state()->set_in_young_only_phase(false); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
609 |
collector_state()->set_in_young_gc_before_mixed(false); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
610 |
} else if (!this_pause_was_young_only) { |
49607
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
611 |
// This is a mixed GC. Here we decide whether to continue doing more |
38076 | 612 |
// mixed GCs or not. |
613 |
if (!next_gc_should_be_mixed("continue mixed GCs", |
|
614 |
"do not continue mixed GCs")) { |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
615 |
collector_state()->set_in_young_only_phase(true); |
38076 | 616 |
|
49607
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
617 |
clear_collection_set_candidates(); |
38076 | 618 |
maybe_start_marking(); |
619 |
} |
|
620 |
} |
|
621 |
||
622 |
_short_lived_surv_rate_group->start_adding_regions(); |
|
623 |
// Do that for any other surv rate groups |
|
624 |
||
38172
90f405aac699
8155524: HotCardCache shouldn't be part of ConcurrentG1Refine
kbarrett
parents:
38162
diff
changeset
|
625 |
double scan_hcc_time_ms = G1HotCardCache::default_use_cache() ? average_time_ms(G1GCPhaseTimes::ScanHCC) : 0.0; |
38076 | 626 |
|
627 |
if (update_stats) { |
|
628 |
double cost_per_card_ms = 0.0; |
|
629 |
if (_pending_cards > 0) { |
|
630 |
cost_per_card_ms = (average_time_ms(G1GCPhaseTimes::UpdateRS) - scan_hcc_time_ms) / (double) _pending_cards; |
|
631 |
_analytics->report_cost_per_card_ms(cost_per_card_ms); |
|
632 |
} |
|
633 |
_analytics->report_cost_scan_hcc(scan_hcc_time_ms); |
|
634 |
||
635 |
double cost_per_entry_ms = 0.0; |
|
636 |
if (cards_scanned > 10) { |
|
637 |
cost_per_entry_ms = average_time_ms(G1GCPhaseTimes::ScanRS) / (double) cards_scanned; |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
638 |
_analytics->report_cost_per_entry_ms(cost_per_entry_ms, this_pause_was_young_only); |
38076 | 639 |
} |
640 |
||
641 |
if (_max_rs_lengths > 0) { |
|
642 |
double cards_per_entry_ratio = |
|
643 |
(double) cards_scanned / (double) _max_rs_lengths; |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
644 |
_analytics->report_cards_per_entry_ratio(cards_per_entry_ratio, this_pause_was_young_only); |
38076 | 645 |
} |
646 |
||
647 |
// This is defensive. For a while _max_rs_lengths could get |
|
648 |
// smaller than _recorded_rs_lengths which was causing |
|
649 |
// rs_length_diff to get very large and mess up the RSet length |
|
650 |
// predictions. The reason was unsafe concurrent updates to the |
|
651 |
// _inc_cset_recorded_rs_lengths field which the code below guards |
|
652 |
// against (see CR 7118202). This bug has now been fixed (see CR |
|
653 |
// 7119027). However, I'm still worried that |
|
654 |
// _inc_cset_recorded_rs_lengths might still end up somewhat |
|
655 |
// inaccurate. The concurrent refinement thread calculates an |
|
656 |
// RSet's length concurrently with other CR threads updating it |
|
657 |
// which might cause it to calculate the length incorrectly (if, |
|
658 |
// say, it's in mid-coarsening). So I'll leave in the defensive |
|
659 |
// conditional below just in case. |
|
660 |
size_t rs_length_diff = 0; |
|
661 |
size_t recorded_rs_lengths = _collection_set->recorded_rs_lengths(); |
|
662 |
if (_max_rs_lengths > recorded_rs_lengths) { |
|
663 |
rs_length_diff = _max_rs_lengths - recorded_rs_lengths; |
|
664 |
} |
|
665 |
_analytics->report_rs_length_diff((double) rs_length_diff); |
|
666 |
||
667 |
size_t freed_bytes = heap_used_bytes_before_gc - cur_used_bytes; |
|
668 |
size_t copied_bytes = _collection_set->bytes_used_before() - freed_bytes; |
|
669 |
double cost_per_byte_ms = 0.0; |
|
670 |
||
671 |
if (copied_bytes > 0) { |
|
672 |
cost_per_byte_ms = average_time_ms(G1GCPhaseTimes::ObjCopy) / (double) copied_bytes; |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
673 |
_analytics->report_cost_per_byte_ms(cost_per_byte_ms, collector_state()->mark_or_rebuild_in_progress()); |
38076 | 674 |
} |
675 |
||
676 |
if (_collection_set->young_region_length() > 0) { |
|
677 |
_analytics->report_young_other_cost_per_region_ms(young_other_time_ms() / |
|
678 |
_collection_set->young_region_length()); |
|
679 |
} |
|
680 |
||
681 |
if (_collection_set->old_region_length() > 0) { |
|
682 |
_analytics->report_non_young_other_cost_per_region_ms(non_young_other_time_ms() / |
|
683 |
_collection_set->old_region_length()); |
|
684 |
} |
|
685 |
||
686 |
_analytics->report_constant_other_time_ms(constant_other_time_ms(pause_time_ms)); |
|
687 |
||
688 |
_analytics->report_pending_cards((double) _pending_cards); |
|
689 |
_analytics->report_rs_lengths((double) _max_rs_lengths); |
|
690 |
} |
|
691 |
||
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
692 |
assert(!(this_pause_included_initial_mark && collector_state()->mark_or_rebuild_in_progress()), |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
693 |
"If the last pause has been an initial mark, we should not have been in the marking window"); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
694 |
if (this_pause_included_initial_mark) { |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
695 |
collector_state()->set_mark_or_rebuild_in_progress(true); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
696 |
} |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
697 |
|
38076 | 698 |
_free_regions_at_end_of_collection = _g1->num_free_regions(); |
699 |
// IHOP control wants to know the expected young gen length if it were not |
|
700 |
// restrained by the heap reserve. Using the actual length would make the |
|
701 |
// prediction too small and the limit the young gen every time we get to the |
|
702 |
// predicted target occupancy. |
|
703 |
size_t last_unrestrained_young_length = update_young_list_max_and_target_length(); |
|
704 |
update_rs_lengths_prediction(); |
|
705 |
||
706 |
update_ihop_prediction(app_time_ms / 1000.0, |
|
707 |
_bytes_allocated_in_old_since_last_gc, |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
708 |
last_unrestrained_young_length * HeapRegion::GrainBytes, |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
709 |
this_pause_was_young_only); |
38076 | 710 |
_bytes_allocated_in_old_since_last_gc = 0; |
711 |
||
712 |
_ihop_control->send_trace_event(_g1->gc_tracer_stw()); |
|
713 |
||
714 |
// Note that _mmu_tracker->max_gc_time() returns the time in seconds. |
|
715 |
double update_rs_time_goal_ms = _mmu_tracker->max_gc_time() * MILLIUNITS * G1RSetUpdatingPauseTimePercent / 100.0; |
|
716 |
||
717 |
if (update_rs_time_goal_ms < scan_hcc_time_ms) { |
|
718 |
log_debug(gc, ergo, refine)("Adjust concurrent refinement thresholds (scanning the HCC expected to take longer than Update RS time goal)." |
|
719 |
"Update RS time goal: %1.2fms Scan HCC time: %1.2fms", |
|
720 |
update_rs_time_goal_ms, scan_hcc_time_ms); |
|
721 |
||
722 |
update_rs_time_goal_ms = 0; |
|
723 |
} else { |
|
724 |
update_rs_time_goal_ms -= scan_hcc_time_ms; |
|
725 |
} |
|
47789
a77a7d3bc4f6
8149127: Rename g1/concurrentMarkThread.* to g1/g1ConcurrentMarkThread.*
tschatzl
parents:
47681
diff
changeset
|
726 |
_g1->concurrent_refine()->adjust(average_time_ms(G1GCPhaseTimes::UpdateRS) - scan_hcc_time_ms, |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
727 |
phase_times()->sum_thread_work_items(G1GCPhaseTimes::UpdateRS), |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
728 |
update_rs_time_goal_ms); |
38076 | 729 |
|
730 |
cset_chooser()->verify(); |
|
731 |
} |
|
732 |
||
49375 | 733 |
G1IHOPControl* G1Policy::create_ihop_control(const G1Predictions* predictor){ |
38076 | 734 |
if (G1UseAdaptiveIHOP) { |
735 |
return new G1AdaptiveIHOPControl(InitiatingHeapOccupancyPercent, |
|
736 |
predictor, |
|
737 |
G1ReservePercent, |
|
738 |
G1HeapWastePercent); |
|
739 |
} else { |
|
740 |
return new G1StaticIHOPControl(InitiatingHeapOccupancyPercent); |
|
741 |
} |
|
742 |
} |
|
743 |
||
49375 | 744 |
void G1Policy::update_ihop_prediction(double mutator_time_s, |
38076 | 745 |
size_t mutator_alloc_bytes, |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
746 |
size_t young_gen_size, |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
747 |
bool this_gc_was_young_only) { |
38076 | 748 |
// Always try to update IHOP prediction. Even evacuation failures give information |
749 |
// about e.g. whether to start IHOP earlier next time. |
|
750 |
||
751 |
// Avoid using really small application times that might create samples with |
|
752 |
// very high or very low values. They may be caused by e.g. back-to-back gcs. |
|
753 |
double const min_valid_time = 1e-6; |
|
754 |
||
755 |
bool report = false; |
|
756 |
||
757 |
double marking_to_mixed_time = -1.0; |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
758 |
if (!this_gc_was_young_only && _initial_mark_to_mixed.has_result()) { |
38076 | 759 |
marking_to_mixed_time = _initial_mark_to_mixed.last_marking_time(); |
760 |
assert(marking_to_mixed_time > 0.0, |
|
761 |
"Initial mark to mixed time must be larger than zero but is %.3f", |
|
762 |
marking_to_mixed_time); |
|
763 |
if (marking_to_mixed_time > min_valid_time) { |
|
764 |
_ihop_control->update_marking_length(marking_to_mixed_time); |
|
765 |
report = true; |
|
766 |
} |
|
767 |
} |
|
768 |
||
769 |
// As an approximation for the young gc promotion rates during marking we use |
|
770 |
// all of them. In many applications there are only a few if any young gcs during |
|
771 |
// marking, which makes any prediction useless. This increases the accuracy of the |
|
772 |
// prediction. |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
773 |
if (this_gc_was_young_only && mutator_time_s > min_valid_time) { |
38076 | 774 |
_ihop_control->update_allocation_info(mutator_time_s, mutator_alloc_bytes, young_gen_size); |
775 |
report = true; |
|
776 |
} |
|
777 |
||
778 |
if (report) { |
|
779 |
report_ihop_statistics(); |
|
780 |
} |
|
781 |
} |
|
782 |
||
49375 | 783 |
void G1Policy::report_ihop_statistics() { |
38076 | 784 |
_ihop_control->print(); |
785 |
} |
|
786 |
||
49375 | 787 |
void G1Policy::print_phases() { |
38076 | 788 |
phase_times()->print(); |
789 |
} |
|
790 |
||
49375 | 791 |
double G1Policy::predict_yg_surv_rate(int age, SurvRateGroup* surv_rate_group) const { |
38076 | 792 |
TruncatedSeq* seq = surv_rate_group->get_seq(age); |
793 |
guarantee(seq->num() > 0, "There should be some young gen survivor samples available. Tried to access with age %d", age); |
|
794 |
double pred = _predictor.get_new_prediction(seq); |
|
795 |
if (pred > 1.0) { |
|
796 |
pred = 1.0; |
|
797 |
} |
|
798 |
return pred; |
|
799 |
} |
|
800 |
||
49375 | 801 |
double G1Policy::accum_yg_surv_rate_pred(int age) const { |
38076 | 802 |
return _short_lived_surv_rate_group->accum_surv_rate_pred(age); |
803 |
} |
|
804 |
||
49375 | 805 |
double G1Policy::predict_base_elapsed_time_ms(size_t pending_cards, |
38076 | 806 |
size_t scanned_cards) const { |
807 |
return |
|
808 |
_analytics->predict_rs_update_time_ms(pending_cards) + |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
809 |
_analytics->predict_rs_scan_time_ms(scanned_cards, collector_state()->in_young_only_phase()) + |
38076 | 810 |
_analytics->predict_constant_other_time_ms(); |
811 |
} |
|
812 |
||
49375 | 813 |
double G1Policy::predict_base_elapsed_time_ms(size_t pending_cards) const { |
38076 | 814 |
size_t rs_length = _analytics->predict_rs_lengths() + _analytics->predict_rs_length_diff(); |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
815 |
size_t card_num = _analytics->predict_card_num(rs_length, collector_state()->in_young_only_phase()); |
38076 | 816 |
return predict_base_elapsed_time_ms(pending_cards, card_num); |
817 |
} |
|
818 |
||
49375 | 819 |
size_t G1Policy::predict_bytes_to_copy(HeapRegion* hr) const { |
38076 | 820 |
size_t bytes_to_copy; |
821 |
if (hr->is_marked()) |
|
822 |
bytes_to_copy = hr->max_live_bytes(); |
|
823 |
else { |
|
824 |
assert(hr->is_young() && hr->age_in_surv_rate_group() != -1, "invariant"); |
|
825 |
int age = hr->age_in_surv_rate_group(); |
|
826 |
double yg_surv_rate = predict_yg_surv_rate(age, hr->surv_rate_group()); |
|
827 |
bytes_to_copy = (size_t) (hr->used() * yg_surv_rate); |
|
828 |
} |
|
829 |
return bytes_to_copy; |
|
830 |
} |
|
831 |
||
49375 | 832 |
double G1Policy::predict_region_elapsed_time_ms(HeapRegion* hr, |
38076 | 833 |
bool for_young_gc) const { |
834 |
size_t rs_length = hr->rem_set()->occupied(); |
|
835 |
// Predicting the number of cards is based on which type of GC |
|
836 |
// we're predicting for. |
|
837 |
size_t card_num = _analytics->predict_card_num(rs_length, for_young_gc); |
|
838 |
size_t bytes_to_copy = predict_bytes_to_copy(hr); |
|
839 |
||
840 |
double region_elapsed_time_ms = |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
841 |
_analytics->predict_rs_scan_time_ms(card_num, collector_state()->in_young_only_phase()) + |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
842 |
_analytics->predict_object_copy_time_ms(bytes_to_copy, collector_state()->mark_or_rebuild_in_progress()); |
38076 | 843 |
|
844 |
// The prediction of the "other" time for this region is based |
|
845 |
// upon the region type and NOT the GC type. |
|
846 |
if (hr->is_young()) { |
|
847 |
region_elapsed_time_ms += _analytics->predict_young_other_time_ms(1); |
|
848 |
} else { |
|
849 |
region_elapsed_time_ms += _analytics->predict_non_young_other_time_ms(1); |
|
850 |
} |
|
851 |
return region_elapsed_time_ms; |
|
852 |
} |
|
853 |
||
49375 | 854 |
bool G1Policy::should_allocate_mutator_region() const { |
38183
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
855 |
uint young_list_length = _g1->young_regions_count(); |
38076 | 856 |
uint young_list_target_length = _young_list_target_length; |
38106 | 857 |
return young_list_length < young_list_target_length; |
38076 | 858 |
} |
859 |
||
49375 | 860 |
bool G1Policy::can_expand_young_list() const { |
38183
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
861 |
uint young_list_length = _g1->young_regions_count(); |
38076 | 862 |
uint young_list_max_length = _young_list_max_length; |
863 |
return young_list_length < young_list_max_length; |
|
864 |
} |
|
865 |
||
49375 | 866 |
bool G1Policy::adaptive_young_list_length() const { |
38076 | 867 |
return _young_gen_sizer.adaptive_young_list_length(); |
868 |
} |
|
869 |
||
49375 | 870 |
size_t G1Policy::desired_survivor_size() const { |
40914
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
871 |
size_t const survivor_capacity = HeapRegion::GrainWords * _max_survivor_regions; |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
872 |
return (size_t)((((double)survivor_capacity) * TargetSurvivorRatio) / 100); |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
873 |
} |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
874 |
|
49375 | 875 |
void G1Policy::print_age_table() { |
40914
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
876 |
_survivors_age_table.print_age_table(_tenuring_threshold); |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
877 |
} |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
878 |
|
49375 | 879 |
void G1Policy::update_max_gc_locker_expansion() { |
38076 | 880 |
uint expansion_region_num = 0; |
881 |
if (GCLockerEdenExpansionPercent > 0) { |
|
882 |
double perc = (double) GCLockerEdenExpansionPercent / 100.0; |
|
883 |
double expansion_region_num_d = perc * (double) _young_list_target_length; |
|
884 |
// We use ceiling so that if expansion_region_num_d is > 0.0 (but |
|
885 |
// less than 1.0) we'll get 1. |
|
886 |
expansion_region_num = (uint) ceil(expansion_region_num_d); |
|
887 |
} else { |
|
888 |
assert(expansion_region_num == 0, "sanity"); |
|
889 |
} |
|
890 |
_young_list_max_length = _young_list_target_length + expansion_region_num; |
|
891 |
assert(_young_list_target_length <= _young_list_max_length, "post-condition"); |
|
892 |
} |
|
893 |
||
894 |
// Calculates survivor space parameters. |
|
49375 | 895 |
void G1Policy::update_survivors_policy() { |
38076 | 896 |
double max_survivor_regions_d = |
897 |
(double) _young_list_target_length / (double) SurvivorRatio; |
|
898 |
// We use ceiling so that if max_survivor_regions_d is > 0.0 (but |
|
899 |
// smaller than 1.0) we'll get 1. |
|
900 |
_max_survivor_regions = (uint) ceil(max_survivor_regions_d); |
|
901 |
||
40914
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
902 |
_tenuring_threshold = _survivors_age_table.compute_tenuring_threshold(desired_survivor_size()); |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
903 |
if (UsePerfData) { |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
904 |
_policy_counters->tenuring_threshold()->set_value(_tenuring_threshold); |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
905 |
_policy_counters->desired_survivor_size()->set_value(desired_survivor_size() * oopSize); |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
40523
diff
changeset
|
906 |
} |
38076 | 907 |
} |
908 |
||
49375 | 909 |
bool G1Policy::force_initial_mark_if_outside_cycle(GCCause::Cause gc_cause) { |
38076 | 910 |
// We actually check whether we are marking here and not if we are in a |
911 |
// reclamation phase. This means that we will schedule a concurrent mark |
|
912 |
// even while we are still in the process of reclaiming memory. |
|
47678 | 913 |
bool during_cycle = _g1->concurrent_mark()->cm_thread()->during_cycle(); |
38076 | 914 |
if (!during_cycle) { |
915 |
log_debug(gc, ergo)("Request concurrent cycle initiation (requested by GC cause). GC cause: %s", GCCause::to_string(gc_cause)); |
|
916 |
collector_state()->set_initiate_conc_mark_if_possible(true); |
|
917 |
return true; |
|
918 |
} else { |
|
919 |
log_debug(gc, ergo)("Do not request concurrent cycle initiation (concurrent cycle already in progress). GC cause: %s", GCCause::to_string(gc_cause)); |
|
920 |
return false; |
|
921 |
} |
|
922 |
} |
|
923 |
||
49375 | 924 |
void G1Policy::initiate_conc_mark() { |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
925 |
collector_state()->set_in_initial_mark_gc(true); |
38076 | 926 |
collector_state()->set_initiate_conc_mark_if_possible(false); |
927 |
} |
|
928 |
||
49375 | 929 |
void G1Policy::decide_on_conc_mark_initiation() { |
38076 | 930 |
// We are about to decide on whether this pause will be an |
931 |
// initial-mark pause. |
|
932 |
||
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
933 |
// First, collector_state()->in_initial_mark_gc() should not be already set. We |
38076 | 934 |
// will set it here if we have to. However, it should be cleared by |
935 |
// the end of the pause (it's only set for the duration of an |
|
936 |
// initial-mark pause). |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
937 |
assert(!collector_state()->in_initial_mark_gc(), "pre-condition"); |
38076 | 938 |
|
939 |
if (collector_state()->initiate_conc_mark_if_possible()) { |
|
940 |
// We had noticed on a previous pause that the heap occupancy has |
|
941 |
// gone over the initiating threshold and we should start a |
|
942 |
// concurrent marking cycle. So we might initiate one. |
|
943 |
||
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
944 |
if (!about_to_start_mixed_phase() && collector_state()->in_young_only_phase()) { |
38076 | 945 |
// Initiate a new initial mark if there is no marking or reclamation going on. |
946 |
initiate_conc_mark(); |
|
947 |
log_debug(gc, ergo)("Initiate concurrent cycle (concurrent cycle initiation requested)"); |
|
948 |
} else if (_g1->is_user_requested_concurrent_full_gc(_g1->gc_cause())) { |
|
949 |
// Initiate a user requested initial mark. An initial mark must be young only |
|
950 |
// GC, so the collector state must be updated to reflect this. |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
951 |
collector_state()->set_in_young_only_phase(true); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
952 |
collector_state()->set_in_young_gc_before_mixed(false); |
38076 | 953 |
|
49607
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
954 |
// We might have ended up coming here about to start a mixed phase with a collection set |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
955 |
// active. The following remark might change the change the "evacuation efficiency" of |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
956 |
// the regions in this set, leading to failing asserts later. |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
957 |
// Since the concurrent cycle will recreate the collection set anyway, simply drop it here. |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
958 |
clear_collection_set_candidates(); |
38076 | 959 |
abort_time_to_mixed_tracking(); |
960 |
initiate_conc_mark(); |
|
961 |
log_debug(gc, ergo)("Initiate concurrent cycle (user requested concurrent cycle)"); |
|
962 |
} else { |
|
963 |
// The concurrent marking thread is still finishing up the |
|
964 |
// previous cycle. If we start one right now the two cycles |
|
965 |
// overlap. In particular, the concurrent marking thread might |
|
966 |
// be in the process of clearing the next marking bitmap (which |
|
967 |
// we will use for the next cycle if we start one). Starting a |
|
968 |
// cycle now will be bad given that parts of the marking |
|
969 |
// information might get cleared by the marking thread. And we |
|
970 |
// cannot wait for the marking thread to finish the cycle as it |
|
971 |
// periodically yields while clearing the next marking bitmap |
|
972 |
// and, if it's in a yield point, it's waiting for us to |
|
973 |
// finish. So, at this point we will not start a cycle and we'll |
|
974 |
// let the concurrent marking thread complete the last one. |
|
975 |
log_debug(gc, ergo)("Do not initiate concurrent cycle (concurrent cycle already in progress)"); |
|
976 |
} |
|
977 |
} |
|
978 |
} |
|
979 |
||
49375 | 980 |
void G1Policy::record_concurrent_mark_cleanup_end() { |
38076 | 981 |
cset_chooser()->rebuild(_g1->workers(), _g1->num_regions()); |
982 |
||
49607
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
983 |
bool mixed_gc_pending = next_gc_should_be_mixed("request mixed gcs", "request young-only gcs"); |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
984 |
if (!mixed_gc_pending) { |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
985 |
clear_collection_set_candidates(); |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
986 |
abort_time_to_mixed_tracking(); |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
987 |
} |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
988 |
collector_state()->set_in_young_gc_before_mixed(mixed_gc_pending); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
989 |
collector_state()->set_mark_or_rebuild_in_progress(false); |
49607
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
990 |
|
38076 | 991 |
double end_sec = os::elapsedTime(); |
992 |
double elapsed_time_ms = (end_sec - _mark_cleanup_start_sec) * 1000.0; |
|
993 |
_analytics->report_concurrent_mark_cleanup_times_ms(elapsed_time_ms); |
|
994 |
_analytics->append_prev_collection_pause_end_ms(elapsed_time_ms); |
|
995 |
||
996 |
record_pause(Cleanup, _mark_cleanup_start_sec, end_sec); |
|
997 |
} |
|
998 |
||
49375 | 999 |
double G1Policy::reclaimable_bytes_percent(size_t reclaimable_bytes) const { |
47679
4cfcb7be4984
8189666: Replace various inlined percentage calculations with global percent_of()
tschatzl
parents:
47678
diff
changeset
|
1000 |
return percent_of(reclaimable_bytes, _g1->capacity()); |
38076 | 1001 |
} |
1002 |
||
49607
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1003 |
class G1ClearCollectionSetCandidateRemSets : public HeapRegionClosure { |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1004 |
virtual bool do_heap_region(HeapRegion* r) { |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1005 |
r->rem_set()->clear_locked(true /* only_cardset */); |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1006 |
return false; |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1007 |
} |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1008 |
}; |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1009 |
|
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1010 |
void G1Policy::clear_collection_set_candidates() { |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1011 |
// Clear remembered sets of remaining candidate regions and the actual candidate |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1012 |
// list. |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1013 |
G1ClearCollectionSetCandidateRemSets cl; |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1014 |
cset_chooser()->iterate(&cl); |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1015 |
cset_chooser()->clear(); |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1016 |
} |
acffe6ff3ae7
8180415: Rebuild remembered sets during the concurrent cycle
tschatzl
parents:
49412
diff
changeset
|
1017 |
|
49375 | 1018 |
void G1Policy::maybe_start_marking() { |
38076 | 1019 |
if (need_to_start_conc_mark("end of GC")) { |
1020 |
// Note: this might have already been set, if during the last |
|
1021 |
// pause we decided to start a cycle but at the beginning of |
|
1022 |
// this pause we decided to postpone it. That's OK. |
|
1023 |
collector_state()->set_initiate_conc_mark_if_possible(true); |
|
1024 |
} |
|
1025 |
} |
|
1026 |
||
49375 | 1027 |
G1Policy::PauseKind G1Policy::young_gc_pause_kind() const { |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
1028 |
assert(!collector_state()->in_full_gc(), "must be"); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
1029 |
if (collector_state()->in_initial_mark_gc()) { |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
1030 |
assert(!collector_state()->in_young_gc_before_mixed(), "must be"); |
38076 | 1031 |
return InitialMarkGC; |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
1032 |
} else if (collector_state()->in_young_gc_before_mixed()) { |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
1033 |
assert(!collector_state()->in_initial_mark_gc(), "must be"); |
38076 | 1034 |
return LastYoungGC; |
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
1035 |
} else if (collector_state()->in_mixed_phase()) { |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
1036 |
assert(!collector_state()->in_initial_mark_gc(), "must be"); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
1037 |
assert(!collector_state()->in_young_gc_before_mixed(), "must be"); |
38076 | 1038 |
return MixedGC; |
1039 |
} else { |
|
49643
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
1040 |
assert(!collector_state()->in_initial_mark_gc(), "must be"); |
a3453bbd5418
8199742: Clean up state flags in G1CollectorState
tschatzl
parents:
49632
diff
changeset
|
1041 |
assert(!collector_state()->in_young_gc_before_mixed(), "must be"); |
38076 | 1042 |
return YoungOnlyGC; |
1043 |
} |
|
1044 |
} |
|
1045 |
||
49375 | 1046 |
void G1Policy::record_pause(PauseKind kind, double start, double end) { |
38076 | 1047 |
// Manage the MMU tracker. For some reason it ignores Full GCs. |
1048 |
if (kind != FullGC) { |
|
1049 |
_mmu_tracker->add_pause(start, end); |
|
1050 |
} |
|
1051 |
// Manage the mutator time tracking from initial mark to first mixed gc. |
|
1052 |
switch (kind) { |
|
1053 |
case FullGC: |
|
1054 |
abort_time_to_mixed_tracking(); |
|
1055 |
break; |
|
1056 |
case Cleanup: |
|
1057 |
case Remark: |
|
1058 |
case YoungOnlyGC: |
|
1059 |
case LastYoungGC: |
|
1060 |
_initial_mark_to_mixed.add_pause(end - start); |
|
1061 |
break; |
|
1062 |
case InitialMarkGC: |
|
1063 |
_initial_mark_to_mixed.record_initial_mark_end(end); |
|
1064 |
break; |
|
1065 |
case MixedGC: |
|
1066 |
_initial_mark_to_mixed.record_mixed_gc_start(start); |
|
1067 |
break; |
|
1068 |
default: |
|
1069 |
ShouldNotReachHere(); |
|
1070 |
} |
|
1071 |
} |
|
1072 |
||
49375 | 1073 |
void G1Policy::abort_time_to_mixed_tracking() { |
38076 | 1074 |
_initial_mark_to_mixed.reset(); |
1075 |
} |
|
1076 |
||
49375 | 1077 |
bool G1Policy::next_gc_should_be_mixed(const char* true_action_str, |
38076 | 1078 |
const char* false_action_str) const { |
1079 |
if (cset_chooser()->is_empty()) { |
|
1080 |
log_debug(gc, ergo)("%s (candidate old regions not available)", false_action_str); |
|
1081 |
return false; |
|
1082 |
} |
|
1083 |
||
1084 |
// Is the amount of uncollected reclaimable space above G1HeapWastePercent? |
|
1085 |
size_t reclaimable_bytes = cset_chooser()->remaining_reclaimable_bytes(); |
|
47681
149745044e48
8189729: Change _perc suffixes in identifiers to _percent
tschatzl
parents:
47679
diff
changeset
|
1086 |
double reclaimable_percent = reclaimable_bytes_percent(reclaimable_bytes); |
38076 | 1087 |
double threshold = (double) G1HeapWastePercent; |
47681
149745044e48
8189729: Change _perc suffixes in identifiers to _percent
tschatzl
parents:
47679
diff
changeset
|
1088 |
if (reclaimable_percent <= threshold) { |
38076 | 1089 |
log_debug(gc, ergo)("%s (reclaimable percentage not over threshold). candidate old regions: %u reclaimable: " SIZE_FORMAT " (%1.2f) threshold: " UINTX_FORMAT, |
47681
149745044e48
8189729: Change _perc suffixes in identifiers to _percent
tschatzl
parents:
47679
diff
changeset
|
1090 |
false_action_str, cset_chooser()->remaining_regions(), reclaimable_bytes, reclaimable_percent, G1HeapWastePercent); |
38076 | 1091 |
return false; |
1092 |
} |
|
1093 |
log_debug(gc, ergo)("%s (candidate old regions available). candidate old regions: %u reclaimable: " SIZE_FORMAT " (%1.2f) threshold: " UINTX_FORMAT, |
|
47681
149745044e48
8189729: Change _perc suffixes in identifiers to _percent
tschatzl
parents:
47679
diff
changeset
|
1094 |
true_action_str, cset_chooser()->remaining_regions(), reclaimable_bytes, reclaimable_percent, G1HeapWastePercent); |
38076 | 1095 |
return true; |
1096 |
} |
|
1097 |
||
49375 | 1098 |
uint G1Policy::calc_min_old_cset_length() const { |
38076 | 1099 |
// The min old CSet region bound is based on the maximum desired |
1100 |
// number of mixed GCs after a cycle. I.e., even if some old regions |
|
1101 |
// look expensive, we should add them to the CSet anyway to make |
|
1102 |
// sure we go through the available old regions in no more than the |
|
1103 |
// maximum desired number of mixed GCs. |
|
1104 |
// |
|
1105 |
// The calculation is based on the number of marked regions we added |
|
1106 |
// to the CSet chooser in the first place, not how many remain, so |
|
1107 |
// that the result is the same during all mixed GCs that follow a cycle. |
|
1108 |
||
1109 |
const size_t region_num = (size_t) cset_chooser()->length(); |
|
1110 |
const size_t gc_num = (size_t) MAX2(G1MixedGCCountTarget, (uintx) 1); |
|
1111 |
size_t result = region_num / gc_num; |
|
1112 |
// emulate ceiling |
|
1113 |
if (result * gc_num < region_num) { |
|
1114 |
result += 1; |
|
1115 |
} |
|
1116 |
return (uint) result; |
|
1117 |
} |
|
1118 |
||
49375 | 1119 |
uint G1Policy::calc_max_old_cset_length() const { |
38076 | 1120 |
// The max old CSet region bound is based on the threshold expressed |
1121 |
// as a percentage of the heap size. I.e., it should bound the |
|
1122 |
// number of old regions added to the CSet irrespective of how many |
|
1123 |
// of them are available. |
|
1124 |
||
1125 |
const G1CollectedHeap* g1h = G1CollectedHeap::heap(); |
|
1126 |
const size_t region_num = g1h->num_regions(); |
|
1127 |
const size_t perc = (size_t) G1OldCSetRegionThresholdPercent; |
|
1128 |
size_t result = region_num * perc / 100; |
|
1129 |
// emulate ceiling |
|
1130 |
if (100 * result < region_num * perc) { |
|
1131 |
result += 1; |
|
1132 |
} |
|
1133 |
return (uint) result; |
|
1134 |
} |
|
1135 |
||
49375 | 1136 |
void G1Policy::finalize_collection_set(double target_pause_time_ms, G1SurvivorRegions* survivor) { |
38183
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1137 |
double time_remaining_ms = _collection_set->finalize_young_part(target_pause_time_ms, survivor); |
38076 | 1138 |
_collection_set->finalize_old_part(time_remaining_ms); |
1139 |
} |
|
38183
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1140 |
|
49375 | 1141 |
void G1Policy::transfer_survivors_to_cset(const G1SurvivorRegions* survivors) { |
38183
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1142 |
|
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1143 |
// Add survivor regions to SurvRateGroup. |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1144 |
note_start_adding_survivor_regions(); |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1145 |
finished_recalculating_age_indexes(true /* is_survivors */); |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1146 |
|
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1147 |
HeapRegion* last = NULL; |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1148 |
for (GrowableArrayIterator<HeapRegion*> it = survivors->regions()->begin(); |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1149 |
it != survivors->regions()->end(); |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1150 |
++it) { |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1151 |
HeapRegion* curr = *it; |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1152 |
set_region_survivor(curr); |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1153 |
|
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1154 |
// The region is a non-empty survivor so let's add it to |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1155 |
// the incremental collection set for the next evacuation |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1156 |
// pause. |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1157 |
_collection_set->add_survivor_regions(curr); |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1158 |
|
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1159 |
last = curr; |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1160 |
} |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1161 |
note_stop_adding_survivor_regions(); |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1162 |
|
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1163 |
// Don't clear the survivor list handles until the start of |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1164 |
// the next evacuation pause - we need it in order to re-tag |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1165 |
// the survivor regions from this evacuation pause as 'young' |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1166 |
// at the start of the next. |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1167 |
|
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1168 |
finished_recalculating_age_indexes(false /* is_survivors */); |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38172
diff
changeset
|
1169 |
} |