rev 6670 : fast reclaim main patch

   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 #include "runtime/atomic.inline.hpp"
  32 
  33 // Helper class for avoiding interleaved logging
  34 class LineBuffer: public StackObj {
  35 
  36 private:
  37   static const int BUFFER_LEN = 1024;
  38   static const int INDENT_CHARS = 3;
  39   char _buffer[BUFFER_LEN];
  40   int _indent_level;
  41   int _cur;
  42 
  43   void vappend(const char* format, va_list ap)  ATTRIBUTE_PRINTF(2, 0) {
  44     int res = vsnprintf(&_buffer[_cur], BUFFER_LEN - _cur, format, ap);
  45     if (res != -1) {
  46       _cur += res;
  47     } else {
  48       DEBUG_ONLY(warning("buffer too small in LineBuffer");)
  49       _buffer[BUFFER_LEN -1] = 0;
  50       _cur = BUFFER_LEN; // vsnprintf above should not add to _buffer if we are called again
  51     }
  52   }
  53 
  54 public:
  55   explicit LineBuffer(int indent_level): _indent_level(indent_level), _cur(0) {
  56     for (; (_cur < BUFFER_LEN && _cur < (_indent_level * INDENT_CHARS)); _cur++) {
  57       _buffer[_cur] = ' ';
  58     }
  59   }
  60 
  61 #ifndef PRODUCT
  62   ~LineBuffer() {
  63     assert(_cur == _indent_level * INDENT_CHARS, "pending data in buffer - append_and_print_cr() not called?");
  64   }
  65 #endif
  66 
  67   void append(const char* format, ...)  ATTRIBUTE_PRINTF(2, 3) {
  68     va_list ap;
  69     va_start(ap, format);
  70     vappend(format, ap);
  71     va_end(ap);
  72   }
  73 
  74   void append_and_print_cr(const char* format, ...)  ATTRIBUTE_PRINTF(2, 3) {
  75     va_list ap;
  76     va_start(ap, format);
  77     vappend(format, ap);
  78     va_end(ap);
  79     gclog_or_tty->print_cr("%s", _buffer);
  80     _cur = _indent_level * INDENT_CHARS;
  81   }
  82 };
  83 
  84 PRAGMA_DIAG_PUSH
  85 PRAGMA_FORMAT_NONLITERAL_IGNORED
  86 template <class T>
  87 void WorkerDataArray<T>::print(int level, const char* title) {
  88   if (_length == 1) {
  89     // No need for min, max, average and sum for only one worker
  90     LineBuffer buf(level);
  91     buf.append("[%s:  ", title);
  92     buf.append(_print_format, _data[0]);
  93     buf.append_and_print_cr("]");
  94     return;
  95   }
  96 
  97   T min = _data[0];
  98   T max = _data[0];
  99   T sum = 0;
 100 
 101   LineBuffer buf(level);
 102   buf.append("[%s:", title);
 103   for (uint i = 0; i < _length; ++i) {
 104     T val = _data[i];
 105     min = MIN2(val, min);
 106     max = MAX2(val, max);
 107     sum += val;
 108     if (G1Log::finest()) {
 109       buf.append("  ");
 110       buf.append(_print_format, val);
 111     }
 112   }
 113 
 114   if (G1Log::finest()) {
 115     buf.append_and_print_cr("%s", "");
 116   }
 117 
 118   double avg = (double)sum / (double)_length;
 119   buf.append(" Min: ");
 120   buf.append(_print_format, min);
 121   buf.append(", Avg: ");
 122   buf.append("%.1lf", avg); // Always print average as a double
 123   buf.append(", Max: ");
 124   buf.append(_print_format, max);
 125   buf.append(", Diff: ");
 126   buf.append(_print_format, max - min);
 127   if (_print_sum) {
 128     // for things like the start and end times the sum is not
 129     // that relevant
 130     buf.append(", Sum: ");
 131     buf.append(_print_format, sum);
 132   }
 133   buf.append_and_print_cr("]");
 134 }
 135 PRAGMA_DIAG_POP
 136 
 137 #ifndef PRODUCT
 138 
 139 template <> const int WorkerDataArray<int>::_uninitialized = -1;
 140 template <> const double WorkerDataArray<double>::_uninitialized = -1.0;
 141 template <> const size_t WorkerDataArray<size_t>::_uninitialized = (size_t)-1;
 142 
 143 template <class T>
 144 void WorkerDataArray<T>::reset() {
 145   for (uint i = 0; i < _length; i++) {
 146     _data[i] = (T)_uninitialized;
 147   }
 148 }
 149 
 150 template <class T>
 151 void WorkerDataArray<T>::verify() {
 152   for (uint i = 0; i < _length; i++) {
 153     assert(_data[i] != _uninitialized,
 154         err_msg("Invalid data for worker %u, data: %lf, uninitialized: %lf",
 155             i, (double)_data[i], (double)_uninitialized));
 156   }
 157 }
 158 
 159 #endif
 160 
 161 G1GCPhaseTimes::G1GCPhaseTimes(uint max_gc_threads) :
 162   _max_gc_threads(max_gc_threads),
 163   _last_gc_worker_start_times_ms(_max_gc_threads, "%.1lf", false),
 164   _last_ext_root_scan_times_ms(_max_gc_threads, "%.1lf"),
 165   _last_satb_filtering_times_ms(_max_gc_threads, "%.1lf"),
 166   _last_update_rs_times_ms(_max_gc_threads, "%.1lf"),
 167   _last_update_rs_processed_buffers(_max_gc_threads, "%d"),
 168   _last_scan_rs_times_ms(_max_gc_threads, "%.1lf"),
 169   _last_strong_code_root_scan_times_ms(_max_gc_threads, "%.1lf"),
 170   _last_obj_copy_times_ms(_max_gc_threads, "%.1lf"),
 171   _last_termination_times_ms(_max_gc_threads, "%.1lf"),
 172   _last_termination_attempts(_max_gc_threads, SIZE_FORMAT),
 173   _last_gc_worker_end_times_ms(_max_gc_threads, "%.1lf", false),
 174   _last_gc_worker_times_ms(_max_gc_threads, "%.1lf"),
 175   _last_gc_worker_other_times_ms(_max_gc_threads, "%.1lf"),
 176   _last_redirty_logged_cards_time_ms(_max_gc_threads, "%.1lf"),
 177   _last_redirty_logged_cards_processed_cards(_max_gc_threads, SIZE_FORMAT),
 178   _cur_string_dedup_queue_fixup_worker_times_ms(_max_gc_threads, "%.1lf"),
 179   _cur_string_dedup_table_fixup_worker_times_ms(_max_gc_threads, "%.1lf")
 180 {
 181   assert(max_gc_threads > 0, "Must have some GC threads");
 182 }
 183 
 184 void G1GCPhaseTimes::note_gc_start(uint active_gc_threads) {
 185   assert(active_gc_threads > 0, "The number of threads must be > 0");
 186   assert(active_gc_threads <= _max_gc_threads, "The number of active threads must be <= the max nubmer of threads");
 187   _active_gc_threads = active_gc_threads;
 188 
 189   _last_gc_worker_start_times_ms.reset();
 190   _last_ext_root_scan_times_ms.reset();
 191   _last_satb_filtering_times_ms.reset();
 192   _last_update_rs_times_ms.reset();
 193   _last_update_rs_processed_buffers.reset();
 194   _last_scan_rs_times_ms.reset();
 195   _last_strong_code_root_scan_times_ms.reset();
 196   _last_obj_copy_times_ms.reset();
 197   _last_termination_times_ms.reset();
 198   _last_termination_attempts.reset();
 199   _last_gc_worker_end_times_ms.reset();
 200   _last_gc_worker_times_ms.reset();
 201   _last_gc_worker_other_times_ms.reset();
 202 
 203   _last_redirty_logged_cards_time_ms.reset();
 204   _last_redirty_logged_cards_processed_cards.reset();
 205 
 206 }
 207 
 208 void G1GCPhaseTimes::note_gc_end() {
 209   _last_gc_worker_start_times_ms.verify();
 210   _last_ext_root_scan_times_ms.verify();
 211   _last_satb_filtering_times_ms.verify();
 212   _last_update_rs_times_ms.verify();
 213   _last_update_rs_processed_buffers.verify();
 214   _last_scan_rs_times_ms.verify();
 215   _last_strong_code_root_scan_times_ms.verify();
 216   _last_obj_copy_times_ms.verify();
 217   _last_termination_times_ms.verify();
 218   _last_termination_attempts.verify();
 219   _last_gc_worker_end_times_ms.verify();
 220 
 221   for (uint i = 0; i < _active_gc_threads; i++) {
 222     double worker_time = _last_gc_worker_end_times_ms.get(i) - _last_gc_worker_start_times_ms.get(i);
 223     _last_gc_worker_times_ms.set(i, worker_time);
 224 
 225     double worker_known_time = _last_ext_root_scan_times_ms.get(i) +
 226                                _last_satb_filtering_times_ms.get(i) +
 227                                _last_update_rs_times_ms.get(i) +
 228                                _last_scan_rs_times_ms.get(i) +
 229                                _last_strong_code_root_scan_times_ms.get(i) +
 230                                _last_obj_copy_times_ms.get(i) +
 231                                _last_termination_times_ms.get(i);
 232 
 233     double worker_other_time = worker_time - worker_known_time;
 234     _last_gc_worker_other_times_ms.set(i, worker_other_time);
 235   }
 236 
 237   _last_gc_worker_times_ms.verify();
 238   _last_gc_worker_other_times_ms.verify();
 239 
 240   _last_redirty_logged_cards_time_ms.verify();
 241   _last_redirty_logged_cards_processed_cards.verify();
 242 }
 243 
 244 void G1GCPhaseTimes::note_string_dedup_fixup_start() {
 245   _cur_string_dedup_queue_fixup_worker_times_ms.reset();
 246   _cur_string_dedup_table_fixup_worker_times_ms.reset();
 247 }
 248 
 249 void G1GCPhaseTimes::note_string_dedup_fixup_end() {
 250   _cur_string_dedup_queue_fixup_worker_times_ms.verify();
 251   _cur_string_dedup_table_fixup_worker_times_ms.verify();
 252 }
 253 
 254 void G1GCPhaseTimes::print_stats(int level, const char* str, double value) {
 255   LineBuffer(level).append_and_print_cr("[%s: %.1lf ms]", str, value);
 256 }
 257 
 258 void G1GCPhaseTimes::print_stats(int level, const char* str, size_t value) {
 259   LineBuffer(level).append_and_print_cr("[%s: "SIZE_FORMAT"]", str, value);
 260 }
 261 
 262 void G1GCPhaseTimes::print_stats(int level, const char* str, double value, uint workers) {
 263   LineBuffer(level).append_and_print_cr("[%s: %.1lf ms, GC Workers: %u]", str, value, workers);
 264 }
 265 
 266 double G1GCPhaseTimes::accounted_time_ms() {
 267     // Subtract the root region scanning wait time. It's initialized to
 268     // zero at the start of the pause.
 269     double misc_time_ms = _root_region_scan_wait_time_ms;
 270 
 271     misc_time_ms += _cur_collection_par_time_ms;
 272 
 273     // Now subtract the time taken to fix up roots in generated code
 274     misc_time_ms += _cur_collection_code_root_fixup_time_ms;
 275 
 276     // Strong code root migration time
 277     misc_time_ms += _cur_strong_code_root_migration_time_ms;
 278 
 279     // Strong code root purge time
 280     misc_time_ms += _cur_strong_code_root_purge_time_ms;
 281 
 282     if (G1StringDedup::is_enabled()) {
 283       // String dedup fixup time
 284       misc_time_ms += _cur_string_dedup_fixup_time_ms;
 285     }
 286 
 287     // Subtract the time taken to clean the card table from the
 288     // current value of "other time"
 289     misc_time_ms += _cur_clear_ct_time_ms;
 290 
 291     return misc_time_ms;
 292 }
 293 
 294 void G1GCPhaseTimes::print(double pause_time_sec) {
 295   if (_root_region_scan_wait_time_ms > 0.0) {
 296     print_stats(1, "Root Region Scan Waiting", _root_region_scan_wait_time_ms);
 297   }
 298   if (G1CollectedHeap::use_parallel_gc_threads()) {
 299     print_stats(1, "Parallel Time", _cur_collection_par_time_ms, _active_gc_threads);
 300     _last_gc_worker_start_times_ms.print(2, "GC Worker Start (ms)");
 301     _last_ext_root_scan_times_ms.print(2, "Ext Root Scanning (ms)");
 302     if (_last_satb_filtering_times_ms.sum() > 0.0) {
 303       _last_satb_filtering_times_ms.print(2, "SATB Filtering (ms)");
 304     }
 305     _last_update_rs_times_ms.print(2, "Update RS (ms)");
 306       _last_update_rs_processed_buffers.print(3, "Processed Buffers");
 307     _last_scan_rs_times_ms.print(2, "Scan RS (ms)");
 308     _last_strong_code_root_scan_times_ms.print(2, "Code Root Scanning (ms)");
 309     _last_obj_copy_times_ms.print(2, "Object Copy (ms)");
 310     _last_termination_times_ms.print(2, "Termination (ms)");
 311     if (G1Log::finest()) {
 312       _last_termination_attempts.print(3, "Termination Attempts");
 313     }
 314     _last_gc_worker_other_times_ms.print(2, "GC Worker Other (ms)");
 315     _last_gc_worker_times_ms.print(2, "GC Worker Total (ms)");
 316     _last_gc_worker_end_times_ms.print(2, "GC Worker End (ms)");
 317   } else {
 318     _last_ext_root_scan_times_ms.print(1, "Ext Root Scanning (ms)");
 319     if (_last_satb_filtering_times_ms.sum() > 0.0) {
 320       _last_satb_filtering_times_ms.print(1, "SATB Filtering (ms)");
 321     }
 322     _last_update_rs_times_ms.print(1, "Update RS (ms)");
 323       _last_update_rs_processed_buffers.print(2, "Processed Buffers");
 324     _last_scan_rs_times_ms.print(1, "Scan RS (ms)");
 325     _last_strong_code_root_scan_times_ms.print(1, "Code Root Scanning (ms)");
 326     _last_obj_copy_times_ms.print(1, "Object Copy (ms)");
 327   }
 328   print_stats(1, "Code Root Fixup", _cur_collection_code_root_fixup_time_ms);
 329   print_stats(1, "Code Root Migration", _cur_strong_code_root_migration_time_ms);
 330   print_stats(1, "Code Root Purge", _cur_strong_code_root_purge_time_ms);
 331   if (G1StringDedup::is_enabled()) {
 332     print_stats(1, "String Dedup Fixup", _cur_string_dedup_fixup_time_ms, _active_gc_threads);
 333     _cur_string_dedup_queue_fixup_worker_times_ms.print(2, "Queue Fixup (ms)");
 334     _cur_string_dedup_table_fixup_worker_times_ms.print(2, "Table Fixup (ms)");
 335   }
 336   print_stats(1, "Clear CT", _cur_clear_ct_time_ms);
 337   double misc_time_ms = pause_time_sec * MILLIUNITS - accounted_time_ms();
 338   print_stats(1, "Other", misc_time_ms);
 339   if (_cur_verify_before_time_ms > 0.0) {
 340     print_stats(2, "Verify Before", _cur_verify_before_time_ms);
 341   }
 342   if (G1CollectedHeap::heap()->evacuation_failed()) {
 343     double evac_fail_handling = _cur_evac_fail_recalc_used + _cur_evac_fail_remove_self_forwards +
 344       _cur_evac_fail_restore_remsets;
 345     print_stats(2, "Evacuation Failure", evac_fail_handling);
 346     if (G1Log::finest()) {
 347       print_stats(3, "Recalculate Used", _cur_evac_fail_recalc_used);
 348       print_stats(3, "Remove Self Forwards", _cur_evac_fail_remove_self_forwards);
 349       print_stats(3, "Restore RemSet", _cur_evac_fail_restore_remsets);
 350     }
 351   }
 352   print_stats(2, "Choose CSet",
 353     (_recorded_young_cset_choice_time_ms +
 354     _recorded_non_young_cset_choice_time_ms));
 355   print_stats(2, "Ref Proc", _cur_ref_proc_time_ms);
 356   print_stats(2, "Ref Enq", _cur_ref_enq_time_ms);
 357   if (G1DeferredRSUpdate) {
 358     print_stats(2, "Redirty Cards", _recorded_redirty_logged_cards_time_ms);
 359     if (G1Log::finest()) {
 360       _last_redirty_logged_cards_time_ms.print(3, "Parallel Redirty");
 361       _last_redirty_logged_cards_processed_cards.print(3, "Redirtied Cards");
 362     }
 363   }
 364   if (G1ReclaimDeadHumongousObjectsAtYoungGC) {
 365     print_stats(2, "Humongous Reclaim", _cur_fast_reclaim_humongous_time_ms);
 366     if (G1Log::finest()) {
 367       print_stats(3, "Humongous Total", _cur_fast_reclaim_humongous_total);
 368       print_stats(3, "Humongous Candidate", _cur_fast_reclaim_humongous_candidates);
 369       print_stats(3, "Humongous Reclaimed", _cur_fast_reclaim_humongous_reclaimed);
 370     }
 371   }
 372   print_stats(2, "Free CSet",
 373     (_recorded_young_free_cset_time_ms +
 374     _recorded_non_young_free_cset_time_ms));
 375   if (G1Log::finest()) {
 376     print_stats(3, "Young Free CSet", _recorded_young_free_cset_time_ms);
 377     print_stats(3, "Non-Young Free CSet", _recorded_non_young_free_cset_time_ms);
 378   }
 379   if (_cur_verify_after_time_ms > 0.0) {
 380     print_stats(2, "Verify After", _cur_verify_after_time_ms);
 381   }
 382 }
--- EOF ---