1 /* 2 * Copyright (c) 1997, 2018, 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/classLoaderData.inline.hpp" 27 #include "classfile/dictionary.hpp" 28 #include "classfile/javaClasses.hpp" 29 #include "classfile/systemDictionary.hpp" 30 #include "classfile/vmSymbols.hpp" 31 #include "gc/shared/collectedHeap.inline.hpp" 32 #include "logging/log.hpp" 33 #include "memory/heapInspection.hpp" 34 #include "memory/metadataFactory.hpp" 35 #include "memory/metaspaceClosure.hpp" 36 #include "memory/metaspaceShared.hpp" 37 #include "memory/oopFactory.hpp" 38 #include "memory/resourceArea.hpp" 39 #include "oops/compressedOops.inline.hpp" 40 #include "oops/instanceKlass.hpp" 41 #include "oops/klass.inline.hpp" 42 #include "oops/oop.inline.hpp" 43 #include "oops/oopHandle.inline.hpp" 44 #include "runtime/atomic.hpp" 45 #include "runtime/handles.inline.hpp" 46 #include "runtime/orderAccess.hpp" 47 #include "utilities/macros.hpp" 48 #include "utilities/stack.inline.hpp" 49 50 void Klass::set_java_mirror(Handle m) { 51 assert(!m.is_null(), "New mirror should never be null."); 52 assert(_java_mirror.resolve() == NULL, "should only be used to initialize mirror"); 53 _java_mirror = class_loader_data()->add_handle(m); 54 } 55 56 oop Klass::java_mirror() const { 57 return _java_mirror.resolve(); 58 } 59 60 bool Klass::is_cloneable() const { 61 return _access_flags.is_cloneable_fast() || 62 is_subtype_of(SystemDictionary::Cloneable_klass()); 63 } 64 65 void Klass::set_is_cloneable() { 66 if (name() == vmSymbols::java_lang_invoke_MemberName()) { 67 assert(is_final(), "no subclasses allowed"); 68 // MemberName cloning should not be intrinsified and always happen in JVM_Clone. 69 } else if (is_instance_klass() && InstanceKlass::cast(this)->reference_type() != REF_NONE) { 70 // Reference cloning should not be intrinsified and always happen in JVM_Clone. 71 } else { 72 _access_flags.set_is_cloneable_fast(); 73 } 74 } 75 76 void Klass::set_name(Symbol* n) { 77 _name = n; 78 if (_name != NULL) _name->increment_refcount(); 79 } 80 81 bool Klass::is_subclass_of(const Klass* k) const { 82 // Run up the super chain and check 83 if (this == k) return true; 84 85 Klass* t = const_cast<Klass*>(this)->super(); 86 87 while (t != NULL) { 88 if (t == k) return true; 89 t = t->super(); 90 } 91 return false; 92 } 93 94 bool Klass::search_secondary_supers(Klass* k) const { 95 // Put some extra logic here out-of-line, before the search proper. 96 // This cuts down the size of the inline method. 97 98 // This is necessary, since I am never in my own secondary_super list. 99 if (this == k) 100 return true; 101 // Scan the array-of-objects for a match 102 int cnt = secondary_supers()->length(); 103 for (int i = 0; i < cnt; i++) { 104 if (secondary_supers()->at(i) == k) { 105 ((Klass*)this)->set_secondary_super_cache(k); 106 return true; 107 } 108 } 109 return false; 110 } 111 112 // Return self, except for abstract classes with exactly 1 113 // implementor. Then return the 1 concrete implementation. 114 Klass *Klass::up_cast_abstract() { 115 Klass *r = this; 116 while( r->is_abstract() ) { // Receiver is abstract? 117 Klass *s = r->subklass(); // Check for exactly 1 subklass 118 if( !s || s->next_sibling() ) // Oops; wrong count; give up 119 return this; // Return 'this' as a no-progress flag 120 r = s; // Loop till find concrete class 121 } 122 return r; // Return the 1 concrete class 123 } 124 125 // Find LCA in class hierarchy 126 Klass *Klass::LCA( Klass *k2 ) { 127 Klass *k1 = this; 128 while( 1 ) { 129 if( k1->is_subtype_of(k2) ) return k2; 130 if( k2->is_subtype_of(k1) ) return k1; 131 k1 = k1->super(); 132 k2 = k2->super(); 133 } 134 } 135 136 137 void Klass::check_valid_for_instantiation(bool throwError, TRAPS) { 138 ResourceMark rm(THREAD); 139 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError() 140 : vmSymbols::java_lang_InstantiationException(), external_name()); 141 } 142 143 144 void Klass::copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS) { 145 THROW(vmSymbols::java_lang_ArrayStoreException()); 146 } 147 148 149 void Klass::initialize(TRAPS) { 150 ShouldNotReachHere(); 151 } 152 153 bool Klass::compute_is_subtype_of(Klass* k) { 154 assert(k->is_klass(), "argument must be a class"); 155 return is_subclass_of(k); 156 } 157 158 Klass* Klass::find_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const { 159 #ifdef ASSERT 160 tty->print_cr("Error: find_field called on a klass oop." 161 " Likely error: reflection method does not correctly" 162 " wrap return value in a mirror object."); 163 #endif 164 ShouldNotReachHere(); 165 return NULL; 166 } 167 168 Method* Klass::uncached_lookup_method(const Symbol* name, const Symbol* signature, OverpassLookupMode overpass_mode) const { 169 #ifdef ASSERT 170 tty->print_cr("Error: uncached_lookup_method called on a klass oop." 171 " Likely error: reflection method does not correctly" 172 " wrap return value in a mirror object."); 173 #endif 174 ShouldNotReachHere(); 175 return NULL; 176 } 177 178 void* Klass::operator new(size_t size, ClassLoaderData* loader_data, size_t word_size, TRAPS) throw() { 179 return Metaspace::allocate(loader_data, word_size, MetaspaceObj::ClassType, THREAD); 180 } 181 182 // "Normal" instantiation is preceeded by a MetaspaceObj allocation 183 // which zeros out memory - calloc equivalent. 184 // The constructor is also used from CppVtableCloner, 185 // which doesn't zero out the memory before calling the constructor. 186 // Need to set the _java_mirror field explicitly to not hit an assert that the field 187 // should be NULL before setting it. 188 Klass::Klass() : _prototype_header(markOopDesc::prototype()), 189 _shared_class_path_index(-1), 190 _java_mirror(NULL) { 191 CDS_ONLY(_shared_class_flags = 0;) 192 CDS_JAVA_HEAP_ONLY(_archived_mirror = 0;) 193 _primary_supers[0] = this; 194 set_super_check_offset(in_bytes(primary_supers_offset())); 195 } 196 197 jint Klass::array_layout_helper(BasicType etype) { 198 assert(etype >= T_BOOLEAN && etype <= T_OBJECT, "valid etype"); 199 // Note that T_ARRAY is not allowed here. 200 int hsize = arrayOopDesc::base_offset_in_bytes(etype); 201 int esize = type2aelembytes(etype); 202 bool isobj = (etype == T_OBJECT); 203 int tag = isobj ? _lh_array_tag_obj_value : _lh_array_tag_type_value; 204 int lh = array_layout_helper(tag, hsize, etype, exact_log2(esize)); 205 206 assert(lh < (int)_lh_neutral_value, "must look like an array layout"); 207 assert(layout_helper_is_array(lh), "correct kind"); 208 assert(layout_helper_is_objArray(lh) == isobj, "correct kind"); 209 assert(layout_helper_is_typeArray(lh) == !isobj, "correct kind"); 210 assert(layout_helper_header_size(lh) == hsize, "correct decode"); 211 assert(layout_helper_element_type(lh) == etype, "correct decode"); 212 assert(1 << layout_helper_log2_element_size(lh) == esize, "correct decode"); 213 214 return lh; 215 } 216 217 bool Klass::can_be_primary_super_slow() const { 218 if (super() == NULL) 219 return true; 220 else if (super()->super_depth() >= primary_super_limit()-1) 221 return false; 222 else 223 return true; 224 } 225 226 void Klass::initialize_supers(Klass* k, Array<Klass*>* transitive_interfaces, TRAPS) { 227 if (FastSuperclassLimit == 0) { 228 // None of the other machinery matters. 229 set_super(k); 230 return; 231 } 232 if (k == NULL) { 233 set_super(NULL); 234 _primary_supers[0] = this; 235 assert(super_depth() == 0, "Object must already be initialized properly"); 236 } else if (k != super() || k == SystemDictionary::Object_klass()) { 237 assert(super() == NULL || super() == SystemDictionary::Object_klass(), 238 "initialize this only once to a non-trivial value"); 239 set_super(k); 240 Klass* sup = k; 241 int sup_depth = sup->super_depth(); 242 juint my_depth = MIN2(sup_depth + 1, (int)primary_super_limit()); 243 if (!can_be_primary_super_slow()) 244 my_depth = primary_super_limit(); 245 for (juint i = 0; i < my_depth; i++) { 246 _primary_supers[i] = sup->_primary_supers[i]; 247 } 248 Klass* *super_check_cell; 249 if (my_depth < primary_super_limit()) { 250 _primary_supers[my_depth] = this; 251 super_check_cell = &_primary_supers[my_depth]; 252 } else { 253 // Overflow of the primary_supers array forces me to be secondary. 254 super_check_cell = &_secondary_super_cache; 255 } 256 set_super_check_offset((address)super_check_cell - (address) this); 257 258 #ifdef ASSERT 259 { 260 juint j = super_depth(); 261 assert(j == my_depth, "computed accessor gets right answer"); 262 Klass* t = this; 263 while (!t->can_be_primary_super()) { 264 t = t->super(); 265 j = t->super_depth(); 266 } 267 for (juint j1 = j+1; j1 < primary_super_limit(); j1++) { 268 assert(primary_super_of_depth(j1) == NULL, "super list padding"); 269 } 270 while (t != NULL) { 271 assert(primary_super_of_depth(j) == t, "super list initialization"); 272 t = t->super(); 273 --j; 274 } 275 assert(j == (juint)-1, "correct depth count"); 276 } 277 #endif 278 } 279 280 if (secondary_supers() == NULL) { 281 282 // Now compute the list of secondary supertypes. 283 // Secondaries can occasionally be on the super chain, 284 // if the inline "_primary_supers" array overflows. 285 int extras = 0; 286 Klass* p; 287 for (p = super(); !(p == NULL || p->can_be_primary_super()); p = p->super()) { 288 ++extras; 289 } 290 291 ResourceMark rm(THREAD); // need to reclaim GrowableArrays allocated below 292 293 // Compute the "real" non-extra secondaries. 294 GrowableArray<Klass*>* secondaries = compute_secondary_supers(extras, transitive_interfaces); 295 if (secondaries == NULL) { 296 // secondary_supers set by compute_secondary_supers 297 return; 298 } 299 300 GrowableArray<Klass*>* primaries = new GrowableArray<Klass*>(extras); 301 302 for (p = super(); !(p == NULL || p->can_be_primary_super()); p = p->super()) { 303 int i; // Scan for overflow primaries being duplicates of 2nd'arys 304 305 // This happens frequently for very deeply nested arrays: the 306 // primary superclass chain overflows into the secondary. The 307 // secondary list contains the element_klass's secondaries with 308 // an extra array dimension added. If the element_klass's 309 // secondary list already contains some primary overflows, they 310 // (with the extra level of array-ness) will collide with the 311 // normal primary superclass overflows. 312 for( i = 0; i < secondaries->length(); i++ ) { 313 if( secondaries->at(i) == p ) 314 break; 315 } 316 if( i < secondaries->length() ) 317 continue; // It's a dup, don't put it in 318 primaries->push(p); 319 } 320 // Combine the two arrays into a metadata object to pack the array. 321 // The primaries are added in the reverse order, then the secondaries. 322 int new_length = primaries->length() + secondaries->length(); 323 Array<Klass*>* s2 = MetadataFactory::new_array<Klass*>( 324 class_loader_data(), new_length, CHECK); 325 int fill_p = primaries->length(); 326 for (int j = 0; j < fill_p; j++) { 327 s2->at_put(j, primaries->pop()); // add primaries in reverse order. 328 } 329 for( int j = 0; j < secondaries->length(); j++ ) { 330 s2->at_put(j+fill_p, secondaries->at(j)); // add secondaries on the end. 331 } 332 333 #ifdef ASSERT 334 // We must not copy any NULL placeholders left over from bootstrap. 335 for (int j = 0; j < s2->length(); j++) { 336 assert(s2->at(j) != NULL, "correct bootstrapping order"); 337 } 338 #endif 339 340 set_secondary_supers(s2); 341 } 342 } 343 344 GrowableArray<Klass*>* Klass::compute_secondary_supers(int num_extra_slots, 345 Array<Klass*>* transitive_interfaces) { 346 assert(num_extra_slots == 0, "override for complex klasses"); 347 assert(transitive_interfaces == NULL, "sanity"); 348 set_secondary_supers(Universe::the_empty_klass_array()); 349 return NULL; 350 } 351 352 353 InstanceKlass* Klass::superklass() const { 354 assert(super() == NULL || super()->is_instance_klass(), "must be instance klass"); 355 return _super == NULL ? NULL : InstanceKlass::cast(_super); 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(); 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 void Klass::clean_weak_klass_links(bool unloading_occurred, bool clean_alive_klasses) { 387 if (!ClassUnloading || !unloading_occurred) { 388 return; 389 } 390 391 Klass* root = SystemDictionary::Object_klass(); 392 Stack<Klass*, mtGC> stack; 393 394 stack.push(root); 395 while (!stack.is_empty()) { 396 Klass* current = stack.pop(); 397 398 assert(current->is_loader_alive(), "just checking, this should be live"); 399 400 // Find and set the first alive subklass 401 Klass* sub = current->subklass(); 402 while (sub != NULL && !sub->is_loader_alive()) { 403 #ifndef PRODUCT 404 if (log_is_enabled(Trace, class, unload)) { 405 ResourceMark rm; 406 log_trace(class, unload)("unlinking class (subclass): %s", sub->external_name()); 407 } 408 #endif 409 sub = sub->next_sibling(); 410 } 411 current->set_subklass(sub); 412 if (sub != NULL) { 413 stack.push(sub); 414 } 415 416 // Find and set the first alive sibling 417 Klass* sibling = current->next_sibling(); 418 while (sibling != NULL && !sibling->is_loader_alive()) { 419 if (log_is_enabled(Trace, class, unload)) { 420 ResourceMark rm; 421 log_trace(class, unload)("[Unlinking class (sibling) %s]", sibling->external_name()); 422 } 423 sibling = sibling->next_sibling(); 424 } 425 current->set_next_sibling(sibling); 426 if (sibling != NULL) { 427 stack.push(sibling); 428 } 429 430 // Clean the implementors list and method data. 431 if (clean_alive_klasses && current->is_instance_klass()) { 432 InstanceKlass* ik = InstanceKlass::cast(current); 433 ik->clean_weak_instanceklass_links(); 434 435 // JVMTI RedefineClasses creates previous versions that are not in 436 // the class hierarchy, so process them here. 437 while ((ik = ik->previous_versions()) != NULL) { 438 ik->clean_weak_instanceklass_links(); 439 } 440 } 441 } 442 } 443 444 void Klass::metaspace_pointers_do(MetaspaceClosure* it) { 445 if (log_is_enabled(Trace, cds)) { 446 ResourceMark rm; 447 log_trace(cds)("Iter(Klass): %p (%s)", this, external_name()); 448 } 449 450 it->push(&_name); 451 it->push(&_secondary_super_cache); 452 it->push(&_secondary_supers); 453 for (int i = 0; i < _primary_super_limit; i++) { 454 it->push(&_primary_supers[i]); 455 } 456 it->push(&_super); 457 it->push(&_subklass); 458 it->push(&_next_sibling); 459 it->push(&_next_link); 460 461 vtableEntry* vt = start_of_vtable(); 462 for (int i=0; i<vtable_length(); i++) { 463 it->push(vt[i].method_addr()); 464 } 465 } 466 467 void Klass::remove_unshareable_info() { 468 assert (DumpSharedSpaces, "only called for DumpSharedSpaces"); 469 JFR_ONLY(REMOVE_ID(this);) 470 if (log_is_enabled(Trace, cds, unshareable)) { 471 ResourceMark rm; 472 log_trace(cds, unshareable)("remove: %s", external_name()); 473 } 474 475 set_subklass(NULL); 476 set_next_sibling(NULL); 477 set_next_link(NULL); 478 479 // Null out class_loader_data because we don't share that yet. 480 set_class_loader_data(NULL); 481 set_is_shared(); 482 } 483 484 void Klass::remove_java_mirror() { 485 assert (DumpSharedSpaces, "only called for DumpSharedSpaces"); 486 if (log_is_enabled(Trace, cds, unshareable)) { 487 ResourceMark rm; 488 log_trace(cds, unshareable)("remove java_mirror: %s", external_name()); 489 } 490 // Just null out the mirror. The class_loader_data() no longer exists. 491 _java_mirror = NULL; 492 } 493 494 void Klass::restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS) { 495 assert(is_klass(), "ensure C++ vtable is restored"); 496 assert(is_shared(), "must be set"); 497 JFR_ONLY(RESTORE_ID(this);) 498 if (log_is_enabled(Trace, cds, unshareable)) { 499 ResourceMark rm; 500 log_trace(cds, unshareable)("restore: %s", external_name()); 501 } 502 503 // If an exception happened during CDS restore, some of these fields may already be 504 // set. We leave the class on the CLD list, even if incomplete so that we don't 505 // modify the CLD list outside a safepoint. 506 if (class_loader_data() == NULL) { 507 // Restore class_loader_data to the null class loader data 508 set_class_loader_data(loader_data); 509 510 // Add to null class loader list first before creating the mirror 511 // (same order as class file parsing) 512 loader_data->add_class(this); 513 } 514 515 Handle loader(THREAD, loader_data->class_loader()); 516 ModuleEntry* module_entry = NULL; 517 Klass* k = this; 518 if (k->is_objArray_klass()) { 519 k = ObjArrayKlass::cast(k)->bottom_klass(); 520 } 521 // Obtain klass' module. 522 if (k->is_instance_klass()) { 523 InstanceKlass* ik = (InstanceKlass*) k; 524 module_entry = ik->module(); 525 } else { 526 module_entry = ModuleEntryTable::javabase_moduleEntry(); 527 } 528 // Obtain java.lang.Module, if available 529 Handle module_handle(THREAD, ((module_entry != NULL) ? module_entry->module() : (oop)NULL)); 530 531 if (this->has_raw_archived_mirror()) { 532 log_debug(cds, mirror)("%s has raw archived mirror", external_name()); 533 if (MetaspaceShared::open_archive_heap_region_mapped()) { 534 oop m = archived_java_mirror(); 535 log_debug(cds, mirror)("Archived mirror is: " PTR_FORMAT, p2i(m)); 536 if (m != NULL) { 537 // mirror is archived, restore 538 assert(MetaspaceShared::is_archive_object(m), "must be archived mirror object"); 539 Handle m_h(THREAD, m); 540 java_lang_Class::restore_archived_mirror(this, m_h, loader, module_handle, protection_domain, CHECK); 541 return; 542 } 543 } 544 545 // No archived mirror data 546 _java_mirror = NULL; 547 this->clear_has_raw_archived_mirror(); 548 } 549 550 // Only recreate it if not present. A previous attempt to restore may have 551 // gotten an OOM later but keep the mirror if it was created. 552 if (java_mirror() == NULL) { 553 log_trace(cds, mirror)("Recreate mirror for %s", external_name()); 554 java_lang_Class::create_mirror(this, loader, module_handle, protection_domain, CHECK); 555 } 556 } 557 558 #if INCLUDE_CDS_JAVA_HEAP 559 // Used at CDS dump time to access the archived mirror. No GC barrier. 560 oop Klass::archived_java_mirror_raw() { 561 assert(DumpSharedSpaces, "called only during runtime"); 562 assert(has_raw_archived_mirror(), "must have raw archived mirror"); 563 return CompressedOops::decode(_archived_mirror); 564 } 565 566 // Used at CDS runtime to get the archived mirror from shared class. Uses GC barrier. 567 oop Klass::archived_java_mirror() { 568 assert(UseSharedSpaces, "UseSharedSpaces expected."); 569 assert(has_raw_archived_mirror(), "must have raw archived mirror"); 570 return RootAccess<IN_ARCHIVE_ROOT>::oop_load(&_archived_mirror); 571 } 572 573 // No GC barrier 574 void Klass::set_archived_java_mirror_raw(oop m) { 575 assert(DumpSharedSpaces, "called only during runtime"); 576 _archived_mirror = CompressedOops::encode(m); 577 } 578 #endif // INCLUDE_CDS_JAVA_HEAP 579 580 Klass* Klass::array_klass_or_null(int rank) { 581 EXCEPTION_MARK; 582 // No exception can be thrown by array_klass_impl when called with or_null == true. 583 // (In anycase, the execption mark will fail if it do so) 584 return array_klass_impl(true, rank, THREAD); 585 } 586 587 588 Klass* Klass::array_klass_or_null() { 589 EXCEPTION_MARK; 590 // No exception can be thrown by array_klass_impl when called with or_null == true. 591 // (In anycase, the execption mark will fail if it do so) 592 return array_klass_impl(true, THREAD); 593 } 594 595 596 Klass* Klass::array_klass_impl(bool or_null, int rank, TRAPS) { 597 fatal("array_klass should be dispatched to InstanceKlass, ObjArrayKlass or TypeArrayKlass"); 598 return NULL; 599 } 600 601 602 Klass* Klass::array_klass_impl(bool or_null, TRAPS) { 603 fatal("array_klass should be dispatched to InstanceKlass, ObjArrayKlass or TypeArrayKlass"); 604 return NULL; 605 } 606 607 oop Klass::class_loader() const { return class_loader_data()->class_loader(); } 608 609 // In product mode, this function doesn't have virtual function calls so 610 // there might be some performance advantage to handling InstanceKlass here. 611 const char* Klass::external_name() const { 612 if (is_instance_klass()) { 613 const InstanceKlass* ik = static_cast<const InstanceKlass*>(this); 614 if (ik->is_anonymous()) { 615 char addr_buf[20]; 616 jio_snprintf(addr_buf, 20, "/" INTPTR_FORMAT, p2i(ik)); 617 size_t addr_len = strlen(addr_buf); 618 size_t name_len = name()->utf8_length(); 619 char* result = NEW_RESOURCE_ARRAY(char, name_len + addr_len + 1); 620 name()->as_klass_external_name(result, (int) name_len + 1); 621 assert(strlen(result) == name_len, ""); 622 strcpy(result + name_len, addr_buf); 623 assert(strlen(result) == name_len + addr_len, ""); 624 return result; 625 } 626 } 627 if (name() == NULL) return "<unknown>"; 628 return name()->as_klass_external_name(); 629 } 630 631 const char* Klass::signature_name() const { 632 if (name() == NULL) return "<unknown>"; 633 return name()->as_C_string(); 634 } 635 636 const char* Klass::external_kind() const { 637 if (is_interface()) return "interface"; 638 if (is_abstract()) return "abstract class"; 639 return "class"; 640 } 641 642 // Unless overridden, modifier_flags is 0. 643 jint Klass::compute_modifier_flags(TRAPS) const { 644 return 0; 645 } 646 647 int Klass::atomic_incr_biased_lock_revocation_count() { 648 return (int) Atomic::add(1, &_biased_lock_revocation_count); 649 } 650 651 // Unless overridden, jvmti_class_status has no flags set. 652 jint Klass::jvmti_class_status() const { 653 return 0; 654 } 655 656 657 // Printing 658 659 void Klass::print_on(outputStream* st) const { 660 ResourceMark rm; 661 // print title 662 st->print("%s", internal_name()); 663 print_address_on(st); 664 st->cr(); 665 } 666 667 void Klass::oop_print_on(oop obj, outputStream* st) { 668 ResourceMark rm; 669 // print title 670 st->print_cr("%s ", internal_name()); 671 obj->print_address_on(st); 672 673 if (WizardMode) { 674 // print header 675 obj->mark()->print_on(st); 676 } 677 678 // print class 679 st->print(" - klass: "); 680 obj->klass()->print_value_on(st); 681 st->cr(); 682 } 683 684 void Klass::oop_print_value_on(oop obj, outputStream* st) { 685 // print title 686 ResourceMark rm; // Cannot print in debug mode without this 687 st->print("%s", internal_name()); 688 obj->print_address_on(st); 689 } 690 691 #if INCLUDE_SERVICES 692 // Size Statistics 693 void Klass::collect_statistics(KlassSizeStats *sz) const { 694 sz->_klass_bytes = sz->count(this); 695 sz->_mirror_bytes = sz->count(java_mirror()); 696 sz->_secondary_supers_bytes = sz->count_array(secondary_supers()); 697 698 sz->_ro_bytes += sz->_secondary_supers_bytes; 699 sz->_rw_bytes += sz->_klass_bytes + sz->_mirror_bytes; 700 } 701 #endif // INCLUDE_SERVICES 702 703 // Verification 704 705 void Klass::verify_on(outputStream* st) { 706 707 // This can be expensive, but it is worth checking that this klass is actually 708 // in the CLD graph but not in production. 709 assert(Metaspace::contains((address)this), "Should be"); 710 711 guarantee(this->is_klass(),"should be klass"); 712 713 if (super() != NULL) { 714 guarantee(super()->is_klass(), "should be klass"); 715 } 716 if (secondary_super_cache() != NULL) { 717 Klass* ko = secondary_super_cache(); 718 guarantee(ko->is_klass(), "should be klass"); 719 } 720 for ( uint i = 0; i < primary_super_limit(); i++ ) { 721 Klass* ko = _primary_supers[i]; 722 if (ko != NULL) { 723 guarantee(ko->is_klass(), "should be klass"); 724 } 725 } 726 727 if (java_mirror() != NULL) { 728 guarantee(oopDesc::is_oop(java_mirror()), "should be instance"); 729 } 730 } 731 732 void Klass::oop_verify_on(oop obj, outputStream* st) { 733 guarantee(oopDesc::is_oop(obj), "should be oop"); 734 guarantee(obj->klass()->is_klass(), "klass field is not a klass"); 735 } 736 737 klassVtable Klass::vtable() const { 738 return klassVtable(const_cast<Klass*>(this), start_of_vtable(), vtable_length() / vtableEntry::size()); 739 } 740 741 vtableEntry* Klass::start_of_vtable() const { 742 return (vtableEntry*) ((address)this + in_bytes(vtable_start_offset())); 743 } 744 745 Method* Klass::method_at_vtable(int index) { 746 #ifndef PRODUCT 747 assert(index >= 0, "valid vtable index"); 748 if (DebugVtables) { 749 verify_vtable_index(index); 750 } 751 #endif 752 return start_of_vtable()[index].method(); 753 } 754 755 ByteSize Klass::vtable_start_offset() { 756 return in_ByteSize(InstanceKlass::header_size() * wordSize); 757 } 758 759 #ifndef PRODUCT 760 761 bool Klass::verify_vtable_index(int i) { 762 int limit = vtable_length()/vtableEntry::size(); 763 assert(i >= 0 && i < limit, "index %d out of bounds %d", i, limit); 764 return true; 765 } 766 767 bool Klass::verify_itable_index(int i) { 768 assert(is_instance_klass(), ""); 769 int method_count = klassItable::method_count_for_interface(this); 770 assert(i >= 0 && i < method_count, "index out of bounds"); 771 return true; 772 } 773 774 #endif // PRODUCT 775 776 // The caller of class_loader_and_module_name() (or one of its callers) 777 // must use a ResourceMark in order to correctly free the result. 778 const char* Klass::class_loader_and_module_name() const { 779 const char* delim = "/"; 780 size_t delim_len = strlen(delim); 781 782 const char* fqn = external_name(); 783 // Length of message to return; always include FQN 784 size_t msglen = strlen(fqn) + 1; 785 786 bool has_cl_name = false; 787 bool has_mod_name = false; 788 bool has_version = false; 789 790 // Use class loader name, if exists and not builtin 791 const char* class_loader_name = ""; 792 ClassLoaderData* cld = class_loader_data(); 793 assert(cld != NULL, "class_loader_data should not be NULL"); 794 if (!cld->is_builtin_class_loader_data()) { 795 // If not builtin, look for name 796 oop loader = class_loader(); 797 if (loader != NULL) { 798 oop class_loader_name_oop = java_lang_ClassLoader::name(loader); 799 if (class_loader_name_oop != NULL) { 800 class_loader_name = java_lang_String::as_utf8_string(class_loader_name_oop); 801 if (class_loader_name != NULL && class_loader_name[0] != '\0') { 802 has_cl_name = true; 803 msglen += strlen(class_loader_name) + delim_len; 804 } 805 } 806 } 807 } 808 809 const char* module_name = ""; 810 const char* version = ""; 811 const Klass* bottom_klass = is_objArray_klass() ? 812 ObjArrayKlass::cast(this)->bottom_klass() : this; 813 if (bottom_klass->is_instance_klass()) { 814 ModuleEntry* module = InstanceKlass::cast(bottom_klass)->module(); 815 // Use module name, if exists 816 if (module->is_named()) { 817 has_mod_name = true; 818 module_name = module->name()->as_C_string(); 819 msglen += strlen(module_name); 820 // Use version if exists and is not a jdk module 821 if (module->is_non_jdk_module() && module->version() != NULL) { 822 has_version = true; 823 version = module->version()->as_C_string(); 824 msglen += strlen("@") + strlen(version); 825 } 826 } 827 } else { 828 // klass is an array of primitives, so its module is java.base 829 module_name = JAVA_BASE_NAME; 830 } 831 832 if (has_cl_name || has_mod_name) { 833 msglen += delim_len; 834 } 835 836 char* message = NEW_RESOURCE_ARRAY_RETURN_NULL(char, msglen); 837 838 // Just return the FQN if error in allocating string 839 if (message == NULL) { 840 return fqn; 841 } 842 843 jio_snprintf(message, msglen, "%s%s%s%s%s%s%s", 844 class_loader_name, 845 (has_cl_name) ? delim : "", 846 (has_mod_name) ? module_name : "", 847 (has_version) ? "@" : "", 848 (has_version) ? version : "", 849 (has_cl_name || has_mod_name) ? delim : "", 850 fqn); 851 return message; 852 }