Tue, 11 May 2010 14:35:43 -0700
6931180: Migration to recent versions of MS Platform SDK
6951582: Build problems on win64
Summary: Changes to enable building JDK7 with Microsoft Visual Studio 2010
Reviewed-by: ohair, art, ccheung, dcubed
duke@435 | 1 | /* |
xdono@1014 | 2 | * Copyright 2002-2009 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | # include "incls/_precompiled.incl" |
duke@435 | 26 | # include "incls/_heapInspection.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | // HeapInspection |
duke@435 | 29 | |
duke@435 | 30 | int KlassInfoEntry::compare(KlassInfoEntry* e1, KlassInfoEntry* e2) { |
duke@435 | 31 | if(e1->_instance_words > e2->_instance_words) { |
duke@435 | 32 | return -1; |
duke@435 | 33 | } else if(e1->_instance_words < e2->_instance_words) { |
duke@435 | 34 | return 1; |
duke@435 | 35 | } |
duke@435 | 36 | return 0; |
duke@435 | 37 | } |
duke@435 | 38 | |
duke@435 | 39 | void KlassInfoEntry::print_on(outputStream* st) const { |
duke@435 | 40 | ResourceMark rm; |
duke@435 | 41 | const char* name;; |
duke@435 | 42 | if (_klass->klass_part()->name() != NULL) { |
duke@435 | 43 | name = _klass->klass_part()->external_name(); |
duke@435 | 44 | } else { |
duke@435 | 45 | if (_klass == Universe::klassKlassObj()) name = "<klassKlass>"; else |
duke@435 | 46 | if (_klass == Universe::arrayKlassKlassObj()) name = "<arrayKlassKlass>"; else |
duke@435 | 47 | if (_klass == Universe::objArrayKlassKlassObj()) name = "<objArrayKlassKlass>"; else |
duke@435 | 48 | if (_klass == Universe::instanceKlassKlassObj()) name = "<instanceKlassKlass>"; else |
duke@435 | 49 | if (_klass == Universe::typeArrayKlassKlassObj()) name = "<typeArrayKlassKlass>"; else |
duke@435 | 50 | if (_klass == Universe::symbolKlassObj()) name = "<symbolKlass>"; else |
duke@435 | 51 | if (_klass == Universe::boolArrayKlassObj()) name = "<boolArrayKlass>"; else |
duke@435 | 52 | if (_klass == Universe::charArrayKlassObj()) name = "<charArrayKlass>"; else |
duke@435 | 53 | if (_klass == Universe::singleArrayKlassObj()) name = "<singleArrayKlass>"; else |
duke@435 | 54 | if (_klass == Universe::doubleArrayKlassObj()) name = "<doubleArrayKlass>"; else |
duke@435 | 55 | if (_klass == Universe::byteArrayKlassObj()) name = "<byteArrayKlass>"; else |
duke@435 | 56 | if (_klass == Universe::shortArrayKlassObj()) name = "<shortArrayKlass>"; else |
duke@435 | 57 | if (_klass == Universe::intArrayKlassObj()) name = "<intArrayKlass>"; else |
duke@435 | 58 | if (_klass == Universe::longArrayKlassObj()) name = "<longArrayKlass>"; else |
duke@435 | 59 | if (_klass == Universe::methodKlassObj()) name = "<methodKlass>"; else |
duke@435 | 60 | if (_klass == Universe::constMethodKlassObj()) name = "<constMethodKlass>"; else |
duke@435 | 61 | if (_klass == Universe::methodDataKlassObj()) name = "<methodDataKlass>"; else |
duke@435 | 62 | if (_klass == Universe::constantPoolKlassObj()) name = "<constantPoolKlass>"; else |
duke@435 | 63 | if (_klass == Universe::constantPoolCacheKlassObj()) name = "<constantPoolCacheKlass>"; else |
duke@435 | 64 | if (_klass == Universe::compiledICHolderKlassObj()) name = "<compiledICHolderKlass>"; else |
duke@435 | 65 | name = "<no name>"; |
duke@435 | 66 | } |
duke@435 | 67 | // simplify the formatting (ILP32 vs LP64) - always cast the numbers to 64-bit |
ysr@446 | 68 | st->print_cr(INT64_FORMAT_W(13) " " UINT64_FORMAT_W(13) " %s", |
duke@435 | 69 | (jlong) _instance_count, |
duke@435 | 70 | (julong) _instance_words * HeapWordSize, |
duke@435 | 71 | name); |
duke@435 | 72 | } |
duke@435 | 73 | |
duke@435 | 74 | KlassInfoEntry* KlassInfoBucket::lookup(const klassOop k) { |
duke@435 | 75 | KlassInfoEntry* elt = _list; |
duke@435 | 76 | while (elt != NULL) { |
duke@435 | 77 | if (elt->is_equal(k)) { |
duke@435 | 78 | return elt; |
duke@435 | 79 | } |
duke@435 | 80 | elt = elt->next(); |
duke@435 | 81 | } |
duke@435 | 82 | elt = new KlassInfoEntry(k, list()); |
ysr@446 | 83 | // We may be out of space to allocate the new entry. |
ysr@446 | 84 | if (elt != NULL) { |
ysr@446 | 85 | set_list(elt); |
ysr@446 | 86 | } |
duke@435 | 87 | return elt; |
duke@435 | 88 | } |
duke@435 | 89 | |
duke@435 | 90 | void KlassInfoBucket::iterate(KlassInfoClosure* cic) { |
duke@435 | 91 | KlassInfoEntry* elt = _list; |
duke@435 | 92 | while (elt != NULL) { |
duke@435 | 93 | cic->do_cinfo(elt); |
duke@435 | 94 | elt = elt->next(); |
duke@435 | 95 | } |
duke@435 | 96 | } |
duke@435 | 97 | |
duke@435 | 98 | void KlassInfoBucket::empty() { |
duke@435 | 99 | KlassInfoEntry* elt = _list; |
duke@435 | 100 | _list = NULL; |
duke@435 | 101 | while (elt != NULL) { |
duke@435 | 102 | KlassInfoEntry* next = elt->next(); |
duke@435 | 103 | delete elt; |
duke@435 | 104 | elt = next; |
duke@435 | 105 | } |
duke@435 | 106 | } |
duke@435 | 107 | |
duke@435 | 108 | KlassInfoTable::KlassInfoTable(int size, HeapWord* ref) { |
ysr@446 | 109 | _size = 0; |
duke@435 | 110 | _ref = ref; |
ysr@446 | 111 | _buckets = NEW_C_HEAP_ARRAY(KlassInfoBucket, size); |
ysr@446 | 112 | if (_buckets != NULL) { |
ysr@446 | 113 | _size = size; |
ysr@446 | 114 | for (int index = 0; index < _size; index++) { |
ysr@446 | 115 | _buckets[index].initialize(); |
ysr@446 | 116 | } |
duke@435 | 117 | } |
duke@435 | 118 | } |
duke@435 | 119 | |
duke@435 | 120 | KlassInfoTable::~KlassInfoTable() { |
ysr@446 | 121 | if (_buckets != NULL) { |
ysr@446 | 122 | for (int index = 0; index < _size; index++) { |
ysr@446 | 123 | _buckets[index].empty(); |
ysr@446 | 124 | } |
ysr@446 | 125 | FREE_C_HEAP_ARRAY(KlassInfoBucket, _buckets); |
ysr@446 | 126 | _size = 0; |
duke@435 | 127 | } |
duke@435 | 128 | } |
duke@435 | 129 | |
duke@435 | 130 | uint KlassInfoTable::hash(klassOop p) { |
duke@435 | 131 | assert(Universe::heap()->is_in_permanent((HeapWord*)p), "all klasses in permgen"); |
duke@435 | 132 | return (uint)(((uintptr_t)p - (uintptr_t)_ref) >> 2); |
duke@435 | 133 | } |
duke@435 | 134 | |
duke@435 | 135 | KlassInfoEntry* KlassInfoTable::lookup(const klassOop k) { |
duke@435 | 136 | uint idx = hash(k) % _size; |
ysr@446 | 137 | assert(_buckets != NULL, "Allocation failure should have been caught"); |
duke@435 | 138 | KlassInfoEntry* e = _buckets[idx].lookup(k); |
ysr@446 | 139 | // Lookup may fail if this is a new klass for which we |
ysr@446 | 140 | // could not allocate space for an new entry. |
ysr@446 | 141 | assert(e == NULL || k == e->klass(), "must be equal"); |
duke@435 | 142 | return e; |
duke@435 | 143 | } |
duke@435 | 144 | |
ysr@446 | 145 | // Return false if the entry could not be recorded on account |
ysr@446 | 146 | // of running out of space required to create a new entry. |
ysr@446 | 147 | bool KlassInfoTable::record_instance(const oop obj) { |
duke@435 | 148 | klassOop k = obj->klass(); |
duke@435 | 149 | KlassInfoEntry* elt = lookup(k); |
ysr@446 | 150 | // elt may be NULL if it's a new klass for which we |
ysr@446 | 151 | // could not allocate space for a new entry in the hashtable. |
ysr@446 | 152 | if (elt != NULL) { |
ysr@446 | 153 | elt->set_count(elt->count() + 1); |
ysr@446 | 154 | elt->set_words(elt->words() + obj->size()); |
ysr@446 | 155 | return true; |
ysr@446 | 156 | } else { |
ysr@446 | 157 | return false; |
ysr@446 | 158 | } |
duke@435 | 159 | } |
duke@435 | 160 | |
duke@435 | 161 | void KlassInfoTable::iterate(KlassInfoClosure* cic) { |
ysr@446 | 162 | assert(_size == 0 || _buckets != NULL, "Allocation failure should have been caught"); |
duke@435 | 163 | for (int index = 0; index < _size; index++) { |
duke@435 | 164 | _buckets[index].iterate(cic); |
duke@435 | 165 | } |
duke@435 | 166 | } |
duke@435 | 167 | |
duke@435 | 168 | int KlassInfoHisto::sort_helper(KlassInfoEntry** e1, KlassInfoEntry** e2) { |
duke@435 | 169 | return (*e1)->compare(*e1,*e2); |
duke@435 | 170 | } |
duke@435 | 171 | |
duke@435 | 172 | KlassInfoHisto::KlassInfoHisto(const char* title, int estimatedCount) : |
duke@435 | 173 | _title(title) { |
duke@435 | 174 | _elements = new (ResourceObj::C_HEAP) GrowableArray<KlassInfoEntry*>(estimatedCount,true); |
duke@435 | 175 | } |
duke@435 | 176 | |
duke@435 | 177 | KlassInfoHisto::~KlassInfoHisto() { |
duke@435 | 178 | delete _elements; |
duke@435 | 179 | } |
duke@435 | 180 | |
duke@435 | 181 | void KlassInfoHisto::add(KlassInfoEntry* cie) { |
duke@435 | 182 | elements()->append(cie); |
duke@435 | 183 | } |
duke@435 | 184 | |
duke@435 | 185 | void KlassInfoHisto::sort() { |
duke@435 | 186 | elements()->sort(KlassInfoHisto::sort_helper); |
duke@435 | 187 | } |
duke@435 | 188 | |
duke@435 | 189 | void KlassInfoHisto::print_elements(outputStream* st) const { |
duke@435 | 190 | // simplify the formatting (ILP32 vs LP64) - store the sum in 64-bit |
duke@435 | 191 | jlong total = 0; |
duke@435 | 192 | julong totalw = 0; |
duke@435 | 193 | for(int i=0; i < elements()->length(); i++) { |
duke@435 | 194 | st->print("%4d: ", i+1); |
duke@435 | 195 | elements()->at(i)->print_on(st); |
duke@435 | 196 | total += elements()->at(i)->count(); |
duke@435 | 197 | totalw += elements()->at(i)->words(); |
duke@435 | 198 | } |
ysr@446 | 199 | st->print_cr("Total " INT64_FORMAT_W(13) " " UINT64_FORMAT_W(13), |
duke@435 | 200 | total, totalw * HeapWordSize); |
duke@435 | 201 | } |
duke@435 | 202 | |
duke@435 | 203 | void KlassInfoHisto::print_on(outputStream* st) const { |
duke@435 | 204 | st->print_cr("%s",title()); |
duke@435 | 205 | print_elements(st); |
duke@435 | 206 | } |
duke@435 | 207 | |
duke@435 | 208 | class HistoClosure : public KlassInfoClosure { |
duke@435 | 209 | private: |
duke@435 | 210 | KlassInfoHisto* _cih; |
duke@435 | 211 | public: |
duke@435 | 212 | HistoClosure(KlassInfoHisto* cih) : _cih(cih) {} |
duke@435 | 213 | |
duke@435 | 214 | void do_cinfo(KlassInfoEntry* cie) { |
duke@435 | 215 | _cih->add(cie); |
duke@435 | 216 | } |
duke@435 | 217 | }; |
duke@435 | 218 | |
duke@435 | 219 | class RecordInstanceClosure : public ObjectClosure { |
duke@435 | 220 | private: |
duke@435 | 221 | KlassInfoTable* _cit; |
ysr@446 | 222 | size_t _missed_count; |
duke@435 | 223 | public: |
ysr@446 | 224 | RecordInstanceClosure(KlassInfoTable* cit) : |
ysr@446 | 225 | _cit(cit), _missed_count(0) {} |
duke@435 | 226 | |
duke@435 | 227 | void do_object(oop obj) { |
ysr@446 | 228 | if (!_cit->record_instance(obj)) { |
ysr@446 | 229 | _missed_count++; |
ysr@446 | 230 | } |
duke@435 | 231 | } |
ysr@446 | 232 | |
ysr@446 | 233 | size_t missed_count() { return _missed_count; } |
duke@435 | 234 | }; |
duke@435 | 235 | |
ysr@1050 | 236 | void HeapInspection::heap_inspection(outputStream* st, bool need_prologue) { |
duke@435 | 237 | ResourceMark rm; |
duke@435 | 238 | HeapWord* ref; |
duke@435 | 239 | |
duke@435 | 240 | CollectedHeap* heap = Universe::heap(); |
ysr@777 | 241 | bool is_shared_heap = false; |
duke@435 | 242 | switch (heap->kind()) { |
ysr@777 | 243 | case CollectedHeap::G1CollectedHeap: |
duke@435 | 244 | case CollectedHeap::GenCollectedHeap: { |
ysr@777 | 245 | is_shared_heap = true; |
ysr@777 | 246 | SharedHeap* sh = (SharedHeap*)heap; |
ysr@1050 | 247 | if (need_prologue) { |
ysr@1050 | 248 | sh->gc_prologue(false /* !full */); // get any necessary locks, etc. |
ysr@1050 | 249 | } |
ysr@777 | 250 | ref = sh->perm_gen()->used_region().start(); |
duke@435 | 251 | break; |
duke@435 | 252 | } |
duke@435 | 253 | #ifndef SERIALGC |
duke@435 | 254 | case CollectedHeap::ParallelScavengeHeap: { |
duke@435 | 255 | ParallelScavengeHeap* psh = (ParallelScavengeHeap*)heap; |
duke@435 | 256 | ref = psh->perm_gen()->object_space()->used_region().start(); |
duke@435 | 257 | break; |
duke@435 | 258 | } |
duke@435 | 259 | #endif // SERIALGC |
duke@435 | 260 | default: |
duke@435 | 261 | ShouldNotReachHere(); // Unexpected heap kind for this op |
duke@435 | 262 | } |
duke@435 | 263 | // Collect klass instance info |
ysr@446 | 264 | KlassInfoTable cit(KlassInfoTable::cit_size, ref); |
ysr@446 | 265 | if (!cit.allocation_failed()) { |
ysr@446 | 266 | // Iterate over objects in the heap |
ysr@446 | 267 | RecordInstanceClosure ric(&cit); |
jmasa@952 | 268 | // If this operation encounters a bad object when using CMS, |
jmasa@952 | 269 | // consider using safe_object_iterate() which avoids perm gen |
jmasa@952 | 270 | // objects that may contain bad references. |
ysr@446 | 271 | Universe::heap()->object_iterate(&ric); |
duke@435 | 272 | |
ysr@446 | 273 | // Report if certain classes are not counted because of |
ysr@446 | 274 | // running out of C-heap for the histogram. |
ysr@446 | 275 | size_t missed_count = ric.missed_count(); |
ysr@446 | 276 | if (missed_count != 0) { |
ysr@446 | 277 | st->print_cr("WARNING: Ran out of C-heap; undercounted " SIZE_FORMAT |
ysr@446 | 278 | " total instances in data below", |
ysr@446 | 279 | missed_count); |
ysr@446 | 280 | } |
ysr@446 | 281 | // Sort and print klass instance info |
ysr@446 | 282 | KlassInfoHisto histo("\n" |
ysr@446 | 283 | " num #instances #bytes class name\n" |
ysr@446 | 284 | "----------------------------------------------", |
ysr@446 | 285 | KlassInfoHisto::histo_initial_size); |
ysr@446 | 286 | HistoClosure hc(&histo); |
ysr@446 | 287 | cit.iterate(&hc); |
ysr@446 | 288 | histo.sort(); |
ysr@446 | 289 | histo.print_on(st); |
ysr@446 | 290 | } else { |
ysr@446 | 291 | st->print_cr("WARNING: Ran out of C-heap; histogram not generated"); |
ysr@446 | 292 | } |
duke@435 | 293 | st->flush(); |
duke@435 | 294 | |
ysr@1050 | 295 | if (need_prologue && is_shared_heap) { |
ysr@777 | 296 | SharedHeap* sh = (SharedHeap*)heap; |
ysr@777 | 297 | sh->gc_epilogue(false /* !full */); // release all acquired locks, etc. |
duke@435 | 298 | } |
duke@435 | 299 | } |
duke@435 | 300 | |
duke@435 | 301 | class FindInstanceClosure : public ObjectClosure { |
duke@435 | 302 | private: |
duke@435 | 303 | klassOop _klass; |
duke@435 | 304 | GrowableArray<oop>* _result; |
duke@435 | 305 | |
duke@435 | 306 | public: |
duke@435 | 307 | FindInstanceClosure(klassOop k, GrowableArray<oop>* result) : _klass(k), _result(result) {}; |
duke@435 | 308 | |
duke@435 | 309 | void do_object(oop obj) { |
duke@435 | 310 | if (obj->is_a(_klass)) { |
duke@435 | 311 | _result->append(obj); |
duke@435 | 312 | } |
duke@435 | 313 | } |
duke@435 | 314 | }; |
duke@435 | 315 | |
duke@435 | 316 | void HeapInspection::find_instances_at_safepoint(klassOop k, GrowableArray<oop>* result) { |
duke@435 | 317 | assert(SafepointSynchronize::is_at_safepoint(), "all threads are stopped"); |
duke@435 | 318 | assert(Heap_lock->is_locked(), "should have the Heap_lock") |
duke@435 | 319 | |
duke@435 | 320 | // Ensure that the heap is parsable |
duke@435 | 321 | Universe::heap()->ensure_parsability(false); // no need to retire TALBs |
duke@435 | 322 | |
duke@435 | 323 | // Iterate over objects in the heap |
duke@435 | 324 | FindInstanceClosure fic(k, result); |
jmasa@952 | 325 | // If this operation encounters a bad object when using CMS, |
jmasa@952 | 326 | // consider using safe_object_iterate() which avoids perm gen |
jmasa@952 | 327 | // objects that may contain bad references. |
duke@435 | 328 | Universe::heap()->object_iterate(&fic); |
duke@435 | 329 | } |