duke@435: /*
acorn@4497:  * Copyright (c) 2002, 2013, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
acorn@4497: #include "classfile/classLoaderData.hpp"
stefank@2314: #include "gc_interface/collectedHeap.hpp"
stefank@2314: #include "memory/genCollectedHeap.hpp"
stefank@2314: #include "memory/heapInspection.hpp"
stefank@2314: #include "memory/resourceArea.hpp"
stefank@2314: #include "runtime/os.hpp"
stefank@2314: #include "utilities/globalDefinitions.hpp"
jprovino@4542: #include "utilities/macros.hpp"
jprovino@4542: #if INCLUDE_ALL_GCS
stefank@2314: #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp"
jprovino@4542: #endif // INCLUDE_ALL_GCS
duke@435: 
duke@435: // HeapInspection
duke@435: 
duke@435: int KlassInfoEntry::compare(KlassInfoEntry* e1, KlassInfoEntry* e2) {
duke@435:   if(e1->_instance_words > e2->_instance_words) {
duke@435:     return -1;
duke@435:   } else if(e1->_instance_words < e2->_instance_words) {
duke@435:     return 1;
duke@435:   }
acorn@4497:   // Sort alphabetically, note 'Z' < '[' < 'a', but it's better to group
acorn@4497:   // the array classes before all the instance classes.
acorn@4497:   ResourceMark rm;
acorn@4497:   const char* name1 = e1->klass()->external_name();
acorn@4497:   const char* name2 = e2->klass()->external_name();
acorn@4497:   bool d1 = (name1[0] == '[');
acorn@4497:   bool d2 = (name2[0] == '[');
acorn@4497:   if (d1 && !d2) {
acorn@4497:     return -1;
acorn@4497:   } else if (d2 && !d1) {
acorn@4497:     return 1;
acorn@4497:   } else {
acorn@4497:     return strcmp(name1, name2);
acorn@4497:   }
duke@435: }
duke@435: 
acorn@4497: const char* KlassInfoEntry::name() const {
acorn@4497:   const char* name;
coleenp@4037:   if (_klass->name() != NULL) {
coleenp@4037:     name = _klass->external_name();
duke@435:   } else {
duke@435:     if (_klass == Universe::boolArrayKlassObj())         name = "<boolArrayKlass>";         else
duke@435:     if (_klass == Universe::charArrayKlassObj())         name = "<charArrayKlass>";         else
duke@435:     if (_klass == Universe::singleArrayKlassObj())       name = "<singleArrayKlass>";       else
duke@435:     if (_klass == Universe::doubleArrayKlassObj())       name = "<doubleArrayKlass>";       else
duke@435:     if (_klass == Universe::byteArrayKlassObj())         name = "<byteArrayKlass>";         else
duke@435:     if (_klass == Universe::shortArrayKlassObj())        name = "<shortArrayKlass>";        else
duke@435:     if (_klass == Universe::intArrayKlassObj())          name = "<intArrayKlass>";          else
duke@435:     if (_klass == Universe::longArrayKlassObj())         name = "<longArrayKlass>";         else
duke@435:       name = "<no name>";
duke@435:   }
acorn@4497:   return name;
acorn@4497: }
acorn@4497: 
acorn@4497: void KlassInfoEntry::print_on(outputStream* st) const {
acorn@4497:   ResourceMark rm;
acorn@4497: 
duke@435:   // simplify the formatting (ILP32 vs LP64) - always cast the numbers to 64-bit
ysr@446:   st->print_cr(INT64_FORMAT_W(13) "  " UINT64_FORMAT_W(13) "  %s",
duke@435:                (jlong)  _instance_count,
duke@435:                (julong) _instance_words * HeapWordSize,
acorn@4497:                name());
duke@435: }
duke@435: 
coleenp@4037: KlassInfoEntry* KlassInfoBucket::lookup(Klass* const k) {
duke@435:   KlassInfoEntry* elt = _list;
duke@435:   while (elt != NULL) {
duke@435:     if (elt->is_equal(k)) {
duke@435:       return elt;
duke@435:     }
duke@435:     elt = elt->next();
duke@435:   }
sla@5237:   elt = new (std::nothrow) KlassInfoEntry(k, list());
ysr@446:   // We may be out of space to allocate the new entry.
ysr@446:   if (elt != NULL) {
ysr@446:     set_list(elt);
ysr@446:   }
duke@435:   return elt;
duke@435: }
duke@435: 
duke@435: void KlassInfoBucket::iterate(KlassInfoClosure* cic) {
duke@435:   KlassInfoEntry* elt = _list;
duke@435:   while (elt != NULL) {
duke@435:     cic->do_cinfo(elt);
duke@435:     elt = elt->next();
duke@435:   }
duke@435: }
duke@435: 
duke@435: void KlassInfoBucket::empty() {
duke@435:   KlassInfoEntry* elt = _list;
duke@435:   _list = NULL;
duke@435:   while (elt != NULL) {
duke@435:     KlassInfoEntry* next = elt->next();
duke@435:     delete elt;
duke@435:     elt = next;
duke@435:   }
duke@435: }
duke@435: 
acorn@4497: void KlassInfoTable::AllClassesFinder::do_klass(Klass* k) {
acorn@4497:   // This has the SIDE EFFECT of creating a KlassInfoEntry
acorn@4497:   // for <k>, if one doesn't exist yet.
acorn@4497:   _table->lookup(k);
acorn@4497: }
acorn@4497: 
sla@5237: KlassInfoTable::KlassInfoTable(bool need_class_stats) {
sla@5237:   _size_of_instances_in_words = 0;
ysr@446:   _size = 0;
sla@5237:   _ref = (HeapWord*) Universe::boolArrayKlassObj();
sla@5237:   _buckets =
sla@5237:     (KlassInfoBucket*)  AllocateHeap(sizeof(KlassInfoBucket) * _num_buckets,
sla@5237:                                             mtInternal, 0, AllocFailStrategy::RETURN_NULL);
ysr@446:   if (_buckets != NULL) {
sla@5237:     _size = _num_buckets;
ysr@446:     for (int index = 0; index < _size; index++) {
ysr@446:       _buckets[index].initialize();
ysr@446:     }
acorn@4497:     if (need_class_stats) {
acorn@4497:       AllClassesFinder finder(this);
acorn@4497:       ClassLoaderDataGraph::classes_do(&finder);
acorn@4497:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: KlassInfoTable::~KlassInfoTable() {
ysr@446:   if (_buckets != NULL) {
ysr@446:     for (int index = 0; index < _size; index++) {
ysr@446:       _buckets[index].empty();
ysr@446:     }
zgu@3900:     FREE_C_HEAP_ARRAY(KlassInfoBucket, _buckets, mtInternal);
ysr@446:     _size = 0;
duke@435:   }
duke@435: }
duke@435: 
minqi@5097: uint KlassInfoTable::hash(const Klass* p) {
duke@435:   return (uint)(((uintptr_t)p - (uintptr_t)_ref) >> 2);
duke@435: }
duke@435: 
minqi@5097: KlassInfoEntry* KlassInfoTable::lookup(Klass* k) {
duke@435:   uint         idx = hash(k) % _size;
ysr@446:   assert(_buckets != NULL, "Allocation failure should have been caught");
duke@435:   KlassInfoEntry*  e   = _buckets[idx].lookup(k);
ysr@446:   // Lookup may fail if this is a new klass for which we
ysr@446:   // could not allocate space for an new entry.
ysr@446:   assert(e == NULL || k == e->klass(), "must be equal");
duke@435:   return e;
duke@435: }
duke@435: 
ysr@446: // Return false if the entry could not be recorded on account
ysr@446: // of running out of space required to create a new entry.
ysr@446: bool KlassInfoTable::record_instance(const oop obj) {
coleenp@4037:   Klass*        k = obj->klass();
duke@435:   KlassInfoEntry* elt = lookup(k);
ysr@446:   // elt may be NULL if it's a new klass for which we
ysr@446:   // could not allocate space for a new entry in the hashtable.
ysr@446:   if (elt != NULL) {
ysr@446:     elt->set_count(elt->count() + 1);
ysr@446:     elt->set_words(elt->words() + obj->size());
sla@5237:     _size_of_instances_in_words += obj->size();
ysr@446:     return true;
ysr@446:   } else {
ysr@446:     return false;
ysr@446:   }
duke@435: }
duke@435: 
duke@435: void KlassInfoTable::iterate(KlassInfoClosure* cic) {
ysr@446:   assert(_size == 0 || _buckets != NULL, "Allocation failure should have been caught");
duke@435:   for (int index = 0; index < _size; index++) {
duke@435:     _buckets[index].iterate(cic);
duke@435:   }
duke@435: }
duke@435: 
sla@5237: size_t KlassInfoTable::size_of_instances_in_words() const {
sla@5237:   return _size_of_instances_in_words;
sla@5237: }
sla@5237: 
duke@435: int KlassInfoHisto::sort_helper(KlassInfoEntry** e1, KlassInfoEntry** e2) {
duke@435:   return (*e1)->compare(*e1,*e2);
duke@435: }
duke@435: 
sla@5237: KlassInfoHisto::KlassInfoHisto(KlassInfoTable* cit, const char* title) :
acorn@4497:   _cit(cit),
duke@435:   _title(title) {
sla@5237:   _elements = new (ResourceObj::C_HEAP, mtInternal) GrowableArray<KlassInfoEntry*>(_histo_initial_size, true);
duke@435: }
duke@435: 
duke@435: KlassInfoHisto::~KlassInfoHisto() {
duke@435:   delete _elements;
duke@435: }
duke@435: 
duke@435: void KlassInfoHisto::add(KlassInfoEntry* cie) {
duke@435:   elements()->append(cie);
duke@435: }
duke@435: 
duke@435: void KlassInfoHisto::sort() {
duke@435:   elements()->sort(KlassInfoHisto::sort_helper);
duke@435: }
duke@435: 
duke@435: void KlassInfoHisto::print_elements(outputStream* st) const {
duke@435:   // simplify the formatting (ILP32 vs LP64) - store the sum in 64-bit
duke@435:   jlong total = 0;
duke@435:   julong totalw = 0;
duke@435:   for(int i=0; i < elements()->length(); i++) {
duke@435:     st->print("%4d: ", i+1);
duke@435:     elements()->at(i)->print_on(st);
duke@435:     total += elements()->at(i)->count();
duke@435:     totalw += elements()->at(i)->words();
duke@435:   }
ysr@446:   st->print_cr("Total " INT64_FORMAT_W(13) "  " UINT64_FORMAT_W(13),
duke@435:                total, totalw * HeapWordSize);
duke@435: }
duke@435: 
acorn@4497: #define MAKE_COL_NAME(field, name, help)     #name,
acorn@4497: #define MAKE_COL_HELP(field, name, help)     help,
acorn@4497: 
acorn@4497: static const char *name_table[] = {
acorn@4497:   HEAP_INSPECTION_COLUMNS_DO(MAKE_COL_NAME)
acorn@4497: };
acorn@4497: 
acorn@4497: static const char *help_table[] = {
acorn@4497:   HEAP_INSPECTION_COLUMNS_DO(MAKE_COL_HELP)
acorn@4497: };
acorn@4497: 
acorn@4497: bool KlassInfoHisto::is_selected(const char *col_name) {
acorn@4497:   if (_selected_columns == NULL) {
acorn@4497:     return true;
acorn@4497:   }
acorn@4497:   if (strcmp(_selected_columns, col_name) == 0) {
acorn@4497:     return true;
acorn@4497:   }
acorn@4497: 
acorn@4497:   const char *start = strstr(_selected_columns, col_name);
acorn@4497:   if (start == NULL) {
acorn@4497:     return false;
acorn@4497:   }
acorn@4497: 
acorn@4497:   // The following must be true, because _selected_columns != col_name
acorn@4497:   if (start > _selected_columns && start[-1] != ',') {
acorn@4497:     return false;
acorn@4497:   }
acorn@4497:   char x = start[strlen(col_name)];
acorn@4497:   if (x != ',' && x != '\0') {
acorn@4497:     return false;
acorn@4497:   }
acorn@4497: 
acorn@4497:   return true;
acorn@4497: }
acorn@4497: 
acorn@4497: void KlassInfoHisto::print_title(outputStream* st, bool csv_format,
acorn@4497:                                  bool selected[], int width_table[],
acorn@4497:                                  const char *name_table[]) {
acorn@4497:   if (csv_format) {
acorn@4497:     st->print("Index,Super");
acorn@4497:     for (int c=0; c<KlassSizeStats::_num_columns; c++) {
acorn@4497:        if (selected[c]) {st->print(",%s", name_table[c]);}
acorn@4497:     }
acorn@4497:     st->print(",ClassName");
acorn@4497:   } else {
acorn@4497:     st->print("Index Super");
acorn@4497:     for (int c=0; c<KlassSizeStats::_num_columns; c++) {
acorn@4497:       if (selected[c]) {st->print(str_fmt(width_table[c]), name_table[c]);}
acorn@4497:     }
acorn@4497:     st->print(" ClassName");
acorn@4497:   }
acorn@4497: 
acorn@4497:   if (is_selected("ClassLoader")) {
acorn@4497:     st->print(",ClassLoader");
acorn@4497:   }
acorn@4497:   st->cr();
acorn@4497: }
acorn@4497: 
acorn@4497: void KlassInfoHisto::print_class_stats(outputStream* st,
acorn@4497:                                       bool csv_format, const char *columns) {
acorn@4497:   ResourceMark rm;
acorn@4497:   KlassSizeStats sz, sz_sum;
acorn@4497:   int i;
acorn@4497:   julong *col_table = (julong*)(&sz);
acorn@4497:   julong *colsum_table = (julong*)(&sz_sum);
acorn@4497:   int width_table[KlassSizeStats::_num_columns];
acorn@4497:   bool selected[KlassSizeStats::_num_columns];
acorn@4497: 
acorn@4497:   _selected_columns = columns;
acorn@4497: 
acorn@4497:   memset(&sz_sum, 0, sizeof(sz_sum));
acorn@4497:   for (int c=0; c<KlassSizeStats::_num_columns; c++) {
acorn@4497:     selected[c] = is_selected(name_table[c]);
acorn@4497:   }
acorn@4497: 
acorn@4497:   for(i=0; i < elements()->length(); i++) {
acorn@4497:     elements()->at(i)->set_index(i+1);
acorn@4497:   }
acorn@4497: 
acorn@4497:   for (int pass=1; pass<=2; pass++) {
acorn@4497:     if (pass == 2) {
acorn@4497:       print_title(st, csv_format, selected, width_table, name_table);
acorn@4497:     }
acorn@4497:     for(i=0; i < elements()->length(); i++) {
acorn@4497:       KlassInfoEntry* e = (KlassInfoEntry*)elements()->at(i);
acorn@4497:       const Klass* k = e->klass();
acorn@4497: 
acorn@4497:       memset(&sz, 0, sizeof(sz));
acorn@4497:       sz._inst_count = e->count();
acorn@4497:       sz._inst_bytes = HeapWordSize * e->words();
acorn@4497:       k->collect_statistics(&sz);
acorn@4497:       sz._total_bytes = sz._ro_bytes + sz._rw_bytes;
acorn@4497: 
acorn@4497:       if (pass == 1) {
acorn@4497:         for (int c=0; c<KlassSizeStats::_num_columns; c++) {
acorn@4497:           colsum_table[c] += col_table[c];
acorn@4497:         }
acorn@4497:       } else {
acorn@4497:         int super_index = -1;
acorn@4497:         if (k->oop_is_instance()) {
acorn@4497:           Klass* super = ((InstanceKlass*)k)->java_super();
acorn@4497:           if (super) {
acorn@4497:             KlassInfoEntry* super_e = _cit->lookup(super);
acorn@4497:             if (super_e) {
acorn@4497:               super_index = super_e->index();
acorn@4497:             }
acorn@4497:           }
acorn@4497:         }
acorn@4497: 
acorn@4497:         if (csv_format) {
acorn@4497:           st->print("%d,%d", e->index(), super_index);
acorn@4497:           for (int c=0; c<KlassSizeStats::_num_columns; c++) {
acorn@4497:             if (selected[c]) {st->print("," JULONG_FORMAT, col_table[c]);}
acorn@4497:           }
acorn@4497:           st->print(",%s",e->name());
acorn@4497:         } else {
acorn@4497:           st->print("%5d %5d", e->index(), super_index);
acorn@4497:           for (int c=0; c<KlassSizeStats::_num_columns; c++) {
acorn@4497:             if (selected[c]) {print_julong(st, width_table[c], col_table[c]);}
acorn@4497:           }
acorn@4497:           st->print(" %s", e->name());
acorn@4497:         }
acorn@4497:         if (is_selected("ClassLoader")) {
acorn@4497:           ClassLoaderData* loader_data = k->class_loader_data();
acorn@4497:           st->print(",");
acorn@4497:           loader_data->print_value_on(st);
acorn@4497:         }
acorn@4497:         st->cr();
acorn@4497:       }
acorn@4497:     }
acorn@4497: 
acorn@4497:     if (pass == 1) {
acorn@4497:       for (int c=0; c<KlassSizeStats::_num_columns; c++) {
acorn@4497:         width_table[c] = col_width(colsum_table[c], name_table[c]);
acorn@4497:       }
acorn@4497:     }
acorn@4497:   }
acorn@4497: 
acorn@4497:   sz_sum._inst_size = 0;
acorn@4497: 
acorn@4497:   if (csv_format) {
acorn@4497:     st->print(",");
acorn@4497:     for (int c=0; c<KlassSizeStats::_num_columns; c++) {
acorn@4497:       if (selected[c]) {st->print("," JULONG_FORMAT, colsum_table[c]);}
acorn@4497:     }
acorn@4497:   } else {
acorn@4497:     st->print("           ");
acorn@4497:     for (int c=0; c<KlassSizeStats::_num_columns; c++) {
acorn@4497:       if (selected[c]) {print_julong(st, width_table[c], colsum_table[c]);}
acorn@4497:     }
acorn@4497:     st->print(" Total");
acorn@4497:     if (sz_sum._total_bytes > 0) {
acorn@4497:       st->cr();
acorn@4497:       st->print("           ");
acorn@4497:       for (int c=0; c<KlassSizeStats::_num_columns; c++) {
acorn@4497:         if (selected[c]) {
acorn@4497:           switch (c) {
acorn@4497:           case KlassSizeStats::_index_inst_size:
acorn@4497:           case KlassSizeStats::_index_inst_count:
acorn@4497:           case KlassSizeStats::_index_method_count:
acorn@4497:             st->print(str_fmt(width_table[c]), "-");
acorn@4497:             break;
acorn@4497:           default:
acorn@4497:             {
acorn@4497:               double perc = (double)(100) * (double)(colsum_table[c]) / (double)sz_sum._total_bytes;
acorn@4497:               st->print(perc_fmt(width_table[c]), perc);
acorn@4497:             }
acorn@4497:           }
acorn@4497:         }
acorn@4497:       }
acorn@4497:     }
acorn@4497:   }
acorn@4497:   st->cr();
acorn@4497: 
acorn@4497:   if (!csv_format) {
acorn@4497:     print_title(st, csv_format, selected, width_table, name_table);
acorn@4497:   }
acorn@4497: }
acorn@4497: 
acorn@4497: julong KlassInfoHisto::annotations_bytes(Array<AnnotationArray*>* p) const {
acorn@4497:   julong bytes = 0;
acorn@4497:   if (p != NULL) {
acorn@4497:     for (int i = 0; i < p->length(); i++) {
acorn@4497:       bytes += count_bytes_array(p->at(i));
acorn@4497:     }
acorn@4497:     bytes += count_bytes_array(p);
acorn@4497:   }
acorn@4497:   return bytes;
acorn@4497: }
acorn@4497: 
acorn@4497: void KlassInfoHisto::print_histo_on(outputStream* st, bool print_stats,
acorn@4497:                                     bool csv_format, const char *columns) {
acorn@4497:   if (print_stats) {
acorn@4497:     print_class_stats(st, csv_format, columns);
acorn@4497:   } else {
acorn@4497:     st->print_cr("%s",title());
acorn@4497:     print_elements(st);
acorn@4497:   }
duke@435: }
duke@435: 
duke@435: class HistoClosure : public KlassInfoClosure {
duke@435:  private:
duke@435:   KlassInfoHisto* _cih;
duke@435:  public:
duke@435:   HistoClosure(KlassInfoHisto* cih) : _cih(cih) {}
duke@435: 
duke@435:   void do_cinfo(KlassInfoEntry* cie) {
duke@435:     _cih->add(cie);
duke@435:   }
duke@435: };
duke@435: 
duke@435: class RecordInstanceClosure : public ObjectClosure {
duke@435:  private:
duke@435:   KlassInfoTable* _cit;
ysr@446:   size_t _missed_count;
sla@5237:   BoolObjectClosure* _filter;
duke@435:  public:
sla@5237:   RecordInstanceClosure(KlassInfoTable* cit, BoolObjectClosure* filter) :
sla@5237:     _cit(cit), _missed_count(0), _filter(filter) {}
duke@435: 
duke@435:   void do_object(oop obj) {
sla@5237:     if (should_visit(obj)) {
sla@5237:       if (!_cit->record_instance(obj)) {
sla@5237:         _missed_count++;
sla@5237:       }
ysr@446:     }
duke@435:   }
ysr@446: 
ysr@446:   size_t missed_count() { return _missed_count; }
sla@5237: 
sla@5237:  private:
sla@5237:   bool should_visit(oop obj) {
sla@5237:     return _filter == NULL || _filter->do_object_b(obj);
sla@5237:   }
duke@435: };
duke@435: 
sla@5237: size_t HeapInspection::populate_table(KlassInfoTable* cit, BoolObjectClosure *filter) {
duke@435:   ResourceMark rm;
sla@5237: 
sla@5237:   RecordInstanceClosure ric(cit, filter);
sla@5237:   Universe::heap()->object_iterate(&ric);
sla@5237:   return ric.missed_count();
sla@5237: }
sla@5237: 
sla@5237: void HeapInspection::heap_inspection(outputStream* st) {
sla@5237:   ResourceMark rm;
coleenp@4037: 
acorn@4497:   if (_print_help) {
acorn@4497:     for (int c=0; c<KlassSizeStats::_num_columns; c++) {
acorn@4497:       st->print("%s:\n\t", name_table[c]);
acorn@4497:       const int max_col = 60;
acorn@4497:       int col = 0;
acorn@4497:       for (const char *p = help_table[c]; *p; p++,col++) {
acorn@4497:         if (col >= max_col && *p == ' ') {
acorn@4497:           st->print("\n\t");
acorn@4497:           col = 0;
acorn@4497:         } else {
acorn@4497:           st->print("%c", *p);
acorn@4497:         }
acorn@4497:       }
acorn@4497:       st->print_cr(".\n");
acorn@4497:     }
acorn@4497:     return;
acorn@4497:   }
acorn@4497: 
sla@5237:   KlassInfoTable cit(_print_class_stats);
ysr@446:   if (!cit.allocation_failed()) {
sla@5237:     size_t missed_count = populate_table(&cit);
ysr@446:     if (missed_count != 0) {
ysr@446:       st->print_cr("WARNING: Ran out of C-heap; undercounted " SIZE_FORMAT
ysr@446:                    " total instances in data below",
ysr@446:                    missed_count);
ysr@446:     }
sla@5237: 
ysr@446:     // Sort and print klass instance info
acorn@4497:     const char *title = "\n"
acorn@4497:               " num     #instances         #bytes  class name\n"
acorn@4497:               "----------------------------------------------";
sla@5237:     KlassInfoHisto histo(&cit, title);
ysr@446:     HistoClosure hc(&histo);
sla@5237: 
ysr@446:     cit.iterate(&hc);
sla@5237: 
ysr@446:     histo.sort();
acorn@4497:     histo.print_histo_on(st, _print_class_stats, _csv_format, _columns);
ysr@446:   } else {
ysr@446:     st->print_cr("WARNING: Ran out of C-heap; histogram not generated");
ysr@446:   }
duke@435:   st->flush();
duke@435: }
duke@435: 
duke@435: class FindInstanceClosure : public ObjectClosure {
duke@435:  private:
coleenp@4037:   Klass* _klass;
duke@435:   GrowableArray<oop>* _result;
duke@435: 
duke@435:  public:
coleenp@4037:   FindInstanceClosure(Klass* k, GrowableArray<oop>* result) : _klass(k), _result(result) {};
duke@435: 
duke@435:   void do_object(oop obj) {
duke@435:     if (obj->is_a(_klass)) {
duke@435:       _result->append(obj);
duke@435:     }
duke@435:   }
duke@435: };
duke@435: 
coleenp@4037: void HeapInspection::find_instances_at_safepoint(Klass* k, GrowableArray<oop>* result) {
duke@435:   assert(SafepointSynchronize::is_at_safepoint(), "all threads are stopped");
jcoomes@1844:   assert(Heap_lock->is_locked(), "should have the Heap_lock");
duke@435: 
duke@435:   // Ensure that the heap is parsable
duke@435:   Universe::heap()->ensure_parsability(false);  // no need to retire TALBs
duke@435: 
duke@435:   // Iterate over objects in the heap
duke@435:   FindInstanceClosure fic(k, result);
jmasa@952:   // If this operation encounters a bad object when using CMS,
coleenp@4037:   // consider using safe_object_iterate() which avoids metadata
jmasa@952:   // objects that may contain bad references.
duke@435:   Universe::heap()->object_iterate(&fic);
duke@435: }