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