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 "jvm.h" 27 #include "aot/aotLoader.hpp" 28 #include "classfile/classFileParser.hpp" 29 #include "classfile/classFileStream.hpp" 30 #include "classfile/classLoader.hpp" 31 #include "classfile/classLoaderData.inline.hpp" 32 #include "classfile/javaClasses.hpp" 33 #include "classfile/moduleEntry.hpp" 34 #include "classfile/systemDictionary.hpp" 35 #include "classfile/systemDictionaryShared.hpp" 36 #include "classfile/verifier.hpp" 37 #include "classfile/vmSymbols.hpp" 38 #include "code/dependencyContext.hpp" 39 #include "compiler/compileBroker.hpp" 40 #include "gc/shared/collectedHeap.inline.hpp" 41 #include "gc/shared/specialized_oop_closures.hpp" 42 #include "interpreter/oopMapCache.hpp" 43 #include "interpreter/rewriter.hpp" 44 #include "jvmtifiles/jvmti.h" 45 #include "logging/log.hpp" 46 #include "logging/logMessage.hpp" 47 #include "logging/logStream.hpp" 48 #include "memory/allocation.inline.hpp" 49 #include "memory/heapInspection.hpp" 50 #include "memory/iterator.inline.hpp" 51 #include "memory/metadataFactory.hpp" 52 #include "memory/metaspaceClosure.hpp" 53 #include "memory/metaspaceShared.hpp" 54 #include "memory/oopFactory.hpp" 55 #include "memory/resourceArea.hpp" 56 #include "oops/fieldStreams.hpp" 57 #include "oops/instanceClassLoaderKlass.hpp" 58 #include "oops/instanceKlass.inline.hpp" 59 #include "oops/instanceMirrorKlass.hpp" 60 #include "oops/instanceOop.hpp" 61 #include "oops/klass.inline.hpp" 62 #include "oops/method.hpp" 63 #include "oops/oop.inline.hpp" 64 #include "oops/symbol.hpp" 65 #include "prims/jvmtiExport.hpp" 66 #include "prims/jvmtiRedefineClasses.hpp" 67 #include "prims/jvmtiThreadState.hpp" 68 #include "prims/methodComparator.hpp" 69 #include "runtime/atomic.hpp" 70 #include "runtime/fieldDescriptor.hpp" 71 #include "runtime/handles.inline.hpp" 72 #include "runtime/javaCalls.hpp" 73 #include "runtime/mutexLocker.hpp" 74 #include "runtime/orderAccess.inline.hpp" 75 #include "runtime/thread.inline.hpp" 76 #include "services/classLoadingService.hpp" 77 #include "services/threadService.hpp" 78 #include "utilities/dtrace.hpp" 79 #include "utilities/macros.hpp" 80 #include "utilities/stringUtils.hpp" 81 #ifdef COMPILER1 82 #include "c1/c1_Compiler.hpp" 83 #endif 84 85 #ifdef DTRACE_ENABLED 86 87 88 #define HOTSPOT_CLASS_INITIALIZATION_required HOTSPOT_CLASS_INITIALIZATION_REQUIRED 89 #define HOTSPOT_CLASS_INITIALIZATION_recursive HOTSPOT_CLASS_INITIALIZATION_RECURSIVE 90 #define HOTSPOT_CLASS_INITIALIZATION_concurrent HOTSPOT_CLASS_INITIALIZATION_CONCURRENT 91 #define HOTSPOT_CLASS_INITIALIZATION_erroneous HOTSPOT_CLASS_INITIALIZATION_ERRONEOUS 92 #define HOTSPOT_CLASS_INITIALIZATION_super__failed HOTSPOT_CLASS_INITIALIZATION_SUPER_FAILED 93 #define HOTSPOT_CLASS_INITIALIZATION_clinit HOTSPOT_CLASS_INITIALIZATION_CLINIT 94 #define HOTSPOT_CLASS_INITIALIZATION_error HOTSPOT_CLASS_INITIALIZATION_ERROR 95 #define HOTSPOT_CLASS_INITIALIZATION_end HOTSPOT_CLASS_INITIALIZATION_END 96 #define DTRACE_CLASSINIT_PROBE(type, thread_type) \ 97 { \ 98 char* data = NULL; \ 99 int len = 0; \ 100 Symbol* clss_name = name(); \ 101 if (clss_name != NULL) { \ 102 data = (char*)clss_name->bytes(); \ 103 len = clss_name->utf8_length(); \ 104 } \ 105 HOTSPOT_CLASS_INITIALIZATION_##type( \ 106 data, len, (void*)class_loader(), thread_type); \ 107 } 108 109 #define DTRACE_CLASSINIT_PROBE_WAIT(type, thread_type, wait) \ 110 { \ 111 char* data = NULL; \ 112 int len = 0; \ 113 Symbol* clss_name = name(); \ 114 if (clss_name != NULL) { \ 115 data = (char*)clss_name->bytes(); \ 116 len = clss_name->utf8_length(); \ 117 } \ 118 HOTSPOT_CLASS_INITIALIZATION_##type( \ 119 data, len, (void*)class_loader(), thread_type, wait); \ 120 } 121 122 #else // ndef DTRACE_ENABLED 123 124 #define DTRACE_CLASSINIT_PROBE(type, thread_type) 125 #define DTRACE_CLASSINIT_PROBE_WAIT(type, thread_type, wait) 126 127 #endif // ndef DTRACE_ENABLED 128 129 static inline bool is_class_loader(const Symbol* class_name, 130 const ClassFileParser& parser) { 131 assert(class_name != NULL, "invariant"); 132 133 if (class_name == vmSymbols::java_lang_ClassLoader()) { 134 return true; 135 } 136 137 if (SystemDictionary::ClassLoader_klass_loaded()) { 138 const Klass* const super_klass = parser.super_klass(); 139 if (super_klass != NULL) { 140 if (super_klass->is_subtype_of(SystemDictionary::ClassLoader_klass())) { 141 return true; 142 } 143 } 144 } 145 return false; 146 } 147 148 InstanceKlass* InstanceKlass::allocate_instance_klass(const ClassFileParser& parser, TRAPS) { 149 const int size = InstanceKlass::size(parser.vtable_size(), 150 parser.itable_size(), 151 nonstatic_oop_map_size(parser.total_oop_map_count()), 152 parser.is_interface(), 153 parser.is_anonymous(), 154 should_store_fingerprint(parser.is_anonymous())); 155 156 const Symbol* const class_name = parser.class_name(); 157 assert(class_name != NULL, "invariant"); 158 ClassLoaderData* loader_data = parser.loader_data(); 159 assert(loader_data != NULL, "invariant"); 160 161 InstanceKlass* ik; 162 163 // Allocation 164 if (REF_NONE == parser.reference_type()) { 165 if (class_name == vmSymbols::java_lang_Class()) { 166 // mirror 167 ik = new (loader_data, size, THREAD) InstanceMirrorKlass(parser); 168 } 169 else if (is_class_loader(class_name, parser)) { 170 // class loader 171 ik = new (loader_data, size, THREAD) InstanceClassLoaderKlass(parser); 172 } 173 else { 174 // normal 175 ik = new (loader_data, size, THREAD) InstanceKlass(parser, InstanceKlass::_misc_kind_other); 176 } 177 } 178 else { 179 // reference 180 ik = new (loader_data, size, THREAD) InstanceRefKlass(parser); 181 } 182 183 // Check for pending exception before adding to the loader data and incrementing 184 // class count. Can get OOM here. 185 if (HAS_PENDING_EXCEPTION) { 186 return NULL; 187 } 188 189 return ik; 190 } 191 192 193 // copy method ordering from resource area to Metaspace 194 void InstanceKlass::copy_method_ordering(const intArray* m, TRAPS) { 195 if (m != NULL) { 196 // allocate a new array and copy contents (memcpy?) 197 _method_ordering = MetadataFactory::new_array<int>(class_loader_data(), m->length(), CHECK); 198 for (int i = 0; i < m->length(); i++) { 199 _method_ordering->at_put(i, m->at(i)); 200 } 201 } else { 202 _method_ordering = Universe::the_empty_int_array(); 203 } 204 } 205 206 // create a new array of vtable_indices for default methods 207 Array<int>* InstanceKlass::create_new_default_vtable_indices(int len, TRAPS) { 208 Array<int>* vtable_indices = MetadataFactory::new_array<int>(class_loader_data(), len, CHECK_NULL); 209 assert(default_vtable_indices() == NULL, "only create once"); 210 set_default_vtable_indices(vtable_indices); 211 return vtable_indices; 212 } 213 214 InstanceKlass::InstanceKlass(const ClassFileParser& parser, unsigned kind) : 215 _static_field_size(parser.static_field_size()), 216 _nonstatic_oop_map_size(nonstatic_oop_map_size(parser.total_oop_map_count())), 217 _itable_len(parser.itable_size()), 218 _reference_type(parser.reference_type()) { 219 set_vtable_length(parser.vtable_size()); 220 set_kind(kind); 221 set_access_flags(parser.access_flags()); 222 set_is_anonymous(parser.is_anonymous()); 223 set_layout_helper(Klass::instance_layout_helper(parser.layout_size(), 224 false)); 225 226 assert(NULL == _methods, "underlying memory not zeroed?"); 227 assert(is_instance_klass(), "is layout incorrect?"); 228 assert(size_helper() == parser.layout_size(), "incorrect size_helper?"); 229 } 230 231 void InstanceKlass::deallocate_methods(ClassLoaderData* loader_data, 232 Array<Method*>* methods) { 233 if (methods != NULL && methods != Universe::the_empty_method_array() && 234 !methods->is_shared()) { 235 for (int i = 0; i < methods->length(); i++) { 236 Method* method = methods->at(i); 237 if (method == NULL) continue; // maybe null if error processing 238 // Only want to delete methods that are not executing for RedefineClasses. 239 // The previous version will point to them so they're not totally dangling 240 assert (!method->on_stack(), "shouldn't be called with methods on stack"); 241 MetadataFactory::free_metadata(loader_data, method); 242 } 243 MetadataFactory::free_array<Method*>(loader_data, methods); 244 } 245 } 246 247 void InstanceKlass::deallocate_interfaces(ClassLoaderData* loader_data, 248 const Klass* super_klass, 249 Array<Klass*>* local_interfaces, 250 Array<Klass*>* transitive_interfaces) { 251 // Only deallocate transitive interfaces if not empty, same as super class 252 // or same as local interfaces. See code in parseClassFile. 253 Array<Klass*>* ti = transitive_interfaces; 254 if (ti != Universe::the_empty_klass_array() && ti != local_interfaces) { 255 // check that the interfaces don't come from super class 256 Array<Klass*>* sti = (super_klass == NULL) ? NULL : 257 InstanceKlass::cast(super_klass)->transitive_interfaces(); 258 if (ti != sti && ti != NULL && !ti->is_shared()) { 259 MetadataFactory::free_array<Klass*>(loader_data, ti); 260 } 261 } 262 263 // local interfaces can be empty 264 if (local_interfaces != Universe::the_empty_klass_array() && 265 local_interfaces != NULL && !local_interfaces->is_shared()) { 266 MetadataFactory::free_array<Klass*>(loader_data, local_interfaces); 267 } 268 } 269 270 // This function deallocates the metadata and C heap pointers that the 271 // InstanceKlass points to. 272 void InstanceKlass::deallocate_contents(ClassLoaderData* loader_data) { 273 274 // Orphan the mirror first, CMS thinks it's still live. 275 if (java_mirror() != NULL) { 276 java_lang_Class::set_klass(java_mirror(), NULL); 277 } 278 279 // Also remove mirror from handles 280 loader_data->remove_handle(_java_mirror); 281 282 // Need to take this class off the class loader data list. 283 loader_data->remove_class(this); 284 285 // The array_klass for this class is created later, after error handling. 286 // For class redefinition, we keep the original class so this scratch class 287 // doesn't have an array class. Either way, assert that there is nothing 288 // to deallocate. 289 assert(array_klasses() == NULL, "array classes shouldn't be created for this class yet"); 290 291 // Release C heap allocated data that this might point to, which includes 292 // reference counting symbol names. 293 release_C_heap_structures(); 294 295 deallocate_methods(loader_data, methods()); 296 set_methods(NULL); 297 298 if (method_ordering() != NULL && 299 method_ordering() != Universe::the_empty_int_array() && 300 !method_ordering()->is_shared()) { 301 MetadataFactory::free_array<int>(loader_data, method_ordering()); 302 } 303 set_method_ordering(NULL); 304 305 // default methods can be empty 306 if (default_methods() != NULL && 307 default_methods() != Universe::the_empty_method_array() && 308 !default_methods()->is_shared()) { 309 MetadataFactory::free_array<Method*>(loader_data, default_methods()); 310 } 311 // Do NOT deallocate the default methods, they are owned by superinterfaces. 312 set_default_methods(NULL); 313 314 // default methods vtable indices can be empty 315 if (default_vtable_indices() != NULL && 316 !default_vtable_indices()->is_shared()) { 317 MetadataFactory::free_array<int>(loader_data, default_vtable_indices()); 318 } 319 set_default_vtable_indices(NULL); 320 321 322 // This array is in Klass, but remove it with the InstanceKlass since 323 // this place would be the only caller and it can share memory with transitive 324 // interfaces. 325 if (secondary_supers() != NULL && 326 secondary_supers() != Universe::the_empty_klass_array() && 327 secondary_supers() != transitive_interfaces() && 328 !secondary_supers()->is_shared()) { 329 MetadataFactory::free_array<Klass*>(loader_data, secondary_supers()); 330 } 331 set_secondary_supers(NULL); 332 333 deallocate_interfaces(loader_data, super(), local_interfaces(), transitive_interfaces()); 334 set_transitive_interfaces(NULL); 335 set_local_interfaces(NULL); 336 337 if (fields() != NULL && !fields()->is_shared()) { 338 MetadataFactory::free_array<jushort>(loader_data, fields()); 339 } 340 set_fields(NULL, 0); 341 342 // If a method from a redefined class is using this constant pool, don't 343 // delete it, yet. The new class's previous version will point to this. 344 if (constants() != NULL) { 345 assert (!constants()->on_stack(), "shouldn't be called if anything is onstack"); 346 if (!constants()->is_shared()) { 347 MetadataFactory::free_metadata(loader_data, constants()); 348 } 349 // Delete any cached resolution errors for the constant pool 350 SystemDictionary::delete_resolution_error(constants()); 351 352 set_constants(NULL); 353 } 354 355 if (inner_classes() != NULL && 356 inner_classes() != Universe::the_empty_short_array() && 357 !inner_classes()->is_shared()) { 358 MetadataFactory::free_array<jushort>(loader_data, inner_classes()); 359 } 360 set_inner_classes(NULL); 361 362 // We should deallocate the Annotations instance if it's not in shared spaces. 363 if (annotations() != NULL && !annotations()->is_shared()) { 364 MetadataFactory::free_metadata(loader_data, annotations()); 365 } 366 set_annotations(NULL); 367 } 368 369 bool InstanceKlass::should_be_initialized() const { 370 return !is_initialized(); 371 } 372 373 klassItable InstanceKlass::itable() const { 374 return klassItable(const_cast<InstanceKlass*>(this)); 375 } 376 377 void InstanceKlass::eager_initialize(Thread *thread) { 378 if (!EagerInitialization) return; 379 380 if (this->is_not_initialized()) { 381 // abort if the the class has a class initializer 382 if (this->class_initializer() != NULL) return; 383 384 // abort if it is java.lang.Object (initialization is handled in genesis) 385 Klass* super_klass = super(); 386 if (super_klass == NULL) return; 387 388 // abort if the super class should be initialized 389 if (!InstanceKlass::cast(super_klass)->is_initialized()) return; 390 391 // call body to expose the this pointer 392 eager_initialize_impl(); 393 } 394 } 395 396 // JVMTI spec thinks there are signers and protection domain in the 397 // instanceKlass. These accessors pretend these fields are there. 398 // The hprof specification also thinks these fields are in InstanceKlass. 399 oop InstanceKlass::protection_domain() const { 400 // return the protection_domain from the mirror 401 return java_lang_Class::protection_domain(java_mirror()); 402 } 403 404 // To remove these from requires an incompatible change and CCC request. 405 objArrayOop InstanceKlass::signers() const { 406 // return the signers from the mirror 407 return java_lang_Class::signers(java_mirror()); 408 } 409 410 oop InstanceKlass::init_lock() const { 411 // return the init lock from the mirror 412 oop lock = java_lang_Class::init_lock(java_mirror()); 413 // Prevent reordering with any access of initialization state 414 OrderAccess::loadload(); 415 assert((oop)lock != NULL || !is_not_initialized(), // initialized or in_error state 416 "only fully initialized state can have a null lock"); 417 return lock; 418 } 419 420 // Set the initialization lock to null so the object can be GC'ed. Any racing 421 // threads to get this lock will see a null lock and will not lock. 422 // That's okay because they all check for initialized state after getting 423 // the lock and return. 424 void InstanceKlass::fence_and_clear_init_lock() { 425 // make sure previous stores are all done, notably the init_state. 426 OrderAccess::storestore(); 427 java_lang_Class::set_init_lock(java_mirror(), NULL); 428 assert(!is_not_initialized(), "class must be initialized now"); 429 } 430 431 void InstanceKlass::eager_initialize_impl() { 432 EXCEPTION_MARK; 433 HandleMark hm(THREAD); 434 Handle h_init_lock(THREAD, init_lock()); 435 ObjectLocker ol(h_init_lock, THREAD, h_init_lock() != NULL); 436 437 // abort if someone beat us to the initialization 438 if (!is_not_initialized()) return; // note: not equivalent to is_initialized() 439 440 ClassState old_state = init_state(); 441 link_class_impl(true, THREAD); 442 if (HAS_PENDING_EXCEPTION) { 443 CLEAR_PENDING_EXCEPTION; 444 // Abort if linking the class throws an exception. 445 446 // Use a test to avoid redundantly resetting the state if there's 447 // no change. Set_init_state() asserts that state changes make 448 // progress, whereas here we might just be spinning in place. 449 if (old_state != _init_state) 450 set_init_state(old_state); 451 } else { 452 // linking successfull, mark class as initialized 453 set_init_state(fully_initialized); 454 fence_and_clear_init_lock(); 455 // trace 456 if (log_is_enabled(Info, class, init)) { 457 ResourceMark rm(THREAD); 458 log_info(class, init)("[Initialized %s without side effects]", external_name()); 459 } 460 } 461 } 462 463 464 // See "The Virtual Machine Specification" section 2.16.5 for a detailed explanation of the class initialization 465 // process. The step comments refers to the procedure described in that section. 466 // Note: implementation moved to static method to expose the this pointer. 467 void InstanceKlass::initialize(TRAPS) { 468 if (this->should_be_initialized()) { 469 initialize_impl(CHECK); 470 // Note: at this point the class may be initialized 471 // OR it may be in the state of being initialized 472 // in case of recursive initialization! 473 } else { 474 assert(is_initialized(), "sanity check"); 475 } 476 } 477 478 479 bool InstanceKlass::verify_code(bool throw_verifyerror, TRAPS) { 480 // 1) Verify the bytecodes 481 Verifier::Mode mode = 482 throw_verifyerror ? Verifier::ThrowException : Verifier::NoException; 483 return Verifier::verify(this, mode, should_verify_class(), THREAD); 484 } 485 486 487 // Used exclusively by the shared spaces dump mechanism to prevent 488 // classes mapped into the shared regions in new VMs from appearing linked. 489 490 void InstanceKlass::unlink_class() { 491 assert(is_linked(), "must be linked"); 492 _init_state = loaded; 493 } 494 495 void InstanceKlass::link_class(TRAPS) { 496 assert(is_loaded(), "must be loaded"); 497 if (!is_linked()) { 498 link_class_impl(true, CHECK); 499 } 500 } 501 502 // Called to verify that a class can link during initialization, without 503 // throwing a VerifyError. 504 bool InstanceKlass::link_class_or_fail(TRAPS) { 505 assert(is_loaded(), "must be loaded"); 506 if (!is_linked()) { 507 link_class_impl(false, CHECK_false); 508 } 509 return is_linked(); 510 } 511 512 bool InstanceKlass::link_class_impl(bool throw_verifyerror, TRAPS) { 513 if (DumpSharedSpaces && is_in_error_state()) { 514 // This is for CDS dumping phase only -- we use the in_error_state to indicate that 515 // the class has failed verification. Throwing the NoClassDefFoundError here is just 516 // a convenient way to stop repeat attempts to verify the same (bad) class. 517 // 518 // Note that the NoClassDefFoundError is not part of the JLS, and should not be thrown 519 // if we are executing Java code. This is not a problem for CDS dumping phase since 520 // it doesn't execute any Java code. 521 ResourceMark rm(THREAD); 522 Exceptions::fthrow(THREAD_AND_LOCATION, 523 vmSymbols::java_lang_NoClassDefFoundError(), 524 "Class %s, or one of its supertypes, failed class initialization", 525 external_name()); 526 return false; 527 } 528 // return if already verified 529 if (is_linked()) { 530 return true; 531 } 532 533 // Timing 534 // timer handles recursion 535 assert(THREAD->is_Java_thread(), "non-JavaThread in link_class_impl"); 536 JavaThread* jt = (JavaThread*)THREAD; 537 538 // link super class before linking this class 539 Klass* super_klass = super(); 540 if (super_klass != NULL) { 541 if (super_klass->is_interface()) { // check if super class is an interface 542 ResourceMark rm(THREAD); 543 Exceptions::fthrow( 544 THREAD_AND_LOCATION, 545 vmSymbols::java_lang_IncompatibleClassChangeError(), 546 "class %s has interface %s as super class", 547 external_name(), 548 super_klass->external_name() 549 ); 550 return false; 551 } 552 553 InstanceKlass* ik_super = InstanceKlass::cast(super_klass); 554 ik_super->link_class_impl(throw_verifyerror, CHECK_false); 555 } 556 557 // link all interfaces implemented by this class before linking this class 558 Array<Klass*>* interfaces = local_interfaces(); 559 int num_interfaces = interfaces->length(); 560 for (int index = 0; index < num_interfaces; index++) { 561 InstanceKlass* interk = InstanceKlass::cast(interfaces->at(index)); 562 interk->link_class_impl(throw_verifyerror, CHECK_false); 563 } 564 565 // in case the class is linked in the process of linking its superclasses 566 if (is_linked()) { 567 return true; 568 } 569 570 // trace only the link time for this klass that includes 571 // the verification time 572 PerfClassTraceTime vmtimer(ClassLoader::perf_class_link_time(), 573 ClassLoader::perf_class_link_selftime(), 574 ClassLoader::perf_classes_linked(), 575 jt->get_thread_stat()->perf_recursion_counts_addr(), 576 jt->get_thread_stat()->perf_timers_addr(), 577 PerfClassTraceTime::CLASS_LINK); 578 579 // verification & rewriting 580 { 581 HandleMark hm(THREAD); 582 Handle h_init_lock(THREAD, init_lock()); 583 ObjectLocker ol(h_init_lock, THREAD, h_init_lock() != NULL); 584 // rewritten will have been set if loader constraint error found 585 // on an earlier link attempt 586 // don't verify or rewrite if already rewritten 587 // 588 589 if (!is_linked()) { 590 if (!is_rewritten()) { 591 { 592 bool verify_ok = verify_code(throw_verifyerror, THREAD); 593 if (!verify_ok) { 594 return false; 595 } 596 } 597 598 // Just in case a side-effect of verify linked this class already 599 // (which can sometimes happen since the verifier loads classes 600 // using custom class loaders, which are free to initialize things) 601 if (is_linked()) { 602 return true; 603 } 604 605 // also sets rewritten 606 rewrite_class(CHECK_false); 607 } else if (is_shared()) { 608 SystemDictionaryShared::check_verification_constraints(this, CHECK_false); 609 } 610 611 // relocate jsrs and link methods after they are all rewritten 612 link_methods(CHECK_false); 613 614 // Initialize the vtable and interface table after 615 // methods have been rewritten since rewrite may 616 // fabricate new Method*s. 617 // also does loader constraint checking 618 // 619 // initialize_vtable and initialize_itable need to be rerun for 620 // a shared class if the class is not loaded by the NULL classloader. 621 ClassLoaderData * loader_data = class_loader_data(); 622 if (!(is_shared() && 623 loader_data->is_the_null_class_loader_data())) { 624 ResourceMark rm(THREAD); 625 vtable().initialize_vtable(true, CHECK_false); 626 itable().initialize_itable(true, CHECK_false); 627 } 628 #ifdef ASSERT 629 else { 630 vtable().verify(tty, true); 631 // In case itable verification is ever added. 632 // itable().verify(tty, true); 633 } 634 #endif 635 set_init_state(linked); 636 if (JvmtiExport::should_post_class_prepare()) { 637 Thread *thread = THREAD; 638 assert(thread->is_Java_thread(), "thread->is_Java_thread()"); 639 JvmtiExport::post_class_prepare((JavaThread *) thread, this); 640 } 641 } 642 } 643 return true; 644 } 645 646 647 // Rewrite the byte codes of all of the methods of a class. 648 // The rewriter must be called exactly once. Rewriting must happen after 649 // verification but before the first method of the class is executed. 650 void InstanceKlass::rewrite_class(TRAPS) { 651 assert(is_loaded(), "must be loaded"); 652 if (is_rewritten()) { 653 assert(is_shared(), "rewriting an unshared class?"); 654 return; 655 } 656 Rewriter::rewrite(this, CHECK); 657 set_rewritten(); 658 } 659 660 // Now relocate and link method entry points after class is rewritten. 661 // This is outside is_rewritten flag. In case of an exception, it can be 662 // executed more than once. 663 void InstanceKlass::link_methods(TRAPS) { 664 int len = methods()->length(); 665 for (int i = len-1; i >= 0; i--) { 666 methodHandle m(THREAD, methods()->at(i)); 667 668 // Set up method entry points for compiler and interpreter . 669 m->link_method(m, CHECK); 670 } 671 } 672 673 // Eagerly initialize superinterfaces that declare default methods (concrete instance: any access) 674 void InstanceKlass::initialize_super_interfaces(TRAPS) { 675 assert (has_nonstatic_concrete_methods(), "caller should have checked this"); 676 for (int i = 0; i < local_interfaces()->length(); ++i) { 677 Klass* iface = local_interfaces()->at(i); 678 InstanceKlass* ik = InstanceKlass::cast(iface); 679 680 // Initialization is depth first search ie. we start with top of the inheritance tree 681 // has_nonstatic_concrete_methods drives searching superinterfaces since it 682 // means has_nonstatic_concrete_methods in its superinterface hierarchy 683 if (ik->has_nonstatic_concrete_methods()) { 684 ik->initialize_super_interfaces(CHECK); 685 } 686 687 // Only initialize() interfaces that "declare" concrete methods. 688 if (ik->should_be_initialized() && ik->declares_nonstatic_concrete_methods()) { 689 ik->initialize(CHECK); 690 } 691 } 692 } 693 694 void InstanceKlass::initialize_impl(TRAPS) { 695 HandleMark hm(THREAD); 696 697 // Make sure klass is linked (verified) before initialization 698 // A class could already be verified, since it has been reflected upon. 699 link_class(CHECK); 700 701 DTRACE_CLASSINIT_PROBE(required, -1); 702 703 bool wait = false; 704 705 // refer to the JVM book page 47 for description of steps 706 // Step 1 707 { 708 Handle h_init_lock(THREAD, init_lock()); 709 ObjectLocker ol(h_init_lock, THREAD, h_init_lock() != NULL); 710 711 Thread *self = THREAD; // it's passed the current thread 712 713 // Step 2 714 // If we were to use wait() instead of waitInterruptibly() then 715 // we might end up throwing IE from link/symbol resolution sites 716 // that aren't expected to throw. This would wreak havoc. See 6320309. 717 while(is_being_initialized() && !is_reentrant_initialization(self)) { 718 wait = true; 719 ol.waitUninterruptibly(CHECK); 720 } 721 722 // Step 3 723 if (is_being_initialized() && is_reentrant_initialization(self)) { 724 DTRACE_CLASSINIT_PROBE_WAIT(recursive, -1, wait); 725 return; 726 } 727 728 // Step 4 729 if (is_initialized()) { 730 DTRACE_CLASSINIT_PROBE_WAIT(concurrent, -1, wait); 731 return; 732 } 733 734 // Step 5 735 if (is_in_error_state()) { 736 DTRACE_CLASSINIT_PROBE_WAIT(erroneous, -1, wait); 737 ResourceMark rm(THREAD); 738 const char* desc = "Could not initialize class "; 739 const char* className = external_name(); 740 size_t msglen = strlen(desc) + strlen(className) + 1; 741 char* message = NEW_RESOURCE_ARRAY(char, msglen); 742 if (NULL == message) { 743 // Out of memory: can't create detailed error message 744 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), className); 745 } else { 746 jio_snprintf(message, msglen, "%s%s", desc, className); 747 THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), message); 748 } 749 } 750 751 // Step 6 752 set_init_state(being_initialized); 753 set_init_thread(self); 754 } 755 756 // Step 7 757 // Next, if C is a class rather than an interface, initialize it's super class and super 758 // interfaces. 759 if (!is_interface()) { 760 Klass* super_klass = super(); 761 if (super_klass != NULL && super_klass->should_be_initialized()) { 762 super_klass->initialize(THREAD); 763 } 764 // If C implements any interface that declares a non-static, concrete method, 765 // the initialization of C triggers initialization of its super interfaces. 766 // Only need to recurse if has_nonstatic_concrete_methods which includes declaring and 767 // having a superinterface that declares, non-static, concrete methods 768 if (!HAS_PENDING_EXCEPTION && has_nonstatic_concrete_methods()) { 769 initialize_super_interfaces(THREAD); 770 } 771 772 // If any exceptions, complete abruptly, throwing the same exception as above. 773 if (HAS_PENDING_EXCEPTION) { 774 Handle e(THREAD, PENDING_EXCEPTION); 775 CLEAR_PENDING_EXCEPTION; 776 { 777 EXCEPTION_MARK; 778 // Locks object, set state, and notify all waiting threads 779 set_initialization_state_and_notify(initialization_error, THREAD); 780 CLEAR_PENDING_EXCEPTION; 781 } 782 DTRACE_CLASSINIT_PROBE_WAIT(super__failed, -1, wait); 783 THROW_OOP(e()); 784 } 785 } 786 787 788 // Look for aot compiled methods for this klass, including class initializer. 789 AOTLoader::load_for_klass(this, THREAD); 790 791 // Step 8 792 { 793 assert(THREAD->is_Java_thread(), "non-JavaThread in initialize_impl"); 794 JavaThread* jt = (JavaThread*)THREAD; 795 DTRACE_CLASSINIT_PROBE_WAIT(clinit, -1, wait); 796 // Timer includes any side effects of class initialization (resolution, 797 // etc), but not recursive entry into call_class_initializer(). 798 PerfClassTraceTime timer(ClassLoader::perf_class_init_time(), 799 ClassLoader::perf_class_init_selftime(), 800 ClassLoader::perf_classes_inited(), 801 jt->get_thread_stat()->perf_recursion_counts_addr(), 802 jt->get_thread_stat()->perf_timers_addr(), 803 PerfClassTraceTime::CLASS_CLINIT); 804 call_class_initializer(THREAD); 805 } 806 807 // Step 9 808 if (!HAS_PENDING_EXCEPTION) { 809 set_initialization_state_and_notify(fully_initialized, CHECK); 810 { 811 debug_only(vtable().verify(tty, true);) 812 } 813 } 814 else { 815 // Step 10 and 11 816 Handle e(THREAD, PENDING_EXCEPTION); 817 CLEAR_PENDING_EXCEPTION; 818 // JVMTI has already reported the pending exception 819 // JVMTI internal flag reset is needed in order to report ExceptionInInitializerError 820 JvmtiExport::clear_detected_exception((JavaThread*)THREAD); 821 { 822 EXCEPTION_MARK; 823 set_initialization_state_and_notify(initialization_error, THREAD); 824 CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, class initialization error is thrown below 825 // JVMTI has already reported the pending exception 826 // JVMTI internal flag reset is needed in order to report ExceptionInInitializerError 827 JvmtiExport::clear_detected_exception((JavaThread*)THREAD); 828 } 829 DTRACE_CLASSINIT_PROBE_WAIT(error, -1, wait); 830 if (e->is_a(SystemDictionary::Error_klass())) { 831 THROW_OOP(e()); 832 } else { 833 JavaCallArguments args(e); 834 THROW_ARG(vmSymbols::java_lang_ExceptionInInitializerError(), 835 vmSymbols::throwable_void_signature(), 836 &args); 837 } 838 } 839 DTRACE_CLASSINIT_PROBE_WAIT(end, -1, wait); 840 } 841 842 843 void InstanceKlass::set_initialization_state_and_notify(ClassState state, TRAPS) { 844 Handle h_init_lock(THREAD, init_lock()); 845 if (h_init_lock() != NULL) { 846 ObjectLocker ol(h_init_lock, THREAD); 847 set_init_state(state); 848 fence_and_clear_init_lock(); 849 ol.notify_all(CHECK); 850 } else { 851 assert(h_init_lock() != NULL, "The initialization state should never be set twice"); 852 set_init_state(state); 853 } 854 } 855 856 // The embedded _implementor field can only record one implementor. 857 // When there are more than one implementors, the _implementor field 858 // is set to the interface Klass* itself. Following are the possible 859 // values for the _implementor field: 860 // NULL - no implementor 861 // implementor Klass* - one implementor 862 // self - more than one implementor 863 // 864 // The _implementor field only exists for interfaces. 865 void InstanceKlass::add_implementor(Klass* k) { 866 assert(Compile_lock->owned_by_self(), ""); 867 assert(is_interface(), "not interface"); 868 // Filter out my subinterfaces. 869 // (Note: Interfaces are never on the subklass list.) 870 if (InstanceKlass::cast(k)->is_interface()) return; 871 872 // Filter out subclasses whose supers already implement me. 873 // (Note: CHA must walk subclasses of direct implementors 874 // in order to locate indirect implementors.) 875 Klass* sk = k->super(); 876 if (sk != NULL && InstanceKlass::cast(sk)->implements_interface(this)) 877 // We only need to check one immediate superclass, since the 878 // implements_interface query looks at transitive_interfaces. 879 // Any supers of the super have the same (or fewer) transitive_interfaces. 880 return; 881 882 Klass* ik = implementor(); 883 if (ik == NULL) { 884 set_implementor(k); 885 } else if (ik != this) { 886 // There is already an implementor. Use itself as an indicator of 887 // more than one implementors. 888 set_implementor(this); 889 } 890 891 // The implementor also implements the transitive_interfaces 892 for (int index = 0; index < local_interfaces()->length(); index++) { 893 InstanceKlass::cast(local_interfaces()->at(index))->add_implementor(k); 894 } 895 } 896 897 void InstanceKlass::init_implementor() { 898 if (is_interface()) { 899 set_implementor(NULL); 900 } 901 } 902 903 904 void InstanceKlass::process_interfaces(Thread *thread) { 905 // link this class into the implementors list of every interface it implements 906 for (int i = local_interfaces()->length() - 1; i >= 0; i--) { 907 assert(local_interfaces()->at(i)->is_klass(), "must be a klass"); 908 InstanceKlass* interf = InstanceKlass::cast(local_interfaces()->at(i)); 909 assert(interf->is_interface(), "expected interface"); 910 interf->add_implementor(this); 911 } 912 } 913 914 bool InstanceKlass::can_be_primary_super_slow() const { 915 if (is_interface()) 916 return false; 917 else 918 return Klass::can_be_primary_super_slow(); 919 } 920 921 GrowableArray<Klass*>* InstanceKlass::compute_secondary_supers(int num_extra_slots, 922 Array<Klass*>* transitive_interfaces) { 923 // The secondaries are the implemented interfaces. 924 Array<Klass*>* interfaces = transitive_interfaces; 925 int num_secondaries = num_extra_slots + interfaces->length(); 926 if (num_secondaries == 0) { 927 // Must share this for correct bootstrapping! 928 set_secondary_supers(Universe::the_empty_klass_array()); 929 return NULL; 930 } else if (num_extra_slots == 0) { 931 // The secondary super list is exactly the same as the transitive interfaces. 932 // Redefine classes has to be careful not to delete this! 933 set_secondary_supers(interfaces); 934 return NULL; 935 } else { 936 // Copy transitive interfaces to a temporary growable array to be constructed 937 // into the secondary super list with extra slots. 938 GrowableArray<Klass*>* secondaries = new GrowableArray<Klass*>(interfaces->length()); 939 for (int i = 0; i < interfaces->length(); i++) { 940 secondaries->push(interfaces->at(i)); 941 } 942 return secondaries; 943 } 944 } 945 946 bool InstanceKlass::compute_is_subtype_of(Klass* k) { 947 if (k->is_interface()) { 948 return implements_interface(k); 949 } else { 950 return Klass::compute_is_subtype_of(k); 951 } 952 } 953 954 bool InstanceKlass::implements_interface(Klass* k) const { 955 if (this == k) return true; 956 assert(k->is_interface(), "should be an interface class"); 957 for (int i = 0; i < transitive_interfaces()->length(); i++) { 958 if (transitive_interfaces()->at(i) == k) { 959 return true; 960 } 961 } 962 return false; 963 } 964 965 bool InstanceKlass::is_same_or_direct_interface(Klass *k) const { 966 // Verify direct super interface 967 if (this == k) return true; 968 assert(k->is_interface(), "should be an interface class"); 969 for (int i = 0; i < local_interfaces()->length(); i++) { 970 if (local_interfaces()->at(i) == k) { 971 return true; 972 } 973 } 974 return false; 975 } 976 977 objArrayOop InstanceKlass::allocate_objArray(int n, int length, TRAPS) { 978 if (length < 0) THROW_0(vmSymbols::java_lang_NegativeArraySizeException()); 979 if (length > arrayOopDesc::max_array_length(T_OBJECT)) { 980 report_java_out_of_memory("Requested array size exceeds VM limit"); 981 JvmtiExport::post_array_size_exhausted(); 982 THROW_OOP_0(Universe::out_of_memory_error_array_size()); 983 } 984 int size = objArrayOopDesc::object_size(length); 985 Klass* ak = array_klass(n, CHECK_NULL); 986 objArrayOop o = 987 (objArrayOop)CollectedHeap::array_allocate(ak, size, length, CHECK_NULL); 988 return o; 989 } 990 991 instanceOop InstanceKlass::register_finalizer(instanceOop i, TRAPS) { 992 if (TraceFinalizerRegistration) { 993 tty->print("Registered "); 994 i->print_value_on(tty); 995 tty->print_cr(" (" INTPTR_FORMAT ") as finalizable", p2i(i)); 996 } 997 instanceHandle h_i(THREAD, i); 998 // Pass the handle as argument, JavaCalls::call expects oop as jobjects 999 JavaValue result(T_VOID); 1000 JavaCallArguments args(h_i); 1001 methodHandle mh (THREAD, Universe::finalizer_register_method()); 1002 JavaCalls::call(&result, mh, &args, CHECK_NULL); 1003 return h_i(); 1004 } 1005 1006 instanceOop InstanceKlass::allocate_instance(TRAPS) { 1007 bool has_finalizer_flag = has_finalizer(); // Query before possible GC 1008 int size = size_helper(); // Query before forming handle. 1009 1010 instanceOop i; 1011 1012 i = (instanceOop)CollectedHeap::obj_allocate(this, size, CHECK_NULL); 1013 if (has_finalizer_flag && !RegisterFinalizersAtInit) { 1014 i = register_finalizer(i, CHECK_NULL); 1015 } 1016 return i; 1017 } 1018 1019 instanceHandle InstanceKlass::allocate_instance_handle(TRAPS) { 1020 return instanceHandle(THREAD, allocate_instance(THREAD)); 1021 } 1022 1023 void InstanceKlass::check_valid_for_instantiation(bool throwError, TRAPS) { 1024 if (is_interface() || is_abstract()) { 1025 ResourceMark rm(THREAD); 1026 THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError() 1027 : vmSymbols::java_lang_InstantiationException(), external_name()); 1028 } 1029 if (this == SystemDictionary::Class_klass()) { 1030 ResourceMark rm(THREAD); 1031 THROW_MSG(throwError ? vmSymbols::java_lang_IllegalAccessError() 1032 : vmSymbols::java_lang_IllegalAccessException(), external_name()); 1033 } 1034 } 1035 1036 Klass* InstanceKlass::array_klass_impl(bool or_null, int n, TRAPS) { 1037 // Need load-acquire for lock-free read 1038 if (array_klasses_acquire() == NULL) { 1039 if (or_null) return NULL; 1040 1041 ResourceMark rm; 1042 JavaThread *jt = (JavaThread *)THREAD; 1043 { 1044 // Atomic creation of array_klasses 1045 MutexLocker mc(Compile_lock, THREAD); // for vtables 1046 MutexLocker ma(MultiArray_lock, THREAD); 1047 1048 // Check if update has already taken place 1049 if (array_klasses() == NULL) { 1050 Klass* k = ObjArrayKlass::allocate_objArray_klass(class_loader_data(), 1, this, CHECK_NULL); 1051 // use 'release' to pair with lock-free load 1052 release_set_array_klasses(k); 1053 } 1054 } 1055 } 1056 // _this will always be set at this point 1057 ObjArrayKlass* oak = (ObjArrayKlass*)array_klasses(); 1058 if (or_null) { 1059 return oak->array_klass_or_null(n); 1060 } 1061 return oak->array_klass(n, THREAD); 1062 } 1063 1064 Klass* InstanceKlass::array_klass_impl(bool or_null, TRAPS) { 1065 return array_klass_impl(or_null, 1, THREAD); 1066 } 1067 1068 static int call_class_initializer_counter = 0; // for debugging 1069 1070 Method* InstanceKlass::class_initializer() const { 1071 Method* clinit = find_method( 1072 vmSymbols::class_initializer_name(), vmSymbols::void_method_signature()); 1073 if (clinit != NULL && clinit->has_valid_initializer_flags()) { 1074 return clinit; 1075 } 1076 return NULL; 1077 } 1078 1079 void InstanceKlass::call_class_initializer(TRAPS) { 1080 if (ReplayCompiles && 1081 (ReplaySuppressInitializers == 1 || 1082 (ReplaySuppressInitializers >= 2 && class_loader() != NULL))) { 1083 // Hide the existence of the initializer for the purpose of replaying the compile 1084 return; 1085 } 1086 1087 methodHandle h_method(THREAD, class_initializer()); 1088 assert(!is_initialized(), "we cannot initialize twice"); 1089 LogTarget(Info, class, init) lt; 1090 if (lt.is_enabled()) { 1091 ResourceMark rm; 1092 LogStream ls(lt); 1093 ls.print("%d Initializing ", call_class_initializer_counter++); 1094 name()->print_value_on(&ls); 1095 ls.print_cr("%s (" INTPTR_FORMAT ")", h_method() == NULL ? "(no method)" : "", p2i(this)); 1096 } 1097 if (h_method() != NULL) { 1098 JavaCallArguments args; // No arguments 1099 JavaValue result(T_VOID); 1100 JavaCalls::call(&result, h_method, &args, CHECK); // Static call (no args) 1101 } 1102 } 1103 1104 1105 void InstanceKlass::mask_for(const methodHandle& method, int bci, 1106 InterpreterOopMap* entry_for) { 1107 // Lazily create the _oop_map_cache at first request 1108 // Lock-free access requires load_acquire. 1109 OopMapCache* oop_map_cache = OrderAccess::load_acquire(&_oop_map_cache); 1110 if (oop_map_cache == NULL) { 1111 MutexLocker x(OopMapCacheAlloc_lock); 1112 // Check if _oop_map_cache was allocated while we were waiting for this lock 1113 if ((oop_map_cache = _oop_map_cache) == NULL) { 1114 oop_map_cache = new OopMapCache(); 1115 // Ensure _oop_map_cache is stable, since it is examined without a lock 1116 OrderAccess::release_store(&_oop_map_cache, oop_map_cache); 1117 } 1118 } 1119 // _oop_map_cache is constant after init; lookup below does its own locking. 1120 oop_map_cache->lookup(method, bci, entry_for); 1121 } 1122 1123 1124 bool InstanceKlass::find_local_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const { 1125 for (JavaFieldStream fs(this); !fs.done(); fs.next()) { 1126 Symbol* f_name = fs.name(); 1127 Symbol* f_sig = fs.signature(); 1128 if (f_name == name && f_sig == sig) { 1129 fd->reinitialize(const_cast<InstanceKlass*>(this), fs.index()); 1130 return true; 1131 } 1132 } 1133 return false; 1134 } 1135 1136 1137 Klass* InstanceKlass::find_interface_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const { 1138 const int n = local_interfaces()->length(); 1139 for (int i = 0; i < n; i++) { 1140 Klass* intf1 = local_interfaces()->at(i); 1141 assert(intf1->is_interface(), "just checking type"); 1142 // search for field in current interface 1143 if (InstanceKlass::cast(intf1)->find_local_field(name, sig, fd)) { 1144 assert(fd->is_static(), "interface field must be static"); 1145 return intf1; 1146 } 1147 // search for field in direct superinterfaces 1148 Klass* intf2 = InstanceKlass::cast(intf1)->find_interface_field(name, sig, fd); 1149 if (intf2 != NULL) return intf2; 1150 } 1151 // otherwise field lookup fails 1152 return NULL; 1153 } 1154 1155 1156 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const { 1157 // search order according to newest JVM spec (5.4.3.2, p.167). 1158 // 1) search for field in current klass 1159 if (find_local_field(name, sig, fd)) { 1160 return const_cast<InstanceKlass*>(this); 1161 } 1162 // 2) search for field recursively in direct superinterfaces 1163 { Klass* intf = find_interface_field(name, sig, fd); 1164 if (intf != NULL) return intf; 1165 } 1166 // 3) apply field lookup recursively if superclass exists 1167 { Klass* supr = super(); 1168 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, fd); 1169 } 1170 // 4) otherwise field lookup fails 1171 return NULL; 1172 } 1173 1174 1175 Klass* InstanceKlass::find_field(Symbol* name, Symbol* sig, bool is_static, fieldDescriptor* fd) const { 1176 // search order according to newest JVM spec (5.4.3.2, p.167). 1177 // 1) search for field in current klass 1178 if (find_local_field(name, sig, fd)) { 1179 if (fd->is_static() == is_static) return const_cast<InstanceKlass*>(this); 1180 } 1181 // 2) search for field recursively in direct superinterfaces 1182 if (is_static) { 1183 Klass* intf = find_interface_field(name, sig, fd); 1184 if (intf != NULL) return intf; 1185 } 1186 // 3) apply field lookup recursively if superclass exists 1187 { Klass* supr = super(); 1188 if (supr != NULL) return InstanceKlass::cast(supr)->find_field(name, sig, is_static, fd); 1189 } 1190 // 4) otherwise field lookup fails 1191 return NULL; 1192 } 1193 1194 1195 bool InstanceKlass::find_local_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const { 1196 for (JavaFieldStream fs(this); !fs.done(); fs.next()) { 1197 if (fs.offset() == offset) { 1198 fd->reinitialize(const_cast<InstanceKlass*>(this), fs.index()); 1199 if (fd->is_static() == is_static) return true; 1200 } 1201 } 1202 return false; 1203 } 1204 1205 1206 bool InstanceKlass::find_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const { 1207 Klass* klass = const_cast<InstanceKlass*>(this); 1208 while (klass != NULL) { 1209 if (InstanceKlass::cast(klass)->find_local_field_from_offset(offset, is_static, fd)) { 1210 return true; 1211 } 1212 klass = klass->super(); 1213 } 1214 return false; 1215 } 1216 1217 1218 void InstanceKlass::methods_do(void f(Method* method)) { 1219 // Methods aren't stable until they are loaded. This can be read outside 1220 // a lock through the ClassLoaderData for profiling 1221 if (!is_loaded()) { 1222 return; 1223 } 1224 1225 int len = methods()->length(); 1226 for (int index = 0; index < len; index++) { 1227 Method* m = methods()->at(index); 1228 assert(m->is_method(), "must be method"); 1229 f(m); 1230 } 1231 } 1232 1233 1234 void InstanceKlass::do_local_static_fields(FieldClosure* cl) { 1235 for (JavaFieldStream fs(this); !fs.done(); fs.next()) { 1236 if (fs.access_flags().is_static()) { 1237 fieldDescriptor& fd = fs.field_descriptor(); 1238 cl->do_field(&fd); 1239 } 1240 } 1241 } 1242 1243 1244 void InstanceKlass::do_local_static_fields(void f(fieldDescriptor*, Handle, TRAPS), Handle mirror, TRAPS) { 1245 for (JavaFieldStream fs(this); !fs.done(); fs.next()) { 1246 if (fs.access_flags().is_static()) { 1247 fieldDescriptor& fd = fs.field_descriptor(); 1248 f(&fd, mirror, CHECK); 1249 } 1250 } 1251 } 1252 1253 1254 static int compare_fields_by_offset(int* a, int* b) { 1255 return a[0] - b[0]; 1256 } 1257 1258 void InstanceKlass::do_nonstatic_fields(FieldClosure* cl) { 1259 InstanceKlass* super = superklass(); 1260 if (super != NULL) { 1261 super->do_nonstatic_fields(cl); 1262 } 1263 fieldDescriptor fd; 1264 int length = java_fields_count(); 1265 // In DebugInfo nonstatic fields are sorted by offset. 1266 int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1), mtClass); 1267 int j = 0; 1268 for (int i = 0; i < length; i += 1) { 1269 fd.reinitialize(this, i); 1270 if (!fd.is_static()) { 1271 fields_sorted[j + 0] = fd.offset(); 1272 fields_sorted[j + 1] = i; 1273 j += 2; 1274 } 1275 } 1276 if (j > 0) { 1277 length = j; 1278 // _sort_Fn is defined in growableArray.hpp. 1279 qsort(fields_sorted, length/2, 2*sizeof(int), (_sort_Fn)compare_fields_by_offset); 1280 for (int i = 0; i < length; i += 2) { 1281 fd.reinitialize(this, fields_sorted[i + 1]); 1282 assert(!fd.is_static() && fd.offset() == fields_sorted[i], "only nonstatic fields"); 1283 cl->do_field(&fd); 1284 } 1285 } 1286 FREE_C_HEAP_ARRAY(int, fields_sorted); 1287 } 1288 1289 1290 void InstanceKlass::array_klasses_do(void f(Klass* k, TRAPS), TRAPS) { 1291 if (array_klasses() != NULL) 1292 ArrayKlass::cast(array_klasses())->array_klasses_do(f, THREAD); 1293 } 1294 1295 void InstanceKlass::array_klasses_do(void f(Klass* k)) { 1296 if (array_klasses() != NULL) 1297 ArrayKlass::cast(array_klasses())->array_klasses_do(f); 1298 } 1299 1300 #ifdef ASSERT 1301 static int linear_search(const Array<Method*>* methods, 1302 const Symbol* name, 1303 const Symbol* signature) { 1304 const int len = methods->length(); 1305 for (int index = 0; index < len; index++) { 1306 const Method* const m = methods->at(index); 1307 assert(m->is_method(), "must be method"); 1308 if (m->signature() == signature && m->name() == name) { 1309 return index; 1310 } 1311 } 1312 return -1; 1313 } 1314 #endif 1315 1316 static int binary_search(const Array<Method*>* methods, const Symbol* name) { 1317 int len = methods->length(); 1318 // methods are sorted, so do binary search 1319 int l = 0; 1320 int h = len - 1; 1321 while (l <= h) { 1322 int mid = (l + h) >> 1; 1323 Method* m = methods->at(mid); 1324 assert(m->is_method(), "must be method"); 1325 int res = m->name()->fast_compare(name); 1326 if (res == 0) { 1327 return mid; 1328 } else if (res < 0) { 1329 l = mid + 1; 1330 } else { 1331 h = mid - 1; 1332 } 1333 } 1334 return -1; 1335 } 1336 1337 // find_method looks up the name/signature in the local methods array 1338 Method* InstanceKlass::find_method(const Symbol* name, 1339 const Symbol* signature) const { 1340 return find_method_impl(name, signature, find_overpass, find_static, find_private); 1341 } 1342 1343 Method* InstanceKlass::find_method_impl(const Symbol* name, 1344 const Symbol* signature, 1345 OverpassLookupMode overpass_mode, 1346 StaticLookupMode static_mode, 1347 PrivateLookupMode private_mode) const { 1348 return InstanceKlass::find_method_impl(methods(), 1349 name, 1350 signature, 1351 overpass_mode, 1352 static_mode, 1353 private_mode); 1354 } 1355 1356 // find_instance_method looks up the name/signature in the local methods array 1357 // and skips over static methods 1358 Method* InstanceKlass::find_instance_method(const Array<Method*>* methods, 1359 const Symbol* name, 1360 const Symbol* signature) { 1361 Method* const meth = InstanceKlass::find_method_impl(methods, 1362 name, 1363 signature, 1364 find_overpass, 1365 skip_static, 1366 find_private); 1367 assert(((meth == NULL) || !meth->is_static()), 1368 "find_instance_method should have skipped statics"); 1369 return meth; 1370 } 1371 1372 // find_instance_method looks up the name/signature in the local methods array 1373 // and skips over static methods 1374 Method* InstanceKlass::find_instance_method(const Symbol* name, const Symbol* signature) const { 1375 return InstanceKlass::find_instance_method(methods(), name, signature); 1376 } 1377 1378 // Find looks up the name/signature in the local methods array 1379 // and filters on the overpass, static and private flags 1380 // This returns the first one found 1381 // note that the local methods array can have up to one overpass, one static 1382 // and one instance (private or not) with the same name/signature 1383 Method* InstanceKlass::find_local_method(const Symbol* name, 1384 const Symbol* signature, 1385 OverpassLookupMode overpass_mode, 1386 StaticLookupMode static_mode, 1387 PrivateLookupMode private_mode) const { 1388 return InstanceKlass::find_method_impl(methods(), 1389 name, 1390 signature, 1391 overpass_mode, 1392 static_mode, 1393 private_mode); 1394 } 1395 1396 // Find looks up the name/signature in the local methods array 1397 // and filters on the overpass, static and private flags 1398 // This returns the first one found 1399 // note that the local methods array can have up to one overpass, one static 1400 // and one instance (private or not) with the same name/signature 1401 Method* InstanceKlass::find_local_method(const Array<Method*>* methods, 1402 const Symbol* name, 1403 const Symbol* signature, 1404 OverpassLookupMode overpass_mode, 1405 StaticLookupMode static_mode, 1406 PrivateLookupMode private_mode) { 1407 return InstanceKlass::find_method_impl(methods, 1408 name, 1409 signature, 1410 overpass_mode, 1411 static_mode, 1412 private_mode); 1413 } 1414 1415 Method* InstanceKlass::find_method(const Array<Method*>* methods, 1416 const Symbol* name, 1417 const Symbol* signature) { 1418 return InstanceKlass::find_method_impl(methods, 1419 name, 1420 signature, 1421 find_overpass, 1422 find_static, 1423 find_private); 1424 } 1425 1426 Method* InstanceKlass::find_method_impl(const Array<Method*>* methods, 1427 const Symbol* name, 1428 const Symbol* signature, 1429 OverpassLookupMode overpass_mode, 1430 StaticLookupMode static_mode, 1431 PrivateLookupMode private_mode) { 1432 int hit = find_method_index(methods, name, signature, overpass_mode, static_mode, private_mode); 1433 return hit >= 0 ? methods->at(hit): NULL; 1434 } 1435 1436 // true if method matches signature and conforms to skipping_X conditions. 1437 static bool method_matches(const Method* m, 1438 const Symbol* signature, 1439 bool skipping_overpass, 1440 bool skipping_static, 1441 bool skipping_private) { 1442 return ((m->signature() == signature) && 1443 (!skipping_overpass || !m->is_overpass()) && 1444 (!skipping_static || !m->is_static()) && 1445 (!skipping_private || !m->is_private())); 1446 } 1447 1448 // Used directly for default_methods to find the index into the 1449 // default_vtable_indices, and indirectly by find_method 1450 // find_method_index looks in the local methods array to return the index 1451 // of the matching name/signature. If, overpass methods are being ignored, 1452 // the search continues to find a potential non-overpass match. This capability 1453 // is important during method resolution to prefer a static method, for example, 1454 // over an overpass method. 1455 // There is the possibility in any _method's array to have the same name/signature 1456 // for a static method, an overpass method and a local instance method 1457 // To correctly catch a given method, the search criteria may need 1458 // to explicitly skip the other two. For local instance methods, it 1459 // is often necessary to skip private methods 1460 int InstanceKlass::find_method_index(const Array<Method*>* methods, 1461 const Symbol* name, 1462 const Symbol* signature, 1463 OverpassLookupMode overpass_mode, 1464 StaticLookupMode static_mode, 1465 PrivateLookupMode private_mode) { 1466 const bool skipping_overpass = (overpass_mode == skip_overpass); 1467 const bool skipping_static = (static_mode == skip_static); 1468 const bool skipping_private = (private_mode == skip_private); 1469 const int hit = binary_search(methods, name); 1470 if (hit != -1) { 1471 const Method* const m = methods->at(hit); 1472 1473 // Do linear search to find matching signature. First, quick check 1474 // for common case, ignoring overpasses if requested. 1475 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) { 1476 return hit; 1477 } 1478 1479 // search downwards through overloaded methods 1480 int i; 1481 for (i = hit - 1; i >= 0; --i) { 1482 const Method* const m = methods->at(i); 1483 assert(m->is_method(), "must be method"); 1484 if (m->name() != name) { 1485 break; 1486 } 1487 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) { 1488 return i; 1489 } 1490 } 1491 // search upwards 1492 for (i = hit + 1; i < methods->length(); ++i) { 1493 const Method* const m = methods->at(i); 1494 assert(m->is_method(), "must be method"); 1495 if (m->name() != name) { 1496 break; 1497 } 1498 if (method_matches(m, signature, skipping_overpass, skipping_static, skipping_private)) { 1499 return i; 1500 } 1501 } 1502 // not found 1503 #ifdef ASSERT 1504 const int index = (skipping_overpass || skipping_static || skipping_private) ? -1 : 1505 linear_search(methods, name, signature); 1506 assert(-1 == index, "binary search should have found entry %d", index); 1507 #endif 1508 } 1509 return -1; 1510 } 1511 1512 int InstanceKlass::find_method_by_name(const Symbol* name, int* end) const { 1513 return find_method_by_name(methods(), name, end); 1514 } 1515 1516 int InstanceKlass::find_method_by_name(const Array<Method*>* methods, 1517 const Symbol* name, 1518 int* end_ptr) { 1519 assert(end_ptr != NULL, "just checking"); 1520 int start = binary_search(methods, name); 1521 int end = start + 1; 1522 if (start != -1) { 1523 while (start - 1 >= 0 && (methods->at(start - 1))->name() == name) --start; 1524 while (end < methods->length() && (methods->at(end))->name() == name) ++end; 1525 *end_ptr = end; 1526 return start; 1527 } 1528 return -1; 1529 } 1530 1531 // uncached_lookup_method searches both the local class methods array and all 1532 // superclasses methods arrays, skipping any overpass methods in superclasses. 1533 Method* InstanceKlass::uncached_lookup_method(const Symbol* name, 1534 const Symbol* signature, 1535 OverpassLookupMode overpass_mode) const { 1536 OverpassLookupMode overpass_local_mode = overpass_mode; 1537 const Klass* klass = this; 1538 while (klass != NULL) { 1539 Method* const method = InstanceKlass::cast(klass)->find_method_impl(name, 1540 signature, 1541 overpass_local_mode, 1542 find_static, 1543 find_private); 1544 if (method != NULL) { 1545 return method; 1546 } 1547 klass = klass->super(); 1548 overpass_local_mode = skip_overpass; // Always ignore overpass methods in superclasses 1549 } 1550 return NULL; 1551 } 1552 1553 #ifdef ASSERT 1554 // search through class hierarchy and return true if this class or 1555 // one of the superclasses was redefined 1556 bool InstanceKlass::has_redefined_this_or_super() const { 1557 const Klass* klass = this; 1558 while (klass != NULL) { 1559 if (InstanceKlass::cast(klass)->has_been_redefined()) { 1560 return true; 1561 } 1562 klass = klass->super(); 1563 } 1564 return false; 1565 } 1566 #endif 1567 1568 // lookup a method in the default methods list then in all transitive interfaces 1569 // Do NOT return private or static methods 1570 Method* InstanceKlass::lookup_method_in_ordered_interfaces(Symbol* name, 1571 Symbol* signature) const { 1572 Method* m = NULL; 1573 if (default_methods() != NULL) { 1574 m = find_method(default_methods(), name, signature); 1575 } 1576 // Look up interfaces 1577 if (m == NULL) { 1578 m = lookup_method_in_all_interfaces(name, signature, find_defaults); 1579 } 1580 return m; 1581 } 1582 1583 // lookup a method in all the interfaces that this class implements 1584 // Do NOT return private or static methods, new in JDK8 which are not externally visible 1585 // They should only be found in the initial InterfaceMethodRef 1586 Method* InstanceKlass::lookup_method_in_all_interfaces(Symbol* name, 1587 Symbol* signature, 1588 DefaultsLookupMode defaults_mode) const { 1589 Array<Klass*>* all_ifs = transitive_interfaces(); 1590 int num_ifs = all_ifs->length(); 1591 InstanceKlass *ik = NULL; 1592 for (int i = 0; i < num_ifs; i++) { 1593 ik = InstanceKlass::cast(all_ifs->at(i)); 1594 Method* m = ik->lookup_method(name, signature); 1595 if (m != NULL && m->is_public() && !m->is_static() && 1596 ((defaults_mode != skip_defaults) || !m->is_default_method())) { 1597 return m; 1598 } 1599 } 1600 return NULL; 1601 } 1602 1603 /* jni_id_for_impl for jfieldIds only */ 1604 JNIid* InstanceKlass::jni_id_for_impl(int offset) { 1605 MutexLocker ml(JfieldIdCreation_lock); 1606 // Retry lookup after we got the lock 1607 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset); 1608 if (probe == NULL) { 1609 // Slow case, allocate new static field identifier 1610 probe = new JNIid(this, offset, jni_ids()); 1611 set_jni_ids(probe); 1612 } 1613 return probe; 1614 } 1615 1616 1617 /* jni_id_for for jfieldIds only */ 1618 JNIid* InstanceKlass::jni_id_for(int offset) { 1619 JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset); 1620 if (probe == NULL) { 1621 probe = jni_id_for_impl(offset); 1622 } 1623 return probe; 1624 } 1625 1626 u2 InstanceKlass::enclosing_method_data(int offset) const { 1627 const Array<jushort>* const inner_class_list = inner_classes(); 1628 if (inner_class_list == NULL) { 1629 return 0; 1630 } 1631 const int length = inner_class_list->length(); 1632 if (length % inner_class_next_offset == 0) { 1633 return 0; 1634 } 1635 const int index = length - enclosing_method_attribute_size; 1636 assert(offset < enclosing_method_attribute_size, "invalid offset"); 1637 return inner_class_list->at(index + offset); 1638 } 1639 1640 void InstanceKlass::set_enclosing_method_indices(u2 class_index, 1641 u2 method_index) { 1642 Array<jushort>* inner_class_list = inner_classes(); 1643 assert (inner_class_list != NULL, "_inner_classes list is not set up"); 1644 int length = inner_class_list->length(); 1645 if (length % inner_class_next_offset == enclosing_method_attribute_size) { 1646 int index = length - enclosing_method_attribute_size; 1647 inner_class_list->at_put( 1648 index + enclosing_method_class_index_offset, class_index); 1649 inner_class_list->at_put( 1650 index + enclosing_method_method_index_offset, method_index); 1651 } 1652 } 1653 1654 // Lookup or create a jmethodID. 1655 // This code is called by the VMThread and JavaThreads so the 1656 // locking has to be done very carefully to avoid deadlocks 1657 // and/or other cache consistency problems. 1658 // 1659 jmethodID InstanceKlass::get_jmethod_id(const methodHandle& method_h) { 1660 size_t idnum = (size_t)method_h->method_idnum(); 1661 jmethodID* jmeths = methods_jmethod_ids_acquire(); 1662 size_t length = 0; 1663 jmethodID id = NULL; 1664 1665 // We use a double-check locking idiom here because this cache is 1666 // performance sensitive. In the normal system, this cache only 1667 // transitions from NULL to non-NULL which is safe because we use 1668 // release_set_methods_jmethod_ids() to advertise the new cache. 1669 // A partially constructed cache should never be seen by a racing 1670 // thread. We also use release_store() to save a new jmethodID 1671 // in the cache so a partially constructed jmethodID should never be 1672 // seen either. Cache reads of existing jmethodIDs proceed without a 1673 // lock, but cache writes of a new jmethodID requires uniqueness and 1674 // creation of the cache itself requires no leaks so a lock is 1675 // generally acquired in those two cases. 1676 // 1677 // If the RedefineClasses() API has been used, then this cache can 1678 // grow and we'll have transitions from non-NULL to bigger non-NULL. 1679 // Cache creation requires no leaks and we require safety between all 1680 // cache accesses and freeing of the old cache so a lock is generally 1681 // acquired when the RedefineClasses() API has been used. 1682 1683 if (jmeths != NULL) { 1684 // the cache already exists 1685 if (!idnum_can_increment()) { 1686 // the cache can't grow so we can just get the current values 1687 get_jmethod_id_length_value(jmeths, idnum, &length, &id); 1688 } else { 1689 // cache can grow so we have to be more careful 1690 if (Threads::number_of_threads() == 0 || 1691 SafepointSynchronize::is_at_safepoint()) { 1692 // we're single threaded or at a safepoint - no locking needed 1693 get_jmethod_id_length_value(jmeths, idnum, &length, &id); 1694 } else { 1695 MutexLocker ml(JmethodIdCreation_lock); 1696 get_jmethod_id_length_value(jmeths, idnum, &length, &id); 1697 } 1698 } 1699 } 1700 // implied else: 1701 // we need to allocate a cache so default length and id values are good 1702 1703 if (jmeths == NULL || // no cache yet 1704 length <= idnum || // cache is too short 1705 id == NULL) { // cache doesn't contain entry 1706 1707 // This function can be called by the VMThread so we have to do all 1708 // things that might block on a safepoint before grabbing the lock. 1709 // Otherwise, we can deadlock with the VMThread or have a cache 1710 // consistency issue. These vars keep track of what we might have 1711 // to free after the lock is dropped. 1712 jmethodID to_dealloc_id = NULL; 1713 jmethodID* to_dealloc_jmeths = NULL; 1714 1715 // may not allocate new_jmeths or use it if we allocate it 1716 jmethodID* new_jmeths = NULL; 1717 if (length <= idnum) { 1718 // allocate a new cache that might be used 1719 size_t size = MAX2(idnum+1, (size_t)idnum_allocated_count()); 1720 new_jmeths = NEW_C_HEAP_ARRAY(jmethodID, size+1, mtClass); 1721 memset(new_jmeths, 0, (size+1)*sizeof(jmethodID)); 1722 // cache size is stored in element[0], other elements offset by one 1723 new_jmeths[0] = (jmethodID)size; 1724 } 1725 1726 // allocate a new jmethodID that might be used 1727 jmethodID new_id = NULL; 1728 if (method_h->is_old() && !method_h->is_obsolete()) { 1729 // The method passed in is old (but not obsolete), we need to use the current version 1730 Method* current_method = method_with_idnum((int)idnum); 1731 assert(current_method != NULL, "old and but not obsolete, so should exist"); 1732 new_id = Method::make_jmethod_id(class_loader_data(), current_method); 1733 } else { 1734 // It is the current version of the method or an obsolete method, 1735 // use the version passed in 1736 new_id = Method::make_jmethod_id(class_loader_data(), method_h()); 1737 } 1738 1739 if (Threads::number_of_threads() == 0 || 1740 SafepointSynchronize::is_at_safepoint()) { 1741 // we're single threaded or at a safepoint - no locking needed 1742 id = get_jmethod_id_fetch_or_update(idnum, new_id, new_jmeths, 1743 &to_dealloc_id, &to_dealloc_jmeths); 1744 } else { 1745 MutexLocker ml(JmethodIdCreation_lock); 1746 id = get_jmethod_id_fetch_or_update(idnum, new_id, new_jmeths, 1747 &to_dealloc_id, &to_dealloc_jmeths); 1748 } 1749 1750 // The lock has been dropped so we can free resources. 1751 // Free up either the old cache or the new cache if we allocated one. 1752 if (to_dealloc_jmeths != NULL) { 1753 FreeHeap(to_dealloc_jmeths); 1754 } 1755 // free up the new ID since it wasn't needed 1756 if (to_dealloc_id != NULL) { 1757 Method::destroy_jmethod_id(class_loader_data(), to_dealloc_id); 1758 } 1759 } 1760 return id; 1761 } 1762 1763 // Figure out how many jmethodIDs haven't been allocated, and make 1764 // sure space for them is pre-allocated. This makes getting all 1765 // method ids much, much faster with classes with more than 8 1766 // methods, and has a *substantial* effect on performance with jvmti 1767 // code that loads all jmethodIDs for all classes. 1768 void InstanceKlass::ensure_space_for_methodids(int start_offset) { 1769 int new_jmeths = 0; 1770 int length = methods()->length(); 1771 for (int index = start_offset; index < length; index++) { 1772 Method* m = methods()->at(index); 1773 jmethodID id = m->find_jmethod_id_or_null(); 1774 if (id == NULL) { 1775 new_jmeths++; 1776 } 1777 } 1778 if (new_jmeths != 0) { 1779 Method::ensure_jmethod_ids(class_loader_data(), new_jmeths); 1780 } 1781 } 1782 1783 // Common code to fetch the jmethodID from the cache or update the 1784 // cache with the new jmethodID. This function should never do anything 1785 // that causes the caller to go to a safepoint or we can deadlock with 1786 // the VMThread or have cache consistency issues. 1787 // 1788 jmethodID InstanceKlass::get_jmethod_id_fetch_or_update( 1789 size_t idnum, jmethodID new_id, 1790 jmethodID* new_jmeths, jmethodID* to_dealloc_id_p, 1791 jmethodID** to_dealloc_jmeths_p) { 1792 assert(new_id != NULL, "sanity check"); 1793 assert(to_dealloc_id_p != NULL, "sanity check"); 1794 assert(to_dealloc_jmeths_p != NULL, "sanity check"); 1795 assert(Threads::number_of_threads() == 0 || 1796 SafepointSynchronize::is_at_safepoint() || 1797 JmethodIdCreation_lock->owned_by_self(), "sanity check"); 1798 1799 // reacquire the cache - we are locked, single threaded or at a safepoint 1800 jmethodID* jmeths = methods_jmethod_ids_acquire(); 1801 jmethodID id = NULL; 1802 size_t length = 0; 1803 1804 if (jmeths == NULL || // no cache yet 1805 (length = (size_t)jmeths[0]) <= idnum) { // cache is too short 1806 if (jmeths != NULL) { 1807 // copy any existing entries from the old cache 1808 for (size_t index = 0; index < length; index++) { 1809 new_jmeths[index+1] = jmeths[index+1]; 1810 } 1811 *to_dealloc_jmeths_p = jmeths; // save old cache for later delete 1812 } 1813 release_set_methods_jmethod_ids(jmeths = new_jmeths); 1814 } else { 1815 // fetch jmethodID (if any) from the existing cache 1816 id = jmeths[idnum+1]; 1817 *to_dealloc_jmeths_p = new_jmeths; // save new cache for later delete 1818 } 1819 if (id == NULL) { 1820 // No matching jmethodID in the existing cache or we have a new 1821 // cache or we just grew the cache. This cache write is done here 1822 // by the first thread to win the foot race because a jmethodID 1823 // needs to be unique once it is generally available. 1824 id = new_id; 1825 1826 // The jmethodID cache can be read while unlocked so we have to 1827 // make sure the new jmethodID is complete before installing it 1828 // in the cache. 1829 OrderAccess::release_store(&jmeths[idnum+1], id); 1830 } else { 1831 *to_dealloc_id_p = new_id; // save new id for later delete 1832 } 1833 return id; 1834 } 1835 1836 1837 // Common code to get the jmethodID cache length and the jmethodID 1838 // value at index idnum if there is one. 1839 // 1840 void InstanceKlass::get_jmethod_id_length_value(jmethodID* cache, 1841 size_t idnum, size_t *length_p, jmethodID* id_p) { 1842 assert(cache != NULL, "sanity check"); 1843 assert(length_p != NULL, "sanity check"); 1844 assert(id_p != NULL, "sanity check"); 1845 1846 // cache size is stored in element[0], other elements offset by one 1847 *length_p = (size_t)cache[0]; 1848 if (*length_p <= idnum) { // cache is too short 1849 *id_p = NULL; 1850 } else { 1851 *id_p = cache[idnum+1]; // fetch jmethodID (if any) 1852 } 1853 } 1854 1855 1856 // Lookup a jmethodID, NULL if not found. Do no blocking, no allocations, no handles 1857 jmethodID InstanceKlass::jmethod_id_or_null(Method* method) { 1858 size_t idnum = (size_t)method->method_idnum(); 1859 jmethodID* jmeths = methods_jmethod_ids_acquire(); 1860 size_t length; // length assigned as debugging crumb 1861 jmethodID id = NULL; 1862 if (jmeths != NULL && // If there is a cache 1863 (length = (size_t)jmeths[0]) > idnum) { // and if it is long enough, 1864 id = jmeths[idnum+1]; // Look up the id (may be NULL) 1865 } 1866 return id; 1867 } 1868 1869 inline DependencyContext InstanceKlass::dependencies() { 1870 DependencyContext dep_context(&_dep_context); 1871 return dep_context; 1872 } 1873 1874 int InstanceKlass::mark_dependent_nmethods(KlassDepChange& changes) { 1875 return dependencies().mark_dependent_nmethods(changes); 1876 } 1877 1878 void InstanceKlass::add_dependent_nmethod(nmethod* nm) { 1879 dependencies().add_dependent_nmethod(nm); 1880 } 1881 1882 void InstanceKlass::remove_dependent_nmethod(nmethod* nm, bool delete_immediately) { 1883 dependencies().remove_dependent_nmethod(nm, delete_immediately); 1884 } 1885 1886 #ifndef PRODUCT 1887 void InstanceKlass::print_dependent_nmethods(bool verbose) { 1888 dependencies().print_dependent_nmethods(verbose); 1889 } 1890 1891 bool InstanceKlass::is_dependent_nmethod(nmethod* nm) { 1892 return dependencies().is_dependent_nmethod(nm); 1893 } 1894 #endif //PRODUCT 1895 1896 void InstanceKlass::clean_weak_instanceklass_links() { 1897 clean_implementors_list(); 1898 clean_method_data(); 1899 1900 // Since GC iterates InstanceKlasses sequentially, it is safe to remove stale entries here. 1901 DependencyContext dep_context(&_dep_context); 1902 dep_context.expunge_stale_entries(); 1903 } 1904 1905 void InstanceKlass::clean_implementors_list() { 1906 assert(is_loader_alive(), "this klass should be live"); 1907 if (is_interface()) { 1908 if (ClassUnloading) { 1909 Klass* impl = implementor(); 1910 if (impl != NULL) { 1911 if (!impl->is_loader_alive()) { 1912 // remove this guy 1913 Klass** klass = adr_implementor(); 1914 assert(klass != NULL, "null klass"); 1915 if (klass != NULL) { 1916 *klass = NULL; 1917 } 1918 } 1919 } 1920 } 1921 } 1922 } 1923 1924 void InstanceKlass::clean_method_data() { 1925 for (int m = 0; m < methods()->length(); m++) { 1926 MethodData* mdo = methods()->at(m)->method_data(); 1927 if (mdo != NULL) { 1928 mdo->clean_method_data(/*always_clean*/false); 1929 } 1930 } 1931 } 1932 1933 bool InstanceKlass::supers_have_passed_fingerprint_checks() { 1934 if (java_super() != NULL && !java_super()->has_passed_fingerprint_check()) { 1935 ResourceMark rm; 1936 log_trace(class, fingerprint)("%s : super %s not fingerprinted", external_name(), java_super()->external_name()); 1937 return false; 1938 } 1939 1940 Array<Klass*>* local_interfaces = this->local_interfaces(); 1941 if (local_interfaces != NULL) { 1942 int length = local_interfaces->length(); 1943 for (int i = 0; i < length; i++) { 1944 InstanceKlass* intf = InstanceKlass::cast(local_interfaces->at(i)); 1945 if (!intf->has_passed_fingerprint_check()) { 1946 ResourceMark rm; 1947 log_trace(class, fingerprint)("%s : interface %s not fingerprinted", external_name(), intf->external_name()); 1948 return false; 1949 } 1950 } 1951 } 1952 1953 return true; 1954 } 1955 1956 bool InstanceKlass::should_store_fingerprint(bool is_anonymous) { 1957 #if INCLUDE_AOT 1958 // We store the fingerprint into the InstanceKlass only in the following 2 cases: 1959 if (CalculateClassFingerprint) { 1960 // (1) We are running AOT to generate a shared library. 1961 return true; 1962 } 1963 if (DumpSharedSpaces) { 1964 // (2) We are running -Xshare:dump to create a shared archive 1965 return true; 1966 } 1967 if (UseAOT && is_anonymous) { 1968 // (3) We are using AOT code from a shared library and see an anonymous class 1969 return true; 1970 } 1971 #endif 1972 1973 // In all other cases we might set the _misc_has_passed_fingerprint_check bit, 1974 // but do not store the 64-bit fingerprint to save space. 1975 return false; 1976 } 1977 1978 bool InstanceKlass::has_stored_fingerprint() const { 1979 #if INCLUDE_AOT 1980 return should_store_fingerprint() || is_shared(); 1981 #else 1982 return false; 1983 #endif 1984 } 1985 1986 uint64_t InstanceKlass::get_stored_fingerprint() const { 1987 address adr = adr_fingerprint(); 1988 if (adr != NULL) { 1989 return (uint64_t)Bytes::get_native_u8(adr); // adr may not be 64-bit aligned 1990 } 1991 return 0; 1992 } 1993 1994 void InstanceKlass::store_fingerprint(uint64_t fingerprint) { 1995 address adr = adr_fingerprint(); 1996 if (adr != NULL) { 1997 Bytes::put_native_u8(adr, (u8)fingerprint); // adr may not be 64-bit aligned 1998 1999 ResourceMark rm; 2000 log_trace(class, fingerprint)("stored as " PTR64_FORMAT " for class %s", fingerprint, external_name()); 2001 } 2002 } 2003 2004 void InstanceKlass::metaspace_pointers_do(MetaspaceClosure* it) { 2005 Klass::metaspace_pointers_do(it); 2006 2007 if (log_is_enabled(Trace, cds)) { 2008 ResourceMark rm; 2009 log_trace(cds)("Iter(InstanceKlass): %p (%s)", this, external_name()); 2010 } 2011 2012 it->push(&_annotations); 2013 it->push((Klass**)&_array_klasses); 2014 it->push(&_constants); 2015 it->push(&_inner_classes); 2016 it->push(&_array_name); 2017 #if INCLUDE_JVMTI 2018 it->push(&_previous_versions); 2019 #endif 2020 it->push(&_methods); 2021 it->push(&_default_methods); 2022 it->push(&_local_interfaces); 2023 it->push(&_transitive_interfaces); 2024 it->push(&_method_ordering); 2025 it->push(&_default_vtable_indices); 2026 it->push(&_fields); 2027 2028 if (itable_length() > 0) { 2029 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable(); 2030 int method_table_offset_in_words = ioe->offset()/wordSize; 2031 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words()) 2032 / itableOffsetEntry::size(); 2033 2034 for (int i = 0; i < nof_interfaces; i ++, ioe ++) { 2035 if (ioe->interface_klass() != NULL) { 2036 it->push(ioe->interface_klass_addr()); 2037 itableMethodEntry* ime = ioe->first_method_entry(this); 2038 int n = klassItable::method_count_for_interface(ioe->interface_klass()); 2039 for (int index = 0; index < n; index ++) { 2040 it->push(ime[index].method_addr()); 2041 } 2042 } 2043 } 2044 } 2045 } 2046 2047 void InstanceKlass::remove_unshareable_info() { 2048 Klass::remove_unshareable_info(); 2049 2050 if (is_in_error_state()) { 2051 // Classes are attempted to link during dumping and may fail, 2052 // but these classes are still in the dictionary and class list in CLD. 2053 // Check in_error state first because in_error is > linked state, so 2054 // is_linked() is true. 2055 // If there's a linking error, there is nothing else to remove. 2056 return; 2057 } 2058 2059 // Unlink the class 2060 if (is_linked()) { 2061 unlink_class(); 2062 } 2063 init_implementor(); 2064 2065 constants()->remove_unshareable_info(); 2066 2067 for (int i = 0; i < methods()->length(); i++) { 2068 Method* m = methods()->at(i); 2069 m->remove_unshareable_info(); 2070 } 2071 2072 // do array classes also. 2073 if (array_klasses() != NULL) { 2074 array_klasses()->remove_unshareable_info(); 2075 } 2076 2077 // These are not allocated from metaspace, but they should should all be empty 2078 // during dump time, so we don't need to worry about them in InstanceKlass::iterate(). 2079 guarantee(_source_debug_extension == NULL, "must be"); 2080 guarantee(_dep_context == DependencyContext::EMPTY, "must be"); 2081 guarantee(_osr_nmethods_head == NULL, "must be"); 2082 2083 #if INCLUDE_JVMTI 2084 guarantee(_breakpoints == NULL, "must be"); 2085 guarantee(_previous_versions == NULL, "must be"); 2086 #endif 2087 2088 _init_thread = NULL; 2089 _methods_jmethod_ids = NULL; 2090 _jni_ids = NULL; 2091 _oop_map_cache = NULL; 2092 } 2093 2094 void InstanceKlass::remove_java_mirror() { 2095 Klass::remove_java_mirror(); 2096 2097 // do array classes also. 2098 if (array_klasses() != NULL) { 2099 array_klasses()->remove_java_mirror(); 2100 } 2101 } 2102 2103 void InstanceKlass::restore_unshareable_info(ClassLoaderData* loader_data, Handle protection_domain, TRAPS) { 2104 set_package(loader_data, CHECK); 2105 Klass::restore_unshareable_info(loader_data, protection_domain, CHECK); 2106 2107 Array<Method*>* methods = this->methods(); 2108 int num_methods = methods->length(); 2109 for (int index2 = 0; index2 < num_methods; ++index2) { 2110 methodHandle m(THREAD, methods->at(index2)); 2111 m->restore_unshareable_info(CHECK); 2112 } 2113 if (JvmtiExport::has_redefined_a_class()) { 2114 // Reinitialize vtable because RedefineClasses may have changed some 2115 // entries in this vtable for super classes so the CDS vtable might 2116 // point to old or obsolete entries. RedefineClasses doesn't fix up 2117 // vtables in the shared system dictionary, only the main one. 2118 // It also redefines the itable too so fix that too. 2119 ResourceMark rm(THREAD); 2120 vtable().initialize_vtable(false, CHECK); 2121 itable().initialize_itable(false, CHECK); 2122 } 2123 2124 // restore constant pool resolved references 2125 constants()->restore_unshareable_info(CHECK); 2126 2127 if (array_klasses() != NULL) { 2128 // Array classes have null protection domain. 2129 // --> see ArrayKlass::complete_create_array_klass() 2130 array_klasses()->restore_unshareable_info(ClassLoaderData::the_null_class_loader_data(), Handle(), CHECK); 2131 } 2132 } 2133 2134 // returns true IFF is_in_error_state() has been changed as a result of this call. 2135 bool InstanceKlass::check_sharing_error_state() { 2136 assert(DumpSharedSpaces, "should only be called during dumping"); 2137 bool old_state = is_in_error_state(); 2138 2139 if (!is_in_error_state()) { 2140 bool bad = false; 2141 for (InstanceKlass* sup = java_super(); sup; sup = sup->java_super()) { 2142 if (sup->is_in_error_state()) { 2143 bad = true; 2144 break; 2145 } 2146 } 2147 if (!bad) { 2148 Array<Klass*>* interfaces = transitive_interfaces(); 2149 for (int i = 0; i < interfaces->length(); i++) { 2150 Klass* iface = interfaces->at(i); 2151 if (InstanceKlass::cast(iface)->is_in_error_state()) { 2152 bad = true; 2153 break; 2154 } 2155 } 2156 } 2157 2158 if (bad) { 2159 set_in_error_state(); 2160 } 2161 } 2162 2163 return (old_state != is_in_error_state()); 2164 } 2165 2166 #if INCLUDE_JVMTI 2167 static void clear_all_breakpoints(Method* m) { 2168 m->clear_all_breakpoints(); 2169 } 2170 #endif 2171 2172 void InstanceKlass::notify_unload_class(InstanceKlass* ik) { 2173 // notify the debugger 2174 if (JvmtiExport::should_post_class_unload()) { 2175 JvmtiExport::post_class_unload(ik); 2176 } 2177 2178 // notify ClassLoadingService of class unload 2179 ClassLoadingService::notify_class_unloaded(ik); 2180 } 2181 2182 void InstanceKlass::release_C_heap_structures(InstanceKlass* ik) { 2183 // Clean up C heap 2184 ik->release_C_heap_structures(); 2185 ik->constants()->release_C_heap_structures(); 2186 } 2187 2188 void InstanceKlass::release_C_heap_structures() { 2189 // Can't release the constant pool here because the constant pool can be 2190 // deallocated separately from the InstanceKlass for default methods and 2191 // redefine classes. 2192 2193 // Deallocate oop map cache 2194 if (_oop_map_cache != NULL) { 2195 delete _oop_map_cache; 2196 _oop_map_cache = NULL; 2197 } 2198 2199 // Deallocate JNI identifiers for jfieldIDs 2200 JNIid::deallocate(jni_ids()); 2201 set_jni_ids(NULL); 2202 2203 jmethodID* jmeths = methods_jmethod_ids_acquire(); 2204 if (jmeths != (jmethodID*)NULL) { 2205 release_set_methods_jmethod_ids(NULL); 2206 FreeHeap(jmeths); 2207 } 2208 2209 // Release dependencies. 2210 // It is desirable to use DC::remove_all_dependents() here, but, unfortunately, 2211 // it is not safe (see JDK-8143408). The problem is that the klass dependency 2212 // context can contain live dependencies, since there's a race between nmethod & 2213 // klass unloading. If the klass is dead when nmethod unloading happens, relevant 2214 // dependencies aren't removed from the context associated with the class (see 2215 // nmethod::flush_dependencies). It ends up during klass unloading as seemingly 2216 // live dependencies pointing to unloaded nmethods and causes a crash in 2217 // DC::remove_all_dependents() when it touches unloaded nmethod. 2218 dependencies().wipe(); 2219 2220 #if INCLUDE_JVMTI 2221 // Deallocate breakpoint records 2222 if (breakpoints() != 0x0) { 2223 methods_do(clear_all_breakpoints); 2224 assert(breakpoints() == 0x0, "should have cleared breakpoints"); 2225 } 2226 2227 // deallocate the cached class file 2228 if (_cached_class_file != NULL && !MetaspaceShared::is_in_shared_metaspace(_cached_class_file)) { 2229 os::free(_cached_class_file); 2230 _cached_class_file = NULL; 2231 } 2232 #endif 2233 2234 // Decrement symbol reference counts associated with the unloaded class. 2235 if (_name != NULL) _name->decrement_refcount(); 2236 // unreference array name derived from this class name (arrays of an unloaded 2237 // class can't be referenced anymore). 2238 if (_array_name != NULL) _array_name->decrement_refcount(); 2239 if (_source_debug_extension != NULL) FREE_C_HEAP_ARRAY(char, _source_debug_extension); 2240 } 2241 2242 void InstanceKlass::set_source_debug_extension(const char* array, int length) { 2243 if (array == NULL) { 2244 _source_debug_extension = NULL; 2245 } else { 2246 // Adding one to the attribute length in order to store a null terminator 2247 // character could cause an overflow because the attribute length is 2248 // already coded with an u4 in the classfile, but in practice, it's 2249 // unlikely to happen. 2250 assert((length+1) > length, "Overflow checking"); 2251 char* sde = NEW_C_HEAP_ARRAY(char, (length + 1), mtClass); 2252 for (int i = 0; i < length; i++) { 2253 sde[i] = array[i]; 2254 } 2255 sde[length] = '\0'; 2256 _source_debug_extension = sde; 2257 } 2258 } 2259 2260 const char* InstanceKlass::signature_name() const { 2261 int hash_len = 0; 2262 char hash_buf[40]; 2263 2264 // If this is an anonymous class, append a hash to make the name unique 2265 if (is_anonymous()) { 2266 intptr_t hash = (java_mirror() != NULL) ? java_mirror()->identity_hash() : 0; 2267 jio_snprintf(hash_buf, sizeof(hash_buf), "/" UINTX_FORMAT, (uintx)hash); 2268 hash_len = (int)strlen(hash_buf); 2269 } 2270 2271 // Get the internal name as a c string 2272 const char* src = (const char*) (name()->as_C_string()); 2273 const int src_length = (int)strlen(src); 2274 2275 char* dest = NEW_RESOURCE_ARRAY(char, src_length + hash_len + 3); 2276 2277 // Add L as type indicator 2278 int dest_index = 0; 2279 dest[dest_index++] = 'L'; 2280 2281 // Add the actual class name 2282 for (int src_index = 0; src_index < src_length; ) { 2283 dest[dest_index++] = src[src_index++]; 2284 } 2285 2286 // If we have a hash, append it 2287 for (int hash_index = 0; hash_index < hash_len; ) { 2288 dest[dest_index++] = hash_buf[hash_index++]; 2289 } 2290 2291 // Add the semicolon and the NULL 2292 dest[dest_index++] = ';'; 2293 dest[dest_index] = '\0'; 2294 return dest; 2295 } 2296 2297 // Used to obtain the package name from a fully qualified class name. 2298 Symbol* InstanceKlass::package_from_name(const Symbol* name, TRAPS) { 2299 if (name == NULL) { 2300 return NULL; 2301 } else { 2302 if (name->utf8_length() <= 0) { 2303 return NULL; 2304 } 2305 ResourceMark rm; 2306 const char* package_name = ClassLoader::package_from_name((const char*) name->as_C_string()); 2307 if (package_name == NULL) { 2308 return NULL; 2309 } 2310 Symbol* pkg_name = SymbolTable::new_symbol(package_name, THREAD); 2311 return pkg_name; 2312 } 2313 } 2314 2315 ModuleEntry* InstanceKlass::module() const { 2316 if (!in_unnamed_package()) { 2317 return _package_entry->module(); 2318 } 2319 const Klass* host = host_klass(); 2320 if (host == NULL) { 2321 return class_loader_data()->unnamed_module(); 2322 } 2323 return host->class_loader_data()->unnamed_module(); 2324 } 2325 2326 void InstanceKlass::set_package(ClassLoaderData* loader_data, TRAPS) { 2327 2328 // ensure java/ packages only loaded by boot or platform builtin loaders 2329 Handle class_loader(THREAD, loader_data->class_loader()); 2330 check_prohibited_package(name(), class_loader, CHECK); 2331 2332 TempNewSymbol pkg_name = package_from_name(name(), CHECK); 2333 2334 if (pkg_name != NULL && loader_data != NULL) { 2335 2336 // Find in class loader's package entry table. 2337 _package_entry = loader_data->packages()->lookup_only(pkg_name); 2338 2339 // If the package name is not found in the loader's package 2340 // entry table, it is an indication that the package has not 2341 // been defined. Consider it defined within the unnamed module. 2342 if (_package_entry == NULL) { 2343 ResourceMark rm; 2344 2345 if (!ModuleEntryTable::javabase_defined()) { 2346 // Before java.base is defined during bootstrapping, define all packages in 2347 // the java.base module. If a non-java.base package is erroneously placed 2348 // in the java.base module it will be caught later when java.base 2349 // is defined by ModuleEntryTable::verify_javabase_packages check. 2350 assert(ModuleEntryTable::javabase_moduleEntry() != NULL, JAVA_BASE_NAME " module is NULL"); 2351 _package_entry = loader_data->packages()->lookup(pkg_name, ModuleEntryTable::javabase_moduleEntry()); 2352 } else { 2353 assert(loader_data->unnamed_module() != NULL, "unnamed module is NULL"); 2354 _package_entry = loader_data->packages()->lookup(pkg_name, 2355 loader_data->unnamed_module()); 2356 } 2357 2358 // A package should have been successfully created 2359 assert(_package_entry != NULL, "Package entry for class %s not found, loader %s", 2360 name()->as_C_string(), loader_data->loader_name()); 2361 } 2362 2363 if (log_is_enabled(Debug, module)) { 2364 ResourceMark rm; 2365 ModuleEntry* m = _package_entry->module(); 2366 log_trace(module)("Setting package: class: %s, package: %s, loader: %s, module: %s", 2367 external_name(), 2368 pkg_name->as_C_string(), 2369 loader_data->loader_name(), 2370 (m->is_named() ? m->name()->as_C_string() : UNNAMED_MODULE)); 2371 } 2372 } else { 2373 ResourceMark rm; 2374 log_trace(module)("Setting package: class: %s, package: unnamed, loader: %s, module: %s", 2375 external_name(), 2376 (loader_data != NULL) ? loader_data->loader_name() : "NULL", 2377 UNNAMED_MODULE); 2378 } 2379 } 2380 2381 2382 // different versions of is_same_class_package 2383 2384 bool InstanceKlass::is_same_class_package(const Klass* class2) const { 2385 oop classloader1 = this->class_loader(); 2386 PackageEntry* classpkg1 = this->package(); 2387 if (class2->is_objArray_klass()) { 2388 class2 = ObjArrayKlass::cast(class2)->bottom_klass(); 2389 } 2390 2391 oop classloader2; 2392 PackageEntry* classpkg2; 2393 if (class2->is_instance_klass()) { 2394 classloader2 = class2->class_loader(); 2395 classpkg2 = class2->package(); 2396 } else { 2397 assert(class2->is_typeArray_klass(), "should be type array"); 2398 classloader2 = NULL; 2399 classpkg2 = NULL; 2400 } 2401 2402 // Same package is determined by comparing class loader 2403 // and package entries. Both must be the same. This rule 2404 // applies even to classes that are defined in the unnamed 2405 // package, they still must have the same class loader. 2406 if (oopDesc::equals(classloader1, classloader2) && (classpkg1 == classpkg2)) { 2407 return true; 2408 } 2409 2410 return false; 2411 } 2412 2413 // return true if this class and other_class are in the same package. Classloader 2414 // and classname information is enough to determine a class's package 2415 bool InstanceKlass::is_same_class_package(oop other_class_loader, 2416 const Symbol* other_class_name) const { 2417 if (!oopDesc::equals(class_loader(), other_class_loader)) { 2418 return false; 2419 } 2420 if (name()->fast_compare(other_class_name) == 0) { 2421 return true; 2422 } 2423 2424 { 2425 ResourceMark rm; 2426 2427 bool bad_class_name = false; 2428 const char* other_pkg = 2429 ClassLoader::package_from_name((const char*) other_class_name->as_C_string(), &bad_class_name); 2430 if (bad_class_name) { 2431 return false; 2432 } 2433 // Check that package_from_name() returns NULL, not "", if there is no package. 2434 assert(other_pkg == NULL || strlen(other_pkg) > 0, "package name is empty string"); 2435 2436 const Symbol* const this_package_name = 2437 this->package() != NULL ? this->package()->name() : NULL; 2438 2439 if (this_package_name == NULL || other_pkg == NULL) { 2440 // One of the two doesn't have a package. Only return true if the other 2441 // one also doesn't have a package. 2442 return (const char*)this_package_name == other_pkg; 2443 } 2444 2445 // Check if package is identical 2446 return this_package_name->equals(other_pkg); 2447 } 2448 } 2449 2450 // Returns true iff super_method can be overridden by a method in targetclassname 2451 // See JLS 3rd edition 8.4.6.1 2452 // Assumes name-signature match 2453 // "this" is InstanceKlass of super_method which must exist 2454 // note that the InstanceKlass of the method in the targetclassname has not always been created yet 2455 bool InstanceKlass::is_override(const methodHandle& super_method, Handle targetclassloader, Symbol* targetclassname, TRAPS) { 2456 // Private methods can not be overridden 2457 if (super_method->is_private()) { 2458 return false; 2459 } 2460 // If super method is accessible, then override 2461 if ((super_method->is_protected()) || 2462 (super_method->is_public())) { 2463 return true; 2464 } 2465 // Package-private methods are not inherited outside of package 2466 assert(super_method->is_package_private(), "must be package private"); 2467 return(is_same_class_package(targetclassloader(), targetclassname)); 2468 } 2469 2470 // Only boot and platform class loaders can define classes in "java/" packages. 2471 void InstanceKlass::check_prohibited_package(Symbol* class_name, 2472 Handle class_loader, 2473 TRAPS) { 2474 if (!class_loader.is_null() && 2475 !SystemDictionary::is_platform_class_loader(class_loader()) && 2476 class_name != NULL) { 2477 ResourceMark rm(THREAD); 2478 char* name = class_name->as_C_string(); 2479 if (strncmp(name, JAVAPKG, JAVAPKG_LEN) == 0 && name[JAVAPKG_LEN] == '/') { 2480 TempNewSymbol pkg_name = InstanceKlass::package_from_name(class_name, CHECK); 2481 assert(pkg_name != NULL, "Error in parsing package name starting with 'java/'"); 2482 name = pkg_name->as_C_string(); 2483 const char* class_loader_name = SystemDictionary::loader_name(class_loader()); 2484 StringUtils::replace_no_expand(name, "/", "."); 2485 const char* msg_text1 = "Class loader (instance of): "; 2486 const char* msg_text2 = " tried to load prohibited package name: "; 2487 size_t len = strlen(msg_text1) + strlen(class_loader_name) + strlen(msg_text2) + strlen(name) + 1; 2488 char* message = NEW_RESOURCE_ARRAY_IN_THREAD(THREAD, char, len); 2489 jio_snprintf(message, len, "%s%s%s%s", msg_text1, class_loader_name, msg_text2, name); 2490 THROW_MSG(vmSymbols::java_lang_SecurityException(), message); 2491 } 2492 } 2493 return; 2494 } 2495 2496 // tell if two classes have the same enclosing class (at package level) 2497 bool InstanceKlass::is_same_package_member(const Klass* class2, TRAPS) const { 2498 if (class2 == this) return true; 2499 if (!class2->is_instance_klass()) return false; 2500 2501 // must be in same package before we try anything else 2502 if (!is_same_class_package(class2)) 2503 return false; 2504 2505 // As long as there is an outer_this.getEnclosingClass, 2506 // shift the search outward. 2507 const InstanceKlass* outer_this = this; 2508 for (;;) { 2509 // As we walk along, look for equalities between outer_this and class2. 2510 // Eventually, the walks will terminate as outer_this stops 2511 // at the top-level class around the original class. 2512 bool ignore_inner_is_member; 2513 const Klass* next = outer_this->compute_enclosing_class(&ignore_inner_is_member, 2514 CHECK_false); 2515 if (next == NULL) break; 2516 if (next == class2) return true; 2517 outer_this = InstanceKlass::cast(next); 2518 } 2519 2520 // Now do the same for class2. 2521 const InstanceKlass* outer2 = InstanceKlass::cast(class2); 2522 for (;;) { 2523 bool ignore_inner_is_member; 2524 Klass* next = outer2->compute_enclosing_class(&ignore_inner_is_member, 2525 CHECK_false); 2526 if (next == NULL) break; 2527 // Might as well check the new outer against all available values. 2528 if (next == this) return true; 2529 if (next == outer_this) return true; 2530 outer2 = InstanceKlass::cast(next); 2531 } 2532 2533 // If by this point we have not found an equality between the 2534 // two classes, we know they are in separate package members. 2535 return false; 2536 } 2537 2538 bool InstanceKlass::find_inner_classes_attr(int* ooff, int* noff, TRAPS) const { 2539 constantPoolHandle i_cp(THREAD, constants()); 2540 for (InnerClassesIterator iter(this); !iter.done(); iter.next()) { 2541 int ioff = iter.inner_class_info_index(); 2542 if (ioff != 0) { 2543 // Check to see if the name matches the class we're looking for 2544 // before attempting to find the class. 2545 if (i_cp->klass_name_at_matches(this, ioff)) { 2546 Klass* inner_klass = i_cp->klass_at(ioff, CHECK_false); 2547 if (this == inner_klass) { 2548 *ooff = iter.outer_class_info_index(); 2549 *noff = iter.inner_name_index(); 2550 return true; 2551 } 2552 } 2553 } 2554 } 2555 return false; 2556 } 2557 2558 InstanceKlass* InstanceKlass::compute_enclosing_class(bool* inner_is_member, TRAPS) const { 2559 InstanceKlass* outer_klass = NULL; 2560 *inner_is_member = false; 2561 int ooff = 0, noff = 0; 2562 bool has_inner_classes_attr = find_inner_classes_attr(&ooff, &noff, THREAD); 2563 if (has_inner_classes_attr) { 2564 constantPoolHandle i_cp(THREAD, constants()); 2565 if (ooff != 0) { 2566 Klass* ok = i_cp->klass_at(ooff, CHECK_NULL); 2567 outer_klass = InstanceKlass::cast(ok); 2568 *inner_is_member = true; 2569 } 2570 if (NULL == outer_klass) { 2571 // It may be anonymous; try for that. 2572 int encl_method_class_idx = enclosing_method_class_index(); 2573 if (encl_method_class_idx != 0) { 2574 Klass* ok = i_cp->klass_at(encl_method_class_idx, CHECK_NULL); 2575 outer_klass = InstanceKlass::cast(ok); 2576 *inner_is_member = false; 2577 } 2578 } 2579 } 2580 2581 // If no inner class attribute found for this class. 2582 if (NULL == outer_klass) return NULL; 2583 2584 // Throws an exception if outer klass has not declared k as an inner klass 2585 // We need evidence that each klass knows about the other, or else 2586 // the system could allow a spoof of an inner class to gain access rights. 2587 Reflection::check_for_inner_class(outer_klass, this, *inner_is_member, CHECK_NULL); 2588 return outer_klass; 2589 } 2590 2591 jint InstanceKlass::compute_modifier_flags(TRAPS) const { 2592 jint access = access_flags().as_int(); 2593 2594 // But check if it happens to be member class. 2595 InnerClassesIterator iter(this); 2596 for (; !iter.done(); iter.next()) { 2597 int ioff = iter.inner_class_info_index(); 2598 // Inner class attribute can be zero, skip it. 2599 // Strange but true: JVM spec. allows null inner class refs. 2600 if (ioff == 0) continue; 2601 2602 // only look at classes that are already loaded 2603 // since we are looking for the flags for our self. 2604 Symbol* inner_name = constants()->klass_name_at(ioff); 2605 if (name() == inner_name) { 2606 // This is really a member class. 2607 access = iter.inner_access_flags(); 2608 break; 2609 } 2610 } 2611 // Remember to strip ACC_SUPER bit 2612 return (access & (~JVM_ACC_SUPER)) & JVM_ACC_WRITTEN_FLAGS; 2613 } 2614 2615 jint InstanceKlass::jvmti_class_status() const { 2616 jint result = 0; 2617 2618 if (is_linked()) { 2619 result |= JVMTI_CLASS_STATUS_VERIFIED | JVMTI_CLASS_STATUS_PREPARED; 2620 } 2621 2622 if (is_initialized()) { 2623 assert(is_linked(), "Class status is not consistent"); 2624 result |= JVMTI_CLASS_STATUS_INITIALIZED; 2625 } 2626 if (is_in_error_state()) { 2627 result |= JVMTI_CLASS_STATUS_ERROR; 2628 } 2629 return result; 2630 } 2631 2632 Method* InstanceKlass::method_at_itable(Klass* holder, int index, TRAPS) { 2633 itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable(); 2634 int method_table_offset_in_words = ioe->offset()/wordSize; 2635 int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words()) 2636 / itableOffsetEntry::size(); 2637 2638 for (int cnt = 0 ; ; cnt ++, ioe ++) { 2639 // If the interface isn't implemented by the receiver class, 2640 // the VM should throw IncompatibleClassChangeError. 2641 if (cnt >= nof_interfaces) { 2642 THROW_NULL(vmSymbols::java_lang_IncompatibleClassChangeError()); 2643 } 2644 2645 Klass* ik = ioe->interface_klass(); 2646 if (ik == holder) break; 2647 } 2648 2649 itableMethodEntry* ime = ioe->first_method_entry(this); 2650 Method* m = ime[index].method(); 2651 if (m == NULL) { 2652 THROW_NULL(vmSymbols::java_lang_AbstractMethodError()); 2653 } 2654 return m; 2655 } 2656 2657 2658 #if INCLUDE_JVMTI 2659 // update default_methods for redefineclasses for methods that are 2660 // not yet in the vtable due to concurrent subclass define and superinterface 2661 // redefinition 2662 // Note: those in the vtable, should have been updated via adjust_method_entries 2663 void InstanceKlass::adjust_default_methods(InstanceKlass* holder, bool* trace_name_printed) { 2664 // search the default_methods for uses of either obsolete or EMCP methods 2665 if (default_methods() != NULL) { 2666 for (int index = 0; index < default_methods()->length(); index ++) { 2667 Method* old_method = default_methods()->at(index); 2668 if (old_method == NULL || old_method->method_holder() != holder || !old_method->is_old()) { 2669 continue; // skip uninteresting entries 2670 } 2671 assert(!old_method->is_deleted(), "default methods may not be deleted"); 2672 2673 Method* new_method = holder->method_with_idnum(old_method->orig_method_idnum()); 2674 2675 assert(new_method != NULL, "method_with_idnum() should not be NULL"); 2676 assert(old_method != new_method, "sanity check"); 2677 2678 default_methods()->at_put(index, new_method); 2679 if (log_is_enabled(Info, redefine, class, update)) { 2680 ResourceMark rm; 2681 if (!(*trace_name_printed)) { 2682 log_info(redefine, class, update) 2683 ("adjust: klassname=%s default methods from name=%s", 2684 external_name(), old_method->method_holder()->external_name()); 2685 *trace_name_printed = true; 2686 } 2687 log_debug(redefine, class, update, vtables) 2688 ("default method update: %s(%s) ", 2689 new_method->name()->as_C_string(), new_method->signature()->as_C_string()); 2690 } 2691 } 2692 } 2693 } 2694 #endif // INCLUDE_JVMTI 2695 2696 // On-stack replacement stuff 2697 void InstanceKlass::add_osr_nmethod(nmethod* n) { 2698 // only one compilation can be active 2699 { 2700 // This is a short non-blocking critical region, so the no safepoint check is ok. 2701 MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag); 2702 assert(n->is_osr_method(), "wrong kind of nmethod"); 2703 n->set_osr_link(osr_nmethods_head()); 2704 set_osr_nmethods_head(n); 2705 // Raise the highest osr level if necessary 2706 if (TieredCompilation) { 2707 Method* m = n->method(); 2708 m->set_highest_osr_comp_level(MAX2(m->highest_osr_comp_level(), n->comp_level())); 2709 } 2710 } 2711 2712 // Get rid of the osr methods for the same bci that have lower levels. 2713 if (TieredCompilation) { 2714 for (int l = CompLevel_limited_profile; l < n->comp_level(); l++) { 2715 nmethod *inv = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), l, true); 2716 if (inv != NULL && inv->is_in_use()) { 2717 inv->make_not_entrant(); 2718 } 2719 } 2720 } 2721 } 2722 2723 // Remove osr nmethod from the list. Return true if found and removed. 2724 bool InstanceKlass::remove_osr_nmethod(nmethod* n) { 2725 // This is a short non-blocking critical region, so the no safepoint check is ok. 2726 MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag); 2727 assert(n->is_osr_method(), "wrong kind of nmethod"); 2728 nmethod* last = NULL; 2729 nmethod* cur = osr_nmethods_head(); 2730 int max_level = CompLevel_none; // Find the max comp level excluding n 2731 Method* m = n->method(); 2732 // Search for match 2733 bool found = false; 2734 while(cur != NULL && cur != n) { 2735 if (TieredCompilation && m == cur->method()) { 2736 // Find max level before n 2737 max_level = MAX2(max_level, cur->comp_level()); 2738 } 2739 last = cur; 2740 cur = cur->osr_link(); 2741 } 2742 nmethod* next = NULL; 2743 if (cur == n) { 2744 found = true; 2745 next = cur->osr_link(); 2746 if (last == NULL) { 2747 // Remove first element 2748 set_osr_nmethods_head(next); 2749 } else { 2750 last->set_osr_link(next); 2751 } 2752 } 2753 n->set_osr_link(NULL); 2754 if (TieredCompilation) { 2755 cur = next; 2756 while (cur != NULL) { 2757 // Find max level after n 2758 if (m == cur->method()) { 2759 max_level = MAX2(max_level, cur->comp_level()); 2760 } 2761 cur = cur->osr_link(); 2762 } 2763 m->set_highest_osr_comp_level(max_level); 2764 } 2765 return found; 2766 } 2767 2768 int InstanceKlass::mark_osr_nmethods(const Method* m) { 2769 // This is a short non-blocking critical region, so the no safepoint check is ok. 2770 MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag); 2771 nmethod* osr = osr_nmethods_head(); 2772 int found = 0; 2773 while (osr != NULL) { 2774 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain"); 2775 if (osr->method() == m) { 2776 osr->mark_for_deoptimization(); 2777 found++; 2778 } 2779 osr = osr->osr_link(); 2780 } 2781 return found; 2782 } 2783 2784 nmethod* InstanceKlass::lookup_osr_nmethod(const Method* m, int bci, int comp_level, bool match_level) const { 2785 // This is a short non-blocking critical region, so the no safepoint check is ok. 2786 MutexLockerEx ml(OsrList_lock, Mutex::_no_safepoint_check_flag); 2787 nmethod* osr = osr_nmethods_head(); 2788 nmethod* best = NULL; 2789 while (osr != NULL) { 2790 assert(osr->is_osr_method(), "wrong kind of nmethod found in chain"); 2791 // There can be a time when a c1 osr method exists but we are waiting 2792 // for a c2 version. When c2 completes its osr nmethod we will trash 2793 // the c1 version and only be able to find the c2 version. However 2794 // while we overflow in the c1 code at back branches we don't want to 2795 // try and switch to the same code as we are already running 2796 2797 if (osr->method() == m && 2798 (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) { 2799 if (match_level) { 2800 if (osr->comp_level() == comp_level) { 2801 // Found a match - return it. 2802 return osr; 2803 } 2804 } else { 2805 if (best == NULL || (osr->comp_level() > best->comp_level())) { 2806 if (osr->comp_level() == CompLevel_highest_tier) { 2807 // Found the best possible - return it. 2808 return osr; 2809 } 2810 best = osr; 2811 } 2812 } 2813 } 2814 osr = osr->osr_link(); 2815 } 2816 if (best != NULL && best->comp_level() >= comp_level && match_level == false) { 2817 return best; 2818 } 2819 return NULL; 2820 } 2821 2822 // ----------------------------------------------------------------------------------------------------- 2823 // Printing 2824 2825 #ifndef PRODUCT 2826 2827 #define BULLET " - " 2828 2829 static const char* state_names[] = { 2830 "allocated", "loaded", "linked", "being_initialized", "fully_initialized", "initialization_error" 2831 }; 2832 2833 static void print_vtable(intptr_t* start, int len, outputStream* st) { 2834 for (int i = 0; i < len; i++) { 2835 intptr_t e = start[i]; 2836 st->print("%d : " INTPTR_FORMAT, i, e); 2837 if (e != 0 && ((Metadata*)e)->is_metaspace_object()) { 2838 st->print(" "); 2839 ((Metadata*)e)->print_value_on(st); 2840 } 2841 st->cr(); 2842 } 2843 } 2844 2845 static void print_vtable(vtableEntry* start, int len, outputStream* st) { 2846 return print_vtable(reinterpret_cast<intptr_t*>(start), len, st); 2847 } 2848 2849 void InstanceKlass::print_on(outputStream* st) const { 2850 assert(is_klass(), "must be klass"); 2851 Klass::print_on(st); 2852 2853 st->print(BULLET"instance size: %d", size_helper()); st->cr(); 2854 st->print(BULLET"klass size: %d", size()); st->cr(); 2855 st->print(BULLET"access: "); access_flags().print_on(st); st->cr(); 2856 st->print(BULLET"state: "); st->print_cr("%s", state_names[_init_state]); 2857 st->print(BULLET"name: "); name()->print_value_on(st); st->cr(); 2858 st->print(BULLET"super: "); super()->print_value_on_maybe_null(st); st->cr(); 2859 st->print(BULLET"sub: "); 2860 Klass* sub = subklass(); 2861 int n; 2862 for (n = 0; sub != NULL; n++, sub = sub->next_sibling()) { 2863 if (n < MaxSubklassPrintSize) { 2864 sub->print_value_on(st); 2865 st->print(" "); 2866 } 2867 } 2868 if (n >= MaxSubklassPrintSize) st->print("(" INTX_FORMAT " more klasses...)", n - MaxSubklassPrintSize); 2869 st->cr(); 2870 2871 if (is_interface()) { 2872 st->print_cr(BULLET"nof implementors: %d", nof_implementors()); 2873 if (nof_implementors() == 1) { 2874 st->print_cr(BULLET"implementor: "); 2875 st->print(" "); 2876 implementor()->print_value_on(st); 2877 st->cr(); 2878 } 2879 } 2880 2881 st->print(BULLET"arrays: "); array_klasses()->print_value_on_maybe_null(st); st->cr(); 2882 st->print(BULLET"methods: "); methods()->print_value_on(st); st->cr(); 2883 if (Verbose || WizardMode) { 2884 Array<Method*>* method_array = methods(); 2885 for (int i = 0; i < method_array->length(); i++) { 2886 st->print("%d : ", i); method_array->at(i)->print_value(); st->cr(); 2887 } 2888 } 2889 st->print(BULLET"method ordering: "); method_ordering()->print_value_on(st); st->cr(); 2890 st->print(BULLET"default_methods: "); default_methods()->print_value_on(st); st->cr(); 2891 if (Verbose && default_methods() != NULL) { 2892 Array<Method*>* method_array = default_methods(); 2893 for (int i = 0; i < method_array->length(); i++) { 2894 st->print("%d : ", i); method_array->at(i)->print_value(); st->cr(); 2895 } 2896 } 2897 if (default_vtable_indices() != NULL) { 2898 st->print(BULLET"default vtable indices: "); default_vtable_indices()->print_value_on(st); st->cr(); 2899 } 2900 st->print(BULLET"local interfaces: "); local_interfaces()->print_value_on(st); st->cr(); 2901 st->print(BULLET"trans. interfaces: "); transitive_interfaces()->print_value_on(st); st->cr(); 2902 st->print(BULLET"constants: "); constants()->print_value_on(st); st->cr(); 2903 if (class_loader_data() != NULL) { 2904 st->print(BULLET"class loader data: "); 2905 class_loader_data()->print_value_on(st); 2906 st->cr(); 2907 } 2908 st->print(BULLET"host class: "); host_klass()->print_value_on_maybe_null(st); st->cr(); 2909 if (source_file_name() != NULL) { 2910 st->print(BULLET"source file: "); 2911 source_file_name()->print_value_on(st); 2912 st->cr(); 2913 } 2914 if (source_debug_extension() != NULL) { 2915 st->print(BULLET"source debug extension: "); 2916 st->print("%s", source_debug_extension()); 2917 st->cr(); 2918 } 2919 st->print(BULLET"class annotations: "); class_annotations()->print_value_on(st); st->cr(); 2920 st->print(BULLET"class type annotations: "); class_type_annotations()->print_value_on(st); st->cr(); 2921 st->print(BULLET"field annotations: "); fields_annotations()->print_value_on(st); st->cr(); 2922 st->print(BULLET"field type annotations: "); fields_type_annotations()->print_value_on(st); st->cr(); 2923 { 2924 bool have_pv = false; 2925 // previous versions are linked together through the InstanceKlass 2926 for (InstanceKlass* pv_node = previous_versions(); 2927 pv_node != NULL; 2928 pv_node = pv_node->previous_versions()) { 2929 if (!have_pv) 2930 st->print(BULLET"previous version: "); 2931 have_pv = true; 2932 pv_node->constants()->print_value_on(st); 2933 } 2934 if (have_pv) st->cr(); 2935 } 2936 2937 if (generic_signature() != NULL) { 2938 st->print(BULLET"generic signature: "); 2939 generic_signature()->print_value_on(st); 2940 st->cr(); 2941 } 2942 st->print(BULLET"inner classes: "); inner_classes()->print_value_on(st); st->cr(); 2943 st->print(BULLET"java mirror: "); java_mirror()->print_value_on(st); st->cr(); 2944 st->print(BULLET"vtable length %d (start addr: " INTPTR_FORMAT ")", vtable_length(), p2i(start_of_vtable())); st->cr(); 2945 if (vtable_length() > 0 && (Verbose || WizardMode)) print_vtable(start_of_vtable(), vtable_length(), st); 2946 st->print(BULLET"itable length %d (start addr: " INTPTR_FORMAT ")", itable_length(), p2i(start_of_itable())); st->cr(); 2947 if (itable_length() > 0 && (Verbose || WizardMode)) print_vtable(start_of_itable(), itable_length(), st); 2948 st->print_cr(BULLET"---- static fields (%d words):", static_field_size()); 2949 FieldPrinter print_static_field(st); 2950 ((InstanceKlass*)this)->do_local_static_fields(&print_static_field); 2951 st->print_cr(BULLET"---- non-static fields (%d words):", nonstatic_field_size()); 2952 FieldPrinter print_nonstatic_field(st); 2953 InstanceKlass* ik = const_cast<InstanceKlass*>(this); 2954 ik->do_nonstatic_fields(&print_nonstatic_field); 2955 2956 st->print(BULLET"non-static oop maps: "); 2957 OopMapBlock* map = start_of_nonstatic_oop_maps(); 2958 OopMapBlock* end_map = map + nonstatic_oop_map_count(); 2959 while (map < end_map) { 2960 st->print("%d-%d ", map->offset(), map->offset() + heapOopSize*(map->count() - 1)); 2961 map++; 2962 } 2963 st->cr(); 2964 } 2965 2966 #endif //PRODUCT 2967 2968 void InstanceKlass::print_value_on(outputStream* st) const { 2969 assert(is_klass(), "must be klass"); 2970 if (Verbose || WizardMode) access_flags().print_on(st); 2971 name()->print_value_on(st); 2972 } 2973 2974 #ifndef PRODUCT 2975 2976 void FieldPrinter::do_field(fieldDescriptor* fd) { 2977 _st->print(BULLET); 2978 if (_obj == NULL) { 2979 fd->print_on(_st); 2980 _st->cr(); 2981 } else { 2982 fd->print_on_for(_st, _obj); 2983 _st->cr(); 2984 } 2985 } 2986 2987 2988 void InstanceKlass::oop_print_on(oop obj, outputStream* st) { 2989 Klass::oop_print_on(obj, st); 2990 2991 if (this == SystemDictionary::String_klass()) { 2992 typeArrayOop value = java_lang_String::value(obj); 2993 juint length = java_lang_String::length(obj); 2994 if (value != NULL && 2995 value->is_typeArray() && 2996 length <= (juint) value->length()) { 2997 st->print(BULLET"string: "); 2998 java_lang_String::print(obj, st); 2999 st->cr(); 3000 if (!WizardMode) return; // that is enough 3001 } 3002 } 3003 3004 st->print_cr(BULLET"---- fields (total size %d words):", oop_size(obj)); 3005 FieldPrinter print_field(st, obj); 3006 do_nonstatic_fields(&print_field); 3007 3008 if (this == SystemDictionary::Class_klass()) { 3009 st->print(BULLET"signature: "); 3010 java_lang_Class::print_signature(obj, st); 3011 st->cr(); 3012 Klass* mirrored_klass = java_lang_Class::as_Klass(obj); 3013 st->print(BULLET"fake entry for mirror: "); 3014 mirrored_klass->print_value_on_maybe_null(st); 3015 st->cr(); 3016 Klass* array_klass = java_lang_Class::array_klass_acquire(obj); 3017 st->print(BULLET"fake entry for array: "); 3018 array_klass->print_value_on_maybe_null(st); 3019 st->cr(); 3020 st->print_cr(BULLET"fake entry for oop_size: %d", java_lang_Class::oop_size(obj)); 3021 st->print_cr(BULLET"fake entry for static_oop_field_count: %d", java_lang_Class::static_oop_field_count(obj)); 3022 Klass* real_klass = java_lang_Class::as_Klass(obj); 3023 if (real_klass != NULL && real_klass->is_instance_klass()) { 3024 InstanceKlass::cast(real_klass)->do_local_static_fields(&print_field); 3025 } 3026 } else if (this == SystemDictionary::MethodType_klass()) { 3027 st->print(BULLET"signature: "); 3028 java_lang_invoke_MethodType::print_signature(obj, st); 3029 st->cr(); 3030 } 3031 } 3032 3033 #endif //PRODUCT 3034 3035 void InstanceKlass::oop_print_value_on(oop obj, outputStream* st) { 3036 st->print("a "); 3037 name()->print_value_on(st); 3038 obj->print_address_on(st); 3039 if (this == SystemDictionary::String_klass() 3040 && java_lang_String::value(obj) != NULL) { 3041 ResourceMark rm; 3042 int len = java_lang_String::length(obj); 3043 int plen = (len < 24 ? len : 12); 3044 char* str = java_lang_String::as_utf8_string(obj, 0, plen); 3045 st->print(" = \"%s\"", str); 3046 if (len > plen) 3047 st->print("...[%d]", len); 3048 } else if (this == SystemDictionary::Class_klass()) { 3049 Klass* k = java_lang_Class::as_Klass(obj); 3050 st->print(" = "); 3051 if (k != NULL) { 3052 k->print_value_on(st); 3053 } else { 3054 const char* tname = type2name(java_lang_Class::primitive_type(obj)); 3055 st->print("%s", tname ? tname : "type?"); 3056 } 3057 } else if (this == SystemDictionary::MethodType_klass()) { 3058 st->print(" = "); 3059 java_lang_invoke_MethodType::print_signature(obj, st); 3060 } else if (java_lang_boxing_object::is_instance(obj)) { 3061 st->print(" = "); 3062 java_lang_boxing_object::print(obj, st); 3063 } else if (this == SystemDictionary::LambdaForm_klass()) { 3064 oop vmentry = java_lang_invoke_LambdaForm::vmentry(obj); 3065 if (vmentry != NULL) { 3066 st->print(" => "); 3067 vmentry->print_value_on(st); 3068 } 3069 } else if (this == SystemDictionary::MemberName_klass()) { 3070 Metadata* vmtarget = java_lang_invoke_MemberName::vmtarget(obj); 3071 if (vmtarget != NULL) { 3072 st->print(" = "); 3073 vmtarget->print_value_on(st); 3074 } else { 3075 java_lang_invoke_MemberName::clazz(obj)->print_value_on(st); 3076 st->print("."); 3077 java_lang_invoke_MemberName::name(obj)->print_value_on(st); 3078 } 3079 } 3080 } 3081 3082 const char* InstanceKlass::internal_name() const { 3083 return external_name(); 3084 } 3085 3086 void InstanceKlass::print_class_load_logging(ClassLoaderData* loader_data, 3087 const char* module_name, 3088 const ClassFileStream* cfs) const { 3089 if (!log_is_enabled(Info, class, load)) { 3090 return; 3091 } 3092 3093 ResourceMark rm; 3094 LogMessage(class, load) msg; 3095 stringStream info_stream; 3096 3097 // Name and class hierarchy info 3098 info_stream.print("%s", external_name()); 3099 3100 // Source 3101 if (cfs != NULL) { 3102 if (cfs->source() != NULL) { 3103 if (module_name != NULL) { 3104 if (ClassLoader::is_modules_image(cfs->source())) { 3105 info_stream.print(" source: jrt:/%s", module_name); 3106 } else { 3107 info_stream.print(" source: %s", cfs->source()); 3108 } 3109 } else { 3110 info_stream.print(" source: %s", cfs->source()); 3111 } 3112 } else if (loader_data == ClassLoaderData::the_null_class_loader_data()) { 3113 Thread* THREAD = Thread::current(); 3114 Klass* caller = 3115 THREAD->is_Java_thread() 3116 ? ((JavaThread*)THREAD)->security_get_caller_class(1) 3117 : NULL; 3118 // caller can be NULL, for example, during a JVMTI VM_Init hook 3119 if (caller != NULL) { 3120 info_stream.print(" source: instance of %s", caller->external_name()); 3121 } else { 3122 // source is unknown 3123 } 3124 } else { 3125 oop class_loader = loader_data->class_loader(); 3126 info_stream.print(" source: %s", class_loader->klass()->external_name()); 3127 } 3128 } else { 3129 info_stream.print(" source: shared objects file"); 3130 } 3131 3132 msg.info("%s", info_stream.as_string()); 3133 3134 if (log_is_enabled(Debug, class, load)) { 3135 stringStream debug_stream; 3136 3137 // Class hierarchy info 3138 debug_stream.print(" klass: " INTPTR_FORMAT " super: " INTPTR_FORMAT, 3139 p2i(this), p2i(superklass())); 3140 3141 // Interfaces 3142 if (local_interfaces() != NULL && local_interfaces()->length() > 0) { 3143 debug_stream.print(" interfaces:"); 3144 int length = local_interfaces()->length(); 3145 for (int i = 0; i < length; i++) { 3146 debug_stream.print(" " INTPTR_FORMAT, 3147 p2i(InstanceKlass::cast(local_interfaces()->at(i)))); 3148 } 3149 } 3150 3151 // Class loader 3152 debug_stream.print(" loader: ["); 3153 loader_data->print_value_on(&debug_stream); 3154 debug_stream.print("]"); 3155 3156 // Classfile checksum 3157 if (cfs) { 3158 debug_stream.print(" bytes: %d checksum: %08x", 3159 cfs->length(), 3160 ClassLoader::crc32(0, (const char*)cfs->buffer(), 3161 cfs->length())); 3162 } 3163 3164 msg.debug("%s", debug_stream.as_string()); 3165 } 3166 } 3167 3168 #if INCLUDE_SERVICES 3169 // Size Statistics 3170 void InstanceKlass::collect_statistics(KlassSizeStats *sz) const { 3171 Klass::collect_statistics(sz); 3172 3173 sz->_inst_size = wordSize * size_helper(); 3174 sz->_vtab_bytes = wordSize * vtable_length(); 3175 sz->_itab_bytes = wordSize * itable_length(); 3176 sz->_nonstatic_oopmap_bytes = wordSize * nonstatic_oop_map_size(); 3177 3178 int n = 0; 3179 n += (sz->_methods_array_bytes = sz->count_array(methods())); 3180 n += (sz->_method_ordering_bytes = sz->count_array(method_ordering())); 3181 n += (sz->_local_interfaces_bytes = sz->count_array(local_interfaces())); 3182 n += (sz->_transitive_interfaces_bytes = sz->count_array(transitive_interfaces())); 3183 n += (sz->_fields_bytes = sz->count_array(fields())); 3184 n += (sz->_inner_classes_bytes = sz->count_array(inner_classes())); 3185 sz->_ro_bytes += n; 3186 3187 const ConstantPool* cp = constants(); 3188 if (cp) { 3189 cp->collect_statistics(sz); 3190 } 3191 3192 const Annotations* anno = annotations(); 3193 if (anno) { 3194 anno->collect_statistics(sz); 3195 } 3196 3197 const Array<Method*>* methods_array = methods(); 3198 if (methods()) { 3199 for (int i = 0; i < methods_array->length(); i++) { 3200 Method* method = methods_array->at(i); 3201 if (method) { 3202 sz->_method_count ++; 3203 method->collect_statistics(sz); 3204 } 3205 } 3206 } 3207 } 3208 #endif // INCLUDE_SERVICES 3209 3210 // Verification 3211 3212 class VerifyFieldClosure: public OopClosure { 3213 protected: 3214 template <class T> void do_oop_work(T* p) { 3215 oop obj = RawAccess<>::oop_load(p); 3216 if (!oopDesc::is_oop_or_null(obj)) { 3217 tty->print_cr("Failed: " PTR_FORMAT " -> " PTR_FORMAT, p2i(p), p2i(obj)); 3218 Universe::print_on(tty); 3219 guarantee(false, "boom"); 3220 } 3221 } 3222 public: 3223 virtual void do_oop(oop* p) { VerifyFieldClosure::do_oop_work(p); } 3224 virtual void do_oop(narrowOop* p) { VerifyFieldClosure::do_oop_work(p); } 3225 }; 3226 3227 void InstanceKlass::verify_on(outputStream* st) { 3228 #ifndef PRODUCT 3229 // Avoid redundant verifies, this really should be in product. 3230 if (_verify_count == Universe::verify_count()) return; 3231 _verify_count = Universe::verify_count(); 3232 #endif 3233 3234 // Verify Klass 3235 Klass::verify_on(st); 3236 3237 // Verify that klass is present in ClassLoaderData 3238 guarantee(class_loader_data()->contains_klass(this), 3239 "this class isn't found in class loader data"); 3240 3241 // Verify vtables 3242 if (is_linked()) { 3243 // $$$ This used to be done only for m/s collections. Doing it 3244 // always seemed a valid generalization. (DLD -- 6/00) 3245 vtable().verify(st); 3246 } 3247 3248 // Verify first subklass 3249 if (subklass() != NULL) { 3250 guarantee(subklass()->is_klass(), "should be klass"); 3251 } 3252 3253 // Verify siblings 3254 Klass* super = this->super(); 3255 Klass* sib = next_sibling(); 3256 if (sib != NULL) { 3257 if (sib == this) { 3258 fatal("subclass points to itself " PTR_FORMAT, p2i(sib)); 3259 } 3260 3261 guarantee(sib->is_klass(), "should be klass"); 3262 guarantee(sib->super() == super, "siblings should have same superklass"); 3263 } 3264 3265 // Verify implementor fields 3266 Klass* im = implementor(); 3267 if (im != NULL) { 3268 guarantee(is_interface(), "only interfaces should have implementor set"); 3269 guarantee(im->is_klass(), "should be klass"); 3270 guarantee(!im->is_interface() || im == this, 3271 "implementors cannot be interfaces"); 3272 } 3273 3274 // Verify local interfaces 3275 if (local_interfaces()) { 3276 Array<Klass*>* local_interfaces = this->local_interfaces(); 3277 for (int j = 0; j < local_interfaces->length(); j++) { 3278 Klass* e = local_interfaces->at(j); 3279 guarantee(e->is_klass() && e->is_interface(), "invalid local interface"); 3280 } 3281 } 3282 3283 // Verify transitive interfaces 3284 if (transitive_interfaces() != NULL) { 3285 Array<Klass*>* transitive_interfaces = this->transitive_interfaces(); 3286 for (int j = 0; j < transitive_interfaces->length(); j++) { 3287 Klass* e = transitive_interfaces->at(j); 3288 guarantee(e->is_klass() && e->is_interface(), "invalid transitive interface"); 3289 } 3290 } 3291 3292 // Verify methods 3293 if (methods() != NULL) { 3294 Array<Method*>* methods = this->methods(); 3295 for (int j = 0; j < methods->length(); j++) { 3296 guarantee(methods->at(j)->is_method(), "non-method in methods array"); 3297 } 3298 for (int j = 0; j < methods->length() - 1; j++) { 3299 Method* m1 = methods->at(j); 3300 Method* m2 = methods->at(j + 1); 3301 guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly"); 3302 } 3303 } 3304 3305 // Verify method ordering 3306 if (method_ordering() != NULL) { 3307 Array<int>* method_ordering = this->method_ordering(); 3308 int length = method_ordering->length(); 3309 if (JvmtiExport::can_maintain_original_method_order() || 3310 ((UseSharedSpaces || DumpSharedSpaces) && length != 0)) { 3311 guarantee(length == methods()->length(), "invalid method ordering length"); 3312 jlong sum = 0; 3313 for (int j = 0; j < length; j++) { 3314 int original_index = method_ordering->at(j); 3315 guarantee(original_index >= 0, "invalid method ordering index"); 3316 guarantee(original_index < length, "invalid method ordering index"); 3317 sum += original_index; 3318 } 3319 // Verify sum of indices 0,1,...,length-1 3320 guarantee(sum == ((jlong)length*(length-1))/2, "invalid method ordering sum"); 3321 } else { 3322 guarantee(length == 0, "invalid method ordering length"); 3323 } 3324 } 3325 3326 // Verify default methods 3327 if (default_methods() != NULL) { 3328 Array<Method*>* methods = this->default_methods(); 3329 for (int j = 0; j < methods->length(); j++) { 3330 guarantee(methods->at(j)->is_method(), "non-method in methods array"); 3331 } 3332 for (int j = 0; j < methods->length() - 1; j++) { 3333 Method* m1 = methods->at(j); 3334 Method* m2 = methods->at(j + 1); 3335 guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly"); 3336 } 3337 } 3338 3339 // Verify JNI static field identifiers 3340 if (jni_ids() != NULL) { 3341 jni_ids()->verify(this); 3342 } 3343 3344 // Verify other fields 3345 if (array_klasses() != NULL) { 3346 guarantee(array_klasses()->is_klass(), "should be klass"); 3347 } 3348 if (constants() != NULL) { 3349 guarantee(constants()->is_constantPool(), "should be constant pool"); 3350 } 3351 const Klass* host = host_klass(); 3352 if (host != NULL) { 3353 guarantee(host->is_klass(), "should be klass"); 3354 } 3355 } 3356 3357 void InstanceKlass::oop_verify_on(oop obj, outputStream* st) { 3358 Klass::oop_verify_on(obj, st); 3359 VerifyFieldClosure blk; 3360 obj->oop_iterate_no_header(&blk); 3361 } 3362 3363 3364 // JNIid class for jfieldIDs only 3365 // Note to reviewers: 3366 // These JNI functions are just moved over to column 1 and not changed 3367 // in the compressed oops workspace. 3368 JNIid::JNIid(Klass* holder, int offset, JNIid* next) { 3369 _holder = holder; 3370 _offset = offset; 3371 _next = next; 3372 debug_only(_is_static_field_id = false;) 3373 } 3374 3375 3376 JNIid* JNIid::find(int offset) { 3377 JNIid* current = this; 3378 while (current != NULL) { 3379 if (current->offset() == offset) return current; 3380 current = current->next(); 3381 } 3382 return NULL; 3383 } 3384 3385 void JNIid::deallocate(JNIid* current) { 3386 while (current != NULL) { 3387 JNIid* next = current->next(); 3388 delete current; 3389 current = next; 3390 } 3391 } 3392 3393 3394 void JNIid::verify(Klass* holder) { 3395 int first_field_offset = InstanceMirrorKlass::offset_of_static_fields(); 3396 int end_field_offset; 3397 end_field_offset = first_field_offset + (InstanceKlass::cast(holder)->static_field_size() * wordSize); 3398 3399 JNIid* current = this; 3400 while (current != NULL) { 3401 guarantee(current->holder() == holder, "Invalid klass in JNIid"); 3402 #ifdef ASSERT 3403 int o = current->offset(); 3404 if (current->is_static_field_id()) { 3405 guarantee(o >= first_field_offset && o < end_field_offset, "Invalid static field offset in JNIid"); 3406 } 3407 #endif 3408 current = current->next(); 3409 } 3410 } 3411 3412 oop InstanceKlass::holder_phantom() const { 3413 return class_loader_data()->holder_phantom(); 3414 } 3415 3416 #ifdef ASSERT 3417 void InstanceKlass::set_init_state(ClassState state) { 3418 bool good_state = is_shared() ? (_init_state <= state) 3419 : (_init_state < state); 3420 assert(good_state || state == allocated, "illegal state transition"); 3421 _init_state = (u1)state; 3422 } 3423 #endif 3424 3425 #if INCLUDE_JVMTI 3426 3427 // RedefineClasses() support for previous versions 3428 3429 // Globally, there is at least one previous version of a class to walk 3430 // during class unloading, which is saved because old methods in the class 3431 // are still running. Otherwise the previous version list is cleaned up. 3432 bool InstanceKlass::_has_previous_versions = false; 3433 3434 // Returns true if there are previous versions of a class for class 3435 // unloading only. Also resets the flag to false. purge_previous_version 3436 // will set the flag to true if there are any left, i.e., if there's any 3437 // work to do for next time. This is to avoid the expensive code cache 3438 // walk in CLDG::do_unloading(). 3439 bool InstanceKlass::has_previous_versions_and_reset() { 3440 bool ret = _has_previous_versions; 3441 log_trace(redefine, class, iklass, purge)("Class unloading: has_previous_versions = %s", 3442 ret ? "true" : "false"); 3443 _has_previous_versions = false; 3444 return ret; 3445 } 3446 3447 // Purge previous versions before adding new previous versions of the class and 3448 // during class unloading. 3449 void InstanceKlass::purge_previous_version_list() { 3450 assert(SafepointSynchronize::is_at_safepoint(), "only called at safepoint"); 3451 assert(has_been_redefined(), "Should only be called for main class"); 3452 3453 // Quick exit. 3454 if (previous_versions() == NULL) { 3455 return; 3456 } 3457 3458 // This klass has previous versions so see what we can cleanup 3459 // while it is safe to do so. 3460 3461 int deleted_count = 0; // leave debugging breadcrumbs 3462 int live_count = 0; 3463 ClassLoaderData* loader_data = class_loader_data(); 3464 assert(loader_data != NULL, "should never be null"); 3465 3466 ResourceMark rm; 3467 log_trace(redefine, class, iklass, purge)("%s: previous versions", external_name()); 3468 3469 // previous versions are linked together through the InstanceKlass 3470 InstanceKlass* pv_node = previous_versions(); 3471 InstanceKlass* last = this; 3472 int version = 0; 3473 3474 // check the previous versions list 3475 for (; pv_node != NULL; ) { 3476 3477 ConstantPool* pvcp = pv_node->constants(); 3478 assert(pvcp != NULL, "cp ref was unexpectedly cleared"); 3479 3480 if (!pvcp->on_stack()) { 3481 // If the constant pool isn't on stack, none of the methods 3482 // are executing. Unlink this previous_version. 3483 // The previous version InstanceKlass is on the ClassLoaderData deallocate list 3484 // so will be deallocated during the next phase of class unloading. 3485 log_trace(redefine, class, iklass, purge) 3486 ("previous version " INTPTR_FORMAT " is dead.", p2i(pv_node)); 3487 // For debugging purposes. 3488 pv_node->set_is_scratch_class(); 3489 // Unlink from previous version list. 3490 assert(pv_node->class_loader_data() == loader_data, "wrong loader_data"); 3491 InstanceKlass* next = pv_node->previous_versions(); 3492 pv_node->link_previous_versions(NULL); // point next to NULL 3493 last->link_previous_versions(next); 3494 // Add to the deallocate list after unlinking 3495 loader_data->add_to_deallocate_list(pv_node); 3496 pv_node = next; 3497 deleted_count++; 3498 version++; 3499 continue; 3500 } else { 3501 log_trace(redefine, class, iklass, purge)("previous version " INTPTR_FORMAT " is alive", p2i(pv_node)); 3502 assert(pvcp->pool_holder() != NULL, "Constant pool with no holder"); 3503 guarantee (!loader_data->is_unloading(), "unloaded classes can't be on the stack"); 3504 live_count++; 3505 // found a previous version for next time we do class unloading 3506 _has_previous_versions = true; 3507 } 3508 3509 // At least one method is live in this previous version. 3510 // Reset dead EMCP methods not to get breakpoints. 3511 // All methods are deallocated when all of the methods for this class are no 3512 // longer running. 3513 Array<Method*>* method_refs = pv_node->methods(); 3514 if (method_refs != NULL) { 3515 log_trace(redefine, class, iklass, purge)("previous methods length=%d", method_refs->length()); 3516 for (int j = 0; j < method_refs->length(); j++) { 3517 Method* method = method_refs->at(j); 3518 3519 if (!method->on_stack()) { 3520 // no breakpoints for non-running methods 3521 if (method->is_running_emcp()) { 3522 method->set_running_emcp(false); 3523 } 3524 } else { 3525 assert (method->is_obsolete() || method->is_running_emcp(), 3526 "emcp method cannot run after emcp bit is cleared"); 3527 log_trace(redefine, class, iklass, purge) 3528 ("purge: %s(%s): prev method @%d in version @%d is alive", 3529 method->name()->as_C_string(), method->signature()->as_C_string(), j, version); 3530 } 3531 } 3532 } 3533 // next previous version 3534 last = pv_node; 3535 pv_node = pv_node->previous_versions(); 3536 version++; 3537 } 3538 log_trace(redefine, class, iklass, purge) 3539 ("previous version stats: live=%d, deleted=%d", live_count, deleted_count); 3540 } 3541 3542 void InstanceKlass::mark_newly_obsolete_methods(Array<Method*>* old_methods, 3543 int emcp_method_count) { 3544 int obsolete_method_count = old_methods->length() - emcp_method_count; 3545 3546 if (emcp_method_count != 0 && obsolete_method_count != 0 && 3547 _previous_versions != NULL) { 3548 // We have a mix of obsolete and EMCP methods so we have to 3549 // clear out any matching EMCP method entries the hard way. 3550 int local_count = 0; 3551 for (int i = 0; i < old_methods->length(); i++) { 3552 Method* old_method = old_methods->at(i); 3553 if (old_method->is_obsolete()) { 3554 // only obsolete methods are interesting 3555 Symbol* m_name = old_method->name(); 3556 Symbol* m_signature = old_method->signature(); 3557 3558 // previous versions are linked together through the InstanceKlass 3559 int j = 0; 3560 for (InstanceKlass* prev_version = _previous_versions; 3561 prev_version != NULL; 3562 prev_version = prev_version->previous_versions(), j++) { 3563 3564 Array<Method*>* method_refs = prev_version->methods(); 3565 for (int k = 0; k < method_refs->length(); k++) { 3566 Method* method = method_refs->at(k); 3567 3568 if (!method->is_obsolete() && 3569 method->name() == m_name && 3570 method->signature() == m_signature) { 3571 // The current RedefineClasses() call has made all EMCP 3572 // versions of this method obsolete so mark it as obsolete 3573 log_trace(redefine, class, iklass, add) 3574 ("%s(%s): flush obsolete method @%d in version @%d", 3575 m_name->as_C_string(), m_signature->as_C_string(), k, j); 3576 3577 method->set_is_obsolete(); 3578 break; 3579 } 3580 } 3581 3582 // The previous loop may not find a matching EMCP method, but 3583 // that doesn't mean that we can optimize and not go any 3584 // further back in the PreviousVersion generations. The EMCP 3585 // method for this generation could have already been made obsolete, 3586 // but there still may be an older EMCP method that has not 3587 // been made obsolete. 3588 } 3589 3590 if (++local_count >= obsolete_method_count) { 3591 // no more obsolete methods so bail out now 3592 break; 3593 } 3594 } 3595 } 3596 } 3597 } 3598 3599 // Save the scratch_class as the previous version if any of the methods are running. 3600 // The previous_versions are used to set breakpoints in EMCP methods and they are 3601 // also used to clean MethodData links to redefined methods that are no longer running. 3602 void InstanceKlass::add_previous_version(InstanceKlass* scratch_class, 3603 int emcp_method_count) { 3604 assert(Thread::current()->is_VM_thread(), 3605 "only VMThread can add previous versions"); 3606 3607 ResourceMark rm; 3608 log_trace(redefine, class, iklass, add) 3609 ("adding previous version ref for %s, EMCP_cnt=%d", scratch_class->external_name(), emcp_method_count); 3610 3611 // Clean out old previous versions for this class 3612 purge_previous_version_list(); 3613 3614 // Mark newly obsolete methods in remaining previous versions. An EMCP method from 3615 // a previous redefinition may be made obsolete by this redefinition. 3616 Array<Method*>* old_methods = scratch_class->methods(); 3617 mark_newly_obsolete_methods(old_methods, emcp_method_count); 3618 3619 // If the constant pool for this previous version of the class 3620 // is not marked as being on the stack, then none of the methods 3621 // in this previous version of the class are on the stack so 3622 // we don't need to add this as a previous version. 3623 ConstantPool* cp_ref = scratch_class->constants(); 3624 if (!cp_ref->on_stack()) { 3625 log_trace(redefine, class, iklass, add)("scratch class not added; no methods are running"); 3626 // For debugging purposes. 3627 scratch_class->set_is_scratch_class(); 3628 scratch_class->class_loader_data()->add_to_deallocate_list(scratch_class); 3629 return; 3630 } 3631 3632 if (emcp_method_count != 0) { 3633 // At least one method is still running, check for EMCP methods 3634 for (int i = 0; i < old_methods->length(); i++) { 3635 Method* old_method = old_methods->at(i); 3636 if (!old_method->is_obsolete() && old_method->on_stack()) { 3637 // if EMCP method (not obsolete) is on the stack, mark as EMCP so that 3638 // we can add breakpoints for it. 3639 3640 // We set the method->on_stack bit during safepoints for class redefinition 3641 // and use this bit to set the is_running_emcp bit. 3642 // After the safepoint, the on_stack bit is cleared and the running emcp 3643 // method may exit. If so, we would set a breakpoint in a method that 3644 // is never reached, but this won't be noticeable to the programmer. 3645 old_method->set_running_emcp(true); 3646 log_trace(redefine, class, iklass, add) 3647 ("EMCP method %s is on_stack " INTPTR_FORMAT, old_method->name_and_sig_as_C_string(), p2i(old_method)); 3648 } else if (!old_method->is_obsolete()) { 3649 log_trace(redefine, class, iklass, add) 3650 ("EMCP method %s is NOT on_stack " INTPTR_FORMAT, old_method->name_and_sig_as_C_string(), p2i(old_method)); 3651 } 3652 } 3653 } 3654 3655 // Add previous version if any methods are still running. 3656 // Set has_previous_version flag for processing during class unloading. 3657 _has_previous_versions = true; 3658 log_trace(redefine, class, iklass, add) ("scratch class added; one of its methods is on_stack."); 3659 assert(scratch_class->previous_versions() == NULL, "shouldn't have a previous version"); 3660 scratch_class->link_previous_versions(previous_versions()); 3661 link_previous_versions(scratch_class); 3662 } // end add_previous_version() 3663 3664 #endif // INCLUDE_JVMTI 3665 3666 Method* InstanceKlass::method_with_idnum(int idnum) { 3667 Method* m = NULL; 3668 if (idnum < methods()->length()) { 3669 m = methods()->at(idnum); 3670 } 3671 if (m == NULL || m->method_idnum() != idnum) { 3672 for (int index = 0; index < methods()->length(); ++index) { 3673 m = methods()->at(index); 3674 if (m->method_idnum() == idnum) { 3675 return m; 3676 } 3677 } 3678 // None found, return null for the caller to handle. 3679 return NULL; 3680 } 3681 return m; 3682 } 3683 3684 3685 Method* InstanceKlass::method_with_orig_idnum(int idnum) { 3686 if (idnum >= methods()->length()) { 3687 return NULL; 3688 } 3689 Method* m = methods()->at(idnum); 3690 if (m != NULL && m->orig_method_idnum() == idnum) { 3691 return m; 3692 } 3693 // Obsolete method idnum does not match the original idnum 3694 for (int index = 0; index < methods()->length(); ++index) { 3695 m = methods()->at(index); 3696 if (m->orig_method_idnum() == idnum) { 3697 return m; 3698 } 3699 } 3700 // None found, return null for the caller to handle. 3701 return NULL; 3702 } 3703 3704 3705 Method* InstanceKlass::method_with_orig_idnum(int idnum, int version) { 3706 InstanceKlass* holder = get_klass_version(version); 3707 if (holder == NULL) { 3708 return NULL; // The version of klass is gone, no method is found 3709 } 3710 Method* method = holder->method_with_orig_idnum(idnum); 3711 return method; 3712 } 3713 3714 #if INCLUDE_JVMTI 3715 JvmtiCachedClassFileData* InstanceKlass::get_cached_class_file() { 3716 if (MetaspaceShared::is_in_shared_metaspace(_cached_class_file)) { 3717 // Ignore the archived class stream data 3718 return NULL; 3719 } else { 3720 return _cached_class_file; 3721 } 3722 } 3723 3724 jint InstanceKlass::get_cached_class_file_len() { 3725 return VM_RedefineClasses::get_cached_class_file_len(_cached_class_file); 3726 } 3727 3728 unsigned char * InstanceKlass::get_cached_class_file_bytes() { 3729 return VM_RedefineClasses::get_cached_class_file_bytes(_cached_class_file); 3730 } 3731 3732 #if INCLUDE_CDS 3733 JvmtiCachedClassFileData* InstanceKlass::get_archived_class_data() { 3734 if (DumpSharedSpaces) { 3735 return _cached_class_file; 3736 } else { 3737 assert(this->is_shared(), "class should be shared"); 3738 if (MetaspaceShared::is_in_shared_metaspace(_cached_class_file)) { 3739 return _cached_class_file; 3740 } else { 3741 return NULL; 3742 } 3743 } 3744 } 3745 #endif 3746 #endif