duke@435: /* trims@1907: * Copyright (c) 1997, 2009, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: duke@435: # include "incls/_precompiled.incl" duke@435: # include "incls/_instanceKlass.cpp.incl" duke@435: fparain@1759: #ifdef DTRACE_ENABLED fparain@1759: fparain@1759: HS_DTRACE_PROBE_DECL4(hotspot, class__initialization__required, fparain@1759: char*, intptr_t, oop, intptr_t); fparain@1759: HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__recursive, fparain@1759: char*, intptr_t, oop, intptr_t, int); fparain@1759: HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__concurrent, fparain@1759: char*, intptr_t, oop, intptr_t, int); fparain@1759: HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__erroneous, fparain@1759: char*, intptr_t, oop, intptr_t, int); fparain@1759: HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__super__failed, fparain@1759: char*, intptr_t, oop, intptr_t, int); fparain@1759: HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__clinit, fparain@1759: char*, intptr_t, oop, intptr_t, int); fparain@1759: HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__error, fparain@1759: char*, intptr_t, oop, intptr_t, int); fparain@1759: HS_DTRACE_PROBE_DECL5(hotspot, class__initialization__end, fparain@1759: char*, intptr_t, oop, intptr_t, int); fparain@1759: fparain@1759: #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type) \ fparain@1759: { \ fparain@1759: char* data = NULL; \ fparain@1759: int len = 0; \ fparain@1759: symbolOop name = (clss)->name(); \ fparain@1759: if (name != NULL) { \ fparain@1759: data = (char*)name->bytes(); \ fparain@1759: len = name->utf8_length(); \ fparain@1759: } \ fparain@1759: HS_DTRACE_PROBE4(hotspot, class__initialization__##type, \ fparain@1759: data, len, (clss)->class_loader(), thread_type); \ fparain@1759: } fparain@1759: fparain@1759: #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) \ fparain@1759: { \ fparain@1759: char* data = NULL; \ fparain@1759: int len = 0; \ fparain@1759: symbolOop name = (clss)->name(); \ fparain@1759: if (name != NULL) { \ fparain@1759: data = (char*)name->bytes(); \ fparain@1759: len = name->utf8_length(); \ fparain@1759: } \ fparain@1759: HS_DTRACE_PROBE5(hotspot, class__initialization__##type, \ fparain@1759: data, len, (clss)->class_loader(), thread_type, wait); \ fparain@1759: } fparain@1759: fparain@1759: #else // ndef DTRACE_ENABLED fparain@1759: fparain@1759: #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type) fparain@1759: #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) fparain@1759: fparain@1759: #endif // ndef DTRACE_ENABLED fparain@1759: duke@435: bool instanceKlass::should_be_initialized() const { duke@435: return !is_initialized(); duke@435: } duke@435: duke@435: klassVtable* instanceKlass::vtable() const { duke@435: return new klassVtable(as_klassOop(), start_of_vtable(), vtable_length() / vtableEntry::size()); duke@435: } duke@435: duke@435: klassItable* instanceKlass::itable() const { duke@435: return new klassItable(as_klassOop()); duke@435: } duke@435: duke@435: void instanceKlass::eager_initialize(Thread *thread) { duke@435: if (!EagerInitialization) return; duke@435: duke@435: if (this->is_not_initialized()) { duke@435: // abort if the the class has a class initializer duke@435: if (this->class_initializer() != NULL) return; duke@435: duke@435: // abort if it is java.lang.Object (initialization is handled in genesis) duke@435: klassOop super = this->super(); duke@435: if (super == NULL) return; duke@435: duke@435: // abort if the super class should be initialized duke@435: if (!instanceKlass::cast(super)->is_initialized()) return; duke@435: duke@435: // call body to expose the this pointer duke@435: instanceKlassHandle this_oop(thread, this->as_klassOop()); duke@435: eager_initialize_impl(this_oop); duke@435: } duke@435: } duke@435: duke@435: duke@435: void instanceKlass::eager_initialize_impl(instanceKlassHandle this_oop) { duke@435: EXCEPTION_MARK; duke@435: ObjectLocker ol(this_oop, THREAD); duke@435: duke@435: // abort if someone beat us to the initialization duke@435: if (!this_oop->is_not_initialized()) return; // note: not equivalent to is_initialized() duke@435: duke@435: ClassState old_state = this_oop->_init_state; duke@435: link_class_impl(this_oop, true, THREAD); duke@435: if (HAS_PENDING_EXCEPTION) { duke@435: CLEAR_PENDING_EXCEPTION; duke@435: // Abort if linking the class throws an exception. duke@435: duke@435: // Use a test to avoid redundantly resetting the state if there's duke@435: // no change. Set_init_state() asserts that state changes make duke@435: // progress, whereas here we might just be spinning in place. duke@435: if( old_state != this_oop->_init_state ) duke@435: this_oop->set_init_state (old_state); duke@435: } else { duke@435: // linking successfull, mark class as initialized duke@435: this_oop->set_init_state (fully_initialized); duke@435: // trace duke@435: if (TraceClassInitialization) { duke@435: ResourceMark rm(THREAD); duke@435: tty->print_cr("[Initialized %s without side effects]", this_oop->external_name()); duke@435: } duke@435: } duke@435: } duke@435: duke@435: duke@435: // See "The Virtual Machine Specification" section 2.16.5 for a detailed explanation of the class initialization duke@435: // process. The step comments refers to the procedure described in that section. duke@435: // Note: implementation moved to static method to expose the this pointer. duke@435: void instanceKlass::initialize(TRAPS) { duke@435: if (this->should_be_initialized()) { duke@435: HandleMark hm(THREAD); duke@435: instanceKlassHandle this_oop(THREAD, this->as_klassOop()); duke@435: initialize_impl(this_oop, CHECK); duke@435: // Note: at this point the class may be initialized duke@435: // OR it may be in the state of being initialized duke@435: // in case of recursive initialization! duke@435: } else { duke@435: assert(is_initialized(), "sanity check"); duke@435: } duke@435: } duke@435: duke@435: duke@435: bool instanceKlass::verify_code( duke@435: instanceKlassHandle this_oop, bool throw_verifyerror, TRAPS) { duke@435: // 1) Verify the bytecodes duke@435: Verifier::Mode mode = duke@435: throw_verifyerror ? Verifier::ThrowException : Verifier::NoException; acorn@1408: return Verifier::verify(this_oop, mode, this_oop->should_verify_class(), CHECK_false); duke@435: } duke@435: duke@435: duke@435: // Used exclusively by the shared spaces dump mechanism to prevent duke@435: // classes mapped into the shared regions in new VMs from appearing linked. duke@435: duke@435: void instanceKlass::unlink_class() { duke@435: assert(is_linked(), "must be linked"); duke@435: _init_state = loaded; duke@435: } duke@435: duke@435: void instanceKlass::link_class(TRAPS) { duke@435: assert(is_loaded(), "must be loaded"); duke@435: if (!is_linked()) { duke@435: instanceKlassHandle this_oop(THREAD, this->as_klassOop()); duke@435: link_class_impl(this_oop, true, CHECK); duke@435: } duke@435: } duke@435: duke@435: // Called to verify that a class can link during initialization, without duke@435: // throwing a VerifyError. duke@435: bool instanceKlass::link_class_or_fail(TRAPS) { duke@435: assert(is_loaded(), "must be loaded"); duke@435: if (!is_linked()) { duke@435: instanceKlassHandle this_oop(THREAD, this->as_klassOop()); duke@435: link_class_impl(this_oop, false, CHECK_false); duke@435: } duke@435: return is_linked(); duke@435: } duke@435: duke@435: bool instanceKlass::link_class_impl( duke@435: instanceKlassHandle this_oop, bool throw_verifyerror, TRAPS) { duke@435: // check for error state duke@435: if (this_oop->is_in_error_state()) { duke@435: ResourceMark rm(THREAD); duke@435: THROW_MSG_(vmSymbols::java_lang_NoClassDefFoundError(), duke@435: this_oop->external_name(), false); duke@435: } duke@435: // return if already verified duke@435: if (this_oop->is_linked()) { duke@435: return true; duke@435: } duke@435: duke@435: // Timing duke@435: // timer handles recursion duke@435: assert(THREAD->is_Java_thread(), "non-JavaThread in link_class_impl"); duke@435: JavaThread* jt = (JavaThread*)THREAD; duke@435: duke@435: // link super class before linking this class duke@435: instanceKlassHandle super(THREAD, this_oop->super()); duke@435: if (super.not_null()) { duke@435: if (super->is_interface()) { // check if super class is an interface duke@435: ResourceMark rm(THREAD); duke@435: Exceptions::fthrow( duke@435: THREAD_AND_LOCATION, duke@435: vmSymbolHandles::java_lang_IncompatibleClassChangeError(), duke@435: "class %s has interface %s as super class", duke@435: this_oop->external_name(), duke@435: super->external_name() duke@435: ); duke@435: return false; duke@435: } duke@435: duke@435: link_class_impl(super, throw_verifyerror, CHECK_false); duke@435: } duke@435: duke@435: // link all interfaces implemented by this class before linking this class duke@435: objArrayHandle interfaces (THREAD, this_oop->local_interfaces()); duke@435: int num_interfaces = interfaces->length(); duke@435: for (int index = 0; index < num_interfaces; index++) { duke@435: HandleMark hm(THREAD); duke@435: instanceKlassHandle ih(THREAD, klassOop(interfaces->obj_at(index))); duke@435: link_class_impl(ih, throw_verifyerror, CHECK_false); duke@435: } duke@435: duke@435: // in case the class is linked in the process of linking its superclasses duke@435: if (this_oop->is_linked()) { duke@435: return true; duke@435: } duke@435: mchung@1310: // trace only the link time for this klass that includes mchung@1310: // the verification time mchung@1310: PerfClassTraceTime vmtimer(ClassLoader::perf_class_link_time(), mchung@1310: ClassLoader::perf_class_link_selftime(), mchung@1310: ClassLoader::perf_classes_linked(), mchung@1310: jt->get_thread_stat()->perf_recursion_counts_addr(), mchung@1310: jt->get_thread_stat()->perf_timers_addr(), mchung@1310: PerfClassTraceTime::CLASS_LINK); mchung@1310: duke@435: // verification & rewriting duke@435: { duke@435: ObjectLocker ol(this_oop, THREAD); duke@435: // rewritten will have been set if loader constraint error found duke@435: // on an earlier link attempt duke@435: // don't verify or rewrite if already rewritten duke@435: if (!this_oop->is_linked()) { duke@435: if (!this_oop->is_rewritten()) { duke@435: { duke@435: // Timer includes any side effects of class verification (resolution, duke@435: // etc), but not recursive entry into verify_code(). mchung@1310: PerfClassTraceTime timer(ClassLoader::perf_class_verify_time(), mchung@1310: ClassLoader::perf_class_verify_selftime(), mchung@1310: ClassLoader::perf_classes_verified(), mchung@1310: jt->get_thread_stat()->perf_recursion_counts_addr(), mchung@1310: jt->get_thread_stat()->perf_timers_addr(), mchung@1310: PerfClassTraceTime::CLASS_VERIFY); duke@435: bool verify_ok = verify_code(this_oop, throw_verifyerror, THREAD); duke@435: if (!verify_ok) { duke@435: return false; duke@435: } duke@435: } duke@435: duke@435: // Just in case a side-effect of verify linked this class already duke@435: // (which can sometimes happen since the verifier loads classes duke@435: // using custom class loaders, which are free to initialize things) duke@435: if (this_oop->is_linked()) { duke@435: return true; duke@435: } duke@435: duke@435: // also sets rewritten duke@435: this_oop->rewrite_class(CHECK_false); duke@435: } duke@435: duke@435: // Initialize the vtable and interface table after duke@435: // methods have been rewritten since rewrite may duke@435: // fabricate new methodOops. duke@435: // also does loader constraint checking duke@435: if (!this_oop()->is_shared()) { duke@435: ResourceMark rm(THREAD); duke@435: this_oop->vtable()->initialize_vtable(true, CHECK_false); duke@435: this_oop->itable()->initialize_itable(true, CHECK_false); duke@435: } duke@435: #ifdef ASSERT duke@435: else { duke@435: ResourceMark rm(THREAD); duke@435: this_oop->vtable()->verify(tty, true); duke@435: // In case itable verification is ever added. duke@435: // this_oop->itable()->verify(tty, true); duke@435: } duke@435: #endif duke@435: this_oop->set_init_state(linked); duke@435: if (JvmtiExport::should_post_class_prepare()) { duke@435: Thread *thread = THREAD; duke@435: assert(thread->is_Java_thread(), "thread->is_Java_thread()"); duke@435: JvmtiExport::post_class_prepare((JavaThread *) thread, this_oop()); duke@435: } duke@435: } duke@435: } duke@435: return true; duke@435: } duke@435: duke@435: duke@435: // Rewrite the byte codes of all of the methods of a class. duke@435: // Three cases: duke@435: // During the link of a newly loaded class. duke@435: // During the preloading of classes to be written to the shared spaces. duke@435: // - Rewrite the methods and update the method entry points. duke@435: // duke@435: // During the link of a class in the shared spaces. duke@435: // - The methods were already rewritten, update the metho entry points. duke@435: // duke@435: // The rewriter must be called exactly once. Rewriting must happen after duke@435: // verification but before the first method of the class is executed. duke@435: duke@435: void instanceKlass::rewrite_class(TRAPS) { duke@435: assert(is_loaded(), "must be loaded"); duke@435: instanceKlassHandle this_oop(THREAD, this->as_klassOop()); duke@435: if (this_oop->is_rewritten()) { duke@435: assert(this_oop()->is_shared(), "rewriting an unshared class?"); duke@435: return; duke@435: } duke@435: Rewriter::rewrite(this_oop, CHECK); // No exception can happen here duke@435: this_oop->set_rewritten(); duke@435: } duke@435: duke@435: duke@435: void instanceKlass::initialize_impl(instanceKlassHandle this_oop, TRAPS) { duke@435: // Make sure klass is linked (verified) before initialization duke@435: // A class could already be verified, since it has been reflected upon. duke@435: this_oop->link_class(CHECK); duke@435: fparain@1759: DTRACE_CLASSINIT_PROBE(required, instanceKlass::cast(this_oop()), -1); fparain@1759: fparain@1759: bool wait = false; fparain@1759: duke@435: // refer to the JVM book page 47 for description of steps duke@435: // Step 1 duke@435: { ObjectLocker ol(this_oop, THREAD); duke@435: duke@435: Thread *self = THREAD; // it's passed the current thread duke@435: duke@435: // Step 2 duke@435: // If we were to use wait() instead of waitInterruptibly() then duke@435: // we might end up throwing IE from link/symbol resolution sites duke@435: // that aren't expected to throw. This would wreak havoc. See 6320309. duke@435: while(this_oop->is_being_initialized() && !this_oop->is_reentrant_initialization(self)) { fparain@1759: wait = true; duke@435: ol.waitUninterruptibly(CHECK); duke@435: } duke@435: duke@435: // Step 3 fparain@1759: if (this_oop->is_being_initialized() && this_oop->is_reentrant_initialization(self)) { fparain@1759: DTRACE_CLASSINIT_PROBE_WAIT(recursive, instanceKlass::cast(this_oop()), -1,wait); duke@435: return; fparain@1759: } duke@435: duke@435: // Step 4 fparain@1759: if (this_oop->is_initialized()) { fparain@1759: DTRACE_CLASSINIT_PROBE_WAIT(concurrent, instanceKlass::cast(this_oop()), -1,wait); duke@435: return; fparain@1759: } duke@435: duke@435: // Step 5 duke@435: if (this_oop->is_in_error_state()) { fparain@1759: DTRACE_CLASSINIT_PROBE_WAIT(erroneous, instanceKlass::cast(this_oop()), -1,wait); duke@435: ResourceMark rm(THREAD); duke@435: const char* desc = "Could not initialize class "; duke@435: const char* className = this_oop->external_name(); duke@435: size_t msglen = strlen(desc) + strlen(className) + 1; duke@435: char* message = NEW_C_HEAP_ARRAY(char, msglen); duke@435: if (NULL == message) { duke@435: // Out of memory: can't create detailed error message duke@435: THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), className); duke@435: } else { duke@435: jio_snprintf(message, msglen, "%s%s", desc, className); duke@435: THROW_MSG(vmSymbols::java_lang_NoClassDefFoundError(), message); duke@435: } duke@435: } duke@435: duke@435: // Step 6 duke@435: this_oop->set_init_state(being_initialized); duke@435: this_oop->set_init_thread(self); duke@435: } duke@435: duke@435: // Step 7 duke@435: klassOop super_klass = this_oop->super(); duke@435: if (super_klass != NULL && !this_oop->is_interface() && Klass::cast(super_klass)->should_be_initialized()) { duke@435: Klass::cast(super_klass)->initialize(THREAD); duke@435: duke@435: if (HAS_PENDING_EXCEPTION) { duke@435: Handle e(THREAD, PENDING_EXCEPTION); duke@435: CLEAR_PENDING_EXCEPTION; duke@435: { duke@435: EXCEPTION_MARK; duke@435: this_oop->set_initialization_state_and_notify(initialization_error, THREAD); // Locks object, set state, and notify all waiting threads duke@435: CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, superclass initialization error is thrown below duke@435: } fparain@1759: DTRACE_CLASSINIT_PROBE_WAIT(super__failed, instanceKlass::cast(this_oop()), -1,wait); duke@435: THROW_OOP(e()); duke@435: } duke@435: } duke@435: duke@435: // Step 8 duke@435: { duke@435: assert(THREAD->is_Java_thread(), "non-JavaThread in initialize_impl"); duke@435: JavaThread* jt = (JavaThread*)THREAD; fparain@1759: DTRACE_CLASSINIT_PROBE_WAIT(clinit, instanceKlass::cast(this_oop()), -1,wait); duke@435: // Timer includes any side effects of class initialization (resolution, duke@435: // etc), but not recursive entry into call_class_initializer(). mchung@1310: PerfClassTraceTime timer(ClassLoader::perf_class_init_time(), mchung@1310: ClassLoader::perf_class_init_selftime(), mchung@1310: ClassLoader::perf_classes_inited(), mchung@1310: jt->get_thread_stat()->perf_recursion_counts_addr(), mchung@1310: jt->get_thread_stat()->perf_timers_addr(), mchung@1310: PerfClassTraceTime::CLASS_CLINIT); duke@435: this_oop->call_class_initializer(THREAD); duke@435: } duke@435: duke@435: // Step 9 duke@435: if (!HAS_PENDING_EXCEPTION) { duke@435: this_oop->set_initialization_state_and_notify(fully_initialized, CHECK); duke@435: { ResourceMark rm(THREAD); duke@435: debug_only(this_oop->vtable()->verify(tty, true);) duke@435: } duke@435: } duke@435: else { duke@435: // Step 10 and 11 duke@435: Handle e(THREAD, PENDING_EXCEPTION); duke@435: CLEAR_PENDING_EXCEPTION; duke@435: { duke@435: EXCEPTION_MARK; duke@435: this_oop->set_initialization_state_and_notify(initialization_error, THREAD); duke@435: CLEAR_PENDING_EXCEPTION; // ignore any exception thrown, class initialization error is thrown below duke@435: } fparain@1759: DTRACE_CLASSINIT_PROBE_WAIT(error, instanceKlass::cast(this_oop()), -1,wait); never@1577: if (e->is_a(SystemDictionary::Error_klass())) { duke@435: THROW_OOP(e()); duke@435: } else { duke@435: JavaCallArguments args(e); duke@435: THROW_ARG(vmSymbolHandles::java_lang_ExceptionInInitializerError(), duke@435: vmSymbolHandles::throwable_void_signature(), duke@435: &args); duke@435: } duke@435: } fparain@1759: DTRACE_CLASSINIT_PROBE_WAIT(end, instanceKlass::cast(this_oop()), -1,wait); duke@435: } duke@435: duke@435: duke@435: // Note: implementation moved to static method to expose the this pointer. duke@435: void instanceKlass::set_initialization_state_and_notify(ClassState state, TRAPS) { duke@435: instanceKlassHandle kh(THREAD, this->as_klassOop()); duke@435: set_initialization_state_and_notify_impl(kh, state, CHECK); duke@435: } duke@435: duke@435: void instanceKlass::set_initialization_state_and_notify_impl(instanceKlassHandle this_oop, ClassState state, TRAPS) { duke@435: ObjectLocker ol(this_oop, THREAD); duke@435: this_oop->set_init_state(state); duke@435: ol.notify_all(CHECK); duke@435: } duke@435: duke@435: void instanceKlass::add_implementor(klassOop k) { duke@435: assert(Compile_lock->owned_by_self(), ""); duke@435: // Filter out my subinterfaces. duke@435: // (Note: Interfaces are never on the subklass list.) duke@435: if (instanceKlass::cast(k)->is_interface()) return; duke@435: duke@435: // Filter out subclasses whose supers already implement me. duke@435: // (Note: CHA must walk subclasses of direct implementors duke@435: // in order to locate indirect implementors.) duke@435: klassOop sk = instanceKlass::cast(k)->super(); duke@435: if (sk != NULL && instanceKlass::cast(sk)->implements_interface(as_klassOop())) duke@435: // We only need to check one immediate superclass, since the duke@435: // implements_interface query looks at transitive_interfaces. duke@435: // Any supers of the super have the same (or fewer) transitive_interfaces. duke@435: return; duke@435: duke@435: // Update number of implementors duke@435: int i = _nof_implementors++; duke@435: duke@435: // Record this implementor, if there are not too many already duke@435: if (i < implementors_limit) { duke@435: assert(_implementors[i] == NULL, "should be exactly one implementor"); duke@435: oop_store_without_check((oop*)&_implementors[i], k); duke@435: } else if (i == implementors_limit) { duke@435: // clear out the list on first overflow duke@435: for (int i2 = 0; i2 < implementors_limit; i2++) duke@435: oop_store_without_check((oop*)&_implementors[i2], NULL); duke@435: } duke@435: duke@435: // The implementor also implements the transitive_interfaces duke@435: for (int index = 0; index < local_interfaces()->length(); index++) { duke@435: instanceKlass::cast(klassOop(local_interfaces()->obj_at(index)))->add_implementor(k); duke@435: } duke@435: } duke@435: duke@435: void instanceKlass::init_implementor() { duke@435: for (int i = 0; i < implementors_limit; i++) duke@435: oop_store_without_check((oop*)&_implementors[i], NULL); duke@435: _nof_implementors = 0; duke@435: } duke@435: duke@435: duke@435: void instanceKlass::process_interfaces(Thread *thread) { duke@435: // link this class into the implementors list of every interface it implements duke@435: KlassHandle this_as_oop (thread, this->as_klassOop()); duke@435: for (int i = local_interfaces()->length() - 1; i >= 0; i--) { duke@435: assert(local_interfaces()->obj_at(i)->is_klass(), "must be a klass"); duke@435: instanceKlass* interf = instanceKlass::cast(klassOop(local_interfaces()->obj_at(i))); duke@435: assert(interf->is_interface(), "expected interface"); duke@435: interf->add_implementor(this_as_oop()); duke@435: } duke@435: } duke@435: duke@435: bool instanceKlass::can_be_primary_super_slow() const { duke@435: if (is_interface()) duke@435: return false; duke@435: else duke@435: return Klass::can_be_primary_super_slow(); duke@435: } duke@435: duke@435: objArrayOop instanceKlass::compute_secondary_supers(int num_extra_slots, TRAPS) { duke@435: // The secondaries are the implemented interfaces. duke@435: instanceKlass* ik = instanceKlass::cast(as_klassOop()); duke@435: objArrayHandle interfaces (THREAD, ik->transitive_interfaces()); duke@435: int num_secondaries = num_extra_slots + interfaces->length(); duke@435: if (num_secondaries == 0) { duke@435: return Universe::the_empty_system_obj_array(); duke@435: } else if (num_extra_slots == 0) { duke@435: return interfaces(); duke@435: } else { duke@435: // a mix of both duke@435: objArrayOop secondaries = oopFactory::new_system_objArray(num_secondaries, CHECK_NULL); duke@435: for (int i = 0; i < interfaces->length(); i++) { duke@435: secondaries->obj_at_put(num_extra_slots+i, interfaces->obj_at(i)); duke@435: } duke@435: return secondaries; duke@435: } duke@435: } duke@435: duke@435: bool instanceKlass::compute_is_subtype_of(klassOop k) { duke@435: if (Klass::cast(k)->is_interface()) { duke@435: return implements_interface(k); duke@435: } else { duke@435: return Klass::compute_is_subtype_of(k); duke@435: } duke@435: } duke@435: duke@435: bool instanceKlass::implements_interface(klassOop k) const { duke@435: if (as_klassOop() == k) return true; duke@435: assert(Klass::cast(k)->is_interface(), "should be an interface class"); duke@435: for (int i = 0; i < transitive_interfaces()->length(); i++) { duke@435: if (transitive_interfaces()->obj_at(i) == k) { duke@435: return true; duke@435: } duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: objArrayOop instanceKlass::allocate_objArray(int n, int length, TRAPS) { duke@435: if (length < 0) THROW_0(vmSymbols::java_lang_NegativeArraySizeException()); duke@435: if (length > arrayOopDesc::max_array_length(T_OBJECT)) { martin@1311: report_java_out_of_memory("Requested array size exceeds VM limit"); duke@435: THROW_OOP_0(Universe::out_of_memory_error_array_size()); duke@435: } duke@435: int size = objArrayOopDesc::object_size(length); duke@435: klassOop ak = array_klass(n, CHECK_NULL); duke@435: KlassHandle h_ak (THREAD, ak); duke@435: objArrayOop o = duke@435: (objArrayOop)CollectedHeap::array_allocate(h_ak, size, length, CHECK_NULL); duke@435: return o; duke@435: } duke@435: duke@435: instanceOop instanceKlass::register_finalizer(instanceOop i, TRAPS) { duke@435: if (TraceFinalizerRegistration) { duke@435: tty->print("Registered "); duke@435: i->print_value_on(tty); duke@435: tty->print_cr(" (" INTPTR_FORMAT ") as finalizable", (address)i); duke@435: } duke@435: instanceHandle h_i(THREAD, i); duke@435: // Pass the handle as argument, JavaCalls::call expects oop as jobjects duke@435: JavaValue result(T_VOID); duke@435: JavaCallArguments args(h_i); duke@435: methodHandle mh (THREAD, Universe::finalizer_register_method()); duke@435: JavaCalls::call(&result, mh, &args, CHECK_NULL); duke@435: return h_i(); duke@435: } duke@435: duke@435: instanceOop instanceKlass::allocate_instance(TRAPS) { duke@435: bool has_finalizer_flag = has_finalizer(); // Query before possible GC duke@435: int size = size_helper(); // Query before forming handle. duke@435: duke@435: KlassHandle h_k(THREAD, as_klassOop()); duke@435: duke@435: instanceOop i; duke@435: duke@435: i = (instanceOop)CollectedHeap::obj_allocate(h_k, size, CHECK_NULL); duke@435: if (has_finalizer_flag && !RegisterFinalizersAtInit) { duke@435: i = register_finalizer(i, CHECK_NULL); duke@435: } duke@435: return i; duke@435: } duke@435: duke@435: instanceOop instanceKlass::allocate_permanent_instance(TRAPS) { duke@435: // Finalizer registration occurs in the Object. constructor duke@435: // and constructors normally aren't run when allocating perm duke@435: // instances so simply disallow finalizable perm objects. This can duke@435: // be relaxed if a need for it is found. duke@435: assert(!has_finalizer(), "perm objects not allowed to have finalizers"); duke@435: int size = size_helper(); // Query before forming handle. duke@435: KlassHandle h_k(THREAD, as_klassOop()); duke@435: instanceOop i = (instanceOop) duke@435: CollectedHeap::permanent_obj_allocate(h_k, size, CHECK_NULL); duke@435: return i; duke@435: } duke@435: duke@435: void instanceKlass::check_valid_for_instantiation(bool throwError, TRAPS) { duke@435: if (is_interface() || is_abstract()) { duke@435: ResourceMark rm(THREAD); duke@435: THROW_MSG(throwError ? vmSymbols::java_lang_InstantiationError() duke@435: : vmSymbols::java_lang_InstantiationException(), external_name()); duke@435: } never@1577: if (as_klassOop() == SystemDictionary::Class_klass()) { duke@435: ResourceMark rm(THREAD); duke@435: THROW_MSG(throwError ? vmSymbols::java_lang_IllegalAccessError() duke@435: : vmSymbols::java_lang_IllegalAccessException(), external_name()); duke@435: } duke@435: } duke@435: duke@435: klassOop instanceKlass::array_klass_impl(bool or_null, int n, TRAPS) { duke@435: instanceKlassHandle this_oop(THREAD, as_klassOop()); duke@435: return array_klass_impl(this_oop, or_null, n, THREAD); duke@435: } duke@435: duke@435: klassOop instanceKlass::array_klass_impl(instanceKlassHandle this_oop, bool or_null, int n, TRAPS) { duke@435: if (this_oop->array_klasses() == NULL) { duke@435: if (or_null) return NULL; duke@435: duke@435: ResourceMark rm; duke@435: JavaThread *jt = (JavaThread *)THREAD; duke@435: { duke@435: // Atomic creation of array_klasses duke@435: MutexLocker mc(Compile_lock, THREAD); // for vtables duke@435: MutexLocker ma(MultiArray_lock, THREAD); duke@435: duke@435: // Check if update has already taken place duke@435: if (this_oop->array_klasses() == NULL) { duke@435: objArrayKlassKlass* oakk = duke@435: (objArrayKlassKlass*)Universe::objArrayKlassKlassObj()->klass_part(); duke@435: duke@435: klassOop k = oakk->allocate_objArray_klass(1, this_oop, CHECK_NULL); duke@435: this_oop->set_array_klasses(k); duke@435: } duke@435: } duke@435: } duke@435: // _this will always be set at this point duke@435: objArrayKlass* oak = (objArrayKlass*)this_oop->array_klasses()->klass_part(); duke@435: if (or_null) { duke@435: return oak->array_klass_or_null(n); duke@435: } duke@435: return oak->array_klass(n, CHECK_NULL); duke@435: } duke@435: duke@435: klassOop instanceKlass::array_klass_impl(bool or_null, TRAPS) { duke@435: return array_klass_impl(or_null, 1, THREAD); duke@435: } duke@435: duke@435: void instanceKlass::call_class_initializer(TRAPS) { duke@435: instanceKlassHandle ik (THREAD, as_klassOop()); duke@435: call_class_initializer_impl(ik, THREAD); duke@435: } duke@435: duke@435: static int call_class_initializer_impl_counter = 0; // for debugging duke@435: duke@435: methodOop instanceKlass::class_initializer() { duke@435: return find_method(vmSymbols::class_initializer_name(), vmSymbols::void_method_signature()); duke@435: } duke@435: duke@435: void instanceKlass::call_class_initializer_impl(instanceKlassHandle this_oop, TRAPS) { duke@435: methodHandle h_method(THREAD, this_oop->class_initializer()); duke@435: assert(!this_oop->is_initialized(), "we cannot initialize twice"); duke@435: if (TraceClassInitialization) { duke@435: tty->print("%d Initializing ", call_class_initializer_impl_counter++); duke@435: this_oop->name()->print_value(); duke@435: tty->print_cr("%s (" INTPTR_FORMAT ")", h_method() == NULL ? "(no method)" : "", (address)this_oop()); duke@435: } duke@435: if (h_method() != NULL) { duke@435: JavaCallArguments args; // No arguments duke@435: JavaValue result(T_VOID); duke@435: JavaCalls::call(&result, h_method, &args, CHECK); // Static call (no args) duke@435: } duke@435: } duke@435: duke@435: duke@435: void instanceKlass::mask_for(methodHandle method, int bci, duke@435: InterpreterOopMap* entry_for) { duke@435: // Dirty read, then double-check under a lock. duke@435: if (_oop_map_cache == NULL) { duke@435: // Otherwise, allocate a new one. duke@435: MutexLocker x(OopMapCacheAlloc_lock); duke@435: // First time use. Allocate a cache in C heap duke@435: if (_oop_map_cache == NULL) { duke@435: _oop_map_cache = new OopMapCache(); duke@435: } duke@435: } duke@435: // _oop_map_cache is constant after init; lookup below does is own locking. duke@435: _oop_map_cache->lookup(method, bci, entry_for); duke@435: } duke@435: duke@435: duke@435: bool instanceKlass::find_local_field(symbolOop name, symbolOop sig, fieldDescriptor* fd) const { duke@435: const int n = fields()->length(); duke@435: for (int i = 0; i < n; i += next_offset ) { duke@435: int name_index = fields()->ushort_at(i + name_index_offset); duke@435: int sig_index = fields()->ushort_at(i + signature_index_offset); duke@435: symbolOop f_name = constants()->symbol_at(name_index); duke@435: symbolOop f_sig = constants()->symbol_at(sig_index); duke@435: if (f_name == name && f_sig == sig) { duke@435: fd->initialize(as_klassOop(), i); duke@435: return true; duke@435: } duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: duke@435: void instanceKlass::field_names_and_sigs_iterate(OopClosure* closure) { duke@435: const int n = fields()->length(); duke@435: for (int i = 0; i < n; i += next_offset ) { duke@435: int name_index = fields()->ushort_at(i + name_index_offset); duke@435: symbolOop name = constants()->symbol_at(name_index); duke@435: closure->do_oop((oop*)&name); duke@435: duke@435: int sig_index = fields()->ushort_at(i + signature_index_offset); duke@435: symbolOop sig = constants()->symbol_at(sig_index); duke@435: closure->do_oop((oop*)&sig); duke@435: } duke@435: } duke@435: duke@435: duke@435: klassOop instanceKlass::find_interface_field(symbolOop name, symbolOop sig, fieldDescriptor* fd) const { duke@435: const int n = local_interfaces()->length(); duke@435: for (int i = 0; i < n; i++) { duke@435: klassOop intf1 = klassOop(local_interfaces()->obj_at(i)); duke@435: assert(Klass::cast(intf1)->is_interface(), "just checking type"); duke@435: // search for field in current interface duke@435: if (instanceKlass::cast(intf1)->find_local_field(name, sig, fd)) { duke@435: assert(fd->is_static(), "interface field must be static"); duke@435: return intf1; duke@435: } duke@435: // search for field in direct superinterfaces duke@435: klassOop intf2 = instanceKlass::cast(intf1)->find_interface_field(name, sig, fd); duke@435: if (intf2 != NULL) return intf2; duke@435: } duke@435: // otherwise field lookup fails duke@435: return NULL; duke@435: } duke@435: duke@435: duke@435: klassOop instanceKlass::find_field(symbolOop name, symbolOop sig, fieldDescriptor* fd) const { duke@435: // search order according to newest JVM spec (5.4.3.2, p.167). duke@435: // 1) search for field in current klass duke@435: if (find_local_field(name, sig, fd)) { duke@435: return as_klassOop(); duke@435: } duke@435: // 2) search for field recursively in direct superinterfaces duke@435: { klassOop intf = find_interface_field(name, sig, fd); duke@435: if (intf != NULL) return intf; duke@435: } duke@435: // 3) apply field lookup recursively if superclass exists duke@435: { klassOop supr = super(); duke@435: if (supr != NULL) return instanceKlass::cast(supr)->find_field(name, sig, fd); duke@435: } duke@435: // 4) otherwise field lookup fails duke@435: return NULL; duke@435: } duke@435: duke@435: duke@435: klassOop instanceKlass::find_field(symbolOop name, symbolOop sig, bool is_static, fieldDescriptor* fd) const { duke@435: // search order according to newest JVM spec (5.4.3.2, p.167). duke@435: // 1) search for field in current klass duke@435: if (find_local_field(name, sig, fd)) { duke@435: if (fd->is_static() == is_static) return as_klassOop(); duke@435: } duke@435: // 2) search for field recursively in direct superinterfaces duke@435: if (is_static) { duke@435: klassOop intf = find_interface_field(name, sig, fd); duke@435: if (intf != NULL) return intf; duke@435: } duke@435: // 3) apply field lookup recursively if superclass exists duke@435: { klassOop supr = super(); duke@435: if (supr != NULL) return instanceKlass::cast(supr)->find_field(name, sig, is_static, fd); duke@435: } duke@435: // 4) otherwise field lookup fails duke@435: return NULL; duke@435: } duke@435: duke@435: duke@435: bool instanceKlass::find_local_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const { duke@435: int length = fields()->length(); duke@435: for (int i = 0; i < length; i += next_offset) { duke@435: if (offset_from_fields( i ) == offset) { duke@435: fd->initialize(as_klassOop(), i); duke@435: if (fd->is_static() == is_static) return true; duke@435: } duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: duke@435: bool instanceKlass::find_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const { duke@435: klassOop klass = as_klassOop(); duke@435: while (klass != NULL) { duke@435: if (instanceKlass::cast(klass)->find_local_field_from_offset(offset, is_static, fd)) { duke@435: return true; duke@435: } duke@435: klass = Klass::cast(klass)->super(); duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: duke@435: void instanceKlass::methods_do(void f(methodOop method)) { duke@435: int len = methods()->length(); duke@435: for (int index = 0; index < len; index++) { duke@435: methodOop m = methodOop(methods()->obj_at(index)); duke@435: assert(m->is_method(), "must be method"); duke@435: f(m); duke@435: } duke@435: } duke@435: duke@435: void instanceKlass::do_local_static_fields(FieldClosure* cl) { duke@435: fieldDescriptor fd; duke@435: int length = fields()->length(); duke@435: for (int i = 0; i < length; i += next_offset) { duke@435: fd.initialize(as_klassOop(), i); duke@435: if (fd.is_static()) cl->do_field(&fd); duke@435: } duke@435: } duke@435: duke@435: duke@435: void instanceKlass::do_local_static_fields(void f(fieldDescriptor*, TRAPS), TRAPS) { duke@435: instanceKlassHandle h_this(THREAD, as_klassOop()); duke@435: do_local_static_fields_impl(h_this, f, CHECK); duke@435: } duke@435: duke@435: duke@435: void instanceKlass::do_local_static_fields_impl(instanceKlassHandle this_oop, void f(fieldDescriptor* fd, TRAPS), TRAPS) { duke@435: fieldDescriptor fd; duke@435: int length = this_oop->fields()->length(); duke@435: for (int i = 0; i < length; i += next_offset) { duke@435: fd.initialize(this_oop(), i); duke@435: if (fd.is_static()) { f(&fd, CHECK); } // Do NOT remove {}! (CHECK macro expands into several statements) duke@435: } duke@435: } duke@435: duke@435: kvn@479: static int compare_fields_by_offset(int* a, int* b) { kvn@479: return a[0] - b[0]; kvn@479: } kvn@479: duke@435: void instanceKlass::do_nonstatic_fields(FieldClosure* cl) { duke@435: instanceKlass* super = superklass(); duke@435: if (super != NULL) { duke@435: super->do_nonstatic_fields(cl); duke@435: } kvn@479: fieldDescriptor fd; duke@435: int length = fields()->length(); kvn@479: // In DebugInfo nonstatic fields are sorted by offset. kvn@479: int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1)); kvn@479: int j = 0; duke@435: for (int i = 0; i < length; i += next_offset) { duke@435: fd.initialize(as_klassOop(), i); kvn@479: if (!fd.is_static()) { kvn@479: fields_sorted[j + 0] = fd.offset(); kvn@479: fields_sorted[j + 1] = i; kvn@479: j += 2; kvn@479: } duke@435: } kvn@479: if (j > 0) { kvn@479: length = j; kvn@479: // _sort_Fn is defined in growableArray.hpp. kvn@479: qsort(fields_sorted, length/2, 2*sizeof(int), (_sort_Fn)compare_fields_by_offset); kvn@479: for (int i = 0; i < length; i += 2) { kvn@479: fd.initialize(as_klassOop(), fields_sorted[i + 1]); kvn@479: assert(!fd.is_static() && fd.offset() == fields_sorted[i], "only nonstatic fields"); kvn@479: cl->do_field(&fd); kvn@479: } kvn@479: } kvn@479: FREE_C_HEAP_ARRAY(int, fields_sorted); duke@435: } duke@435: duke@435: duke@435: void instanceKlass::array_klasses_do(void f(klassOop k)) { duke@435: if (array_klasses() != NULL) duke@435: arrayKlass::cast(array_klasses())->array_klasses_do(f); duke@435: } duke@435: duke@435: duke@435: void instanceKlass::with_array_klasses_do(void f(klassOop k)) { duke@435: f(as_klassOop()); duke@435: array_klasses_do(f); duke@435: } duke@435: duke@435: #ifdef ASSERT duke@435: static int linear_search(objArrayOop methods, symbolOop name, symbolOop signature) { duke@435: int len = methods->length(); duke@435: for (int index = 0; index < len; index++) { duke@435: methodOop m = (methodOop)(methods->obj_at(index)); duke@435: assert(m->is_method(), "must be method"); duke@435: if (m->signature() == signature && m->name() == name) { duke@435: return index; duke@435: } duke@435: } duke@435: return -1; duke@435: } duke@435: #endif duke@435: duke@435: methodOop instanceKlass::find_method(symbolOop name, symbolOop signature) const { duke@435: return instanceKlass::find_method(methods(), name, signature); duke@435: } duke@435: duke@435: methodOop instanceKlass::find_method(objArrayOop methods, symbolOop name, symbolOop signature) { duke@435: int len = methods->length(); duke@435: // methods are sorted, so do binary search duke@435: int l = 0; duke@435: int h = len - 1; duke@435: while (l <= h) { duke@435: int mid = (l + h) >> 1; duke@435: methodOop m = (methodOop)methods->obj_at(mid); duke@435: assert(m->is_method(), "must be method"); duke@435: int res = m->name()->fast_compare(name); duke@435: if (res == 0) { duke@435: // found matching name; do linear search to find matching signature duke@435: // first, quick check for common case duke@435: if (m->signature() == signature) return m; duke@435: // search downwards through overloaded methods duke@435: int i; duke@435: for (i = mid - 1; i >= l; i--) { duke@435: methodOop m = (methodOop)methods->obj_at(i); duke@435: assert(m->is_method(), "must be method"); duke@435: if (m->name() != name) break; duke@435: if (m->signature() == signature) return m; duke@435: } duke@435: // search upwards duke@435: for (i = mid + 1; i <= h; i++) { duke@435: methodOop m = (methodOop)methods->obj_at(i); duke@435: assert(m->is_method(), "must be method"); duke@435: if (m->name() != name) break; duke@435: if (m->signature() == signature) return m; duke@435: } duke@435: // not found duke@435: #ifdef ASSERT duke@435: int index = linear_search(methods, name, signature); jcoomes@1845: assert(index == -1, err_msg("binary search should have found entry %d", index)); duke@435: #endif duke@435: return NULL; duke@435: } else if (res < 0) { duke@435: l = mid + 1; duke@435: } else { duke@435: h = mid - 1; duke@435: } duke@435: } duke@435: #ifdef ASSERT duke@435: int index = linear_search(methods, name, signature); jcoomes@1845: assert(index == -1, err_msg("binary search should have found entry %d", index)); duke@435: #endif duke@435: return NULL; duke@435: } duke@435: duke@435: methodOop instanceKlass::uncached_lookup_method(symbolOop name, symbolOop signature) const { duke@435: klassOop klass = as_klassOop(); duke@435: while (klass != NULL) { duke@435: methodOop method = instanceKlass::cast(klass)->find_method(name, signature); duke@435: if (method != NULL) return method; duke@435: klass = instanceKlass::cast(klass)->super(); duke@435: } duke@435: return NULL; duke@435: } duke@435: duke@435: // lookup a method in all the interfaces that this class implements duke@435: methodOop instanceKlass::lookup_method_in_all_interfaces(symbolOop name, duke@435: symbolOop signature) const { duke@435: objArrayOop all_ifs = instanceKlass::cast(as_klassOop())->transitive_interfaces(); duke@435: int num_ifs = all_ifs->length(); duke@435: instanceKlass *ik = NULL; duke@435: for (int i = 0; i < num_ifs; i++) { duke@435: ik = instanceKlass::cast(klassOop(all_ifs->obj_at(i))); duke@435: methodOop m = ik->lookup_method(name, signature); duke@435: if (m != NULL) { duke@435: return m; duke@435: } duke@435: } duke@435: return NULL; duke@435: } duke@435: duke@435: /* jni_id_for_impl for jfieldIds only */ duke@435: JNIid* instanceKlass::jni_id_for_impl(instanceKlassHandle this_oop, int offset) { duke@435: MutexLocker ml(JfieldIdCreation_lock); duke@435: // Retry lookup after we got the lock duke@435: JNIid* probe = this_oop->jni_ids() == NULL ? NULL : this_oop->jni_ids()->find(offset); duke@435: if (probe == NULL) { duke@435: // Slow case, allocate new static field identifier duke@435: probe = new JNIid(this_oop->as_klassOop(), offset, this_oop->jni_ids()); duke@435: this_oop->set_jni_ids(probe); duke@435: } duke@435: return probe; duke@435: } duke@435: duke@435: duke@435: /* jni_id_for for jfieldIds only */ duke@435: JNIid* instanceKlass::jni_id_for(int offset) { duke@435: JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset); duke@435: if (probe == NULL) { duke@435: probe = jni_id_for_impl(this->as_klassOop(), offset); duke@435: } duke@435: return probe; duke@435: } duke@435: duke@435: duke@435: // Lookup or create a jmethodID. dcubed@1412: // This code is called by the VMThread and JavaThreads so the dcubed@1412: // locking has to be done very carefully to avoid deadlocks dcubed@1412: // and/or other cache consistency problems. dcubed@1412: // dcubed@1412: jmethodID instanceKlass::get_jmethod_id(instanceKlassHandle ik_h, methodHandle method_h) { duke@435: size_t idnum = (size_t)method_h->method_idnum(); duke@435: jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire(); duke@435: size_t length = 0; duke@435: jmethodID id = NULL; duke@435: dcubed@1412: // We use a double-check locking idiom here because this cache is dcubed@1412: // performance sensitive. In the normal system, this cache only dcubed@1412: // transitions from NULL to non-NULL which is safe because we use dcubed@1412: // release_set_methods_jmethod_ids() to advertise the new cache. dcubed@1412: // A partially constructed cache should never be seen by a racing dcubed@1412: // thread. We also use release_store_ptr() to save a new jmethodID dcubed@1412: // in the cache so a partially constructed jmethodID should never be dcubed@1412: // seen either. Cache reads of existing jmethodIDs proceed without a dcubed@1412: // lock, but cache writes of a new jmethodID requires uniqueness and dcubed@1412: // creation of the cache itself requires no leaks so a lock is dcubed@1412: // generally acquired in those two cases. dcubed@1412: // dcubed@1412: // If the RedefineClasses() API has been used, then this cache can dcubed@1412: // grow and we'll have transitions from non-NULL to bigger non-NULL. dcubed@1412: // Cache creation requires no leaks and we require safety between all dcubed@1412: // cache accesses and freeing of the old cache so a lock is generally dcubed@1412: // acquired when the RedefineClasses() API has been used. duke@435: dcubed@1412: if (jmeths != NULL) { dcubed@1412: // the cache already exists dcubed@1412: if (!ik_h->idnum_can_increment()) { dcubed@1412: // the cache can't grow so we can just get the current values dcubed@1412: get_jmethod_id_length_value(jmeths, idnum, &length, &id); dcubed@1412: } else { dcubed@1412: // cache can grow so we have to be more careful dcubed@1412: if (Threads::number_of_threads() == 0 || dcubed@1412: SafepointSynchronize::is_at_safepoint()) { dcubed@1412: // we're single threaded or at a safepoint - no locking needed dcubed@1412: get_jmethod_id_length_value(jmeths, idnum, &length, &id); dcubed@1412: } else { dcubed@1412: MutexLocker ml(JmethodIdCreation_lock); dcubed@1412: get_jmethod_id_length_value(jmeths, idnum, &length, &id); dcubed@1412: } dcubed@1412: } dcubed@1412: } dcubed@1412: // implied else: dcubed@1412: // we need to allocate a cache so default length and id values are good dcubed@1412: dcubed@1412: if (jmeths == NULL || // no cache yet dcubed@1412: length <= idnum || // cache is too short dcubed@1412: id == NULL) { // cache doesn't contain entry dcubed@1412: dcubed@1412: // This function can be called by the VMThread so we have to do all dcubed@1412: // things that might block on a safepoint before grabbing the lock. dcubed@1412: // Otherwise, we can deadlock with the VMThread or have a cache dcubed@1412: // consistency issue. These vars keep track of what we might have dcubed@1412: // to free after the lock is dropped. dcubed@1412: jmethodID to_dealloc_id = NULL; dcubed@1412: jmethodID* to_dealloc_jmeths = NULL; dcubed@1412: dcubed@1412: // may not allocate new_jmeths or use it if we allocate it duke@435: jmethodID* new_jmeths = NULL; duke@435: if (length <= idnum) { dcubed@1412: // allocate a new cache that might be used duke@435: size_t size = MAX2(idnum+1, (size_t)ik_h->idnum_allocated_count()); duke@435: new_jmeths = NEW_C_HEAP_ARRAY(jmethodID, size+1); duke@435: memset(new_jmeths, 0, (size+1)*sizeof(jmethodID)); dcubed@1412: // cache size is stored in element[0], other elements offset by one dcubed@1412: new_jmeths[0] = (jmethodID)size; duke@435: } duke@435: dcubed@1412: // allocate a new jmethodID that might be used duke@435: jmethodID new_id = NULL; duke@435: if (method_h->is_old() && !method_h->is_obsolete()) { duke@435: // The method passed in is old (but not obsolete), we need to use the current version duke@435: methodOop current_method = ik_h->method_with_idnum((int)idnum); duke@435: assert(current_method != NULL, "old and but not obsolete, so should exist"); duke@435: methodHandle current_method_h(current_method == NULL? method_h() : current_method); duke@435: new_id = JNIHandles::make_jmethod_id(current_method_h); duke@435: } else { duke@435: // It is the current version of the method or an obsolete method, duke@435: // use the version passed in duke@435: new_id = JNIHandles::make_jmethod_id(method_h); duke@435: } duke@435: dcubed@1412: if (Threads::number_of_threads() == 0 || dcubed@1412: SafepointSynchronize::is_at_safepoint()) { dcubed@1412: // we're single threaded or at a safepoint - no locking needed dcubed@1412: id = get_jmethod_id_fetch_or_update(ik_h, idnum, new_id, new_jmeths, dcubed@1412: &to_dealloc_id, &to_dealloc_jmeths); dcubed@484: } else { duke@435: MutexLocker ml(JmethodIdCreation_lock); dcubed@1412: id = get_jmethod_id_fetch_or_update(ik_h, idnum, new_id, new_jmeths, dcubed@1412: &to_dealloc_id, &to_dealloc_jmeths); dcubed@1412: } dcubed@1412: dcubed@1412: // The lock has been dropped so we can free resources. dcubed@1412: // Free up either the old cache or the new cache if we allocated one. dcubed@1412: if (to_dealloc_jmeths != NULL) { dcubed@1412: FreeHeap(to_dealloc_jmeths); dcubed@1412: } dcubed@1412: // free up the new ID since it wasn't needed dcubed@1412: if (to_dealloc_id != NULL) { dcubed@1412: JNIHandles::destroy_jmethod_id(to_dealloc_id); dcubed@484: } dcubed@484: } dcubed@484: return id; dcubed@484: } duke@435: duke@435: dcubed@1412: // Common code to fetch the jmethodID from the cache or update the dcubed@1412: // cache with the new jmethodID. This function should never do anything dcubed@1412: // that causes the caller to go to a safepoint or we can deadlock with dcubed@1412: // the VMThread or have cache consistency issues. dcubed@1412: // dcubed@1412: jmethodID instanceKlass::get_jmethod_id_fetch_or_update( dcubed@1412: instanceKlassHandle ik_h, size_t idnum, jmethodID new_id, dcubed@1412: jmethodID* new_jmeths, jmethodID* to_dealloc_id_p, dcubed@1412: jmethodID** to_dealloc_jmeths_p) { dcubed@1412: assert(new_id != NULL, "sanity check"); dcubed@1412: assert(to_dealloc_id_p != NULL, "sanity check"); dcubed@1412: assert(to_dealloc_jmeths_p != NULL, "sanity check"); dcubed@1412: assert(Threads::number_of_threads() == 0 || dcubed@1412: SafepointSynchronize::is_at_safepoint() || dcubed@1412: JmethodIdCreation_lock->owned_by_self(), "sanity check"); dcubed@1412: dcubed@1412: // reacquire the cache - we are locked, single threaded or at a safepoint dcubed@484: jmethodID* jmeths = ik_h->methods_jmethod_ids_acquire(); dcubed@1412: jmethodID id = NULL; dcubed@1412: size_t length = 0; dcubed@484: dcubed@1412: if (jmeths == NULL || // no cache yet dcubed@1412: (length = (size_t)jmeths[0]) <= idnum) { // cache is too short dcubed@484: if (jmeths != NULL) { dcubed@1412: // copy any existing entries from the old cache dcubed@484: for (size_t index = 0; index < length; index++) { dcubed@484: new_jmeths[index+1] = jmeths[index+1]; duke@435: } dcubed@1412: *to_dealloc_jmeths_p = jmeths; // save old cache for later delete duke@435: } dcubed@484: ik_h->release_set_methods_jmethod_ids(jmeths = new_jmeths); dcubed@484: } else { dcubed@1412: // fetch jmethodID (if any) from the existing cache dcubed@484: id = jmeths[idnum+1]; dcubed@1412: *to_dealloc_jmeths_p = new_jmeths; // save new cache for later delete dcubed@484: } dcubed@484: if (id == NULL) { dcubed@1412: // No matching jmethodID in the existing cache or we have a new dcubed@1412: // cache or we just grew the cache. This cache write is done here dcubed@1412: // by the first thread to win the foot race because a jmethodID dcubed@1412: // needs to be unique once it is generally available. dcubed@484: id = new_id; dcubed@1412: dcubed@1412: // The jmethodID cache can be read while unlocked so we have to dcubed@1412: // make sure the new jmethodID is complete before installing it dcubed@1412: // in the cache. dcubed@1412: OrderAccess::release_store_ptr(&jmeths[idnum+1], id); dcubed@484: } else { dcubed@1412: *to_dealloc_id_p = new_id; // save new id for later delete duke@435: } duke@435: return id; duke@435: } duke@435: duke@435: dcubed@1412: // Common code to get the jmethodID cache length and the jmethodID dcubed@1412: // value at index idnum if there is one. dcubed@1412: // dcubed@1412: void instanceKlass::get_jmethod_id_length_value(jmethodID* cache, dcubed@1412: size_t idnum, size_t *length_p, jmethodID* id_p) { dcubed@1412: assert(cache != NULL, "sanity check"); dcubed@1412: assert(length_p != NULL, "sanity check"); dcubed@1412: assert(id_p != NULL, "sanity check"); dcubed@1412: dcubed@1412: // cache size is stored in element[0], other elements offset by one dcubed@1412: *length_p = (size_t)cache[0]; dcubed@1412: if (*length_p <= idnum) { // cache is too short dcubed@1412: *id_p = NULL; dcubed@1412: } else { dcubed@1412: *id_p = cache[idnum+1]; // fetch jmethodID (if any) dcubed@1412: } dcubed@1412: } dcubed@1412: dcubed@1412: duke@435: // Lookup a jmethodID, NULL if not found. Do no blocking, no allocations, no handles duke@435: jmethodID instanceKlass::jmethod_id_or_null(methodOop method) { duke@435: size_t idnum = (size_t)method->method_idnum(); duke@435: jmethodID* jmeths = methods_jmethod_ids_acquire(); duke@435: size_t length; // length assigned as debugging crumb duke@435: jmethodID id = NULL; dcubed@1412: if (jmeths != NULL && // If there is a cache duke@435: (length = (size_t)jmeths[0]) > idnum) { // and if it is long enough, duke@435: id = jmeths[idnum+1]; // Look up the id (may be NULL) duke@435: } duke@435: return id; duke@435: } duke@435: duke@435: duke@435: // Cache an itable index duke@435: void instanceKlass::set_cached_itable_index(size_t idnum, int index) { duke@435: int* indices = methods_cached_itable_indices_acquire(); dcubed@1412: int* to_dealloc_indices = NULL; dcubed@1412: dcubed@1412: // We use a double-check locking idiom here because this cache is dcubed@1412: // performance sensitive. In the normal system, this cache only dcubed@1412: // transitions from NULL to non-NULL which is safe because we use dcubed@1412: // release_set_methods_cached_itable_indices() to advertise the dcubed@1412: // new cache. A partially constructed cache should never be seen dcubed@1412: // by a racing thread. Cache reads and writes proceed without a dcubed@1412: // lock, but creation of the cache itself requires no leaks so a dcubed@1412: // lock is generally acquired in that case. dcubed@1412: // dcubed@1412: // If the RedefineClasses() API has been used, then this cache can dcubed@1412: // grow and we'll have transitions from non-NULL to bigger non-NULL. dcubed@1412: // Cache creation requires no leaks and we require safety between all dcubed@1412: // cache accesses and freeing of the old cache so a lock is generally dcubed@1412: // acquired when the RedefineClasses() API has been used. dcubed@1412: dcubed@1412: if (indices == NULL || idnum_can_increment()) { dcubed@1412: // we need a cache or the cache can grow duke@435: MutexLocker ml(JNICachedItableIndex_lock); dcubed@1412: // reacquire the cache to see if another thread already did the work duke@435: indices = methods_cached_itable_indices_acquire(); duke@435: size_t length = 0; dcubed@1412: // cache size is stored in element[0], other elements offset by one duke@435: if (indices == NULL || (length = (size_t)indices[0]) <= idnum) { duke@435: size_t size = MAX2(idnum+1, (size_t)idnum_allocated_count()); duke@435: int* new_indices = NEW_C_HEAP_ARRAY(int, size+1); dcubed@1412: new_indices[0] = (int)size; dcubed@1412: // copy any existing entries duke@435: size_t i; duke@435: for (i = 0; i < length; i++) { duke@435: new_indices[i+1] = indices[i+1]; duke@435: } duke@435: // Set all the rest to -1 duke@435: for (i = length; i < size; i++) { duke@435: new_indices[i+1] = -1; duke@435: } duke@435: if (indices != NULL) { dcubed@1412: // We have an old cache to delete so save it for after we dcubed@1412: // drop the lock. dcubed@1412: to_dealloc_indices = indices; duke@435: } duke@435: release_set_methods_cached_itable_indices(indices = new_indices); duke@435: } dcubed@1412: dcubed@1412: if (idnum_can_increment()) { dcubed@1412: // this cache can grow so we have to write to it safely dcubed@1412: indices[idnum+1] = index; dcubed@1412: } duke@435: } else { duke@435: CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops()); duke@435: } dcubed@1412: dcubed@1412: if (!idnum_can_increment()) { dcubed@1412: // The cache cannot grow and this JNI itable index value does not dcubed@1412: // have to be unique like a jmethodID. If there is a race to set it, dcubed@1412: // it doesn't matter. dcubed@1412: indices[idnum+1] = index; dcubed@1412: } dcubed@1412: dcubed@1412: if (to_dealloc_indices != NULL) { dcubed@1412: // we allocated a new cache so free the old one dcubed@1412: FreeHeap(to_dealloc_indices); dcubed@1412: } duke@435: } duke@435: duke@435: duke@435: // Retrieve a cached itable index duke@435: int instanceKlass::cached_itable_index(size_t idnum) { duke@435: int* indices = methods_cached_itable_indices_acquire(); duke@435: if (indices != NULL && ((size_t)indices[0]) > idnum) { duke@435: // indices exist and are long enough, retrieve possible cached duke@435: return indices[idnum+1]; duke@435: } duke@435: return -1; duke@435: } duke@435: duke@435: duke@435: // duke@435: // nmethodBucket is used to record dependent nmethods for duke@435: // deoptimization. nmethod dependencies are actually duke@435: // pairs but we really only care about the klass part for purposes of duke@435: // finding nmethods which might need to be deoptimized. Instead of duke@435: // recording the method, a count of how many times a particular nmethod duke@435: // was recorded is kept. This ensures that any recording errors are duke@435: // noticed since an nmethod should be removed as many times are it's duke@435: // added. duke@435: // duke@435: class nmethodBucket { duke@435: private: duke@435: nmethod* _nmethod; duke@435: int _count; duke@435: nmethodBucket* _next; duke@435: duke@435: public: duke@435: nmethodBucket(nmethod* nmethod, nmethodBucket* next) { duke@435: _nmethod = nmethod; duke@435: _next = next; duke@435: _count = 1; duke@435: } duke@435: int count() { return _count; } duke@435: int increment() { _count += 1; return _count; } duke@435: int decrement() { _count -= 1; assert(_count >= 0, "don't underflow"); return _count; } duke@435: nmethodBucket* next() { return _next; } duke@435: void set_next(nmethodBucket* b) { _next = b; } duke@435: nmethod* get_nmethod() { return _nmethod; } duke@435: }; duke@435: duke@435: duke@435: // duke@435: // Walk the list of dependent nmethods searching for nmethods which duke@435: // are dependent on the klassOop that was passed in and mark them for duke@435: // deoptimization. Returns the number of nmethods found. duke@435: // duke@435: int instanceKlass::mark_dependent_nmethods(DepChange& changes) { duke@435: assert_locked_or_safepoint(CodeCache_lock); duke@435: int found = 0; duke@435: nmethodBucket* b = _dependencies; duke@435: while (b != NULL) { duke@435: nmethod* nm = b->get_nmethod(); duke@435: // since dependencies aren't removed until an nmethod becomes a zombie, duke@435: // the dependency list may contain nmethods which aren't alive. duke@435: if (nm->is_alive() && !nm->is_marked_for_deoptimization() && nm->check_dependency_on(changes)) { duke@435: if (TraceDependencies) { duke@435: ResourceMark rm; duke@435: tty->print_cr("Marked for deoptimization"); duke@435: tty->print_cr(" context = %s", this->external_name()); duke@435: changes.print(); duke@435: nm->print(); duke@435: nm->print_dependencies(); duke@435: } duke@435: nm->mark_for_deoptimization(); duke@435: found++; duke@435: } duke@435: b = b->next(); duke@435: } duke@435: return found; duke@435: } duke@435: duke@435: duke@435: // duke@435: // Add an nmethodBucket to the list of dependencies for this nmethod. duke@435: // It's possible that an nmethod has multiple dependencies on this klass duke@435: // so a count is kept for each bucket to guarantee that creation and duke@435: // deletion of dependencies is consistent. duke@435: // duke@435: void instanceKlass::add_dependent_nmethod(nmethod* nm) { duke@435: assert_locked_or_safepoint(CodeCache_lock); duke@435: nmethodBucket* b = _dependencies; duke@435: nmethodBucket* last = NULL; duke@435: while (b != NULL) { duke@435: if (nm == b->get_nmethod()) { duke@435: b->increment(); duke@435: return; duke@435: } duke@435: b = b->next(); duke@435: } duke@435: _dependencies = new nmethodBucket(nm, _dependencies); duke@435: } duke@435: duke@435: duke@435: // duke@435: // Decrement count of the nmethod in the dependency list and remove duke@435: // the bucket competely when the count goes to 0. This method must duke@435: // find a corresponding bucket otherwise there's a bug in the duke@435: // recording of dependecies. duke@435: // duke@435: void instanceKlass::remove_dependent_nmethod(nmethod* nm) { duke@435: assert_locked_or_safepoint(CodeCache_lock); duke@435: nmethodBucket* b = _dependencies; duke@435: nmethodBucket* last = NULL; duke@435: while (b != NULL) { duke@435: if (nm == b->get_nmethod()) { duke@435: if (b->decrement() == 0) { duke@435: if (last == NULL) { duke@435: _dependencies = b->next(); duke@435: } else { duke@435: last->set_next(b->next()); duke@435: } duke@435: delete b; duke@435: } duke@435: return; duke@435: } duke@435: last = b; duke@435: b = b->next(); duke@435: } duke@435: #ifdef ASSERT duke@435: tty->print_cr("### %s can't find dependent nmethod:", this->external_name()); duke@435: nm->print(); duke@435: #endif // ASSERT duke@435: ShouldNotReachHere(); duke@435: } duke@435: duke@435: duke@435: #ifndef PRODUCT duke@435: void instanceKlass::print_dependent_nmethods(bool verbose) { duke@435: nmethodBucket* b = _dependencies; duke@435: int idx = 0; duke@435: while (b != NULL) { duke@435: nmethod* nm = b->get_nmethod(); duke@435: tty->print("[%d] count=%d { ", idx++, b->count()); duke@435: if (!verbose) { duke@435: nm->print_on(tty, "nmethod"); duke@435: tty->print_cr(" } "); duke@435: } else { duke@435: nm->print(); duke@435: nm->print_dependencies(); duke@435: tty->print_cr("--- } "); duke@435: } duke@435: b = b->next(); duke@435: } duke@435: } duke@435: duke@435: duke@435: bool instanceKlass::is_dependent_nmethod(nmethod* nm) { duke@435: nmethodBucket* b = _dependencies; duke@435: while (b != NULL) { duke@435: if (nm == b->get_nmethod()) { duke@435: return true; duke@435: } duke@435: b = b->next(); duke@435: } duke@435: return false; duke@435: } duke@435: #endif //PRODUCT duke@435: duke@435: coleenp@548: #ifdef ASSERT coleenp@548: template void assert_is_in(T *p) { coleenp@548: T heap_oop = oopDesc::load_heap_oop(p); coleenp@548: if (!oopDesc::is_null(heap_oop)) { coleenp@548: oop o = oopDesc::decode_heap_oop_not_null(heap_oop); coleenp@548: assert(Universe::heap()->is_in(o), "should be in heap"); coleenp@548: } coleenp@548: } coleenp@548: template void assert_is_in_closed_subset(T *p) { coleenp@548: T heap_oop = oopDesc::load_heap_oop(p); coleenp@548: if (!oopDesc::is_null(heap_oop)) { coleenp@548: oop o = oopDesc::decode_heap_oop_not_null(heap_oop); coleenp@548: assert(Universe::heap()->is_in_closed_subset(o), "should be in closed"); coleenp@548: } coleenp@548: } coleenp@548: template void assert_is_in_reserved(T *p) { coleenp@548: T heap_oop = oopDesc::load_heap_oop(p); coleenp@548: if (!oopDesc::is_null(heap_oop)) { coleenp@548: oop o = oopDesc::decode_heap_oop_not_null(heap_oop); coleenp@548: assert(Universe::heap()->is_in_reserved(o), "should be in reserved"); coleenp@548: } coleenp@548: } coleenp@548: template void assert_nothing(T *p) {} coleenp@548: coleenp@548: #else coleenp@548: template void assert_is_in(T *p) {} coleenp@548: template void assert_is_in_closed_subset(T *p) {} coleenp@548: template void assert_is_in_reserved(T *p) {} coleenp@548: template void assert_nothing(T *p) {} coleenp@548: #endif // ASSERT coleenp@548: coleenp@548: // coleenp@548: // Macros that iterate over areas of oops which are specialized on type of coleenp@548: // oop pointer either narrow or wide, depending on UseCompressedOops coleenp@548: // coleenp@548: // Parameters are: coleenp@548: // T - type of oop to point to (either oop or narrowOop) coleenp@548: // start_p - starting pointer for region to iterate over coleenp@548: // count - number of oops or narrowOops to iterate over coleenp@548: // do_oop - action to perform on each oop (it's arbitrary C code which coleenp@548: // makes it more efficient to put in a macro rather than making coleenp@548: // it a template function) coleenp@548: // assert_fn - assert function which is template function because performance coleenp@548: // doesn't matter when enabled. coleenp@548: #define InstanceKlass_SPECIALIZED_OOP_ITERATE( \ coleenp@548: T, start_p, count, do_oop, \ coleenp@548: assert_fn) \ coleenp@548: { \ coleenp@548: T* p = (T*)(start_p); \ coleenp@548: T* const end = p + (count); \ coleenp@548: while (p < end) { \ coleenp@548: (assert_fn)(p); \ coleenp@548: do_oop; \ coleenp@548: ++p; \ coleenp@548: } \ coleenp@548: } coleenp@548: coleenp@548: #define InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE( \ coleenp@548: T, start_p, count, do_oop, \ coleenp@548: assert_fn) \ coleenp@548: { \ coleenp@548: T* const start = (T*)(start_p); \ coleenp@548: T* p = start + (count); \ coleenp@548: while (start < p) { \ coleenp@548: --p; \ coleenp@548: (assert_fn)(p); \ coleenp@548: do_oop; \ coleenp@548: } \ coleenp@548: } coleenp@548: coleenp@548: #define InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE( \ coleenp@548: T, start_p, count, low, high, \ coleenp@548: do_oop, assert_fn) \ coleenp@548: { \ coleenp@548: T* const l = (T*)(low); \ coleenp@548: T* const h = (T*)(high); \ coleenp@548: assert(mask_bits((intptr_t)l, sizeof(T)-1) == 0 && \ coleenp@548: mask_bits((intptr_t)h, sizeof(T)-1) == 0, \ coleenp@548: "bounded region must be properly aligned"); \ coleenp@548: T* p = (T*)(start_p); \ coleenp@548: T* end = p + (count); \ coleenp@548: if (p < l) p = l; \ coleenp@548: if (end > h) end = h; \ coleenp@548: while (p < end) { \ coleenp@548: (assert_fn)(p); \ coleenp@548: do_oop; \ coleenp@548: ++p; \ coleenp@548: } \ coleenp@548: } coleenp@548: coleenp@548: coleenp@548: // The following macros call specialized macros, passing either oop or coleenp@548: // narrowOop as the specialization type. These test the UseCompressedOops coleenp@548: // flag. coleenp@548: #define InstanceKlass_OOP_ITERATE(start_p, count, \ coleenp@548: do_oop, assert_fn) \ coleenp@548: { \ coleenp@548: if (UseCompressedOops) { \ coleenp@548: InstanceKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \ coleenp@548: start_p, count, \ coleenp@548: do_oop, assert_fn) \ coleenp@548: } else { \ coleenp@548: InstanceKlass_SPECIALIZED_OOP_ITERATE(oop, \ coleenp@548: start_p, count, \ coleenp@548: do_oop, assert_fn) \ coleenp@548: } \ coleenp@548: } coleenp@548: coleenp@548: #define InstanceKlass_BOUNDED_OOP_ITERATE(start_p, count, low, high, \ coleenp@548: do_oop, assert_fn) \ coleenp@548: { \ coleenp@548: if (UseCompressedOops) { \ coleenp@548: InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \ coleenp@548: start_p, count, \ coleenp@548: low, high, \ coleenp@548: do_oop, assert_fn) \ coleenp@548: } else { \ coleenp@548: InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \ coleenp@548: start_p, count, \ coleenp@548: low, high, \ coleenp@548: do_oop, assert_fn) \ coleenp@548: } \ coleenp@548: } coleenp@548: coleenp@548: #define InstanceKlass_OOP_MAP_ITERATE(obj, do_oop, assert_fn) \ coleenp@548: { \ coleenp@548: /* Compute oopmap block range. The common case \ coleenp@548: is nonstatic_oop_map_size == 1. */ \ coleenp@548: OopMapBlock* map = start_of_nonstatic_oop_maps(); \ jcoomes@1373: OopMapBlock* const end_map = map + nonstatic_oop_map_count(); \ coleenp@548: if (UseCompressedOops) { \ coleenp@548: while (map < end_map) { \ coleenp@548: InstanceKlass_SPECIALIZED_OOP_ITERATE(narrowOop, \ jcoomes@1373: obj->obj_field_addr(map->offset()), map->count(), \ coleenp@548: do_oop, assert_fn) \ coleenp@548: ++map; \ coleenp@548: } \ coleenp@548: } else { \ coleenp@548: while (map < end_map) { \ coleenp@548: InstanceKlass_SPECIALIZED_OOP_ITERATE(oop, \ jcoomes@1373: obj->obj_field_addr(map->offset()), map->count(), \ coleenp@548: do_oop, assert_fn) \ coleenp@548: ++map; \ coleenp@548: } \ coleenp@548: } \ coleenp@548: } coleenp@548: coleenp@548: #define InstanceKlass_OOP_MAP_REVERSE_ITERATE(obj, do_oop, assert_fn) \ coleenp@548: { \ coleenp@548: OopMapBlock* const start_map = start_of_nonstatic_oop_maps(); \ jcoomes@1373: OopMapBlock* map = start_map + nonstatic_oop_map_count(); \ coleenp@548: if (UseCompressedOops) { \ coleenp@548: while (start_map < map) { \ coleenp@548: --map; \ coleenp@548: InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(narrowOop, \ jcoomes@1373: obj->obj_field_addr(map->offset()), map->count(), \ coleenp@548: do_oop, assert_fn) \ coleenp@548: } \ coleenp@548: } else { \ coleenp@548: while (start_map < map) { \ coleenp@548: --map; \ coleenp@548: InstanceKlass_SPECIALIZED_OOP_REVERSE_ITERATE(oop, \ jcoomes@1373: obj->obj_field_addr(map->offset()), map->count(), \ coleenp@548: do_oop, assert_fn) \ coleenp@548: } \ coleenp@548: } \ coleenp@548: } coleenp@548: coleenp@548: #define InstanceKlass_BOUNDED_OOP_MAP_ITERATE(obj, low, high, do_oop, \ coleenp@548: assert_fn) \ coleenp@548: { \ coleenp@548: /* Compute oopmap block range. The common case is \ coleenp@548: nonstatic_oop_map_size == 1, so we accept the \ coleenp@548: usually non-existent extra overhead of examining \ coleenp@548: all the maps. */ \ coleenp@548: OopMapBlock* map = start_of_nonstatic_oop_maps(); \ jcoomes@1373: OopMapBlock* const end_map = map + nonstatic_oop_map_count(); \ coleenp@548: if (UseCompressedOops) { \ coleenp@548: while (map < end_map) { \ coleenp@548: InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(narrowOop, \ jcoomes@1373: obj->obj_field_addr(map->offset()), map->count(), \ coleenp@548: low, high, \ coleenp@548: do_oop, assert_fn) \ coleenp@548: ++map; \ coleenp@548: } \ coleenp@548: } else { \ coleenp@548: while (map < end_map) { \ coleenp@548: InstanceKlass_SPECIALIZED_BOUNDED_OOP_ITERATE(oop, \ jcoomes@1373: obj->obj_field_addr(map->offset()), map->count(), \ coleenp@548: low, high, \ coleenp@548: do_oop, assert_fn) \ coleenp@548: ++map; \ coleenp@548: } \ coleenp@548: } \ coleenp@548: } coleenp@548: duke@435: void instanceKlass::follow_static_fields() { coleenp@548: InstanceKlass_OOP_ITERATE( \ coleenp@548: start_of_static_fields(), static_oop_field_size(), \ coleenp@548: MarkSweep::mark_and_push(p), \ coleenp@548: assert_is_in_closed_subset) duke@435: } duke@435: duke@435: #ifndef SERIALGC duke@435: void instanceKlass::follow_static_fields(ParCompactionManager* cm) { coleenp@548: InstanceKlass_OOP_ITERATE( \ coleenp@548: start_of_static_fields(), static_oop_field_size(), \ coleenp@548: PSParallelCompact::mark_and_push(cm, p), \ coleenp@548: assert_is_in) duke@435: } duke@435: #endif // SERIALGC duke@435: duke@435: void instanceKlass::adjust_static_fields() { coleenp@548: InstanceKlass_OOP_ITERATE( \ coleenp@548: start_of_static_fields(), static_oop_field_size(), \ coleenp@548: MarkSweep::adjust_pointer(p), \ coleenp@548: assert_nothing) duke@435: } duke@435: duke@435: #ifndef SERIALGC duke@435: void instanceKlass::update_static_fields() { coleenp@548: InstanceKlass_OOP_ITERATE( \ coleenp@548: start_of_static_fields(), static_oop_field_size(), \ coleenp@548: PSParallelCompact::adjust_pointer(p), \ coleenp@548: assert_nothing) duke@435: } duke@435: coleenp@548: void instanceKlass::update_static_fields(HeapWord* beg_addr, HeapWord* end_addr) { coleenp@548: InstanceKlass_BOUNDED_OOP_ITERATE( \ coleenp@548: start_of_static_fields(), static_oop_field_size(), \ coleenp@548: beg_addr, end_addr, \ coleenp@548: PSParallelCompact::adjust_pointer(p), \ coleenp@548: assert_nothing ) duke@435: } duke@435: #endif // SERIALGC duke@435: duke@435: void instanceKlass::oop_follow_contents(oop obj) { coleenp@548: assert(obj != NULL, "can't follow the content of NULL object"); duke@435: obj->follow_header(); coleenp@548: InstanceKlass_OOP_MAP_ITERATE( \ coleenp@548: obj, \ coleenp@548: MarkSweep::mark_and_push(p), \ coleenp@548: assert_is_in_closed_subset) duke@435: } duke@435: duke@435: #ifndef SERIALGC duke@435: void instanceKlass::oop_follow_contents(ParCompactionManager* cm, duke@435: oop obj) { coleenp@548: assert(obj != NULL, "can't follow the content of NULL object"); duke@435: obj->follow_header(cm); coleenp@548: InstanceKlass_OOP_MAP_ITERATE( \ coleenp@548: obj, \ coleenp@548: PSParallelCompact::mark_and_push(cm, p), \ coleenp@548: assert_is_in) duke@435: } duke@435: #endif // SERIALGC duke@435: duke@435: // closure's do_header() method dicates whether the given closure should be duke@435: // applied to the klass ptr in the object header. duke@435: ysr@777: #define InstanceKlass_OOP_OOP_ITERATE_DEFN(OopClosureType, nv_suffix) \ ysr@777: \ ysr@777: int instanceKlass::oop_oop_iterate##nv_suffix(oop obj, OopClosureType* closure) { \ coleenp@548: SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\ coleenp@548: /* header */ \ coleenp@548: if (closure->do_header()) { \ coleenp@548: obj->oop_iterate_header(closure); \ coleenp@548: } \ coleenp@548: InstanceKlass_OOP_MAP_ITERATE( \ coleenp@548: obj, \ coleenp@548: SpecializationStats:: \ coleenp@548: record_do_oop_call##nv_suffix(SpecializationStats::ik); \ coleenp@548: (closure)->do_oop##nv_suffix(p), \ coleenp@548: assert_is_in_closed_subset) \ coleenp@548: return size_helper(); \ duke@435: } duke@435: ysr@777: #ifndef SERIALGC ysr@777: #define InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) \ ysr@777: \ ysr@777: int instanceKlass::oop_oop_iterate_backwards##nv_suffix(oop obj, \ ysr@777: OopClosureType* closure) { \ ysr@777: SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik); \ ysr@777: /* header */ \ ysr@777: if (closure->do_header()) { \ ysr@777: obj->oop_iterate_header(closure); \ ysr@777: } \ ysr@777: /* instance variables */ \ ysr@777: InstanceKlass_OOP_MAP_REVERSE_ITERATE( \ ysr@777: obj, \ ysr@777: SpecializationStats::record_do_oop_call##nv_suffix(SpecializationStats::ik);\ ysr@777: (closure)->do_oop##nv_suffix(p), \ ysr@777: assert_is_in_closed_subset) \ ysr@777: return size_helper(); \ ysr@777: } ysr@777: #endif // !SERIALGC ysr@777: coleenp@548: #define InstanceKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \ coleenp@548: \ coleenp@548: int instanceKlass::oop_oop_iterate##nv_suffix##_m(oop obj, \ coleenp@548: OopClosureType* closure, \ coleenp@548: MemRegion mr) { \ coleenp@548: SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik);\ coleenp@548: if (closure->do_header()) { \ coleenp@548: obj->oop_iterate_header(closure, mr); \ coleenp@548: } \ coleenp@548: InstanceKlass_BOUNDED_OOP_MAP_ITERATE( \ coleenp@548: obj, mr.start(), mr.end(), \ coleenp@548: (closure)->do_oop##nv_suffix(p), \ coleenp@548: assert_is_in_closed_subset) \ coleenp@548: return size_helper(); \ duke@435: } duke@435: duke@435: ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN) ysr@777: ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN) duke@435: ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_DEFN_m) ysr@777: ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_DEFN_m) ysr@777: #ifndef SERIALGC ysr@777: ALL_OOP_OOP_ITERATE_CLOSURES_1(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN) ysr@777: ALL_OOP_OOP_ITERATE_CLOSURES_2(InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN) ysr@777: #endif // !SERIALGC duke@435: duke@435: void instanceKlass::iterate_static_fields(OopClosure* closure) { coleenp@548: InstanceKlass_OOP_ITERATE( \ coleenp@548: start_of_static_fields(), static_oop_field_size(), \ coleenp@548: closure->do_oop(p), \ coleenp@548: assert_is_in_reserved) duke@435: } duke@435: duke@435: void instanceKlass::iterate_static_fields(OopClosure* closure, duke@435: MemRegion mr) { coleenp@548: InstanceKlass_BOUNDED_OOP_ITERATE( \ coleenp@548: start_of_static_fields(), static_oop_field_size(), \ coleenp@548: mr.start(), mr.end(), \ coleenp@548: (closure)->do_oop_v(p), \ coleenp@548: assert_is_in_closed_subset) duke@435: } duke@435: duke@435: int instanceKlass::oop_adjust_pointers(oop obj) { duke@435: int size = size_helper(); coleenp@548: InstanceKlass_OOP_MAP_ITERATE( \ coleenp@548: obj, \ coleenp@548: MarkSweep::adjust_pointer(p), \ coleenp@548: assert_is_in) duke@435: obj->adjust_header(); duke@435: return size; duke@435: } duke@435: duke@435: #ifndef SERIALGC duke@435: void instanceKlass::oop_copy_contents(PSPromotionManager* pm, oop obj) { duke@435: assert(!pm->depth_first(), "invariant"); coleenp@548: InstanceKlass_OOP_MAP_REVERSE_ITERATE( \ coleenp@548: obj, \ coleenp@548: if (PSScavenge::should_scavenge(p)) { \ coleenp@548: pm->claim_or_forward_breadth(p); \ coleenp@548: }, \ coleenp@548: assert_nothing ) duke@435: } duke@435: duke@435: void instanceKlass::oop_push_contents(PSPromotionManager* pm, oop obj) { duke@435: assert(pm->depth_first(), "invariant"); coleenp@548: InstanceKlass_OOP_MAP_REVERSE_ITERATE( \ coleenp@548: obj, \ coleenp@548: if (PSScavenge::should_scavenge(p)) { \ coleenp@548: pm->claim_or_forward_depth(p); \ coleenp@548: }, \ coleenp@548: assert_nothing ) duke@435: } duke@435: duke@435: int instanceKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { coleenp@548: InstanceKlass_OOP_MAP_ITERATE( \ coleenp@548: obj, \ coleenp@548: PSParallelCompact::adjust_pointer(p), \ coleenp@548: assert_nothing) duke@435: return size_helper(); duke@435: } duke@435: duke@435: int instanceKlass::oop_update_pointers(ParCompactionManager* cm, oop obj, duke@435: HeapWord* beg_addr, HeapWord* end_addr) { coleenp@548: InstanceKlass_BOUNDED_OOP_MAP_ITERATE( \ coleenp@548: obj, beg_addr, end_addr, \ coleenp@548: PSParallelCompact::adjust_pointer(p), \ coleenp@548: assert_nothing) duke@435: return size_helper(); duke@435: } duke@435: duke@435: void instanceKlass::copy_static_fields(PSPromotionManager* pm) { duke@435: assert(!pm->depth_first(), "invariant"); coleenp@548: InstanceKlass_OOP_ITERATE( \ coleenp@548: start_of_static_fields(), static_oop_field_size(), \ coleenp@548: if (PSScavenge::should_scavenge(p)) { \ coleenp@548: pm->claim_or_forward_breadth(p); \ coleenp@548: }, \ coleenp@548: assert_nothing ) duke@435: } duke@435: duke@435: void instanceKlass::push_static_fields(PSPromotionManager* pm) { duke@435: assert(pm->depth_first(), "invariant"); coleenp@548: InstanceKlass_OOP_ITERATE( \ coleenp@548: start_of_static_fields(), static_oop_field_size(), \ coleenp@548: if (PSScavenge::should_scavenge(p)) { \ coleenp@548: pm->claim_or_forward_depth(p); \ coleenp@548: }, \ coleenp@548: assert_nothing ) duke@435: } duke@435: duke@435: void instanceKlass::copy_static_fields(ParCompactionManager* cm) { coleenp@548: InstanceKlass_OOP_ITERATE( \ coleenp@548: start_of_static_fields(), static_oop_field_size(), \ coleenp@548: PSParallelCompact::adjust_pointer(p), \ coleenp@548: assert_is_in) duke@435: } duke@435: #endif // SERIALGC duke@435: duke@435: // This klass is alive but the implementor link is not followed/updated. duke@435: // Subklass and sibling links are handled by Klass::follow_weak_klass_links duke@435: duke@435: void instanceKlass::follow_weak_klass_links( duke@435: BoolObjectClosure* is_alive, OopClosure* keep_alive) { duke@435: assert(is_alive->do_object_b(as_klassOop()), "this oop should be live"); duke@435: if (ClassUnloading) { duke@435: for (int i = 0; i < implementors_limit; i++) { duke@435: klassOop impl = _implementors[i]; duke@435: if (impl == NULL) break; // no more in the list duke@435: if (!is_alive->do_object_b(impl)) { duke@435: // remove this guy from the list by overwriting him with the tail duke@435: int lasti = --_nof_implementors; duke@435: assert(lasti >= i && lasti < implementors_limit, "just checking"); duke@435: _implementors[i] = _implementors[lasti]; duke@435: _implementors[lasti] = NULL; duke@435: --i; // rerun the loop at this index duke@435: } duke@435: } duke@435: } else { duke@435: for (int i = 0; i < implementors_limit; i++) { duke@435: keep_alive->do_oop(&adr_implementors()[i]); duke@435: } duke@435: } duke@435: Klass::follow_weak_klass_links(is_alive, keep_alive); duke@435: } duke@435: duke@435: void instanceKlass::remove_unshareable_info() { duke@435: Klass::remove_unshareable_info(); duke@435: init_implementor(); duke@435: } duke@435: duke@435: static void clear_all_breakpoints(methodOop m) { duke@435: m->clear_all_breakpoints(); duke@435: } duke@435: duke@435: void instanceKlass::release_C_heap_structures() { duke@435: // Deallocate oop map cache duke@435: if (_oop_map_cache != NULL) { duke@435: delete _oop_map_cache; duke@435: _oop_map_cache = NULL; duke@435: } duke@435: duke@435: // Deallocate JNI identifiers for jfieldIDs duke@435: JNIid::deallocate(jni_ids()); duke@435: set_jni_ids(NULL); duke@435: duke@435: jmethodID* jmeths = methods_jmethod_ids_acquire(); duke@435: if (jmeths != (jmethodID*)NULL) { duke@435: release_set_methods_jmethod_ids(NULL); duke@435: FreeHeap(jmeths); duke@435: } duke@435: duke@435: int* indices = methods_cached_itable_indices_acquire(); duke@435: if (indices != (int*)NULL) { duke@435: release_set_methods_cached_itable_indices(NULL); duke@435: FreeHeap(indices); duke@435: } duke@435: duke@435: // release dependencies duke@435: nmethodBucket* b = _dependencies; duke@435: _dependencies = NULL; duke@435: while (b != NULL) { duke@435: nmethodBucket* next = b->next(); duke@435: delete b; duke@435: b = next; duke@435: } duke@435: duke@435: // Deallocate breakpoint records duke@435: if (breakpoints() != 0x0) { duke@435: methods_do(clear_all_breakpoints); duke@435: assert(breakpoints() == 0x0, "should have cleared breakpoints"); duke@435: } duke@435: duke@435: // deallocate information about previous versions duke@435: if (_previous_versions != NULL) { duke@435: for (int i = _previous_versions->length() - 1; i >= 0; i--) { duke@435: PreviousVersionNode * pv_node = _previous_versions->at(i); duke@435: delete pv_node; duke@435: } duke@435: delete _previous_versions; duke@435: _previous_versions = NULL; duke@435: } duke@435: duke@435: // deallocate the cached class file duke@435: if (_cached_class_file_bytes != NULL) { duke@435: os::free(_cached_class_file_bytes); duke@435: _cached_class_file_bytes = NULL; duke@435: _cached_class_file_len = 0; duke@435: } duke@435: } duke@435: jrose@1474: const char* instanceKlass::signature_name() const { duke@435: const char* src = (const char*) (name()->as_C_string()); duke@435: const int src_length = (int)strlen(src); duke@435: char* dest = NEW_RESOURCE_ARRAY(char, src_length + 3); duke@435: int src_index = 0; duke@435: int dest_index = 0; duke@435: dest[dest_index++] = 'L'; duke@435: while (src_index < src_length) { duke@435: dest[dest_index++] = src[src_index++]; duke@435: } duke@435: dest[dest_index++] = ';'; duke@435: dest[dest_index] = '\0'; duke@435: return dest; duke@435: } duke@435: duke@435: // different verisons of is_same_class_package duke@435: bool instanceKlass::is_same_class_package(klassOop class2) { duke@435: klassOop class1 = as_klassOop(); duke@435: oop classloader1 = instanceKlass::cast(class1)->class_loader(); duke@435: symbolOop classname1 = Klass::cast(class1)->name(); duke@435: duke@435: if (Klass::cast(class2)->oop_is_objArray()) { duke@435: class2 = objArrayKlass::cast(class2)->bottom_klass(); duke@435: } duke@435: oop classloader2; duke@435: if (Klass::cast(class2)->oop_is_instance()) { duke@435: classloader2 = instanceKlass::cast(class2)->class_loader(); duke@435: } else { duke@435: assert(Klass::cast(class2)->oop_is_typeArray(), "should be type array"); duke@435: classloader2 = NULL; duke@435: } duke@435: symbolOop classname2 = Klass::cast(class2)->name(); duke@435: duke@435: return instanceKlass::is_same_class_package(classloader1, classname1, duke@435: classloader2, classname2); duke@435: } duke@435: duke@435: bool instanceKlass::is_same_class_package(oop classloader2, symbolOop classname2) { duke@435: klassOop class1 = as_klassOop(); duke@435: oop classloader1 = instanceKlass::cast(class1)->class_loader(); duke@435: symbolOop classname1 = Klass::cast(class1)->name(); duke@435: duke@435: return instanceKlass::is_same_class_package(classloader1, classname1, duke@435: classloader2, classname2); duke@435: } duke@435: duke@435: // return true if two classes are in the same package, classloader duke@435: // and classname information is enough to determine a class's package duke@435: bool instanceKlass::is_same_class_package(oop class_loader1, symbolOop class_name1, duke@435: oop class_loader2, symbolOop class_name2) { duke@435: if (class_loader1 != class_loader2) { duke@435: return false; jrose@1100: } else if (class_name1 == class_name2) { jrose@1100: return true; // skip painful bytewise comparison duke@435: } else { duke@435: ResourceMark rm; duke@435: duke@435: // The symbolOop's are in UTF8 encoding. Since we only need to check explicitly duke@435: // for ASCII characters ('/', 'L', '['), we can keep them in UTF8 encoding. duke@435: // Otherwise, we just compare jbyte values between the strings. duke@435: jbyte *name1 = class_name1->base(); duke@435: jbyte *name2 = class_name2->base(); duke@435: duke@435: jbyte *last_slash1 = UTF8::strrchr(name1, class_name1->utf8_length(), '/'); duke@435: jbyte *last_slash2 = UTF8::strrchr(name2, class_name2->utf8_length(), '/'); duke@435: duke@435: if ((last_slash1 == NULL) || (last_slash2 == NULL)) { duke@435: // One of the two doesn't have a package. Only return true duke@435: // if the other one also doesn't have a package. duke@435: return last_slash1 == last_slash2; duke@435: } else { duke@435: // Skip over '['s duke@435: if (*name1 == '[') { duke@435: do { duke@435: name1++; duke@435: } while (*name1 == '['); duke@435: if (*name1 != 'L') { duke@435: // Something is terribly wrong. Shouldn't be here. duke@435: return false; duke@435: } duke@435: } duke@435: if (*name2 == '[') { duke@435: do { duke@435: name2++; duke@435: } while (*name2 == '['); duke@435: if (*name2 != 'L') { duke@435: // Something is terribly wrong. Shouldn't be here. duke@435: return false; duke@435: } duke@435: } duke@435: duke@435: // Check that package part is identical duke@435: int length1 = last_slash1 - name1; duke@435: int length2 = last_slash2 - name2; duke@435: duke@435: return UTF8::equal(name1, length1, name2, length2); duke@435: } duke@435: } duke@435: } duke@435: acorn@1087: // Returns true iff super_method can be overridden by a method in targetclassname acorn@1087: // See JSL 3rd edition 8.4.6.1 acorn@1087: // Assumes name-signature match acorn@1087: // "this" is instanceKlass of super_method which must exist acorn@1087: // note that the instanceKlass of the method in the targetclassname has not always been created yet acorn@1087: bool instanceKlass::is_override(methodHandle super_method, Handle targetclassloader, symbolHandle targetclassname, TRAPS) { acorn@1087: // Private methods can not be overridden acorn@1087: if (super_method->is_private()) { acorn@1087: return false; acorn@1087: } acorn@1087: // If super method is accessible, then override acorn@1087: if ((super_method->is_protected()) || acorn@1087: (super_method->is_public())) { acorn@1087: return true; acorn@1087: } acorn@1087: // Package-private methods are not inherited outside of package acorn@1087: assert(super_method->is_package_private(), "must be package private"); acorn@1087: return(is_same_class_package(targetclassloader(), targetclassname())); acorn@1087: } twisti@1040: jrose@1100: /* defined for now in jvm.cpp, for historical reasons *-- jrose@1100: klassOop instanceKlass::compute_enclosing_class_impl(instanceKlassHandle self, jrose@1100: symbolOop& simple_name_result, TRAPS) { jrose@1100: ... jrose@1100: } jrose@1100: */ jrose@1100: jrose@1100: // tell if two classes have the same enclosing class (at package level) jrose@1100: bool instanceKlass::is_same_package_member_impl(instanceKlassHandle class1, jrose@1100: klassOop class2_oop, TRAPS) { jrose@1100: if (class2_oop == class1->as_klassOop()) return true; jrose@1100: if (!Klass::cast(class2_oop)->oop_is_instance()) return false; jrose@1100: instanceKlassHandle class2(THREAD, class2_oop); jrose@1100: jrose@1100: // must be in same package before we try anything else jrose@1100: if (!class1->is_same_class_package(class2->class_loader(), class2->name())) jrose@1100: return false; jrose@1100: jrose@1100: // As long as there is an outer1.getEnclosingClass, jrose@1100: // shift the search outward. jrose@1100: instanceKlassHandle outer1 = class1; jrose@1100: for (;;) { jrose@1100: // As we walk along, look for equalities between outer1 and class2. jrose@1100: // Eventually, the walks will terminate as outer1 stops jrose@1100: // at the top-level class around the original class. xlu@1561: bool ignore_inner_is_member; xlu@1561: klassOop next = outer1->compute_enclosing_class(&ignore_inner_is_member, xlu@1561: CHECK_false); jrose@1100: if (next == NULL) break; jrose@1100: if (next == class2()) return true; jrose@1100: outer1 = instanceKlassHandle(THREAD, next); jrose@1100: } jrose@1100: jrose@1100: // Now do the same for class2. jrose@1100: instanceKlassHandle outer2 = class2; jrose@1100: for (;;) { xlu@1561: bool ignore_inner_is_member; xlu@1561: klassOop next = outer2->compute_enclosing_class(&ignore_inner_is_member, xlu@1561: CHECK_false); jrose@1100: if (next == NULL) break; jrose@1100: // Might as well check the new outer against all available values. jrose@1100: if (next == class1()) return true; jrose@1100: if (next == outer1()) return true; jrose@1100: outer2 = instanceKlassHandle(THREAD, next); jrose@1100: } jrose@1100: jrose@1100: // If by this point we have not found an equality between the jrose@1100: // two classes, we know they are in separate package members. jrose@1100: return false; jrose@1100: } jrose@1100: duke@435: duke@435: jint instanceKlass::compute_modifier_flags(TRAPS) const { duke@435: klassOop k = as_klassOop(); duke@435: jint access = access_flags().as_int(); duke@435: duke@435: // But check if it happens to be member class. duke@435: typeArrayOop inner_class_list = inner_classes(); duke@435: int length = (inner_class_list == NULL) ? 0 : inner_class_list->length(); duke@435: assert (length % instanceKlass::inner_class_next_offset == 0, "just checking"); duke@435: if (length > 0) { duke@435: typeArrayHandle inner_class_list_h(THREAD, inner_class_list); duke@435: instanceKlassHandle ik(THREAD, k); duke@435: for (int i = 0; i < length; i += instanceKlass::inner_class_next_offset) { duke@435: int ioff = inner_class_list_h->ushort_at( duke@435: i + instanceKlass::inner_class_inner_class_info_offset); duke@435: duke@435: // Inner class attribute can be zero, skip it. duke@435: // Strange but true: JVM spec. allows null inner class refs. duke@435: if (ioff == 0) continue; duke@435: duke@435: // only look at classes that are already loaded duke@435: // since we are looking for the flags for our self. duke@435: symbolOop inner_name = ik->constants()->klass_name_at(ioff); duke@435: if ((ik->name() == inner_name)) { duke@435: // This is really a member class. duke@435: access = inner_class_list_h->ushort_at(i + instanceKlass::inner_class_access_flags_offset); duke@435: break; duke@435: } duke@435: } duke@435: } duke@435: // Remember to strip ACC_SUPER bit duke@435: return (access & (~JVM_ACC_SUPER)) & JVM_ACC_WRITTEN_FLAGS; duke@435: } duke@435: duke@435: jint instanceKlass::jvmti_class_status() const { duke@435: jint result = 0; duke@435: duke@435: if (is_linked()) { duke@435: result |= JVMTI_CLASS_STATUS_VERIFIED | JVMTI_CLASS_STATUS_PREPARED; duke@435: } duke@435: duke@435: if (is_initialized()) { duke@435: assert(is_linked(), "Class status is not consistent"); duke@435: result |= JVMTI_CLASS_STATUS_INITIALIZED; duke@435: } duke@435: if (is_in_error_state()) { duke@435: result |= JVMTI_CLASS_STATUS_ERROR; duke@435: } duke@435: return result; duke@435: } duke@435: duke@435: methodOop instanceKlass::method_at_itable(klassOop holder, int index, TRAPS) { duke@435: itableOffsetEntry* ioe = (itableOffsetEntry*)start_of_itable(); duke@435: int method_table_offset_in_words = ioe->offset()/wordSize; duke@435: int nof_interfaces = (method_table_offset_in_words - itable_offset_in_words()) duke@435: / itableOffsetEntry::size(); duke@435: duke@435: for (int cnt = 0 ; ; cnt ++, ioe ++) { twisti@1040: // If the interface isn't implemented by the receiver class, duke@435: // the VM should throw IncompatibleClassChangeError. duke@435: if (cnt >= nof_interfaces) { duke@435: THROW_OOP_0(vmSymbols::java_lang_IncompatibleClassChangeError()); duke@435: } duke@435: duke@435: klassOop ik = ioe->interface_klass(); duke@435: if (ik == holder) break; duke@435: } duke@435: duke@435: itableMethodEntry* ime = ioe->first_method_entry(as_klassOop()); duke@435: methodOop m = ime[index].method(); duke@435: if (m == NULL) { duke@435: THROW_OOP_0(vmSymbols::java_lang_AbstractMethodError()); duke@435: } duke@435: return m; duke@435: } duke@435: duke@435: // On-stack replacement stuff duke@435: void instanceKlass::add_osr_nmethod(nmethod* n) { duke@435: // only one compilation can be active duke@435: NEEDS_CLEANUP duke@435: // This is a short non-blocking critical region, so the no safepoint check is ok. duke@435: OsrList_lock->lock_without_safepoint_check(); duke@435: assert(n->is_osr_method(), "wrong kind of nmethod"); jrose@1424: n->set_osr_link(osr_nmethods_head()); duke@435: set_osr_nmethods_head(n); duke@435: // Remember to unlock again duke@435: OsrList_lock->unlock(); duke@435: } duke@435: duke@435: duke@435: void instanceKlass::remove_osr_nmethod(nmethod* n) { duke@435: // This is a short non-blocking critical region, so the no safepoint check is ok. duke@435: OsrList_lock->lock_without_safepoint_check(); duke@435: assert(n->is_osr_method(), "wrong kind of nmethod"); duke@435: nmethod* last = NULL; duke@435: nmethod* cur = osr_nmethods_head(); duke@435: // Search for match duke@435: while(cur != NULL && cur != n) { duke@435: last = cur; jrose@1424: cur = cur->osr_link(); duke@435: } duke@435: if (cur == n) { duke@435: if (last == NULL) { duke@435: // Remove first element jrose@1424: set_osr_nmethods_head(osr_nmethods_head()->osr_link()); duke@435: } else { jrose@1424: last->set_osr_link(cur->osr_link()); duke@435: } duke@435: } jrose@1424: n->set_osr_link(NULL); duke@435: // Remember to unlock again duke@435: OsrList_lock->unlock(); duke@435: } duke@435: duke@435: nmethod* instanceKlass::lookup_osr_nmethod(const methodOop m, int bci) const { duke@435: // This is a short non-blocking critical region, so the no safepoint check is ok. duke@435: OsrList_lock->lock_without_safepoint_check(); duke@435: nmethod* osr = osr_nmethods_head(); duke@435: while (osr != NULL) { duke@435: assert(osr->is_osr_method(), "wrong kind of nmethod found in chain"); duke@435: if (osr->method() == m && duke@435: (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) { duke@435: // Found a match - return it. duke@435: OsrList_lock->unlock(); duke@435: return osr; duke@435: } jrose@1424: osr = osr->osr_link(); duke@435: } duke@435: OsrList_lock->unlock(); duke@435: return NULL; duke@435: } duke@435: duke@435: // ----------------------------------------------------------------------------------------------------- duke@435: #ifndef PRODUCT duke@435: duke@435: // Printing duke@435: jrose@1100: #define BULLET " - " jrose@1100: duke@435: void FieldPrinter::do_field(fieldDescriptor* fd) { jrose@1100: _st->print(BULLET); jrose@1100: if (fd->is_static() || (_obj == NULL)) { duke@435: fd->print_on(_st); duke@435: _st->cr(); duke@435: } else { duke@435: fd->print_on_for(_st, _obj); duke@435: _st->cr(); duke@435: } duke@435: } duke@435: duke@435: duke@435: void instanceKlass::oop_print_on(oop obj, outputStream* st) { duke@435: Klass::oop_print_on(obj, st); duke@435: never@1577: if (as_klassOop() == SystemDictionary::String_klass()) { duke@435: typeArrayOop value = java_lang_String::value(obj); duke@435: juint offset = java_lang_String::offset(obj); duke@435: juint length = java_lang_String::length(obj); duke@435: if (value != NULL && duke@435: value->is_typeArray() && duke@435: offset <= (juint) value->length() && duke@435: offset + length <= (juint) value->length()) { jrose@1100: st->print(BULLET"string: "); duke@435: Handle h_obj(obj); duke@435: java_lang_String::print(h_obj, st); duke@435: st->cr(); duke@435: if (!WizardMode) return; // that is enough duke@435: } duke@435: } duke@435: jrose@1100: st->print_cr(BULLET"---- fields (total size %d words):", oop_size(obj)); duke@435: FieldPrinter print_nonstatic_field(st, obj); duke@435: do_nonstatic_fields(&print_nonstatic_field); duke@435: never@1577: if (as_klassOop() == SystemDictionary::Class_klass()) { jrose@1100: st->print(BULLET"signature: "); jrose@1100: java_lang_Class::print_signature(obj, st); jrose@1100: st->cr(); duke@435: klassOop mirrored_klass = java_lang_Class::as_klassOop(obj); jrose@1100: st->print(BULLET"fake entry for mirror: "); duke@435: mirrored_klass->print_value_on(st); duke@435: st->cr(); jrose@1100: st->print(BULLET"fake entry resolved_constructor: "); duke@435: methodOop ctor = java_lang_Class::resolved_constructor(obj); duke@435: ctor->print_value_on(st); duke@435: klassOop array_klass = java_lang_Class::array_klass(obj); jrose@1100: st->cr(); jrose@1100: st->print(BULLET"fake entry for array: "); duke@435: array_klass->print_value_on(st); duke@435: st->cr(); jrose@1474: } else if (as_klassOop() == SystemDictionary::MethodType_klass()) { jrose@1474: st->print(BULLET"signature: "); jrose@1474: java_dyn_MethodType::print_signature(obj, st); jrose@1474: st->cr(); duke@435: } duke@435: } duke@435: jrose@1590: #endif //PRODUCT jrose@1590: duke@435: void instanceKlass::oop_print_value_on(oop obj, outputStream* st) { duke@435: st->print("a "); duke@435: name()->print_value_on(st); duke@435: obj->print_address_on(st); never@1577: if (as_klassOop() == SystemDictionary::String_klass() jrose@1100: && java_lang_String::value(obj) != NULL) { jrose@1100: ResourceMark rm; jrose@1100: int len = java_lang_String::length(obj); jrose@1100: int plen = (len < 24 ? len : 12); jrose@1100: char* str = java_lang_String::as_utf8_string(obj, 0, plen); jrose@1100: st->print(" = \"%s\"", str); jrose@1100: if (len > plen) jrose@1100: st->print("...[%d]", len); never@1577: } else if (as_klassOop() == SystemDictionary::Class_klass()) { jrose@1100: klassOop k = java_lang_Class::as_klassOop(obj); jrose@1100: st->print(" = "); jrose@1100: if (k != NULL) { jrose@1100: k->print_value_on(st); jrose@1100: } else { jrose@1100: const char* tname = type2name(java_lang_Class::primitive_type(obj)); jrose@1100: st->print("%s", tname ? tname : "type?"); jrose@1100: } jrose@1474: } else if (as_klassOop() == SystemDictionary::MethodType_klass()) { jrose@1474: st->print(" = "); jrose@1474: java_dyn_MethodType::print_signature(obj, st); jrose@1100: } else if (java_lang_boxing_object::is_instance(obj)) { jrose@1100: st->print(" = "); jrose@1100: java_lang_boxing_object::print(obj, st); jrose@1100: } duke@435: } duke@435: duke@435: const char* instanceKlass::internal_name() const { duke@435: return external_name(); duke@435: } duke@435: duke@435: // Verification duke@435: duke@435: class VerifyFieldClosure: public OopClosure { coleenp@548: protected: coleenp@548: template void do_oop_work(T* p) { duke@435: guarantee(Universe::heap()->is_in_closed_subset(p), "should be in heap"); coleenp@548: oop obj = oopDesc::load_decode_heap_oop(p); coleenp@548: if (!obj->is_oop_or_null()) { coleenp@548: tty->print_cr("Failed: " PTR_FORMAT " -> " PTR_FORMAT, p, (address)obj); duke@435: Universe::print(); duke@435: guarantee(false, "boom"); duke@435: } duke@435: } coleenp@548: public: coleenp@548: virtual void do_oop(oop* p) { VerifyFieldClosure::do_oop_work(p); } coleenp@548: virtual void do_oop(narrowOop* p) { VerifyFieldClosure::do_oop_work(p); } duke@435: }; duke@435: duke@435: void instanceKlass::oop_verify_on(oop obj, outputStream* st) { duke@435: Klass::oop_verify_on(obj, st); duke@435: VerifyFieldClosure blk; duke@435: oop_oop_iterate(obj, &blk); duke@435: } duke@435: duke@435: #ifndef PRODUCT duke@435: duke@435: void instanceKlass::verify_class_klass_nonstatic_oop_maps(klassOop k) { duke@435: // This verification code is disabled. JDK_Version::is_gte_jdk14x_version() duke@435: // cannot be called since this function is called before the VM is duke@435: // able to determine what JDK version is running with. duke@435: // The check below always is false since 1.4. duke@435: return; duke@435: duke@435: // This verification code temporarily disabled for the 1.4 duke@435: // reflection implementation since java.lang.Class now has duke@435: // Java-level instance fields. Should rewrite this to handle this duke@435: // case. duke@435: if (!(JDK_Version::is_gte_jdk14x_version() && UseNewReflection)) { duke@435: // Verify that java.lang.Class instances have a fake oop field added. duke@435: instanceKlass* ik = instanceKlass::cast(k); duke@435: duke@435: // Check that we have the right class duke@435: static bool first_time = true; never@1577: guarantee(k == SystemDictionary::Class_klass() && first_time, "Invalid verify of maps"); duke@435: first_time = false; duke@435: const int extra = java_lang_Class::number_of_fake_oop_fields; duke@435: guarantee(ik->nonstatic_field_size() == extra, "just checking"); jcoomes@1373: guarantee(ik->nonstatic_oop_map_count() == 1, "just checking"); duke@435: guarantee(ik->size_helper() == align_object_size(instanceOopDesc::header_size() + extra), "just checking"); duke@435: duke@435: // Check that the map is (2,extra) duke@435: int offset = java_lang_Class::klass_offset; duke@435: duke@435: OopMapBlock* map = ik->start_of_nonstatic_oop_maps(); jcoomes@1374: guarantee(map->offset() == offset && map->count() == (unsigned int) extra, jcoomes@1374: "sanity"); duke@435: } duke@435: } duke@435: coleenp@548: #endif // ndef PRODUCT duke@435: coleenp@548: // JNIid class for jfieldIDs only coleenp@548: // Note to reviewers: coleenp@548: // These JNI functions are just moved over to column 1 and not changed coleenp@548: // in the compressed oops workspace. coleenp@548: JNIid::JNIid(klassOop holder, int offset, JNIid* next) { coleenp@548: _holder = holder; coleenp@548: _offset = offset; coleenp@548: _next = next; coleenp@548: debug_only(_is_static_field_id = false;) coleenp@548: } duke@435: duke@435: coleenp@548: JNIid* JNIid::find(int offset) { coleenp@548: JNIid* current = this; coleenp@548: while (current != NULL) { coleenp@548: if (current->offset() == offset) return current; coleenp@548: current = current->next(); coleenp@548: } coleenp@548: return NULL; coleenp@548: } duke@435: duke@435: void JNIid::oops_do(OopClosure* f) { duke@435: for (JNIid* cur = this; cur != NULL; cur = cur->next()) { duke@435: f->do_oop(cur->holder_addr()); duke@435: } duke@435: } duke@435: duke@435: void JNIid::deallocate(JNIid* current) { coleenp@548: while (current != NULL) { coleenp@548: JNIid* next = current->next(); coleenp@548: delete current; coleenp@548: current = next; coleenp@548: } coleenp@548: } duke@435: duke@435: coleenp@548: void JNIid::verify(klassOop holder) { coleenp@548: int first_field_offset = instanceKlass::cast(holder)->offset_of_static_fields(); coleenp@548: int end_field_offset; coleenp@548: end_field_offset = first_field_offset + (instanceKlass::cast(holder)->static_field_size() * wordSize); duke@435: coleenp@548: JNIid* current = this; coleenp@548: while (current != NULL) { coleenp@548: guarantee(current->holder() == holder, "Invalid klass in JNIid"); coleenp@548: #ifdef ASSERT coleenp@548: int o = current->offset(); coleenp@548: if (current->is_static_field_id()) { coleenp@548: guarantee(o >= first_field_offset && o < end_field_offset, "Invalid static field offset in JNIid"); coleenp@548: } coleenp@548: #endif coleenp@548: current = current->next(); coleenp@548: } coleenp@548: } duke@435: duke@435: duke@435: #ifdef ASSERT coleenp@548: void instanceKlass::set_init_state(ClassState state) { coleenp@548: bool good_state = as_klassOop()->is_shared() ? (_init_state <= state) coleenp@548: : (_init_state < state); coleenp@548: assert(good_state || state == allocated, "illegal state transition"); coleenp@548: _init_state = state; coleenp@548: } duke@435: #endif duke@435: duke@435: duke@435: // RedefineClasses() support for previous versions: duke@435: duke@435: // Add an information node that contains weak references to the duke@435: // interesting parts of the previous version of the_class. dcubed@1412: // This is also where we clean out any unused weak references. dcubed@1412: // Note that while we delete nodes from the _previous_versions dcubed@1412: // array, we never delete the array itself until the klass is dcubed@1412: // unloaded. The has_been_redefined() query depends on that fact. dcubed@1412: // duke@435: void instanceKlass::add_previous_version(instanceKlassHandle ikh, coleenp@548: BitMap* emcp_methods, int emcp_method_count) { duke@435: assert(Thread::current()->is_VM_thread(), coleenp@548: "only VMThread can add previous versions"); duke@435: duke@435: if (_previous_versions == NULL) { duke@435: // This is the first previous version so make some space. duke@435: // Start with 2 elements under the assumption that the class duke@435: // won't be redefined much. duke@435: _previous_versions = new (ResourceObj::C_HEAP) duke@435: GrowableArray(2, true); duke@435: } duke@435: duke@435: // RC_TRACE macro has an embedded ResourceMark duke@435: RC_TRACE(0x00000100, ("adding previous version ref for %s @%d, EMCP_cnt=%d", duke@435: ikh->external_name(), _previous_versions->length(), emcp_method_count)); duke@435: constantPoolHandle cp_h(ikh->constants()); dcubed@482: jobject cp_ref; dcubed@482: if (cp_h->is_shared()) { dcubed@482: // a shared ConstantPool requires a regular reference; a weak dcubed@482: // reference would be collectible dcubed@482: cp_ref = JNIHandles::make_global(cp_h); dcubed@482: } else { dcubed@482: cp_ref = JNIHandles::make_weak_global(cp_h); dcubed@482: } duke@435: PreviousVersionNode * pv_node = NULL; duke@435: objArrayOop old_methods = ikh->methods(); duke@435: duke@435: if (emcp_method_count == 0) { dcubed@482: // non-shared ConstantPool gets a weak reference dcubed@482: pv_node = new PreviousVersionNode(cp_ref, !cp_h->is_shared(), NULL); duke@435: RC_TRACE(0x00000400, duke@435: ("add: all methods are obsolete; flushing any EMCP weak refs")); duke@435: } else { duke@435: int local_count = 0; duke@435: GrowableArray* method_refs = new (ResourceObj::C_HEAP) duke@435: GrowableArray(emcp_method_count, true); duke@435: for (int i = 0; i < old_methods->length(); i++) { duke@435: if (emcp_methods->at(i)) { duke@435: // this old method is EMCP so save a weak ref duke@435: methodOop old_method = (methodOop) old_methods->obj_at(i); duke@435: methodHandle old_method_h(old_method); duke@435: jweak method_ref = JNIHandles::make_weak_global(old_method_h); duke@435: method_refs->append(method_ref); duke@435: if (++local_count >= emcp_method_count) { duke@435: // no more EMCP methods so bail out now duke@435: break; duke@435: } duke@435: } duke@435: } dcubed@482: // non-shared ConstantPool gets a weak reference dcubed@482: pv_node = new PreviousVersionNode(cp_ref, !cp_h->is_shared(), method_refs); duke@435: } duke@435: duke@435: _previous_versions->append(pv_node); duke@435: duke@435: // Using weak references allows the interesting parts of previous duke@435: // classes to be GC'ed when they are no longer needed. Since the duke@435: // caller is the VMThread and we are at a safepoint, this is a good duke@435: // time to clear out unused weak references. duke@435: duke@435: RC_TRACE(0x00000400, ("add: previous version length=%d", duke@435: _previous_versions->length())); duke@435: duke@435: // skip the last entry since we just added it duke@435: for (int i = _previous_versions->length() - 2; i >= 0; i--) { duke@435: // check the previous versions array for a GC'ed weak refs duke@435: pv_node = _previous_versions->at(i); duke@435: cp_ref = pv_node->prev_constant_pool(); dcubed@482: assert(cp_ref != NULL, "cp ref was unexpectedly cleared"); duke@435: if (cp_ref == NULL) { duke@435: delete pv_node; duke@435: _previous_versions->remove_at(i); duke@435: // Since we are traversing the array backwards, we don't have to duke@435: // do anything special with the index. duke@435: continue; // robustness duke@435: } duke@435: duke@435: constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref); duke@435: if (cp == NULL) { duke@435: // this entry has been GC'ed so remove it duke@435: delete pv_node; duke@435: _previous_versions->remove_at(i); duke@435: // Since we are traversing the array backwards, we don't have to duke@435: // do anything special with the index. duke@435: continue; duke@435: } else { duke@435: RC_TRACE(0x00000400, ("add: previous version @%d is alive", i)); duke@435: } duke@435: duke@435: GrowableArray* method_refs = pv_node->prev_EMCP_methods(); duke@435: if (method_refs != NULL) { duke@435: RC_TRACE(0x00000400, ("add: previous methods length=%d", duke@435: method_refs->length())); duke@435: for (int j = method_refs->length() - 1; j >= 0; j--) { duke@435: jweak method_ref = method_refs->at(j); duke@435: assert(method_ref != NULL, "weak method ref was unexpectedly cleared"); duke@435: if (method_ref == NULL) { duke@435: method_refs->remove_at(j); duke@435: // Since we are traversing the array backwards, we don't have to duke@435: // do anything special with the index. duke@435: continue; // robustness duke@435: } duke@435: duke@435: methodOop method = (methodOop)JNIHandles::resolve(method_ref); duke@435: if (method == NULL || emcp_method_count == 0) { duke@435: // This method entry has been GC'ed or the current duke@435: // RedefineClasses() call has made all methods obsolete duke@435: // so remove it. duke@435: JNIHandles::destroy_weak_global(method_ref); duke@435: method_refs->remove_at(j); duke@435: } else { duke@435: // RC_TRACE macro has an embedded ResourceMark duke@435: RC_TRACE(0x00000400, duke@435: ("add: %s(%s): previous method @%d in version @%d is alive", duke@435: method->name()->as_C_string(), method->signature()->as_C_string(), duke@435: j, i)); duke@435: } duke@435: } duke@435: } duke@435: } duke@435: duke@435: int obsolete_method_count = old_methods->length() - emcp_method_count; duke@435: duke@435: if (emcp_method_count != 0 && obsolete_method_count != 0 && duke@435: _previous_versions->length() > 1) { duke@435: // We have a mix of obsolete and EMCP methods. If there is more duke@435: // than the previous version that we just added, then we have to duke@435: // clear out any matching EMCP method entries the hard way. duke@435: int local_count = 0; duke@435: for (int i = 0; i < old_methods->length(); i++) { duke@435: if (!emcp_methods->at(i)) { duke@435: // only obsolete methods are interesting duke@435: methodOop old_method = (methodOop) old_methods->obj_at(i); duke@435: symbolOop m_name = old_method->name(); duke@435: symbolOop m_signature = old_method->signature(); duke@435: duke@435: // skip the last entry since we just added it duke@435: for (int j = _previous_versions->length() - 2; j >= 0; j--) { duke@435: // check the previous versions array for a GC'ed weak refs duke@435: pv_node = _previous_versions->at(j); duke@435: cp_ref = pv_node->prev_constant_pool(); dcubed@482: assert(cp_ref != NULL, "cp ref was unexpectedly cleared"); duke@435: if (cp_ref == NULL) { duke@435: delete pv_node; duke@435: _previous_versions->remove_at(j); duke@435: // Since we are traversing the array backwards, we don't have to duke@435: // do anything special with the index. duke@435: continue; // robustness duke@435: } duke@435: duke@435: constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref); duke@435: if (cp == NULL) { duke@435: // this entry has been GC'ed so remove it duke@435: delete pv_node; duke@435: _previous_versions->remove_at(j); duke@435: // Since we are traversing the array backwards, we don't have to duke@435: // do anything special with the index. duke@435: continue; duke@435: } duke@435: duke@435: GrowableArray* method_refs = pv_node->prev_EMCP_methods(); duke@435: if (method_refs == NULL) { duke@435: // We have run into a PreviousVersion generation where duke@435: // all methods were made obsolete during that generation's duke@435: // RedefineClasses() operation. At the time of that duke@435: // operation, all EMCP methods were flushed so we don't duke@435: // have to go back any further. duke@435: // duke@435: // A NULL method_refs is different than an empty method_refs. duke@435: // We cannot infer any optimizations about older generations duke@435: // from an empty method_refs for the current generation. duke@435: break; duke@435: } duke@435: duke@435: for (int k = method_refs->length() - 1; k >= 0; k--) { duke@435: jweak method_ref = method_refs->at(k); duke@435: assert(method_ref != NULL, duke@435: "weak method ref was unexpectedly cleared"); duke@435: if (method_ref == NULL) { duke@435: method_refs->remove_at(k); duke@435: // Since we are traversing the array backwards, we don't duke@435: // have to do anything special with the index. duke@435: continue; // robustness duke@435: } duke@435: duke@435: methodOop method = (methodOop)JNIHandles::resolve(method_ref); duke@435: if (method == NULL) { duke@435: // this method entry has been GC'ed so skip it duke@435: JNIHandles::destroy_weak_global(method_ref); duke@435: method_refs->remove_at(k); duke@435: continue; duke@435: } duke@435: duke@435: if (method->name() == m_name && duke@435: method->signature() == m_signature) { duke@435: // The current RedefineClasses() call has made all EMCP duke@435: // versions of this method obsolete so mark it as obsolete duke@435: // and remove the weak ref. duke@435: RC_TRACE(0x00000400, duke@435: ("add: %s(%s): flush obsolete method @%d in version @%d", duke@435: m_name->as_C_string(), m_signature->as_C_string(), k, j)); duke@435: duke@435: method->set_is_obsolete(); duke@435: JNIHandles::destroy_weak_global(method_ref); duke@435: method_refs->remove_at(k); duke@435: break; duke@435: } duke@435: } duke@435: duke@435: // The previous loop may not find a matching EMCP method, but duke@435: // that doesn't mean that we can optimize and not go any duke@435: // further back in the PreviousVersion generations. The EMCP duke@435: // method for this generation could have already been GC'ed, duke@435: // but there still may be an older EMCP method that has not duke@435: // been GC'ed. duke@435: } duke@435: duke@435: if (++local_count >= obsolete_method_count) { duke@435: // no more obsolete methods so bail out now duke@435: break; duke@435: } duke@435: } duke@435: } duke@435: } duke@435: } // end add_previous_version() duke@435: duke@435: duke@435: // Determine if instanceKlass has a previous version. duke@435: bool instanceKlass::has_previous_version() const { duke@435: if (_previous_versions == NULL) { duke@435: // no previous versions array so answer is easy duke@435: return false; duke@435: } duke@435: duke@435: for (int i = _previous_versions->length() - 1; i >= 0; i--) { duke@435: // Check the previous versions array for an info node that hasn't duke@435: // been GC'ed duke@435: PreviousVersionNode * pv_node = _previous_versions->at(i); duke@435: dcubed@482: jobject cp_ref = pv_node->prev_constant_pool(); dcubed@482: assert(cp_ref != NULL, "cp reference was unexpectedly cleared"); duke@435: if (cp_ref == NULL) { duke@435: continue; // robustness duke@435: } duke@435: duke@435: constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref); duke@435: if (cp != NULL) { duke@435: // we have at least one previous version duke@435: return true; duke@435: } duke@435: duke@435: // We don't have to check the method refs. If the constant pool has duke@435: // been GC'ed then so have the methods. duke@435: } duke@435: duke@435: // all of the underlying nodes' info has been GC'ed duke@435: return false; duke@435: } // end has_previous_version() duke@435: duke@435: methodOop instanceKlass::method_with_idnum(int idnum) { duke@435: methodOop m = NULL; duke@435: if (idnum < methods()->length()) { duke@435: m = (methodOop) methods()->obj_at(idnum); duke@435: } duke@435: if (m == NULL || m->method_idnum() != idnum) { duke@435: for (int index = 0; index < methods()->length(); ++index) { duke@435: m = (methodOop) methods()->obj_at(index); duke@435: if (m->method_idnum() == idnum) { duke@435: return m; duke@435: } duke@435: } duke@435: } duke@435: return m; duke@435: } duke@435: duke@435: duke@435: // Set the annotation at 'idnum' to 'anno'. duke@435: // We don't want to create or extend the array if 'anno' is NULL, since that is the duke@435: // default value. However, if the array exists and is long enough, we must set NULL values. duke@435: void instanceKlass::set_methods_annotations_of(int idnum, typeArrayOop anno, objArrayOop* md_p) { duke@435: objArrayOop md = *md_p; duke@435: if (md != NULL && md->length() > idnum) { duke@435: md->obj_at_put(idnum, anno); duke@435: } else if (anno != NULL) { duke@435: // create the array duke@435: int length = MAX2(idnum+1, (int)_idnum_allocated_count); duke@435: md = oopFactory::new_system_objArray(length, Thread::current()); duke@435: if (*md_p != NULL) { duke@435: // copy the existing entries duke@435: for (int index = 0; index < (*md_p)->length(); index++) { duke@435: md->obj_at_put(index, (*md_p)->obj_at(index)); duke@435: } duke@435: } duke@435: set_annotations(md, md_p); duke@435: md->obj_at_put(idnum, anno); duke@435: } // if no array and idnum isn't included there is nothing to do duke@435: } duke@435: duke@435: // Construct a PreviousVersionNode entry for the array hung off duke@435: // the instanceKlass. dcubed@482: PreviousVersionNode::PreviousVersionNode(jobject prev_constant_pool, dcubed@482: bool prev_cp_is_weak, GrowableArray* prev_EMCP_methods) { duke@435: duke@435: _prev_constant_pool = prev_constant_pool; dcubed@482: _prev_cp_is_weak = prev_cp_is_weak; duke@435: _prev_EMCP_methods = prev_EMCP_methods; duke@435: } duke@435: duke@435: duke@435: // Destroy a PreviousVersionNode duke@435: PreviousVersionNode::~PreviousVersionNode() { duke@435: if (_prev_constant_pool != NULL) { dcubed@482: if (_prev_cp_is_weak) { dcubed@482: JNIHandles::destroy_weak_global(_prev_constant_pool); dcubed@482: } else { dcubed@482: JNIHandles::destroy_global(_prev_constant_pool); dcubed@482: } duke@435: } duke@435: duke@435: if (_prev_EMCP_methods != NULL) { duke@435: for (int i = _prev_EMCP_methods->length() - 1; i >= 0; i--) { duke@435: jweak method_ref = _prev_EMCP_methods->at(i); duke@435: if (method_ref != NULL) { duke@435: JNIHandles::destroy_weak_global(method_ref); duke@435: } duke@435: } duke@435: delete _prev_EMCP_methods; duke@435: } duke@435: } duke@435: duke@435: duke@435: // Construct a PreviousVersionInfo entry duke@435: PreviousVersionInfo::PreviousVersionInfo(PreviousVersionNode *pv_node) { duke@435: _prev_constant_pool_handle = constantPoolHandle(); // NULL handle duke@435: _prev_EMCP_method_handles = NULL; duke@435: dcubed@482: jobject cp_ref = pv_node->prev_constant_pool(); dcubed@482: assert(cp_ref != NULL, "constant pool ref was unexpectedly cleared"); duke@435: if (cp_ref == NULL) { duke@435: return; // robustness duke@435: } duke@435: duke@435: constantPoolOop cp = (constantPoolOop)JNIHandles::resolve(cp_ref); duke@435: if (cp == NULL) { duke@435: // Weak reference has been GC'ed. Since the constant pool has been duke@435: // GC'ed, the methods have also been GC'ed. duke@435: return; duke@435: } duke@435: duke@435: // make the constantPoolOop safe to return duke@435: _prev_constant_pool_handle = constantPoolHandle(cp); duke@435: duke@435: GrowableArray* method_refs = pv_node->prev_EMCP_methods(); duke@435: if (method_refs == NULL) { duke@435: // the instanceKlass did not have any EMCP methods duke@435: return; duke@435: } duke@435: duke@435: _prev_EMCP_method_handles = new GrowableArray(10); duke@435: duke@435: int n_methods = method_refs->length(); duke@435: for (int i = 0; i < n_methods; i++) { duke@435: jweak method_ref = method_refs->at(i); duke@435: assert(method_ref != NULL, "weak method ref was unexpectedly cleared"); duke@435: if (method_ref == NULL) { duke@435: continue; // robustness duke@435: } duke@435: duke@435: methodOop method = (methodOop)JNIHandles::resolve(method_ref); duke@435: if (method == NULL) { duke@435: // this entry has been GC'ed so skip it duke@435: continue; duke@435: } duke@435: duke@435: // make the methodOop safe to return duke@435: _prev_EMCP_method_handles->append(methodHandle(method)); duke@435: } duke@435: } duke@435: duke@435: duke@435: // Destroy a PreviousVersionInfo duke@435: PreviousVersionInfo::~PreviousVersionInfo() { duke@435: // Since _prev_EMCP_method_handles is not C-heap allocated, we duke@435: // don't have to delete it. duke@435: } duke@435: duke@435: duke@435: // Construct a helper for walking the previous versions array duke@435: PreviousVersionWalker::PreviousVersionWalker(instanceKlass *ik) { duke@435: _previous_versions = ik->previous_versions(); duke@435: _current_index = 0; duke@435: // _hm needs no initialization duke@435: _current_p = NULL; duke@435: } duke@435: duke@435: duke@435: // Destroy a PreviousVersionWalker duke@435: PreviousVersionWalker::~PreviousVersionWalker() { duke@435: // Delete the current info just in case the caller didn't walk to duke@435: // the end of the previous versions list. No harm if _current_p is duke@435: // already NULL. duke@435: delete _current_p; duke@435: duke@435: // When _hm is destroyed, all the Handles returned in duke@435: // PreviousVersionInfo objects will be destroyed. duke@435: // Also, after this destructor is finished it will be duke@435: // safe to delete the GrowableArray allocated in the duke@435: // PreviousVersionInfo objects. duke@435: } duke@435: duke@435: duke@435: // Return the interesting information for the next previous version duke@435: // of the klass. Returns NULL if there are no more previous versions. duke@435: PreviousVersionInfo* PreviousVersionWalker::next_previous_version() { duke@435: if (_previous_versions == NULL) { duke@435: // no previous versions so nothing to return duke@435: return NULL; duke@435: } duke@435: duke@435: delete _current_p; // cleanup the previous info for the caller duke@435: _current_p = NULL; // reset to NULL so we don't delete same object twice duke@435: duke@435: int length = _previous_versions->length(); duke@435: duke@435: while (_current_index < length) { duke@435: PreviousVersionNode * pv_node = _previous_versions->at(_current_index++); duke@435: PreviousVersionInfo * pv_info = new (ResourceObj::C_HEAP) duke@435: PreviousVersionInfo(pv_node); duke@435: duke@435: constantPoolHandle cp_h = pv_info->prev_constant_pool_handle(); duke@435: if (cp_h.is_null()) { duke@435: delete pv_info; duke@435: duke@435: // The underlying node's info has been GC'ed so try the next one. duke@435: // We don't have to check the methods. If the constant pool has duke@435: // GC'ed then so have the methods. duke@435: continue; duke@435: } duke@435: duke@435: // Found a node with non GC'ed info so return it. The caller will duke@435: // need to delete pv_info when they are done with it. duke@435: _current_p = pv_info; duke@435: return pv_info; duke@435: } duke@435: duke@435: // all of the underlying nodes' info has been GC'ed duke@435: return NULL; duke@435: } // end next_previous_version()