Tue, 24 Dec 2013 11:48:39 -0800
8029233: Update copyright year to match last edit in jdk8 hotspot repository for 2013
Summary: Copyright year updated for files modified during 2013
Reviewed-by: twisti, iveresov
1 /*
2 * Copyright (c) 2002, 2013, 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 #include "precompiled.hpp"
26 #include "classfile/classLoaderData.hpp"
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 #include "utilities/macros.hpp"
34 #if INCLUDE_ALL_GCS
35 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp"
36 #endif // INCLUDE_ALL_GCS
38 // HeapInspection
40 int KlassInfoEntry::compare(KlassInfoEntry* e1, KlassInfoEntry* e2) {
41 if(e1->_instance_words > e2->_instance_words) {
42 return -1;
43 } else if(e1->_instance_words < e2->_instance_words) {
44 return 1;
45 }
46 // Sort alphabetically, note 'Z' < '[' < 'a', but it's better to group
47 // the array classes before all the instance classes.
48 ResourceMark rm;
49 const char* name1 = e1->klass()->external_name();
50 const char* name2 = e2->klass()->external_name();
51 bool d1 = (name1[0] == '[');
52 bool d2 = (name2[0] == '[');
53 if (d1 && !d2) {
54 return -1;
55 } else if (d2 && !d1) {
56 return 1;
57 } else {
58 return strcmp(name1, name2);
59 }
60 }
62 const char* KlassInfoEntry::name() const {
63 const char* name;
64 if (_klass->name() != NULL) {
65 name = _klass->external_name();
66 } else {
67 if (_klass == Universe::boolArrayKlassObj()) name = "<boolArrayKlass>"; else
68 if (_klass == Universe::charArrayKlassObj()) name = "<charArrayKlass>"; else
69 if (_klass == Universe::singleArrayKlassObj()) name = "<singleArrayKlass>"; else
70 if (_klass == Universe::doubleArrayKlassObj()) name = "<doubleArrayKlass>"; else
71 if (_klass == Universe::byteArrayKlassObj()) name = "<byteArrayKlass>"; else
72 if (_klass == Universe::shortArrayKlassObj()) name = "<shortArrayKlass>"; else
73 if (_klass == Universe::intArrayKlassObj()) name = "<intArrayKlass>"; else
74 if (_klass == Universe::longArrayKlassObj()) name = "<longArrayKlass>"; else
75 name = "<no name>";
76 }
77 return name;
78 }
80 void KlassInfoEntry::print_on(outputStream* st) const {
81 ResourceMark rm;
83 // simplify the formatting (ILP32 vs LP64) - always cast the numbers to 64-bit
84 st->print_cr(INT64_FORMAT_W(13) " " UINT64_FORMAT_W(13) " %s",
85 (jlong) _instance_count,
86 (julong) _instance_words * HeapWordSize,
87 name());
88 }
90 KlassInfoEntry* KlassInfoBucket::lookup(Klass* const k) {
91 KlassInfoEntry* elt = _list;
92 while (elt != NULL) {
93 if (elt->is_equal(k)) {
94 return elt;
95 }
96 elt = elt->next();
97 }
98 elt = new (std::nothrow) KlassInfoEntry(k, list());
99 // We may be out of space to allocate the new entry.
100 if (elt != NULL) {
101 set_list(elt);
102 }
103 return elt;
104 }
106 void KlassInfoBucket::iterate(KlassInfoClosure* cic) {
107 KlassInfoEntry* elt = _list;
108 while (elt != NULL) {
109 cic->do_cinfo(elt);
110 elt = elt->next();
111 }
112 }
114 void KlassInfoBucket::empty() {
115 KlassInfoEntry* elt = _list;
116 _list = NULL;
117 while (elt != NULL) {
118 KlassInfoEntry* next = elt->next();
119 delete elt;
120 elt = next;
121 }
122 }
124 void KlassInfoTable::AllClassesFinder::do_klass(Klass* k) {
125 // This has the SIDE EFFECT of creating a KlassInfoEntry
126 // for <k>, if one doesn't exist yet.
127 _table->lookup(k);
128 }
130 KlassInfoTable::KlassInfoTable(bool need_class_stats) {
131 _size_of_instances_in_words = 0;
132 _size = 0;
133 _ref = (HeapWord*) Universe::boolArrayKlassObj();
134 _buckets =
135 (KlassInfoBucket*) AllocateHeap(sizeof(KlassInfoBucket) * _num_buckets,
136 mtInternal, 0, AllocFailStrategy::RETURN_NULL);
137 if (_buckets != NULL) {
138 _size = _num_buckets;
139 for (int index = 0; index < _size; index++) {
140 _buckets[index].initialize();
141 }
142 if (need_class_stats) {
143 AllClassesFinder finder(this);
144 ClassLoaderDataGraph::classes_do(&finder);
145 }
146 }
147 }
149 KlassInfoTable::~KlassInfoTable() {
150 if (_buckets != NULL) {
151 for (int index = 0; index < _size; index++) {
152 _buckets[index].empty();
153 }
154 FREE_C_HEAP_ARRAY(KlassInfoBucket, _buckets, mtInternal);
155 _size = 0;
156 }
157 }
159 uint KlassInfoTable::hash(const Klass* p) {
160 return (uint)(((uintptr_t)p - (uintptr_t)_ref) >> 2);
161 }
163 KlassInfoEntry* KlassInfoTable::lookup(Klass* k) {
164 uint idx = hash(k) % _size;
165 assert(_buckets != NULL, "Allocation failure should have been caught");
166 KlassInfoEntry* e = _buckets[idx].lookup(k);
167 // Lookup may fail if this is a new klass for which we
168 // could not allocate space for an new entry.
169 assert(e == NULL || k == e->klass(), "must be equal");
170 return e;
171 }
173 // Return false if the entry could not be recorded on account
174 // of running out of space required to create a new entry.
175 bool KlassInfoTable::record_instance(const oop obj) {
176 Klass* k = obj->klass();
177 KlassInfoEntry* elt = lookup(k);
178 // elt may be NULL if it's a new klass for which we
179 // could not allocate space for a new entry in the hashtable.
180 if (elt != NULL) {
181 elt->set_count(elt->count() + 1);
182 elt->set_words(elt->words() + obj->size());
183 _size_of_instances_in_words += obj->size();
184 return true;
185 } else {
186 return false;
187 }
188 }
190 void KlassInfoTable::iterate(KlassInfoClosure* cic) {
191 assert(_size == 0 || _buckets != NULL, "Allocation failure should have been caught");
192 for (int index = 0; index < _size; index++) {
193 _buckets[index].iterate(cic);
194 }
195 }
197 size_t KlassInfoTable::size_of_instances_in_words() const {
198 return _size_of_instances_in_words;
199 }
201 int KlassInfoHisto::sort_helper(KlassInfoEntry** e1, KlassInfoEntry** e2) {
202 return (*e1)->compare(*e1,*e2);
203 }
205 KlassInfoHisto::KlassInfoHisto(KlassInfoTable* cit, const char* title) :
206 _cit(cit),
207 _title(title) {
208 _elements = new (ResourceObj::C_HEAP, mtInternal) GrowableArray<KlassInfoEntry*>(_histo_initial_size, true);
209 }
211 KlassInfoHisto::~KlassInfoHisto() {
212 delete _elements;
213 }
215 void KlassInfoHisto::add(KlassInfoEntry* cie) {
216 elements()->append(cie);
217 }
219 void KlassInfoHisto::sort() {
220 elements()->sort(KlassInfoHisto::sort_helper);
221 }
223 void KlassInfoHisto::print_elements(outputStream* st) const {
224 // simplify the formatting (ILP32 vs LP64) - store the sum in 64-bit
225 jlong total = 0;
226 julong totalw = 0;
227 for(int i=0; i < elements()->length(); i++) {
228 st->print("%4d: ", i+1);
229 elements()->at(i)->print_on(st);
230 total += elements()->at(i)->count();
231 totalw += elements()->at(i)->words();
232 }
233 st->print_cr("Total " INT64_FORMAT_W(13) " " UINT64_FORMAT_W(13),
234 total, totalw * HeapWordSize);
235 }
237 #define MAKE_COL_NAME(field, name, help) #name,
238 #define MAKE_COL_HELP(field, name, help) help,
240 static const char *name_table[] = {
241 HEAP_INSPECTION_COLUMNS_DO(MAKE_COL_NAME)
242 };
244 static const char *help_table[] = {
245 HEAP_INSPECTION_COLUMNS_DO(MAKE_COL_HELP)
246 };
248 bool KlassInfoHisto::is_selected(const char *col_name) {
249 if (_selected_columns == NULL) {
250 return true;
251 }
252 if (strcmp(_selected_columns, col_name) == 0) {
253 return true;
254 }
256 const char *start = strstr(_selected_columns, col_name);
257 if (start == NULL) {
258 return false;
259 }
261 // The following must be true, because _selected_columns != col_name
262 if (start > _selected_columns && start[-1] != ',') {
263 return false;
264 }
265 char x = start[strlen(col_name)];
266 if (x != ',' && x != '\0') {
267 return false;
268 }
270 return true;
271 }
273 void KlassInfoHisto::print_title(outputStream* st, bool csv_format,
274 bool selected[], int width_table[],
275 const char *name_table[]) {
276 if (csv_format) {
277 st->print("Index,Super");
278 for (int c=0; c<KlassSizeStats::_num_columns; c++) {
279 if (selected[c]) {st->print(",%s", name_table[c]);}
280 }
281 st->print(",ClassName");
282 } else {
283 st->print("Index Super");
284 for (int c=0; c<KlassSizeStats::_num_columns; c++) {
285 if (selected[c]) {st->print(str_fmt(width_table[c]), name_table[c]);}
286 }
287 st->print(" ClassName");
288 }
290 if (is_selected("ClassLoader")) {
291 st->print(",ClassLoader");
292 }
293 st->cr();
294 }
296 void KlassInfoHisto::print_class_stats(outputStream* st,
297 bool csv_format, const char *columns) {
298 ResourceMark rm;
299 KlassSizeStats sz, sz_sum;
300 int i;
301 julong *col_table = (julong*)(&sz);
302 julong *colsum_table = (julong*)(&sz_sum);
303 int width_table[KlassSizeStats::_num_columns];
304 bool selected[KlassSizeStats::_num_columns];
306 _selected_columns = columns;
308 memset(&sz_sum, 0, sizeof(sz_sum));
309 for (int c=0; c<KlassSizeStats::_num_columns; c++) {
310 selected[c] = is_selected(name_table[c]);
311 }
313 for(i=0; i < elements()->length(); i++) {
314 elements()->at(i)->set_index(i+1);
315 }
317 for (int pass=1; pass<=2; pass++) {
318 if (pass == 2) {
319 print_title(st, csv_format, selected, width_table, name_table);
320 }
321 for(i=0; i < elements()->length(); i++) {
322 KlassInfoEntry* e = (KlassInfoEntry*)elements()->at(i);
323 const Klass* k = e->klass();
325 memset(&sz, 0, sizeof(sz));
326 sz._inst_count = e->count();
327 sz._inst_bytes = HeapWordSize * e->words();
328 k->collect_statistics(&sz);
329 sz._total_bytes = sz._ro_bytes + sz._rw_bytes;
331 if (pass == 1) {
332 for (int c=0; c<KlassSizeStats::_num_columns; c++) {
333 colsum_table[c] += col_table[c];
334 }
335 } else {
336 int super_index = -1;
337 if (k->oop_is_instance()) {
338 Klass* super = ((InstanceKlass*)k)->java_super();
339 if (super) {
340 KlassInfoEntry* super_e = _cit->lookup(super);
341 if (super_e) {
342 super_index = super_e->index();
343 }
344 }
345 }
347 if (csv_format) {
348 st->print("%d,%d", e->index(), super_index);
349 for (int c=0; c<KlassSizeStats::_num_columns; c++) {
350 if (selected[c]) {st->print("," JULONG_FORMAT, col_table[c]);}
351 }
352 st->print(",%s",e->name());
353 } else {
354 st->print("%5d %5d", e->index(), super_index);
355 for (int c=0; c<KlassSizeStats::_num_columns; c++) {
356 if (selected[c]) {print_julong(st, width_table[c], col_table[c]);}
357 }
358 st->print(" %s", e->name());
359 }
360 if (is_selected("ClassLoader")) {
361 ClassLoaderData* loader_data = k->class_loader_data();
362 st->print(",");
363 loader_data->print_value_on(st);
364 }
365 st->cr();
366 }
367 }
369 if (pass == 1) {
370 for (int c=0; c<KlassSizeStats::_num_columns; c++) {
371 width_table[c] = col_width(colsum_table[c], name_table[c]);
372 }
373 }
374 }
376 sz_sum._inst_size = 0;
378 if (csv_format) {
379 st->print(",");
380 for (int c=0; c<KlassSizeStats::_num_columns; c++) {
381 if (selected[c]) {st->print("," JULONG_FORMAT, colsum_table[c]);}
382 }
383 } else {
384 st->print(" ");
385 for (int c=0; c<KlassSizeStats::_num_columns; c++) {
386 if (selected[c]) {print_julong(st, width_table[c], colsum_table[c]);}
387 }
388 st->print(" Total");
389 if (sz_sum._total_bytes > 0) {
390 st->cr();
391 st->print(" ");
392 for (int c=0; c<KlassSizeStats::_num_columns; c++) {
393 if (selected[c]) {
394 switch (c) {
395 case KlassSizeStats::_index_inst_size:
396 case KlassSizeStats::_index_inst_count:
397 case KlassSizeStats::_index_method_count:
398 st->print(str_fmt(width_table[c]), "-");
399 break;
400 default:
401 {
402 double perc = (double)(100) * (double)(colsum_table[c]) / (double)sz_sum._total_bytes;
403 st->print(perc_fmt(width_table[c]), perc);
404 }
405 }
406 }
407 }
408 }
409 }
410 st->cr();
412 if (!csv_format) {
413 print_title(st, csv_format, selected, width_table, name_table);
414 }
415 }
417 julong KlassInfoHisto::annotations_bytes(Array<AnnotationArray*>* p) const {
418 julong bytes = 0;
419 if (p != NULL) {
420 for (int i = 0; i < p->length(); i++) {
421 bytes += count_bytes_array(p->at(i));
422 }
423 bytes += count_bytes_array(p);
424 }
425 return bytes;
426 }
428 void KlassInfoHisto::print_histo_on(outputStream* st, bool print_stats,
429 bool csv_format, const char *columns) {
430 if (print_stats) {
431 print_class_stats(st, csv_format, columns);
432 } else {
433 st->print_cr("%s",title());
434 print_elements(st);
435 }
436 }
438 class HistoClosure : public KlassInfoClosure {
439 private:
440 KlassInfoHisto* _cih;
441 public:
442 HistoClosure(KlassInfoHisto* cih) : _cih(cih) {}
444 void do_cinfo(KlassInfoEntry* cie) {
445 _cih->add(cie);
446 }
447 };
449 class RecordInstanceClosure : public ObjectClosure {
450 private:
451 KlassInfoTable* _cit;
452 size_t _missed_count;
453 BoolObjectClosure* _filter;
454 public:
455 RecordInstanceClosure(KlassInfoTable* cit, BoolObjectClosure* filter) :
456 _cit(cit), _missed_count(0), _filter(filter) {}
458 void do_object(oop obj) {
459 if (should_visit(obj)) {
460 if (!_cit->record_instance(obj)) {
461 _missed_count++;
462 }
463 }
464 }
466 size_t missed_count() { return _missed_count; }
468 private:
469 bool should_visit(oop obj) {
470 return _filter == NULL || _filter->do_object_b(obj);
471 }
472 };
474 size_t HeapInspection::populate_table(KlassInfoTable* cit, BoolObjectClosure *filter) {
475 ResourceMark rm;
477 RecordInstanceClosure ric(cit, filter);
478 Universe::heap()->object_iterate(&ric);
479 return ric.missed_count();
480 }
482 void HeapInspection::heap_inspection(outputStream* st) {
483 ResourceMark rm;
485 if (_print_help) {
486 for (int c=0; c<KlassSizeStats::_num_columns; c++) {
487 st->print("%s:\n\t", name_table[c]);
488 const int max_col = 60;
489 int col = 0;
490 for (const char *p = help_table[c]; *p; p++,col++) {
491 if (col >= max_col && *p == ' ') {
492 st->print("\n\t");
493 col = 0;
494 } else {
495 st->print("%c", *p);
496 }
497 }
498 st->print_cr(".\n");
499 }
500 return;
501 }
503 KlassInfoTable cit(_print_class_stats);
504 if (!cit.allocation_failed()) {
505 size_t missed_count = populate_table(&cit);
506 if (missed_count != 0) {
507 st->print_cr("WARNING: Ran out of C-heap; undercounted " SIZE_FORMAT
508 " total instances in data below",
509 missed_count);
510 }
512 // Sort and print klass instance info
513 const char *title = "\n"
514 " num #instances #bytes class name\n"
515 "----------------------------------------------";
516 KlassInfoHisto histo(&cit, title);
517 HistoClosure hc(&histo);
519 cit.iterate(&hc);
521 histo.sort();
522 histo.print_histo_on(st, _print_class_stats, _csv_format, _columns);
523 } else {
524 st->print_cr("WARNING: Ran out of C-heap; histogram not generated");
525 }
526 st->flush();
527 }
529 class FindInstanceClosure : public ObjectClosure {
530 private:
531 Klass* _klass;
532 GrowableArray<oop>* _result;
534 public:
535 FindInstanceClosure(Klass* k, GrowableArray<oop>* result) : _klass(k), _result(result) {};
537 void do_object(oop obj) {
538 if (obj->is_a(_klass)) {
539 _result->append(obj);
540 }
541 }
542 };
544 void HeapInspection::find_instances_at_safepoint(Klass* k, GrowableArray<oop>* result) {
545 assert(SafepointSynchronize::is_at_safepoint(), "all threads are stopped");
546 assert(Heap_lock->is_locked(), "should have the Heap_lock");
548 // Ensure that the heap is parsable
549 Universe::heap()->ensure_parsability(false); // no need to retire TALBs
551 // Iterate over objects in the heap
552 FindInstanceClosure fic(k, result);
553 // If this operation encounters a bad object when using CMS,
554 // consider using safe_object_iterate() which avoids metadata
555 // objects that may contain bad references.
556 Universe::heap()->object_iterate(&fic);
557 }