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