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 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1GCPHASETIMESLOG_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_G1GCPHASETIMESLOG_HPP
27
28 #include "memory/allocation.hpp"
29 #include "gc_interface/gcCause.hpp"
30
31 template <class T>
32 class WorkerDataArray : public CHeapObj<mtGC> {
33 T* _data;
34 uint _length;
35 const char* _print_format;
36 bool _print_sum;
37
38 NOT_PRODUCT(static const T _uninitialized;)
39
40 // We are caching the sum and average to only have to calculate them once.
41 // This is not done in an MT-safe way. It is intended to allow single
42 // threaded code to call sum() and average() multiple times in any order
43 // without having to worry about the cost.
44 bool _has_new_data;
45 T _sum;
46 double _average;
47
48 public:
49 WorkerDataArray(uint length, const char* print_format, bool print_sum = true) :
50 _length(length), _print_format(print_format), _print_sum(print_sum), _has_new_data(true) {
51 assert(length > 0, "Must have some workers to store data for");
52 _data = NEW_C_HEAP_ARRAY(T, _length, mtGC);
53 }
54
55 ~WorkerDataArray() {
56 FREE_C_HEAP_ARRAY(T, _data);
57 }
58
59 void set(uint worker_i, T value) {
60 assert(worker_i < _length, err_msg("Worker %d is greater than max: %d", worker_i, _length));
61 assert(_data[worker_i] == (T)-1, err_msg("Overwriting data for worker %d", worker_i));
62 _data[worker_i] = value;
63 _has_new_data = true;
64 }
65
66 T get(uint worker_i) {
67 assert(worker_i < _length, err_msg("Worker %d is greater than max: %d", worker_i, _length));
68 assert(_data[worker_i] != (T)-1, err_msg("No data to add to for worker %d", worker_i));
69 return _data[worker_i];
70 }
71
72 void add(uint worker_i, T value) {
73 assert(worker_i < _length, err_msg("Worker %d is greater than max: %d", worker_i, _length));
74 assert(_data[worker_i] != (T)-1, err_msg("No data to add to for worker %d", worker_i));
75 _data[worker_i] += value;
76 _has_new_data = true;
77 }
78
79 double average(){
80 if (_has_new_data) {
81 calculate_totals();
82 }
83 return _average;
84 }
85
86 T sum() {
87 if (_has_new_data) {
88 calculate_totals();
89 }
90 return _sum;
91 }
92
93 void print(int level, const char* title);
94
95 void reset() PRODUCT_RETURN;
96 void verify() PRODUCT_RETURN;
97
98 private:
99
100 void calculate_totals(){
101 _sum = (T)0;
102 for (uint i = 0; i < _length; ++i) {
103 _sum += _data[i];
104 }
105 _average = (double)_sum / (double)_length;
106 _has_new_data = false;
107 }
108 };
109
110 class G1GCPhaseTimes : public CHeapObj<mtGC> {
111
112 private:
113 uint _active_gc_threads;
114 uint _max_gc_threads;
115
116 WorkerDataArray<double> _last_gc_worker_start_times_ms;
117 WorkerDataArray<double> _last_ext_root_scan_times_ms;
118 WorkerDataArray<double> _last_satb_filtering_times_ms;
119 WorkerDataArray<double> _last_update_rs_times_ms;
120 WorkerDataArray<int> _last_update_rs_processed_buffers;
121 WorkerDataArray<double> _last_scan_rs_times_ms;
122 WorkerDataArray<double> _last_strong_code_root_scan_times_ms;
123 WorkerDataArray<double> _last_obj_copy_times_ms;
124 WorkerDataArray<double> _last_termination_times_ms;
125 WorkerDataArray<size_t> _last_termination_attempts;
126 WorkerDataArray<double> _last_gc_worker_end_times_ms;
127 WorkerDataArray<double> _last_gc_worker_times_ms;
128 WorkerDataArray<double> _last_gc_worker_other_times_ms;
129
130 double _cur_collection_par_time_ms;
131 double _cur_collection_code_root_fixup_time_ms;
132 double _cur_strong_code_root_purge_time_ms;
133
134 double _cur_evac_fail_recalc_used;
135 double _cur_evac_fail_restore_remsets;
136 double _cur_evac_fail_remove_self_forwards;
137
138 double _cur_string_dedup_fixup_time_ms;
139 WorkerDataArray<double> _cur_string_dedup_queue_fixup_worker_times_ms;
140 WorkerDataArray<double> _cur_string_dedup_table_fixup_worker_times_ms;
141
142 double _cur_clear_ct_time_ms;
143 double _cur_ref_proc_time_ms;
144 double _cur_ref_enq_time_ms;
145
146 double _cur_collection_start_sec;
147 double _root_region_scan_wait_time_ms;
148
149 double _recorded_young_cset_choice_time_ms;
150 double _recorded_non_young_cset_choice_time_ms;
151
152 WorkerDataArray<double> _last_redirty_logged_cards_time_ms;
153 WorkerDataArray<size_t> _last_redirty_logged_cards_processed_cards;
154 double _recorded_redirty_logged_cards_time_ms;
155
156 double _recorded_young_free_cset_time_ms;
157 double _recorded_non_young_free_cset_time_ms;
158
159 double _cur_fast_reclaim_humongous_time_ms;
160 double _cur_fast_reclaim_humongous_register_time_ms;
161 size_t _cur_fast_reclaim_humongous_total;
162 size_t _cur_fast_reclaim_humongous_candidates;
163 size_t _cur_fast_reclaim_humongous_reclaimed;
164
165 double _cur_verify_before_time_ms;
166 double _cur_verify_after_time_ms;
167
168 // Helper methods for detailed logging
169 void print_stats(int level, const char* str, double value);
170 void print_stats(int level, const char* str, size_t value);
171 void print_stats(int level, const char* str, double value, uint workers);
172
173 public:
174 G1GCPhaseTimes(uint max_gc_threads);
175 void note_gc_start(uint active_gc_threads);
176 void note_gc_end();
177 void print(double pause_time_sec);
178
179 void record_gc_worker_start_time(uint worker_i, double ms) {
180 _last_gc_worker_start_times_ms.set(worker_i, ms);
181 }
182
183 void record_ext_root_scan_time(uint worker_i, double ms) {
184 _last_ext_root_scan_times_ms.set(worker_i, ms);
185 }
186
187 void record_satb_filtering_time(uint worker_i, double ms) {
188 _last_satb_filtering_times_ms.set(worker_i, ms);
189 }
190
191 void record_update_rs_time(uint worker_i, double ms) {
192 _last_update_rs_times_ms.set(worker_i, ms);
193 }
194
195 void record_update_rs_processed_buffers(uint worker_i, int processed_buffers) {
196 _last_update_rs_processed_buffers.set(worker_i, processed_buffers);
197 }
198
199 void record_scan_rs_time(uint worker_i, double ms) {
200 _last_scan_rs_times_ms.set(worker_i, ms);
201 }
202
203 void record_strong_code_root_scan_time(uint worker_i, double ms) {
204 _last_strong_code_root_scan_times_ms.set(worker_i, ms);
205 }
206
207 void record_obj_copy_time(uint worker_i, double ms) {
208 _last_obj_copy_times_ms.set(worker_i, ms);
209 }
210
211 void add_obj_copy_time(uint worker_i, double ms) {
212 _last_obj_copy_times_ms.add(worker_i, ms);
213 }
214
215 void record_termination(uint worker_i, double ms, size_t attempts) {
216 _last_termination_times_ms.set(worker_i, ms);
217 _last_termination_attempts.set(worker_i, attempts);
218 }
219
220 void record_gc_worker_end_time(uint worker_i, double ms) {
221 _last_gc_worker_end_times_ms.set(worker_i, ms);
222 }
223
224 void record_clear_ct_time(double ms) {
225 _cur_clear_ct_time_ms = ms;
226 }
227
228 void record_par_time(double ms) {
229 _cur_collection_par_time_ms = ms;
230 }
231
232 void record_code_root_fixup_time(double ms) {
233 _cur_collection_code_root_fixup_time_ms = ms;
234 }
235
236 void record_strong_code_root_purge_time(double ms) {
237 _cur_strong_code_root_purge_time_ms = ms;
238 }
239
240 void record_evac_fail_recalc_used_time(double ms) {
241 _cur_evac_fail_recalc_used = ms;
242 }
243
244 void record_evac_fail_restore_remsets(double ms) {
245 _cur_evac_fail_restore_remsets = ms;
246 }
247
248 void record_evac_fail_remove_self_forwards(double ms) {
249 _cur_evac_fail_remove_self_forwards = ms;
250 }
251
252 void note_string_dedup_fixup_start();
253 void note_string_dedup_fixup_end();
254
255 void record_string_dedup_fixup_time(double ms) {
256 _cur_string_dedup_fixup_time_ms = ms;
257 }
258
259 void record_string_dedup_queue_fixup_worker_time(uint worker_id, double ms) {
260 _cur_string_dedup_queue_fixup_worker_times_ms.set(worker_id, ms);
261 }
262
263 void record_string_dedup_table_fixup_worker_time(uint worker_id, double ms) {
264 _cur_string_dedup_table_fixup_worker_times_ms.set(worker_id, ms);
265 }
266
267 void record_ref_proc_time(double ms) {
268 _cur_ref_proc_time_ms = ms;
269 }
270
271 void record_ref_enq_time(double ms) {
272 _cur_ref_enq_time_ms = ms;
273 }
274
275 void record_root_region_scan_wait_time(double time_ms) {
276 _root_region_scan_wait_time_ms = time_ms;
277 }
278
279 void record_young_free_cset_time_ms(double time_ms) {
280 _recorded_young_free_cset_time_ms = time_ms;
281 }
282
283 void record_non_young_free_cset_time_ms(double time_ms) {
284 _recorded_non_young_free_cset_time_ms = time_ms;
285 }
286
287 void record_fast_reclaim_humongous_stats(double time_ms, size_t total, size_t candidates) {
288 _cur_fast_reclaim_humongous_register_time_ms = time_ms;
289 _cur_fast_reclaim_humongous_total = total;
290 _cur_fast_reclaim_humongous_candidates = candidates;
291 }
292
293 void record_fast_reclaim_humongous_time_ms(double value, size_t reclaimed) {
294 _cur_fast_reclaim_humongous_time_ms = value;
295 _cur_fast_reclaim_humongous_reclaimed = reclaimed;
296 }
297
298 void record_young_cset_choice_time_ms(double time_ms) {
299 _recorded_young_cset_choice_time_ms = time_ms;
300 }
301
302 void record_non_young_cset_choice_time_ms(double time_ms) {
303 _recorded_non_young_cset_choice_time_ms = time_ms;
304 }
305
306 void record_redirty_logged_cards_time_ms(uint worker_i, double time_ms) {
307 _last_redirty_logged_cards_time_ms.set(worker_i, time_ms);
308 }
309
310 void record_redirty_logged_cards_processed_cards(uint worker_i, size_t processed_buffers) {
311 _last_redirty_logged_cards_processed_cards.set(worker_i, processed_buffers);
312 }
313
314 void record_redirty_logged_cards_time_ms(double time_ms) {
315 _recorded_redirty_logged_cards_time_ms = time_ms;
316 }
317
318 void record_cur_collection_start_sec(double time_ms) {
319 _cur_collection_start_sec = time_ms;
320 }
321
322 void record_verify_before_time_ms(double time_ms) {
323 _cur_verify_before_time_ms = time_ms;
324 }
325
326 void record_verify_after_time_ms(double time_ms) {
327 _cur_verify_after_time_ms = time_ms;
328 }
329
330 double accounted_time_ms();
331
332 double cur_collection_start_sec() {
333 return _cur_collection_start_sec;
347
348 double young_cset_choice_time_ms() {
349 return _recorded_young_cset_choice_time_ms;
350 }
351
352 double young_free_cset_time_ms() {
353 return _recorded_young_free_cset_time_ms;
354 }
355
356 double non_young_cset_choice_time_ms() {
357 return _recorded_non_young_cset_choice_time_ms;
358 }
359
360 double non_young_free_cset_time_ms() {
361 return _recorded_non_young_free_cset_time_ms;
362 }
363
364 double fast_reclaim_humongous_time_ms() {
365 return _cur_fast_reclaim_humongous_time_ms;
366 }
367
368 double average_last_update_rs_time() {
369 return _last_update_rs_times_ms.average();
370 }
371
372 int sum_last_update_rs_processed_buffers() {
373 return _last_update_rs_processed_buffers.sum();
374 }
375
376 double average_last_scan_rs_time(){
377 return _last_scan_rs_times_ms.average();
378 }
379
380 double average_last_strong_code_root_scan_time(){
381 return _last_strong_code_root_scan_times_ms.average();
382 }
383
384 double average_last_obj_copy_time() {
385 return _last_obj_copy_times_ms.average();
386 }
387
388 double average_last_termination_time() {
389 return _last_termination_times_ms.average();
390 }
391
392 double average_last_ext_root_scan_time() {
393 return _last_ext_root_scan_times_ms.average();
394 }
395
396 double average_last_satb_filtering_times_ms() {
397 return _last_satb_filtering_times_ms.average();
398 }
399 };
400
401 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1GCPHASETIMESLOG_HPP
|
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 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1GCPHASETIMESLOG_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_G1GCPHASETIMESLOG_HPP
27
28 #include "memory/allocation.hpp"
29
30 class LineBuffer;
31
32 template <class T> class WorkerDataArray;
33
34 class G1GCPhaseTimes : public CHeapObj<mtGC> {
35 friend class G1GCParPhasePrinter;
36
37 uint _active_gc_threads;
38 uint _max_gc_threads;
39
40 public:
41 enum GCParPhases {
42 GCWorkerStart,
43 ExtRootScan,
44 SATBFiltering,
45 UpdateRS,
46 ScanRS,
47 CodeRoots,
48 ObjCopy,
49 Termination,
50 Other,
51 GCWorkerTotal,
52 GCWorkerEnd,
53 StringDedupQueueFixup,
54 StringDedupTableFixup,
55 RedirtyCards,
56 GCParPhasesSentinel
57 };
58
59 private:
60 // Markers for grouping the phases in the GCPhases enum above
61 static const int GCMainParPhasesLast = GCWorkerEnd;
62 static const int StringDedupPhasesFirst = StringDedupQueueFixup;
63 static const int StringDedupPhasesLast = StringDedupTableFixup;
64
65 WorkerDataArray<double>* _gc_par_phases[GCParPhasesSentinel];
66 WorkerDataArray<size_t>* _update_rs_processed_buffers;
67 WorkerDataArray<size_t>* _termination_attempts;
68 WorkerDataArray<size_t>* _redirtied_cards;
69
70 double _cur_collection_par_time_ms;
71 double _cur_collection_code_root_fixup_time_ms;
72 double _cur_strong_code_root_purge_time_ms;
73
74 double _cur_evac_fail_recalc_used;
75 double _cur_evac_fail_restore_remsets;
76 double _cur_evac_fail_remove_self_forwards;
77
78 double _cur_string_dedup_fixup_time_ms;
79
80 double _cur_clear_ct_time_ms;
81 double _cur_ref_proc_time_ms;
82 double _cur_ref_enq_time_ms;
83
84 double _cur_collection_start_sec;
85 double _root_region_scan_wait_time_ms;
86
87 double _recorded_young_cset_choice_time_ms;
88 double _recorded_non_young_cset_choice_time_ms;
89
90 double _recorded_redirty_logged_cards_time_ms;
91
92 double _recorded_young_free_cset_time_ms;
93 double _recorded_non_young_free_cset_time_ms;
94
95 double _cur_fast_reclaim_humongous_time_ms;
96 double _cur_fast_reclaim_humongous_register_time_ms;
97 size_t _cur_fast_reclaim_humongous_total;
98 size_t _cur_fast_reclaim_humongous_candidates;
99 size_t _cur_fast_reclaim_humongous_reclaimed;
100
101 double _cur_verify_before_time_ms;
102 double _cur_verify_after_time_ms;
103
104 // Helper methods for detailed logging
105 void print_stats(int level, const char* str, double value);
106 void print_stats(int level, const char* str, size_t value);
107 void print_stats(int level, const char* str, double value, uint workers);
108
109 public:
110 G1GCPhaseTimes(uint max_gc_threads);
111 void note_gc_start(uint active_gc_threads, bool mark_in_progress);
112 void note_gc_end();
113 void print(double pause_time_sec);
114
115 // record the time a phase took in seconds
116 void record_time_secs(GCParPhases phase, uint worker_i, double secs);
117
118 // add a number of seconds to a phase
119 void add_time_secs(GCParPhases phase, uint worker_i, double secs);
120
121 void record_sub_count(GCParPhases phase, uint worker_i, size_t count);
122
123 // return the average time for a phase in milliseconds
124 double average_time_ms(GCParPhases phase);
125
126 size_t sub_count_sum(GCParPhases phase);
127
128 private:
129 double get_time_ms(GCParPhases phase, uint worker_i);
130 double sum_time_ms(GCParPhases phase);
131 double min_time_ms(GCParPhases phase);
132 double max_time_ms(GCParPhases phase);
133 size_t get_sub_count(GCParPhases phase, uint worker_i);
134 size_t sum_sub_count(GCParPhases phase);
135 double average_sub_count(GCParPhases phase);
136 size_t min_sub_count(GCParPhases phase);
137 size_t max_sub_count(GCParPhases phase);
138
139 public:
140
141 void record_clear_ct_time(double ms) {
142 _cur_clear_ct_time_ms = ms;
143 }
144
145 void record_par_time(double ms) {
146 _cur_collection_par_time_ms = ms;
147 }
148
149 void record_code_root_fixup_time(double ms) {
150 _cur_collection_code_root_fixup_time_ms = ms;
151 }
152
153 void record_strong_code_root_purge_time(double ms) {
154 _cur_strong_code_root_purge_time_ms = ms;
155 }
156
157 void record_evac_fail_recalc_used_time(double ms) {
158 _cur_evac_fail_recalc_used = ms;
159 }
160
161 void record_evac_fail_restore_remsets(double ms) {
162 _cur_evac_fail_restore_remsets = ms;
163 }
164
165 void record_evac_fail_remove_self_forwards(double ms) {
166 _cur_evac_fail_remove_self_forwards = ms;
167 }
168
169 void record_string_dedup_fixup_time(double ms) {
170 _cur_string_dedup_fixup_time_ms = ms;
171 }
172
173 void record_ref_proc_time(double ms) {
174 _cur_ref_proc_time_ms = ms;
175 }
176
177 void record_ref_enq_time(double ms) {
178 _cur_ref_enq_time_ms = ms;
179 }
180
181 void record_root_region_scan_wait_time(double time_ms) {
182 _root_region_scan_wait_time_ms = time_ms;
183 }
184
185 void record_young_free_cset_time_ms(double time_ms) {
186 _recorded_young_free_cset_time_ms = time_ms;
187 }
188
189 void record_non_young_free_cset_time_ms(double time_ms) {
190 _recorded_non_young_free_cset_time_ms = time_ms;
191 }
192
193 void record_fast_reclaim_humongous_stats(double time_ms, size_t total, size_t candidates) {
194 _cur_fast_reclaim_humongous_register_time_ms = time_ms;
195 _cur_fast_reclaim_humongous_total = total;
196 _cur_fast_reclaim_humongous_candidates = candidates;
197 }
198
199 void record_fast_reclaim_humongous_time_ms(double value, size_t reclaimed) {
200 _cur_fast_reclaim_humongous_time_ms = value;
201 _cur_fast_reclaim_humongous_reclaimed = reclaimed;
202 }
203
204 void record_young_cset_choice_time_ms(double time_ms) {
205 _recorded_young_cset_choice_time_ms = time_ms;
206 }
207
208 void record_non_young_cset_choice_time_ms(double time_ms) {
209 _recorded_non_young_cset_choice_time_ms = time_ms;
210 }
211
212 void record_redirty_logged_cards_time_ms(double time_ms) {
213 _recorded_redirty_logged_cards_time_ms = time_ms;
214 }
215
216 void record_cur_collection_start_sec(double time_ms) {
217 _cur_collection_start_sec = time_ms;
218 }
219
220 void record_verify_before_time_ms(double time_ms) {
221 _cur_verify_before_time_ms = time_ms;
222 }
223
224 void record_verify_after_time_ms(double time_ms) {
225 _cur_verify_after_time_ms = time_ms;
226 }
227
228 double accounted_time_ms();
229
230 double cur_collection_start_sec() {
231 return _cur_collection_start_sec;
245
246 double young_cset_choice_time_ms() {
247 return _recorded_young_cset_choice_time_ms;
248 }
249
250 double young_free_cset_time_ms() {
251 return _recorded_young_free_cset_time_ms;
252 }
253
254 double non_young_cset_choice_time_ms() {
255 return _recorded_non_young_cset_choice_time_ms;
256 }
257
258 double non_young_free_cset_time_ms() {
259 return _recorded_non_young_free_cset_time_ms;
260 }
261
262 double fast_reclaim_humongous_time_ms() {
263 return _cur_fast_reclaim_humongous_time_ms;
264 }
265 };
266
267 class G1GCParPhaseTimesTracker : public StackObj {
268 double _start_time;
269 G1GCPhaseTimes::GCParPhases _phase;
270 G1GCPhaseTimes* _phase_times;
271 uint _worker_id;
272 public:
273 G1GCParPhaseTimesTracker(G1GCPhaseTimes* phase_times, G1GCPhaseTimes::GCParPhases phase, uint worker_id);
274 ~G1GCParPhaseTimesTracker();
275 };
276
277 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1GCPHASETIMESLOG_HPP
|