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