1 /*
2 * Copyright (c) 2001, 2020, Oracle and/or its affiliates. All rights reserved.
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/g1Arguments.hpp"
28 #include "gc/g1/g1CollectedHeap.inline.hpp"
29 #include "gc/g1/g1CollectionSet.hpp"
30 #include "gc/g1/g1CollectionSetCandidates.hpp"
31 #include "gc/g1/g1ConcurrentMark.hpp"
32 #include "gc/g1/g1ConcurrentMarkThread.inline.hpp"
33 #include "gc/g1/g1ConcurrentRefine.hpp"
34 #include "gc/g1/g1ConcurrentRefineStats.hpp"
35 #include "gc/g1/g1CollectionSetChooser.hpp"
36 #include "gc/g1/g1HeterogeneousHeapPolicy.hpp"
37 #include "gc/g1/g1HotCardCache.hpp"
38 #include "gc/g1/g1IHOPControl.hpp"
39 #include "gc/g1/g1GCPhaseTimes.hpp"
40 #include "gc/g1/g1Policy.hpp"
41 #include "gc/g1/g1SurvivorRegions.hpp"
42 #include "gc/g1/g1YoungGenSizer.hpp"
43 #include "gc/g1/heapRegion.inline.hpp"
44 #include "gc/g1/heapRegionRemSet.hpp"
45 #include "gc/shared/concurrentGCBreakpoints.hpp"
46 #include "gc/shared/gcPolicyCounters.hpp"
47 #include "logging/log.hpp"
48 #include "runtime/arguments.hpp"
49 #include "runtime/java.hpp"
50 #include "runtime/mutexLocker.hpp"
51 #include "utilities/debug.hpp"
52 #include "utilities/growableArray.hpp"
53 #include "utilities/pair.hpp"
54
55 G1Policy::G1Policy(STWGCTimer* gc_timer) :
56 _predictor(G1ConfidencePercent / 100.0),
57 _analytics(new G1Analytics(&_predictor)),
58 _remset_tracker(),
59 _mmu_tracker(new G1MMUTrackerQueue(GCPauseIntervalMillis / 1000.0, MaxGCPauseMillis / 1000.0)),
60 _ihop_control(create_ihop_control(&_predictor)),
61 _policy_counters(new GCPolicyCounters("GarbageFirst", 1, 2)),
62 _full_collection_start_sec(0.0),
63 _collection_pause_end_millis(os::javaTimeNanos() / NANOSECS_PER_MILLISEC),
64 _young_list_target_length(0),
65 _young_list_fixed_length(0),
66 _young_list_max_length(0),
67 _eden_surv_rate_group(new G1SurvRateGroup()),
68 _survivor_surv_rate_group(new G1SurvRateGroup()),
69 _reserve_factor((double) G1ReservePercent / 100.0),
70 _reserve_regions(0),
71 _young_gen_sizer(G1YoungGenSizer::create_gen_sizer()),
72 _free_regions_at_end_of_collection(0),
73 _rs_length(0),
74 _rs_length_prediction(0),
75 _pending_cards_at_gc_start(0),
76 _old_gen_alloc_tracker(),
77 _concurrent_start_to_mixed(),
78 _collection_set(NULL),
79 _g1h(NULL),
80 _phase_times(new G1GCPhaseTimes(gc_timer, ParallelGCThreads)),
81 _mark_remark_start_sec(0),
82 _mark_cleanup_start_sec(0),
83 _tenuring_threshold(MaxTenuringThreshold),
84 _max_survivor_regions(0),
85 _survivors_age_table(true)
86 {
87 }
88
89 G1Policy::~G1Policy() {
90 delete _ihop_control;
91 delete _young_gen_sizer;
92 }
93
94 G1Policy* G1Policy::create_policy(STWGCTimer* gc_timer_stw) {
95 if (G1Arguments::is_heterogeneous_heap()) {
96 return new G1HeterogeneousHeapPolicy(gc_timer_stw);
97 } else {
98 return new G1Policy(gc_timer_stw);
99 }
100 }
101
102 G1CollectorState* G1Policy::collector_state() const { return _g1h->collector_state(); }
103
104 void G1Policy::init(G1CollectedHeap* g1h, G1CollectionSet* collection_set) {
105 _g1h = g1h;
106 _collection_set = collection_set;
107
108 assert(Heap_lock->owned_by_self(), "Locking discipline.");
109
110 if (!use_adaptive_young_list_length()) {
111 _young_list_fixed_length = _young_gen_sizer->min_desired_young_length();
112 }
113 _young_gen_sizer->adjust_max_new_size(_g1h->max_expandable_regions());
114
115 _free_regions_at_end_of_collection = _g1h->num_free_regions();
116
117 update_young_list_max_and_target_length();
118 // We may immediately start allocating regions and placing them on the
119 // collection set list. Initialize the per-collection set info
120 _collection_set->start_incremental_building();
121 }
122
123 void G1Policy::note_gc_start() {
124 phase_times()->note_gc_start();
125 }
126
127 class G1YoungLengthPredictor {
128 const double _base_time_ms;
129 const double _base_free_regions;
130 const double _target_pause_time_ms;
131 const G1Policy* const _policy;
132
133 public:
134 G1YoungLengthPredictor(double base_time_ms,
135 double base_free_regions,
136 double target_pause_time_ms,
137 const G1Policy* policy) :
138 _base_time_ms(base_time_ms),
139 _base_free_regions(base_free_regions),
140 _target_pause_time_ms(target_pause_time_ms),
141 _policy(policy) {}
142
143 bool will_fit(uint young_length) const {
144 if (young_length >= _base_free_regions) {
145 // end condition 1: not enough space for the young regions
146 return false;
147 }
148
149 size_t bytes_to_copy = 0;
150 const double copy_time_ms = _policy->predict_eden_copy_time_ms(young_length, &bytes_to_copy);
151 const double young_other_time_ms = _policy->analytics()->predict_young_other_time_ms(young_length);
152 const double pause_time_ms = _base_time_ms + copy_time_ms + young_other_time_ms;
153 if (pause_time_ms > _target_pause_time_ms) {
154 // end condition 2: prediction is over the target pause time
155 return false;
156 }
157
158 const size_t free_bytes = (_base_free_regions - young_length) * HeapRegion::GrainBytes;
159
160 // When copying, we will likely need more bytes free than is live in the region.
161 // Add some safety margin to factor in the confidence of our guess, and the
162 // natural expected waste.
163 // (100.0 / G1ConfidencePercent) is a scale factor that expresses the uncertainty
164 // of the calculation: the lower the confidence, the more headroom.
165 // (100 + TargetPLABWastePct) represents the increase in expected bytes during
166 // copying due to anticipated waste in the PLABs.
167 const double safety_factor = (100.0 / G1ConfidencePercent) * (100 + TargetPLABWastePct) / 100.0;
168 const size_t expected_bytes_to_copy = (size_t)(safety_factor * bytes_to_copy);
169
170 if (expected_bytes_to_copy > free_bytes) {
171 // end condition 3: out-of-space
172 return false;
173 }
174
175 // success!
176 return true;
177 }
178 };
179
180 void G1Policy::record_new_heap_size(uint new_number_of_regions) {
181 // re-calculate the necessary reserve
182 double reserve_regions_d = (double) new_number_of_regions * _reserve_factor;
183 // We use ceiling so that if reserve_regions_d is > 0.0 (but
184 // smaller than 1.0) we'll get 1.
185 _reserve_regions = (uint) ceil(reserve_regions_d);
186
187 _young_gen_sizer->heap_size_changed(new_number_of_regions);
188
189 _ihop_control->update_target_occupancy(new_number_of_regions * HeapRegion::GrainBytes);
190 }
191
192 uint G1Policy::calculate_young_list_desired_min_length(uint base_min_length) const {
193 uint desired_min_length = 0;
194 if (use_adaptive_young_list_length()) {
195 if (_analytics->num_alloc_rate_ms() > 3) {
196 double now_sec = os::elapsedTime();
197 double when_ms = _mmu_tracker->when_max_gc_sec(now_sec) * 1000.0;
198 double alloc_rate_ms = _analytics->predict_alloc_rate_ms();
199 desired_min_length = (uint) ceil(alloc_rate_ms * when_ms);
200 } else {
201 // otherwise we don't have enough info to make the prediction
202 }
203 }
204 desired_min_length += base_min_length;
205 // make sure we don't go below any user-defined minimum bound
206 return MAX2(_young_gen_sizer->min_desired_young_length(), desired_min_length);
207 }
208
209 uint G1Policy::calculate_young_list_desired_max_length() const {
210 // Here, we might want to also take into account any additional
211 // constraints (i.e., user-defined minimum bound). Currently, we
212 // effectively don't set this bound.
213 return _young_gen_sizer->max_desired_young_length();
214 }
215
216 uint G1Policy::update_young_list_max_and_target_length() {
217 return update_young_list_max_and_target_length(_analytics->predict_rs_length());
218 }
219
220 uint G1Policy::update_young_list_max_and_target_length(size_t rs_length) {
221 uint unbounded_target_length = update_young_list_target_length(rs_length);
222 update_max_gc_locker_expansion();
223 return unbounded_target_length;
224 }
225
226 uint G1Policy::update_young_list_target_length(size_t rs_length) {
227 YoungTargetLengths young_lengths = young_list_target_lengths(rs_length);
228 _young_list_target_length = young_lengths.first;
229
230 return young_lengths.second;
231 }
232
233 G1Policy::YoungTargetLengths G1Policy::young_list_target_lengths(size_t rs_length) const {
234 YoungTargetLengths result;
235
236 // Calculate the absolute and desired min bounds first.
237
238 // This is how many young regions we already have (currently: the survivors).
239 const uint base_min_length = _g1h->survivor_regions_count();
240 uint desired_min_length = calculate_young_list_desired_min_length(base_min_length);
241 // This is the absolute minimum young length. Ensure that we
242 // will at least have one eden region available for allocation.
243 uint absolute_min_length = base_min_length + MAX2(_g1h->eden_regions_count(), (uint)1);
244 // If we shrank the young list target it should not shrink below the current size.
245 desired_min_length = MAX2(desired_min_length, absolute_min_length);
246 // Calculate the absolute and desired max bounds.
247
248 uint desired_max_length = calculate_young_list_desired_max_length();
249
250 uint young_list_target_length = 0;
251 if (use_adaptive_young_list_length()) {
252 if (collector_state()->in_young_only_phase()) {
253 young_list_target_length =
254 calculate_young_list_target_length(rs_length,
255 base_min_length,
256 desired_min_length,
257 desired_max_length);
258 } else {
259 // Don't calculate anything and let the code below bound it to
260 // the desired_min_length, i.e., do the next GC as soon as
261 // possible to maximize how many old regions we can add to it.
262 }
263 } else {
264 // The user asked for a fixed young gen so we'll fix the young gen
265 // whether the next GC is young or mixed.
266 young_list_target_length = _young_list_fixed_length;
267 }
268
269 result.second = young_list_target_length;
270
271 // We will try our best not to "eat" into the reserve.
272 uint absolute_max_length = 0;
273 if (_free_regions_at_end_of_collection > _reserve_regions) {
274 absolute_max_length = _free_regions_at_end_of_collection - _reserve_regions;
275 }
276 if (desired_max_length > absolute_max_length) {
277 desired_max_length = absolute_max_length;
278 }
279
280 // Make sure we don't go over the desired max length, nor under the
281 // desired min length. In case they clash, desired_min_length wins
282 // which is why that test is second.
283 if (young_list_target_length > desired_max_length) {
284 young_list_target_length = desired_max_length;
285 }
286 if (young_list_target_length < desired_min_length) {
287 young_list_target_length = desired_min_length;
288 }
289
290 assert(young_list_target_length > base_min_length,
291 "we should be able to allocate at least one eden region");
292 assert(young_list_target_length >= absolute_min_length, "post-condition");
293
294 result.first = young_list_target_length;
295 return result;
296 }
297
298 uint G1Policy::calculate_young_list_target_length(size_t rs_length,
299 uint base_min_length,
300 uint desired_min_length,
301 uint desired_max_length) const {
302 assert(use_adaptive_young_list_length(), "pre-condition");
303 assert(collector_state()->in_young_only_phase(), "only call this for young GCs");
304
305 // In case some edge-condition makes the desired max length too small...
306 if (desired_max_length <= desired_min_length) {
307 return desired_min_length;
308 }
309
310 // We'll adjust min_young_length and max_young_length not to include
311 // the already allocated young regions (i.e., so they reflect the
312 // min and max eden regions we'll allocate). The base_min_length
313 // will be reflected in the predictions by the
314 // survivor_regions_evac_time prediction.
315 assert(desired_min_length > base_min_length, "invariant");
316 uint min_young_length = desired_min_length - base_min_length;
317 assert(desired_max_length > base_min_length, "invariant");
318 uint max_young_length = desired_max_length - base_min_length;
319
320 const double target_pause_time_ms = _mmu_tracker->max_gc_time() * 1000.0;
321 const size_t pending_cards = _analytics->predict_pending_cards();
322 const double base_time_ms = predict_base_elapsed_time_ms(pending_cards, rs_length);
323 const uint available_free_regions = _free_regions_at_end_of_collection;
324 const uint base_free_regions =
325 available_free_regions > _reserve_regions ? available_free_regions - _reserve_regions : 0;
326
327 // Here, we will make sure that the shortest young length that
328 // makes sense fits within the target pause time.
329
330 G1YoungLengthPredictor p(base_time_ms,
331 base_free_regions,
332 target_pause_time_ms,
333 this);
334 if (p.will_fit(min_young_length)) {
335 // The shortest young length will fit into the target pause time;
336 // we'll now check whether the absolute maximum number of young
337 // regions will fit in the target pause time. If not, we'll do
338 // a binary search between min_young_length and max_young_length.
339 if (p.will_fit(max_young_length)) {
340 // The maximum young length will fit into the target pause time.
341 // We are done so set min young length to the maximum length (as
342 // the result is assumed to be returned in min_young_length).
343 min_young_length = max_young_length;
344 } else {
345 // The maximum possible number of young regions will not fit within
346 // the target pause time so we'll search for the optimal
347 // length. The loop invariants are:
348 //
349 // min_young_length < max_young_length
350 // min_young_length is known to fit into the target pause time
351 // max_young_length is known not to fit into the target pause time
352 //
353 // Going into the loop we know the above hold as we've just
354 // checked them. Every time around the loop we check whether
355 // the middle value between min_young_length and
356 // max_young_length fits into the target pause time. If it
357 // does, it becomes the new min. If it doesn't, it becomes
358 // the new max. This way we maintain the loop invariants.
359
360 assert(min_young_length < max_young_length, "invariant");
361 uint diff = (max_young_length - min_young_length) / 2;
362 while (diff > 0) {
363 uint young_length = min_young_length + diff;
364 if (p.will_fit(young_length)) {
365 min_young_length = young_length;
366 } else {
367 max_young_length = young_length;
368 }
369 assert(min_young_length < max_young_length, "invariant");
370 diff = (max_young_length - min_young_length) / 2;
371 }
372 // The results is min_young_length which, according to the
373 // loop invariants, should fit within the target pause time.
374
375 // These are the post-conditions of the binary search above:
376 assert(min_young_length < max_young_length,
377 "otherwise we should have discovered that max_young_length "
378 "fits into the pause target and not done the binary search");
379 assert(p.will_fit(min_young_length),
380 "min_young_length, the result of the binary search, should "
381 "fit into the pause target");
382 assert(!p.will_fit(min_young_length + 1),
383 "min_young_length, the result of the binary search, should be "
384 "optimal, so no larger length should fit into the pause target");
385 }
386 } else {
387 // Even the minimum length doesn't fit into the pause time
388 // target, return it as the result nevertheless.
389 }
390 return base_min_length + min_young_length;
391 }
392
393 double G1Policy::predict_survivor_regions_evac_time() const {
394 double survivor_regions_evac_time = 0.0;
395 const GrowableArray<HeapRegion*>* survivor_regions = _g1h->survivor()->regions();
396 for (GrowableArrayIterator<HeapRegion*> it = survivor_regions->begin();
397 it != survivor_regions->end();
398 ++it) {
399 survivor_regions_evac_time += predict_region_total_time_ms(*it, collector_state()->in_young_only_phase());
400 }
401 return survivor_regions_evac_time;
402 }
403
404 void G1Policy::revise_young_list_target_length_if_necessary(size_t rs_length) {
405 guarantee(use_adaptive_young_list_length(), "should not call this otherwise" );
406
407 if (rs_length > _rs_length_prediction) {
408 // add 10% to avoid having to recalculate often
409 size_t rs_length_prediction = rs_length * 1100 / 1000;
410 update_rs_length_prediction(rs_length_prediction);
411
412 update_young_list_max_and_target_length(rs_length_prediction);
413 }
414 }
415
416 void G1Policy::update_rs_length_prediction() {
417 update_rs_length_prediction(_analytics->predict_rs_length());
418 }
419
420 void G1Policy::update_rs_length_prediction(size_t prediction) {
421 if (collector_state()->in_young_only_phase() && use_adaptive_young_list_length()) {
422 _rs_length_prediction = prediction;
423 }
424 }
425
426 void G1Policy::record_full_collection_start() {
427 _full_collection_start_sec = os::elapsedTime();
428 // Release the future to-space so that it is available for compaction into.
429 collector_state()->set_in_young_only_phase(false);
430 collector_state()->set_in_full_gc(true);
431 _collection_set->clear_candidates();
432 _pending_cards_at_gc_start = 0;
433 }
434
435 void G1Policy::record_full_collection_end() {
436 // Consider this like a collection pause for the purposes of allocation
437 // since last pause.
438 double end_sec = os::elapsedTime();
439 double full_gc_time_sec = end_sec - _full_collection_start_sec;
440 double full_gc_time_ms = full_gc_time_sec * 1000.0;
441
442 _analytics->update_recent_gc_times(end_sec, full_gc_time_ms);
443
444 collector_state()->set_in_full_gc(false);
445
446 // "Nuke" the heuristics that control the young/mixed GC
447 // transitions and make sure we start with young GCs after the Full GC.
448 collector_state()->set_in_young_only_phase(true);
449 collector_state()->set_in_young_gc_before_mixed(false);
450 collector_state()->set_initiate_conc_mark_if_possible(need_to_start_conc_mark("end of Full GC", 0));
451 collector_state()->set_in_concurrent_start_gc(false);
452 collector_state()->set_mark_or_rebuild_in_progress(false);
453 collector_state()->set_clearing_next_bitmap(false);
454
455 _eden_surv_rate_group->start_adding_regions();
456 // also call this on any additional surv rate groups
457
458 _free_regions_at_end_of_collection = _g1h->num_free_regions();
459 _survivor_surv_rate_group->reset();
460 update_young_list_max_and_target_length();
461 update_rs_length_prediction();
462
463 _old_gen_alloc_tracker.reset_after_full_gc();
464
465 record_pause(FullGC, _full_collection_start_sec, end_sec);
466 }
467
468 static void log_refinement_stats(const char* kind, const G1ConcurrentRefineStats& stats) {
469 log_debug(gc, refine, stats)
470 ("%s refinement: %.2fms, refined: " SIZE_FORMAT
471 ", precleaned: " SIZE_FORMAT ", dirtied: " SIZE_FORMAT,
472 kind,
473 stats.refinement_time().seconds() * MILLIUNITS,
474 stats.refined_cards(),
475 stats.precleaned_cards(),
476 stats.dirtied_cards());
477 }
478
479 void G1Policy::record_concurrent_refinement_stats() {
480 G1DirtyCardQueueSet& dcqs = G1BarrierSet::dirty_card_queue_set();
481 _pending_cards_at_gc_start = dcqs.num_cards();
482
483 // Collect per-thread stats, mostly from mutator activity.
484 G1ConcurrentRefineStats mut_stats = dcqs.get_and_reset_refinement_stats();
485
486 // Collect specialized concurrent refinement thread stats.
487 G1ConcurrentRefine* cr = _g1h->concurrent_refine();
488 G1ConcurrentRefineStats cr_stats = cr->get_and_reset_refinement_stats();
489
490 G1ConcurrentRefineStats total_stats = mut_stats + cr_stats;
491
492 log_refinement_stats("Mutator", mut_stats);
493 log_refinement_stats("Concurrent", cr_stats);
494 log_refinement_stats("Total", total_stats);
495
496 // Record the rate at which cards were refined.
497 // Don't update the rate if the current sample is empty or time is zero.
498 Tickspan refinement_time = total_stats.refinement_time();
499 size_t refined_cards = total_stats.refined_cards();
500 if ((refined_cards > 0) && (refinement_time > Tickspan())) {
501 double rate = refined_cards / (refinement_time.seconds() * MILLIUNITS);
502 _analytics->report_concurrent_refine_rate_ms(rate);
503 log_debug(gc, refine, stats)("Concurrent refinement rate: %.2f cards/ms", rate);
504 }
505
506 // Record mutator's card logging rate.
507 double mut_start_time = _analytics->prev_collection_pause_end_ms();
508 double mut_end_time = phase_times()->cur_collection_start_sec() * MILLIUNITS;
509 double mut_time = mut_end_time - mut_start_time;
510 // Unlike above for conc-refine rate, here we should not require a
511 // non-empty sample, since an application could go some time with only
512 // young-gen or filtered out writes. But we'll ignore unusually short
513 // sample periods, as they may just pollute the predictions.
514 if (mut_time > 1.0) { // Require > 1ms sample time.
515 double dirtied_rate = total_stats.dirtied_cards() / mut_time;
516 _analytics->report_dirtied_cards_rate_ms(dirtied_rate);
517 log_debug(gc, refine, stats)("Generate dirty cards rate: %.2f cards/ms", dirtied_rate);
518 }
519 }
520
521 void G1Policy::record_collection_pause_start(double start_time_sec) {
522 // We only need to do this here as the policy will only be applied
523 // to the GC we're about to start. so, no point is calculating this
524 // every time we calculate / recalculate the target young length.
525 update_survivors_policy();
526
527 assert(max_survivor_regions() + _g1h->num_used_regions() <= _g1h->max_regions(),
528 "Maximum survivor regions %u plus used regions %u exceeds max regions %u",
529 max_survivor_regions(), _g1h->num_used_regions(), _g1h->max_regions());
530 assert_used_and_recalculate_used_equal(_g1h);
531
532 phase_times()->record_cur_collection_start_sec(start_time_sec);
533
534 record_concurrent_refinement_stats();
535
536 _collection_set->reset_bytes_used_before();
537
538 // do that for any other surv rate groups
539 _eden_surv_rate_group->stop_adding_regions();
540 _survivors_age_table.clear();
541
542 assert(_g1h->collection_set()->verify_young_ages(), "region age verification failed");
543 }
544
545 void G1Policy::record_concurrent_mark_init_end(double mark_init_elapsed_time_ms) {
546 assert(!collector_state()->initiate_conc_mark_if_possible(), "we should have cleared it by now");
547 collector_state()->set_in_concurrent_start_gc(false);
548 }
549
550 void G1Policy::record_concurrent_mark_remark_start() {
551 _mark_remark_start_sec = os::elapsedTime();
552 }
553
554 void G1Policy::record_concurrent_mark_remark_end() {
555 double end_time_sec = os::elapsedTime();
556 double elapsed_time_ms = (end_time_sec - _mark_remark_start_sec)*1000.0;
557 _analytics->report_concurrent_mark_remark_times_ms(elapsed_time_ms);
558 _analytics->append_prev_collection_pause_end_ms(elapsed_time_ms);
559
560 record_pause(Remark, _mark_remark_start_sec, end_time_sec);
561 }
562
563 void G1Policy::record_concurrent_mark_cleanup_start() {
564 _mark_cleanup_start_sec = os::elapsedTime();
565 }
566
567 double G1Policy::average_time_ms(G1GCPhaseTimes::GCParPhases phase) const {
568 return phase_times()->average_time_ms(phase);
569 }
570
571 double G1Policy::young_other_time_ms() const {
572 return phase_times()->young_cset_choice_time_ms() +
573 phase_times()->average_time_ms(G1GCPhaseTimes::YoungFreeCSet);
574 }
575
576 double G1Policy::non_young_other_time_ms() const {
577 return phase_times()->non_young_cset_choice_time_ms() +
578 phase_times()->average_time_ms(G1GCPhaseTimes::NonYoungFreeCSet);
579 }
580
581 double G1Policy::other_time_ms(double pause_time_ms) const {
582 return pause_time_ms - phase_times()->cur_collection_par_time_ms();
583 }
584
585 double G1Policy::constant_other_time_ms(double pause_time_ms) const {
586 return other_time_ms(pause_time_ms) - phase_times()->total_free_cset_time_ms() - phase_times()->total_rebuild_freelist_time_ms();
587 }
588
589 bool G1Policy::about_to_start_mixed_phase() const {
590 return _g1h->concurrent_mark()->cm_thread()->during_cycle() || collector_state()->in_young_gc_before_mixed();
591 }
592
593 bool G1Policy::need_to_start_conc_mark(const char* source, size_t alloc_word_size) {
594 if (about_to_start_mixed_phase()) {
595 return false;
596 }
597
598 size_t marking_initiating_used_threshold = _ihop_control->get_conc_mark_start_threshold();
599
600 size_t cur_used_bytes = _g1h->non_young_capacity_bytes();
601 size_t alloc_byte_size = alloc_word_size * HeapWordSize;
602 size_t marking_request_bytes = cur_used_bytes + alloc_byte_size;
603
604 bool result = false;
605 if (marking_request_bytes > marking_initiating_used_threshold) {
606 result = collector_state()->in_young_only_phase() && !collector_state()->in_young_gc_before_mixed();
607 log_debug(gc, ergo, ihop)("%s occupancy: " SIZE_FORMAT "B allocation request: " SIZE_FORMAT "B threshold: " SIZE_FORMAT "B (%1.2f) source: %s",
608 result ? "Request concurrent cycle initiation (occupancy higher than threshold)" : "Do not request concurrent cycle initiation (still doing mixed collections)",
609 cur_used_bytes, alloc_byte_size, marking_initiating_used_threshold, (double) marking_initiating_used_threshold / _g1h->capacity() * 100, source);
610 }
611
612 return result;
613 }
614
615 double G1Policy::logged_cards_processing_time() const {
616 double all_cards_processing_time = average_time_ms(G1GCPhaseTimes::ScanHR) + average_time_ms(G1GCPhaseTimes::OptScanHR);
617 size_t logged_dirty_cards = phase_times()->sum_thread_work_items(G1GCPhaseTimes::MergeLB, G1GCPhaseTimes::MergeLBDirtyCards);
618 size_t scan_heap_roots_cards = phase_times()->sum_thread_work_items(G1GCPhaseTimes::ScanHR, G1GCPhaseTimes::ScanHRScannedCards) +
619 phase_times()->sum_thread_work_items(G1GCPhaseTimes::OptScanHR, G1GCPhaseTimes::ScanHRScannedCards);
620 // This may happen if there are duplicate cards in different log buffers.
621 if (logged_dirty_cards > scan_heap_roots_cards) {
622 return all_cards_processing_time + average_time_ms(G1GCPhaseTimes::MergeLB);
623 }
624 return (all_cards_processing_time * logged_dirty_cards / scan_heap_roots_cards) + average_time_ms(G1GCPhaseTimes::MergeLB);
625 }
626
627 // Anything below that is considered to be zero
628 #define MIN_TIMER_GRANULARITY 0.0000001
629
630 void G1Policy::record_collection_pause_end(double pause_time_ms) {
631 G1GCPhaseTimes* p = phase_times();
632
633 double end_time_sec = os::elapsedTime();
634
635 PauseKind this_pause = young_gc_pause_kind();
636
637 bool update_stats = !_g1h->evacuation_failed();
638
639 record_pause(young_gc_pause_kind(), end_time_sec - pause_time_ms / 1000.0, end_time_sec);
640
641 _collection_pause_end_millis = os::javaTimeNanos() / NANOSECS_PER_MILLISEC;
642
643 if (is_concurrent_start_pause(this_pause)) {
644 record_concurrent_mark_init_end(0.0);
645 } else {
646 maybe_start_marking();
647 }
648
649 double app_time_ms = (phase_times()->cur_collection_start_sec() * 1000.0 - _analytics->prev_collection_pause_end_ms());
650 if (app_time_ms < MIN_TIMER_GRANULARITY) {
651 // This usually happens due to the timer not having the required
652 // granularity. Some Linuxes are the usual culprits.
653 // We'll just set it to something (arbitrarily) small.
654 app_time_ms = 1.0;
655 }
656
657 if (update_stats) {
658 // We maintain the invariant that all objects allocated by mutator
659 // threads will be allocated out of eden regions. So, we can use
660 // the eden region number allocated since the previous GC to
661 // calculate the application's allocate rate. The only exception
662 // to that is humongous objects that are allocated separately. But
663 // given that humongous object allocations do not really affect
664 // either the pause's duration nor when the next pause will take
665 // place we can safely ignore them here.
666 uint regions_allocated = _collection_set->eden_region_length();
667 double alloc_rate_ms = (double) regions_allocated / app_time_ms;
668 _analytics->report_alloc_rate_ms(alloc_rate_ms);
669
670 _analytics->compute_pause_time_ratios(end_time_sec, pause_time_ms);
671 _analytics->update_recent_gc_times(end_time_sec, pause_time_ms);
672 }
673
674 if (is_last_young_pause(this_pause)) {
675 assert(!is_concurrent_start_pause(this_pause), "The young GC before mixed is not allowed to be an initial mark GC");
676 // This has been the young GC before we start doing mixed GCs. We already
677 // decided to start mixed GCs much earlier, so there is nothing to do except
678 // advancing the state.
679 collector_state()->set_in_young_only_phase(false);
680 collector_state()->set_in_young_gc_before_mixed(false);
681 } else if (!is_young_only_pause(this_pause)) {
682 // This is a mixed GC. Here we decide whether to continue doing more
683 // mixed GCs or not.
684 if (!next_gc_should_be_mixed("continue mixed GCs",
685 "do not continue mixed GCs")) {
686 collector_state()->set_in_young_only_phase(true);
687
688 clear_collection_set_candidates();
689 maybe_start_marking();
690 }
691 }
692
693 _eden_surv_rate_group->start_adding_regions();
694
695 double merge_hcc_time_ms = average_time_ms(G1GCPhaseTimes::MergeHCC);
696 if (update_stats) {
697 size_t const total_log_buffer_cards = p->sum_thread_work_items(G1GCPhaseTimes::MergeHCC, G1GCPhaseTimes::MergeHCCDirtyCards) +
698 p->sum_thread_work_items(G1GCPhaseTimes::MergeLB, G1GCPhaseTimes::MergeLBDirtyCards);
699 // Update prediction for card merge; MergeRSDirtyCards includes the cards from the Eager Reclaim phase.
700 size_t const total_cards_merged = p->sum_thread_work_items(G1GCPhaseTimes::MergeRS, G1GCPhaseTimes::MergeRSDirtyCards) +
701 p->sum_thread_work_items(G1GCPhaseTimes::OptMergeRS, G1GCPhaseTimes::MergeRSDirtyCards) +
702 total_log_buffer_cards;
703
704 // The threshold for the number of cards in a given sampling which we consider
705 // large enough so that the impact from setup and other costs is negligible.
706 size_t const CardsNumSamplingThreshold = 10;
707
708 if (total_cards_merged > CardsNumSamplingThreshold) {
709 double avg_time_merge_cards = average_time_ms(G1GCPhaseTimes::MergeER) +
710 average_time_ms(G1GCPhaseTimes::MergeRS) +
711 average_time_ms(G1GCPhaseTimes::MergeHCC) +
712 average_time_ms(G1GCPhaseTimes::MergeLB) +
713 average_time_ms(G1GCPhaseTimes::OptMergeRS);
714 _analytics->report_cost_per_card_merge_ms(avg_time_merge_cards / total_cards_merged,
715 is_young_only_pause(this_pause));
716 }
717
718 // Update prediction for card scan
719 size_t const total_cards_scanned = p->sum_thread_work_items(G1GCPhaseTimes::ScanHR, G1GCPhaseTimes::ScanHRScannedCards) +
720 p->sum_thread_work_items(G1GCPhaseTimes::OptScanHR, G1GCPhaseTimes::ScanHRScannedCards);
721
722 if (total_cards_scanned > CardsNumSamplingThreshold) {
723 double avg_time_dirty_card_scan = average_time_ms(G1GCPhaseTimes::ScanHR) +
724 average_time_ms(G1GCPhaseTimes::OptScanHR);
725
726 _analytics->report_cost_per_card_scan_ms(avg_time_dirty_card_scan / total_cards_scanned,
727 is_young_only_pause(this_pause));
728 }
729
730 // Update prediction for the ratio between cards from the remembered
731 // sets and actually scanned cards from the remembered sets.
732 // Cards from the remembered sets are all cards not duplicated by cards from
733 // the logs.
734 // Due to duplicates in the log buffers, the number of actually scanned cards
735 // can be smaller than the cards in the log buffers.
736 const size_t from_rs_length_cards = (total_cards_scanned > total_log_buffer_cards) ? total_cards_scanned - total_log_buffer_cards : 0;
737 double merge_to_scan_ratio = 0.0;
738 if (total_cards_scanned > 0) {
739 merge_to_scan_ratio = (double) from_rs_length_cards / total_cards_scanned;
740 }
741 _analytics->report_card_merge_to_scan_ratio(merge_to_scan_ratio,
742 is_young_only_pause(this_pause));
743
744 const size_t recorded_rs_length = _collection_set->recorded_rs_length();
745 const size_t rs_length_diff = _rs_length > recorded_rs_length ? _rs_length - recorded_rs_length : 0;
746 _analytics->report_rs_length_diff(rs_length_diff);
747
748 // Update prediction for copy cost per byte
749 size_t copied_bytes = p->sum_thread_work_items(G1GCPhaseTimes::MergePSS, G1GCPhaseTimes::MergePSSCopiedBytes);
750
751 if (copied_bytes > 0) {
752 double cost_per_byte_ms = (average_time_ms(G1GCPhaseTimes::ObjCopy) + average_time_ms(G1GCPhaseTimes::OptObjCopy)) / copied_bytes;
753 _analytics->report_cost_per_byte_ms(cost_per_byte_ms, collector_state()->mark_or_rebuild_in_progress());
754 }
755
756 if (_collection_set->young_region_length() > 0) {
757 _analytics->report_young_other_cost_per_region_ms(young_other_time_ms() /
758 _collection_set->young_region_length());
759 }
760
761 if (_collection_set->old_region_length() > 0) {
762 _analytics->report_non_young_other_cost_per_region_ms(non_young_other_time_ms() /
763 _collection_set->old_region_length());
764 }
765
766 _analytics->report_constant_other_time_ms(constant_other_time_ms(pause_time_ms));
767
768 // Do not update RS lengths and the number of pending cards with information from mixed gc:
769 // these are is wildly different to during young only gc and mess up young gen sizing right
770 // after the mixed gc phase.
771 // During mixed gc we do not use them for young gen sizing.
772 if (is_young_only_pause(this_pause)) {
773 _analytics->report_pending_cards((double) _pending_cards_at_gc_start);
774 _analytics->report_rs_length((double) _rs_length);
775 }
776 }
777
778 assert(!(is_concurrent_start_pause(this_pause) && collector_state()->mark_or_rebuild_in_progress()),
779 "If the last pause has been concurrent start, we should not have been in the marking window");
780 if (is_concurrent_start_pause(this_pause)) {
781 collector_state()->set_mark_or_rebuild_in_progress(true);
782 }
783
784 _free_regions_at_end_of_collection = _g1h->num_free_regions();
785
786 update_rs_length_prediction();
787
788 // Do not update dynamic IHOP due to G1 periodic collection as it is highly likely
789 // that in this case we are not running in a "normal" operating mode.
790 if (_g1h->gc_cause() != GCCause::_g1_periodic_collection) {
791 // IHOP control wants to know the expected young gen length if it were not
792 // restrained by the heap reserve. Using the actual length would make the
793 // prediction too small and the limit the young gen every time we get to the
794 // predicted target occupancy.
795 size_t last_unrestrained_young_length = update_young_list_max_and_target_length();
796
797 _old_gen_alloc_tracker.reset_after_young_gc(app_time_ms / 1000.0);
798 update_ihop_prediction(_old_gen_alloc_tracker.last_cycle_duration(),
799 _old_gen_alloc_tracker.last_cycle_old_bytes(),
800 last_unrestrained_young_length * HeapRegion::GrainBytes,
801 is_young_only_pause(this_pause));
802
803 _ihop_control->send_trace_event(_g1h->gc_tracer_stw());
804 } else {
805 // Any garbage collection triggered as periodic collection resets the time-to-mixed
806 // measurement. Periodic collection typically means that the application is "inactive", i.e.
807 // the marking threads may have received an uncharacterisic amount of cpu time
808 // for completing the marking, i.e. are faster than expected.
809 // This skews the predicted marking length towards smaller values which might cause
810 // the mark start being too late.
811 _concurrent_start_to_mixed.reset();
812 }
813
814 // Note that _mmu_tracker->max_gc_time() returns the time in seconds.
815 double scan_logged_cards_time_goal_ms = _mmu_tracker->max_gc_time() * MILLIUNITS * G1RSetUpdatingPauseTimePercent / 100.0;
816
817 if (scan_logged_cards_time_goal_ms < merge_hcc_time_ms) {
818 log_debug(gc, ergo, refine)("Adjust concurrent refinement thresholds (scanning the HCC expected to take longer than Update RS time goal)."
819 "Logged Cards Scan time goal: %1.2fms Scan HCC time: %1.2fms",
820 scan_logged_cards_time_goal_ms, merge_hcc_time_ms);
821
822 scan_logged_cards_time_goal_ms = 0;
823 } else {
824 scan_logged_cards_time_goal_ms -= merge_hcc_time_ms;
825 }
826
827 double const logged_cards_time = logged_cards_processing_time();
828
829 log_debug(gc, ergo, refine)("Concurrent refinement times: Logged Cards Scan time goal: %1.2fms Logged Cards Scan time: %1.2fms HCC time: %1.2fms",
830 scan_logged_cards_time_goal_ms, logged_cards_time, merge_hcc_time_ms);
831
832 _g1h->concurrent_refine()->adjust(logged_cards_time,
833 phase_times()->sum_thread_work_items(G1GCPhaseTimes::MergeLB, G1GCPhaseTimes::MergeLBDirtyCards),
834 scan_logged_cards_time_goal_ms);
835 }
836
837 G1IHOPControl* G1Policy::create_ihop_control(const G1Predictions* predictor){
838 if (G1UseAdaptiveIHOP) {
839 return new G1AdaptiveIHOPControl(InitiatingHeapOccupancyPercent,
840 predictor,
841 G1ReservePercent,
842 G1HeapWastePercent);
843 } else {
844 return new G1StaticIHOPControl(InitiatingHeapOccupancyPercent);
845 }
846 }
847
848 void G1Policy::update_ihop_prediction(double mutator_time_s,
849 size_t mutator_alloc_bytes,
850 size_t young_gen_size,
851 bool this_gc_was_young_only) {
852 // Always try to update IHOP prediction. Even evacuation failures give information
853 // about e.g. whether to start IHOP earlier next time.
854
855 // Avoid using really small application times that might create samples with
856 // very high or very low values. They may be caused by e.g. back-to-back gcs.
857 double const min_valid_time = 1e-6;
858
859 bool report = false;
860
861 double marking_to_mixed_time = -1.0;
862 if (!this_gc_was_young_only && _concurrent_start_to_mixed.has_result()) {
863 marking_to_mixed_time = _concurrent_start_to_mixed.last_marking_time();
864 assert(marking_to_mixed_time > 0.0,
865 "Concurrent start to mixed time must be larger than zero but is %.3f",
866 marking_to_mixed_time);
867 if (marking_to_mixed_time > min_valid_time) {
868 _ihop_control->update_marking_length(marking_to_mixed_time);
869 report = true;
870 }
871 }
872
873 // As an approximation for the young gc promotion rates during marking we use
874 // all of them. In many applications there are only a few if any young gcs during
875 // marking, which makes any prediction useless. This increases the accuracy of the
876 // prediction.
877 if (this_gc_was_young_only && mutator_time_s > min_valid_time) {
878 _ihop_control->update_allocation_info(mutator_time_s, mutator_alloc_bytes, young_gen_size);
879 report = true;
880 }
881
882 if (report) {
883 report_ihop_statistics();
884 }
885 }
886
887 void G1Policy::report_ihop_statistics() {
888 _ihop_control->print();
889 }
890
891 void G1Policy::print_phases() {
892 phase_times()->print();
893 }
894
895 double G1Policy::predict_base_elapsed_time_ms(size_t pending_cards,
896 size_t rs_length) const {
897 size_t effective_scanned_cards = _analytics->predict_scan_card_num(rs_length, collector_state()->in_young_only_phase());
898 return
899 _analytics->predict_card_merge_time_ms(pending_cards + rs_length, collector_state()->in_young_only_phase()) +
900 _analytics->predict_card_scan_time_ms(effective_scanned_cards, collector_state()->in_young_only_phase()) +
901 _analytics->predict_constant_other_time_ms() +
902 predict_survivor_regions_evac_time();
903 }
904
905 double G1Policy::predict_base_elapsed_time_ms(size_t pending_cards) const {
906 size_t rs_length = _analytics->predict_rs_length();
907 return predict_base_elapsed_time_ms(pending_cards, rs_length);
908 }
909
910 size_t G1Policy::predict_bytes_to_copy(HeapRegion* hr) const {
911 size_t bytes_to_copy;
912 if (!hr->is_young()) {
913 bytes_to_copy = hr->max_live_bytes();
914 } else {
915 bytes_to_copy = (size_t) (hr->used() * hr->surv_rate_prediction(_predictor));
916 }
917 return bytes_to_copy;
918 }
919
920 double G1Policy::predict_eden_copy_time_ms(uint count, size_t* bytes_to_copy) const {
921 if (count == 0) {
922 return 0.0;
923 }
924 size_t const expected_bytes = _eden_surv_rate_group->accum_surv_rate_pred(count) * HeapRegion::GrainBytes;
925 if (bytes_to_copy != NULL) {
926 *bytes_to_copy = expected_bytes;
927 }
928 return _analytics->predict_object_copy_time_ms(expected_bytes, collector_state()->mark_or_rebuild_in_progress());
929 }
930
931 double G1Policy::predict_region_copy_time_ms(HeapRegion* hr) const {
932 size_t const bytes_to_copy = predict_bytes_to_copy(hr);
933 return _analytics->predict_object_copy_time_ms(bytes_to_copy, collector_state()->mark_or_rebuild_in_progress());
934 }
935
936 double G1Policy::predict_region_non_copy_time_ms(HeapRegion* hr,
937 bool for_young_gc) const {
938 size_t rs_length = hr->rem_set()->occupied();
939 size_t scan_card_num = _analytics->predict_scan_card_num(rs_length, for_young_gc);
940
941 double region_elapsed_time_ms =
942 _analytics->predict_card_merge_time_ms(rs_length, collector_state()->in_young_only_phase()) +
943 _analytics->predict_card_scan_time_ms(scan_card_num, collector_state()->in_young_only_phase());
944
945 // The prediction of the "other" time for this region is based
946 // upon the region type and NOT the GC type.
947 if (hr->is_young()) {
948 region_elapsed_time_ms += _analytics->predict_young_other_time_ms(1);
949 } else {
950 region_elapsed_time_ms += _analytics->predict_non_young_other_time_ms(1);
951 }
952 return region_elapsed_time_ms;
953 }
954
955 double G1Policy::predict_region_total_time_ms(HeapRegion* hr, bool for_young_gc) const {
956 return predict_region_non_copy_time_ms(hr, for_young_gc) + predict_region_copy_time_ms(hr);
957 }
958
959 bool G1Policy::should_allocate_mutator_region() const {
960 uint young_list_length = _g1h->young_regions_count();
961 uint young_list_target_length = _young_list_target_length;
962 return young_list_length < young_list_target_length;
963 }
964
965 bool G1Policy::can_expand_young_list() const {
966 uint young_list_length = _g1h->young_regions_count();
967 uint young_list_max_length = _young_list_max_length;
968 return young_list_length < young_list_max_length;
969 }
970
971 bool G1Policy::use_adaptive_young_list_length() const {
972 return _young_gen_sizer->use_adaptive_young_list_length();
973 }
974
975 size_t G1Policy::desired_survivor_size(uint max_regions) const {
976 size_t const survivor_capacity = HeapRegion::GrainWords * max_regions;
977 return (size_t)((((double)survivor_capacity) * TargetSurvivorRatio) / 100);
978 }
979
980 void G1Policy::print_age_table() {
981 _survivors_age_table.print_age_table(_tenuring_threshold);
982 }
983
984 void G1Policy::update_max_gc_locker_expansion() {
985 uint expansion_region_num = 0;
986 if (GCLockerEdenExpansionPercent > 0) {
987 double perc = (double) GCLockerEdenExpansionPercent / 100.0;
988 double expansion_region_num_d = perc * (double) _young_list_target_length;
989 // We use ceiling so that if expansion_region_num_d is > 0.0 (but
990 // less than 1.0) we'll get 1.
991 expansion_region_num = (uint) ceil(expansion_region_num_d);
992 } else {
993 assert(expansion_region_num == 0, "sanity");
994 }
995 _young_list_max_length = _young_list_target_length + expansion_region_num;
996 assert(_young_list_target_length <= _young_list_max_length, "post-condition");
997 }
998
999 // Calculates survivor space parameters.
1000 void G1Policy::update_survivors_policy() {
1001 double max_survivor_regions_d =
1002 (double) _young_list_target_length / (double) SurvivorRatio;
1003
1004 // Calculate desired survivor size based on desired max survivor regions (unconstrained
1005 // by remaining heap). Otherwise we may cause undesired promotions as we are
1006 // already getting close to end of the heap, impacting performance even more.
1007 uint const desired_max_survivor_regions = ceil(max_survivor_regions_d);
1008 size_t const survivor_size = desired_survivor_size(desired_max_survivor_regions);
1009
1010 _tenuring_threshold = _survivors_age_table.compute_tenuring_threshold(survivor_size);
1011 if (UsePerfData) {
1012 _policy_counters->tenuring_threshold()->set_value(_tenuring_threshold);
1013 _policy_counters->desired_survivor_size()->set_value(survivor_size * oopSize);
1014 }
1015 // The real maximum survivor size is bounded by the number of regions that can
1016 // be allocated into.
1017 _max_survivor_regions = MIN2(desired_max_survivor_regions,
1018 _g1h->num_free_or_available_regions());
1019 }
1020
1021 bool G1Policy::force_concurrent_start_if_outside_cycle(GCCause::Cause gc_cause) {
1022 // We actually check whether we are marking here and not if we are in a
1023 // reclamation phase. This means that we will schedule a concurrent mark
1024 // even while we are still in the process of reclaiming memory.
1025 bool during_cycle = _g1h->concurrent_mark()->cm_thread()->during_cycle();
1026 if (!during_cycle) {
1027 log_debug(gc, ergo)("Request concurrent cycle initiation (requested by GC cause). "
1028 "GC cause: %s",
1029 GCCause::to_string(gc_cause));
1030 collector_state()->set_initiate_conc_mark_if_possible(true);
1031 return true;
1032 } else {
1033 log_debug(gc, ergo)("Do not request concurrent cycle initiation "
1034 "(concurrent cycle already in progress). GC cause: %s",
1035 GCCause::to_string(gc_cause));
1036 return false;
1037 }
1038 }
1039
1040 void G1Policy::initiate_conc_mark() {
1041 collector_state()->set_in_concurrent_start_gc(true);
1042 collector_state()->set_initiate_conc_mark_if_possible(false);
1043 }
1044
1045 void G1Policy::decide_on_conc_mark_initiation() {
1046 // We are about to decide on whether this pause will be a
1047 // concurrent start pause.
1048
1049 // First, collector_state()->in_concurrent_start_gc() should not be already set. We
1050 // will set it here if we have to. However, it should be cleared by
1051 // the end of the pause (it's only set for the duration of a
1052 // concurrent start pause).
1053 assert(!collector_state()->in_concurrent_start_gc(), "pre-condition");
1054
1055 if (collector_state()->initiate_conc_mark_if_possible()) {
1056 // We had noticed on a previous pause that the heap occupancy has
1057 // gone over the initiating threshold and we should start a
1058 // concurrent marking cycle. Or we've been explicitly requested
1059 // to start a concurrent marking cycle. Either way, we initiate
1060 // one if not inhibited for some reason.
1061
1062 GCCause::Cause cause = _g1h->gc_cause();
1063 if ((cause != GCCause::_wb_breakpoint) &&
1064 ConcurrentGCBreakpoints::is_controlled()) {
1065 log_debug(gc, ergo)("Do not initiate concurrent cycle (whitebox controlled)");
1066 } else if (!about_to_start_mixed_phase() && collector_state()->in_young_only_phase()) {
1067 // Initiate a new concurrent start if there is no marking or reclamation going on.
1068 initiate_conc_mark();
1069 log_debug(gc, ergo)("Initiate concurrent cycle (concurrent cycle initiation requested)");
1070 } else if (_g1h->is_user_requested_concurrent_full_gc(cause) ||
1071 (cause == GCCause::_wb_breakpoint)) {
1072 // Initiate a user requested concurrent start or run to a breakpoint.
1073 // A concurrent start must be young only GC, so the collector state
1074 // must be updated to reflect this.
1075 collector_state()->set_in_young_only_phase(true);
1076 collector_state()->set_in_young_gc_before_mixed(false);
1077
1078 // We might have ended up coming here about to start a mixed phase with a collection set
1079 // active. The following remark might change the change the "evacuation efficiency" of
1080 // the regions in this set, leading to failing asserts later.
1081 // Since the concurrent cycle will recreate the collection set anyway, simply drop it here.
1082 clear_collection_set_candidates();
1083 abort_time_to_mixed_tracking();
1084 initiate_conc_mark();
1085 log_debug(gc, ergo)("Initiate concurrent cycle (%s requested concurrent cycle)",
1086 (cause == GCCause::_wb_breakpoint) ? "run_to breakpoint" : "user");
1087 } else {
1088 // The concurrent marking thread is still finishing up the
1089 // previous cycle. If we start one right now the two cycles
1090 // overlap. In particular, the concurrent marking thread might
1091 // be in the process of clearing the next marking bitmap (which
1092 // we will use for the next cycle if we start one). Starting a
1093 // cycle now will be bad given that parts of the marking
1094 // information might get cleared by the marking thread. And we
1095 // cannot wait for the marking thread to finish the cycle as it
1096 // periodically yields while clearing the next marking bitmap
1097 // and, if it's in a yield point, it's waiting for us to
1098 // finish. So, at this point we will not start a cycle and we'll
1099 // let the concurrent marking thread complete the last one.
1100 log_debug(gc, ergo)("Do not initiate concurrent cycle (concurrent cycle already in progress)");
1101 }
1102 }
1103 }
1104
1105 void G1Policy::record_concurrent_mark_cleanup_end() {
1106 G1CollectionSetCandidates* candidates = G1CollectionSetChooser::build(_g1h->workers(), _g1h->num_regions());
1107 _collection_set->set_candidates(candidates);
1108
1109 bool mixed_gc_pending = next_gc_should_be_mixed("request mixed gcs", "request young-only gcs");
1110 if (!mixed_gc_pending) {
1111 clear_collection_set_candidates();
1112 abort_time_to_mixed_tracking();
1113 }
1114 collector_state()->set_in_young_gc_before_mixed(mixed_gc_pending);
1115 collector_state()->set_mark_or_rebuild_in_progress(false);
1116
1117 double end_sec = os::elapsedTime();
1118 double elapsed_time_ms = (end_sec - _mark_cleanup_start_sec) * 1000.0;
1119 _analytics->report_concurrent_mark_cleanup_times_ms(elapsed_time_ms);
1120 _analytics->append_prev_collection_pause_end_ms(elapsed_time_ms);
1121
1122 record_pause(Cleanup, _mark_cleanup_start_sec, end_sec);
1123 }
1124
1125 double G1Policy::reclaimable_bytes_percent(size_t reclaimable_bytes) const {
1126 return percent_of(reclaimable_bytes, _g1h->capacity());
1127 }
1128
1129 class G1ClearCollectionSetCandidateRemSets : public HeapRegionClosure {
1130 virtual bool do_heap_region(HeapRegion* r) {
1131 r->rem_set()->clear_locked(true /* only_cardset */);
1132 return false;
1133 }
1134 };
1135
1136 void G1Policy::clear_collection_set_candidates() {
1137 // Clear remembered sets of remaining candidate regions and the actual candidate
1138 // set.
1139 G1ClearCollectionSetCandidateRemSets cl;
1140 _collection_set->candidates()->iterate(&cl);
1141 _collection_set->clear_candidates();
1142 }
1143
1144 void G1Policy::maybe_start_marking() {
1145 if (need_to_start_conc_mark("end of GC")) {
1146 // Note: this might have already been set, if during the last
1147 // pause we decided to start a cycle but at the beginning of
1148 // this pause we decided to postpone it. That's OK.
1149 collector_state()->set_initiate_conc_mark_if_possible(true);
1150 }
1151 }
1152
1153 bool G1Policy::is_young_only_pause(PauseKind kind) {
1154 assert(kind != FullGC, "must be");
1155 assert(kind != Remark, "must be");
1156 assert(kind != Cleanup, "must be");
1157 return kind == ConcurrentStartGC || kind == LastYoungGC || kind == YoungOnlyGC;
1158 }
1159
1160 bool G1Policy::is_last_young_pause(PauseKind kind) {
1161 return kind == LastYoungGC;
1162 }
1163
1164 bool G1Policy::is_concurrent_start_pause(PauseKind kind) {
1165 return kind == ConcurrentStartGC;
1166 }
1167
1168 G1Policy::PauseKind G1Policy::young_gc_pause_kind() const {
1169 assert(!collector_state()->in_full_gc(), "must be");
1170 if (collector_state()->in_concurrent_start_gc()) {
1171 assert(!collector_state()->in_young_gc_before_mixed(), "must be");
1172 return ConcurrentStartGC;
1173 } else if (collector_state()->in_young_gc_before_mixed()) {
1174 assert(!collector_state()->in_concurrent_start_gc(), "must be");
1175 return LastYoungGC;
1176 } else if (collector_state()->in_mixed_phase()) {
1177 assert(!collector_state()->in_concurrent_start_gc(), "must be");
1178 assert(!collector_state()->in_young_gc_before_mixed(), "must be");
1179 return MixedGC;
1180 } else {
1181 assert(!collector_state()->in_concurrent_start_gc(), "must be");
1182 assert(!collector_state()->in_young_gc_before_mixed(), "must be");
1183 return YoungOnlyGC;
1184 }
1185 }
1186
1187 void G1Policy::record_pause(PauseKind kind, double start, double end) {
1188 // Manage the MMU tracker. For some reason it ignores Full GCs.
1189 if (kind != FullGC) {
1190 _mmu_tracker->add_pause(start, end);
1191 }
1192 // Manage the mutator time tracking from concurrent start to first mixed gc.
1193 switch (kind) {
1194 case FullGC:
1195 abort_time_to_mixed_tracking();
1196 break;
1197 case Cleanup:
1198 case Remark:
1199 case YoungOnlyGC:
1200 case LastYoungGC:
1201 _concurrent_start_to_mixed.add_pause(end - start);
1202 break;
1203 case ConcurrentStartGC:
1204 if (_g1h->gc_cause() != GCCause::_g1_periodic_collection) {
1205 _concurrent_start_to_mixed.record_concurrent_start_end(end);
1206 }
1207 break;
1208 case MixedGC:
1209 _concurrent_start_to_mixed.record_mixed_gc_start(start);
1210 break;
1211 default:
1212 ShouldNotReachHere();
1213 }
1214 }
1215
1216 void G1Policy::abort_time_to_mixed_tracking() {
1217 _concurrent_start_to_mixed.reset();
1218 }
1219
1220 bool G1Policy::next_gc_should_be_mixed(const char* true_action_str,
1221 const char* false_action_str) const {
1222 G1CollectionSetCandidates* candidates = _collection_set->candidates();
1223
1224 if (candidates->is_empty()) {
1225 log_debug(gc, ergo)("%s (candidate old regions not available)", false_action_str);
1226 return false;
1227 }
1228
1229 // Is the amount of uncollected reclaimable space above G1HeapWastePercent?
1230 size_t reclaimable_bytes = candidates->remaining_reclaimable_bytes();
1231 double reclaimable_percent = reclaimable_bytes_percent(reclaimable_bytes);
1232 double threshold = (double) G1HeapWastePercent;
1233 if (reclaimable_percent <= threshold) {
1234 log_debug(gc, ergo)("%s (reclaimable percentage not over threshold). candidate old regions: %u reclaimable: " SIZE_FORMAT " (%1.2f) threshold: " UINTX_FORMAT,
1235 false_action_str, candidates->num_remaining(), reclaimable_bytes, reclaimable_percent, G1HeapWastePercent);
1236 return false;
1237 }
1238 log_debug(gc, ergo)("%s (candidate old regions available). candidate old regions: %u reclaimable: " SIZE_FORMAT " (%1.2f) threshold: " UINTX_FORMAT,
1239 true_action_str, candidates->num_remaining(), reclaimable_bytes, reclaimable_percent, G1HeapWastePercent);
1240 return true;
1241 }
1242
1243 uint G1Policy::calc_min_old_cset_length() const {
1244 // The min old CSet region bound is based on the maximum desired
1245 // number of mixed GCs after a cycle. I.e., even if some old regions
1246 // look expensive, we should add them to the CSet anyway to make
1247 // sure we go through the available old regions in no more than the
1248 // maximum desired number of mixed GCs.
1249 //
1250 // The calculation is based on the number of marked regions we added
1251 // to the CSet candidates in the first place, not how many remain, so
1252 // that the result is the same during all mixed GCs that follow a cycle.
1253
1254 const size_t region_num = _collection_set->candidates()->num_regions();
1255 const size_t gc_num = (size_t) MAX2(G1MixedGCCountTarget, (uintx) 1);
1256 size_t result = region_num / gc_num;
1257 // emulate ceiling
1258 if (result * gc_num < region_num) {
1259 result += 1;
1260 }
1261 return (uint) result;
1262 }
1263
1264 uint G1Policy::calc_max_old_cset_length() const {
1265 // The max old CSet region bound is based on the threshold expressed
1266 // as a percentage of the heap size. I.e., it should bound the
1267 // number of old regions added to the CSet irrespective of how many
1268 // of them are available.
1269
1270 const G1CollectedHeap* g1h = G1CollectedHeap::heap();
1271 const size_t region_num = g1h->num_regions();
1272 const size_t perc = (size_t) G1OldCSetRegionThresholdPercent;
1273 size_t result = region_num * perc / 100;
1274 // emulate ceiling
1275 if (100 * result < region_num * perc) {
1276 result += 1;
1277 }
1278 return (uint) result;
1279 }
1280
1281 void G1Policy::calculate_old_collection_set_regions(G1CollectionSetCandidates* candidates,
1282 double time_remaining_ms,
1283 uint& num_initial_regions,
1284 uint& num_optional_regions) {
1285 assert(candidates != NULL, "Must be");
1286
1287 num_initial_regions = 0;
1288 num_optional_regions = 0;
1289 uint num_expensive_regions = 0;
1290
1291 double predicted_old_time_ms = 0.0;
1292 double predicted_initial_time_ms = 0.0;
1293 double predicted_optional_time_ms = 0.0;
1294
1295 double optional_threshold_ms = time_remaining_ms * optional_prediction_fraction();
1296
1297 const uint min_old_cset_length = calc_min_old_cset_length();
1298 const uint max_old_cset_length = MAX2(min_old_cset_length, calc_max_old_cset_length());
1299 const uint max_optional_regions = max_old_cset_length - min_old_cset_length;
1300 bool check_time_remaining = use_adaptive_young_list_length();
1301
1302 uint candidate_idx = candidates->cur_idx();
1303
1304 log_debug(gc, ergo, cset)("Start adding old regions to collection set. Min %u regions, max %u regions, "
1305 "time remaining %1.2fms, optional threshold %1.2fms",
1306 min_old_cset_length, max_old_cset_length, time_remaining_ms, optional_threshold_ms);
1307
1308 HeapRegion* hr = candidates->at(candidate_idx);
1309 while (hr != NULL) {
1310 if (num_initial_regions + num_optional_regions >= max_old_cset_length) {
1311 // Added maximum number of old regions to the CSet.
1312 log_debug(gc, ergo, cset)("Finish adding old regions to collection set (Maximum number of regions). "
1313 "Initial %u regions, optional %u regions",
1314 num_initial_regions, num_optional_regions);
1315 break;
1316 }
1317
1318 // Stop adding regions if the remaining reclaimable space is
1319 // not above G1HeapWastePercent.
1320 size_t reclaimable_bytes = candidates->remaining_reclaimable_bytes();
1321 double reclaimable_percent = reclaimable_bytes_percent(reclaimable_bytes);
1322 double threshold = (double) G1HeapWastePercent;
1323 if (reclaimable_percent <= threshold) {
1324 // We've added enough old regions that the amount of uncollected
1325 // reclaimable space is at or below the waste threshold. Stop
1326 // adding old regions to the CSet.
1327 log_debug(gc, ergo, cset)("Finish adding old regions to collection set (Reclaimable percentage below threshold). "
1328 "Reclaimable: " SIZE_FORMAT "%s (%1.2f%%) threshold: " UINTX_FORMAT "%%",
1329 byte_size_in_proper_unit(reclaimable_bytes), proper_unit_for_byte_size(reclaimable_bytes),
1330 reclaimable_percent, G1HeapWastePercent);
1331 break;
1332 }
1333
1334 double predicted_time_ms = predict_region_total_time_ms(hr, false);
1335 time_remaining_ms = MAX2(time_remaining_ms - predicted_time_ms, 0.0);
1336 // Add regions to old set until we reach the minimum amount
1337 if (num_initial_regions < min_old_cset_length) {
1338 predicted_old_time_ms += predicted_time_ms;
1339 num_initial_regions++;
1340 // Record the number of regions added with no time remaining
1341 if (time_remaining_ms == 0.0) {
1342 num_expensive_regions++;
1343 }
1344 } else if (!check_time_remaining) {
1345 // In the non-auto-tuning case, we'll finish adding regions
1346 // to the CSet if we reach the minimum.
1347 log_debug(gc, ergo, cset)("Finish adding old regions to collection set (Region amount reached min).");
1348 break;
1349 } else {
1350 // Keep adding regions to old set until we reach the optional threshold
1351 if (time_remaining_ms > optional_threshold_ms) {
1352 predicted_old_time_ms += predicted_time_ms;
1353 num_initial_regions++;
1354 } else if (time_remaining_ms > 0) {
1355 // Keep adding optional regions until time is up.
1356 assert(num_optional_regions < max_optional_regions, "Should not be possible.");
1357 predicted_optional_time_ms += predicted_time_ms;
1358 num_optional_regions++;
1359 } else {
1360 log_debug(gc, ergo, cset)("Finish adding old regions to collection set (Predicted time too high).");
1361 break;
1362 }
1363 }
1364 hr = candidates->at(++candidate_idx);
1365 }
1366 if (hr == NULL) {
1367 log_debug(gc, ergo, cset)("Old candidate collection set empty.");
1368 }
1369
1370 if (num_expensive_regions > 0) {
1371 log_debug(gc, ergo, cset)("Added %u initial old regions to collection set although the predicted time was too high.",
1372 num_expensive_regions);
1373 }
1374
1375 log_debug(gc, ergo, cset)("Finish choosing collection set old regions. Initial: %u, optional: %u, "
1376 "predicted old time: %1.2fms, predicted optional time: %1.2fms, time remaining: %1.2f",
1377 num_initial_regions, num_optional_regions,
1378 predicted_initial_time_ms, predicted_optional_time_ms, time_remaining_ms);
1379 }
1380
1381 void G1Policy::calculate_optional_collection_set_regions(G1CollectionSetCandidates* candidates,
1382 uint const max_optional_regions,
1383 double time_remaining_ms,
1384 uint& num_optional_regions) {
1385 assert(_g1h->collector_state()->in_mixed_phase(), "Should only be called in mixed phase");
1386
1387 num_optional_regions = 0;
1388 double prediction_ms = 0;
1389 uint candidate_idx = candidates->cur_idx();
1390
1391 HeapRegion* r = candidates->at(candidate_idx);
1392 while (num_optional_regions < max_optional_regions) {
1393 assert(r != NULL, "Region must exist");
1394 prediction_ms += predict_region_total_time_ms(r, false);
1395
1396 if (prediction_ms > time_remaining_ms) {
1397 log_debug(gc, ergo, cset)("Prediction %.3fms for region %u does not fit remaining time: %.3fms.",
1398 prediction_ms, r->hrm_index(), time_remaining_ms);
1399 break;
1400 }
1401 // This region will be included in the next optional evacuation.
1402
1403 time_remaining_ms -= prediction_ms;
1404 num_optional_regions++;
1405 r = candidates->at(++candidate_idx);
1406 }
1407
1408 log_debug(gc, ergo, cset)("Prepared %u regions out of %u for optional evacuation. Predicted time: %.3fms",
1409 num_optional_regions, max_optional_regions, prediction_ms);
1410 }
1411
1412 void G1Policy::transfer_survivors_to_cset(const G1SurvivorRegions* survivors) {
1413 note_start_adding_survivor_regions();
1414
1415 HeapRegion* last = NULL;
1416 for (GrowableArrayIterator<HeapRegion*> it = survivors->regions()->begin();
1417 it != survivors->regions()->end();
1418 ++it) {
1419 HeapRegion* curr = *it;
1420 set_region_survivor(curr);
1421
1422 // The region is a non-empty survivor so let's add it to
1423 // the incremental collection set for the next evacuation
1424 // pause.
1425 _collection_set->add_survivor_regions(curr);
1426
1427 last = curr;
1428 }
1429 note_stop_adding_survivor_regions();
1430
1431 // Don't clear the survivor list handles until the start of
1432 // the next evacuation pause - we need it in order to re-tag
1433 // the survivor regions from this evacuation pause as 'young'
1434 // at the start of the next.
1435 }