1 /* 2 * Copyright (c) 1997, 2019, 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/classLoaderDataGraph.inline.hpp" 28 #include "classfile/dictionary.hpp" 29 #include "classfile/javaClasses.hpp" 30 #include "classfile/moduleEntry.hpp" 31 #include "classfile/systemDictionary.hpp" 32 #include "classfile/vmSymbols.hpp" 33 #include "gc/shared/collectedHeap.inline.hpp" 34 #include "logging/log.hpp" 35 #include "memory/heapInspection.hpp" 36 #include "memory/heapShared.hpp" 37 #include "memory/metadataFactory.hpp" 38 #include "memory/metaspaceClosure.hpp" 39 #include "memory/metaspaceShared.hpp" 40 #include "memory/oopFactory.hpp" 41 #include "memory/resourceArea.hpp" 42 #include "memory/universe.hpp" 43 #include "oops/compressedOops.inline.hpp" 44 #include "oops/instanceKlass.hpp" 45 #include "oops/klass.inline.hpp" 46 #include "oops/oop.inline.hpp" 47 #include "oops/oopHandle.inline.hpp" 48 #include "runtime/atomic.hpp" 49 #include "runtime/handles.inline.hpp" 50 #include "runtime/orderAccess.hpp" 51 #include "utilities/macros.hpp" 52 #include "utilities/stack.inline.hpp" 53 54 void Klass::set_java_mirror(Handle m) { 55 assert(!m.is_null(), "New mirror should never be null."); 56 assert(_java_mirror.resolve() == NULL, "should only be used to initialize mirror"); 57 _java_mirror = class_loader_data()->add_handle(m); 58 } 59 60 oop Klass::java_mirror_no_keepalive() const { 61 return _java_mirror.peek(); 62 } 63 64 bool Klass::is_cloneable() const { 65 return _access_flags.is_cloneable_fast() || 66 is_subtype_of(SystemDictionary::Cloneable_klass()); 67 } 68 69 void Klass::set_is_cloneable() { 70 if (name() == vmSymbols::java_lang_invoke_MemberName()) { 71 assert(is_final(), "no subclasses allowed"); 72 // MemberName cloning should not be intrinsified and always happen in JVM_Clone. 73 } else if (is_instance_klass() && InstanceKlass::cast(this)->reference_type() != REF_NONE) { 74 // Reference cloning should not be intrinsified and always happen in JVM_Clone. 75 } else { 76 _access_flags.set_is_cloneable_fast(); 77 } 78 } 79 80 void Klass::set_name(Symbol* n) { 81 _name = n; 82 if (_name != NULL) _name->increment_refcount(); 83 } 84 85 bool Klass::is_subclass_of(const Klass* k) const { 86 // Run up the super chain and check 87 if (this == k) return true; 88 89 Klass* t = const_cast<Klass*>(this)->super(); 90 91 while (t != NULL) { 92 if (t == k) return true; 93 t = t->super(); 94 } 95 return false; 96 } 97 98 bool Klass::search_secondary_supers(Klass* k) const { 99 // Put some extra logic here out-of-line, before the search proper. 100 // This cuts down the size of the inline method. 101 102 // This is necessary, since I am never in my own secondary_super list. 103 if (this == k) 104 return true; 105 // Scan the array-of-objects for a match 106 int cnt = secondary_supers()->length(); 107 for (int i = 0; i < cnt; i++) { 108 if (secondary_supers()->at(i) == k) { 109 ((Klass*)this)->set_secondary_super_cache(k); 110 return true; 111 } 112 } 113 return false; 114 } 115 116 // Return self, except for abstract classes with exactly 1 117 // implementor. Then return the 1 concrete implementation. 118 Klass *Klass::up_cast_abstract() { 119 Klass *r = this; 120 while( r->is_abstract() ) { // Receiver is abstract? 121 Klass *s = r->subklass(); // Check for exactly 1 subklass 122 if (s == NULL || s->next_sibling() != NULL) // Oops; wrong count; give up 123 return this; // Return 'this' as a no-progress flag 124 r = s; // Loop till find concrete class 125 } 126 return r; // Return the 1 concrete class 127 } 128 129 // Find LCA in class hierarchy 130 Klass *Klass::LCA( Klass *k2 ) { 131 Klass *k1 = this; 132 while( 1 ) { 133 if( k1->is_subtype_of(k2) ) return k2; 134 if( k2->is_subtype_of(k1) ) return k1; 135 k1 = k1->super(); 136 k2 = k2->super(); 137 } 138 } 139 140 141 void Klass::check_valid_for_instantiation(bool throwError, TRAPS) { 142 ResourceMark rm(THREAD); 143 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError() 144 : vmSymbols::java_lang_InstantiationException(), external_name()); 145 } 146 147 148 void Klass::copy_array(arrayOop s, int src_pos, arrayOop d, int dst_pos, int length, TRAPS) { 149 ResourceMark rm(THREAD); 150 assert(s != NULL, "Throw NPE!"); 151 THROW_MSG(vmSymbols::java_lang_ArrayStoreException(), 152 err_msg("arraycopy: source type %s is not an array", s->klass()->external_name())); 153 } 154 155 156 void Klass::initialize(TRAPS) { 157 ShouldNotReachHere(); 158 } 159 160 Klass* Klass::find_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const { 161 #ifdef ASSERT 162 tty->print_cr("Error: find_field called on a klass oop." 163 " Likely error: reflection method does not correctly" 164 " wrap return value in a mirror object."); 165 #endif 166 ShouldNotReachHere(); 167 return NULL; 168 } 169 170 Method* Klass::uncached_lookup_method(const Symbol* name, const Symbol* signature, 171 OverpassLookupMode overpass_mode, 172 PrivateLookupMode private_mode) const { 173 #ifdef ASSERT 174 tty->print_cr("Error: uncached_lookup_method called on a klass oop." 175 " Likely error: reflection method does not correctly" 176 " wrap return value in a mirror object."); 177 #endif 178 ShouldNotReachHere(); 179 return NULL; 180 } 181 182 void* Klass::operator new(size_t size, ClassLoaderData* loader_data, size_t word_size, TRAPS) throw() { 183 return Metaspace::allocate(loader_data, word_size, MetaspaceObj::ClassType, THREAD); 184 } 185 186 // "Normal" instantiation is preceeded by a MetaspaceObj allocation 187 // which zeros out memory - calloc equivalent. 188 // The constructor is also used from CppVtableCloner, 189 // which doesn't zero out the memory before calling the constructor. 190 // Need to set the _java_mirror field explicitly to not hit an assert that the field 191 // should be NULL before setting it. 192 Klass::Klass(KlassID id) : _id(id), 193 _java_mirror(NULL), 194 _prototype_header(markWord::prototype()), 195 _shared_class_path_index(-1) { 196 CDS_ONLY(_shared_class_flags = 0;) 197 CDS_JAVA_HEAP_ONLY(_archived_mirror = 0;) 198 _primary_supers[0] = this; 199 set_super_check_offset(in_bytes(primary_supers_offset())); 200 } 201 202 jint Klass::array_layout_helper(BasicType etype) { 203 assert(etype >= T_BOOLEAN && etype <= T_OBJECT, "valid etype"); 204 // Note that T_ARRAY is not allowed here. 205 int hsize = arrayOopDesc::base_offset_in_bytes(etype); 206 int esize = type2aelembytes(etype); 207 bool isobj = (etype == T_OBJECT); 208 int tag = isobj ? _lh_array_tag_obj_value : _lh_array_tag_type_value; 209 int lh = array_layout_helper(tag, hsize, etype, exact_log2(esize)); 210 211 assert(lh < (int)_lh_neutral_value, "must look like an array layout"); 212 assert(layout_helper_is_array(lh), "correct kind"); 213 assert(layout_helper_is_objArray(lh) == isobj, "correct kind"); 214 assert(layout_helper_is_typeArray(lh) == !isobj, "correct kind"); 215 assert(layout_helper_header_size(lh) == hsize, "correct decode"); 216 assert(layout_helper_element_type(lh) == etype, "correct decode"); 217 assert(1 << layout_helper_log2_element_size(lh) == esize, "correct decode"); 218 219 return lh; 220 } 221 222 bool Klass::can_be_primary_super_slow() const { 223 if (super() == NULL) 224 return true; 225 else if (super()->super_depth() >= primary_super_limit()-1) 226 return false; 227 else 228 return true; 229 } 230 231 void Klass::initialize_supers(Klass* k, Array<InstanceKlass*>* transitive_interfaces, TRAPS) { 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<InstanceKlass*>* 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 // superklass links 354 InstanceKlass* Klass::superklass() const { 355 assert(super() == NULL || super()->is_instance_klass(), "must be instance klass"); 356 return _super == NULL ? NULL : InstanceKlass::cast(_super); 357 } 358 359 // subklass links. Used by the compiler (and vtable initialization) 360 // May be cleaned concurrently, so must use the Compile_lock. 361 // The log parameter is for clean_weak_klass_links to report unlinked classes. 362 Klass* Klass::subklass(bool log) const { 363 // Need load_acquire on the _subklass, because it races with inserts that 364 // publishes freshly initialized data. 365 for (Klass* chain = OrderAccess::load_acquire(&_subklass); 366 chain != NULL; 367 // Do not need load_acquire on _next_sibling, because inserts never 368 // create _next_sibling edges to dead data. 369 chain = Atomic::load(&chain->_next_sibling)) 370 { 371 if (chain->is_loader_alive()) { 372 return chain; 373 } else if (log) { 374 if (log_is_enabled(Trace, class, unload)) { 375 ResourceMark rm; 376 log_trace(class, unload)("unlinking class (subclass): %s", chain->external_name()); 377 } 378 } 379 } 380 return NULL; 381 } 382 383 Klass* Klass::next_sibling(bool log) const { 384 // Do not need load_acquire on _next_sibling, because inserts never 385 // create _next_sibling edges to dead data. 386 for (Klass* chain = Atomic::load(&_next_sibling); 387 chain != NULL; 388 chain = Atomic::load(&chain->_next_sibling)) { 389 // Only return alive klass, there may be stale klass 390 // in this chain if cleaned concurrently. 391 if (chain->is_loader_alive()) { 392 return chain; 393 } else if (log) { 394 if (log_is_enabled(Trace, class, unload)) { 395 ResourceMark rm; 396 log_trace(class, unload)("unlinking class (sibling): %s", chain->external_name()); 397 } 398 } 399 } 400 return NULL; 401 } 402 403 void Klass::set_subklass(Klass* s) { 404 assert(s != this, "sanity check"); 405 OrderAccess::release_store(&_subklass, s); 406 } 407 408 void Klass::set_next_sibling(Klass* s) { 409 assert(s != this, "sanity check"); 410 // Does not need release semantics. If used by cleanup, it will link to 411 // already safely published data, and if used by inserts, will be published 412 // safely using cmpxchg. 413 Atomic::store(s, &_next_sibling); 414 } 415 416 void Klass::append_to_sibling_list() { 417 assert_locked_or_safepoint(Compile_lock); 418 debug_only(verify();) 419 // add ourselves to superklass' subklass list 420 InstanceKlass* super = superklass(); 421 if (super == NULL) return; // special case: class Object 422 assert((!super->is_interface() // interfaces cannot be supers 423 && (super->superklass() == NULL || !is_interface())), 424 "an interface can only be a subklass of Object"); 425 426 // Make sure there is no stale subklass head 427 super->clean_subklass(); 428 429 for (;;) { 430 Klass* prev_first_subklass = OrderAccess::load_acquire(&_super->_subklass); 431 if (prev_first_subklass != NULL) { 432 // set our sibling to be the superklass' previous first subklass 433 assert(prev_first_subklass->is_loader_alive(), "May not attach not alive klasses"); 434 set_next_sibling(prev_first_subklass); 435 } 436 // Note that the prev_first_subklass is always alive, meaning no sibling_next links 437 // are ever created to not alive klasses. This is an important invariant of the lock-free 438 // cleaning protocol, that allows us to safely unlink dead klasses from the sibling list. 439 if (Atomic::cmpxchg(this, &super->_subklass, prev_first_subklass) == prev_first_subklass) { 440 return; 441 } 442 } 443 debug_only(verify();) 444 } 445 446 void Klass::clean_subklass() { 447 for (;;) { 448 // Need load_acquire, due to contending with concurrent inserts 449 Klass* subklass = OrderAccess::load_acquire(&_subklass); 450 if (subklass == NULL || subklass->is_loader_alive()) { 451 return; 452 } 453 // Try to fix _subklass until it points at something not dead. 454 Atomic::cmpxchg(subklass->next_sibling(), &_subklass, subklass); 455 } 456 } 457 458 void Klass::clean_weak_klass_links(bool unloading_occurred, bool clean_alive_klasses) { 459 if (!ClassUnloading || !unloading_occurred) { 460 return; 461 } 462 463 Klass* root = SystemDictionary::Object_klass(); 464 Stack<Klass*, mtGC> stack; 465 466 stack.push(root); 467 while (!stack.is_empty()) { 468 Klass* current = stack.pop(); 469 470 assert(current->is_loader_alive(), "just checking, this should be live"); 471 472 // Find and set the first alive subklass 473 Klass* sub = current->subklass(true); 474 current->clean_subklass(); 475 if (sub != NULL) { 476 stack.push(sub); 477 } 478 479 // Find and set the first alive sibling 480 Klass* sibling = current->next_sibling(true); 481 current->set_next_sibling(sibling); 482 if (sibling != NULL) { 483 stack.push(sibling); 484 } 485 486 // Clean the implementors list and method data. 487 if (clean_alive_klasses && current->is_instance_klass()) { 488 InstanceKlass* ik = InstanceKlass::cast(current); 489 ik->clean_weak_instanceklass_links(); 490 491 // JVMTI RedefineClasses creates previous versions that are not in 492 // the class hierarchy, so process them here. 493 while ((ik = ik->previous_versions()) != NULL) { 494 ik->clean_weak_instanceklass_links(); 495 } 496 } 497 } 498 } 499 500 void Klass::metaspace_pointers_do(MetaspaceClosure* it) { 501 if (log_is_enabled(Trace, cds)) { 502 ResourceMark rm; 503 log_trace(cds)("Iter(Klass): %p (%s)", this, external_name()); 504 } 505 506 it->push(&_name); 507 it->push(&_secondary_super_cache); 508 it->push(&_secondary_supers); 509 for (int i = 0; i < _primary_super_limit; i++) { 510 it->push(&_primary_supers[i]); 511 } 512 it->push(&_super); 513 it->push((Klass**)&_subklass); 514 it->push((Klass**)&_next_sibling); 515 it->push(&_next_link); 516 517 vtableEntry* vt = start_of_vtable(); 518 for (int i=0; i<vtable_length(); i++) { 519 it->push(vt[i].method_addr()); 520 } 521 } 522 523 void Klass::remove_unshareable_info() { 524 assert (Arguments::is_dumping_archive(), 525 "only called during CDS dump time"); 526 JFR_ONLY(REMOVE_ID(this);) 527 if (log_is_enabled(Trace, cds, unshareable)) { 528 ResourceMark rm; 529 log_trace(cds, unshareable)("remove: %s", external_name()); 530 } 531 532 set_subklass(NULL); 533 set_next_sibling(NULL); 534 set_next_link(NULL); 535 536 // Null out class_loader_data because we don't share that yet. 537 set_class_loader_data(NULL); 538 set_is_shared(); 539 } 540 541 void Klass::remove_java_mirror() { 542 Arguments::assert_is_dumping_archive(); 543 if (log_is_enabled(Trace, cds, unshareable)) { 544 ResourceMark rm; 545 log_trace(cds, unshareable)("remove java_mirror: %s", external_name()); 546 } 547 // Just null out the mirror. The class_loader_data() no longer exists. 548 _java_mirror = NULL; 549 } 550 551 void Klass::restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS) { 552 assert(is_klass(), "ensure C++ vtable is restored"); 553 assert(is_shared(), "must be set"); 554 JFR_ONLY(RESTORE_ID(this);) 555 if (log_is_enabled(Trace, cds, unshareable)) { 556 ResourceMark rm; 557 log_trace(cds, unshareable)("restore: %s", external_name()); 558 } 559 560 // If an exception happened during CDS restore, some of these fields may already be 561 // set. We leave the class on the CLD list, even if incomplete so that we don't 562 // modify the CLD list outside a safepoint. 563 if (class_loader_data() == NULL) { 564 // Restore class_loader_data to the null class loader data 565 set_class_loader_data(loader_data); 566 567 // Workaround for suspected bug. Make sure other threads see this assignment. 568 // This shouldn't be necessary but the compiler thread seems to be behind 569 // the times, even though this thread takes MethodCompileQueue_lock and the thread 570 // that doesn't see this value also takes that lock. 571 OrderAccess::fence(); 572 573 // Add to null class loader list first before creating the mirror 574 // (same order as class file parsing) 575 loader_data->add_class(this); 576 } 577 578 Handle loader(THREAD, loader_data->class_loader()); 579 ModuleEntry* module_entry = NULL; 580 Klass* k = this; 581 if (k->is_objArray_klass()) { 582 k = ObjArrayKlass::cast(k)->bottom_klass(); 583 } 584 // Obtain klass' module. 585 if (k->is_instance_klass()) { 586 InstanceKlass* ik = (InstanceKlass*) k; 587 module_entry = ik->module(); 588 } else { 589 module_entry = ModuleEntryTable::javabase_moduleEntry(); 590 } 591 // Obtain java.lang.Module, if available 592 Handle module_handle(THREAD, ((module_entry != NULL) ? module_entry->module() : (oop)NULL)); 593 594 if (this->has_raw_archived_mirror()) { 595 ResourceMark rm; 596 log_debug(cds, mirror)("%s has raw archived mirror", external_name()); 597 if (HeapShared::open_archive_heap_region_mapped()) { 598 bool present = java_lang_Class::restore_archived_mirror(this, loader, module_handle, 599 protection_domain, 600 CHECK); 601 if (present) { 602 return; 603 } 604 } 605 606 // No archived mirror data 607 log_debug(cds, mirror)("No archived mirror data for %s", external_name()); 608 _java_mirror = NULL; 609 this->clear_has_raw_archived_mirror(); 610 } 611 612 // Only recreate it if not present. A previous attempt to restore may have 613 // gotten an OOM later but keep the mirror if it was created. 614 if (java_mirror() == NULL) { 615 log_trace(cds, mirror)("Recreate mirror for %s", external_name()); 616 java_lang_Class::create_mirror(this, loader, module_handle, protection_domain, CHECK); 617 } 618 } 619 620 #if INCLUDE_CDS_JAVA_HEAP 621 // Used at CDS dump time to access the archived mirror. No GC barrier. 622 oop Klass::archived_java_mirror_raw() { 623 assert(has_raw_archived_mirror(), "must have raw archived mirror"); 624 return CompressedOops::decode(_archived_mirror); 625 } 626 627 narrowOop Klass::archived_java_mirror_raw_narrow() { 628 assert(has_raw_archived_mirror(), "must have raw archived mirror"); 629 return _archived_mirror; 630 } 631 632 // No GC barrier 633 void Klass::set_archived_java_mirror_raw(oop m) { 634 assert(DumpSharedSpaces, "called only during runtime"); 635 _archived_mirror = CompressedOops::encode(m); 636 } 637 #endif // INCLUDE_CDS_JAVA_HEAP 638 639 Klass* Klass::array_klass_or_null(int rank) { 640 EXCEPTION_MARK; 641 // No exception can be thrown by array_klass_impl when called with or_null == true. 642 // (In anycase, the execption mark will fail if it do so) 643 return array_klass_impl(true, rank, THREAD); 644 } 645 646 647 Klass* Klass::array_klass_or_null() { 648 EXCEPTION_MARK; 649 // No exception can be thrown by array_klass_impl when called with or_null == true. 650 // (In anycase, the execption mark will fail if it do so) 651 return array_klass_impl(true, THREAD); 652 } 653 654 655 Klass* Klass::array_klass_impl(bool or_null, int rank, TRAPS) { 656 fatal("array_klass should be dispatched to InstanceKlass, ObjArrayKlass or TypeArrayKlass"); 657 return NULL; 658 } 659 660 661 Klass* Klass::array_klass_impl(bool or_null, TRAPS) { 662 fatal("array_klass should be dispatched to InstanceKlass, ObjArrayKlass or TypeArrayKlass"); 663 return NULL; 664 } 665 666 void Klass::check_array_allocation_length(int length, int max_length, TRAPS) { 667 if (length > max_length) { 668 if (!THREAD->in_retryable_allocation()) { 669 report_java_out_of_memory("Requested array size exceeds VM limit"); 670 JvmtiExport::post_array_size_exhausted(); 671 THROW_OOP(Universe::out_of_memory_error_array_size()); 672 } else { 673 THROW_OOP(Universe::out_of_memory_error_retry()); 674 } 675 } else if (length < 0) { 676 THROW_MSG(vmSymbols::java_lang_NegativeArraySizeException(), err_msg("%d", length)); 677 } 678 } 679 680 // In product mode, this function doesn't have virtual function calls so 681 // there might be some performance advantage to handling InstanceKlass here. 682 const char* Klass::external_name() const { 683 if (is_instance_klass()) { 684 const InstanceKlass* ik = static_cast<const InstanceKlass*>(this); 685 if (ik->is_unsafe_anonymous()) { 686 char addr_buf[20]; 687 jio_snprintf(addr_buf, 20, "/" INTPTR_FORMAT, p2i(ik)); 688 size_t addr_len = strlen(addr_buf); 689 size_t name_len = name()->utf8_length(); 690 char* result = NEW_RESOURCE_ARRAY(char, name_len + addr_len + 1); 691 name()->as_klass_external_name(result, (int) name_len + 1); 692 assert(strlen(result) == name_len, ""); 693 strcpy(result + name_len, addr_buf); 694 assert(strlen(result) == name_len + addr_len, ""); 695 return result; 696 } 697 } 698 if (name() == NULL) return "<unknown>"; 699 return name()->as_klass_external_name(); 700 } 701 702 const char* Klass::signature_name() const { 703 if (name() == NULL) return "<unknown>"; 704 return name()->as_C_string(); 705 } 706 707 const char* Klass::external_kind() const { 708 if (is_interface()) return "interface"; 709 if (is_abstract()) return "abstract class"; 710 return "class"; 711 } 712 713 // Unless overridden, modifier_flags is 0. 714 jint Klass::compute_modifier_flags(TRAPS) const { 715 return 0; 716 } 717 718 int Klass::atomic_incr_biased_lock_revocation_count() { 719 return (int) Atomic::add(1, &_biased_lock_revocation_count); 720 } 721 722 // Unless overridden, jvmti_class_status has no flags set. 723 jint Klass::jvmti_class_status() const { 724 return 0; 725 } 726 727 728 // Printing 729 730 void Klass::print_on(outputStream* st) const { 731 ResourceMark rm; 732 // print title 733 st->print("%s", internal_name()); 734 print_address_on(st); 735 st->cr(); 736 } 737 738 #define BULLET " - " 739 740 void Klass::oop_print_on(oop obj, outputStream* st) { 741 // print title 742 st->print_cr("%s ", internal_name()); 743 obj->print_address_on(st); 744 745 if (WizardMode) { 746 // print header 747 obj->mark().print_on(st); 748 st->cr(); 749 st->print(BULLET"prototype_header: " INTPTR_FORMAT, _prototype_header.value()); 750 st->cr(); 751 } 752 753 // print class 754 st->print(BULLET"klass: "); 755 obj->klass()->print_value_on(st); 756 st->cr(); 757 } 758 759 void Klass::oop_print_value_on(oop obj, outputStream* st) { 760 // print title 761 ResourceMark rm; // Cannot print in debug mode without this 762 st->print("%s", internal_name()); 763 obj->print_address_on(st); 764 } 765 766 #if INCLUDE_SERVICES 767 // Size Statistics 768 void Klass::collect_statistics(KlassSizeStats *sz) const { 769 sz->_klass_bytes = sz->count(this); 770 sz->_mirror_bytes = sz->count(java_mirror_no_keepalive()); 771 sz->_secondary_supers_bytes = sz->count_array(secondary_supers()); 772 773 sz->_ro_bytes += sz->_secondary_supers_bytes; 774 sz->_rw_bytes += sz->_klass_bytes + sz->_mirror_bytes; 775 } 776 #endif // INCLUDE_SERVICES 777 778 // Verification 779 780 void Klass::verify_on(outputStream* st) { 781 782 // This can be expensive, but it is worth checking that this klass is actually 783 // in the CLD graph but not in production. 784 assert(Metaspace::contains((address)this), "Should be"); 785 786 guarantee(this->is_klass(),"should be klass"); 787 788 if (super() != NULL) { 789 guarantee(super()->is_klass(), "should be klass"); 790 } 791 if (secondary_super_cache() != NULL) { 792 Klass* ko = secondary_super_cache(); 793 guarantee(ko->is_klass(), "should be klass"); 794 } 795 for ( uint i = 0; i < primary_super_limit(); i++ ) { 796 Klass* ko = _primary_supers[i]; 797 if (ko != NULL) { 798 guarantee(ko->is_klass(), "should be klass"); 799 } 800 } 801 802 if (java_mirror_no_keepalive() != NULL) { 803 guarantee(oopDesc::is_oop(java_mirror_no_keepalive()), "should be instance"); 804 } 805 } 806 807 void Klass::oop_verify_on(oop obj, outputStream* st) { 808 guarantee(oopDesc::is_oop(obj), "should be oop"); 809 guarantee(obj->klass()->is_klass(), "klass field is not a klass"); 810 } 811 812 bool Klass::is_valid(Klass* k) { 813 if (!is_aligned(k, sizeof(MetaWord))) return false; 814 if ((size_t)k < os::min_page_size()) return false; 815 816 if (!os::is_readable_range(k, k + 1)) return false; 817 if (!Metaspace::contains(k)) return false; 818 819 if (!Symbol::is_valid(k->name())) return false; 820 return ClassLoaderDataGraph::is_valid(k->class_loader_data()); 821 } 822 823 Method* Klass::method_at_vtable(int index) { 824 #ifndef PRODUCT 825 assert(index >= 0, "valid vtable index"); 826 if (DebugVtables) { 827 verify_vtable_index(index); 828 } 829 #endif 830 return start_of_vtable()[index].method(); 831 } 832 833 834 #ifndef PRODUCT 835 836 bool Klass::verify_vtable_index(int i) { 837 int limit = vtable_length()/vtableEntry::size(); 838 assert(i >= 0 && i < limit, "index %d out of bounds %d", i, limit); 839 return true; 840 } 841 842 #endif // PRODUCT 843 844 // Caller needs ResourceMark 845 // joint_in_module_of_loader provides an optimization if 2 classes are in 846 // the same module to succinctly print out relevant information about their 847 // module name and class loader's name_and_id for error messages. 848 // Format: 849 // <fully-qualified-external-class-name1> and <fully-qualified-external-class-name2> 850 // are in module <module-name>[@<version>] 851 // of loader <loader-name_and_id>[, parent loader <parent-loader-name_and_id>] 852 const char* Klass::joint_in_module_of_loader(const Klass* class2, bool include_parent_loader) const { 853 assert(module() == class2->module(), "classes do not have the same module"); 854 const char* class1_name = external_name(); 855 size_t len = strlen(class1_name) + 1; 856 857 const char* class2_description = class2->class_in_module_of_loader(true, include_parent_loader); 858 len += strlen(class2_description); 859 860 len += strlen(" and "); 861 862 char* joint_description = NEW_RESOURCE_ARRAY_RETURN_NULL(char, len); 863 864 // Just return the FQN if error when allocating string 865 if (joint_description == NULL) { 866 return class1_name; 867 } 868 869 jio_snprintf(joint_description, len, "%s and %s", 870 class1_name, 871 class2_description); 872 873 return joint_description; 874 } 875 876 // Caller needs ResourceMark 877 // class_in_module_of_loader provides a standard way to include 878 // relevant information about a class, such as its module name as 879 // well as its class loader's name_and_id, in error messages and logging. 880 // Format: 881 // <fully-qualified-external-class-name> is in module <module-name>[@<version>] 882 // of loader <loader-name_and_id>[, parent loader <parent-loader-name_and_id>] 883 const char* Klass::class_in_module_of_loader(bool use_are, bool include_parent_loader) const { 884 // 1. fully qualified external name of class 885 const char* klass_name = external_name(); 886 size_t len = strlen(klass_name) + 1; 887 888 // 2. module name + @version 889 const char* module_name = ""; 890 const char* version = ""; 891 bool has_version = false; 892 bool module_is_named = false; 893 const char* module_name_phrase = ""; 894 const Klass* bottom_klass = is_objArray_klass() ? 895 ObjArrayKlass::cast(this)->bottom_klass() : this; 896 if (bottom_klass->is_instance_klass()) { 897 ModuleEntry* module = InstanceKlass::cast(bottom_klass)->module(); 898 if (module->is_named()) { 899 module_is_named = true; 900 module_name_phrase = "module "; 901 module_name = module->name()->as_C_string(); 902 len += strlen(module_name); 903 // Use version if exists and is not a jdk module 904 if (module->should_show_version()) { 905 has_version = true; 906 version = module->version()->as_C_string(); 907 // Include stlen(version) + 1 for the "@" 908 len += strlen(version) + 1; 909 } 910 } else { 911 module_name = UNNAMED_MODULE; 912 len += UNNAMED_MODULE_LEN; 913 } 914 } else { 915 // klass is an array of primitives, module is java.base 916 module_is_named = true; 917 module_name_phrase = "module "; 918 module_name = JAVA_BASE_NAME; 919 len += JAVA_BASE_NAME_LEN; 920 } 921 922 // 3. class loader's name_and_id 923 ClassLoaderData* cld = class_loader_data(); 924 assert(cld != NULL, "class_loader_data should not be null"); 925 const char* loader_name_and_id = cld->loader_name_and_id(); 926 len += strlen(loader_name_and_id); 927 928 // 4. include parent loader information 929 const char* parent_loader_phrase = ""; 930 const char* parent_loader_name_and_id = ""; 931 if (include_parent_loader && 932 !cld->is_builtin_class_loader_data()) { 933 oop parent_loader = java_lang_ClassLoader::parent(class_loader()); 934 ClassLoaderData *parent_cld = ClassLoaderData::class_loader_data_or_null(parent_loader); 935 // The parent loader's ClassLoaderData could be null if it is 936 // a delegating class loader that has never defined a class. 937 // In this case the loader's name must be obtained via the parent loader's oop. 938 if (parent_cld == NULL) { 939 oop cl_name_and_id = java_lang_ClassLoader::nameAndId(parent_loader); 940 if (cl_name_and_id != NULL) { 941 parent_loader_name_and_id = java_lang_String::as_utf8_string(cl_name_and_id); 942 } 943 } else { 944 parent_loader_name_and_id = parent_cld->loader_name_and_id(); 945 } 946 parent_loader_phrase = ", parent loader "; 947 len += strlen(parent_loader_phrase) + strlen(parent_loader_name_and_id); 948 } 949 950 // Start to construct final full class description string 951 len += ((use_are) ? strlen(" are in ") : strlen(" is in ")); 952 len += strlen(module_name_phrase) + strlen(" of loader "); 953 954 char* class_description = NEW_RESOURCE_ARRAY_RETURN_NULL(char, len); 955 956 // Just return the FQN if error when allocating string 957 if (class_description == NULL) { 958 return klass_name; 959 } 960 961 jio_snprintf(class_description, len, "%s %s in %s%s%s%s of loader %s%s%s", 962 klass_name, 963 (use_are) ? "are" : "is", 964 module_name_phrase, 965 module_name, 966 (has_version) ? "@" : "", 967 (has_version) ? version : "", 968 loader_name_and_id, 969 parent_loader_phrase, 970 parent_loader_name_and_id); 971 972 return class_description; 973 }