duke@435: /* coleenp@6316: * Copyright (c) 1997, 2014, 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: stefank@2314: #include "precompiled.hpp" stefank@2314: #include "classfile/javaClasses.hpp" stefank@2314: #include "classfile/systemDictionary.hpp" stefank@2314: #include "classfile/verifier.hpp" stefank@2314: #include "classfile/vmSymbols.hpp" stefank@2314: #include "compiler/compileBroker.hpp" stefank@2314: #include "gc_implementation/shared/markSweep.inline.hpp" stefank@2314: #include "gc_interface/collectedHeap.inline.hpp" stefank@2314: #include "interpreter/oopMapCache.hpp" stefank@2314: #include "interpreter/rewriter.hpp" stefank@2314: #include "jvmtifiles/jvmti.h" stefank@2314: #include "memory/genOopClosures.inline.hpp" acorn@4497: #include "memory/heapInspection.hpp" stefank@6982: #include "memory/iterator.inline.hpp" coleenp@4037: #include "memory/metadataFactory.hpp" stefank@2314: #include "memory/oopFactory.hpp" never@3137: #include "oops/fieldStreams.hpp" coleenp@4037: #include "oops/instanceClassLoaderKlass.hpp" stefank@2314: #include "oops/instanceKlass.hpp" never@2658: #include "oops/instanceMirrorKlass.hpp" stefank@2314: #include "oops/instanceOop.hpp" coleenp@4037: #include "oops/klass.inline.hpp" coleenp@4037: #include "oops/method.hpp" stefank@2314: #include "oops/oop.inline.hpp" coleenp@2497: #include "oops/symbol.hpp" stefank@2314: #include "prims/jvmtiExport.hpp" stefank@2314: #include "prims/jvmtiRedefineClassesTrace.hpp" jiangli@5421: #include "prims/jvmtiRedefineClasses.hpp" coleenp@4395: #include "prims/methodComparator.hpp" stefank@2314: #include "runtime/fieldDescriptor.hpp" stefank@2314: #include "runtime/handles.inline.hpp" stefank@2314: #include "runtime/javaCalls.hpp" stefank@2314: #include "runtime/mutexLocker.hpp" goetz@6911: #include "runtime/orderAccess.inline.hpp" stefank@4299: #include "runtime/thread.inline.hpp" coleenp@4981: #include "services/classLoadingService.hpp" stefank@2314: #include "services/threadService.hpp" stefank@2314: #include "utilities/dtrace.hpp" jprovino@4542: #include "utilities/macros.hpp" jprovino@4542: #if INCLUDE_ALL_GCS coleenp@4037: #include "gc_implementation/concurrentMarkSweep/cmsOopClosures.inline.hpp" stefank@2314: #include "gc_implementation/g1/g1CollectedHeap.inline.hpp" stefank@2314: #include "gc_implementation/g1/g1OopClosures.inline.hpp" stefank@2314: #include "gc_implementation/g1/g1RemSet.inline.hpp" stefank@2314: #include "gc_implementation/g1/heapRegionSeq.inline.hpp" stefank@2314: #include "gc_implementation/parNew/parOopClosures.inline.hpp" coleenp@4037: #include "gc_implementation/parallelScavenge/parallelScavengeHeap.inline.hpp" stefank@2314: #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp" stefank@2314: #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp" stefank@2314: #include "oops/oop.pcgc.inline.hpp" jprovino@4542: #endif // INCLUDE_ALL_GCS stefank@2314: #ifdef COMPILER1 stefank@2314: #include "c1/c1_Compiler.hpp" stefank@2314: #endif duke@435: drchase@6680: PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC drchase@6680: fparain@1759: #ifdef DTRACE_ENABLED fparain@1759: dcubed@3202: #ifndef USDT2 dcubed@3202: 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; \ coleenp@2497: Symbol* 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, \ hseigel@5784: data, len, SOLARIS_ONLY((void *))(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; \ coleenp@2497: Symbol* 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, \ hseigel@5784: data, len, SOLARIS_ONLY((void *))(clss)->class_loader(), thread_type, wait); \ fparain@1759: } dcubed@3202: #else /* USDT2 */ dcubed@3202: dcubed@3202: #define HOTSPOT_CLASS_INITIALIZATION_required HOTSPOT_CLASS_INITIALIZATION_REQUIRED dcubed@3202: #define HOTSPOT_CLASS_INITIALIZATION_recursive HOTSPOT_CLASS_INITIALIZATION_RECURSIVE dcubed@3202: #define HOTSPOT_CLASS_INITIALIZATION_concurrent HOTSPOT_CLASS_INITIALIZATION_CONCURRENT dcubed@3202: #define HOTSPOT_CLASS_INITIALIZATION_erroneous HOTSPOT_CLASS_INITIALIZATION_ERRONEOUS dcubed@3202: #define HOTSPOT_CLASS_INITIALIZATION_super__failed HOTSPOT_CLASS_INITIALIZATION_SUPER_FAILED dcubed@3202: #define HOTSPOT_CLASS_INITIALIZATION_clinit HOTSPOT_CLASS_INITIALIZATION_CLINIT dcubed@3202: #define HOTSPOT_CLASS_INITIALIZATION_error HOTSPOT_CLASS_INITIALIZATION_ERROR dcubed@3202: #define HOTSPOT_CLASS_INITIALIZATION_end HOTSPOT_CLASS_INITIALIZATION_END dcubed@3202: #define DTRACE_CLASSINIT_PROBE(type, clss, thread_type) \ dcubed@3202: { \ dcubed@3202: char* data = NULL; \ dcubed@3202: int len = 0; \ dcubed@3202: Symbol* name = (clss)->name(); \ dcubed@3202: if (name != NULL) { \ dcubed@3202: data = (char*)name->bytes(); \ dcubed@3202: len = name->utf8_length(); \ dcubed@3202: } \ dcubed@3202: HOTSPOT_CLASS_INITIALIZATION_##type( \ dcubed@3202: data, len, (clss)->class_loader(), thread_type); \ dcubed@3202: } dcubed@3202: dcubed@3202: #define DTRACE_CLASSINIT_PROBE_WAIT(type, clss, thread_type, wait) \ dcubed@3202: { \ dcubed@3202: char* data = NULL; \ dcubed@3202: int len = 0; \ dcubed@3202: Symbol* name = (clss)->name(); \ dcubed@3202: if (name != NULL) { \ dcubed@3202: data = (char*)name->bytes(); \ dcubed@3202: len = name->utf8_length(); \ dcubed@3202: } \ dcubed@3202: HOTSPOT_CLASS_INITIALIZATION_##type( \ dcubed@3202: data, len, (clss)->class_loader(), thread_type, wait); \ dcubed@3202: } dcubed@3202: #endif /* USDT2 */ 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: zgu@4400: volatile int InstanceKlass::_total_instanceKlass_count = 0; zgu@4400: coleenp@4719: InstanceKlass* InstanceKlass::allocate_instance_klass( coleenp@4719: ClassLoaderData* loader_data, coleenp@4572: int vtable_len, coleenp@4572: int itable_len, coleenp@4572: int static_field_size, coleenp@4572: int nonstatic_oop_map_size, coleenp@4572: ReferenceType rt, coleenp@4572: AccessFlags access_flags, coleenp@4572: Symbol* name, coleenp@4037: Klass* super_klass, coleenp@4572: bool is_anonymous, coleenp@4572: TRAPS) { coleenp@4037: coleenp@4037: int size = InstanceKlass::size(vtable_len, itable_len, nonstatic_oop_map_size, coleenp@4572: access_flags.is_interface(), is_anonymous); coleenp@4037: coleenp@4037: // Allocation coleenp@4037: InstanceKlass* ik; coleenp@4037: if (rt == REF_NONE) { coleenp@4037: if (name == vmSymbols::java_lang_Class()) { coleenp@4047: ik = new (loader_data, size, THREAD) InstanceMirrorKlass( coleenp@4037: vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt, coleenp@4572: access_flags, is_anonymous); coleenp@4037: } else if (name == vmSymbols::java_lang_ClassLoader() || coleenp@4037: (SystemDictionary::ClassLoader_klass_loaded() && coleenp@4037: super_klass != NULL && coleenp@4037: super_klass->is_subtype_of(SystemDictionary::ClassLoader_klass()))) { coleenp@4047: ik = new (loader_data, size, THREAD) InstanceClassLoaderKlass( coleenp@4037: vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt, coleenp@4572: access_flags, is_anonymous); coleenp@4037: } else { coleenp@4037: // normal class coleenp@4037: ik = new (loader_data, size, THREAD) InstanceKlass( coleenp@4037: vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt, coleenp@4572: access_flags, is_anonymous); coleenp@4037: } coleenp@4037: } else { coleenp@4037: // reference klass coleenp@4047: ik = new (loader_data, size, THREAD) InstanceRefKlass( coleenp@4037: vtable_len, itable_len, static_field_size, nonstatic_oop_map_size, rt, coleenp@4572: access_flags, is_anonymous); coleenp@4037: } coleenp@4037: coleenp@4719: // Check for pending exception before adding to the loader data and incrementing coleenp@4719: // class count. Can get OOM here. coleenp@4719: if (HAS_PENDING_EXCEPTION) { coleenp@4719: return NULL; coleenp@4719: } coleenp@4719: coleenp@4719: // Add all classes to our internal class loader list here, coleenp@4719: // including classes in the bootstrap (NULL) class loader. coleenp@4719: loader_data->add_class(ik); coleenp@4719: zgu@4400: Atomic::inc(&_total_instanceKlass_count); coleenp@4037: return ik; coleenp@4037: } coleenp@4037: coleenp@4719: coleenp@4719: // copy method ordering from resource area to Metaspace coleenp@4719: void InstanceKlass::copy_method_ordering(intArray* m, TRAPS) { coleenp@4719: if (m != NULL) { coleenp@4719: // allocate a new array and copy contents (memcpy?) coleenp@4719: _method_ordering = MetadataFactory::new_array(class_loader_data(), m->length(), CHECK); coleenp@4719: for (int i = 0; i < m->length(); i++) { coleenp@4719: _method_ordering->at_put(i, m->at(i)); coleenp@4719: } coleenp@4719: } else { coleenp@4719: _method_ordering = Universe::the_empty_int_array(); coleenp@4719: } coleenp@4719: } coleenp@4719: acorn@5848: // create a new array of vtable_indices for default methods acorn@5848: Array* InstanceKlass::create_new_default_vtable_indices(int len, TRAPS) { acorn@5848: Array* vtable_indices = MetadataFactory::new_array(class_loader_data(), len, CHECK_NULL); acorn@5848: assert(default_vtable_indices() == NULL, "only create once"); acorn@5848: set_default_vtable_indices(vtable_indices); acorn@5848: return vtable_indices; acorn@5848: } coleenp@4719: coleenp@4037: InstanceKlass::InstanceKlass(int vtable_len, coleenp@4037: int itable_len, coleenp@4037: int static_field_size, coleenp@4037: int nonstatic_oop_map_size, coleenp@4037: ReferenceType rt, coleenp@4037: AccessFlags access_flags, coleenp@4037: bool is_anonymous) { coleenp@4037: No_Safepoint_Verifier no_safepoint; // until k becomes parsable coleenp@4037: coleenp@4712: int iksize = InstanceKlass::size(vtable_len, itable_len, nonstatic_oop_map_size, coleenp@4712: access_flags.is_interface(), is_anonymous); coleenp@4037: coleenp@4712: set_vtable_length(vtable_len); coleenp@4712: set_itable_length(itable_len); coleenp@4712: set_static_field_size(static_field_size); coleenp@4712: set_nonstatic_oop_map_size(nonstatic_oop_map_size); coleenp@4712: set_access_flags(access_flags); coleenp@4712: _misc_flags = 0; // initialize to zero coleenp@4712: set_is_anonymous(is_anonymous); coleenp@4712: assert(size() == iksize, "wrong size for object"); coleenp@4712: coleenp@4712: set_array_klasses(NULL); coleenp@4712: set_methods(NULL); coleenp@4712: set_method_ordering(NULL); acorn@5848: set_default_methods(NULL); acorn@5848: set_default_vtable_indices(NULL); coleenp@4712: set_local_interfaces(NULL); coleenp@4712: set_transitive_interfaces(NULL); coleenp@4712: init_implementor(); coleenp@4712: set_fields(NULL, 0); coleenp@4712: set_constants(NULL); coleenp@4712: set_class_loader_data(NULL); jiangli@5535: set_source_file_name_index(0); coleenp@4712: set_source_debug_extension(NULL, 0); coleenp@4712: set_array_name(NULL); coleenp@4712: set_inner_classes(NULL); coleenp@4712: set_static_oop_field_count(0); coleenp@4712: set_nonstatic_field_size(0); coleenp@4712: set_is_marked_dependent(false); stefank@6992: set_has_unloaded_dependent(false); coleenp@4712: set_init_state(InstanceKlass::allocated); coleenp@4712: set_init_thread(NULL); coleenp@4712: set_reference_type(rt); coleenp@4712: set_oop_map_cache(NULL); coleenp@4712: set_jni_ids(NULL); coleenp@4712: set_osr_nmethods_head(NULL); coleenp@4712: set_breakpoints(NULL); coleenp@4712: init_previous_versions(); jiangli@5535: set_generic_signature_index(0); coleenp@4712: release_set_methods_jmethod_ids(NULL); coleenp@4712: set_annotations(NULL); coleenp@4712: set_jvmti_cached_class_field_map(NULL); coleenp@4712: set_initial_method_idnum(0); coleenp@4712: _dependencies = NULL; coleenp@4712: set_jvmti_cached_class_field_map(NULL); jiangli@5421: set_cached_class_file(NULL); coleenp@4712: set_initial_method_idnum(0); coleenp@4712: set_minor_version(0); coleenp@4712: set_major_version(0); coleenp@4712: NOT_PRODUCT(_verify_count = 0;) coleenp@4037: coleenp@4037: // initialize the non-header words to zero coleenp@4037: intptr_t* p = (intptr_t*)this; coleenp@4712: for (int index = InstanceKlass::header_size(); index < iksize; index++) { coleenp@4037: p[index] = NULL_WORD; coleenp@4037: } coleenp@4037: coleenp@4037: // Set temporary value until parseClassFile updates it with the real instance coleenp@4037: // size. coleenp@4712: set_layout_helper(Klass::instance_layout_helper(0, true)); coleenp@4037: } coleenp@4037: coleenp@4037: coleenp@4719: void InstanceKlass::deallocate_methods(ClassLoaderData* loader_data, coleenp@4719: Array* methods) { hseigel@5896: if (methods != NULL && methods != Universe::the_empty_method_array() && hseigel@5896: !methods->is_shared()) { coleenp@4719: for (int i = 0; i < methods->length(); i++) { coleenp@4719: Method* method = methods->at(i); coleenp@4719: if (method == NULL) continue; // maybe null if error processing coleenp@4719: // Only want to delete methods that are not executing for RedefineClasses. coleenp@4719: // The previous version will point to them so they're not totally dangling coleenp@4719: assert (!method->on_stack(), "shouldn't be called with methods on stack"); coleenp@4719: MetadataFactory::free_metadata(loader_data, method); coleenp@4719: } coleenp@4719: MetadataFactory::free_array(loader_data, methods); coleenp@4719: } coleenp@4719: } coleenp@4719: coleenp@4719: void InstanceKlass::deallocate_interfaces(ClassLoaderData* loader_data, coleenp@4719: Klass* super_klass, coleenp@4719: Array* local_interfaces, coleenp@4719: Array* transitive_interfaces) { coleenp@4719: // Only deallocate transitive interfaces if not empty, same as super class coleenp@4719: // or same as local interfaces. See code in parseClassFile. coleenp@4719: Array* ti = transitive_interfaces; coleenp@4719: if (ti != Universe::the_empty_klass_array() && ti != local_interfaces) { coleenp@4719: // check that the interfaces don't come from super class coleenp@4719: Array* sti = (super_klass == NULL) ? NULL : coleenp@4719: InstanceKlass::cast(super_klass)->transitive_interfaces(); hseigel@5896: if (ti != sti && ti != NULL && !ti->is_shared()) { coleenp@4719: MetadataFactory::free_array(loader_data, ti); coleenp@4719: } coleenp@4719: } coleenp@4719: coleenp@4719: // local interfaces can be empty hseigel@5896: if (local_interfaces != Universe::the_empty_klass_array() && hseigel@5896: local_interfaces != NULL && !local_interfaces->is_shared()) { coleenp@4719: MetadataFactory::free_array(loader_data, local_interfaces); coleenp@4719: } coleenp@4719: } coleenp@4719: coleenp@4037: // This function deallocates the metadata and C heap pointers that the coleenp@4037: // InstanceKlass points to. coleenp@4037: void InstanceKlass::deallocate_contents(ClassLoaderData* loader_data) { coleenp@4037: coleenp@4037: // Orphan the mirror first, CMS thinks it's still live. coleenp@4719: if (java_mirror() != NULL) { coleenp@4719: java_lang_Class::set_klass(java_mirror(), NULL); coleenp@4719: } coleenp@4037: coleenp@4037: // Need to take this class off the class loader data list. coleenp@4037: loader_data->remove_class(this); coleenp@4037: coleenp@4037: // The array_klass for this class is created later, after error handling. coleenp@4037: // For class redefinition, we keep the original class so this scratch class coleenp@4037: // doesn't have an array class. Either way, assert that there is nothing coleenp@4037: // to deallocate. coleenp@4037: assert(array_klasses() == NULL, "array classes shouldn't be created for this class yet"); coleenp@4037: coleenp@4037: // Release C heap allocated data that this might point to, which includes coleenp@4037: // reference counting symbol names. coleenp@4037: release_C_heap_structures(); coleenp@4037: coleenp@4719: deallocate_methods(loader_data, methods()); coleenp@4037: set_methods(NULL); coleenp@4037: hseigel@5896: if (method_ordering() != NULL && hseigel@5896: method_ordering() != Universe::the_empty_int_array() && hseigel@5896: !method_ordering()->is_shared()) { coleenp@4037: MetadataFactory::free_array(loader_data, method_ordering()); coleenp@4037: } coleenp@4037: set_method_ordering(NULL); coleenp@4037: acorn@5848: // default methods can be empty acorn@5848: if (default_methods() != NULL && hseigel@5896: default_methods() != Universe::the_empty_method_array() && hseigel@5896: !default_methods()->is_shared()) { acorn@5848: MetadataFactory::free_array(loader_data, default_methods()); acorn@5848: } acorn@5848: // Do NOT deallocate the default methods, they are owned by superinterfaces. acorn@5848: set_default_methods(NULL); acorn@5848: acorn@5848: // default methods vtable indices can be empty hseigel@5896: if (default_vtable_indices() != NULL && hseigel@5896: !default_vtable_indices()->is_shared()) { acorn@5848: MetadataFactory::free_array(loader_data, default_vtable_indices()); acorn@5848: } acorn@5848: set_default_vtable_indices(NULL); acorn@5848: acorn@5848: coleenp@4037: // This array is in Klass, but remove it with the InstanceKlass since coleenp@4037: // this place would be the only caller and it can share memory with transitive coleenp@4037: // interfaces. hseigel@5896: if (secondary_supers() != NULL && hseigel@5896: secondary_supers() != Universe::the_empty_klass_array() && hseigel@5896: secondary_supers() != transitive_interfaces() && hseigel@5896: !secondary_supers()->is_shared()) { coleenp@4037: MetadataFactory::free_array(loader_data, secondary_supers()); coleenp@4037: } coleenp@4037: set_secondary_supers(NULL); coleenp@4037: coleenp@4719: deallocate_interfaces(loader_data, super(), local_interfaces(), transitive_interfaces()); coleenp@4037: set_transitive_interfaces(NULL); coleenp@4037: set_local_interfaces(NULL); coleenp@4037: hseigel@5896: if (fields() != NULL && !fields()->is_shared()) { hseigel@5896: MetadataFactory::free_array(loader_data, fields()); hseigel@5896: } coleenp@4037: set_fields(NULL, 0); coleenp@4037: coleenp@4037: // If a method from a redefined class is using this constant pool, don't coleenp@4037: // delete it, yet. The new class's previous version will point to this. coleenp@4719: if (constants() != NULL) { coleenp@4719: assert (!constants()->on_stack(), "shouldn't be called if anything is onstack"); hseigel@5896: if (!constants()->is_shared()) { hseigel@5896: MetadataFactory::free_metadata(loader_data, constants()); hseigel@5896: } coleenp@4719: set_constants(NULL); coleenp@4719: } coleenp@4037: hseigel@5896: if (inner_classes() != NULL && hseigel@5896: inner_classes() != Universe::the_empty_short_array() && hseigel@5896: !inner_classes()->is_shared()) { coleenp@4037: MetadataFactory::free_array(loader_data, inner_classes()); coleenp@4037: } coleenp@4037: set_inner_classes(NULL); coleenp@4037: hseigel@5896: // We should deallocate the Annotations instance if it's not in shared spaces. hseigel@5896: if (annotations() != NULL && !annotations()->is_shared()) { hseigel@5896: MetadataFactory::free_metadata(loader_data, annotations()); hseigel@5896: } coleenp@4037: set_annotations(NULL); coleenp@4037: } coleenp@4037: coleenp@4037: bool InstanceKlass::should_be_initialized() const { duke@435: return !is_initialized(); duke@435: } duke@435: coleenp@4037: klassVtable* InstanceKlass::vtable() const { coleenp@4037: return new klassVtable(this, start_of_vtable(), vtable_length() / vtableEntry::size()); duke@435: } duke@435: coleenp@4037: klassItable* InstanceKlass::itable() const { coleenp@4037: return new klassItable(instanceKlassHandle(this)); duke@435: } duke@435: coleenp@4037: 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) coleenp@4037: Klass* super = this->super(); duke@435: if (super == NULL) return; duke@435: duke@435: // abort if the super class should be initialized coleenp@4037: if (!InstanceKlass::cast(super)->is_initialized()) return; duke@435: duke@435: // call body to expose the this pointer coleenp@4037: instanceKlassHandle this_oop(thread, this); duke@435: eager_initialize_impl(this_oop); duke@435: } duke@435: } duke@435: coleenp@5176: // JVMTI spec thinks there are signers and protection domain in the coleenp@5176: // instanceKlass. These accessors pretend these fields are there. coleenp@5176: // The hprof specification also thinks these fields are in InstanceKlass. coleenp@5176: oop InstanceKlass::protection_domain() const { coleenp@5176: // return the protection_domain from the mirror coleenp@5176: return java_lang_Class::protection_domain(java_mirror()); coleenp@5176: } coleenp@5176: coleenp@5176: // To remove these from requires an incompatible change and CCC request. coleenp@5176: objArrayOop InstanceKlass::signers() const { coleenp@5176: // return the signers from the mirror coleenp@5176: return java_lang_Class::signers(java_mirror()); coleenp@5176: } coleenp@5176: coleenp@5836: oop InstanceKlass::init_lock() const { coleenp@5176: // return the init lock from the mirror iklam@5971: oop lock = java_lang_Class::init_lock(java_mirror()); iklam@5971: assert((oop)lock != NULL || !is_not_initialized(), // initialized or in_error state iklam@5971: "only fully initialized state can have a null lock"); iklam@5971: return lock; iklam@5971: } iklam@5971: iklam@5971: // Set the initialization lock to null so the object can be GC'ed. Any racing iklam@5971: // threads to get this lock will see a null lock and will not lock. iklam@5971: // That's okay because they all check for initialized state after getting iklam@5971: // the lock and return. iklam@5971: void InstanceKlass::fence_and_clear_init_lock() { iklam@5971: // make sure previous stores are all done, notably the init_state. iklam@5971: OrderAccess::storestore(); iklam@5971: java_lang_Class::set_init_lock(java_mirror(), NULL); iklam@5971: assert(!is_not_initialized(), "class must be initialized now"); coleenp@5176: } duke@435: coleenp@4037: void InstanceKlass::eager_initialize_impl(instanceKlassHandle this_oop) { duke@435: EXCEPTION_MARK; coleenp@5836: oop init_lock = this_oop->init_lock(); iklam@5971: ObjectLocker ol(init_lock, THREAD, init_lock != NULL); 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: coleenp@3368: 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); iklam@5971: this_oop->fence_and_clear_init_lock(); 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. coleenp@4037: void InstanceKlass::initialize(TRAPS) { duke@435: if (this->should_be_initialized()) { duke@435: HandleMark hm(THREAD); coleenp@4037: instanceKlassHandle this_oop(THREAD, this); 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: coleenp@4037: 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: coleenp@4037: void InstanceKlass::unlink_class() { duke@435: assert(is_linked(), "must be linked"); duke@435: _init_state = loaded; duke@435: } duke@435: coleenp@4037: void InstanceKlass::link_class(TRAPS) { duke@435: assert(is_loaded(), "must be loaded"); duke@435: if (!is_linked()) { coleenp@4037: HandleMark hm(THREAD); coleenp@4037: instanceKlassHandle this_oop(THREAD, this); 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. coleenp@4037: bool InstanceKlass::link_class_or_fail(TRAPS) { duke@435: assert(is_loaded(), "must be loaded"); duke@435: if (!is_linked()) { coleenp@4037: HandleMark hm(THREAD); coleenp@4037: instanceKlassHandle this_oop(THREAD, this); duke@435: link_class_impl(this_oop, false, CHECK_false); duke@435: } duke@435: return is_linked(); duke@435: } duke@435: coleenp@4037: 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, coleenp@2497: vmSymbols::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 coleenp@4037: Array* interfaces = 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); coleenp@4037: instanceKlassHandle ih(THREAD, interfaces->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: { coleenp@5836: oop init_lock = this_oop->init_lock(); iklam@5971: ObjectLocker ol(init_lock, THREAD, init_lock != NULL); 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 coleenp@4037: 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: coleenp@2945: // relocate jsrs and link methods after they are all rewritten coleenp@4395: this_oop->link_methods(CHECK_false); coleenp@2945: duke@435: // Initialize the vtable and interface table after duke@435: // methods have been rewritten since rewrite may coleenp@4037: // fabricate new Method*s. 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: // The rewriter must be called exactly once. Rewriting must happen after duke@435: // verification but before the first method of the class is executed. coleenp@4037: void InstanceKlass::rewrite_class(TRAPS) { duke@435: assert(is_loaded(), "must be loaded"); coleenp@4037: instanceKlassHandle this_oop(THREAD, this); duke@435: if (this_oop->is_rewritten()) { duke@435: assert(this_oop()->is_shared(), "rewriting an unshared class?"); duke@435: return; duke@435: } coleenp@2945: Rewriter::rewrite(this_oop, CHECK); duke@435: this_oop->set_rewritten(); duke@435: } duke@435: coleenp@2945: // Now relocate and link method entry points after class is rewritten. coleenp@2945: // This is outside is_rewritten flag. In case of an exception, it can be coleenp@2945: // executed more than once. coleenp@4395: void InstanceKlass::link_methods(TRAPS) { coleenp@4395: int len = methods()->length(); coleenp@4395: for (int i = len-1; i >= 0; i--) { coleenp@4395: methodHandle m(THREAD, methods()->at(i)); coleenp@4395: coleenp@4395: // Set up method entry points for compiler and interpreter . coleenp@4395: m->link_method(m, CHECK); coleenp@4395: coleenp@4395: // This is for JVMTI and unrelated to relocator but the last thing we do coleenp@4395: #ifdef ASSERT coleenp@4395: if (StressMethodComparator) { coleenp@4395: ResourceMark rm(THREAD); coleenp@4395: static int nmc = 0; coleenp@4395: for (int j = i; j >= 0 && j >= i-4; j--) { coleenp@4395: if ((++nmc % 1000) == 0) tty->print_cr("Have run MethodComparator %d times...", nmc); coleenp@4395: bool z = MethodComparator::methods_EMCP(m(), coleenp@4395: methods()->at(j)); coleenp@4395: if (j == i && !z) { coleenp@4395: tty->print("MethodComparator FAIL: "); m->print(); m->print_codes(); coleenp@4395: assert(z, "method must compare equal to itself"); coleenp@4395: } coleenp@4395: } coleenp@4395: } coleenp@4395: #endif //ASSERT coleenp@4395: } coleenp@2945: } coleenp@2945: duke@435: coleenp@4037: 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: coleenp@4037: 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 coleenp@4037: { coleenp@5836: oop init_lock = this_oop->init_lock(); iklam@5971: ObjectLocker ol(init_lock, THREAD, init_lock != NULL); 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)) { coleenp@4037: 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()) { coleenp@4037: 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()) { coleenp@4037: 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; kamg@2106: char* message = NEW_RESOURCE_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 coleenp@4037: Klass* super_klass = this_oop->super(); hseigel@4278: if (super_klass != NULL && !this_oop->is_interface() && super_klass->should_be_initialized()) { hseigel@4278: 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: } coleenp@4037: DTRACE_CLASSINIT_PROBE_WAIT(super__failed, InstanceKlass::cast(this_oop()), -1,wait); duke@435: THROW_OOP(e()); duke@435: } duke@435: } duke@435: kamg@4245: if (this_oop->has_default_methods()) { kamg@4245: // Step 7.5: initialize any interfaces which have default methods kamg@4245: for (int i = 0; i < this_oop->local_interfaces()->length(); ++i) { kamg@4245: Klass* iface = this_oop->local_interfaces()->at(i); kamg@4245: InstanceKlass* ik = InstanceKlass::cast(iface); kamg@4245: if (ik->has_default_methods() && ik->should_be_initialized()) { kamg@4245: ik->initialize(THREAD); kamg@4245: kamg@4245: if (HAS_PENDING_EXCEPTION) { kamg@4245: Handle e(THREAD, PENDING_EXCEPTION); kamg@4245: CLEAR_PENDING_EXCEPTION; kamg@4245: { kamg@4245: EXCEPTION_MARK; kamg@4245: // Locks object, set state, and notify all waiting threads kamg@4245: this_oop->set_initialization_state_and_notify( kamg@4245: initialization_error, THREAD); kamg@4245: kamg@4245: // ignore any exception thrown, superclass initialization error is kamg@4245: // thrown below kamg@4245: CLEAR_PENDING_EXCEPTION; kamg@4245: } kamg@4245: DTRACE_CLASSINIT_PROBE_WAIT( kamg@4245: super__failed, InstanceKlass::cast(this_oop()), -1, wait); kamg@4245: THROW_OOP(e()); kamg@4245: } kamg@4245: } kamg@4245: } kamg@4245: } kamg@4245: duke@435: // Step 8 duke@435: { duke@435: assert(THREAD->is_Java_thread(), "non-JavaThread in initialize_impl"); duke@435: JavaThread* jt = (JavaThread*)THREAD; coleenp@4037: 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: } coleenp@4037: 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); coleenp@2497: THROW_ARG(vmSymbols::java_lang_ExceptionInInitializerError(), coleenp@2497: vmSymbols::throwable_void_signature(), duke@435: &args); duke@435: } duke@435: } coleenp@4037: 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. coleenp@4037: void InstanceKlass::set_initialization_state_and_notify(ClassState state, TRAPS) { coleenp@4037: instanceKlassHandle kh(THREAD, this); duke@435: set_initialization_state_and_notify_impl(kh, state, CHECK); duke@435: } duke@435: coleenp@4037: void InstanceKlass::set_initialization_state_and_notify_impl(instanceKlassHandle this_oop, ClassState state, TRAPS) { coleenp@5836: oop init_lock = this_oop->init_lock(); iklam@5971: ObjectLocker ol(init_lock, THREAD, init_lock != NULL); duke@435: this_oop->set_init_state(state); iklam@5971: this_oop->fence_and_clear_init_lock(); duke@435: ol.notify_all(CHECK); duke@435: } duke@435: jiangli@3701: // The embedded _implementor field can only record one implementor. jiangli@3701: // When there are more than one implementors, the _implementor field coleenp@4037: // is set to the interface Klass* itself. Following are the possible jiangli@3701: // values for the _implementor field: jiangli@3701: // NULL - no implementor coleenp@4037: // implementor Klass* - one implementor jiangli@3701: // self - more than one implementor jiangli@3701: // jiangli@3701: // The _implementor field only exists for interfaces. coleenp@4037: void InstanceKlass::add_implementor(Klass* k) { duke@435: assert(Compile_lock->owned_by_self(), ""); jiangli@3701: assert(is_interface(), "not interface"); duke@435: // Filter out my subinterfaces. duke@435: // (Note: Interfaces are never on the subklass list.) coleenp@4037: 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.) coleenp@4037: Klass* sk = InstanceKlass::cast(k)->super(); coleenp@4037: if (sk != NULL && InstanceKlass::cast(sk)->implements_interface(this)) 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: coleenp@4037: Klass* ik = implementor(); jiangli@3701: if (ik == NULL) { jiangli@3701: set_implementor(k); coleenp@4037: } else if (ik != this) { jiangli@3701: // There is already an implementor. Use itself as an indicator of jiangli@3701: // more than one implementors. coleenp@4037: set_implementor(this); duke@435: } duke@435: duke@435: // The implementor also implements the transitive_interfaces duke@435: for (int index = 0; index < local_interfaces()->length(); index++) { coleenp@4037: InstanceKlass::cast(local_interfaces()->at(index))->add_implementor(k); duke@435: } duke@435: } duke@435: coleenp@4037: void InstanceKlass::init_implementor() { jiangli@3701: if (is_interface()) { jiangli@3701: set_implementor(NULL); jiangli@3701: } duke@435: } duke@435: duke@435: coleenp@4037: void InstanceKlass::process_interfaces(Thread *thread) { duke@435: // link this class into the implementors list of every interface it implements coleenp@4037: Klass* this_as_klass_oop = this; duke@435: for (int i = local_interfaces()->length() - 1; i >= 0; i--) { coleenp@4037: assert(local_interfaces()->at(i)->is_klass(), "must be a klass"); coleenp@4037: InstanceKlass* interf = InstanceKlass::cast(local_interfaces()->at(i)); duke@435: assert(interf->is_interface(), "expected interface"); coleenp@4037: interf->add_implementor(this_as_klass_oop); duke@435: } duke@435: } duke@435: coleenp@4037: 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: coleenp@4037: GrowableArray* InstanceKlass::compute_secondary_supers(int num_extra_slots) { duke@435: // The secondaries are the implemented interfaces. coleenp@4037: InstanceKlass* ik = InstanceKlass::cast(this); coleenp@4037: Array* interfaces = ik->transitive_interfaces(); duke@435: int num_secondaries = num_extra_slots + interfaces->length(); duke@435: if (num_secondaries == 0) { coleenp@4037: // Must share this for correct bootstrapping! coleenp@4037: set_secondary_supers(Universe::the_empty_klass_array()); coleenp@4037: return NULL; duke@435: } else if (num_extra_slots == 0) { coleenp@4037: // The secondary super list is exactly the same as the transitive interfaces. coleenp@4037: // Redefine classes has to be careful not to delete this! coleenp@4037: set_secondary_supers(interfaces); coleenp@4037: return NULL; duke@435: } else { coleenp@4037: // Copy transitive interfaces to a temporary growable array to be constructed coleenp@4037: // into the secondary super list with extra slots. coleenp@4037: GrowableArray* secondaries = new GrowableArray(interfaces->length()); duke@435: for (int i = 0; i < interfaces->length(); i++) { coleenp@4037: secondaries->push(interfaces->at(i)); duke@435: } duke@435: return secondaries; duke@435: } duke@435: } duke@435: coleenp@4037: bool InstanceKlass::compute_is_subtype_of(Klass* k) { hseigel@4278: if (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: coleenp@4037: bool InstanceKlass::implements_interface(Klass* k) const { coleenp@4037: if (this == k) return true; hseigel@4278: assert(k->is_interface(), "should be an interface class"); duke@435: for (int i = 0; i < transitive_interfaces()->length(); i++) { coleenp@4037: if (transitive_interfaces()->at(i) == k) { duke@435: return true; duke@435: } duke@435: } duke@435: return false; duke@435: } duke@435: hseigel@6132: bool InstanceKlass::is_same_or_direct_interface(Klass *k) const { hseigel@6132: // Verify direct super interface hseigel@6132: if (this == k) return true; hseigel@6132: assert(k->is_interface(), "should be an interface class"); hseigel@6132: for (int i = 0; i < local_interfaces()->length(); i++) { hseigel@6132: if (local_interfaces()->at(i) == k) { hseigel@6132: return true; hseigel@6132: } hseigel@6132: } hseigel@6132: return false; hseigel@6132: } hseigel@6132: coleenp@4037: 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"); sspitsyn@3638: JvmtiExport::post_array_size_exhausted(); duke@435: THROW_OOP_0(Universe::out_of_memory_error_array_size()); duke@435: } duke@435: int size = objArrayOopDesc::object_size(length); coleenp@4037: Klass* 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: coleenp@4037: 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: coleenp@4037: 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: coleenp@4037: KlassHandle h_k(THREAD, this); 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: coleenp@4037: 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: } coleenp@4037: if (this == 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: coleenp@4037: Klass* InstanceKlass::array_klass_impl(bool or_null, int n, TRAPS) { coleenp@4037: instanceKlassHandle this_oop(THREAD, this); duke@435: return array_klass_impl(this_oop, or_null, n, THREAD); duke@435: } duke@435: coleenp@4037: Klass* 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) { coleenp@4142: Klass* k = ObjArrayKlass::allocate_objArray_klass(this_oop->class_loader_data(), 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 coleenp@4142: ObjArrayKlass* oak = (ObjArrayKlass*)this_oop->array_klasses(); 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: coleenp@4037: Klass* InstanceKlass::array_klass_impl(bool or_null, TRAPS) { duke@435: return array_klass_impl(or_null, 1, THREAD); duke@435: } duke@435: coleenp@4037: void InstanceKlass::call_class_initializer(TRAPS) { coleenp@4037: instanceKlassHandle ik (THREAD, this); 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: coleenp@4037: Method* InstanceKlass::class_initializer() { coleenp@4037: Method* clinit = find_method( kamg@2616: vmSymbols::class_initializer_name(), vmSymbols::void_method_signature()); kamg@2616: if (clinit != NULL && clinit->has_valid_initializer_flags()) { kamg@2616: return clinit; kamg@2616: } kamg@2616: return NULL; duke@435: } duke@435: coleenp@4037: void InstanceKlass::call_class_initializer_impl(instanceKlassHandle this_oop, TRAPS) { minqi@4267: if (ReplayCompiles && minqi@4267: (ReplaySuppressInitializers == 1 || minqi@4267: ReplaySuppressInitializers >= 2 && this_oop->class_loader() != NULL)) { minqi@4267: // Hide the existence of the initializer for the purpose of replaying the compile minqi@4267: return; minqi@4267: } minqi@4267: 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: coleenp@4037: 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) { goetz@6493: // Release stores from OopMapCache constructor before assignment goetz@6493: // to _oop_map_cache. C++ compilers on ppc do not emit the goetz@6493: // required memory barrier only because of the volatile goetz@6493: // qualifier of _oop_map_cache. goetz@6493: OrderAccess::release_store_ptr(&_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: coleenp@4037: bool InstanceKlass::find_local_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const { coleenp@4037: for (JavaFieldStream fs(this); !fs.done(); fs.next()) { never@3137: Symbol* f_name = fs.name(); never@3137: Symbol* f_sig = fs.signature(); duke@435: if (f_name == name && f_sig == sig) { drchase@5732: fd->reinitialize(const_cast(this), fs.index()); duke@435: return true; duke@435: } duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: coleenp@4037: Klass* InstanceKlass::find_interface_field(Symbol* name, Symbol* sig, fieldDescriptor* fd) const { duke@435: const int n = local_interfaces()->length(); duke@435: for (int i = 0; i < n; i++) { coleenp@4037: Klass* intf1 = local_interfaces()->at(i); hseigel@4278: assert(intf1->is_interface(), "just checking type"); duke@435: // search for field in current interface coleenp@4037: 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 coleenp@4037: Klass* 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: coleenp@4037: Klass* InstanceKlass::find_field(Symbol* name, Symbol* 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)) { coleenp@4037: return const_cast(this); duke@435: } duke@435: // 2) search for field recursively in direct superinterfaces coleenp@4037: { Klass* 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 coleenp@4037: { Klass* supr = super(); coleenp@4037: 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: coleenp@4037: Klass* InstanceKlass::find_field(Symbol* name, Symbol* 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)) { coleenp@4037: if (fd->is_static() == is_static) return const_cast(this); duke@435: } duke@435: // 2) search for field recursively in direct superinterfaces duke@435: if (is_static) { coleenp@4037: Klass* 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 coleenp@4037: { Klass* supr = super(); coleenp@4037: 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: coleenp@4037: bool InstanceKlass::find_local_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const { coleenp@4037: for (JavaFieldStream fs(this); !fs.done(); fs.next()) { never@3137: if (fs.offset() == offset) { drchase@5732: fd->reinitialize(const_cast(this), fs.index()); duke@435: if (fd->is_static() == is_static) return true; duke@435: } duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: coleenp@4037: bool InstanceKlass::find_field_from_offset(int offset, bool is_static, fieldDescriptor* fd) const { coleenp@4037: Klass* klass = const_cast(this); duke@435: while (klass != NULL) { coleenp@4037: if (InstanceKlass::cast(klass)->find_local_field_from_offset(offset, is_static, fd)) { duke@435: return true; duke@435: } hseigel@4278: klass = klass->super(); duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: coleenp@4037: void InstanceKlass::methods_do(void f(Method* method)) { duke@435: int len = methods()->length(); duke@435: for (int index = 0; index < len; index++) { coleenp@4037: Method* m = methods()->at(index); duke@435: assert(m->is_method(), "must be method"); duke@435: f(m); duke@435: } duke@435: } duke@435: never@2658: coleenp@4037: void InstanceKlass::do_local_static_fields(FieldClosure* cl) { never@3137: for (JavaFieldStream fs(this); !fs.done(); fs.next()) { never@3137: if (fs.access_flags().is_static()) { drchase@5732: fieldDescriptor& fd = fs.field_descriptor(); never@3137: cl->do_field(&fd); never@3137: } duke@435: } duke@435: } duke@435: duke@435: coleenp@6626: void InstanceKlass::do_local_static_fields(void f(fieldDescriptor*, Handle, TRAPS), Handle mirror, TRAPS) { coleenp@4037: instanceKlassHandle h_this(THREAD, this); coleenp@6626: do_local_static_fields_impl(h_this, f, mirror, CHECK); duke@435: } duke@435: duke@435: coleenp@6626: void InstanceKlass::do_local_static_fields_impl(instanceKlassHandle this_k, coleenp@6626: void f(fieldDescriptor* fd, Handle mirror, TRAPS), Handle mirror, TRAPS) { coleenp@6626: for (JavaFieldStream fs(this_k()); !fs.done(); fs.next()) { never@3137: if (fs.access_flags().is_static()) { drchase@5732: fieldDescriptor& fd = fs.field_descriptor(); coleenp@6626: f(&fd, mirror, CHECK); never@3137: } 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: coleenp@4037: void InstanceKlass::do_nonstatic_fields(FieldClosure* cl) { coleenp@4037: InstanceKlass* super = superklass(); duke@435: if (super != NULL) { duke@435: super->do_nonstatic_fields(cl); duke@435: } kvn@479: fieldDescriptor fd; never@3137: int length = java_fields_count(); kvn@479: // In DebugInfo nonstatic fields are sorted by offset. zgu@3900: int* fields_sorted = NEW_C_HEAP_ARRAY(int, 2*(length+1), mtClass); kvn@479: int j = 0; never@3137: for (int i = 0; i < length; i += 1) { drchase@5732: fd.reinitialize(this, 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) { drchase@5732: fd.reinitialize(this, 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: } zgu@3900: FREE_C_HEAP_ARRAY(int, fields_sorted, mtClass); duke@435: } duke@435: duke@435: coleenp@4037: void InstanceKlass::array_klasses_do(void f(Klass* k, TRAPS), TRAPS) { coleenp@4037: if (array_klasses() != NULL) coleenp@4142: ArrayKlass::cast(array_klasses())->array_klasses_do(f, THREAD); coleenp@4037: } coleenp@4037: coleenp@4037: void InstanceKlass::array_klasses_do(void f(Klass* k)) { duke@435: if (array_klasses() != NULL) coleenp@4142: ArrayKlass::cast(array_klasses())->array_klasses_do(f); duke@435: } duke@435: duke@435: #ifdef ASSERT coleenp@4037: static int linear_search(Array* methods, Symbol* name, Symbol* signature) { duke@435: int len = methods->length(); duke@435: for (int index = 0; index < len; index++) { coleenp@4037: Method* m = methods->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: kamg@4245: static int binary_search(Array* methods, Symbol* name) { 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; coleenp@4037: Method* m = methods->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) { kamg@4245: return mid; duke@435: } else if (res < 0) { duke@435: l = mid + 1; duke@435: } else { duke@435: h = mid - 1; duke@435: } duke@435: } kamg@4245: return -1; kamg@4245: } kamg@4245: acorn@5848: // find_method looks up the name/signature in the local methods array kamg@4245: Method* InstanceKlass::find_method(Symbol* name, Symbol* signature) const { lfoltan@6632: return find_method_impl(name, signature, false); lfoltan@6632: } lfoltan@6632: lfoltan@6632: Method* InstanceKlass::find_method_impl(Symbol* name, Symbol* signature, bool skipping_overpass) const { lfoltan@6632: return InstanceKlass::find_method_impl(methods(), name, signature, skipping_overpass); kamg@4245: } kamg@4245: acorn@6145: // find_instance_method looks up the name/signature in the local methods array acorn@6145: // and skips over static methods acorn@6145: Method* InstanceKlass::find_instance_method( acorn@6145: Array* methods, Symbol* name, Symbol* signature) { acorn@6145: Method* meth = InstanceKlass::find_method(methods, name, signature); acorn@6145: if (meth != NULL && meth->is_static()) { acorn@6145: meth = NULL; acorn@6145: } acorn@6145: return meth; acorn@6145: } acorn@6145: acorn@5848: // find_method looks up the name/signature in the local methods array kamg@4245: Method* InstanceKlass::find_method( kamg@4245: Array* methods, Symbol* name, Symbol* signature) { lfoltan@6632: return InstanceKlass::find_method_impl(methods, name, signature, false); lfoltan@6632: } lfoltan@6632: lfoltan@6632: Method* InstanceKlass::find_method_impl( lfoltan@6632: Array* methods, Symbol* name, Symbol* signature, bool skipping_overpass) { lfoltan@6632: int hit = find_method_index(methods, name, signature, skipping_overpass); acorn@5848: return hit >= 0 ? methods->at(hit): NULL; acorn@5848: } acorn@5848: acorn@5848: // Used directly for default_methods to find the index into the acorn@5848: // default_vtable_indices, and indirectly by find_method acorn@5848: // find_method_index looks in the local methods array to return the index lfoltan@6632: // of the matching name/signature. If, overpass methods are being ignored, lfoltan@6632: // the search continues to find a potential non-overpass match. This capability lfoltan@6632: // is important during method resolution to prefer a static method, for example, lfoltan@6632: // over an overpass method. acorn@5848: int InstanceKlass::find_method_index( lfoltan@6632: Array* methods, Symbol* name, Symbol* signature, bool skipping_overpass) { kamg@4245: int hit = binary_search(methods, name); kamg@4245: if (hit != -1) { kamg@4245: Method* m = methods->at(hit); kamg@4245: // Do linear search to find matching signature. First, quick check lfoltan@6632: // for common case, ignoring overpasses if requested. lfoltan@6632: if ((m->signature() == signature) && (!skipping_overpass || !m->is_overpass())) return hit; lfoltan@6632: kamg@4245: // search downwards through overloaded methods kamg@4245: int i; kamg@4245: for (i = hit - 1; i >= 0; --i) { kamg@4245: Method* m = methods->at(i); kamg@4245: assert(m->is_method(), "must be method"); kamg@4245: if (m->name() != name) break; lfoltan@6632: if ((m->signature() == signature) && (!skipping_overpass || !m->is_overpass())) return i; kamg@4245: } kamg@4245: // search upwards kamg@4245: for (i = hit + 1; i < methods->length(); ++i) { kamg@4245: Method* m = methods->at(i); kamg@4245: assert(m->is_method(), "must be method"); kamg@4245: if (m->name() != name) break; lfoltan@6632: if ((m->signature() == signature) && (!skipping_overpass || !m->is_overpass())) return i; kamg@4245: } kamg@4245: // not found duke@435: #ifdef ASSERT lfoltan@6632: int index = skipping_overpass ? -1 : linear_search(methods, name, signature); kamg@4245: assert(index == -1, err_msg("binary search should have found entry %d", index)); duke@435: #endif kamg@4245: } acorn@5848: return -1; duke@435: } kamg@4245: int InstanceKlass::find_method_by_name(Symbol* name, int* end) { kamg@4245: return find_method_by_name(methods(), name, end); kamg@4245: } kamg@4245: kamg@4245: int InstanceKlass::find_method_by_name( kamg@4245: Array* methods, Symbol* name, int* end_ptr) { kamg@4245: assert(end_ptr != NULL, "just checking"); kamg@4245: int start = binary_search(methods, name); kamg@4245: int end = start + 1; kamg@4245: if (start != -1) { kamg@4245: while (start - 1 >= 0 && (methods->at(start - 1))->name() == name) --start; kamg@4245: while (end < methods->length() && (methods->at(end))->name() == name) ++end; kamg@4245: *end_ptr = end; kamg@4245: return start; kamg@4245: } kamg@4245: return -1; kamg@4245: } kamg@4245: hseigel@6195: // uncached_lookup_method searches both the local class methods array and all hseigel@6195: // superclasses methods arrays, skipping any overpass methods in superclasses. lfoltan@6632: Method* InstanceKlass::uncached_lookup_method(Symbol* name, Symbol* signature, MethodLookupMode mode) const { lfoltan@6632: MethodLookupMode lookup_mode = mode; coleenp@4037: Klass* klass = const_cast(this); duke@435: while (klass != NULL) { lfoltan@6632: Method* method = InstanceKlass::cast(klass)->find_method_impl(name, signature, (lookup_mode == skip_overpass)); lfoltan@6632: if (method != NULL) { hseigel@6195: return method; hseigel@6195: } coleenp@4037: klass = InstanceKlass::cast(klass)->super(); lfoltan@6632: lookup_mode = skip_overpass; // Always ignore overpass methods in superclasses duke@435: } duke@435: return NULL; duke@435: } duke@435: acorn@5848: // lookup a method in the default methods list then in all transitive interfaces acorn@5848: // Do NOT return private or static methods acorn@5848: Method* InstanceKlass::lookup_method_in_ordered_interfaces(Symbol* name, acorn@5848: Symbol* signature) const { acorn@5853: Method* m = NULL; acorn@5848: if (default_methods() != NULL) { acorn@5848: m = find_method(default_methods(), name, signature); acorn@5848: } acorn@5848: // Look up interfaces acorn@5848: if (m == NULL) { lfoltan@6632: m = lookup_method_in_all_interfaces(name, signature, normal); acorn@5848: } acorn@5848: return m; acorn@5848: } acorn@5848: duke@435: // lookup a method in all the interfaces that this class implements acorn@5786: // Do NOT return private or static methods, new in JDK8 which are not externally visible acorn@5786: // They should only be found in the initial InterfaceMethodRef coleenp@4037: Method* InstanceKlass::lookup_method_in_all_interfaces(Symbol* name, hseigel@6195: Symbol* signature, lfoltan@6632: MethodLookupMode mode) const { coleenp@4037: Array* all_ifs = transitive_interfaces(); duke@435: int num_ifs = all_ifs->length(); coleenp@4037: InstanceKlass *ik = NULL; duke@435: for (int i = 0; i < num_ifs; i++) { coleenp@4037: ik = InstanceKlass::cast(all_ifs->at(i)); coleenp@4037: Method* m = ik->lookup_method(name, signature); hseigel@6195: if (m != NULL && m->is_public() && !m->is_static() && lfoltan@6632: ((mode != skip_defaults) || !m->is_default_method())) { 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 */ coleenp@4037: 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 coleenp@4037: probe = new JNIid(this_oop(), 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 */ coleenp@4037: JNIid* InstanceKlass::jni_id_for(int offset) { duke@435: JNIid* probe = jni_ids() == NULL ? NULL : jni_ids()->find(offset); duke@435: if (probe == NULL) { coleenp@4037: probe = jni_id_for_impl(this, offset); duke@435: } duke@435: return probe; duke@435: } duke@435: coleenp@4037: u2 InstanceKlass::enclosing_method_data(int offset) { coleenp@4037: Array* inner_class_list = inner_classes(); jiangli@3670: if (inner_class_list == NULL) { jiangli@3670: return 0; jiangli@3670: } jiangli@3670: int length = inner_class_list->length(); jiangli@3670: if (length % inner_class_next_offset == 0) { jiangli@3670: return 0; jiangli@3670: } else { jiangli@3670: int index = length - enclosing_method_attribute_size; jiangli@3670: assert(offset < enclosing_method_attribute_size, "invalid offset"); coleenp@4037: return inner_class_list->at(index + offset); jiangli@3670: } jiangli@3670: } jiangli@3670: coleenp@4037: void InstanceKlass::set_enclosing_method_indices(u2 class_index, jiangli@3670: u2 method_index) { coleenp@4037: Array* inner_class_list = inner_classes(); jiangli@3670: assert (inner_class_list != NULL, "_inner_classes list is not set up"); jiangli@3670: int length = inner_class_list->length(); jiangli@3670: if (length % inner_class_next_offset == enclosing_method_attribute_size) { jiangli@3670: int index = length - enclosing_method_attribute_size; coleenp@4037: inner_class_list->at_put( jiangli@3670: index + enclosing_method_class_index_offset, class_index); coleenp@4037: inner_class_list->at_put( jiangli@3670: index + enclosing_method_method_index_offset, method_index); jiangli@3670: } jiangli@3670: } 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: // coleenp@4037: 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()); zgu@3900: new_jmeths = NEW_C_HEAP_ARRAY(jmethodID, size+1, mtClass); 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 coleenp@4037: Method* current_method = ik_h->method_with_idnum((int)idnum); duke@435: assert(current_method != NULL, "old and but not obsolete, so should exist"); coleenp@4037: new_id = Method::make_jmethod_id(ik_h->class_loader_data(), current_method); duke@435: } else { duke@435: // It is the current version of the method or an obsolete method, duke@435: // use the version passed in coleenp@4037: new_id = Method::make_jmethod_id(ik_h->class_loader_data(), 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) { coleenp@4037: Method::destroy_jmethod_id(ik_h->class_loader_data(), 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: // coleenp@4037: 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: // coleenp@4037: 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 coleenp@4037: jmethodID InstanceKlass::jmethod_id_or_null(Method* 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: stefank@6992: int nmethodBucket::decrement() { stefank@6992: return Atomic::add(-1, (volatile int *)&_count); stefank@6992: } duke@435: duke@435: // duke@435: // Walk the list of dependent nmethods searching for nmethods which twisti@3050: // are dependent on the changes that were passed in and mark them for duke@435: // deoptimization. Returns the number of nmethods found. duke@435: // coleenp@4037: 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. stefank@6992: if (b->count() > 0 && 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: stefank@6992: void InstanceKlass::clean_dependent_nmethods() { stefank@6992: assert_locked_or_safepoint(CodeCache_lock); stefank@6992: stefank@6992: if (has_unloaded_dependent()) { stefank@6992: nmethodBucket* b = _dependencies; stefank@6992: nmethodBucket* last = NULL; stefank@6992: while (b != NULL) { stefank@6992: assert(b->count() >= 0, err_msg("bucket count: %d", b->count())); stefank@6992: stefank@6992: nmethodBucket* next = b->next(); stefank@6992: stefank@6992: if (b->count() == 0) { stefank@6992: if (last == NULL) { stefank@6992: _dependencies = next; stefank@6992: } else { stefank@6992: last->set_next(next); stefank@6992: } stefank@6992: delete b; stefank@6992: // last stays the same. stefank@6992: } else { stefank@6992: last = b; stefank@6992: } stefank@6992: stefank@6992: b = next; stefank@6992: } stefank@6992: set_has_unloaded_dependent(false); stefank@6992: } stefank@6992: #ifdef ASSERT stefank@6992: else { stefank@6992: // Verification stefank@6992: for (nmethodBucket* b = _dependencies; b != NULL; b = b->next()) { stefank@6992: assert(b->count() >= 0, err_msg("bucket count: %d", b->count())); stefank@6992: assert(b->count() != 0, "empty buckets need to be cleaned"); stefank@6992: } stefank@6992: } stefank@6992: #endif stefank@6992: } 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: // coleenp@4037: 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: // coleenp@4037: 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()) { stefank@6992: int val = b->decrement(); stefank@6992: guarantee(val >= 0, err_msg("Underflow: %d", val)); stefank@6992: if (val == 0) { stefank@6992: set_has_unloaded_dependent(true); 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 coleenp@4037: 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: coleenp@4037: bool InstanceKlass::is_dependent_nmethod(nmethod* nm) { duke@435: nmethodBucket* b = _dependencies; duke@435: while (b != NULL) { duke@435: if (nm == b->get_nmethod()) { stefank@6992: #ifdef ASSERT stefank@6992: int count = b->count(); stefank@6992: assert(count >= 0, "Just check if we ever get here 1"); stefank@6992: assert(count > 0, "Just check if we ever get here 2"); stefank@6992: #endif 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@4037: // Garbage collection coleenp@4037: 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@4037: assert(Universe::heap()->is_in_closed_subset(o), coleenp@4037: err_msg("should be in closed *p " INTPTR_FORMAT " " INTPTR_FORMAT, (address)p, (address)o)); 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_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: coleenp@4037: void InstanceKlass::oop_follow_contents(oop obj) { coleenp@548: assert(obj != NULL, "can't follow the content of NULL object"); coleenp@4037: MarkSweep::follow_klass(obj->klass()); 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: jprovino@4542: #if INCLUDE_ALL_GCS coleenp@4037: void InstanceKlass::oop_follow_contents(ParCompactionManager* cm, duke@435: oop obj) { coleenp@548: assert(obj != NULL, "can't follow the content of NULL object"); coleenp@4037: PSParallelCompact::follow_klass(cm, obj->klass()); coleenp@4037: // Only mark the header and let the scan of the meta-data mark coleenp@4037: // everything else. coleenp@548: InstanceKlass_OOP_MAP_ITERATE( \ coleenp@548: obj, \ coleenp@548: PSParallelCompact::mark_and_push(cm, p), \ coleenp@548: assert_is_in) duke@435: } jprovino@4542: #endif // INCLUDE_ALL_GCS duke@435: coleenp@4037: // closure's do_metadata() method dictates 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: \ coleenp@4037: 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@4037: if_do_metadata_checked(closure, nv_suffix) { \ coleenp@4037: closure->do_klass##nv_suffix(obj->klass()); \ 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: jprovino@4542: #if INCLUDE_ALL_GCS ysr@777: #define InstanceKlass_OOP_OOP_ITERATE_BACKWARDS_DEFN(OopClosureType, nv_suffix) \ ysr@777: \ coleenp@4037: int InstanceKlass::oop_oop_iterate_backwards##nv_suffix(oop obj, \ ysr@777: OopClosureType* closure) { \ ysr@777: SpecializationStats::record_iterate_call##nv_suffix(SpecializationStats::ik); \ stefank@6982: \ stefank@6982: assert_should_ignore_metadata(closure, nv_suffix); \ stefank@6982: \ 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: } jprovino@4542: #endif // INCLUDE_ALL_GCS ysr@777: coleenp@548: #define InstanceKlass_OOP_OOP_ITERATE_DEFN_m(OopClosureType, nv_suffix) \ coleenp@548: \ coleenp@4037: 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@4037: if_do_metadata_checked(closure, nv_suffix) { \ coleenp@4037: if (mr.contains(obj)) { \ coleenp@4037: closure->do_klass##nv_suffix(obj->klass()); \ coleenp@4037: } \ 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) jprovino@4542: #if INCLUDE_ALL_GCS 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) jprovino@4542: #endif // INCLUDE_ALL_GCS duke@435: coleenp@4037: 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: return size; duke@435: } duke@435: jprovino@4542: #if INCLUDE_ALL_GCS coleenp@4037: void InstanceKlass::oop_push_contents(PSPromotionManager* pm, oop obj) { 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: coleenp@4037: int InstanceKlass::oop_update_pointers(ParCompactionManager* cm, oop obj) { coleenp@4037: int size = size_helper(); coleenp@548: InstanceKlass_OOP_MAP_ITERATE( \ coleenp@548: obj, \ coleenp@548: PSParallelCompact::adjust_pointer(p), \ coleenp@4037: assert_is_in) coleenp@4037: return size; duke@435: } duke@435: jprovino@4542: #endif // INCLUDE_ALL_GCS duke@435: coleenp@4037: void InstanceKlass::clean_implementors_list(BoolObjectClosure* is_alive) { stefank@6992: assert(class_loader_data()->is_alive(is_alive), "this klass should be live"); jiangli@3701: if (is_interface()) { jiangli@3701: if (ClassUnloading) { coleenp@4037: Klass* impl = implementor(); jiangli@3701: if (impl != NULL) { coleenp@4037: if (!impl->is_loader_alive(is_alive)) { jiangli@3701: // remove this guy morris@4693: Klass** klass = adr_implementor(); morris@4693: assert(klass != NULL, "null klass"); morris@4693: if (klass != NULL) { morris@4693: *klass = NULL; morris@4693: } jiangli@3701: } duke@435: } duke@435: } duke@435: } duke@435: } duke@435: coleenp@4037: void InstanceKlass::clean_method_data(BoolObjectClosure* is_alive) { coleenp@4037: for (int m = 0; m < methods()->length(); m++) { coleenp@4037: MethodData* mdo = methods()->at(m)->method_data(); coleenp@4037: if (mdo != NULL) { roland@6377: mdo->clean_method_data(is_alive); coleenp@4037: } coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: coleenp@4037: static void remove_unshareable_in_class(Klass* k) { coleenp@4037: // remove klass's unshareable info coleenp@4037: k->remove_unshareable_info(); coleenp@4037: } coleenp@4037: coleenp@4037: void InstanceKlass::remove_unshareable_info() { duke@435: Klass::remove_unshareable_info(); coleenp@4037: // Unlink the class coleenp@4037: if (is_linked()) { coleenp@4037: unlink_class(); coleenp@4037: } duke@435: init_implementor(); coleenp@4037: coleenp@4037: constants()->remove_unshareable_info(); coleenp@4037: coleenp@4037: for (int i = 0; i < methods()->length(); i++) { coleenp@4037: Method* m = methods()->at(i); coleenp@4037: m->remove_unshareable_info(); coleenp@4037: } coleenp@4037: coleenp@4037: // do array classes also. coleenp@4037: array_klasses_do(remove_unshareable_in_class); duke@435: } duke@435: coleenp@4037: void restore_unshareable_in_class(Klass* k, TRAPS) { coleenp@4037: k->restore_unshareable_info(CHECK); coleenp@4037: } coleenp@4037: coleenp@4037: void InstanceKlass::restore_unshareable_info(TRAPS) { coleenp@4037: Klass::restore_unshareable_info(CHECK); coleenp@4037: instanceKlassHandle ik(THREAD, this); coleenp@4037: coleenp@4037: Array* methods = ik->methods(); coleenp@4037: int num_methods = methods->length(); coleenp@4037: for (int index2 = 0; index2 < num_methods; ++index2) { coleenp@4037: methodHandle m(THREAD, methods->at(index2)); coleenp@6626: m->restore_unshareable_info(CHECK); coleenp@4037: } coleenp@4037: if (JvmtiExport::has_redefined_a_class()) { coleenp@4037: // Reinitialize vtable because RedefineClasses may have changed some coleenp@4037: // entries in this vtable for super classes so the CDS vtable might coleenp@4037: // point to old or obsolete entries. RedefineClasses doesn't fix up coleenp@4037: // vtables in the shared system dictionary, only the main one. coleenp@4037: // It also redefines the itable too so fix that too. coleenp@4037: ResourceMark rm(THREAD); coleenp@4037: ik->vtable()->initialize_vtable(false, CHECK); coleenp@4037: ik->itable()->initialize_itable(false, CHECK); coleenp@4037: } coleenp@4037: coleenp@4037: // restore constant pool resolved references coleenp@4037: ik->constants()->restore_unshareable_info(CHECK); coleenp@4037: coleenp@4037: ik->array_klasses_do(restore_unshareable_in_class, CHECK); coleenp@4037: } coleenp@4037: coleenp@4037: static void clear_all_breakpoints(Method* m) { duke@435: m->clear_all_breakpoints(); duke@435: } duke@435: coleenp@4981: coleenp@4981: void InstanceKlass::notify_unload_class(InstanceKlass* ik) { coleenp@4981: // notify the debugger coleenp@4981: if (JvmtiExport::should_post_class_unload()) { coleenp@4981: JvmtiExport::post_class_unload(ik); coleenp@4981: } coleenp@4981: coleenp@4981: // notify ClassLoadingService of class unload coleenp@4981: ClassLoadingService::notify_class_unloaded(ik); coleenp@4981: } coleenp@4981: coleenp@4981: void InstanceKlass::release_C_heap_structures(InstanceKlass* ik) { coleenp@4981: // Clean up C heap coleenp@4981: ik->release_C_heap_structures(); coleenp@4981: ik->constants()->release_C_heap_structures(); coleenp@4981: } coleenp@4981: coleenp@4037: void InstanceKlass::release_C_heap_structures() { coleenp@4981: coleenp@4981: // Can't release the constant pool here because the constant pool can be coleenp@4981: // deallocated separately from the InstanceKlass for default methods and coleenp@4981: // redefine classes. coleenp@4981: 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: sspitsyn@5180: // Deallocate MemberNameTable sspitsyn@5180: { sspitsyn@5180: Mutex* lock_or_null = SafepointSynchronize::is_at_safepoint() ? NULL : MemberNameTable_lock; sspitsyn@5180: MutexLockerEx ml(lock_or_null, Mutex::_no_safepoint_check_flag); sspitsyn@5180: MemberNameTable* mnt = member_names(); sspitsyn@5180: if (mnt != NULL) { sspitsyn@5180: delete mnt; sspitsyn@5180: set_member_names(NULL); sspitsyn@5180: } sspitsyn@4965: } sspitsyn@4965: 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 jiangli@5421: if (_cached_class_file != NULL) { jiangli@5421: os::free(_cached_class_file, mtClass); jiangli@5421: _cached_class_file = NULL; duke@435: } coleenp@2497: coleenp@2497: // Decrement symbol reference counts associated with the unloaded class. coleenp@2497: if (_name != NULL) _name->decrement_refcount(); coleenp@2497: // unreference array name derived from this class name (arrays of an unloaded coleenp@2497: // class can't be referenced anymore). coleenp@2497: if (_array_name != NULL) _array_name->decrement_refcount(); fparain@3906: if (_source_debug_extension != NULL) FREE_C_HEAP_ARRAY(char, _source_debug_extension, mtClass); zgu@4400: zgu@4400: assert(_total_instanceKlass_count >= 1, "Sanity check"); zgu@4400: Atomic::dec(&_total_instanceKlass_count); coleenp@2497: } coleenp@2497: coleenp@4037: void InstanceKlass::set_source_debug_extension(char* array, int length) { fparain@3906: if (array == NULL) { fparain@3906: _source_debug_extension = NULL; fparain@3906: } else { fparain@3906: // Adding one to the attribute length in order to store a null terminator fparain@3906: // character could cause an overflow because the attribute length is fparain@3906: // already coded with an u4 in the classfile, but in practice, it's fparain@3906: // unlikely to happen. fparain@3906: assert((length+1) > length, "Overflow checking"); fparain@3906: char* sde = NEW_C_HEAP_ARRAY(char, (length + 1), mtClass); fparain@3906: for (int i = 0; i < length; i++) { fparain@3906: sde[i] = array[i]; fparain@3906: } fparain@3906: sde[length] = '\0'; fparain@3906: _source_debug_extension = sde; fparain@3906: } duke@435: } duke@435: coleenp@4037: address InstanceKlass::static_field_addr(int offset) { hseigel@5784: return (address)(offset + InstanceMirrorKlass::offset_of_static_fields() + cast_from_oop(java_mirror())); never@2658: } never@2658: never@2658: coleenp@4037: const char* InstanceKlass::signature_name() const { farvidsson@6024: int hash_len = 0; farvidsson@6024: char hash_buf[40]; farvidsson@6024: farvidsson@6024: // If this is an anonymous class, append a hash to make the name unique farvidsson@6024: if (is_anonymous()) { farvidsson@6024: assert(EnableInvokeDynamic, "EnableInvokeDynamic was not set."); farvidsson@6024: intptr_t hash = (java_mirror() != NULL) ? java_mirror()->identity_hash() : 0; farvidsson@6024: sprintf(hash_buf, "/" UINTX_FORMAT, (uintx)hash); farvidsson@6024: hash_len = (int)strlen(hash_buf); farvidsson@6024: } farvidsson@6024: farvidsson@6024: // Get the internal name as a c string duke@435: const char* src = (const char*) (name()->as_C_string()); duke@435: const int src_length = (int)strlen(src); farvidsson@6024: farvidsson@6024: char* dest = NEW_RESOURCE_ARRAY(char, src_length + hash_len + 3); farvidsson@6024: farvidsson@6024: // Add L as type indicator duke@435: int dest_index = 0; duke@435: dest[dest_index++] = 'L'; farvidsson@6024: farvidsson@6024: // Add the actual class name farvidsson@6024: for (int src_index = 0; src_index < src_length; ) { duke@435: dest[dest_index++] = src[src_index++]; duke@435: } farvidsson@6024: farvidsson@6024: // If we have a hash, append it farvidsson@6024: for (int hash_index = 0; hash_index < hash_len; ) { farvidsson@6024: dest[dest_index++] = hash_buf[hash_index++]; farvidsson@6024: } farvidsson@6024: farvidsson@6024: // Add the semicolon and the NULL 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 coleenp@4037: bool InstanceKlass::is_same_class_package(Klass* class2) { coleenp@4037: Klass* class1 = this; coleenp@4037: oop classloader1 = InstanceKlass::cast(class1)->class_loader(); hseigel@4278: Symbol* classname1 = class1->name(); hseigel@4278: hseigel@4278: if (class2->oop_is_objArray()) { coleenp@4142: class2 = ObjArrayKlass::cast(class2)->bottom_klass(); duke@435: } duke@435: oop classloader2; hseigel@4278: if (class2->oop_is_instance()) { coleenp@4037: classloader2 = InstanceKlass::cast(class2)->class_loader(); duke@435: } else { hseigel@4278: assert(class2->oop_is_typeArray(), "should be type array"); duke@435: classloader2 = NULL; duke@435: } hseigel@4278: Symbol* classname2 = class2->name(); duke@435: coleenp@4037: return InstanceKlass::is_same_class_package(classloader1, classname1, duke@435: classloader2, classname2); duke@435: } duke@435: coleenp@4037: bool InstanceKlass::is_same_class_package(oop classloader2, Symbol* classname2) { coleenp@4037: Klass* class1 = this; coleenp@4037: oop classloader1 = InstanceKlass::cast(class1)->class_loader(); hseigel@4278: Symbol* classname1 = class1->name(); duke@435: coleenp@4037: 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 coleenp@4037: bool InstanceKlass::is_same_class_package(oop class_loader1, Symbol* class_name1, coleenp@2497: oop class_loader2, Symbol* 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: coleenp@2497: // The Symbol*'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. coleenp@2497: const jbyte *name1 = class_name1->base(); coleenp@2497: const jbyte *name2 = class_name2->base(); coleenp@2497: coleenp@2497: const jbyte *last_slash1 = UTF8::strrchr(name1, class_name1->utf8_length(), '/'); coleenp@2497: const 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 coleenp@4037: // "this" is InstanceKlass of super_method which must exist coleenp@4037: // note that the InstanceKlass of the method in the targetclassname has not always been created yet coleenp@4037: bool InstanceKlass::is_override(methodHandle super_method, Handle targetclassloader, Symbol* 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"); coleenp@2497: return(is_same_class_package(targetclassloader(), targetclassname)); acorn@1087: } twisti@1040: jrose@1100: /* defined for now in jvm.cpp, for historical reasons *-- coleenp@4037: Klass* InstanceKlass::compute_enclosing_class_impl(instanceKlassHandle self, coleenp@2497: Symbol*& 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) coleenp@4037: bool InstanceKlass::is_same_package_member_impl(instanceKlassHandle class1, coleenp@4037: Klass* class2_oop, TRAPS) { coleenp@4037: if (class2_oop == class1()) return true; hseigel@4278: if (!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; coleenp@4037: Klass* 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; coleenp@4037: Klass* 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: coleenp@4037: jint InstanceKlass::compute_modifier_flags(TRAPS) const { duke@435: jint access = access_flags().as_int(); duke@435: duke@435: // But check if it happens to be member class. coleenp@4037: instanceKlassHandle ik(THREAD, this); jiangli@3670: InnerClassesIterator iter(ik); jiangli@3670: for (; !iter.done(); iter.next()) { jiangli@3670: int ioff = iter.inner_class_info_index(); jiangli@3670: // Inner class attribute can be zero, skip it. jiangli@3670: // Strange but true: JVM spec. allows null inner class refs. jiangli@3670: if (ioff == 0) continue; jiangli@3670: jiangli@3670: // only look at classes that are already loaded jiangli@3670: // since we are looking for the flags for our self. jiangli@3670: Symbol* inner_name = ik->constants()->klass_name_at(ioff); jiangli@3670: if ((ik->name() == inner_name)) { jiangli@3670: // This is really a member class. jiangli@3670: access = iter.inner_access_flags(); jiangli@3670: break; 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: coleenp@4037: 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: coleenp@4037: Method* InstanceKlass::method_at_itable(Klass* 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) { coleenp@4037: THROW_NULL(vmSymbols::java_lang_IncompatibleClassChangeError()); duke@435: } duke@435: coleenp@4037: Klass* ik = ioe->interface_klass(); duke@435: if (ik == holder) break; duke@435: } duke@435: coleenp@4037: itableMethodEntry* ime = ioe->first_method_entry(this); coleenp@4037: Method* m = ime[index].method(); duke@435: if (m == NULL) { coleenp@4037: THROW_NULL(vmSymbols::java_lang_AbstractMethodError()); duke@435: } duke@435: return m; duke@435: } duke@435: acorn@5848: acorn@5848: #if INCLUDE_JVMTI acorn@5848: // update default_methods for redefineclasses for methods that are acorn@5848: // not yet in the vtable due to concurrent subclass define and superinterface acorn@5848: // redefinition acorn@5848: // Note: those in the vtable, should have been updated via adjust_method_entries acorn@5848: void InstanceKlass::adjust_default_methods(Method** old_methods, Method** new_methods, acorn@5848: int methods_length, bool* trace_name_printed) { acorn@5848: // search the default_methods for uses of either obsolete or EMCP methods acorn@5848: if (default_methods() != NULL) { acorn@5848: for (int j = 0; j < methods_length; j++) { acorn@5848: Method* old_method = old_methods[j]; acorn@5848: Method* new_method = new_methods[j]; acorn@5848: acorn@5848: for (int index = 0; index < default_methods()->length(); index ++) { acorn@5848: if (default_methods()->at(index) == old_method) { acorn@5848: default_methods()->at_put(index, new_method); acorn@5848: if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) { acorn@5848: if (!(*trace_name_printed)) { acorn@5848: // RC_TRACE_MESG macro has an embedded ResourceMark acorn@5848: RC_TRACE_MESG(("adjust: klassname=%s default methods from name=%s", acorn@5848: external_name(), acorn@5848: old_method->method_holder()->external_name())); acorn@5848: *trace_name_printed = true; acorn@5848: } acorn@5848: RC_TRACE(0x00100000, ("default method update: %s(%s) ", acorn@5848: new_method->name()->as_C_string(), acorn@5848: new_method->signature()->as_C_string())); acorn@5848: } acorn@5848: } acorn@5848: } acorn@5848: } acorn@5848: } acorn@5848: } acorn@5848: #endif // INCLUDE_JVMTI acorn@5848: duke@435: // On-stack replacement stuff coleenp@4037: 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); iveresov@2138: // Raise the highest osr level if necessary iveresov@2138: if (TieredCompilation) { coleenp@4037: Method* m = n->method(); iveresov@2138: m->set_highest_osr_comp_level(MAX2(m->highest_osr_comp_level(), n->comp_level())); iveresov@2138: } duke@435: // Remember to unlock again duke@435: OsrList_lock->unlock(); iveresov@2138: iveresov@2138: // Get rid of the osr methods for the same bci that have lower levels. iveresov@2138: if (TieredCompilation) { iveresov@2138: for (int l = CompLevel_limited_profile; l < n->comp_level(); l++) { iveresov@2138: nmethod *inv = lookup_osr_nmethod(n->method(), n->osr_entry_bci(), l, true); iveresov@2138: if (inv != NULL && inv->is_in_use()) { iveresov@2138: inv->make_not_entrant(); iveresov@2138: } iveresov@2138: } iveresov@2138: } duke@435: } duke@435: duke@435: coleenp@4037: 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(); iveresov@2138: int max_level = CompLevel_none; // Find the max comp level excluding n coleenp@4037: Method* m = n->method(); duke@435: // Search for match duke@435: while(cur != NULL && cur != n) { neliasso@6718: if (TieredCompilation && m == cur->method()) { iveresov@2138: // Find max level before n iveresov@2138: max_level = MAX2(max_level, cur->comp_level()); iveresov@2138: } duke@435: last = cur; jrose@1424: cur = cur->osr_link(); duke@435: } iveresov@2138: nmethod* next = NULL; duke@435: if (cur == n) { iveresov@2138: next = cur->osr_link(); duke@435: if (last == NULL) { duke@435: // Remove first element iveresov@2138: set_osr_nmethods_head(next); duke@435: } else { iveresov@2138: last->set_osr_link(next); duke@435: } duke@435: } jrose@1424: n->set_osr_link(NULL); iveresov@2138: if (TieredCompilation) { iveresov@2138: cur = next; iveresov@2138: while (cur != NULL) { iveresov@2138: // Find max level after n neliasso@6718: if (m == cur->method()) { neliasso@6718: max_level = MAX2(max_level, cur->comp_level()); neliasso@6718: } iveresov@2138: cur = cur->osr_link(); iveresov@2138: } iveresov@2138: m->set_highest_osr_comp_level(max_level); iveresov@2138: } duke@435: // Remember to unlock again duke@435: OsrList_lock->unlock(); duke@435: } duke@435: minqi@5097: nmethod* InstanceKlass::lookup_osr_nmethod(const Method* m, int bci, int comp_level, bool match_level) 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(); iveresov@2138: nmethod* best = NULL; duke@435: while (osr != NULL) { duke@435: assert(osr->is_osr_method(), "wrong kind of nmethod found in chain"); iveresov@2138: // There can be a time when a c1 osr method exists but we are waiting iveresov@2138: // for a c2 version. When c2 completes its osr nmethod we will trash iveresov@2138: // the c1 version and only be able to find the c2 version. However iveresov@2138: // while we overflow in the c1 code at back branches we don't want to iveresov@2138: // try and switch to the same code as we are already running iveresov@2138: duke@435: if (osr->method() == m && duke@435: (bci == InvocationEntryBci || osr->osr_entry_bci() == bci)) { iveresov@2138: if (match_level) { iveresov@2138: if (osr->comp_level() == comp_level) { iveresov@2138: // Found a match - return it. iveresov@2138: OsrList_lock->unlock(); iveresov@2138: return osr; iveresov@2138: } iveresov@2138: } else { iveresov@2138: if (best == NULL || (osr->comp_level() > best->comp_level())) { iveresov@2138: if (osr->comp_level() == CompLevel_highest_tier) { iveresov@2138: // Found the best possible - return it. iveresov@2138: OsrList_lock->unlock(); iveresov@2138: return osr; iveresov@2138: } iveresov@2138: best = osr; iveresov@2138: } iveresov@2138: } duke@435: } jrose@1424: osr = osr->osr_link(); duke@435: } duke@435: OsrList_lock->unlock(); iveresov@2138: if (best != NULL && best->comp_level() >= comp_level && match_level == false) { iveresov@2138: return best; iveresov@2138: } duke@435: return NULL; duke@435: } duke@435: sspitsyn@5178: void InstanceKlass::add_member_name(int index, Handle mem_name) { sspitsyn@4965: jweak mem_name_wref = JNIHandles::make_weak_global(mem_name); sspitsyn@4965: MutexLocker ml(MemberNameTable_lock); sspitsyn@5178: assert(0 <= index && index < idnum_allocated_count(), "index is out of bounds"); sspitsyn@4965: DEBUG_ONLY(No_Safepoint_Verifier nsv); sspitsyn@4965: sspitsyn@4965: if (_member_names == NULL) { sspitsyn@5178: _member_names = new (ResourceObj::C_HEAP, mtClass) MemberNameTable(idnum_allocated_count()); sspitsyn@4965: } sspitsyn@5178: _member_names->add_member_name(index, mem_name_wref); sspitsyn@5178: } sspitsyn@5178: sspitsyn@5178: oop InstanceKlass::get_member_name(int index) { sspitsyn@5178: MutexLocker ml(MemberNameTable_lock); sspitsyn@5178: assert(0 <= index && index < idnum_allocated_count(), "index is out of bounds"); sspitsyn@5178: DEBUG_ONLY(No_Safepoint_Verifier nsv); sspitsyn@5178: sspitsyn@5178: if (_member_names == NULL) { sspitsyn@5178: return NULL; sspitsyn@5178: } sspitsyn@5178: oop mem_name =_member_names->get_member_name(index); sspitsyn@5178: return mem_name; sspitsyn@4965: } sspitsyn@4965: duke@435: // ----------------------------------------------------------------------------------------------------- coleenp@4037: // Printing coleenp@4037: duke@435: #ifndef PRODUCT duke@435: jrose@1100: #define BULLET " - " jrose@1100: coleenp@4037: static const char* state_names[] = { coleenp@4037: "allocated", "loaded", "linked", "being_initialized", "fully_initialized", "initialization_error" coleenp@4037: }; coleenp@4037: drchase@5732: static void print_vtable(intptr_t* start, int len, outputStream* st) { drchase@5732: for (int i = 0; i < len; i++) { drchase@5732: intptr_t e = start[i]; drchase@5732: st->print("%d : " INTPTR_FORMAT, i, e); drchase@5732: if (e != 0 && ((Metadata*)e)->is_metaspace_object()) { drchase@5732: st->print(" "); drchase@5732: ((Metadata*)e)->print_value_on(st); drchase@5732: } drchase@5732: st->cr(); drchase@5732: } drchase@5732: } drchase@5732: coleenp@4037: void InstanceKlass::print_on(outputStream* st) const { coleenp@4037: assert(is_klass(), "must be klass"); coleenp@4037: Klass::print_on(st); coleenp@4037: coleenp@4037: st->print(BULLET"instance size: %d", size_helper()); st->cr(); coleenp@4037: st->print(BULLET"klass size: %d", size()); st->cr(); coleenp@4037: st->print(BULLET"access: "); access_flags().print_on(st); st->cr(); drchase@6680: st->print(BULLET"state: "); st->print_cr("%s", state_names[_init_state]); coleenp@4037: st->print(BULLET"name: "); name()->print_value_on(st); st->cr(); coleenp@4037: st->print(BULLET"super: "); super()->print_value_on_maybe_null(st); st->cr(); coleenp@4037: st->print(BULLET"sub: "); coleenp@4037: Klass* sub = subklass(); coleenp@4037: int n; coleenp@4037: for (n = 0; sub != NULL; n++, sub = sub->next_sibling()) { coleenp@4037: if (n < MaxSubklassPrintSize) { coleenp@4037: sub->print_value_on(st); coleenp@4037: st->print(" "); coleenp@4037: } coleenp@4037: } coleenp@4037: if (n >= MaxSubklassPrintSize) st->print("(%d more klasses...)", n - MaxSubklassPrintSize); coleenp@4037: st->cr(); coleenp@4037: coleenp@4037: if (is_interface()) { coleenp@4037: st->print_cr(BULLET"nof implementors: %d", nof_implementors()); coleenp@4037: if (nof_implementors() == 1) { coleenp@4037: st->print_cr(BULLET"implementor: "); coleenp@4037: st->print(" "); coleenp@4037: implementor()->print_value_on(st); coleenp@4037: st->cr(); coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: st->print(BULLET"arrays: "); array_klasses()->print_value_on_maybe_null(st); st->cr(); coleenp@4037: st->print(BULLET"methods: "); methods()->print_value_on(st); st->cr(); drchase@5732: if (Verbose || WizardMode) { coleenp@4037: Array* method_array = methods(); acorn@5848: for (int i = 0; i < method_array->length(); i++) { coleenp@4037: st->print("%d : ", i); method_array->at(i)->print_value(); st->cr(); coleenp@4037: } coleenp@4037: } acorn@5848: st->print(BULLET"method ordering: "); method_ordering()->print_value_on(st); st->cr(); acorn@5848: st->print(BULLET"default_methods: "); default_methods()->print_value_on(st); st->cr(); acorn@5848: if (Verbose && default_methods() != NULL) { acorn@5848: Array* method_array = default_methods(); acorn@5848: for (int i = 0; i < method_array->length(); i++) { acorn@5848: st->print("%d : ", i); method_array->at(i)->print_value(); st->cr(); acorn@5848: } acorn@5848: } acorn@5848: if (default_vtable_indices() != NULL) { acorn@5848: st->print(BULLET"default vtable indices: "); default_vtable_indices()->print_value_on(st); st->cr(); acorn@5848: } coleenp@4037: st->print(BULLET"local interfaces: "); local_interfaces()->print_value_on(st); st->cr(); coleenp@4037: st->print(BULLET"trans. interfaces: "); transitive_interfaces()->print_value_on(st); st->cr(); coleenp@4037: st->print(BULLET"constants: "); constants()->print_value_on(st); st->cr(); coleenp@4037: if (class_loader_data() != NULL) { coleenp@4037: st->print(BULLET"class loader data: "); coleenp@4037: class_loader_data()->print_value_on(st); coleenp@4037: st->cr(); coleenp@4037: } coleenp@4037: st->print(BULLET"host class: "); host_klass()->print_value_on_maybe_null(st); st->cr(); coleenp@4037: if (source_file_name() != NULL) { coleenp@4037: st->print(BULLET"source file: "); coleenp@4037: source_file_name()->print_value_on(st); coleenp@4037: st->cr(); coleenp@4037: } coleenp@4037: if (source_debug_extension() != NULL) { coleenp@4037: st->print(BULLET"source debug extension: "); coleenp@4037: st->print("%s", source_debug_extension()); coleenp@4037: st->cr(); coleenp@4037: } coleenp@4572: st->print(BULLET"class annotations: "); class_annotations()->print_value_on(st); st->cr(); coleenp@4572: st->print(BULLET"class type annotations: "); class_type_annotations()->print_value_on(st); st->cr(); coleenp@4572: st->print(BULLET"field annotations: "); fields_annotations()->print_value_on(st); st->cr(); coleenp@4572: st->print(BULLET"field type annotations: "); fields_type_annotations()->print_value_on(st); st->cr(); coleenp@4037: { coleenp@5749: bool have_pv = false; coleenp@5749: PreviousVersionWalker pvw(Thread::current(), (InstanceKlass*)this); coleenp@5749: for (PreviousVersionNode * pv_node = pvw.next_previous_version(); coleenp@5749: pv_node != NULL; pv_node = pvw.next_previous_version()) { coleenp@5749: if (!have_pv) coleenp@5749: st->print(BULLET"previous version: "); coleenp@5749: have_pv = true; coleenp@5749: pv_node->prev_constant_pool()->print_value_on(st); coleenp@5749: } coleenp@5749: if (have_pv) st->cr(); coleenp@5749: } // pvw is cleaned up coleenp@4037: coleenp@4037: if (generic_signature() != NULL) { coleenp@4037: st->print(BULLET"generic signature: "); coleenp@4037: generic_signature()->print_value_on(st); coleenp@4037: st->cr(); coleenp@4037: } coleenp@4037: st->print(BULLET"inner classes: "); inner_classes()->print_value_on(st); st->cr(); coleenp@4037: st->print(BULLET"java mirror: "); java_mirror()->print_value_on(st); st->cr(); coleenp@4037: st->print(BULLET"vtable length %d (start addr: " INTPTR_FORMAT ")", vtable_length(), start_of_vtable()); st->cr(); drchase@5732: if (vtable_length() > 0 && (Verbose || WizardMode)) print_vtable(start_of_vtable(), vtable_length(), st); coleenp@4037: st->print(BULLET"itable length %d (start addr: " INTPTR_FORMAT ")", itable_length(), start_of_itable()); st->cr(); drchase@5732: if (itable_length() > 0 && (Verbose || WizardMode)) print_vtable(start_of_itable(), itable_length(), st); coleenp@4037: st->print_cr(BULLET"---- static fields (%d words):", static_field_size()); coleenp@4037: FieldPrinter print_static_field(st); coleenp@4037: ((InstanceKlass*)this)->do_local_static_fields(&print_static_field); coleenp@4037: st->print_cr(BULLET"---- non-static fields (%d words):", nonstatic_field_size()); coleenp@4037: FieldPrinter print_nonstatic_field(st); coleenp@4037: ((InstanceKlass*)this)->do_nonstatic_fields(&print_nonstatic_field); coleenp@4037: coleenp@4037: st->print(BULLET"non-static oop maps: "); coleenp@4037: OopMapBlock* map = start_of_nonstatic_oop_maps(); coleenp@4037: OopMapBlock* end_map = map + nonstatic_oop_map_count(); coleenp@4037: while (map < end_map) { coleenp@4037: st->print("%d-%d ", map->offset(), map->offset() + heapOopSize*(map->count() - 1)); coleenp@4037: map++; coleenp@4037: } coleenp@4037: st->cr(); coleenp@4037: } coleenp@4037: coleenp@4037: #endif //PRODUCT coleenp@4037: coleenp@4037: void InstanceKlass::print_value_on(outputStream* st) const { coleenp@4037: assert(is_klass(), "must be klass"); drchase@5732: if (Verbose || WizardMode) access_flags().print_on(st); coleenp@4037: name()->print_value_on(st); coleenp@4037: } coleenp@4037: coleenp@4037: #ifndef PRODUCT coleenp@4037: duke@435: void FieldPrinter::do_field(fieldDescriptor* fd) { jrose@1100: _st->print(BULLET); never@2658: if (_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: coleenp@4037: void InstanceKlass::oop_print_on(oop obj, outputStream* st) { duke@435: Klass::oop_print_on(obj, st); duke@435: coleenp@4037: if (this == 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: "); stefank@6975: java_lang_String::print(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)); never@2658: FieldPrinter print_field(st, obj); never@2658: do_nonstatic_fields(&print_field); duke@435: coleenp@4037: if (this == SystemDictionary::Class_klass()) { jrose@1100: st->print(BULLET"signature: "); jrose@1100: java_lang_Class::print_signature(obj, st); jrose@1100: st->cr(); coleenp@4037: Klass* mirrored_klass = java_lang_Class::as_Klass(obj); jrose@1100: st->print(BULLET"fake entry for mirror: "); coleenp@4037: mirrored_klass->print_value_on_maybe_null(st); duke@435: st->cr(); coleenp@4037: Klass* array_klass = java_lang_Class::array_klass(obj); jrose@1100: st->print(BULLET"fake entry for array: "); coleenp@4037: array_klass->print_value_on_maybe_null(st); duke@435: st->cr(); never@2658: st->print_cr(BULLET"fake entry for oop_size: %d", java_lang_Class::oop_size(obj)); never@2658: st->print_cr(BULLET"fake entry for static_oop_field_count: %d", java_lang_Class::static_oop_field_count(obj)); coleenp@4037: Klass* real_klass = java_lang_Class::as_Klass(obj); coleenp@4037: if (real_klass != NULL && real_klass->oop_is_instance()) { coleenp@4037: InstanceKlass::cast(real_klass)->do_local_static_fields(&print_field); never@2658: } coleenp@4037: } else if (this == SystemDictionary::MethodType_klass()) { jrose@1474: st->print(BULLET"signature: "); jrose@2639: java_lang_invoke_MethodType::print_signature(obj, st); jrose@1474: st->cr(); duke@435: } duke@435: } duke@435: jrose@1590: #endif //PRODUCT jrose@1590: coleenp@4037: 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); coleenp@4037: if (this == 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); coleenp@4037: } else if (this == SystemDictionary::Class_klass()) { coleenp@4037: Klass* k = java_lang_Class::as_Klass(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: } coleenp@4037: } else if (this == SystemDictionary::MethodType_klass()) { jrose@1474: st->print(" = "); jrose@2639: java_lang_invoke_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); coleenp@4037: } else if (this == SystemDictionary::LambdaForm_klass()) { twisti@3969: oop vmentry = java_lang_invoke_LambdaForm::vmentry(obj); twisti@3969: if (vmentry != NULL) { twisti@3969: st->print(" => "); twisti@3969: vmentry->print_value_on(st); twisti@3969: } coleenp@4037: } else if (this == SystemDictionary::MemberName_klass()) { coleenp@4037: Metadata* vmtarget = java_lang_invoke_MemberName::vmtarget(obj); twisti@3969: if (vmtarget != NULL) { twisti@3969: st->print(" = "); twisti@3969: vmtarget->print_value_on(st); twisti@3969: } else { twisti@3969: java_lang_invoke_MemberName::clazz(obj)->print_value_on(st); twisti@3969: st->print("."); twisti@3969: java_lang_invoke_MemberName::name(obj)->print_value_on(st); twisti@3969: } jrose@1100: } duke@435: } duke@435: coleenp@4037: const char* InstanceKlass::internal_name() const { duke@435: return external_name(); duke@435: } duke@435: acorn@4497: #if INCLUDE_SERVICES acorn@4497: // Size Statistics acorn@4497: void InstanceKlass::collect_statistics(KlassSizeStats *sz) const { acorn@4497: Klass::collect_statistics(sz); acorn@4497: acorn@4497: sz->_inst_size = HeapWordSize * size_helper(); acorn@4497: sz->_vtab_bytes = HeapWordSize * align_object_offset(vtable_length()); acorn@4497: sz->_itab_bytes = HeapWordSize * align_object_offset(itable_length()); acorn@4497: sz->_nonstatic_oopmap_bytes = HeapWordSize * acorn@4497: ((is_interface() || is_anonymous()) ? acorn@4497: align_object_offset(nonstatic_oop_map_size()) : acorn@4497: nonstatic_oop_map_size()); acorn@4497: acorn@4497: int n = 0; acorn@4497: n += (sz->_methods_array_bytes = sz->count_array(methods())); acorn@4497: n += (sz->_method_ordering_bytes = sz->count_array(method_ordering())); acorn@4497: n += (sz->_local_interfaces_bytes = sz->count_array(local_interfaces())); acorn@4497: n += (sz->_transitive_interfaces_bytes = sz->count_array(transitive_interfaces())); acorn@4497: n += (sz->_fields_bytes = sz->count_array(fields())); acorn@4497: n += (sz->_inner_classes_bytes = sz->count_array(inner_classes())); acorn@4497: sz->_ro_bytes += n; acorn@4497: acorn@4497: const ConstantPool* cp = constants(); acorn@4497: if (cp) { acorn@4497: cp->collect_statistics(sz); acorn@4497: } acorn@4497: acorn@4497: const Annotations* anno = annotations(); acorn@4497: if (anno) { acorn@4497: anno->collect_statistics(sz); acorn@4497: } acorn@4497: acorn@4497: const Array* methods_array = methods(); acorn@4497: if (methods()) { acorn@4497: for (int i = 0; i < methods_array->length(); i++) { acorn@4497: Method* method = methods_array->at(i); acorn@4497: if (method) { acorn@4497: sz->_method_count ++; acorn@4497: method->collect_statistics(sz); acorn@4497: } acorn@4497: } acorn@4497: } acorn@4497: } acorn@4497: #endif // INCLUDE_SERVICES acorn@4497: duke@435: // Verification duke@435: duke@435: class VerifyFieldClosure: public OopClosure { coleenp@548: protected: coleenp@548: template void do_oop_work(T* p) { 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: coleenp@6316: void InstanceKlass::verify_on(outputStream* st) { coleenp@4037: #ifndef PRODUCT coleenp@5307: // Avoid redundant verifies, this really should be in product. coleenp@4037: if (_verify_count == Universe::verify_count()) return; coleenp@4037: _verify_count = Universe::verify_count(); coleenp@4037: #endif coleenp@5307: coleenp@5307: // Verify Klass coleenp@6316: Klass::verify_on(st); coleenp@6316: coleenp@6316: // Verify that klass is present in ClassLoaderData coleenp@6316: guarantee(class_loader_data()->contains_klass(this), coleenp@6316: "this class isn't found in class loader data"); coleenp@4037: coleenp@4037: // Verify vtables coleenp@4037: if (is_linked()) { coleenp@5307: ResourceMark rm; coleenp@4037: // $$$ This used to be done only for m/s collections. Doing it coleenp@4037: // always seemed a valid generalization. (DLD -- 6/00) coleenp@4037: vtable()->verify(st); coleenp@4037: } coleenp@4037: coleenp@4037: // Verify first subklass coleenp@4037: if (subklass_oop() != NULL) { coleenp@4037: guarantee(subklass_oop()->is_klass(), "should be klass"); coleenp@4037: } coleenp@4037: coleenp@4037: // Verify siblings coleenp@4037: Klass* super = this->super(); coleenp@4037: Klass* sib = next_sibling(); coleenp@4037: if (sib != NULL) { coleenp@4037: if (sib == this) { coleenp@4037: fatal(err_msg("subclass points to itself " PTR_FORMAT, sib)); coleenp@4037: } coleenp@4037: coleenp@4037: guarantee(sib->is_klass(), "should be klass"); coleenp@4037: guarantee(sib->super() == super, "siblings should have same superklass"); coleenp@4037: } coleenp@4037: coleenp@4037: // Verify implementor fields coleenp@4037: Klass* im = implementor(); coleenp@4037: if (im != NULL) { coleenp@4037: guarantee(is_interface(), "only interfaces should have implementor set"); coleenp@4037: guarantee(im->is_klass(), "should be klass"); hseigel@4278: guarantee(!im->is_interface() || im == this, coleenp@4037: "implementors cannot be interfaces"); coleenp@4037: } coleenp@4037: coleenp@4037: // Verify local interfaces coleenp@4037: if (local_interfaces()) { coleenp@4037: Array* local_interfaces = this->local_interfaces(); coleenp@4037: for (int j = 0; j < local_interfaces->length(); j++) { coleenp@4037: Klass* e = local_interfaces->at(j); hseigel@4278: guarantee(e->is_klass() && e->is_interface(), "invalid local interface"); coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: // Verify transitive interfaces coleenp@4037: if (transitive_interfaces() != NULL) { coleenp@4037: Array* transitive_interfaces = this->transitive_interfaces(); coleenp@4037: for (int j = 0; j < transitive_interfaces->length(); j++) { coleenp@4037: Klass* e = transitive_interfaces->at(j); hseigel@4278: guarantee(e->is_klass() && e->is_interface(), "invalid transitive interface"); coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: // Verify methods coleenp@4037: if (methods() != NULL) { coleenp@4037: Array* methods = this->methods(); coleenp@4037: for (int j = 0; j < methods->length(); j++) { coleenp@4037: guarantee(methods->at(j)->is_method(), "non-method in methods array"); coleenp@4037: } coleenp@4037: for (int j = 0; j < methods->length() - 1; j++) { coleenp@4037: Method* m1 = methods->at(j); coleenp@4037: Method* m2 = methods->at(j + 1); coleenp@4037: guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly"); coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: // Verify method ordering coleenp@4037: if (method_ordering() != NULL) { coleenp@4037: Array* method_ordering = this->method_ordering(); coleenp@4037: int length = method_ordering->length(); coleenp@4037: if (JvmtiExport::can_maintain_original_method_order() || hseigel@4886: ((UseSharedSpaces || DumpSharedSpaces) && length != 0)) { coleenp@4037: guarantee(length == methods()->length(), "invalid method ordering length"); coleenp@4037: jlong sum = 0; coleenp@4037: for (int j = 0; j < length; j++) { coleenp@4037: int original_index = method_ordering->at(j); coleenp@4037: guarantee(original_index >= 0, "invalid method ordering index"); coleenp@4037: guarantee(original_index < length, "invalid method ordering index"); coleenp@4037: sum += original_index; coleenp@4037: } coleenp@4037: // Verify sum of indices 0,1,...,length-1 coleenp@4037: guarantee(sum == ((jlong)length*(length-1))/2, "invalid method ordering sum"); coleenp@4037: } else { coleenp@4037: guarantee(length == 0, "invalid method ordering length"); coleenp@4037: } coleenp@4037: } coleenp@4037: acorn@5848: // Verify default methods acorn@5848: if (default_methods() != NULL) { acorn@5848: Array* methods = this->default_methods(); acorn@5848: for (int j = 0; j < methods->length(); j++) { acorn@5848: guarantee(methods->at(j)->is_method(), "non-method in methods array"); acorn@5848: } acorn@5848: for (int j = 0; j < methods->length() - 1; j++) { acorn@5848: Method* m1 = methods->at(j); acorn@5848: Method* m2 = methods->at(j + 1); acorn@5848: guarantee(m1->name()->fast_compare(m2->name()) <= 0, "methods not sorted correctly"); acorn@5848: } acorn@5848: } acorn@5848: coleenp@4037: // Verify JNI static field identifiers coleenp@4037: if (jni_ids() != NULL) { coleenp@4037: jni_ids()->verify(this); coleenp@4037: } coleenp@4037: coleenp@4037: // Verify other fields coleenp@4037: if (array_klasses() != NULL) { coleenp@4037: guarantee(array_klasses()->is_klass(), "should be klass"); coleenp@4037: } coleenp@4037: if (constants() != NULL) { coleenp@4037: guarantee(constants()->is_constantPool(), "should be constant pool"); coleenp@4037: } morris@4693: const Klass* host = host_klass(); morris@4693: if (host != NULL) { morris@4693: guarantee(host->is_klass(), "should be klass"); coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: void InstanceKlass::oop_verify_on(oop obj, outputStream* st) { duke@435: Klass::oop_verify_on(obj, st); duke@435: VerifyFieldClosure blk; coleenp@4037: obj->oop_iterate_no_header(&blk); duke@435: } duke@435: coleenp@4037: 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@4037: JNIid::JNIid(Klass* 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::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@4037: void JNIid::verify(Klass* holder) { coleenp@4047: int first_field_offset = InstanceMirrorKlass::offset_of_static_fields(); coleenp@548: int end_field_offset; coleenp@4037: 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@4037: void InstanceKlass::set_init_state(ClassState state) { coleenp@4037: bool good_state = is_shared() ? (_init_state <= state) coleenp@548: : (_init_state < state); coleenp@548: assert(good_state || state == allocated, "illegal state transition"); coleenp@3368: _init_state = (u1)state; coleenp@548: } duke@435: #endif duke@435: duke@435: duke@435: // RedefineClasses() support for previous versions: duke@435: coleenp@4037: // Purge previous versions coleenp@4037: static void purge_previous_versions_internal(InstanceKlass* ik, int emcp_method_count) { coleenp@4037: if (ik->previous_versions() != NULL) { coleenp@4037: // This klass has previous versions so see what we can cleanup coleenp@4037: // while it is safe to do so. coleenp@4037: coleenp@4037: int deleted_count = 0; // leave debugging breadcrumbs coleenp@4037: int live_count = 0; coleenp@4037: ClassLoaderData* loader_data = ik->class_loader_data() == NULL ? coleenp@4037: ClassLoaderData::the_null_class_loader_data() : coleenp@4037: ik->class_loader_data(); coleenp@4037: coleenp@4037: // RC_TRACE macro has an embedded ResourceMark coleenp@4037: RC_TRACE(0x00000200, ("purge: %s: previous version length=%d", coleenp@4037: ik->external_name(), ik->previous_versions()->length())); coleenp@4037: coleenp@4037: for (int i = ik->previous_versions()->length() - 1; i >= 0; i--) { coleenp@4037: // check the previous versions array coleenp@4037: PreviousVersionNode * pv_node = ik->previous_versions()->at(i); coleenp@4037: ConstantPool* cp_ref = pv_node->prev_constant_pool(); coleenp@4037: assert(cp_ref != NULL, "cp ref was unexpectedly cleared"); coleenp@4037: coleenp@4037: ConstantPool* pvcp = cp_ref; coleenp@4037: if (!pvcp->on_stack()) { coleenp@4037: // If the constant pool isn't on stack, none of the methods coleenp@4037: // are executing. Delete all the methods, the constant pool and coleenp@4037: // and this previous version node. coleenp@4037: GrowableArray* method_refs = pv_node->prev_EMCP_methods(); coleenp@4037: if (method_refs != NULL) { coleenp@4037: for (int j = method_refs->length() - 1; j >= 0; j--) { coleenp@4037: Method* method = method_refs->at(j); coleenp@4037: assert(method != NULL, "method ref was unexpectedly cleared"); coleenp@4037: method_refs->remove_at(j); coleenp@4037: // method will be freed with associated class. coleenp@4037: } coleenp@4037: } coleenp@4037: // Remove the constant pool coleenp@4037: delete pv_node; coleenp@4037: // Since we are traversing the array backwards, we don't have to coleenp@4037: // do anything special with the index. coleenp@4037: ik->previous_versions()->remove_at(i); coleenp@4037: deleted_count++; coleenp@4037: continue; coleenp@4037: } else { coleenp@4037: RC_TRACE(0x00000200, ("purge: previous version @%d is alive", i)); coleenp@4037: assert(pvcp->pool_holder() != NULL, "Constant pool with no holder"); coleenp@4037: guarantee (!loader_data->is_unloading(), "unloaded classes can't be on the stack"); coleenp@4037: live_count++; coleenp@4037: } coleenp@4037: coleenp@4037: // At least one method is live in this previous version, clean out coleenp@4037: // the others or mark them as obsolete. coleenp@4037: GrowableArray* method_refs = pv_node->prev_EMCP_methods(); coleenp@4037: if (method_refs != NULL) { coleenp@4037: RC_TRACE(0x00000200, ("purge: previous methods length=%d", coleenp@4037: method_refs->length())); coleenp@4037: for (int j = method_refs->length() - 1; j >= 0; j--) { coleenp@4037: Method* method = method_refs->at(j); coleenp@4037: assert(method != NULL, "method ref was unexpectedly cleared"); coleenp@4037: coleenp@4037: // Remove the emcp method if it's not executing coleenp@4037: // If it's been made obsolete by a redefinition of a non-emcp coleenp@4037: // method, mark it as obsolete but leave it to clean up later. coleenp@4037: if (!method->on_stack()) { coleenp@4037: method_refs->remove_at(j); coleenp@4037: } else if (emcp_method_count == 0) { coleenp@4037: method->set_is_obsolete(); coleenp@4037: } else { coleenp@4037: // RC_TRACE macro has an embedded ResourceMark coleenp@4037: RC_TRACE(0x00000200, coleenp@4037: ("purge: %s(%s): prev method @%d in version @%d is alive", coleenp@4037: method->name()->as_C_string(), coleenp@4037: method->signature()->as_C_string(), j, i)); coleenp@4037: } coleenp@4037: } coleenp@4037: } coleenp@4037: } coleenp@4037: assert(ik->previous_versions()->length() == live_count, "sanity check"); coleenp@4037: RC_TRACE(0x00000200, coleenp@4037: ("purge: previous version stats: live=%d, deleted=%d", live_count, coleenp@4037: deleted_count)); coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: // External interface for use during class unloading. coleenp@4037: void InstanceKlass::purge_previous_versions(InstanceKlass* ik) { coleenp@4037: // Call with >0 emcp methods since they are not currently being redefined. coleenp@4037: purge_previous_versions_internal(ik, 1); coleenp@4037: } coleenp@4037: coleenp@4037: coleenp@4037: // Potentially add an information node that contains pointers to the duke@435: // interesting parts of the previous version of the_class. coleenp@4037: // This is also where we clean out any unused 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: // coleenp@4037: 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. zgu@3900: _previous_versions = new (ResourceObj::C_HEAP, mtClass) duke@435: GrowableArray(2, true); duke@435: } duke@435: coleenp@4037: ConstantPool* cp_ref = ikh->constants(); coleenp@4037: duke@435: // RC_TRACE macro has an embedded ResourceMark coleenp@4037: RC_TRACE(0x00000400, ("adding previous version ref for %s @%d, EMCP_cnt=%d " coleenp@4037: "on_stack=%d", coleenp@4037: ikh->external_name(), _previous_versions->length(), emcp_method_count, coleenp@4037: cp_ref->on_stack())); coleenp@4037: coleenp@4037: // If the constant pool for this previous version of the class coleenp@4037: // is not marked as being on the stack, then none of the methods coleenp@4037: // in this previous version of the class are on the stack so coleenp@4037: // we don't need to create a new PreviousVersionNode. However, coleenp@4037: // we still need to examine older previous versions below. coleenp@4037: Array* old_methods = ikh->methods(); coleenp@4037: coleenp@4037: if (cp_ref->on_stack()) { coleenp@5749: PreviousVersionNode * pv_node = NULL; coleenp@5749: if (emcp_method_count == 0) { coleenp@4037: // non-shared ConstantPool gets a reference coleenp@5749: pv_node = new PreviousVersionNode(cp_ref, NULL); coleenp@5749: RC_TRACE(0x00000400, coleenp@5749: ("add: all methods are obsolete; flushing any EMCP refs")); coleenp@5749: } else { coleenp@5749: int local_count = 0; coleenp@4037: GrowableArray* method_refs = new (ResourceObj::C_HEAP, mtClass) coleenp@5749: GrowableArray(emcp_method_count, true); coleenp@5749: for (int i = 0; i < old_methods->length(); i++) { coleenp@5749: if (emcp_methods->at(i)) { coleenp@5749: // this old method is EMCP. Save it only if it's on the stack coleenp@5749: Method* old_method = old_methods->at(i); coleenp@5749: if (old_method->on_stack()) { coleenp@5749: method_refs->append(old_method); coleenp@5749: } coleenp@5749: if (++local_count >= emcp_method_count) { coleenp@5749: // no more EMCP methods so bail out now coleenp@5749: break; coleenp@4037: } duke@435: } duke@435: } coleenp@4037: // non-shared ConstantPool gets a reference coleenp@5749: pv_node = new PreviousVersionNode(cp_ref, method_refs); coleenp@4037: } coleenp@4037: // append new previous version. coleenp@5749: _previous_versions->append(pv_node); duke@435: } duke@435: coleenp@4037: // Since the caller is the VMThread and we are at a safepoint, this coleenp@4037: // is a good time to clear out unused references. duke@435: duke@435: RC_TRACE(0x00000400, ("add: previous version length=%d", duke@435: _previous_versions->length())); duke@435: coleenp@4037: // Purge previous versions not executing on the stack coleenp@4037: purge_previous_versions_internal(this, emcp_method_count); 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 && coleenp@4037: _previous_versions->length() > 0) { coleenp@4037: // We have a mix of obsolete and EMCP methods so 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 coleenp@4037: Method* old_method = old_methods->at(i); coleenp@2497: Symbol* m_name = old_method->name(); coleenp@2497: Symbol* m_signature = old_method->signature(); duke@435: coleenp@4037: // we might not have added the last entry coleenp@4037: for (int j = _previous_versions->length() - 1; j >= 0; j--) { coleenp@4037: // check the previous versions array for non executing obsolete methods coleenp@4037: PreviousVersionNode * pv_node = _previous_versions->at(j); coleenp@4037: coleenp@4037: 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--) { coleenp@4037: Method* method = method_refs->at(k); coleenp@4037: coleenp@4037: if (!method->is_obsolete() && coleenp@4037: 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 coleenp@4037: // and remove the reference. 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(); coleenp@4037: // Leave obsolete methods on the previous version list to coleenp@4037: // clean up later. 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 coleenp@4037: // method for this generation could have already been deleted, duke@435: // but there still may be an older EMCP method that has not coleenp@4037: // been deleted. 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: coleenp@4037: // Determine if InstanceKlass has a previous version. coleenp@4037: bool InstanceKlass::has_previous_version() const { coleenp@4037: return (_previous_versions != NULL && _previous_versions->length() > 0); duke@435: } // end has_previous_version() duke@435: coleenp@4037: coleenp@4037: Method* InstanceKlass::method_with_idnum(int idnum) { coleenp@4037: Method* m = NULL; duke@435: if (idnum < methods()->length()) { coleenp@4037: m = methods()->at(idnum); duke@435: } duke@435: if (m == NULL || m->method_idnum() != idnum) { duke@435: for (int index = 0; index < methods()->length(); ++index) { coleenp@4037: m = methods()->at(index); duke@435: if (m->method_idnum() == idnum) { duke@435: return m; duke@435: } duke@435: } coleenp@5749: // None found, return null for the caller to handle. coleenp@5749: return NULL; duke@435: } duke@435: return m; duke@435: } duke@435: jiangli@5421: jint InstanceKlass::get_cached_class_file_len() { jiangli@5421: return VM_RedefineClasses::get_cached_class_file_len(_cached_class_file); jiangli@5421: } jiangli@5421: jiangli@5421: unsigned char * InstanceKlass::get_cached_class_file_bytes() { jiangli@5421: return VM_RedefineClasses::get_cached_class_file_bytes(_cached_class_file); jiangli@5421: } jiangli@5421: duke@435: duke@435: // Construct a PreviousVersionNode entry for the array hung off coleenp@4037: // the InstanceKlass. coleenp@4037: PreviousVersionNode::PreviousVersionNode(ConstantPool* prev_constant_pool, coleenp@5749: GrowableArray* prev_EMCP_methods) { duke@435: duke@435: _prev_constant_pool = prev_constant_pool; 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) { coleenp@4037: _prev_constant_pool = NULL; duke@435: } duke@435: duke@435: if (_prev_EMCP_methods != NULL) { duke@435: delete _prev_EMCP_methods; duke@435: } duke@435: } duke@435: duke@435: // Construct a helper for walking the previous versions array coleenp@5749: PreviousVersionWalker::PreviousVersionWalker(Thread* thread, InstanceKlass *ik) { coleenp@5749: _thread = thread; duke@435: _previous_versions = ik->previous_versions(); duke@435: _current_index = 0; duke@435: _current_p = NULL; coleenp@5749: _current_constant_pool_handle = constantPoolHandle(thread, ik->constants()); 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. coleenp@5749: PreviousVersionNode* 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: coleenp@5749: _current_p = NULL; // reset to NULL coleenp@5749: _current_constant_pool_handle = NULL; 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++); coleenp@5749: coleenp@5749: // Save a handle to the constant pool for this previous version, coleenp@5749: // which keeps all the methods from being deallocated. coleenp@5749: _current_constant_pool_handle = constantPoolHandle(_thread, pv_node->prev_constant_pool()); coleenp@5749: _current_p = pv_node; coleenp@5749: return pv_node; duke@435: } duke@435: duke@435: return NULL; duke@435: } // end next_previous_version()