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