Mercurial > hg > graal-jvmci-8
annotate src/share/vm/memory/heapInspection.cpp @ 7956:16fb9f942703
6479360: PrintClassHistogram improvements
Summary: jcmd <pid> GC.class_stats (UnlockDiagnosticVMOptions)
Reviewed-by: coleenp, hseigel, sla, acorn
Contributed-by: ioi.lam@oracle.com
| author | acorn |
|---|---|
| date | Fri, 25 Jan 2013 15:06:18 -0500 |
| parents | da91efe96a93 |
| children | 3c9bc17b9403 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 7956 | 2 * Copyright (c) 2002, 2013, Oracle and/or its affiliates. All rights reserved. |
| 0 | 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 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1489
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1489
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1489
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #include "precompiled.hpp" |
| 7956 | 26 #include "classfile/classLoaderData.hpp" |
| 1972 | 27 #include "gc_interface/collectedHeap.hpp" |
| 28 #include "memory/genCollectedHeap.hpp" | |
| 29 #include "memory/heapInspection.hpp" | |
| 30 #include "memory/resourceArea.hpp" | |
| 31 #include "runtime/os.hpp" | |
| 32 #include "utilities/globalDefinitions.hpp" | |
| 33 #ifndef SERIALGC | |
| 34 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp" | |
| 35 #endif | |
| 0 | 36 |
| 37 // HeapInspection | |
| 38 | |
| 39 int KlassInfoEntry::compare(KlassInfoEntry* e1, KlassInfoEntry* e2) { | |
| 40 if(e1->_instance_words > e2->_instance_words) { | |
| 41 return -1; | |
| 42 } else if(e1->_instance_words < e2->_instance_words) { | |
| 43 return 1; | |
| 44 } | |
| 7956 | 45 // Sort alphabetically, note 'Z' < '[' < 'a', but it's better to group |
| 46 // the array classes before all the instance classes. | |
| 47 ResourceMark rm; | |
| 48 const char* name1 = e1->klass()->external_name(); | |
| 49 const char* name2 = e2->klass()->external_name(); | |
| 50 bool d1 = (name1[0] == '['); | |
| 51 bool d2 = (name2[0] == '['); | |
| 52 if (d1 && !d2) { | |
| 53 return -1; | |
| 54 } else if (d2 && !d1) { | |
| 55 return 1; | |
| 56 } else { | |
| 57 return strcmp(name1, name2); | |
| 58 } | |
| 0 | 59 } |
| 60 | |
| 7956 | 61 const char* KlassInfoEntry::name() const { |
| 62 const char* name; | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
63 if (_klass->name() != NULL) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
64 name = _klass->external_name(); |
| 0 | 65 } else { |
| 66 if (_klass == Universe::boolArrayKlassObj()) name = "<boolArrayKlass>"; else | |
| 67 if (_klass == Universe::charArrayKlassObj()) name = "<charArrayKlass>"; else | |
| 68 if (_klass == Universe::singleArrayKlassObj()) name = "<singleArrayKlass>"; else | |
| 69 if (_klass == Universe::doubleArrayKlassObj()) name = "<doubleArrayKlass>"; else | |
| 70 if (_klass == Universe::byteArrayKlassObj()) name = "<byteArrayKlass>"; else | |
| 71 if (_klass == Universe::shortArrayKlassObj()) name = "<shortArrayKlass>"; else | |
| 72 if (_klass == Universe::intArrayKlassObj()) name = "<intArrayKlass>"; else | |
| 73 if (_klass == Universe::longArrayKlassObj()) name = "<longArrayKlass>"; else | |
| 74 name = "<no name>"; | |
| 75 } | |
| 7956 | 76 return name; |
| 77 } | |
| 78 | |
| 79 void KlassInfoEntry::print_on(outputStream* st) const { | |
| 80 ResourceMark rm; | |
| 81 | |
| 0 | 82 // simplify the formatting (ILP32 vs LP64) - always cast the numbers to 64-bit |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
83 st->print_cr(INT64_FORMAT_W(13) " " UINT64_FORMAT_W(13) " %s", |
| 0 | 84 (jlong) _instance_count, |
| 85 (julong) _instance_words * HeapWordSize, | |
| 7956 | 86 name()); |
| 0 | 87 } |
| 88 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
89 KlassInfoEntry* KlassInfoBucket::lookup(Klass* const k) { |
| 0 | 90 KlassInfoEntry* elt = _list; |
| 91 while (elt != NULL) { | |
| 92 if (elt->is_equal(k)) { | |
| 93 return elt; | |
| 94 } | |
| 95 elt = elt->next(); | |
| 96 } | |
| 97 elt = new KlassInfoEntry(k, list()); | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
98 // We may be out of space to allocate the new entry. |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
99 if (elt != NULL) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
100 set_list(elt); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
101 } |
| 0 | 102 return elt; |
| 103 } | |
| 104 | |
| 105 void KlassInfoBucket::iterate(KlassInfoClosure* cic) { | |
| 106 KlassInfoEntry* elt = _list; | |
| 107 while (elt != NULL) { | |
| 108 cic->do_cinfo(elt); | |
| 109 elt = elt->next(); | |
| 110 } | |
| 111 } | |
| 112 | |
| 113 void KlassInfoBucket::empty() { | |
| 114 KlassInfoEntry* elt = _list; | |
| 115 _list = NULL; | |
| 116 while (elt != NULL) { | |
| 117 KlassInfoEntry* next = elt->next(); | |
| 118 delete elt; | |
| 119 elt = next; | |
| 120 } | |
| 121 } | |
| 122 | |
| 7956 | 123 void KlassInfoTable::AllClassesFinder::do_klass(Klass* k) { |
| 124 // This has the SIDE EFFECT of creating a KlassInfoEntry | |
| 125 // for <k>, if one doesn't exist yet. | |
| 126 _table->lookup(k); | |
| 127 } | |
| 128 | |
| 129 KlassInfoTable::KlassInfoTable(int size, HeapWord* ref, | |
| 130 bool need_class_stats) { | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
131 _size = 0; |
| 0 | 132 _ref = ref; |
| 6197 | 133 _buckets = NEW_C_HEAP_ARRAY(KlassInfoBucket, size, mtInternal); |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
134 if (_buckets != NULL) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
135 _size = size; |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
136 for (int index = 0; index < _size; index++) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
137 _buckets[index].initialize(); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
138 } |
| 7956 | 139 if (need_class_stats) { |
| 140 AllClassesFinder finder(this); | |
| 141 ClassLoaderDataGraph::classes_do(&finder); | |
| 142 } | |
| 0 | 143 } |
| 144 } | |
| 145 | |
| 146 KlassInfoTable::~KlassInfoTable() { | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
147 if (_buckets != NULL) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
148 for (int index = 0; index < _size; index++) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
149 _buckets[index].empty(); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
150 } |
| 6197 | 151 FREE_C_HEAP_ARRAY(KlassInfoBucket, _buckets, mtInternal); |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
152 _size = 0; |
| 0 | 153 } |
| 154 } | |
| 155 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
156 uint KlassInfoTable::hash(Klass* p) { |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
157 assert(p->is_metadata(), "all klasses are metadata"); |
| 0 | 158 return (uint)(((uintptr_t)p - (uintptr_t)_ref) >> 2); |
| 159 } | |
| 160 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
161 KlassInfoEntry* KlassInfoTable::lookup(Klass* const k) { |
| 0 | 162 uint idx = hash(k) % _size; |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
163 assert(_buckets != NULL, "Allocation failure should have been caught"); |
| 0 | 164 KlassInfoEntry* e = _buckets[idx].lookup(k); |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
165 // Lookup may fail if this is a new klass for which we |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
166 // could not allocate space for an new entry. |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
167 assert(e == NULL || k == e->klass(), "must be equal"); |
| 0 | 168 return e; |
| 169 } | |
| 170 | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
171 // Return false if the entry could not be recorded on account |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
172 // of running out of space required to create a new entry. |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
173 bool KlassInfoTable::record_instance(const oop obj) { |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
174 Klass* k = obj->klass(); |
| 0 | 175 KlassInfoEntry* elt = lookup(k); |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
176 // elt may be NULL if it's a new klass for which we |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
177 // could not allocate space for a new entry in the hashtable. |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
178 if (elt != NULL) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
179 elt->set_count(elt->count() + 1); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
180 elt->set_words(elt->words() + obj->size()); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
181 return true; |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
182 } else { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
183 return false; |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
184 } |
| 0 | 185 } |
| 186 | |
| 187 void KlassInfoTable::iterate(KlassInfoClosure* cic) { | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
188 assert(_size == 0 || _buckets != NULL, "Allocation failure should have been caught"); |
| 0 | 189 for (int index = 0; index < _size; index++) { |
| 190 _buckets[index].iterate(cic); | |
| 191 } | |
| 192 } | |
| 193 | |
| 194 int KlassInfoHisto::sort_helper(KlassInfoEntry** e1, KlassInfoEntry** e2) { | |
| 195 return (*e1)->compare(*e1,*e2); | |
| 196 } | |
| 197 | |
| 7956 | 198 KlassInfoHisto::KlassInfoHisto(KlassInfoTable* cit, const char* title, int estimatedCount) : |
| 199 _cit(cit), | |
| 0 | 200 _title(title) { |
| 6197 | 201 _elements = new (ResourceObj::C_HEAP, mtInternal) GrowableArray<KlassInfoEntry*>(estimatedCount,true); |
| 0 | 202 } |
| 203 | |
| 204 KlassInfoHisto::~KlassInfoHisto() { | |
| 205 delete _elements; | |
| 206 } | |
| 207 | |
| 208 void KlassInfoHisto::add(KlassInfoEntry* cie) { | |
| 209 elements()->append(cie); | |
| 210 } | |
| 211 | |
| 212 void KlassInfoHisto::sort() { | |
| 213 elements()->sort(KlassInfoHisto::sort_helper); | |
| 214 } | |
| 215 | |
| 216 void KlassInfoHisto::print_elements(outputStream* st) const { | |
| 217 // simplify the formatting (ILP32 vs LP64) - store the sum in 64-bit | |
| 218 jlong total = 0; | |
| 219 julong totalw = 0; | |
| 220 for(int i=0; i < elements()->length(); i++) { | |
| 221 st->print("%4d: ", i+1); | |
| 222 elements()->at(i)->print_on(st); | |
| 223 total += elements()->at(i)->count(); | |
| 224 totalw += elements()->at(i)->words(); | |
| 225 } | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
226 st->print_cr("Total " INT64_FORMAT_W(13) " " UINT64_FORMAT_W(13), |
| 0 | 227 total, totalw * HeapWordSize); |
| 228 } | |
| 229 | |
| 7956 | 230 #define MAKE_COL_NAME(field, name, help) #name, |
| 231 #define MAKE_COL_HELP(field, name, help) help, | |
| 232 | |
| 233 static const char *name_table[] = { | |
| 234 HEAP_INSPECTION_COLUMNS_DO(MAKE_COL_NAME) | |
| 235 }; | |
| 236 | |
| 237 static const char *help_table[] = { | |
| 238 HEAP_INSPECTION_COLUMNS_DO(MAKE_COL_HELP) | |
| 239 }; | |
| 240 | |
| 241 bool KlassInfoHisto::is_selected(const char *col_name) { | |
| 242 if (_selected_columns == NULL) { | |
| 243 return true; | |
| 244 } | |
| 245 if (strcmp(_selected_columns, col_name) == 0) { | |
| 246 return true; | |
| 247 } | |
| 248 | |
| 249 const char *start = strstr(_selected_columns, col_name); | |
| 250 if (start == NULL) { | |
| 251 return false; | |
| 252 } | |
| 253 | |
| 254 // The following must be true, because _selected_columns != col_name | |
| 255 if (start > _selected_columns && start[-1] != ',') { | |
| 256 return false; | |
| 257 } | |
| 258 char x = start[strlen(col_name)]; | |
| 259 if (x != ',' && x != '\0') { | |
| 260 return false; | |
| 261 } | |
| 262 | |
| 263 return true; | |
| 264 } | |
| 265 | |
| 266 void KlassInfoHisto::print_title(outputStream* st, bool csv_format, | |
| 267 bool selected[], int width_table[], | |
| 268 const char *name_table[]) { | |
| 269 if (csv_format) { | |
| 270 st->print("Index,Super"); | |
| 271 for (int c=0; c<KlassSizeStats::_num_columns; c++) { | |
| 272 if (selected[c]) {st->print(",%s", name_table[c]);} | |
| 273 } | |
| 274 st->print(",ClassName"); | |
| 275 } else { | |
| 276 st->print("Index Super"); | |
| 277 for (int c=0; c<KlassSizeStats::_num_columns; c++) { | |
| 278 if (selected[c]) {st->print(str_fmt(width_table[c]), name_table[c]);} | |
| 279 } | |
| 280 st->print(" ClassName"); | |
| 281 } | |
| 282 | |
| 283 if (is_selected("ClassLoader")) { | |
| 284 st->print(",ClassLoader"); | |
| 285 } | |
| 286 st->cr(); | |
| 287 } | |
| 288 | |
| 289 void KlassInfoHisto::print_class_stats(outputStream* st, | |
| 290 bool csv_format, const char *columns) { | |
| 291 ResourceMark rm; | |
| 292 KlassSizeStats sz, sz_sum; | |
| 293 int i; | |
| 294 julong *col_table = (julong*)(&sz); | |
| 295 julong *colsum_table = (julong*)(&sz_sum); | |
| 296 int width_table[KlassSizeStats::_num_columns]; | |
| 297 bool selected[KlassSizeStats::_num_columns]; | |
| 298 | |
| 299 _selected_columns = columns; | |
| 300 | |
| 301 memset(&sz_sum, 0, sizeof(sz_sum)); | |
| 302 for (int c=0; c<KlassSizeStats::_num_columns; c++) { | |
| 303 selected[c] = is_selected(name_table[c]); | |
| 304 } | |
| 305 | |
| 306 for(i=0; i < elements()->length(); i++) { | |
| 307 elements()->at(i)->set_index(i+1); | |
| 308 } | |
| 309 | |
| 310 for (int pass=1; pass<=2; pass++) { | |
| 311 if (pass == 2) { | |
| 312 print_title(st, csv_format, selected, width_table, name_table); | |
| 313 } | |
| 314 for(i=0; i < elements()->length(); i++) { | |
| 315 KlassInfoEntry* e = (KlassInfoEntry*)elements()->at(i); | |
| 316 const Klass* k = e->klass(); | |
| 317 | |
| 318 memset(&sz, 0, sizeof(sz)); | |
| 319 sz._inst_count = e->count(); | |
| 320 sz._inst_bytes = HeapWordSize * e->words(); | |
| 321 k->collect_statistics(&sz); | |
| 322 sz._total_bytes = sz._ro_bytes + sz._rw_bytes; | |
| 323 | |
| 324 if (pass == 1) { | |
| 325 for (int c=0; c<KlassSizeStats::_num_columns; c++) { | |
| 326 colsum_table[c] += col_table[c]; | |
| 327 } | |
| 328 } else { | |
| 329 int super_index = -1; | |
| 330 if (k->oop_is_instance()) { | |
| 331 Klass* super = ((InstanceKlass*)k)->java_super(); | |
| 332 if (super) { | |
| 333 KlassInfoEntry* super_e = _cit->lookup(super); | |
| 334 if (super_e) { | |
| 335 super_index = super_e->index(); | |
| 336 } | |
| 337 } | |
| 338 } | |
| 339 | |
| 340 if (csv_format) { | |
| 341 st->print("%d,%d", e->index(), super_index); | |
| 342 for (int c=0; c<KlassSizeStats::_num_columns; c++) { | |
| 343 if (selected[c]) {st->print("," JULONG_FORMAT, col_table[c]);} | |
| 344 } | |
| 345 st->print(",%s",e->name()); | |
| 346 } else { | |
| 347 st->print("%5d %5d", e->index(), super_index); | |
| 348 for (int c=0; c<KlassSizeStats::_num_columns; c++) { | |
| 349 if (selected[c]) {print_julong(st, width_table[c], col_table[c]);} | |
| 350 } | |
| 351 st->print(" %s", e->name()); | |
| 352 } | |
| 353 if (is_selected("ClassLoader")) { | |
| 354 ClassLoaderData* loader_data = k->class_loader_data(); | |
| 355 st->print(","); | |
| 356 loader_data->print_value_on(st); | |
| 357 } | |
| 358 st->cr(); | |
| 359 } | |
| 360 } | |
| 361 | |
| 362 if (pass == 1) { | |
| 363 for (int c=0; c<KlassSizeStats::_num_columns; c++) { | |
| 364 width_table[c] = col_width(colsum_table[c], name_table[c]); | |
| 365 } | |
| 366 } | |
| 367 } | |
| 368 | |
| 369 sz_sum._inst_size = 0; | |
| 370 | |
| 371 if (csv_format) { | |
| 372 st->print(","); | |
| 373 for (int c=0; c<KlassSizeStats::_num_columns; c++) { | |
| 374 if (selected[c]) {st->print("," JULONG_FORMAT, colsum_table[c]);} | |
| 375 } | |
| 376 } else { | |
| 377 st->print(" "); | |
| 378 for (int c=0; c<KlassSizeStats::_num_columns; c++) { | |
| 379 if (selected[c]) {print_julong(st, width_table[c], colsum_table[c]);} | |
| 380 } | |
| 381 st->print(" Total"); | |
| 382 if (sz_sum._total_bytes > 0) { | |
| 383 st->cr(); | |
| 384 st->print(" "); | |
| 385 for (int c=0; c<KlassSizeStats::_num_columns; c++) { | |
| 386 if (selected[c]) { | |
| 387 switch (c) { | |
| 388 case KlassSizeStats::_index_inst_size: | |
| 389 case KlassSizeStats::_index_inst_count: | |
| 390 case KlassSizeStats::_index_method_count: | |
| 391 st->print(str_fmt(width_table[c]), "-"); | |
| 392 break; | |
| 393 default: | |
| 394 { | |
| 395 double perc = (double)(100) * (double)(colsum_table[c]) / (double)sz_sum._total_bytes; | |
| 396 st->print(perc_fmt(width_table[c]), perc); | |
| 397 } | |
| 398 } | |
| 399 } | |
| 400 } | |
| 401 } | |
| 402 } | |
| 403 st->cr(); | |
| 404 | |
| 405 if (!csv_format) { | |
| 406 print_title(st, csv_format, selected, width_table, name_table); | |
| 407 } | |
| 408 } | |
| 409 | |
| 410 julong KlassInfoHisto::annotations_bytes(Array<AnnotationArray*>* p) const { | |
| 411 julong bytes = 0; | |
| 412 if (p != NULL) { | |
| 413 for (int i = 0; i < p->length(); i++) { | |
| 414 bytes += count_bytes_array(p->at(i)); | |
| 415 } | |
| 416 bytes += count_bytes_array(p); | |
| 417 } | |
| 418 return bytes; | |
| 419 } | |
| 420 | |
| 421 void KlassInfoHisto::print_histo_on(outputStream* st, bool print_stats, | |
| 422 bool csv_format, const char *columns) { | |
| 423 if (print_stats) { | |
| 424 print_class_stats(st, csv_format, columns); | |
| 425 } else { | |
| 426 st->print_cr("%s",title()); | |
| 427 print_elements(st); | |
| 428 } | |
| 0 | 429 } |
| 430 | |
| 431 class HistoClosure : public KlassInfoClosure { | |
| 432 private: | |
| 433 KlassInfoHisto* _cih; | |
| 434 public: | |
| 435 HistoClosure(KlassInfoHisto* cih) : _cih(cih) {} | |
| 436 | |
| 437 void do_cinfo(KlassInfoEntry* cie) { | |
| 438 _cih->add(cie); | |
| 439 } | |
| 440 }; | |
| 441 | |
| 442 class RecordInstanceClosure : public ObjectClosure { | |
| 443 private: | |
| 444 KlassInfoTable* _cit; | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
445 size_t _missed_count; |
| 0 | 446 public: |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
447 RecordInstanceClosure(KlassInfoTable* cit) : |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
448 _cit(cit), _missed_count(0) {} |
| 0 | 449 |
| 450 void do_object(oop obj) { | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
451 if (!_cit->record_instance(obj)) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
452 _missed_count++; |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
453 } |
| 0 | 454 } |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
455 |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
456 size_t missed_count() { return _missed_count; } |
| 0 | 457 }; |
| 458 | |
|
615
c6c601a0f2d6
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
517
diff
changeset
|
459 void HeapInspection::heap_inspection(outputStream* st, bool need_prologue) { |
| 0 | 460 ResourceMark rm; |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
461 // Get some random number for ref (the hash key) |
|
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
462 HeapWord* ref = (HeapWord*) Universe::boolArrayKlassObj(); |
| 0 | 463 CollectedHeap* heap = Universe::heap(); |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
11
diff
changeset
|
464 bool is_shared_heap = false; |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
465 |
| 7956 | 466 if (_print_help) { |
| 467 for (int c=0; c<KlassSizeStats::_num_columns; c++) { | |
| 468 st->print("%s:\n\t", name_table[c]); | |
| 469 const int max_col = 60; | |
| 470 int col = 0; | |
| 471 for (const char *p = help_table[c]; *p; p++,col++) { | |
| 472 if (col >= max_col && *p == ' ') { | |
| 473 st->print("\n\t"); | |
| 474 col = 0; | |
| 475 } else { | |
| 476 st->print("%c", *p); | |
| 477 } | |
| 478 } | |
| 479 st->print_cr(".\n"); | |
| 480 } | |
| 481 return; | |
| 482 } | |
| 483 | |
| 0 | 484 // Collect klass instance info |
| 7956 | 485 KlassInfoTable cit(KlassInfoTable::cit_size, ref, _print_class_stats); |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
486 if (!cit.allocation_failed()) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
487 // Iterate over objects in the heap |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
488 RecordInstanceClosure ric(&cit); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
489 Universe::heap()->object_iterate(&ric); |
| 0 | 490 |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
491 // Report if certain classes are not counted because of |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
492 // running out of C-heap for the histogram. |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
493 size_t missed_count = ric.missed_count(); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
494 if (missed_count != 0) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
495 st->print_cr("WARNING: Ran out of C-heap; undercounted " SIZE_FORMAT |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
496 " total instances in data below", |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
497 missed_count); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
498 } |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
499 // Sort and print klass instance info |
| 7956 | 500 const char *title = "\n" |
| 501 " num #instances #bytes class name\n" | |
| 502 "----------------------------------------------"; | |
| 503 KlassInfoHisto histo(&cit, title, KlassInfoHisto::histo_initial_size); | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
504 HistoClosure hc(&histo); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
505 cit.iterate(&hc); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
506 histo.sort(); |
| 7956 | 507 histo.print_histo_on(st, _print_class_stats, _csv_format, _columns); |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
508 } else { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
509 st->print_cr("WARNING: Ran out of C-heap; histogram not generated"); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
510 } |
| 0 | 511 st->flush(); |
| 512 | |
|
615
c6c601a0f2d6
6797870: Add -XX:+{HeapDump,PrintClassHistogram}{Before,After}FullGC
ysr
parents:
517
diff
changeset
|
513 if (need_prologue && is_shared_heap) { |
|
342
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
11
diff
changeset
|
514 SharedHeap* sh = (SharedHeap*)heap; |
|
37f87013dfd8
6711316: Open source the Garbage-First garbage collector
ysr
parents:
11
diff
changeset
|
515 sh->gc_epilogue(false /* !full */); // release all acquired locks, etc. |
| 0 | 516 } |
| 517 } | |
| 518 | |
| 519 class FindInstanceClosure : public ObjectClosure { | |
| 520 private: | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
521 Klass* _klass; |
| 0 | 522 GrowableArray<oop>* _result; |
| 523 | |
| 524 public: | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
525 FindInstanceClosure(Klass* k, GrowableArray<oop>* result) : _klass(k), _result(result) {}; |
| 0 | 526 |
| 527 void do_object(oop obj) { | |
| 528 if (obj->is_a(_klass)) { | |
| 529 _result->append(obj); | |
| 530 } | |
| 531 } | |
| 532 }; | |
| 533 | |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
534 void HeapInspection::find_instances_at_safepoint(Klass* k, GrowableArray<oop>* result) { |
| 0 | 535 assert(SafepointSynchronize::is_at_safepoint(), "all threads are stopped"); |
|
1489
cff162798819
6888953: some calls to function-like macros are missing semicolons
jcoomes
parents:
628
diff
changeset
|
536 assert(Heap_lock->is_locked(), "should have the Heap_lock"); |
| 0 | 537 |
| 538 // Ensure that the heap is parsable | |
| 539 Universe::heap()->ensure_parsability(false); // no need to retire TALBs | |
| 540 | |
| 541 // Iterate over objects in the heap | |
| 542 FindInstanceClosure fic(k, result); | |
|
517
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
543 // If this operation encounters a bad object when using CMS, |
|
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6197
diff
changeset
|
544 // consider using safe_object_iterate() which avoids metadata |
|
517
e9be0e04635a
6689653: JMapPerm fails with UseConcMarkSweepIncGC and compressed oops off
jmasa
parents:
356
diff
changeset
|
545 // objects that may contain bad references. |
| 0 | 546 Universe::heap()->object_iterate(&fic); |
| 547 } |