1 /* 2 * Copyright (c) 2018, Red Hat, Inc. and/or its affiliates. 3 * 4 * This code is free software; you can redistribute it and/or modify it 5 * under the terms of the GNU General Public License version 2 only, as 6 * published by the Free Software Foundation. 7 * 8 * This code is distributed in the hope that it will be useful, but WITHOUT 9 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 10 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 11 * version 2 for more details (a copy is included in the LICENSE file that 12 * accompanied this code). 13 * 14 * You should have received a copy of the GNU General Public License version 15 * 2 along with this work; if not, write to the Free Software Foundation, 16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 17 * 18 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 19 * or visit www.oracle.com if you need additional information or have any 20 * questions. 21 * 22 */ 23 24 #ifndef SHARE_VM_GC_SHENANDOAH_HEURISTICS_SHENANDOAHADAPTIVEHEURISTICS_HPP 25 #define SHARE_VM_GC_SHENANDOAH_HEURISTICS_SHENANDOAHADAPTIVEHEURISTICS_HPP 26 27 #include "gc_implementation/shenandoah/shenandoahHeuristics.hpp" 28 29 class ShenandoahAdaptiveHeuristics : public ShenandoahHeuristics { 30 private: 31 static const intx MaxNormalStep = 5; // max step towards goal under normal conditions 32 static const intx DegeneratedGC_Hit = 10; // how much to step on degenerated GC 33 static const intx AllocFailure_Hit = 20; // how much to step on allocation failure full GC 34 static const intx UserRequested_Hit = 0; // how much to step on user requested full GC 35 36 uintx _free_threshold; 37 size_t _peak_occupancy; 38 TruncatedSeq* _cycle_gap_history; 39 TruncatedSeq* _conc_mark_duration_history; 40 TruncatedSeq* _conc_uprefs_duration_history; 41 public: 42 ShenandoahAdaptiveHeuristics(); 43 44 virtual ~ShenandoahAdaptiveHeuristics(); 45 46 virtual void choose_collection_set_from_regiondata(ShenandoahCollectionSet* cset, 47 RegionData* data, size_t size, 48 size_t actual_free); 49 50 void handle_cycle_success(); 51 52 void record_cycle_start(); 53 54 virtual void record_phase_time(ShenandoahPhaseTimings::Phase phase, double secs); 55 56 void adjust_free_threshold(intx adj); 57 58 virtual void record_success_concurrent(); 59 60 virtual void record_success_degenerated(); 61 62 virtual void record_success_full(); 63 64 virtual void record_explicit_gc(); 65 66 virtual void record_peak_occupancy(); 67 68 virtual bool should_start_normal_gc() const; 69 70 virtual bool should_start_update_refs(); 71 72 virtual const char* name(); 73 74 virtual bool is_diagnostic(); 75 76 virtual bool is_experimental(); 77 }; 78 79 #endif // SHARE_VM_GC_SHENANDOAH_HEURISTICS_SHENANDOAHADAPTIVEHEURISTICS_HPP