1 /* 2 * Copyright (c) 1997, 2014, 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 */ 24 25 #include "precompiled.hpp" 26 #include "classfile/javaClasses.hpp" 27 #include "classfile/dictionary.hpp" 28 #include "classfile/systemDictionary.hpp" 29 #include "classfile/vmSymbols.hpp" 30 #include "gc_implementation/shared/markSweep.inline.hpp" 31 #include "gc_interface/collectedHeap.inline.hpp" 32 #include "memory/heapInspection.hpp" 33 #include "memory/metadataFactory.hpp" 34 #include "memory/oopFactory.hpp" 35 #include "memory/resourceArea.hpp" 36 #include "oops/instanceKlass.hpp" 37 #include "oops/klass.inline.hpp" 38 #include "oops/oop.inline2.hpp" 39 #include "runtime/atomic.inline.hpp" 40 #include "runtime/orderAccess.inline.hpp" 41 #include "trace/traceMacros.hpp" 42 #include "utilities/stack.hpp" 43 #include "utilities/macros.hpp" 44 #if INCLUDE_ALL_GCS 45 #include "gc_implementation/g1/g1SATBCardTableModRefBS.hpp" 46 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp" 47 #include "gc_implementation/parallelScavenge/psPromotionManager.hpp" 48 #include "gc_implementation/parallelScavenge/psScavenge.hpp" 49 #endif // INCLUDE_ALL_GCS 50 51 void Klass::set_name(Symbol* n) { 52 _name = n; 53 if (_name != NULL) _name->increment_refcount(); 54 } 55 56 bool Klass::is_subclass_of(const Klass* k) const { 57 // Run up the super chain and check 58 if (this == k) return true; 59 60 Klass* t = const_cast<Klass*>(this)->super(); 61 62 while (t != NULL) { 63 if (t == k) return true; 64 t = t->super(); 65 } 66 return false; 67 } 68 69 bool Klass::search_secondary_supers(Klass* k) const { 70 // Put some extra logic here out-of-line, before the search proper. 71 // This cuts down the size of the inline method. 72 73 // This is necessary, since I am never in my own secondary_super list. 74 if (this == k) 75 return true; 76 // Scan the array-of-objects for a match 77 int cnt = secondary_supers()->length(); 78 for (int i = 0; i < cnt; i++) { 79 if (secondary_supers()->at(i) == k) { 80 ((Klass*)this)->set_secondary_super_cache(k); 81 return true; 82 } 83 } 84 return false; 85 } 86 87 // Return self, except for abstract classes with exactly 1 88 // implementor. Then return the 1 concrete implementation. 89 Klass *Klass::up_cast_abstract() { 90 Klass *r = this; 91 while( r->is_abstract() ) { // Receiver is abstract? 92 Klass *s = r->subklass(); // Check for exactly 1 subklass 93 if( !s || s->next_sibling() ) // Oops; wrong count; give up 94 return this; // Return 'this' as a no-progress flag 95 r = s; // Loop till find concrete class 96 } 97 return r; // Return the 1 concrete class 98 } 99 100 // Find LCA in class hierarchy 101 Klass *Klass::LCA( Klass *k2 ) { 102 Klass *k1 = this; 103 while( 1 ) { 104 if( k1->is_subtype_of(k2) ) return k2; 105 if( k2->is_subtype_of(k1) ) return k1; 106 k1 = k1->super(); 107 k2 = k2->super(); 108 } 109 } 110 111 112 void Klass::check_valid_for_instantiation(bool throwError, TRAPS) { 113 ResourceMark rm(THREAD); 114 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError() 115 : vmSymbols::java_lang_InstantiationException(), external_name()); 116 } 117 118 119 void Klass::copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS) { 120 THROW(vmSymbols::java_lang_ArrayStoreException()); 121 } 122 123 124 void Klass::initialize(TRAPS) { 125 ShouldNotReachHere(); 126 } 127 128 bool Klass::compute_is_subtype_of(Klass* k) { 129 assert(k->is_klass(), "argument must be a class"); 130 return is_subclass_of(k); 131 } 132 133 134 Method* Klass::uncached_lookup_method(Symbol* name, Symbol* signature, MethodLookupMode mode) const { 135 #ifdef ASSERT 136 tty->print_cr("Error: uncached_lookup_method called on a klass oop." 137 " Likely error: reflection method does not correctly" 138 " wrap return value in a mirror object."); 139 #endif 140 ShouldNotReachHere(); 141 return NULL; 142 } 143 144 void* Klass::operator new(size_t size, ClassLoaderData* loader_data, size_t word_size, TRAPS) throw() { 145 return Metaspace::allocate(loader_data, word_size, /*read_only*/false, 146 MetaspaceObj::ClassType, CHECK_NULL); 147 } 148 149 Klass::Klass() { 150 Klass* k = this; 151 152 // Preinitialize supertype information. 153 // A later call to initialize_supers() may update these settings: 154 set_super(NULL); 155 for (juint i = 0; i < Klass::primary_super_limit(); i++) { 156 _primary_supers[i] = NULL; 157 } 158 set_secondary_supers(NULL); 159 set_secondary_super_cache(NULL); 160 _primary_supers[0] = k; 161 set_super_check_offset(in_bytes(primary_supers_offset())); 162 163 // The constructor is used from init_self_patching_vtbl_list, 164 // which doesn't zero out the memory before calling the constructor. 165 // Need to set the field explicitly to not hit an assert that the field 166 // should be NULL before setting it. 167 _java_mirror = NULL; 168 169 set_modifier_flags(0); 170 set_layout_helper(Klass::_lh_neutral_value); 171 set_name(NULL); 172 AccessFlags af; 173 af.set_flags(0); 174 set_access_flags(af); 175 set_subklass(NULL); 176 set_next_sibling(NULL); 177 set_next_link(NULL); 178 TRACE_INIT_ID(this); 179 180 set_prototype_header(markOopDesc::prototype()); 181 set_biased_lock_revocation_count(0); 182 set_last_biased_lock_bulk_revocation_time(0); 183 184 // The klass doesn't have any references at this point. 185 clear_modified_oops(); 186 clear_accumulated_modified_oops(); 187 _shared_class_path_index = -1; 188 } 189 190 jint Klass::array_layout_helper(BasicType etype) { 191 assert(etype >= T_BOOLEAN && etype <= T_OBJECT, "valid etype"); 192 // Note that T_ARRAY is not allowed here. 193 int hsize = arrayOopDesc::base_offset_in_bytes(etype); 194 int esize = type2aelembytes(etype); 195 bool isobj = (etype == T_OBJECT); 196 int tag = isobj ? _lh_array_tag_obj_value : _lh_array_tag_type_value; 197 int lh = array_layout_helper(tag, hsize, etype, exact_log2(esize)); 198 199 assert(lh < (int)_lh_neutral_value, "must look like an array layout"); 200 assert(layout_helper_is_array(lh), "correct kind"); 201 assert(layout_helper_is_objArray(lh) == isobj, "correct kind"); 202 assert(layout_helper_is_typeArray(lh) == !isobj, "correct kind"); 203 assert(layout_helper_header_size(lh) == hsize, "correct decode"); 204 assert(layout_helper_element_type(lh) == etype, "correct decode"); 205 assert(1 << layout_helper_log2_element_size(lh) == esize, "correct decode"); 206 207 return lh; 208 } 209 210 bool Klass::can_be_primary_super_slow() const { 211 if (super() == NULL) 212 return true; 213 else if (super()->super_depth() >= primary_super_limit()-1) 214 return false; 215 else 216 return true; 217 } 218 219 void Klass::initialize_supers(Klass* k, TRAPS) { 220 if (FastSuperclassLimit == 0) { 221 // None of the other machinery matters. 222 set_super(k); 223 return; 224 } 225 if (k == NULL) { 226 set_super(NULL); 227 _primary_supers[0] = this; 228 assert(super_depth() == 0, "Object must already be initialized properly"); 229 } else if (k != super() || k == SystemDictionary::Object_klass()) { 230 assert(super() == NULL || super() == SystemDictionary::Object_klass(), 231 "initialize this only once to a non-trivial value"); 232 set_super(k); 233 Klass* sup = k; 234 int sup_depth = sup->super_depth(); 235 juint my_depth = MIN2(sup_depth + 1, (int)primary_super_limit()); 236 if (!can_be_primary_super_slow()) 237 my_depth = primary_super_limit(); 238 for (juint i = 0; i < my_depth; i++) { 239 _primary_supers[i] = sup->_primary_supers[i]; 240 } 241 Klass* *super_check_cell; 242 if (my_depth < primary_super_limit()) { 243 _primary_supers[my_depth] = this; 244 super_check_cell = &_primary_supers[my_depth]; 245 } else { 246 // Overflow of the primary_supers array forces me to be secondary. 247 super_check_cell = &_secondary_super_cache; 248 } 249 set_super_check_offset((address)super_check_cell - (address) this); 250 251 #ifdef ASSERT 252 { 253 juint j = super_depth(); 254 assert(j == my_depth, "computed accessor gets right answer"); 255 Klass* t = this; 256 while (!t->can_be_primary_super()) { 257 t = t->super(); 258 j = t->super_depth(); 259 } 260 for (juint j1 = j+1; j1 < primary_super_limit(); j1++) { 261 assert(primary_super_of_depth(j1) == NULL, "super list padding"); 262 } 263 while (t != NULL) { 264 assert(primary_super_of_depth(j) == t, "super list initialization"); 265 t = t->super(); 266 --j; 267 } 268 assert(j == (juint)-1, "correct depth count"); 269 } 270 #endif 271 } 272 273 if (secondary_supers() == NULL) { 274 KlassHandle this_kh (THREAD, this); 275 276 // Now compute the list of secondary supertypes. 277 // Secondaries can occasionally be on the super chain, 278 // if the inline "_primary_supers" array overflows. 279 int extras = 0; 280 Klass* p; 281 for (p = super(); !(p == NULL || p->can_be_primary_super()); p = p->super()) { 282 ++extras; 283 } 284 285 ResourceMark rm(THREAD); // need to reclaim GrowableArrays allocated below 286 287 // Compute the "real" non-extra secondaries. 288 GrowableArray<Klass*>* secondaries = compute_secondary_supers(extras); 289 if (secondaries == NULL) { 290 // secondary_supers set by compute_secondary_supers 291 return; 292 } 293 294 GrowableArray<Klass*>* primaries = new GrowableArray<Klass*>(extras); 295 296 for (p = this_kh->super(); !(p == NULL || p->can_be_primary_super()); p = p->super()) { 297 int i; // Scan for overflow primaries being duplicates of 2nd'arys 298 299 // This happens frequently for very deeply nested arrays: the 300 // primary superclass chain overflows into the secondary. The 301 // secondary list contains the element_klass's secondaries with 302 // an extra array dimension added. If the element_klass's 303 // secondary list already contains some primary overflows, they 304 // (with the extra level of array-ness) will collide with the 305 // normal primary superclass overflows. 306 for( i = 0; i < secondaries->length(); i++ ) { 307 if( secondaries->at(i) == p ) 308 break; 309 } 310 if( i < secondaries->length() ) 311 continue; // It's a dup, don't put it in 312 primaries->push(p); 313 } 314 // Combine the two arrays into a metadata object to pack the array. 315 // The primaries are added in the reverse order, then the secondaries. 316 int new_length = primaries->length() + secondaries->length(); 317 Array<Klass*>* s2 = MetadataFactory::new_array<Klass*>( 318 class_loader_data(), new_length, CHECK); 319 int fill_p = primaries->length(); 320 for (int j = 0; j < fill_p; j++) { 321 s2->at_put(j, primaries->pop()); // add primaries in reverse order. 322 } 323 for( int j = 0; j < secondaries->length(); j++ ) { 324 s2->at_put(j+fill_p, secondaries->at(j)); // add secondaries on the end. 325 } 326 327 #ifdef ASSERT 328 // We must not copy any NULL placeholders left over from bootstrap. 329 for (int j = 0; j < s2->length(); j++) { 330 assert(s2->at(j) != NULL, "correct bootstrapping order"); 331 } 332 #endif 333 334 this_kh->set_secondary_supers(s2); 335 } 336 } 337 338 GrowableArray<Klass*>* Klass::compute_secondary_supers(int num_extra_slots) { 339 assert(num_extra_slots == 0, "override for complex klasses"); 340 set_secondary_supers(Universe::the_empty_klass_array()); 341 return NULL; 342 } 343 344 345 Klass* Klass::subklass() const { 346 return _subklass == NULL ? NULL : _subklass; 347 } 348 349 InstanceKlass* Klass::superklass() const { 350 assert(super() == NULL || super()->oop_is_instance(), "must be instance klass"); 351 return _super == NULL ? NULL : InstanceKlass::cast(_super); 352 } 353 354 Klass* Klass::next_sibling() const { 355 return _next_sibling == NULL ? NULL : _next_sibling; 356 } 357 358 void Klass::set_subklass(Klass* s) { 359 assert(s != this, "sanity check"); 360 _subklass = s; 361 } 362 363 void Klass::set_next_sibling(Klass* s) { 364 assert(s != this, "sanity check"); 365 _next_sibling = s; 366 } 367 368 void Klass::append_to_sibling_list() { 369 debug_only(verify();) 370 // add ourselves to superklass' subklass list 371 InstanceKlass* super = superklass(); 372 if (super == NULL) return; // special case: class Object 373 assert((!super->is_interface() // interfaces cannot be supers 374 && (super->superklass() == NULL || !is_interface())), 375 "an interface can only be a subklass of Object"); 376 Klass* prev_first_subklass = super->subklass_oop(); 377 if (prev_first_subklass != NULL) { 378 // set our sibling to be the superklass' previous first subklass 379 set_next_sibling(prev_first_subklass); 380 } 381 // make ourselves the superklass' first subklass 382 super->set_subklass(this); 383 debug_only(verify();) 384 } 385 386 bool Klass::is_loader_alive(BoolObjectClosure* is_alive) { 387 #ifdef ASSERT 388 // The class is alive iff the class loader is alive. 389 oop loader = class_loader(); 390 bool loader_alive = (loader == NULL) || is_alive->do_object_b(loader); 391 #endif // ASSERT 392 393 // The class is alive if it's mirror is alive (which should be marked if the 394 // loader is alive) unless it's an anoymous class. 395 bool mirror_alive = is_alive->do_object_b(java_mirror()); 396 assert(!mirror_alive || loader_alive, "loader must be alive if the mirror is" 397 " but not the other way around with anonymous classes"); 398 return mirror_alive; 399 } 400 401 void Klass::clean_weak_klass_links(BoolObjectClosure* is_alive, bool clean_alive_klasses) { 402 if (!ClassUnloading) { 403 return; 404 } 405 406 Klass* root = SystemDictionary::Object_klass(); 407 Stack<Klass*, mtGC> stack; 408 409 stack.push(root); 410 while (!stack.is_empty()) { 411 Klass* current = stack.pop(); 412 413 assert(current->is_loader_alive(is_alive), "just checking, this should be live"); 414 415 // Find and set the first alive subklass 416 Klass* sub = current->subklass_oop(); 417 while (sub != NULL && !sub->is_loader_alive(is_alive)) { 418 #ifndef PRODUCT 419 if (TraceClassUnloading && WizardMode) { 420 ResourceMark rm; 421 tty->print_cr("[Unlinking class (subclass) %s]", sub->external_name()); 422 } 423 #endif 424 sub = sub->next_sibling_oop(); 425 } 426 current->set_subklass(sub); 427 if (sub != NULL) { 428 stack.push(sub); 429 } 430 431 // Find and set the first alive sibling 432 Klass* sibling = current->next_sibling_oop(); 433 while (sibling != NULL && !sibling->is_loader_alive(is_alive)) { 434 if (TraceClassUnloading && WizardMode) { 435 ResourceMark rm; 436 tty->print_cr("[Unlinking class (sibling) %s]", sibling->external_name()); 437 } 438 sibling = sibling->next_sibling_oop(); 439 } 440 current->set_next_sibling(sibling); 441 if (sibling != NULL) { 442 stack.push(sibling); 443 } 444 445 // Clean the implementors list and method data. 446 if (clean_alive_klasses && current->oop_is_instance()) { 447 InstanceKlass* ik = InstanceKlass::cast(current); 448 ik->clean_implementors_list(is_alive); 449 ik->clean_method_data(is_alive); 450 } 451 } 452 } 453 454 void Klass::klass_update_barrier_set(oop v) { 455 record_modified_oops(); 456 } 457 458 // This barrier is used by G1 to remember the old oop values, so 459 // that we don't forget any objects that were live at the snapshot at 460 // the beginning. This function is only used when we write oops into Klasses. 461 void Klass::klass_update_barrier_set_pre(oop* p, oop v) { 462 #if INCLUDE_ALL_GCS 463 if (UseG1GC) { 464 oop obj = *p; 465 if (obj != NULL) { 466 G1SATBCardTableModRefBS::enqueue(obj); 467 } 468 } 469 #endif 470 } 471 472 void Klass::klass_oop_store(oop* p, oop v) { 473 assert(!Universe::heap()->is_in_reserved((void*)p), "Should store pointer into metadata"); 474 assert(v == NULL || Universe::heap()->is_in_reserved((void*)v), "Should store pointer to an object"); 475 476 // do the store 477 if (always_do_update_barrier) { 478 klass_oop_store((volatile oop*)p, v); 479 } else { 480 klass_update_barrier_set_pre(p, v); 481 *p = v; 482 klass_update_barrier_set(v); 483 } 484 } 485 486 void Klass::klass_oop_store(volatile oop* p, oop v) { 487 assert(!Universe::heap()->is_in_reserved((void*)p), "Should store pointer into metadata"); 488 assert(v == NULL || Universe::heap()->is_in_reserved((void*)v), "Should store pointer to an object"); 489 490 klass_update_barrier_set_pre((oop*)p, v); // Cast away volatile. 491 OrderAccess::release_store_ptr(p, v); 492 klass_update_barrier_set(v); 493 } 494 495 void Klass::oops_do(OopClosure* cl) { 496 cl->do_oop(&_java_mirror); 497 } 498 499 void Klass::remove_unshareable_info() { 500 assert (DumpSharedSpaces, "only called for DumpSharedSpaces"); 501 502 set_subklass(NULL); 503 set_next_sibling(NULL); 504 // Clear the java mirror 505 set_java_mirror(NULL); 506 set_next_link(NULL); 507 508 // Null out class_loader_data because we don't share that yet. 509 set_class_loader_data(NULL); 510 } 511 512 void Klass::restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS) { 513 TRACE_INIT_ID(this); 514 // If an exception happened during CDS restore, some of these fields may already be 515 // set. We leave the class on the CLD list, even if incomplete so that we don't 516 // modify the CLD list outside a safepoint. 517 if (class_loader_data() == NULL) { 518 // Restore class_loader_data 519 set_class_loader_data(loader_data); 520 521 // Add to class loader list first before creating the mirror 522 // (same order as class file parsing) 523 loader_data->add_class(this); 524 } 525 526 // Recreate the class mirror. 527 // Only recreate it if not present. A previous attempt to restore may have 528 // gotten an OOM later but keep the mirror if it was created. 529 if (java_mirror() == NULL) { 530 java_lang_Class::create_mirror(this, protection_domain, CHECK); 531 } 532 } 533 534 Klass* Klass::array_klass_or_null(int rank) { 535 EXCEPTION_MARK; 536 // No exception can be thrown by array_klass_impl when called with or_null == true. 537 // (In anycase, the execption mark will fail if it do so) 538 return array_klass_impl(true, rank, THREAD); 539 } 540 541 542 Klass* Klass::array_klass_or_null() { 543 EXCEPTION_MARK; 544 // No exception can be thrown by array_klass_impl when called with or_null == true. 545 // (In anycase, the execption mark will fail if it do so) 546 return array_klass_impl(true, THREAD); 547 } 548 549 550 Klass* Klass::array_klass_impl(bool or_null, int rank, TRAPS) { 551 fatal("array_klass should be dispatched to InstanceKlass, ObjArrayKlass or TypeArrayKlass"); 552 return NULL; 553 } 554 555 556 Klass* Klass::array_klass_impl(bool or_null, TRAPS) { 557 fatal("array_klass should be dispatched to InstanceKlass, ObjArrayKlass or TypeArrayKlass"); 558 return NULL; 559 } 560 561 oop Klass::class_loader() const { return class_loader_data()->class_loader(); } 562 563 const char* Klass::external_name() const { 564 if (oop_is_instance()) { 565 InstanceKlass* ik = (InstanceKlass*) this; 566 if (ik->is_anonymous()) { 567 assert(EnableInvokeDynamic, ""); 568 intptr_t hash = 0; 569 if (ik->java_mirror() != NULL) { 570 // java_mirror might not be created yet, return 0 as hash. 571 hash = ik->java_mirror()->identity_hash(); 572 } 573 char hash_buf[40]; 574 sprintf(hash_buf, "/" UINTX_FORMAT, (uintx)hash); 575 size_t hash_len = strlen(hash_buf); 576 577 size_t result_len = name()->utf8_length(); 578 char* result = NEW_RESOURCE_ARRAY(char, result_len + hash_len + 1); 579 name()->as_klass_external_name(result, (int) result_len + 1); 580 assert(strlen(result) == result_len, ""); 581 strcpy(result + result_len, hash_buf); 582 assert(strlen(result) == result_len + hash_len, ""); 583 return result; 584 } 585 } 586 if (name() == NULL) return "<unknown>"; 587 return name()->as_klass_external_name(); 588 } 589 590 591 const char* Klass::signature_name() const { 592 if (name() == NULL) return "<unknown>"; 593 return name()->as_C_string(); 594 } 595 596 // Unless overridden, modifier_flags is 0. 597 jint Klass::compute_modifier_flags(TRAPS) const { 598 return 0; 599 } 600 601 int Klass::atomic_incr_biased_lock_revocation_count() { 602 return (int) Atomic::add(1, &_biased_lock_revocation_count); 603 } 604 605 // Unless overridden, jvmti_class_status has no flags set. 606 jint Klass::jvmti_class_status() const { 607 return 0; 608 } 609 610 611 // Printing 612 613 void Klass::print_on(outputStream* st) const { 614 ResourceMark rm; 615 // print title 616 st->print("%s", internal_name()); 617 print_address_on(st); 618 st->cr(); 619 } 620 621 void Klass::oop_print_on(oop obj, outputStream* st) { 622 ResourceMark rm; 623 // print title 624 st->print_cr("%s ", internal_name()); 625 obj->print_address_on(st); 626 627 if (WizardMode) { 628 // print header 629 obj->mark()->print_on(st); 630 } 631 632 // print class 633 st->print(" - klass: "); 634 obj->klass()->print_value_on(st); 635 st->cr(); 636 } 637 638 void Klass::oop_print_value_on(oop obj, outputStream* st) { 639 // print title 640 ResourceMark rm; // Cannot print in debug mode without this 641 st->print("%s", internal_name()); 642 obj->print_address_on(st); 643 } 644 645 #if INCLUDE_SERVICES 646 // Size Statistics 647 void Klass::collect_statistics(KlassSizeStats *sz) const { 648 sz->_klass_bytes = sz->count(this); 649 sz->_mirror_bytes = sz->count(java_mirror()); 650 sz->_secondary_supers_bytes = sz->count_array(secondary_supers()); 651 652 sz->_ro_bytes += sz->_secondary_supers_bytes; 653 sz->_rw_bytes += sz->_klass_bytes + sz->_mirror_bytes; 654 } 655 #endif // INCLUDE_SERVICES 656 657 // Verification 658 659 void Klass::verify_on(outputStream* st) { 660 661 // This can be expensive, but it is worth checking that this klass is actually 662 // in the CLD graph but not in production. 663 assert(Metaspace::contains((address)this), "Should be"); 664 665 guarantee(this->is_klass(),"should be klass"); 666 667 if (super() != NULL) { 668 guarantee(super()->is_klass(), "should be klass"); 669 } 670 if (secondary_super_cache() != NULL) { 671 Klass* ko = secondary_super_cache(); 672 guarantee(ko->is_klass(), "should be klass"); 673 } 674 for ( uint i = 0; i < primary_super_limit(); i++ ) { 675 Klass* ko = _primary_supers[i]; 676 if (ko != NULL) { 677 guarantee(ko->is_klass(), "should be klass"); 678 } 679 } 680 681 if (java_mirror() != NULL) { 682 guarantee(java_mirror()->is_oop(), "should be instance"); 683 } 684 } 685 686 void Klass::oop_verify_on(oop obj, outputStream* st) { 687 guarantee(obj->is_oop(), "should be oop"); 688 guarantee(obj->klass()->is_klass(), "klass field is not a klass"); 689 } 690 691 #ifndef PRODUCT 692 693 bool Klass::verify_vtable_index(int i) { 694 if (oop_is_instance()) { 695 int limit = ((InstanceKlass*)this)->vtable_length()/vtableEntry::size(); 696 assert(i >= 0 && i < limit, err_msg("index %d out of bounds %d", i, limit)); 697 } else { 698 assert(oop_is_array(), "Must be"); 699 int limit = ((ArrayKlass*)this)->vtable_length()/vtableEntry::size(); 700 assert(i >= 0 && i < limit, err_msg("index %d out of bounds %d", i, limit)); 701 } 702 return true; 703 } 704 705 bool Klass::verify_itable_index(int i) { 706 assert(oop_is_instance(), ""); 707 int method_count = klassItable::method_count_for_interface(this); 708 assert(i >= 0 && i < method_count, "index out of bounds"); 709 return true; 710 } 711 712 #endif 713 714 /////////////// Unit tests /////////////// 715 716 #ifndef PRODUCT 717 718 class TestKlass { 719 public: 720 static void test_oop_is_instanceClassLoader() { 721 assert(SystemDictionary::ClassLoader_klass()->oop_is_instanceClassLoader(), "assert"); 722 assert(!SystemDictionary::String_klass()->oop_is_instanceClassLoader(), "assert"); 723 } 724 }; 725 726 void TestKlass_test() { 727 TestKlass::test_oop_is_instanceClassLoader(); 728 } 729 730 #endif