Mercurial > hg > truffle
annotate src/share/vm/memory/heapInspection.cpp @ 196:d1605aabd0a1 jdk7-b30
6719955: Update copyright year
Summary: Update copyright year for files that have been modified in 2008
Reviewed-by: ohair, tbell
| author | xdono |
|---|---|
| date | Wed, 02 Jul 2008 12:55:16 -0700 |
| parents | 3c1dbcaaab1d |
| children | 1ee8caae33af |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 196 | 2 * Copyright 2002-2008 Sun Microsystems, Inc. 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 * | |
| 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
| 20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
| 21 * have any questions. | |
| 22 * | |
| 23 */ | |
| 24 | |
| 25 # include "incls/_precompiled.incl" | |
| 26 # include "incls/_heapInspection.cpp.incl" | |
| 27 | |
| 28 // HeapInspection | |
| 29 | |
| 30 int KlassInfoEntry::compare(KlassInfoEntry* e1, KlassInfoEntry* e2) { | |
| 31 if(e1->_instance_words > e2->_instance_words) { | |
| 32 return -1; | |
| 33 } else if(e1->_instance_words < e2->_instance_words) { | |
| 34 return 1; | |
| 35 } | |
| 36 return 0; | |
| 37 } | |
| 38 | |
| 39 void KlassInfoEntry::print_on(outputStream* st) const { | |
| 40 ResourceMark rm; | |
| 41 const char* name;; | |
| 42 if (_klass->klass_part()->name() != NULL) { | |
| 43 name = _klass->klass_part()->external_name(); | |
| 44 } else { | |
| 45 if (_klass == Universe::klassKlassObj()) name = "<klassKlass>"; else | |
| 46 if (_klass == Universe::arrayKlassKlassObj()) name = "<arrayKlassKlass>"; else | |
| 47 if (_klass == Universe::objArrayKlassKlassObj()) name = "<objArrayKlassKlass>"; else | |
| 48 if (_klass == Universe::instanceKlassKlassObj()) name = "<instanceKlassKlass>"; else | |
| 49 if (_klass == Universe::typeArrayKlassKlassObj()) name = "<typeArrayKlassKlass>"; else | |
| 50 if (_klass == Universe::symbolKlassObj()) name = "<symbolKlass>"; else | |
| 51 if (_klass == Universe::boolArrayKlassObj()) name = "<boolArrayKlass>"; else | |
| 52 if (_klass == Universe::charArrayKlassObj()) name = "<charArrayKlass>"; else | |
| 53 if (_klass == Universe::singleArrayKlassObj()) name = "<singleArrayKlass>"; else | |
| 54 if (_klass == Universe::doubleArrayKlassObj()) name = "<doubleArrayKlass>"; else | |
| 55 if (_klass == Universe::byteArrayKlassObj()) name = "<byteArrayKlass>"; else | |
| 56 if (_klass == Universe::shortArrayKlassObj()) name = "<shortArrayKlass>"; else | |
| 57 if (_klass == Universe::intArrayKlassObj()) name = "<intArrayKlass>"; else | |
| 58 if (_klass == Universe::longArrayKlassObj()) name = "<longArrayKlass>"; else | |
| 59 if (_klass == Universe::methodKlassObj()) name = "<methodKlass>"; else | |
| 60 if (_klass == Universe::constMethodKlassObj()) name = "<constMethodKlass>"; else | |
| 61 if (_klass == Universe::methodDataKlassObj()) name = "<methodDataKlass>"; else | |
| 62 if (_klass == Universe::constantPoolKlassObj()) name = "<constantPoolKlass>"; else | |
| 63 if (_klass == Universe::constantPoolCacheKlassObj()) name = "<constantPoolCacheKlass>"; else | |
| 64 if (_klass == Universe::compiledICHolderKlassObj()) name = "<compiledICHolderKlass>"; else | |
| 65 name = "<no name>"; | |
| 66 } | |
| 67 // 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
|
68 st->print_cr(INT64_FORMAT_W(13) " " UINT64_FORMAT_W(13) " %s", |
| 0 | 69 (jlong) _instance_count, |
| 70 (julong) _instance_words * HeapWordSize, | |
| 71 name); | |
| 72 } | |
| 73 | |
| 74 KlassInfoEntry* KlassInfoBucket::lookup(const klassOop k) { | |
| 75 KlassInfoEntry* elt = _list; | |
| 76 while (elt != NULL) { | |
| 77 if (elt->is_equal(k)) { | |
| 78 return elt; | |
| 79 } | |
| 80 elt = elt->next(); | |
| 81 } | |
| 82 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
|
83 // 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
|
84 if (elt != NULL) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
85 set_list(elt); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
86 } |
| 0 | 87 return elt; |
| 88 } | |
| 89 | |
| 90 void KlassInfoBucket::iterate(KlassInfoClosure* cic) { | |
| 91 KlassInfoEntry* elt = _list; | |
| 92 while (elt != NULL) { | |
| 93 cic->do_cinfo(elt); | |
| 94 elt = elt->next(); | |
| 95 } | |
| 96 } | |
| 97 | |
| 98 void KlassInfoBucket::empty() { | |
| 99 KlassInfoEntry* elt = _list; | |
| 100 _list = NULL; | |
| 101 while (elt != NULL) { | |
| 102 KlassInfoEntry* next = elt->next(); | |
| 103 delete elt; | |
| 104 elt = next; | |
| 105 } | |
| 106 } | |
| 107 | |
| 108 KlassInfoTable::KlassInfoTable(int size, HeapWord* ref) { | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
109 _size = 0; |
| 0 | 110 _ref = ref; |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
111 _buckets = NEW_C_HEAP_ARRAY(KlassInfoBucket, size); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
112 if (_buckets != NULL) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
113 _size = size; |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
114 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
|
115 _buckets[index].initialize(); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
116 } |
| 0 | 117 } |
| 118 } | |
| 119 | |
| 120 KlassInfoTable::~KlassInfoTable() { | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
121 if (_buckets != NULL) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
122 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
|
123 _buckets[index].empty(); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
124 } |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
125 FREE_C_HEAP_ARRAY(KlassInfoBucket, _buckets); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
126 _size = 0; |
| 0 | 127 } |
| 128 } | |
| 129 | |
| 130 uint KlassInfoTable::hash(klassOop p) { | |
| 131 assert(Universe::heap()->is_in_permanent((HeapWord*)p), "all klasses in permgen"); | |
| 132 return (uint)(((uintptr_t)p - (uintptr_t)_ref) >> 2); | |
| 133 } | |
| 134 | |
| 135 KlassInfoEntry* KlassInfoTable::lookup(const klassOop k) { | |
| 136 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
|
137 assert(_buckets != NULL, "Allocation failure should have been caught"); |
| 0 | 138 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
|
139 // 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
|
140 // 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
|
141 assert(e == NULL || k == e->klass(), "must be equal"); |
| 0 | 142 return e; |
| 143 } | |
| 144 | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
145 // 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
|
146 // 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
|
147 bool KlassInfoTable::record_instance(const oop obj) { |
| 0 | 148 klassOop k = obj->klass(); |
| 149 KlassInfoEntry* elt = lookup(k); | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
150 // 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
|
151 // 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
|
152 if (elt != NULL) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
153 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
|
154 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
|
155 return true; |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
156 } else { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
157 return false; |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
158 } |
| 0 | 159 } |
| 160 | |
| 161 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
|
162 assert(_size == 0 || _buckets != NULL, "Allocation failure should have been caught"); |
| 0 | 163 for (int index = 0; index < _size; index++) { |
| 164 _buckets[index].iterate(cic); | |
| 165 } | |
| 166 } | |
| 167 | |
| 168 int KlassInfoHisto::sort_helper(KlassInfoEntry** e1, KlassInfoEntry** e2) { | |
| 169 return (*e1)->compare(*e1,*e2); | |
| 170 } | |
| 171 | |
| 172 KlassInfoHisto::KlassInfoHisto(const char* title, int estimatedCount) : | |
| 173 _title(title) { | |
| 174 _elements = new (ResourceObj::C_HEAP) GrowableArray<KlassInfoEntry*>(estimatedCount,true); | |
| 175 } | |
| 176 | |
| 177 KlassInfoHisto::~KlassInfoHisto() { | |
| 178 delete _elements; | |
| 179 } | |
| 180 | |
| 181 void KlassInfoHisto::add(KlassInfoEntry* cie) { | |
| 182 elements()->append(cie); | |
| 183 } | |
| 184 | |
| 185 void KlassInfoHisto::sort() { | |
| 186 elements()->sort(KlassInfoHisto::sort_helper); | |
| 187 } | |
| 188 | |
| 189 void KlassInfoHisto::print_elements(outputStream* st) const { | |
| 190 // simplify the formatting (ILP32 vs LP64) - store the sum in 64-bit | |
| 191 jlong total = 0; | |
| 192 julong totalw = 0; | |
| 193 for(int i=0; i < elements()->length(); i++) { | |
| 194 st->print("%4d: ", i+1); | |
| 195 elements()->at(i)->print_on(st); | |
| 196 total += elements()->at(i)->count(); | |
| 197 totalw += elements()->at(i)->words(); | |
| 198 } | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
199 st->print_cr("Total " INT64_FORMAT_W(13) " " UINT64_FORMAT_W(13), |
| 0 | 200 total, totalw * HeapWordSize); |
| 201 } | |
| 202 | |
| 203 void KlassInfoHisto::print_on(outputStream* st) const { | |
| 204 st->print_cr("%s",title()); | |
| 205 print_elements(st); | |
| 206 } | |
| 207 | |
| 208 class HistoClosure : public KlassInfoClosure { | |
| 209 private: | |
| 210 KlassInfoHisto* _cih; | |
| 211 public: | |
| 212 HistoClosure(KlassInfoHisto* cih) : _cih(cih) {} | |
| 213 | |
| 214 void do_cinfo(KlassInfoEntry* cie) { | |
| 215 _cih->add(cie); | |
| 216 } | |
| 217 }; | |
| 218 | |
| 219 class RecordInstanceClosure : public ObjectClosure { | |
| 220 private: | |
| 221 KlassInfoTable* _cit; | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
222 size_t _missed_count; |
| 0 | 223 public: |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
224 RecordInstanceClosure(KlassInfoTable* cit) : |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
225 _cit(cit), _missed_count(0) {} |
| 0 | 226 |
| 227 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
|
228 if (!_cit->record_instance(obj)) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
229 _missed_count++; |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
230 } |
| 0 | 231 } |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
232 |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
233 size_t missed_count() { return _missed_count; } |
| 0 | 234 }; |
| 235 | |
| 236 void HeapInspection::heap_inspection(outputStream* st) { | |
| 237 ResourceMark rm; | |
| 238 HeapWord* ref; | |
| 239 | |
| 240 CollectedHeap* heap = Universe::heap(); | |
| 241 switch (heap->kind()) { | |
| 242 case CollectedHeap::GenCollectedHeap: { | |
| 243 GenCollectedHeap* gch = (GenCollectedHeap*)heap; | |
| 244 gch->gc_prologue(false /* !full */); // get any necessary locks | |
| 245 ref = gch->perm_gen()->used_region().start(); | |
| 246 break; | |
| 247 } | |
| 248 #ifndef SERIALGC | |
| 249 case CollectedHeap::ParallelScavengeHeap: { | |
| 250 ParallelScavengeHeap* psh = (ParallelScavengeHeap*)heap; | |
| 251 ref = psh->perm_gen()->object_space()->used_region().start(); | |
| 252 break; | |
| 253 } | |
| 254 #endif // SERIALGC | |
| 255 default: | |
| 256 ShouldNotReachHere(); // Unexpected heap kind for this op | |
| 257 } | |
| 258 // Collect klass instance info | |
| 259 KlassInfoTable cit(KlassInfoTable::cit_size, ref); | |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
260 if (!cit.allocation_failed()) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
261 // 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
|
262 RecordInstanceClosure ric(&cit); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
263 Universe::heap()->object_iterate(&ric); |
| 0 | 264 |
|
11
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
265 // 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
|
266 // 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
|
267 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
|
268 if (missed_count != 0) { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
269 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
|
270 " total instances in data below", |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
271 missed_count); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
272 } |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
273 // Sort and print klass instance info |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
274 KlassInfoHisto histo("\n" |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
275 " num #instances #bytes class name\n" |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
276 "----------------------------------------------", |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
277 KlassInfoHisto::histo_initial_size); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
278 HistoClosure hc(&histo); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
279 cit.iterate(&hc); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
280 histo.sort(); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
281 histo.print_on(st); |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
282 } else { |
|
3c1dbcaaab1d
6621728: Heap inspection should not crash in the face of C-heap exhaustion
ysr
parents:
0
diff
changeset
|
283 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
|
284 } |
| 0 | 285 st->flush(); |
| 286 | |
| 287 if (Universe::heap()->kind() == CollectedHeap::GenCollectedHeap) { | |
| 288 GenCollectedHeap* gch = GenCollectedHeap::heap(); | |
| 289 gch->gc_epilogue(false /* !full */); // release all acquired locks | |
| 290 } | |
| 291 } | |
| 292 | |
| 293 class FindInstanceClosure : public ObjectClosure { | |
| 294 private: | |
| 295 klassOop _klass; | |
| 296 GrowableArray<oop>* _result; | |
| 297 | |
| 298 public: | |
| 299 FindInstanceClosure(klassOop k, GrowableArray<oop>* result) : _klass(k), _result(result) {}; | |
| 300 | |
| 301 void do_object(oop obj) { | |
| 302 if (obj->is_a(_klass)) { | |
| 303 _result->append(obj); | |
| 304 } | |
| 305 } | |
| 306 }; | |
| 307 | |
| 308 void HeapInspection::find_instances_at_safepoint(klassOop k, GrowableArray<oop>* result) { | |
| 309 assert(SafepointSynchronize::is_at_safepoint(), "all threads are stopped"); | |
| 310 assert(Heap_lock->is_locked(), "should have the Heap_lock") | |
| 311 | |
| 312 // Ensure that the heap is parsable | |
| 313 Universe::heap()->ensure_parsability(false); // no need to retire TALBs | |
| 314 | |
| 315 // Iterate over objects in the heap | |
| 316 FindInstanceClosure fic(k, result); | |
| 317 Universe::heap()->object_iterate(&fic); | |
| 318 } |