Thu, 28 Mar 2013 10:27:28 +0100
7014552: gc/lock/jni/jnilockXXX works too slow on 1-processor machine
Summary: Keep a counter of how many times we were stalled by the GC locker, add a diagnostic flag which sets the limit.
Reviewed-by: brutisso, ehelin, johnc
1 /*
2 * Copyright (c) 2012, 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 */
25 #ifndef SHARE_VM_GC_IMPLEMENTATION_G1_G1GCPHASETIMESLOG_HPP
26 #define SHARE_VM_GC_IMPLEMENTATION_G1_G1GCPHASETIMESLOG_HPP
28 #include "memory/allocation.hpp"
29 #include "gc_interface/gcCause.hpp"
31 template <class T>
32 class WorkerDataArray : public CHeapObj<mtGC> {
33 T* _data;
34 uint _length;
35 const char* _print_format;
36 bool _print_sum;
38 NOT_PRODUCT(static const T _uninitialized;)
40 // We are caching the sum and average to only have to calculate them once.
41 // This is not done in an MT-safe way. It is intetened to allow single
42 // threaded code to call sum() and average() multiple times in any order
43 // without having to worry about the cost.
44 bool _has_new_data;
45 T _sum;
46 double _average;
48 public:
49 WorkerDataArray(uint length, const char* print_format, bool print_sum = true) :
50 _length(length), _print_format(print_format), _print_sum(print_sum), _has_new_data(true) {
51 assert(length > 0, "Must have some workers to store data for");
52 _data = NEW_C_HEAP_ARRAY(T, _length, mtGC);
53 }
55 ~WorkerDataArray() {
56 FREE_C_HEAP_ARRAY(T, _data, mtGC);
57 }
59 void set(uint worker_i, T value) {
60 assert(worker_i < _length, err_msg("Worker %d is greater than max: %d", worker_i, _length));
61 assert(_data[worker_i] == (T)-1, err_msg("Overwriting data for worker %d", worker_i));
62 _data[worker_i] = value;
63 _has_new_data = true;
64 }
66 T get(uint worker_i) {
67 assert(worker_i < _length, err_msg("Worker %d is greater than max: %d", worker_i, _length));
68 assert(_data[worker_i] != (T)-1, err_msg("No data to add to for worker %d", worker_i));
69 return _data[worker_i];
70 }
72 void add(uint worker_i, T value) {
73 assert(worker_i < _length, err_msg("Worker %d is greater than max: %d", worker_i, _length));
74 assert(_data[worker_i] != (T)-1, err_msg("No data to add to for worker %d", worker_i));
75 _data[worker_i] += value;
76 _has_new_data = true;
77 }
79 double average(){
80 if (_has_new_data) {
81 calculate_totals();
82 }
83 return _average;
84 }
86 T sum() {
87 if (_has_new_data) {
88 calculate_totals();
89 }
90 return _sum;
91 }
93 void print(int level, const char* title);
95 void reset() PRODUCT_RETURN;
96 void verify() PRODUCT_RETURN;
98 private:
100 void calculate_totals(){
101 _sum = (T)0;
102 for (uint i = 0; i < _length; ++i) {
103 _sum += _data[i];
104 }
105 _average = (double)_sum / (double)_length;
106 _has_new_data = false;
107 }
108 };
110 class G1GCPhaseTimes : public CHeapObj<mtGC> {
112 private:
113 uint _active_gc_threads;
114 uint _max_gc_threads;
116 WorkerDataArray<double> _last_gc_worker_start_times_ms;
117 WorkerDataArray<double> _last_ext_root_scan_times_ms;
118 WorkerDataArray<double> _last_satb_filtering_times_ms;
119 WorkerDataArray<double> _last_update_rs_times_ms;
120 WorkerDataArray<int> _last_update_rs_processed_buffers;
121 WorkerDataArray<double> _last_scan_rs_times_ms;
122 WorkerDataArray<double> _last_obj_copy_times_ms;
123 WorkerDataArray<double> _last_termination_times_ms;
124 WorkerDataArray<size_t> _last_termination_attempts;
125 WorkerDataArray<double> _last_gc_worker_end_times_ms;
126 WorkerDataArray<double> _last_gc_worker_times_ms;
127 WorkerDataArray<double> _last_gc_worker_other_times_ms;
129 double _cur_collection_par_time_ms;
130 double _cur_collection_code_root_fixup_time_ms;
132 double _cur_clear_ct_time_ms;
133 double _cur_ref_proc_time_ms;
134 double _cur_ref_enq_time_ms;
136 // Card Table Count Cache stats
137 double _min_clear_cc_time_ms; // min
138 double _max_clear_cc_time_ms; // max
139 double _cur_clear_cc_time_ms; // clearing time during current pause
140 double _cum_clear_cc_time_ms; // cummulative clearing time
141 jlong _num_cc_clears; // number of times the card count cache has been cleared
143 double _cur_collection_start_sec;
144 double _root_region_scan_wait_time_ms;
146 double _recorded_young_cset_choice_time_ms;
147 double _recorded_non_young_cset_choice_time_ms;
149 double _recorded_young_free_cset_time_ms;
150 double _recorded_non_young_free_cset_time_ms;
152 double _cur_verify_before_time_ms;
153 double _cur_verify_after_time_ms;
155 // Helper methods for detailed logging
156 void print_stats(int level, const char* str, double value);
157 void print_stats(int level, const char* str, double value, int workers);
159 public:
160 G1GCPhaseTimes(uint max_gc_threads);
161 void note_gc_start(uint active_gc_threads);
162 void note_gc_end();
163 void print(double pause_time_sec);
165 void record_gc_worker_start_time(uint worker_i, double ms) {
166 _last_gc_worker_start_times_ms.set(worker_i, ms);
167 }
169 void record_ext_root_scan_time(uint worker_i, double ms) {
170 _last_ext_root_scan_times_ms.set(worker_i, ms);
171 }
173 void record_satb_filtering_time(uint worker_i, double ms) {
174 _last_satb_filtering_times_ms.set(worker_i, ms);
175 }
177 void record_update_rs_time(uint worker_i, double ms) {
178 _last_update_rs_times_ms.set(worker_i, ms);
179 }
181 void record_update_rs_processed_buffers(uint worker_i, int processed_buffers) {
182 _last_update_rs_processed_buffers.set(worker_i, processed_buffers);
183 }
185 void record_scan_rs_time(uint worker_i, double ms) {
186 _last_scan_rs_times_ms.set(worker_i, ms);
187 }
189 void record_obj_copy_time(uint worker_i, double ms) {
190 _last_obj_copy_times_ms.set(worker_i, ms);
191 }
193 void add_obj_copy_time(uint worker_i, double ms) {
194 _last_obj_copy_times_ms.add(worker_i, ms);
195 }
197 void record_termination(uint worker_i, double ms, size_t attempts) {
198 _last_termination_times_ms.set(worker_i, ms);
199 _last_termination_attempts.set(worker_i, attempts);
200 }
202 void record_gc_worker_end_time(uint worker_i, double ms) {
203 _last_gc_worker_end_times_ms.set(worker_i, ms);
204 }
206 void record_clear_ct_time(double ms) {
207 _cur_clear_ct_time_ms = ms;
208 }
210 void record_par_time(double ms) {
211 _cur_collection_par_time_ms = ms;
212 }
214 void record_code_root_fixup_time(double ms) {
215 _cur_collection_code_root_fixup_time_ms = ms;
216 }
218 void record_ref_proc_time(double ms) {
219 _cur_ref_proc_time_ms = ms;
220 }
222 void record_ref_enq_time(double ms) {
223 _cur_ref_enq_time_ms = ms;
224 }
226 void record_root_region_scan_wait_time(double time_ms) {
227 _root_region_scan_wait_time_ms = time_ms;
228 }
230 void record_cc_clear_time_ms(double ms);
232 void record_young_free_cset_time_ms(double time_ms) {
233 _recorded_young_free_cset_time_ms = time_ms;
234 }
236 void record_non_young_free_cset_time_ms(double time_ms) {
237 _recorded_non_young_free_cset_time_ms = time_ms;
238 }
240 void record_young_cset_choice_time_ms(double time_ms) {
241 _recorded_young_cset_choice_time_ms = time_ms;
242 }
244 void record_non_young_cset_choice_time_ms(double time_ms) {
245 _recorded_non_young_cset_choice_time_ms = time_ms;
246 }
248 void record_cur_collection_start_sec(double time_ms) {
249 _cur_collection_start_sec = time_ms;
250 }
252 void record_verify_before_time_ms(double time_ms) {
253 _cur_verify_before_time_ms = time_ms;
254 }
256 void record_verify_after_time_ms(double time_ms) {
257 _cur_verify_after_time_ms = time_ms;
258 }
260 double accounted_time_ms();
262 double cur_collection_start_sec() {
263 return _cur_collection_start_sec;
264 }
266 double cur_collection_par_time_ms() {
267 return _cur_collection_par_time_ms;
268 }
270 double cur_clear_ct_time_ms() {
271 return _cur_clear_ct_time_ms;
272 }
274 double root_region_scan_wait_time_ms() {
275 return _root_region_scan_wait_time_ms;
276 }
278 double young_cset_choice_time_ms() {
279 return _recorded_young_cset_choice_time_ms;
280 }
282 double young_free_cset_time_ms() {
283 return _recorded_young_free_cset_time_ms;
284 }
286 double non_young_cset_choice_time_ms() {
287 return _recorded_non_young_cset_choice_time_ms;
288 }
290 double non_young_free_cset_time_ms() {
291 return _recorded_non_young_free_cset_time_ms;
292 }
294 double average_last_update_rs_time() {
295 return _last_update_rs_times_ms.average();
296 }
298 int sum_last_update_rs_processed_buffers() {
299 return _last_update_rs_processed_buffers.sum();
300 }
302 double average_last_scan_rs_time(){
303 return _last_scan_rs_times_ms.average();
304 }
306 double average_last_obj_copy_time() {
307 return _last_obj_copy_times_ms.average();
308 }
310 double average_last_termination_time() {
311 return _last_termination_times_ms.average();
312 }
314 double average_last_ext_root_scan_time() {
315 return _last_ext_root_scan_times_ms.average();
316 }
318 double average_last_satb_filtering_times_ms() {
319 return _last_satb_filtering_times_ms.average();
320 }
321 };
323 #endif // SHARE_VM_GC_IMPLEMENTATION_G1_G1GCPHASETIMESLOG_HPP