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