24 |
24 |
25 #ifndef SHARE_VM_GC_G1_G1IHOPCONTROL_HPP |
25 #ifndef SHARE_VM_GC_G1_G1IHOPCONTROL_HPP |
26 #define SHARE_VM_GC_G1_G1IHOPCONTROL_HPP |
26 #define SHARE_VM_GC_G1_G1IHOPCONTROL_HPP |
27 |
27 |
28 #include "memory/allocation.hpp" |
28 #include "memory/allocation.hpp" |
|
29 #include "utilities/numberSeq.hpp" |
|
30 |
|
31 class G1Predictions; |
29 |
32 |
30 // Base class for algorithms that calculate the heap occupancy at which |
33 // Base class for algorithms that calculate the heap occupancy at which |
31 // concurrent marking should start. This heap usage threshold should be relative |
34 // concurrent marking should start. This heap usage threshold should be relative |
32 // to old gen size. |
35 // to old gen size. |
33 class G1IHOPControl : public CHeapObj<mtGC> { |
36 class G1IHOPControl : public CHeapObj<mtGC> { |
93 #ifndef PRODUCT |
96 #ifndef PRODUCT |
94 static void test(); |
97 static void test(); |
95 #endif |
98 #endif |
96 }; |
99 }; |
97 |
100 |
|
101 // This algorithm tries to return a concurrent mark starting occupancy value that |
|
102 // makes sure that during marking the given target occupancy is never exceeded, |
|
103 // based on predictions of current allocation rate and time periods between |
|
104 // initial mark and the first mixed gc. |
|
105 class G1AdaptiveIHOPControl : public G1IHOPControl { |
|
106 size_t _heap_reserve_percent; // Percentage of maximum heap capacity we should avoid to touch |
|
107 size_t _heap_waste_percent; // Percentage of free heap that should be considered as waste. |
|
108 |
|
109 const G1Predictions * _predictor; |
|
110 |
|
111 TruncatedSeq _marking_times_s; |
|
112 TruncatedSeq _allocation_rate_s; |
|
113 |
|
114 size_t _last_allocation_bytes; // Most recent mutator allocation since last GC. |
|
115 // The most recent unrestrained size of the young gen. This is used as an additional |
|
116 // factor in the calculation of the threshold, as the threshold is based on |
|
117 // non-young gen occupancy at the end of GC. For the IHOP threshold, we need to |
|
118 // consider the young gen size during that time too. |
|
119 // Since we cannot know what young gen sizes are used in the future, we will just |
|
120 // use the current one. We expect that this one will be one with a fairly large size, |
|
121 // as there is no marking or mixed gc that could impact its size too much. |
|
122 size_t _last_unrestrained_young_size; |
|
123 |
|
124 bool have_enough_data_for_prediction() const; |
|
125 |
|
126 // The "actual" target threshold the algorithm wants to keep during and at the |
|
127 // end of marking. This is typically lower than the requested threshold, as the |
|
128 // algorithm needs to consider restrictions by the environment. |
|
129 size_t actual_target_threshold() const; |
|
130 protected: |
|
131 virtual double last_marking_length_s() const { return _marking_times_s.last(); } |
|
132 public: |
|
133 G1AdaptiveIHOPControl(double ihop_percent, |
|
134 size_t initial_target_occupancy, |
|
135 G1Predictions const* predictor, |
|
136 size_t heap_reserve_percent, // The percentage of total heap capacity that should not be tapped into. |
|
137 size_t heap_waste_percent); // The percentage of the free space in the heap that we think is not usable for allocation. |
|
138 |
|
139 virtual size_t get_conc_mark_start_threshold(); |
|
140 |
|
141 virtual void update_allocation_info(double allocation_time_s, size_t allocated_bytes, size_t additional_buffer_size); |
|
142 virtual void update_marking_length(double marking_length_s); |
|
143 |
|
144 virtual void print(); |
|
145 #ifndef PRODUCT |
|
146 static void test(); |
|
147 #endif |
|
148 }; |
|
149 |
98 #endif // SHARE_VM_GC_G1_G1IHOPCONTROL_HPP |
150 #endif // SHARE_VM_GC_G1_G1IHOPCONTROL_HPP |