< prev index next >

src/share/vm/gc_implementation/g1/g1CollectorPolicy.hpp

Print this page

        

*** 1,7 **** /* ! * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. --- 1,7 ---- /* ! * Copyright (c) 2001, 2015, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation.
*** 25,34 **** --- 25,35 ---- #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTORPOLICY_HPP #define SHARE_VM_GC_IMPLEMENTATION_G1_G1COLLECTORPOLICY_HPP #include "gc_implementation/g1/collectionSetChooser.hpp" #include "gc_implementation/g1/g1Allocator.hpp" + #include "gc_implementation/g1/g1CollectorState.hpp" #include "gc_implementation/g1/g1MMUTracker.hpp" #include "memory/collectorPolicy.hpp" // A G1CollectorPolicy makes policy decisions that determine the // characteristics of the collector. Examples include:
*** 191,229 **** TraceYoungGenTimeData _trace_young_gen_time_data; TraceOldGenTimeData _trace_old_gen_time_data; double _stop_world_start; - // indicates whether we are in young or mixed GC mode - bool _gcs_are_young; - uint _young_list_target_length; uint _young_list_fixed_length; // The max number of regions we can extend the eden by while the GC // locker is active. This should be >= _young_list_target_length; uint _young_list_max_length; - bool _last_gc_was_young; - - bool _during_marking; - bool _in_marking_window; - bool _in_marking_window_im; - SurvRateGroup* _short_lived_surv_rate_group; SurvRateGroup* _survivor_surv_rate_group; // add here any more surv rate groups double _gc_overhead_perc; double _reserve_factor; uint _reserve_regions; - bool during_marking() { - return _during_marking; - } - enum PredictionConstants { TruncatedSeqLength = 10 }; TruncatedSeq* _alloc_rate_ms_seq; --- 192,217 ----
*** 361,371 **** return (size_t) ((double) rs_length * predict_mixed_cards_per_entry_ratio()); } double predict_rs_scan_time_ms(size_t card_num) { ! if (gcs_are_young()) { return (double) card_num * get_new_prediction(_cost_per_entry_ms_seq); } else { return predict_mixed_rs_scan_time_ms(card_num); } } --- 349,359 ---- return (size_t) ((double) rs_length * predict_mixed_cards_per_entry_ratio()); } double predict_rs_scan_time_ms(size_t card_num) { ! if (collector_state()->gcs_are_young()) { return (double) card_num * get_new_prediction(_cost_per_entry_ms_seq); } else { return predict_mixed_rs_scan_time_ms(card_num); } }
*** 388,398 **** get_new_prediction(_cost_per_byte_ms_during_cm_seq); } } double predict_object_copy_time_ms(size_t bytes_to_copy) { ! if (_in_marking_window && !_in_marking_window_im) { return predict_object_copy_time_ms_during_cm(bytes_to_copy); } else { return (double) bytes_to_copy * get_new_prediction(_cost_per_byte_ms_seq); } --- 376,386 ---- get_new_prediction(_cost_per_byte_ms_during_cm_seq); } } double predict_object_copy_time_ms(size_t bytes_to_copy) { ! if (collector_state()->during_concurrent_mark()) { return predict_object_copy_time_ms_during_cm(bytes_to_copy); } else { return (double) bytes_to_copy * get_new_prediction(_cost_per_byte_ms_seq); }
*** 426,436 **** survivor_cset_region_length(); } double predict_survivor_regions_evac_time(); void cset_regions_freed() { ! bool propagate = _last_gc_was_young && !_in_marking_window; _short_lived_surv_rate_group->all_surviving_words_recorded(propagate); _survivor_surv_rate_group->all_surviving_words_recorded(propagate); // also call it on any more surv rate groups } --- 414,424 ---- survivor_cset_region_length(); } double predict_survivor_regions_evac_time(); void cset_regions_freed() { ! bool propagate = collector_state()->should_propagate(); _short_lived_surv_rate_group->all_surviving_words_recorded(propagate); _survivor_surv_rate_group->all_surviving_words_recorded(propagate); // also call it on any more surv rate groups }
*** 550,586 **** double recent_avg_pause_time_ratio() { return _recent_avg_pause_time_ratio; } - // At the end of a pause we check the heap occupancy and we decide - // whether we will start a marking cycle during the next pause. If - // we decide that we want to do that, we will set this parameter to - // true. So, this parameter will stay true between the end of a - // pause and the beginning of a subsequent pause (not necessarily - // the next one, see the comments on the next field) when we decide - // that we will indeed start a marking cycle and do the initial-mark - // work. - volatile bool _initiate_conc_mark_if_possible; - - // If initiate_conc_mark_if_possible() is set at the beginning of a - // pause, it is a suggestion that the pause should start a marking - // cycle by doing the initial-mark work. However, it is possible - // that the concurrent marking thread is still finishing up the - // previous marking cycle (e.g., clearing the next marking - // bitmap). If that is the case we cannot start a new cycle and - // we'll have to wait for the concurrent marking thread to finish - // what it is doing. In this case we will postpone the marking cycle - // initiation decision for the next pause. When we eventually decide - // to start a cycle, we will set _during_initial_mark_pause which - // will stay true until the end of the initial-mark pause and it's - // the condition that indicates that a pause is doing the - // initial-mark work. - volatile bool _during_initial_mark_pause; - - bool _last_young_gc; - // This set of variables tracks the collector efficiency, in order to // determine whether we should initiate a new marking. double _cur_mark_stop_world_time_ms; double _mark_remark_start_sec; double _mark_cleanup_start_sec; --- 538,547 ----
*** 645,654 **** --- 606,617 ---- virtual CollectorPolicy::Name kind() { return CollectorPolicy::G1CollectorPolicyKind; } + G1CollectorState* collector_state(); + G1GCPhaseTimes* phase_times() const { return _phase_times; } // Check the current value of the young list RSet lengths and // compare it against the last prediction. If the current value is // higher, recalculate the young list target length prediction.
*** 784,801 **** #ifndef PRODUCT void print_collection_set(HeapRegion* list_head, outputStream* st); #endif // !PRODUCT - bool initiate_conc_mark_if_possible() { return _initiate_conc_mark_if_possible; } - void set_initiate_conc_mark_if_possible() { _initiate_conc_mark_if_possible = true; } - void clear_initiate_conc_mark_if_possible() { _initiate_conc_mark_if_possible = false; } - - bool during_initial_mark_pause() { return _during_initial_mark_pause; } - void set_during_initial_mark_pause() { _during_initial_mark_pause = true; } - void clear_during_initial_mark_pause(){ _during_initial_mark_pause = false; } - // This sets the initiate_conc_mark_if_possible() flag to start a // new cycle, as long as we are not already in one. It's best if it // is called during a safepoint when the test whether a cycle is in // progress or not is stable. bool force_initial_mark_if_outside_cycle(GCCause::Cause gc_cause); --- 747,756 ----
*** 835,851 **** uint young_list_max_length() { return _young_list_max_length; } - bool gcs_are_young() { - return _gcs_are_young; - } - void set_gcs_are_young(bool gcs_are_young) { - _gcs_are_young = gcs_are_young; - } - bool adaptive_young_list_length() { return _young_gen_sizer->adaptive_young_list_length(); } private: --- 790,799 ----
< prev index next >