src/share/vm/gc_implementation/g1/g1GCPhaseTimes.cpp

Print this page
rev 6083 : 8029075: String deduplication in G1
Implementation of JEP 192, http://openjdk.java.net/jeps/192
   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  *
  23  */
  24 
  25 
  26 #include "precompiled.hpp"
  27 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
  28 #include "gc_implementation/g1/g1GCPhaseTimes.hpp"
  29 #include "gc_implementation/g1/g1Log.hpp"

  30 
  31 // Helper class for avoiding interleaved logging
  32 class LineBuffer: public StackObj {
  33 
  34 private:
  35   static const int BUFFER_LEN = 1024;
  36   static const int INDENT_CHARS = 3;
  37   char _buffer[BUFFER_LEN];
  38   int _indent_level;
  39   int _cur;
  40 
  41   void vappend(const char* format, va_list ap) {
  42     int res = vsnprintf(&_buffer[_cur], BUFFER_LEN - _cur, format, ap);
  43     if (res != -1) {
  44       _cur += res;
  45     } else {
  46       DEBUG_ONLY(warning("buffer too small in LineBuffer");)
  47       _buffer[BUFFER_LEN -1] = 0;
  48       _cur = BUFFER_LEN; // vsnprintf above should not add to _buffer if we are called again
  49     }


 151   }
 152 }
 153 
 154 #endif
 155 
 156 G1GCPhaseTimes::G1GCPhaseTimes(uint max_gc_threads) :
 157   _max_gc_threads(max_gc_threads),
 158   _last_gc_worker_start_times_ms(_max_gc_threads, "%.1lf", false),
 159   _last_ext_root_scan_times_ms(_max_gc_threads, "%.1lf"),
 160   _last_satb_filtering_times_ms(_max_gc_threads, "%.1lf"),
 161   _last_update_rs_times_ms(_max_gc_threads, "%.1lf"),
 162   _last_update_rs_processed_buffers(_max_gc_threads, "%d"),
 163   _last_scan_rs_times_ms(_max_gc_threads, "%.1lf"),
 164   _last_strong_code_root_scan_times_ms(_max_gc_threads, "%.1lf"),
 165   _last_strong_code_root_mark_times_ms(_max_gc_threads, "%.1lf"),
 166   _last_obj_copy_times_ms(_max_gc_threads, "%.1lf"),
 167   _last_termination_times_ms(_max_gc_threads, "%.1lf"),
 168   _last_termination_attempts(_max_gc_threads, SIZE_FORMAT),
 169   _last_gc_worker_end_times_ms(_max_gc_threads, "%.1lf", false),
 170   _last_gc_worker_times_ms(_max_gc_threads, "%.1lf"),
 171   _last_gc_worker_other_times_ms(_max_gc_threads, "%.1lf")


 172 {
 173   assert(max_gc_threads > 0, "Must have some GC threads");
 174 }
 175 
 176 void G1GCPhaseTimes::note_gc_start(uint active_gc_threads) {
 177   assert(active_gc_threads > 0, "The number of threads must be > 0");
 178   assert(active_gc_threads <= _max_gc_threads, "The number of active threads must be <= the max nubmer of threads");
 179   _active_gc_threads = active_gc_threads;
 180 
 181   _last_gc_worker_start_times_ms.reset();
 182   _last_ext_root_scan_times_ms.reset();
 183   _last_satb_filtering_times_ms.reset();
 184   _last_update_rs_times_ms.reset();
 185   _last_update_rs_processed_buffers.reset();
 186   _last_scan_rs_times_ms.reset();
 187   _last_strong_code_root_scan_times_ms.reset();
 188   _last_strong_code_root_mark_times_ms.reset();
 189   _last_obj_copy_times_ms.reset();
 190   _last_termination_times_ms.reset();
 191   _last_termination_attempts.reset();


 212     double worker_time = _last_gc_worker_end_times_ms.get(i) - _last_gc_worker_start_times_ms.get(i);
 213     _last_gc_worker_times_ms.set(i, worker_time);
 214 
 215     double worker_known_time = _last_ext_root_scan_times_ms.get(i) +
 216                                _last_satb_filtering_times_ms.get(i) +
 217                                _last_update_rs_times_ms.get(i) +
 218                                _last_scan_rs_times_ms.get(i) +
 219                                _last_strong_code_root_scan_times_ms.get(i) +
 220                                _last_strong_code_root_mark_times_ms.get(i) +
 221                                _last_obj_copy_times_ms.get(i) +
 222                                _last_termination_times_ms.get(i);
 223 
 224     double worker_other_time = worker_time - worker_known_time;
 225     _last_gc_worker_other_times_ms.set(i, worker_other_time);
 226   }
 227 
 228   _last_gc_worker_times_ms.verify();
 229   _last_gc_worker_other_times_ms.verify();
 230 }
 231 










 232 void G1GCPhaseTimes::print_stats(int level, const char* str, double value) {
 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  *
  23  */
  24 
  25 
  26 #include "precompiled.hpp"
  27 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
  28 #include "gc_implementation/g1/g1GCPhaseTimes.hpp"
  29 #include "gc_implementation/g1/g1Log.hpp"
  30 #include "gc_implementation/g1/g1StringDedup.hpp"
  31 
  32 // Helper class for avoiding interleaved logging
  33 class LineBuffer: public StackObj {
  34 
  35 private:
  36   static const int BUFFER_LEN = 1024;
  37   static const int INDENT_CHARS = 3;
  38   char _buffer[BUFFER_LEN];
  39   int _indent_level;
  40   int _cur;
  41 
  42   void vappend(const char* format, va_list ap) {
  43     int res = vsnprintf(&_buffer[_cur], BUFFER_LEN - _cur, format, ap);
  44     if (res != -1) {
  45       _cur += res;
  46     } else {
  47       DEBUG_ONLY(warning("buffer too small in LineBuffer");)
  48       _buffer[BUFFER_LEN -1] = 0;
  49       _cur = BUFFER_LEN; // vsnprintf above should not add to _buffer if we are called again
  50     }


 152   }
 153 }
 154 
 155 #endif
 156 
 157 G1GCPhaseTimes::G1GCPhaseTimes(uint max_gc_threads) :
 158   _max_gc_threads(max_gc_threads),
 159   _last_gc_worker_start_times_ms(_max_gc_threads, "%.1lf", false),
 160   _last_ext_root_scan_times_ms(_max_gc_threads, "%.1lf"),
 161   _last_satb_filtering_times_ms(_max_gc_threads, "%.1lf"),
 162   _last_update_rs_times_ms(_max_gc_threads, "%.1lf"),
 163   _last_update_rs_processed_buffers(_max_gc_threads, "%d"),
 164   _last_scan_rs_times_ms(_max_gc_threads, "%.1lf"),
 165   _last_strong_code_root_scan_times_ms(_max_gc_threads, "%.1lf"),
 166   _last_strong_code_root_mark_times_ms(_max_gc_threads, "%.1lf"),
 167   _last_obj_copy_times_ms(_max_gc_threads, "%.1lf"),
 168   _last_termination_times_ms(_max_gc_threads, "%.1lf"),
 169   _last_termination_attempts(_max_gc_threads, SIZE_FORMAT),
 170   _last_gc_worker_end_times_ms(_max_gc_threads, "%.1lf", false),
 171   _last_gc_worker_times_ms(_max_gc_threads, "%.1lf"),
 172   _last_gc_worker_other_times_ms(_max_gc_threads, "%.1lf"),
 173   _cur_string_dedup_queue_fixup_worker_times_ms(_max_gc_threads, "%.1lf"),
 174   _cur_string_dedup_table_fixup_worker_times_ms(_max_gc_threads, "%.1lf")
 175 {
 176   assert(max_gc_threads > 0, "Must have some GC threads");
 177 }
 178 
 179 void G1GCPhaseTimes::note_gc_start(uint active_gc_threads) {
 180   assert(active_gc_threads > 0, "The number of threads must be > 0");
 181   assert(active_gc_threads <= _max_gc_threads, "The number of active threads must be <= the max nubmer of threads");
 182   _active_gc_threads = active_gc_threads;
 183 
 184   _last_gc_worker_start_times_ms.reset();
 185   _last_ext_root_scan_times_ms.reset();
 186   _last_satb_filtering_times_ms.reset();
 187   _last_update_rs_times_ms.reset();
 188   _last_update_rs_processed_buffers.reset();
 189   _last_scan_rs_times_ms.reset();
 190   _last_strong_code_root_scan_times_ms.reset();
 191   _last_strong_code_root_mark_times_ms.reset();
 192   _last_obj_copy_times_ms.reset();
 193   _last_termination_times_ms.reset();
 194   _last_termination_attempts.reset();


 215     double worker_time = _last_gc_worker_end_times_ms.get(i) - _last_gc_worker_start_times_ms.get(i);
 216     _last_gc_worker_times_ms.set(i, worker_time);
 217 
 218     double worker_known_time = _last_ext_root_scan_times_ms.get(i) +
 219                                _last_satb_filtering_times_ms.get(i) +
 220                                _last_update_rs_times_ms.get(i) +
 221                                _last_scan_rs_times_ms.get(i) +
 222                                _last_strong_code_root_scan_times_ms.get(i) +
 223                                _last_strong_code_root_mark_times_ms.get(i) +
 224                                _last_obj_copy_times_ms.get(i) +
 225                                _last_termination_times_ms.get(i);
 226 
 227     double worker_other_time = worker_time - worker_known_time;
 228     _last_gc_worker_other_times_ms.set(i, worker_other_time);
 229   }
 230 
 231   _last_gc_worker_times_ms.verify();
 232   _last_gc_worker_other_times_ms.verify();
 233 }
 234 
 235 void G1GCPhaseTimes::note_string_dedup_fixup_start() {
 236   _cur_string_dedup_queue_fixup_worker_times_ms.reset();
 237   _cur_string_dedup_table_fixup_worker_times_ms.reset();
 238 }
 239 
 240 void G1GCPhaseTimes::note_string_dedup_fixup_end() {
 241   _cur_string_dedup_queue_fixup_worker_times_ms.verify();
 242   _cur_string_dedup_table_fixup_worker_times_ms.verify();
 243 }
 244 
 245 void G1GCPhaseTimes::print_stats(int level, const char* str, double value) {
 246   LineBuffer(level).append_and_print_cr("[%s: %.1lf ms]", str, value);
 247 }
 248 
 249 void G1GCPhaseTimes::print_stats(int level, const char* str, double value, int workers) {
 250   LineBuffer(level).append_and_print_cr("[%s: %.1lf ms, GC Workers: %d]", str, value, workers);
 251 }
 252 
 253 double G1GCPhaseTimes::accounted_time_ms() {
 254     // Subtract the root region scanning wait time. It's initialized to
 255     // zero at the start of the pause.
 256     double misc_time_ms = _root_region_scan_wait_time_ms;
 257 
 258     misc_time_ms += _cur_collection_par_time_ms;
 259 
 260     // Now subtract the time taken to fix up roots in generated code
 261     misc_time_ms += _cur_collection_code_root_fixup_time_ms;
 262 
 263     // Strong code root migration time
 264     misc_time_ms += _cur_strong_code_root_migration_time_ms;
 265 
 266     // Now subtract the time taken to fix up weak roots
 267     misc_time_ms += _cur_string_dedup_fixup_time_ms;
 268 
 269     // Subtract the time taken to clean the card table from the
 270     // current value of "other time"
 271     misc_time_ms += _cur_clear_ct_time_ms;
 272 
 273     return misc_time_ms;
 274 }
 275 
 276 void G1GCPhaseTimes::print(double pause_time_sec) {
 277   if (_root_region_scan_wait_time_ms > 0.0) {
 278     print_stats(1, "Root Region Scan Waiting", _root_region_scan_wait_time_ms);
 279   }
 280   if (G1CollectedHeap::use_parallel_gc_threads()) {
 281     print_stats(1, "Parallel Time", _cur_collection_par_time_ms, _active_gc_threads);
 282     _last_gc_worker_start_times_ms.print(2, "GC Worker Start (ms)");
 283     _last_ext_root_scan_times_ms.print(2, "Ext Root Scanning (ms)");
 284     if (_last_satb_filtering_times_ms.sum() > 0.0) {
 285       _last_satb_filtering_times_ms.print(2, "SATB Filtering (ms)");
 286     }
 287     if (_last_strong_code_root_mark_times_ms.sum() > 0.0) {
 288      _last_strong_code_root_mark_times_ms.print(2, "Code Root Marking (ms)");


 298     }
 299     _last_gc_worker_other_times_ms.print(2, "GC Worker Other (ms)");
 300     _last_gc_worker_times_ms.print(2, "GC Worker Total (ms)");
 301     _last_gc_worker_end_times_ms.print(2, "GC Worker End (ms)");
 302   } else {
 303     _last_ext_root_scan_times_ms.print(1, "Ext Root Scanning (ms)");
 304     if (_last_satb_filtering_times_ms.sum() > 0.0) {
 305       _last_satb_filtering_times_ms.print(1, "SATB Filtering (ms)");
 306     }
 307     if (_last_strong_code_root_mark_times_ms.sum() > 0.0) {
 308       _last_strong_code_root_mark_times_ms.print(1, "Code Root Marking (ms)");
 309     }
 310     _last_update_rs_times_ms.print(1, "Update RS (ms)");
 311       _last_update_rs_processed_buffers.print(2, "Processed Buffers");
 312     _last_scan_rs_times_ms.print(1, "Scan RS (ms)");
 313     _last_strong_code_root_scan_times_ms.print(1, "Code Root Scanning (ms)");
 314     _last_obj_copy_times_ms.print(1, "Object Copy (ms)");
 315   }
 316   print_stats(1, "Code Root Fixup", _cur_collection_code_root_fixup_time_ms);
 317   print_stats(1, "Code Root Migration", _cur_strong_code_root_migration_time_ms);
 318   if (G1StringDedup::is_enabled()) {
 319     print_stats(1, "String Dedup Fixup", _cur_string_dedup_fixup_time_ms, _active_gc_threads);
 320     _cur_string_dedup_queue_fixup_worker_times_ms.print(2, "Queue Fixup (ms)");
 321     _cur_string_dedup_table_fixup_worker_times_ms.print(2, "Table Fixup (ms)");
 322   }
 323   print_stats(1, "Clear CT", _cur_clear_ct_time_ms);
 324   double misc_time_ms = pause_time_sec * MILLIUNITS - accounted_time_ms();
 325   print_stats(1, "Other", misc_time_ms);
 326   if (_cur_verify_before_time_ms > 0.0) {
 327     print_stats(2, "Verify Before", _cur_verify_before_time_ms);
 328   }
 329   print_stats(2, "Choose CSet",
 330     (_recorded_young_cset_choice_time_ms +
 331     _recorded_non_young_cset_choice_time_ms));
 332   print_stats(2, "Ref Proc", _cur_ref_proc_time_ms);
 333   print_stats(2, "Ref Enq", _cur_ref_enq_time_ms);
 334   print_stats(2, "Free CSet",
 335     (_recorded_young_free_cset_time_ms +
 336     _recorded_non_young_free_cset_time_ms));
 337   if (_cur_verify_after_time_ms > 0.0) {
 338     print_stats(2, "Verify After", _cur_verify_after_time_ms);
 339   }
 340 }