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