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