1 /*
2 * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved.
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 *
233 LineBuffer(level).append_and_print_cr("[%s: %.1lf ms]", str, value);
234 }
235
236 void G1GCPhaseTimes::print_stats(int level, const char* str, double value, int workers) {
237 LineBuffer(level).append_and_print_cr("[%s: %.1lf ms, GC Workers: %d]", str, value, workers);
238 }
239
240 double G1GCPhaseTimes::accounted_time_ms() {
241 // Subtract the root region scanning wait time. It's initialized to
242 // zero at the start of the pause.
243 double misc_time_ms = _root_region_scan_wait_time_ms;
244
245 misc_time_ms += _cur_collection_par_time_ms;
246
247 // Now subtract the time taken to fix up roots in generated code
248 misc_time_ms += _cur_collection_code_root_fixup_time_ms;
249
250 // Strong code root migration time
251 misc_time_ms += _cur_strong_code_root_migration_time_ms;
252
253 // Subtract the time taken to clean the card table from the
254 // current value of "other time"
255 misc_time_ms += _cur_clear_ct_time_ms;
256
257 return misc_time_ms;
258 }
259
260 void G1GCPhaseTimes::print(double pause_time_sec) {
261 if (_root_region_scan_wait_time_ms > 0.0) {
262 print_stats(1, "Root Region Scan Waiting", _root_region_scan_wait_time_ms);
263 }
264 if (G1CollectedHeap::use_parallel_gc_threads()) {
265 print_stats(1, "Parallel Time", _cur_collection_par_time_ms, _active_gc_threads);
266 _last_gc_worker_start_times_ms.print(2, "GC Worker Start (ms)");
267 _last_ext_root_scan_times_ms.print(2, "Ext Root Scanning (ms)");
268 if (_last_satb_filtering_times_ms.sum() > 0.0) {
269 _last_satb_filtering_times_ms.print(2, "SATB Filtering (ms)");
270 }
271 if (_last_strong_code_root_mark_times_ms.sum() > 0.0) {
272 _last_strong_code_root_mark_times_ms.print(2, "Code Root Marking (ms)");
282 }
283 _last_gc_worker_other_times_ms.print(2, "GC Worker Other (ms)");
284 _last_gc_worker_times_ms.print(2, "GC Worker Total (ms)");
285 _last_gc_worker_end_times_ms.print(2, "GC Worker End (ms)");
286 } else {
287 _last_ext_root_scan_times_ms.print(1, "Ext Root Scanning (ms)");
288 if (_last_satb_filtering_times_ms.sum() > 0.0) {
289 _last_satb_filtering_times_ms.print(1, "SATB Filtering (ms)");
290 }
291 if (_last_strong_code_root_mark_times_ms.sum() > 0.0) {
292 _last_strong_code_root_mark_times_ms.print(1, "Code Root Marking (ms)");
293 }
294 _last_update_rs_times_ms.print(1, "Update RS (ms)");
295 _last_update_rs_processed_buffers.print(2, "Processed Buffers");
296 _last_scan_rs_times_ms.print(1, "Scan RS (ms)");
297 _last_strong_code_root_scan_times_ms.print(1, "Code Root Scanning (ms)");
298 _last_obj_copy_times_ms.print(1, "Object Copy (ms)");
299 }
300 print_stats(1, "Code Root Fixup", _cur_collection_code_root_fixup_time_ms);
301 print_stats(1, "Code Root Migration", _cur_strong_code_root_migration_time_ms);
302 print_stats(1, "Clear CT", _cur_clear_ct_time_ms);
303 double misc_time_ms = pause_time_sec * MILLIUNITS - accounted_time_ms();
304 print_stats(1, "Other", misc_time_ms);
305 if (_cur_verify_before_time_ms > 0.0) {
306 print_stats(2, "Verify Before", _cur_verify_before_time_ms);
307 }
308 print_stats(2, "Choose CSet",
309 (_recorded_young_cset_choice_time_ms +
310 _recorded_non_young_cset_choice_time_ms));
311 print_stats(2, "Ref Proc", _cur_ref_proc_time_ms);
312 print_stats(2, "Ref Enq", _cur_ref_enq_time_ms);
313 print_stats(2, "Free CSet",
314 (_recorded_young_free_cset_time_ms +
315 _recorded_non_young_free_cset_time_ms));
316 if (_cur_verify_after_time_ms > 0.0) {
317 print_stats(2, "Verify After", _cur_verify_after_time_ms);
318 }
319 }
|
1 /*
2 * Copyright (c) 2013, 2014 Oracle and/or its affiliates. All rights reserved.
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 *
233 LineBuffer(level).append_and_print_cr("[%s: %.1lf ms]", str, value);
234 }
235
236 void G1GCPhaseTimes::print_stats(int level, const char* str, double value, int workers) {
237 LineBuffer(level).append_and_print_cr("[%s: %.1lf ms, GC Workers: %d]", str, value, workers);
238 }
239
240 double G1GCPhaseTimes::accounted_time_ms() {
241 // Subtract the root region scanning wait time. It's initialized to
242 // zero at the start of the pause.
243 double misc_time_ms = _root_region_scan_wait_time_ms;
244
245 misc_time_ms += _cur_collection_par_time_ms;
246
247 // Now subtract the time taken to fix up roots in generated code
248 misc_time_ms += _cur_collection_code_root_fixup_time_ms;
249
250 // Strong code root migration time
251 misc_time_ms += _cur_strong_code_root_migration_time_ms;
252
253 // Strong code root purge time
254 misc_time_ms += _cur_strong_code_root_purge_time_ms;
255
256 // Subtract the time taken to clean the card table from the
257 // current value of "other time"
258 misc_time_ms += _cur_clear_ct_time_ms;
259
260 return misc_time_ms;
261 }
262
263 void G1GCPhaseTimes::print(double pause_time_sec) {
264 if (_root_region_scan_wait_time_ms > 0.0) {
265 print_stats(1, "Root Region Scan Waiting", _root_region_scan_wait_time_ms);
266 }
267 if (G1CollectedHeap::use_parallel_gc_threads()) {
268 print_stats(1, "Parallel Time", _cur_collection_par_time_ms, _active_gc_threads);
269 _last_gc_worker_start_times_ms.print(2, "GC Worker Start (ms)");
270 _last_ext_root_scan_times_ms.print(2, "Ext Root Scanning (ms)");
271 if (_last_satb_filtering_times_ms.sum() > 0.0) {
272 _last_satb_filtering_times_ms.print(2, "SATB Filtering (ms)");
273 }
274 if (_last_strong_code_root_mark_times_ms.sum() > 0.0) {
275 _last_strong_code_root_mark_times_ms.print(2, "Code Root Marking (ms)");
285 }
286 _last_gc_worker_other_times_ms.print(2, "GC Worker Other (ms)");
287 _last_gc_worker_times_ms.print(2, "GC Worker Total (ms)");
288 _last_gc_worker_end_times_ms.print(2, "GC Worker End (ms)");
289 } else {
290 _last_ext_root_scan_times_ms.print(1, "Ext Root Scanning (ms)");
291 if (_last_satb_filtering_times_ms.sum() > 0.0) {
292 _last_satb_filtering_times_ms.print(1, "SATB Filtering (ms)");
293 }
294 if (_last_strong_code_root_mark_times_ms.sum() > 0.0) {
295 _last_strong_code_root_mark_times_ms.print(1, "Code Root Marking (ms)");
296 }
297 _last_update_rs_times_ms.print(1, "Update RS (ms)");
298 _last_update_rs_processed_buffers.print(2, "Processed Buffers");
299 _last_scan_rs_times_ms.print(1, "Scan RS (ms)");
300 _last_strong_code_root_scan_times_ms.print(1, "Code Root Scanning (ms)");
301 _last_obj_copy_times_ms.print(1, "Object Copy (ms)");
302 }
303 print_stats(1, "Code Root Fixup", _cur_collection_code_root_fixup_time_ms);
304 print_stats(1, "Code Root Migration", _cur_strong_code_root_migration_time_ms);
305 print_stats(1, "Code Root Purge", _cur_strong_code_root_purge_time_ms);
306 print_stats(1, "Clear CT", _cur_clear_ct_time_ms);
307 double misc_time_ms = pause_time_sec * MILLIUNITS - accounted_time_ms();
308 print_stats(1, "Other", misc_time_ms);
309 if (_cur_verify_before_time_ms > 0.0) {
310 print_stats(2, "Verify Before", _cur_verify_before_time_ms);
311 }
312 print_stats(2, "Choose CSet",
313 (_recorded_young_cset_choice_time_ms +
314 _recorded_non_young_cset_choice_time_ms));
315 print_stats(2, "Ref Proc", _cur_ref_proc_time_ms);
316 print_stats(2, "Ref Enq", _cur_ref_enq_time_ms);
317 print_stats(2, "Free CSet",
318 (_recorded_young_free_cset_time_ms +
319 _recorded_non_young_free_cset_time_ms));
320 if (_cur_verify_after_time_ms > 0.0) {
321 print_stats(2, "Verify After", _cur_verify_after_time_ms);
322 }
323 }
|