author | jwilhelm |
Sat, 24 Mar 2018 01:08:35 +0100 | |
changeset 49488 | 1f9dd2360b17 |
parent 49412 | 2c3b9dbba7bc |
parent 49472 | 982acd800812 |
child 49607 | acffe6ff3ae7 |
permissions | -rw-r--r-- |
38076 | 1 |
/* |
49375 | 2 |
* Copyright (c) 2016, 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 |
||
49375 | 25 |
#ifndef SHARE_VM_GC_G1_G1POLICY_HPP |
26 |
#define SHARE_VM_GC_G1_G1POLICY_HPP |
|
38076 | 27 |
|
28 |
#include "gc/g1/g1CollectorState.hpp" |
|
29 |
#include "gc/g1/g1GCPhaseTimes.hpp" |
|
30 |
#include "gc/g1/g1InCSetState.hpp" |
|
31 |
#include "gc/g1/g1InitialMarkToMixedTimeTracker.hpp" |
|
32 |
#include "gc/g1/g1MMUTracker.hpp" |
|
33 |
#include "gc/g1/g1Predictions.hpp" |
|
34 |
#include "gc/g1/g1YoungGenSizer.hpp" |
|
35 |
#include "gc/shared/gcCause.hpp" |
|
36 |
#include "utilities/pair.hpp" |
|
37 |
||
49375 | 38 |
// A G1Policy makes policy decisions that determine the |
39 |
// characteristics of the collector. Examples include: |
|
40 |
// * choice of collection set. |
|
41 |
// * when to collect. |
|
42 |
||
38076 | 43 |
class HeapRegion; |
44 |
class G1CollectionSet; |
|
45 |
class CollectionSetChooser; |
|
46 |
class G1IHOPControl; |
|
47 |
class G1Analytics; |
|
38183
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38109
diff
changeset
|
48 |
class G1SurvivorRegions; |
38076 | 49 |
class G1YoungGenSizer; |
50 |
class GCPolicyCounters; |
|
46795
623a5e42deb6
8173335: Improve logging for j.l.ref.reference processing
sangheki
parents:
41284
diff
changeset
|
51 |
class STWGCTimer; |
38076 | 52 |
|
49375 | 53 |
class G1Policy: public CHeapObj<mtGC> { |
38076 | 54 |
private: |
55 |
||
56 |
static G1IHOPControl* create_ihop_control(const G1Predictions* predictor); |
|
57 |
// Update the IHOP control with necessary statistics. |
|
58 |
void update_ihop_prediction(double mutator_time_s, |
|
59 |
size_t mutator_alloc_bytes, |
|
60 |
size_t young_gen_size); |
|
61 |
void report_ihop_statistics(); |
|
62 |
||
63 |
G1Predictions _predictor; |
|
64 |
G1Analytics* _analytics; |
|
65 |
G1MMUTracker* _mmu_tracker; |
|
66 |
G1IHOPControl* _ihop_control; |
|
67 |
||
68 |
GCPolicyCounters* _policy_counters; |
|
69 |
||
70 |
double _full_collection_start_sec; |
|
71 |
||
41284
b4276ec89d0d
8164482: [REDO] G1 does not implement millis_since_last_gc which is needed by RMI GC
jprovino
parents:
40914
diff
changeset
|
72 |
jlong _collection_pause_end_millis; |
b4276ec89d0d
8164482: [REDO] G1 does not implement millis_since_last_gc which is needed by RMI GC
jprovino
parents:
40914
diff
changeset
|
73 |
|
38076 | 74 |
uint _young_list_target_length; |
75 |
uint _young_list_fixed_length; |
|
76 |
||
77 |
// The max number of regions we can extend the eden by while the GC |
|
78 |
// locker is active. This should be >= _young_list_target_length; |
|
79 |
uint _young_list_max_length; |
|
80 |
||
81 |
// SurvRateGroups below must be initialized after the predictor because they |
|
82 |
// indirectly use it through this object passed to their constructor. |
|
83 |
SurvRateGroup* _short_lived_surv_rate_group; |
|
84 |
SurvRateGroup* _survivor_surv_rate_group; |
|
85 |
||
86 |
double _reserve_factor; |
|
87 |
// This will be set when the heap is expanded |
|
88 |
// for the first time during initialization. |
|
89 |
uint _reserve_regions; |
|
90 |
||
91 |
G1YoungGenSizer _young_gen_sizer; |
|
92 |
||
93 |
uint _free_regions_at_end_of_collection; |
|
94 |
||
95 |
size_t _max_rs_lengths; |
|
96 |
||
97 |
size_t _rs_lengths_prediction; |
|
98 |
||
99 |
size_t _pending_cards; |
|
100 |
||
101 |
// The amount of allocated bytes in old gen during the last mutator and the following |
|
102 |
// young GC phase. |
|
103 |
size_t _bytes_allocated_in_old_since_last_gc; |
|
104 |
||
105 |
G1InitialMarkToMixedTimeTracker _initial_mark_to_mixed; |
|
106 |
public: |
|
107 |
const G1Predictions& predictor() const { return _predictor; } |
|
108 |
const G1Analytics* analytics() const { return const_cast<const G1Analytics*>(_analytics); } |
|
109 |
||
49375 | 110 |
// Add the given number of bytes to the total number of allocated bytes in the old gen. |
38076 | 111 |
void add_bytes_allocated_in_old_since_last_gc(size_t bytes) { _bytes_allocated_in_old_since_last_gc += bytes; } |
112 |
||
38109
6503703df058
8155209: Move setting of young index in cset to G1CollectionSet
mgerdin
parents:
38106
diff
changeset
|
113 |
void set_region_eden(HeapRegion* hr) { |
38076 | 114 |
hr->set_eden(); |
115 |
hr->install_surv_rate_group(_short_lived_surv_rate_group); |
|
116 |
} |
|
117 |
||
38109
6503703df058
8155209: Move setting of young index in cset to G1CollectionSet
mgerdin
parents:
38106
diff
changeset
|
118 |
void set_region_survivor(HeapRegion* hr) { |
38076 | 119 |
assert(hr->is_survivor(), "pre-condition"); |
120 |
hr->install_surv_rate_group(_survivor_surv_rate_group); |
|
121 |
} |
|
122 |
||
123 |
void record_max_rs_lengths(size_t rs_lengths) { |
|
124 |
_max_rs_lengths = rs_lengths; |
|
125 |
} |
|
126 |
||
127 |
double predict_base_elapsed_time_ms(size_t pending_cards) const; |
|
128 |
double predict_base_elapsed_time_ms(size_t pending_cards, |
|
129 |
size_t scanned_cards) const; |
|
130 |
size_t predict_bytes_to_copy(HeapRegion* hr) const; |
|
131 |
double predict_region_elapsed_time_ms(HeapRegion* hr, bool for_young_gc) const; |
|
132 |
||
133 |
double predict_survivor_regions_evac_time() const; |
|
134 |
||
135 |
bool should_update_surv_rate_group_predictors() { |
|
136 |
return collector_state()->last_gc_was_young() && !collector_state()->in_marking_window(); |
|
137 |
} |
|
138 |
||
139 |
void cset_regions_freed() { |
|
140 |
bool update = should_update_surv_rate_group_predictors(); |
|
141 |
||
38185
c432f8466c73
8155634: Clean out old logging and dead code from SurvRateGroup
mgerdin
parents:
38183
diff
changeset
|
142 |
_short_lived_surv_rate_group->all_surviving_words_recorded(predictor(), update); |
c432f8466c73
8155634: Clean out old logging and dead code from SurvRateGroup
mgerdin
parents:
38183
diff
changeset
|
143 |
_survivor_surv_rate_group->all_surviving_words_recorded(predictor(), update); |
38076 | 144 |
} |
145 |
||
146 |
G1MMUTracker* mmu_tracker() { |
|
147 |
return _mmu_tracker; |
|
148 |
} |
|
149 |
||
150 |
const G1MMUTracker* mmu_tracker() const { |
|
151 |
return _mmu_tracker; |
|
152 |
} |
|
153 |
||
154 |
double max_pause_time_ms() const { |
|
155 |
return _mmu_tracker->max_gc_time() * 1000.0; |
|
156 |
} |
|
157 |
||
158 |
double predict_yg_surv_rate(int age, SurvRateGroup* surv_rate_group) const; |
|
159 |
||
160 |
double predict_yg_surv_rate(int age) const; |
|
161 |
||
162 |
double accum_yg_surv_rate_pred(int age) const; |
|
163 |
||
49472
982acd800812
8199027: Make protected members private in G1Policy
ehelin
parents:
49375
diff
changeset
|
164 |
private: |
38076 | 165 |
G1CollectionSet* _collection_set; |
49375 | 166 |
double average_time_ms(G1GCPhaseTimes::GCParPhases phase) const; |
167 |
double other_time_ms(double pause_time_ms) const; |
|
38076 | 168 |
|
169 |
double young_other_time_ms() const; |
|
170 |
double non_young_other_time_ms() const; |
|
171 |
double constant_other_time_ms(double pause_time_ms) const; |
|
172 |
||
173 |
CollectionSetChooser* cset_chooser() const; |
|
174 |
||
175 |
// The number of bytes copied during the GC. |
|
176 |
size_t _bytes_copied_during_gc; |
|
177 |
||
178 |
// Stash a pointer to the g1 heap. |
|
179 |
G1CollectedHeap* _g1; |
|
180 |
||
181 |
G1GCPhaseTimes* _phase_times; |
|
182 |
||
183 |
// This set of variables tracks the collector efficiency, in order to |
|
184 |
// determine whether we should initiate a new marking. |
|
185 |
double _mark_remark_start_sec; |
|
186 |
double _mark_cleanup_start_sec; |
|
187 |
||
188 |
// Updates the internal young list maximum and target lengths. Returns the |
|
189 |
// unbounded young list target length. |
|
190 |
uint update_young_list_max_and_target_length(); |
|
191 |
uint update_young_list_max_and_target_length(size_t rs_lengths); |
|
192 |
||
193 |
// Update the young list target length either by setting it to the |
|
194 |
// desired fixed value or by calculating it using G1's pause |
|
195 |
// prediction model. If no rs_lengths parameter is passed, predict |
|
196 |
// the RS lengths using the prediction model, otherwise use the |
|
197 |
// given rs_lengths as the prediction. |
|
198 |
// Returns the unbounded young list target length. |
|
199 |
uint update_young_list_target_length(size_t rs_lengths); |
|
200 |
||
201 |
// Calculate and return the minimum desired young list target |
|
202 |
// length. This is the minimum desired young list length according |
|
203 |
// to the user's inputs. |
|
204 |
uint calculate_young_list_desired_min_length(uint base_min_length) const; |
|
205 |
||
206 |
// Calculate and return the maximum desired young list target |
|
207 |
// length. This is the maximum desired young list length according |
|
208 |
// to the user's inputs. |
|
209 |
uint calculate_young_list_desired_max_length() const; |
|
210 |
||
211 |
// Calculate and return the maximum young list target length that |
|
212 |
// can fit into the pause time goal. The parameters are: rs_lengths |
|
213 |
// represent the prediction of how large the young RSet lengths will |
|
214 |
// be, base_min_length is the already existing number of regions in |
|
215 |
// the young list, min_length and max_length are the desired min and |
|
216 |
// max young list length according to the user's inputs. |
|
217 |
uint calculate_young_list_target_length(size_t rs_lengths, |
|
218 |
uint base_min_length, |
|
219 |
uint desired_min_length, |
|
220 |
uint desired_max_length) const; |
|
221 |
||
222 |
// Result of the bounded_young_list_target_length() method, containing both the |
|
223 |
// bounded as well as the unbounded young list target lengths in this order. |
|
224 |
typedef Pair<uint, uint, StackObj> YoungTargetLengths; |
|
225 |
YoungTargetLengths young_list_target_lengths(size_t rs_lengths) const; |
|
226 |
||
227 |
void update_rs_lengths_prediction(); |
|
228 |
void update_rs_lengths_prediction(size_t prediction); |
|
229 |
||
230 |
// Check whether a given young length (young_length) fits into the |
|
231 |
// given target pause time and whether the prediction for the amount |
|
232 |
// of objects to be copied for the given length will fit into the |
|
233 |
// given free space (expressed by base_free_regions). It is used by |
|
234 |
// calculate_young_list_target_length(). |
|
235 |
bool predict_will_fit(uint young_length, double base_time_ms, |
|
236 |
uint base_free_regions, double target_pause_time_ms) const; |
|
237 |
||
238 |
public: |
|
239 |
size_t pending_cards() const { return _pending_cards; } |
|
240 |
||
49375 | 241 |
// Calculate the minimum number of old regions we'll add to the CSet |
242 |
// during a mixed GC. |
|
38076 | 243 |
uint calc_min_old_cset_length() const; |
49375 | 244 |
|
245 |
// Calculate the maximum number of old regions we'll add to the CSet |
|
246 |
// during a mixed GC. |
|
38076 | 247 |
uint calc_max_old_cset_length() const; |
248 |
||
47679
4cfcb7be4984
8189666: Replace various inlined percentage calculations with global percent_of()
tschatzl
parents:
47216
diff
changeset
|
249 |
// Returns the given amount of reclaimable bytes (that represents |
4cfcb7be4984
8189666: Replace various inlined percentage calculations with global percent_of()
tschatzl
parents:
47216
diff
changeset
|
250 |
// the amount of reclaimable space still to be collected) as a |
4cfcb7be4984
8189666: Replace various inlined percentage calculations with global percent_of()
tschatzl
parents:
47216
diff
changeset
|
251 |
// percentage of the current heap capacity. |
47681
149745044e48
8189729: Change _perc suffixes in identifiers to _percent
tschatzl
parents:
47679
diff
changeset
|
252 |
double reclaimable_bytes_percent(size_t reclaimable_bytes) const; |
38076 | 253 |
|
41284
b4276ec89d0d
8164482: [REDO] G1 does not implement millis_since_last_gc which is needed by RMI GC
jprovino
parents:
40914
diff
changeset
|
254 |
jlong collection_pause_end_millis() { return _collection_pause_end_millis; } |
b4276ec89d0d
8164482: [REDO] G1 does not implement millis_since_last_gc which is needed by RMI GC
jprovino
parents:
40914
diff
changeset
|
255 |
|
38076 | 256 |
private: |
257 |
// Sets up marking if proper conditions are met. |
|
258 |
void maybe_start_marking(); |
|
259 |
||
260 |
// The kind of STW pause. |
|
261 |
enum PauseKind { |
|
262 |
FullGC, |
|
263 |
YoungOnlyGC, |
|
264 |
MixedGC, |
|
265 |
LastYoungGC, |
|
266 |
InitialMarkGC, |
|
267 |
Cleanup, |
|
268 |
Remark |
|
269 |
}; |
|
270 |
||
271 |
// Calculate PauseKind from internal state. |
|
272 |
PauseKind young_gc_pause_kind() const; |
|
273 |
// Record the given STW pause with the given start and end times (in s). |
|
274 |
void record_pause(PauseKind kind, double start, double end); |
|
275 |
// Indicate that we aborted marking before doing any mixed GCs. |
|
276 |
void abort_time_to_mixed_tracking(); |
|
277 |
public: |
|
278 |
||
49375 | 279 |
G1Policy(STWGCTimer* gc_timer); |
38076 | 280 |
|
49375 | 281 |
virtual ~G1Policy(); |
38076 | 282 |
|
283 |
G1CollectorState* collector_state() const; |
|
284 |
||
285 |
G1GCPhaseTimes* phase_times() const { return _phase_times; } |
|
286 |
||
49375 | 287 |
// Check the current value of the young list RSet lengths and |
288 |
// compare it against the last prediction. If the current value is |
|
289 |
// higher, recalculate the young list target length prediction. |
|
38076 | 290 |
void revise_young_list_target_length_if_necessary(size_t rs_lengths); |
291 |
||
49375 | 292 |
// This should be called after the heap is resized. |
38076 | 293 |
void record_new_heap_size(uint new_number_of_regions); |
294 |
||
295 |
void init(G1CollectedHeap* g1h, G1CollectionSet* collection_set); |
|
296 |
||
49375 | 297 |
void note_gc_start(); |
38076 | 298 |
|
299 |
bool need_to_start_conc_mark(const char* source, size_t alloc_word_size = 0); |
|
300 |
||
301 |
bool about_to_start_mixed_phase() const; |
|
302 |
||
49375 | 303 |
// Record the start and end of an evacuation pause. |
38076 | 304 |
void record_collection_pause_start(double start_time_sec); |
305 |
void record_collection_pause_end(double pause_time_ms, size_t cards_scanned, size_t heap_used_bytes_before_gc); |
|
306 |
||
49375 | 307 |
// Record the start and end of a full collection. |
38076 | 308 |
void record_full_collection_start(); |
309 |
void record_full_collection_end(); |
|
310 |
||
49375 | 311 |
// Must currently be called while the world is stopped. |
38076 | 312 |
void record_concurrent_mark_init_end(double mark_init_elapsed_time_ms); |
313 |
||
49375 | 314 |
// Record start and end of remark. |
38076 | 315 |
void record_concurrent_mark_remark_start(); |
316 |
void record_concurrent_mark_remark_end(); |
|
317 |
||
49375 | 318 |
// Record start, end, and completion of cleanup. |
38076 | 319 |
void record_concurrent_mark_cleanup_start(); |
320 |
void record_concurrent_mark_cleanup_end(); |
|
321 |
void record_concurrent_mark_cleanup_completed(); |
|
322 |
||
49375 | 323 |
void print_phases(); |
38076 | 324 |
|
49375 | 325 |
// Record how much space we copied during a GC. This is typically |
326 |
// called when a GC alloc region is being retired. |
|
38076 | 327 |
void record_bytes_copied_during_gc(size_t bytes) { |
328 |
_bytes_copied_during_gc += bytes; |
|
329 |
} |
|
330 |
||
49375 | 331 |
// The amount of space we copied during a GC. |
38076 | 332 |
size_t bytes_copied_during_gc() const { |
333 |
return _bytes_copied_during_gc; |
|
334 |
} |
|
335 |
||
336 |
bool next_gc_should_be_mixed(const char* true_action_str, |
|
337 |
const char* false_action_str) const; |
|
338 |
||
49375 | 339 |
void finalize_collection_set(double target_pause_time_ms, G1SurvivorRegions* survivor); |
38076 | 340 |
private: |
341 |
// Set the state to start a concurrent marking cycle and clear |
|
342 |
// _initiate_conc_mark_if_possible because it has now been |
|
343 |
// acted on. |
|
344 |
void initiate_conc_mark(); |
|
345 |
||
346 |
public: |
|
49375 | 347 |
// This sets the initiate_conc_mark_if_possible() flag to start a |
348 |
// new cycle, as long as we are not already in one. It's best if it |
|
349 |
// is called during a safepoint when the test whether a cycle is in |
|
350 |
// progress or not is stable. |
|
38076 | 351 |
bool force_initial_mark_if_outside_cycle(GCCause::Cause gc_cause); |
352 |
||
49375 | 353 |
// This is called at the very beginning of an evacuation pause (it |
354 |
// has to be the first thing that the pause does). If |
|
355 |
// initiate_conc_mark_if_possible() is true, and the concurrent |
|
356 |
// marking thread has completed its work during the previous cycle, |
|
357 |
// it will set during_initial_mark_pause() to so that the pause does |
|
358 |
// the initial-mark work and start a marking cycle. |
|
38076 | 359 |
void decide_on_conc_mark_initiation(); |
360 |
||
361 |
void finished_recalculating_age_indexes(bool is_survivors) { |
|
362 |
if (is_survivors) { |
|
363 |
_survivor_surv_rate_group->finished_recalculating_age_indexes(); |
|
364 |
} else { |
|
365 |
_short_lived_surv_rate_group->finished_recalculating_age_indexes(); |
|
366 |
} |
|
367 |
} |
|
368 |
||
369 |
size_t young_list_target_length() const { return _young_list_target_length; } |
|
370 |
||
38106 | 371 |
bool should_allocate_mutator_region() const; |
38076 | 372 |
|
373 |
bool can_expand_young_list() const; |
|
374 |
||
375 |
uint young_list_max_length() const { |
|
376 |
return _young_list_max_length; |
|
377 |
} |
|
378 |
||
379 |
bool adaptive_young_list_length() const; |
|
380 |
||
49375 | 381 |
bool should_process_references() const { |
38076 | 382 |
return true; |
383 |
} |
|
384 |
||
38183
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38109
diff
changeset
|
385 |
void transfer_survivors_to_cset(const G1SurvivorRegions* survivors); |
cb68e4923223
8150721: Don't explicitly manage G1 young regions in YoungList
mgerdin
parents:
38109
diff
changeset
|
386 |
|
38076 | 387 |
private: |
388 |
// |
|
389 |
// Survivor regions policy. |
|
390 |
// |
|
391 |
||
392 |
// Current tenuring threshold, set to 0 if the collector reaches the |
|
393 |
// maximum amount of survivors regions. |
|
394 |
uint _tenuring_threshold; |
|
395 |
||
396 |
// The limit on the number of regions allocated for survivors. |
|
397 |
uint _max_survivor_regions; |
|
398 |
||
399 |
AgeTable _survivors_age_table; |
|
400 |
||
40914
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
39698
diff
changeset
|
401 |
size_t desired_survivor_size() const; |
38076 | 402 |
public: |
403 |
uint tenuring_threshold() const { return _tenuring_threshold; } |
|
404 |
||
405 |
uint max_survivor_regions() { |
|
406 |
return _max_survivor_regions; |
|
407 |
} |
|
408 |
||
409 |
void note_start_adding_survivor_regions() { |
|
410 |
_survivor_surv_rate_group->start_adding_regions(); |
|
411 |
} |
|
412 |
||
413 |
void note_stop_adding_survivor_regions() { |
|
414 |
_survivor_surv_rate_group->stop_adding_regions(); |
|
415 |
} |
|
416 |
||
417 |
void record_age_table(AgeTable* age_table) { |
|
418 |
_survivors_age_table.merge(age_table); |
|
419 |
} |
|
420 |
||
40914
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
39698
diff
changeset
|
421 |
void print_age_table(); |
90c87069b39c
8164936: G1 age table printout contains contents from previous GC
tschatzl
parents:
39698
diff
changeset
|
422 |
|
38076 | 423 |
void update_max_gc_locker_expansion(); |
424 |
||
425 |
void update_survivors_policy(); |
|
426 |
}; |
|
427 |
||
49375 | 428 |
#endif // SHARE_VM_GC_G1_G1POLICY_HPP |