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 }
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 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 }
56 public:
57 explicit LineBuffer(int indent_level): _indent_level(indent_level), _cur(0) {
58 for (; (_cur < BUFFER_LEN && _cur < (_indent_level * INDENT_CHARS)); _cur++) {
59 _buffer[_cur] = ' ';
60 }
61 }
62
63 #ifndef PRODUCT
64 ~LineBuffer() {
65 assert(_cur == _indent_level * INDENT_CHARS, "pending data in buffer - append_and_print_cr() not called?");
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 print_cr() {
77 gclog_or_tty->print_cr("%s", _buffer);
78 _cur = _indent_level * INDENT_CHARS;
79 }
80
81 void append_and_print_cr(const char* format, ...) ATTRIBUTE_PRINTF(2, 3) {
82 va_list ap;
83 va_start(ap, format);
84 vappend(format, ap);
85 va_end(ap);
86 print_cr();
87 }
88 };
89
90 template <class T>
91 WorkerDataArray<T>::WorkerDataArray(uint length, const char* title, bool print_sum, int log_level, uint indent_level) :
92 _title(title), _length(0), _print_sum(print_sum), _log_level(log_level), _indent_level(indent_level),
93 _has_new_data(true), _sub_count(NULL), _enabled(true) {
94 assert(length > 0, "Must have some workers to store data for");
95 _length = length;
96 _data = NEW_C_HEAP_ARRAY(T, _length, mtGC);
97 }
98
99 template <class T>
100 WorkerDataArray<T>::~WorkerDataArray() {
101 FREE_C_HEAP_ARRAY(T, _data);
102 }
103
104 #ifndef PRODUCT
105
106 template <>
107 size_t WorkerDataArray<size_t>::uninitialized() {
108 return (size_t)-1;
109 }
110
111 template <>
112 double WorkerDataArray<double>::uninitialized() {
113 return -1.0;
114 }
115
116 template <class T>
117 void WorkerDataArray<T>::reset() {
118 for (uint i = 0; i < _length; i++) {
119 _data[i] = WorkerDataArray<T>::uninitialized();
120 }
121 if (_sub_count != NULL) {
122 _sub_count->reset();
123 }
124 }
125
126 template <class T>
127 void WorkerDataArray<T>::verify() {
128 if (!_enabled) {
129 return;
130 }
131
132 for (uint i = 0; i < _length; i++) {
133 assert(_data[i] != WorkerDataArray<T>::uninitialized(),
134 err_msg("Invalid data for worker %u in '%s'", i, _title));
135 }
136 if (_sub_count != NULL) {
137 _sub_count->verify();
138 }
139 }
140
141 #endif
142
143 template class WorkerDataArray<double>;
144 template class WorkerDataArray<size_t>;
145
146 G1GCPhaseTimes::G1GCPhaseTimes(uint max_gc_threads) :
147 _max_gc_threads(max_gc_threads)
148 {
149 assert(max_gc_threads > 0, "Must have some GC threads");
150
151 _gc_phases[GCWorkerStart] = new WorkerDataArray<double>(max_gc_threads, "GC Worker Start (ms)", false, G1Log::LevelFiner, 2);
152 _gc_phases[ExtRootScan] = new WorkerDataArray<double>(max_gc_threads, "Ext Root Scanning (ms)", true, G1Log::LevelFiner, 2);
153 _gc_phases[SATBFiltering] = new WorkerDataArray<double>(max_gc_threads, "SATB Filtering (ms)", true, G1Log::LevelFiner, 2);
154 _gc_phases[UpdateRS] = new WorkerDataArray<double>(max_gc_threads, "Update RS (ms)", true, G1Log::LevelFiner, 2);
155 _gc_phases[ScanRS] = new WorkerDataArray<double>(max_gc_threads, "Scan RS (ms)", true, G1Log::LevelFiner, 2);
156 _gc_phases[CodeRoots] = new WorkerDataArray<double>(max_gc_threads, "Code Root Scanning (ms)", true, G1Log::LevelFiner, 2);
157 _gc_phases[ObjCopy] = new WorkerDataArray<double>(max_gc_threads, "Object Copy (ms)", true, G1Log::LevelFiner, 2);
158 _gc_phases[Termination] = new WorkerDataArray<double>(max_gc_threads, "Termination (ms)", true, G1Log::LevelFiner, 2);
159 _gc_phases[GCWorkerTotal] = new WorkerDataArray<double>(max_gc_threads, "GC Worker Total (ms)", true, G1Log::LevelFiner, 2);
160 _gc_phases[GCWorkerEnd] = new WorkerDataArray<double>(max_gc_threads, "GC Worker End (ms)", false, G1Log::LevelFiner, 2);
161 _gc_phases[Other] = new WorkerDataArray<double>(max_gc_threads, "GC Worker Other (ms)", true, G1Log::LevelFiner, 2);
162
163 _update_rs_processed_buffers = new WorkerDataArray<size_t>(max_gc_threads, "Processed Buffers", true, G1Log::LevelFiner, 3);
164 _gc_phases[UpdateRS]->link_sub_count_array(_update_rs_processed_buffers);
165
166 _termination_attempts = new WorkerDataArray<size_t>(max_gc_threads, "Termination Attempts", true, G1Log::LevelFinest, 3);
167 _gc_phases[Termination]->link_sub_count_array(_termination_attempts);
168
169 _gc_phases[StringDedupQueueFixup] = new WorkerDataArray<double>(max_gc_threads, "Queue Fixup (ms)", true, G1Log::LevelFiner, 2);
170 _gc_phases[StringDedupTableFixup] = new WorkerDataArray<double>(max_gc_threads, "Table Fixup (ms)", true, G1Log::LevelFiner, 2);
171
172 _gc_phases[RedirtyCards] = new WorkerDataArray<double>(max_gc_threads, "Parallel Redirty", true, G1Log::LevelFinest, 3);
173 _redirtied_cards = new WorkerDataArray<size_t>(max_gc_threads, "Redirtied Cards", true, G1Log::LevelFinest, 3);
174 _gc_phases[RedirtyCards]->link_sub_count_array(_redirtied_cards);
175 }
176
177 void G1GCPhaseTimes::note_gc_start(uint active_gc_threads, bool mark_in_progress) {
178 assert(active_gc_threads > 0, "The number of threads must be > 0");
179 assert(active_gc_threads <= _max_gc_threads, "The number of active threads must be <= the max number of threads");
180 _active_gc_threads = active_gc_threads;
181
182 for (int i = 0; i < Sentinel; i++) {
183 _gc_phases[i]->reset();
184 }
185
186 _gc_phases[SATBFiltering]->set_enabled(mark_in_progress);
187
188 _gc_phases[StringDedupQueueFixup]->set_enabled(G1StringDedup::is_enabled());
189 _gc_phases[StringDedupTableFixup]->set_enabled(G1StringDedup::is_enabled());
190 }
191
192 void G1GCPhaseTimes::note_gc_end() {
193 for (uint i = 0; i < _active_gc_threads; i++) {
194 double worker_time = _gc_phases[GCWorkerEnd]->get(i) - _gc_phases[GCWorkerStart]->get(i);
195 record_time_secs(GCWorkerTotal, i , worker_time);
196
197 double worker_known_time =
198 _gc_phases[ExtRootScan]->get(i) +
199 _gc_phases[SATBFiltering]->get(i) +
200 _gc_phases[UpdateRS]->get(i) +
201 _gc_phases[ScanRS]->get(i) +
202 _gc_phases[CodeRoots]->get(i) +
203 _gc_phases[ObjCopy]->get(i) +
204 _gc_phases[Termination]->get(i);
205
206 record_time_secs(Other, i, worker_time - worker_known_time);
207 }
208
209 for (int i = 0; i < Sentinel; i++) {
210 _gc_phases[i]->verify();
211 }
212 }
213
214 void G1GCPhaseTimes::print_stats(int level, const char* str, double value) {
215 LineBuffer(level).append_and_print_cr("[%s: %.1lf ms]", str, value);
216 }
217
218 void G1GCPhaseTimes::print_stats(int level, const char* str, size_t value) {
219 LineBuffer(level).append_and_print_cr("[%s: "SIZE_FORMAT"]", str, value);
220 }
221
222 void G1GCPhaseTimes::print_stats(int level, const char* str, double value, uint workers) {
223 LineBuffer(level).append_and_print_cr("[%s: %.1lf ms, GC Workers: %u]", str, value, workers);
224 }
225
226 double G1GCPhaseTimes::accounted_time_ms() {
227 // Subtract the root region scanning wait time. It's initialized to
228 // zero at the start of the pause.
229 double misc_time_ms = _root_region_scan_wait_time_ms;
230
231 misc_time_ms += _cur_collection_par_time_ms;
232
233 // Now subtract the time taken to fix up roots in generated code
234 misc_time_ms += _cur_collection_code_root_fixup_time_ms;
235
236 // Strong code root purge time
237 misc_time_ms += _cur_strong_code_root_purge_time_ms;
238
239 if (G1StringDedup::is_enabled()) {
240 // String dedup fixup time
241 misc_time_ms += _cur_string_dedup_fixup_time_ms;
242 }
243
244 // Subtract the time taken to clean the card table from the
245 // current value of "other time"
246 misc_time_ms += _cur_clear_ct_time_ms;
247
248 return misc_time_ms;
249 }
250
251 void G1GCPhaseTimes::print(double pause_time_sec) {
252 G1GCPhasePrinter phase_printer(this);
253
254 if (_root_region_scan_wait_time_ms > 0.0) {
255 print_stats(1, "Root Region Scan Waiting", _root_region_scan_wait_time_ms);
256 }
257
258 print_stats(1, "Parallel Time", _cur_collection_par_time_ms, _active_gc_threads);
259 for (int i = 0; i <= GCMainPhasesLast; i++) {
260 phase_printer.print((GCPhases) i);
261 }
262
263 print_stats(1, "Code Root Fixup", _cur_collection_code_root_fixup_time_ms);
264 print_stats(1, "Code Root Purge", _cur_strong_code_root_purge_time_ms);
265 if (G1StringDedup::is_enabled()) {
266 print_stats(1, "String Dedup Fixup", _cur_string_dedup_fixup_time_ms, _active_gc_threads);
267 for (int i = StringDedupPhasesFirst; i <= StringDedupPhasesLast; i++) {
268 phase_printer.print((GCPhases) i);
269 }
270 }
271 print_stats(1, "Clear CT", _cur_clear_ct_time_ms);
272 double misc_time_ms = pause_time_sec * MILLIUNITS - accounted_time_ms();
273 print_stats(1, "Other", misc_time_ms);
274 if (_cur_verify_before_time_ms > 0.0) {
275 print_stats(2, "Verify Before", _cur_verify_before_time_ms);
276 }
277 if (G1CollectedHeap::heap()->evacuation_failed()) {
278 double evac_fail_handling = _cur_evac_fail_recalc_used + _cur_evac_fail_remove_self_forwards +
279 _cur_evac_fail_restore_remsets;
280 print_stats(2, "Evacuation Failure", evac_fail_handling);
281 if (G1Log::finest()) {
282 print_stats(3, "Recalculate Used", _cur_evac_fail_recalc_used);
283 print_stats(3, "Remove Self Forwards", _cur_evac_fail_remove_self_forwards);
284 print_stats(3, "Restore RemSet", _cur_evac_fail_restore_remsets);
285 }
286 }
287 print_stats(2, "Choose CSet",
288 (_recorded_young_cset_choice_time_ms +
289 _recorded_non_young_cset_choice_time_ms));
290 print_stats(2, "Ref Proc", _cur_ref_proc_time_ms);
291 print_stats(2, "Ref Enq", _cur_ref_enq_time_ms);
292 print_stats(2, "Redirty Cards", _recorded_redirty_logged_cards_time_ms);
293 phase_printer.print(RedirtyCards);
294 if (G1EagerReclaimHumongousObjects) {
295 print_stats(2, "Humongous Register", _cur_fast_reclaim_humongous_register_time_ms);
296 if (G1Log::finest()) {
297 print_stats(3, "Humongous Total", _cur_fast_reclaim_humongous_total);
298 print_stats(3, "Humongous Candidate", _cur_fast_reclaim_humongous_candidates);
299 }
300 print_stats(2, "Humongous Reclaim", _cur_fast_reclaim_humongous_time_ms);
301 if (G1Log::finest()) {
302 print_stats(3, "Humongous Reclaimed", _cur_fast_reclaim_humongous_reclaimed);
303 }
304 }
305 print_stats(2, "Free CSet",
306 (_recorded_young_free_cset_time_ms +
307 _recorded_non_young_free_cset_time_ms));
308 if (G1Log::finest()) {
309 print_stats(3, "Young Free CSet", _recorded_young_free_cset_time_ms);
310 print_stats(3, "Non-Young Free CSet", _recorded_non_young_free_cset_time_ms);
311 }
312 if (_cur_verify_after_time_ms > 0.0) {
313 print_stats(2, "Verify After", _cur_verify_after_time_ms);
314 }
315 }
316
317 G1GCPhaseTimesTracker::G1GCPhaseTimesTracker(G1GCPhaseTimes* phase_times, G1GCPhaseTimes::GCPhases phase, uint worker_id) :
318 _phase_times(phase_times), _phase(phase), _worker_id(worker_id) {
319 if (_phase_times != NULL) {
320 _start_time = os::elapsedTime();
321 }
322 }
323
324 G1GCPhaseTimesTracker::~G1GCPhaseTimesTracker() {
325 if (_phase_times != NULL) {
326 _phase_times->record_time_secs(_phase, _worker_id, os::elapsedTime() - _start_time);
327 }
328 }
329
330 void G1GCPhasePrinter::print_single_length(G1GCPhaseTimes::GCPhases phase_id, WorkerDataArray<double>* phase) {
331 // No need for min, max, average and sum for only one worker
332 LineBuffer buf(phase->_indent_level);
333 buf.append_and_print_cr("[%s: %.1lf]", phase->_title, _phase_times->get_time_ms(phase_id, 0));
334
335 if (phase->_sub_count != NULL) {
336 LineBuffer buf2(phase->_sub_count->_indent_level);
337 buf2.append_and_print_cr("[%s: "SIZE_FORMAT"]", phase->_sub_count->_title, _phase_times->sub_count_sum(phase_id));
338 }
339 }
340
341 void G1GCPhasePrinter::print_time_values(LineBuffer& buf, G1GCPhaseTimes::GCPhases phase_id, WorkerDataArray<double>* phase) {
342 for (uint i = 0; i < phase->_length; ++i) {
343 buf.append(" %.1lf", _phase_times->get_time_ms(phase_id, i));
344 }
345 buf.print_cr();
346 }
347
348 void G1GCPhasePrinter::print_count_values(LineBuffer& buf, G1GCPhaseTimes::GCPhases phase_id, WorkerDataArray<size_t>* sub_count) {
349 for (uint i = 0; i < sub_count->_length; ++i) {
350 buf.append(" " SIZE_FORMAT, _phase_times->get_sub_count(phase_id, i));
351 }
352 buf.print_cr();
353 }
354
355 void G1GCPhasePrinter::print_sub_count(G1GCPhaseTimes::GCPhases phase_id, WorkerDataArray<size_t>* sub_count) {
356 LineBuffer buf(sub_count->_indent_level);
357 buf.append("[%s:", sub_count->_title);
358
359 if (G1Log::finest()) {
360 print_count_values(buf, phase_id, sub_count);
361 }
362
363 assert(sub_count->_print_sum, err_msg("%s does not have print sum true even though it is a count", sub_count->_title));
364
365 buf.append_and_print_cr(" Min: " SIZE_FORMAT ", Avg: %.1lf, Max: " SIZE_FORMAT ", Diff: " SIZE_FORMAT ", Sum: " SIZE_FORMAT "]",
366 _phase_times->min_sub_count(phase_id), _phase_times->average_sub_count(phase_id), _phase_times->max_sub_count(phase_id),
367 _phase_times->max_sub_count(phase_id) - _phase_times->min_sub_count(phase_id), _phase_times->sum_sub_count(phase_id));
368 }
369
370 void G1GCPhasePrinter::print_multi_length(G1GCPhaseTimes::GCPhases phase_id, WorkerDataArray<double>* phase) {
371 LineBuffer buf(phase->_indent_level);
372 buf.append("[%s:", phase->_title);
373
374 if (G1Log::finest()) {
375 print_time_values(buf, phase_id, phase);
376 }
377
378 buf.append(" Min: %.1lf, Avg: %.1lf, Max: %.1lf, Diff: %.1lf",
379 _phase_times->min_time_ms(phase_id), _phase_times->average_time_ms(phase_id), _phase_times->max_time_ms(phase_id),
380 _phase_times->max_time_ms(phase_id) - _phase_times->min_time_ms(phase_id));
381
382 if (phase->_print_sum) {
383 // for things like the start and end times the sum is not
384 // that relevant
385 buf.append(", Sum: %.1lf", _phase_times->sum_time_ms(phase_id));
386 }
387
388 buf.append_and_print_cr("]");
389
390 if (phase->_sub_count != NULL) {
391 print_sub_count(phase_id, phase->_sub_count);
392 }
393 }
394
395 void G1GCPhasePrinter::print(G1GCPhaseTimes::GCPhases phase_id) {
396 WorkerDataArray<double>* phase = _phase_times->_gc_phases[phase_id];
397
398 if (phase->_log_level > G1Log::level() || !phase->_enabled) {
399 return;
400 }
401
402 if (phase->_length == 1) {
403 print_single_length(phase_id, phase);
404 } else {
405 print_multi_length(phase_id, phase);
406 }
407 }
|