1 /* 2 * Copyright (c) 2013, 2015, 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 #include "precompiled.hpp" 26 #include "gc/g1/concurrentG1Refine.hpp" 27 #include "gc/g1/concurrentG1RefineThread.hpp" 28 #include "gc/g1/g1CollectedHeap.inline.hpp" 29 #include "gc/g1/g1RemSet.inline.hpp" 30 #include "gc/g1/g1RemSetSummary.hpp" 31 #include "gc/g1/heapRegion.hpp" 32 #include "gc/g1/heapRegionRemSet.hpp" 33 #include "runtime/thread.inline.hpp" 34 35 class GetRSThreadVTimeClosure : public ThreadClosure { 36 private: 37 G1RemSetSummary* _summary; 38 uint _counter; 39 40 public: 41 GetRSThreadVTimeClosure(G1RemSetSummary * summary) : ThreadClosure(), _summary(summary), _counter(0) { 42 assert(_summary != NULL, "just checking"); 43 } 44 45 virtual void do_thread(Thread* t) { 46 ConcurrentG1RefineThread* crt = (ConcurrentG1RefineThread*) t; 47 _summary->set_rs_thread_vtime(_counter, crt->vtime_accum()); 48 _counter++; 49 } 50 }; 51 52 void G1RemSetSummary::update() { 53 _num_refined_cards = remset()->conc_refine_cards(); 54 DirtyCardQueueSet& dcqs = JavaThread::dirty_card_queue_set(); 55 _num_processed_buf_mutator = dcqs.processed_buffers_mut(); 56 _num_processed_buf_rs_threads = dcqs.processed_buffers_rs_thread(); 57 58 _num_coarsenings = HeapRegionRemSet::n_coarsenings(); 59 60 ConcurrentG1Refine * cg1r = G1CollectedHeap::heap()->concurrent_g1_refine(); 61 if (_rs_threads_vtimes != NULL) { 62 GetRSThreadVTimeClosure p(this); 63 cg1r->worker_threads_do(&p); 64 } 65 set_sampling_thread_vtime(cg1r->sampling_thread()->vtime_accum()); 66 } 67 68 void G1RemSetSummary::set_rs_thread_vtime(uint thread, double value) { 69 assert(_rs_threads_vtimes != NULL, "just checking"); 70 assert(thread < _num_vtimes, "just checking"); 71 _rs_threads_vtimes[thread] = value; 72 } 73 74 double G1RemSetSummary::rs_thread_vtime(uint thread) const { 75 assert(_rs_threads_vtimes != NULL, "just checking"); 76 assert(thread < _num_vtimes, "just checking"); 77 return _rs_threads_vtimes[thread]; 78 } 79 80 void G1RemSetSummary::initialize(G1RemSet* remset) { 81 assert(_rs_threads_vtimes == NULL, "just checking"); 82 assert(remset != NULL, "just checking"); 83 84 _remset = remset; 85 _num_vtimes = ConcurrentG1Refine::thread_num(); 86 _rs_threads_vtimes = NEW_C_HEAP_ARRAY(double, _num_vtimes, mtGC); 87 memset(_rs_threads_vtimes, 0, sizeof(double) * _num_vtimes); 88 89 update(); 90 } 91 92 void G1RemSetSummary::set(G1RemSetSummary* other) { 93 assert(other != NULL, "just checking"); 94 assert(remset() == other->remset(), "just checking"); 95 assert(_num_vtimes == other->_num_vtimes, "just checking"); 96 97 _num_refined_cards = other->num_concurrent_refined_cards(); 98 99 _num_processed_buf_mutator = other->num_processed_buf_mutator(); 100 _num_processed_buf_rs_threads = other->num_processed_buf_rs_threads(); 101 102 _num_coarsenings = other->_num_coarsenings; 103 104 memcpy(_rs_threads_vtimes, other->_rs_threads_vtimes, sizeof(double) * _num_vtimes); 105 106 set_sampling_thread_vtime(other->sampling_thread_vtime()); 107 } 108 109 void G1RemSetSummary::subtract_from(G1RemSetSummary* other) { 110 assert(other != NULL, "just checking"); 111 assert(remset() == other->remset(), "just checking"); 112 assert(_num_vtimes == other->_num_vtimes, "just checking"); 113 114 _num_refined_cards = other->num_concurrent_refined_cards() - _num_refined_cards; 115 116 _num_processed_buf_mutator = other->num_processed_buf_mutator() - _num_processed_buf_mutator; 117 _num_processed_buf_rs_threads = other->num_processed_buf_rs_threads() - _num_processed_buf_rs_threads; 118 119 _num_coarsenings = other->num_coarsenings() - _num_coarsenings; 120 121 for (uint i = 0; i < _num_vtimes; i++) { 122 set_rs_thread_vtime(i, other->rs_thread_vtime(i) - rs_thread_vtime(i)); 123 } 124 125 _sampling_thread_vtime = other->sampling_thread_vtime() - _sampling_thread_vtime; 126 } 127 128 static size_t round_to_K(size_t value) { 129 return value / K; 130 } 131 132 class RegionTypeCounter VALUE_OBJ_CLASS_SPEC { 133 private: 134 const char* _name; 135 136 size_t _rs_mem_size; 137 size_t _cards_occupied; 138 size_t _amount; 139 140 size_t _code_root_mem_size; 141 size_t _code_root_elems; 142 143 double rs_mem_size_percent_of(size_t total) { 144 return percent_of(_rs_mem_size, total); 145 } 146 147 double cards_occupied_percent_of(size_t total) { 148 return percent_of(_cards_occupied, total); 149 } 150 151 double code_root_mem_size_percent_of(size_t total) { 152 return percent_of(_code_root_mem_size, total); 153 } 154 155 double code_root_elems_percent_of(size_t total) { 156 return percent_of(_code_root_elems, total); 157 } 158 159 size_t amount() const { return _amount; } 160 161 public: 162 163 RegionTypeCounter(const char* name) : _name(name), _rs_mem_size(0), _cards_occupied(0), 164 _amount(0), _code_root_mem_size(0), _code_root_elems(0) { } 165 166 void add(size_t rs_mem_size, size_t cards_occupied, size_t code_root_mem_size, 167 size_t code_root_elems) { 168 _rs_mem_size += rs_mem_size; 169 _cards_occupied += cards_occupied; 170 _code_root_mem_size += code_root_mem_size; 171 _code_root_elems += code_root_elems; 172 _amount++; 173 } 174 175 size_t rs_mem_size() const { return _rs_mem_size; } 176 size_t cards_occupied() const { return _cards_occupied; } 177 178 size_t code_root_mem_size() const { return _code_root_mem_size; } 179 size_t code_root_elems() const { return _code_root_elems; } 180 181 void print_rs_mem_info_on(outputStream * out, size_t total) { 182 out->print_cr(" " SIZE_FORMAT_W(8) "K (%5.1f%%) by " SIZE_FORMAT " %s regions", 183 round_to_K(rs_mem_size()), rs_mem_size_percent_of(total), amount(), _name); 184 } 185 186 void print_cards_occupied_info_on(outputStream * out, size_t total) { 187 out->print_cr(" " SIZE_FORMAT_W(8) " (%5.1f%%) entries by " SIZE_FORMAT " %s regions", 188 cards_occupied(), cards_occupied_percent_of(total), amount(), _name); 189 } 190 191 void print_code_root_mem_info_on(outputStream * out, size_t total) { 192 out->print_cr(" " SIZE_FORMAT_W(8) "K (%5.1f%%) by " SIZE_FORMAT " %s regions", 193 round_to_K(code_root_mem_size()), code_root_mem_size_percent_of(total), amount(), _name); 194 } 195 196 void print_code_root_elems_info_on(outputStream * out, size_t total) { 197 out->print_cr(" " SIZE_FORMAT_W(8) " (%5.1f%%) elements by " SIZE_FORMAT " %s regions", 198 code_root_elems(), code_root_elems_percent_of(total), amount(), _name); 199 } 200 }; 201 202 203 class HRRSStatsIter: public HeapRegionClosure { 204 private: 205 RegionTypeCounter _young; 206 RegionTypeCounter _humonguous; 207 RegionTypeCounter _free; 208 RegionTypeCounter _old; 209 RegionTypeCounter _all; 210 211 size_t _max_rs_mem_sz; 212 HeapRegion* _max_rs_mem_sz_region; 213 214 size_t total_rs_mem_sz() const { return _all.rs_mem_size(); } 215 size_t total_cards_occupied() const { return _all.cards_occupied(); } 216 217 size_t max_rs_mem_sz() const { return _max_rs_mem_sz; } 218 HeapRegion* max_rs_mem_sz_region() const { return _max_rs_mem_sz_region; } 219 220 size_t _max_code_root_mem_sz; 221 HeapRegion* _max_code_root_mem_sz_region; 222 223 size_t total_code_root_mem_sz() const { return _all.code_root_mem_size(); } 224 size_t total_code_root_elems() const { return _all.code_root_elems(); } 225 226 size_t max_code_root_mem_sz() const { return _max_code_root_mem_sz; } 227 HeapRegion* max_code_root_mem_sz_region() const { return _max_code_root_mem_sz_region; } 228 229 public: 230 HRRSStatsIter() : _all("All"), _young("Young"), _humonguous("Humonguous"), 231 _free("Free"), _old("Old"), _max_code_root_mem_sz_region(NULL), _max_rs_mem_sz_region(NULL), 232 _max_rs_mem_sz(0), _max_code_root_mem_sz(0) 233 {} 234 235 bool doHeapRegion(HeapRegion* r) { 236 HeapRegionRemSet* hrrs = r->rem_set(); 237 238 // HeapRegionRemSet::mem_size() includes the 239 // size of the strong code roots 240 size_t rs_mem_sz = hrrs->mem_size(); 241 if (rs_mem_sz > _max_rs_mem_sz) { 242 _max_rs_mem_sz = rs_mem_sz; 243 _max_rs_mem_sz_region = r; 244 } 245 size_t occupied_cards = hrrs->occupied(); 246 size_t code_root_mem_sz = hrrs->strong_code_roots_mem_size(); 247 if (code_root_mem_sz > max_code_root_mem_sz()) { 248 _max_code_root_mem_sz = code_root_mem_sz; 249 _max_code_root_mem_sz_region = r; 250 } 251 size_t code_root_elems = hrrs->strong_code_roots_list_length(); 252 253 RegionTypeCounter* current = NULL; 254 if (r->is_free()) { 255 current = &_free; 256 } else if (r->is_young()) { 257 current = &_young; 258 } else if (r->is_humongous()) { 259 current = &_humonguous; 260 } else if (r->is_old()) { 261 current = &_old; 262 } else { 263 ShouldNotReachHere(); 264 } 265 current->add(rs_mem_sz, occupied_cards, code_root_mem_sz, code_root_elems); 266 _all.add(rs_mem_sz, occupied_cards, code_root_mem_sz, code_root_elems); 267 268 return false; 269 } 270 271 void print_summary_on(outputStream* out) { 272 RegionTypeCounter* counters[] = { &_young, &_humonguous, &_free, &_old, NULL }; 273 274 out->print_cr("\n Current rem set statistics"); 275 out->print_cr(" Total per region rem sets sizes = " SIZE_FORMAT "K." 276 " Max = " SIZE_FORMAT "K.", 277 round_to_K(total_rs_mem_sz()), round_to_K(max_rs_mem_sz())); 278 for (RegionTypeCounter** current = &counters[0]; *current != NULL; current++) { 279 (*current)->print_rs_mem_info_on(out, total_rs_mem_sz()); 280 } 281 282 out->print_cr(" Static structures = " SIZE_FORMAT "K," 283 " free_lists = " SIZE_FORMAT "K.", 284 round_to_K(HeapRegionRemSet::static_mem_size()), 285 round_to_K(HeapRegionRemSet::fl_mem_size())); 286 287 out->print_cr(" " SIZE_FORMAT " occupied cards represented.", 288 total_cards_occupied()); 289 for (RegionTypeCounter** current = &counters[0]; *current != NULL; current++) { 290 (*current)->print_cards_occupied_info_on(out, total_cards_occupied()); 291 } 292 293 // Largest sized rem set region statistics 294 HeapRegionRemSet* rem_set = max_rs_mem_sz_region()->rem_set(); 295 out->print_cr(" Region with largest rem set = " HR_FORMAT ", " 296 "size = " SIZE_FORMAT "K, occupied = " SIZE_FORMAT "K.", 297 HR_FORMAT_PARAMS(max_rs_mem_sz_region()), 298 round_to_K(rem_set->mem_size()), 299 round_to_K(rem_set->occupied())); 300 301 // Strong code root statistics 302 HeapRegionRemSet* max_code_root_rem_set = max_code_root_mem_sz_region()->rem_set(); 303 out->print_cr(" Total heap region code root sets sizes = " SIZE_FORMAT "K." 304 " Max = " SIZE_FORMAT "K.", 305 round_to_K(total_code_root_mem_sz()), 306 round_to_K(max_code_root_rem_set->strong_code_roots_mem_size())); 307 for (RegionTypeCounter** current = &counters[0]; *current != NULL; current++) { 308 (*current)->print_code_root_mem_info_on(out, total_code_root_mem_sz()); 309 } 310 311 out->print_cr(" " SIZE_FORMAT " code roots represented.", 312 total_code_root_elems()); 313 for (RegionTypeCounter** current = &counters[0]; *current != NULL; current++) { 314 (*current)->print_code_root_elems_info_on(out, total_code_root_elems()); 315 } 316 317 out->print_cr(" Region with largest amount of code roots = " HR_FORMAT ", " 318 "size = " SIZE_FORMAT "K, num_elems = " SIZE_FORMAT ".", 319 HR_FORMAT_PARAMS(max_code_root_mem_sz_region()), 320 round_to_K(max_code_root_rem_set->strong_code_roots_mem_size()), 321 round_to_K(max_code_root_rem_set->strong_code_roots_list_length())); 322 } 323 }; 324 325 void G1RemSetSummary::print_on(outputStream* out) { 326 out->print_cr("\n Recent concurrent refinement statistics"); 327 out->print_cr(" Processed " SIZE_FORMAT " cards", 328 num_concurrent_refined_cards()); 329 out->print_cr(" Of " SIZE_FORMAT " completed buffers:", num_processed_buf_total()); 330 out->print_cr(" " SIZE_FORMAT_W(8) " (%5.1f%%) by concurrent RS threads.", 331 num_processed_buf_total(), 332 percent_of(num_processed_buf_rs_threads(), num_processed_buf_total())); 333 out->print_cr(" " SIZE_FORMAT_W(8) " (%5.1f%%) by mutator threads.", 334 num_processed_buf_mutator(), 335 percent_of(num_processed_buf_mutator(), num_processed_buf_total())); 336 out->print_cr(" Did " SIZE_FORMAT " coarsenings.", num_coarsenings()); 337 out->print_cr(" Concurrent RS threads times (s)"); 338 out->print(" "); 339 for (uint i = 0; i < _num_vtimes; i++) { 340 out->print(" %5.2f", rs_thread_vtime(i)); 341 } 342 out->cr(); 343 out->print_cr(" Concurrent sampling threads times (s)"); 344 out->print_cr(" %5.2f", sampling_thread_vtime()); 345 346 HRRSStatsIter blk; 347 G1CollectedHeap::heap()->heap_region_iterate(&blk); 348 blk.print_summary_on(out); 349 }