duke@435: /* sspitsyn@7635: * Copyright (c) 2003, 2015, 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" coleenp@4490: #include "classfile/metadataOnStackMark.hpp" stefank@2314: #include "classfile/systemDictionary.hpp" stefank@2314: #include "classfile/verifier.hpp" stefank@2314: #include "code/codeCache.hpp" coleenp@4037: #include "compiler/compileBroker.hpp" stefank@2314: #include "interpreter/oopMapCache.hpp" stefank@2314: #include "interpreter/rewriter.hpp" stefank@2314: #include "memory/gcLocker.hpp" coleenp@4037: #include "memory/metadataFactory.hpp" coleenp@4037: #include "memory/metaspaceShared.hpp" stefank@2314: #include "memory/universe.inline.hpp" never@3137: #include "oops/fieldStreams.hpp" stefank@2314: #include "oops/klassVtable.hpp" stefank@2314: #include "prims/jvmtiImpl.hpp" stefank@2314: #include "prims/jvmtiRedefineClasses.hpp" stefank@2314: #include "prims/methodComparator.hpp" stefank@2314: #include "runtime/deoptimization.hpp" stefank@2314: #include "runtime/relocator.hpp" stefank@2314: #include "utilities/bitMap.inline.hpp" duke@435: drchase@6680: PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC duke@435: coleenp@4037: Array* VM_RedefineClasses::_old_methods = NULL; coleenp@4037: Array* VM_RedefineClasses::_new_methods = NULL; coleenp@4037: Method** VM_RedefineClasses::_matching_old_methods = NULL; coleenp@4037: Method** VM_RedefineClasses::_matching_new_methods = NULL; coleenp@4037: Method** VM_RedefineClasses::_deleted_methods = NULL; coleenp@4037: Method** VM_RedefineClasses::_added_methods = NULL; duke@435: int VM_RedefineClasses::_matching_methods_length = 0; duke@435: int VM_RedefineClasses::_deleted_methods_length = 0; duke@435: int VM_RedefineClasses::_added_methods_length = 0; coleenp@4037: Klass* VM_RedefineClasses::_the_class_oop = NULL; duke@435: duke@435: duke@435: VM_RedefineClasses::VM_RedefineClasses(jint class_count, duke@435: const jvmtiClassDefinition *class_defs, duke@435: JvmtiClassLoadKind class_load_kind) { duke@435: _class_count = class_count; duke@435: _class_defs = class_defs; duke@435: _class_load_kind = class_load_kind; duke@435: _res = JVMTI_ERROR_NONE; duke@435: } duke@435: duke@435: bool VM_RedefineClasses::doit_prologue() { duke@435: if (_class_count == 0) { duke@435: _res = JVMTI_ERROR_NONE; duke@435: return false; duke@435: } duke@435: if (_class_defs == NULL) { duke@435: _res = JVMTI_ERROR_NULL_POINTER; duke@435: return false; duke@435: } duke@435: for (int i = 0; i < _class_count; i++) { duke@435: if (_class_defs[i].klass == NULL) { duke@435: _res = JVMTI_ERROR_INVALID_CLASS; duke@435: return false; duke@435: } duke@435: if (_class_defs[i].class_byte_count == 0) { duke@435: _res = JVMTI_ERROR_INVALID_CLASS_FORMAT; duke@435: return false; duke@435: } duke@435: if (_class_defs[i].class_bytes == NULL) { duke@435: _res = JVMTI_ERROR_NULL_POINTER; duke@435: return false; duke@435: } duke@435: } duke@435: duke@435: // Start timer after all the sanity checks; not quite accurate, but duke@435: // better than adding a bunch of stop() calls. duke@435: RC_TIMER_START(_timer_vm_op_prologue); duke@435: duke@435: // We first load new class versions in the prologue, because somewhere down the duke@435: // call chain it is required that the current thread is a Java thread. duke@435: _res = load_new_class_versions(Thread::current()); duke@435: if (_res != JVMTI_ERROR_NONE) { coleenp@4037: // free any successfully created classes, since none are redefined coleenp@4037: for (int i = 0; i < _class_count; i++) { coleenp@4037: if (_scratch_classes[i] != NULL) { coleenp@4037: ClassLoaderData* cld = _scratch_classes[i]->class_loader_data(); coleenp@4037: // Free the memory for this class at class unloading time. Not before coleenp@4037: // because CMS might think this is still live. coleenp@4037: cld->add_to_deallocate_list((InstanceKlass*)_scratch_classes[i]); coleenp@4037: } coleenp@4037: } duke@435: // Free os::malloc allocated memory in load_new_class_version. duke@435: os::free(_scratch_classes); duke@435: RC_TIMER_STOP(_timer_vm_op_prologue); duke@435: return false; duke@435: } duke@435: duke@435: RC_TIMER_STOP(_timer_vm_op_prologue); duke@435: return true; duke@435: } duke@435: duke@435: void VM_RedefineClasses::doit() { duke@435: Thread *thread = Thread::current(); duke@435: duke@435: if (UseSharedSpaces) { duke@435: // Sharing is enabled so we remap the shared readonly space to duke@435: // shared readwrite, private just in case we need to redefine duke@435: // a shared class. We do the remap during the doit() phase of duke@435: // the safepoint to be safer. coleenp@4037: if (!MetaspaceShared::remap_shared_readonly_as_readwrite()) { duke@435: RC_TRACE_WITH_THREAD(0x00000001, thread, duke@435: ("failed to remap shared readonly space to readwrite, private")); duke@435: _res = JVMTI_ERROR_INTERNAL; duke@435: return; duke@435: } duke@435: } duke@435: coleenp@4037: // Mark methods seen on stack and everywhere else so old methods are not coleenp@4037: // cleaned up if they're on the stack. stefank@7333: MetadataOnStackMark md_on_stack(true); coleenp@4037: HandleMark hm(thread); // make sure any handles created are deleted coleenp@4037: // before the stack walk again. coleenp@4037: duke@435: for (int i = 0; i < _class_count; i++) { duke@435: redefine_single_class(_class_defs[i].klass, _scratch_classes[i], thread); coleenp@4037: ClassLoaderData* cld = _scratch_classes[i]->class_loader_data(); coleenp@4037: // Free the memory for this class at class unloading time. Not before coleenp@4037: // because CMS might think this is still live. coleenp@4037: cld->add_to_deallocate_list((InstanceKlass*)_scratch_classes[i]); coleenp@4037: _scratch_classes[i] = NULL; duke@435: } coleenp@4037: roland@6222: // Disable any dependent concurrent compilations roland@6222: SystemDictionary::notice_modification(); roland@6222: duke@435: // Set flag indicating that some invariants are no longer true. duke@435: // See jvmtiExport.hpp for detailed explanation. duke@435: JvmtiExport::set_has_redefined_a_class(); duke@435: dcubed@4562: // check_class() is optionally called for product bits, but is dcubed@4562: // always called for non-product bits. dcubed@4562: #ifdef PRODUCT dcubed@4562: if (RC_TRACE_ENABLED(0x00004000)) { dcubed@4562: #endif dcubed@4562: RC_TRACE_WITH_THREAD(0x00004000, thread, ("calling check_class")); coleenp@5100: CheckClass check_class(thread); coleenp@5100: ClassLoaderDataGraph::classes_do(&check_class); dcubed@4562: #ifdef PRODUCT dcubed@4562: } duke@435: #endif duke@435: } duke@435: duke@435: void VM_RedefineClasses::doit_epilogue() { duke@435: // Free os::malloc allocated memory. duke@435: os::free(_scratch_classes); duke@435: duke@435: if (RC_TRACE_ENABLED(0x00000004)) { duke@435: // Used to have separate timers for "doit" and "all", but the timer duke@435: // overhead skewed the measurements. duke@435: jlong doit_time = _timer_rsc_phase1.milliseconds() + duke@435: _timer_rsc_phase2.milliseconds(); duke@435: jlong all_time = _timer_vm_op_prologue.milliseconds() + doit_time; duke@435: duke@435: RC_TRACE(0x00000004, ("vm_op: all=" UINT64_FORMAT duke@435: " prologue=" UINT64_FORMAT " doit=" UINT64_FORMAT, all_time, duke@435: _timer_vm_op_prologue.milliseconds(), doit_time)); duke@435: RC_TRACE(0x00000004, duke@435: ("redefine_single_class: phase1=" UINT64_FORMAT " phase2=" UINT64_FORMAT, duke@435: _timer_rsc_phase1.milliseconds(), _timer_rsc_phase2.milliseconds())); duke@435: } duke@435: } duke@435: duke@435: bool VM_RedefineClasses::is_modifiable_class(oop klass_mirror) { duke@435: // classes for primitives cannot be redefined duke@435: if (java_lang_Class::is_primitive(klass_mirror)) { duke@435: return false; duke@435: } coleenp@4037: Klass* the_class_oop = java_lang_Class::as_Klass(klass_mirror); duke@435: // classes for arrays cannot be redefined hseigel@4278: if (the_class_oop == NULL || !the_class_oop->oop_is_instance()) { duke@435: return false; duke@435: } duke@435: return true; duke@435: } duke@435: duke@435: // Append the current entry at scratch_i in scratch_cp to *merge_cp_p duke@435: // where the end of *merge_cp_p is specified by *merge_cp_length_p. For duke@435: // direct CP entries, there is just the current entry to append. For duke@435: // indirect and double-indirect CP entries, there are zero or more duke@435: // referenced CP entries along with the current entry to append. duke@435: // Indirect and double-indirect CP entries are handled by recursive duke@435: // calls to append_entry() as needed. The referenced CP entries are duke@435: // always appended to *merge_cp_p before the referee CP entry. These duke@435: // referenced CP entries may already exist in *merge_cp_p in which case duke@435: // there is nothing extra to append and only the current entry is duke@435: // appended. duke@435: void VM_RedefineClasses::append_entry(constantPoolHandle scratch_cp, duke@435: int scratch_i, constantPoolHandle *merge_cp_p, int *merge_cp_length_p, duke@435: TRAPS) { duke@435: duke@435: // append is different depending on entry tag type duke@435: switch (scratch_cp->tag_at(scratch_i).value()) { duke@435: duke@435: // The old verifier is implemented outside the VM. It loads classes, duke@435: // but does not resolve constant pool entries directly so we never duke@435: // see Class entries here with the old verifier. Similarly the old duke@435: // verifier does not like Class entries in the input constant pool. duke@435: // The split-verifier is implemented in the VM so it can optionally duke@435: // and directly resolve constant pool entries to load classes. The duke@435: // split-verifier can accept either Class entries or UnresolvedClass duke@435: // entries in the input constant pool. We revert the appended copy duke@435: // back to UnresolvedClass so that either verifier will be happy duke@435: // with the constant pool entry. duke@435: case JVM_CONSTANT_Class: duke@435: { duke@435: // revert the copy to JVM_CONSTANT_UnresolvedClass duke@435: (*merge_cp_p)->unresolved_klass_at_put(*merge_cp_length_p, duke@435: scratch_cp->klass_name_at(scratch_i)); duke@435: duke@435: if (scratch_i != *merge_cp_length_p) { duke@435: // The new entry in *merge_cp_p is at a different index than duke@435: // the new entry in scratch_cp so we need to map the index values. duke@435: map_index(scratch_cp, scratch_i, *merge_cp_length_p); duke@435: } duke@435: (*merge_cp_length_p)++; duke@435: } break; duke@435: duke@435: // these are direct CP entries so they can be directly appended, duke@435: // but double and long take two constant pool entries duke@435: case JVM_CONSTANT_Double: // fall through duke@435: case JVM_CONSTANT_Long: duke@435: { coleenp@4037: ConstantPool::copy_entry_to(scratch_cp, scratch_i, *merge_cp_p, *merge_cp_length_p, duke@435: THREAD); duke@435: duke@435: if (scratch_i != *merge_cp_length_p) { duke@435: // The new entry in *merge_cp_p is at a different index than duke@435: // the new entry in scratch_cp so we need to map the index values. duke@435: map_index(scratch_cp, scratch_i, *merge_cp_length_p); duke@435: } duke@435: (*merge_cp_length_p) += 2; duke@435: } break; duke@435: duke@435: // these are direct CP entries so they can be directly appended duke@435: case JVM_CONSTANT_Float: // fall through duke@435: case JVM_CONSTANT_Integer: // fall through duke@435: case JVM_CONSTANT_Utf8: // fall through duke@435: duke@435: // This was an indirect CP entry, but it has been changed into coleenp@4037: // Symbol*s so this entry can be directly appended. duke@435: case JVM_CONSTANT_String: // fall through duke@435: duke@435: // These were indirect CP entries, but they have been changed into coleenp@2497: // Symbol*s so these entries can be directly appended. duke@435: case JVM_CONSTANT_UnresolvedClass: // fall through duke@435: { coleenp@4037: ConstantPool::copy_entry_to(scratch_cp, scratch_i, *merge_cp_p, *merge_cp_length_p, duke@435: THREAD); duke@435: duke@435: if (scratch_i != *merge_cp_length_p) { duke@435: // The new entry in *merge_cp_p is at a different index than duke@435: // the new entry in scratch_cp so we need to map the index values. duke@435: map_index(scratch_cp, scratch_i, *merge_cp_length_p); duke@435: } duke@435: (*merge_cp_length_p)++; duke@435: } break; duke@435: duke@435: // this is an indirect CP entry so it needs special handling duke@435: case JVM_CONSTANT_NameAndType: duke@435: { duke@435: int name_ref_i = scratch_cp->name_ref_index_at(scratch_i); sspitsyn@4504: int new_name_ref_i = find_or_append_indirect_entry(scratch_cp, name_ref_i, merge_cp_p, sspitsyn@4504: merge_cp_length_p, THREAD); duke@435: duke@435: int signature_ref_i = scratch_cp->signature_ref_index_at(scratch_i); sspitsyn@4504: int new_signature_ref_i = find_or_append_indirect_entry(scratch_cp, signature_ref_i, sspitsyn@4504: merge_cp_p, merge_cp_length_p, sspitsyn@4504: THREAD); duke@435: duke@435: // If the referenced entries already exist in *merge_cp_p, then duke@435: // both new_name_ref_i and new_signature_ref_i will both be 0. duke@435: // In that case, all we are appending is the current entry. sspitsyn@4504: if (new_name_ref_i != name_ref_i) { duke@435: RC_TRACE(0x00080000, duke@435: ("NameAndType entry@%d name_ref_index change: %d to %d", duke@435: *merge_cp_length_p, name_ref_i, new_name_ref_i)); duke@435: } sspitsyn@4504: if (new_signature_ref_i != signature_ref_i) { duke@435: RC_TRACE(0x00080000, duke@435: ("NameAndType entry@%d signature_ref_index change: %d to %d", duke@435: *merge_cp_length_p, signature_ref_i, new_signature_ref_i)); duke@435: } duke@435: duke@435: (*merge_cp_p)->name_and_type_at_put(*merge_cp_length_p, duke@435: new_name_ref_i, new_signature_ref_i); duke@435: if (scratch_i != *merge_cp_length_p) { duke@435: // The new entry in *merge_cp_p is at a different index than duke@435: // the new entry in scratch_cp so we need to map the index values. duke@435: map_index(scratch_cp, scratch_i, *merge_cp_length_p); duke@435: } duke@435: (*merge_cp_length_p)++; duke@435: } break; duke@435: duke@435: // this is a double-indirect CP entry so it needs special handling duke@435: case JVM_CONSTANT_Fieldref: // fall through duke@435: case JVM_CONSTANT_InterfaceMethodref: // fall through duke@435: case JVM_CONSTANT_Methodref: duke@435: { duke@435: int klass_ref_i = scratch_cp->uncached_klass_ref_index_at(scratch_i); sspitsyn@4504: int new_klass_ref_i = find_or_append_indirect_entry(scratch_cp, klass_ref_i, sspitsyn@4504: merge_cp_p, merge_cp_length_p, THREAD); sspitsyn@4504: sspitsyn@4504: int name_and_type_ref_i = scratch_cp->uncached_name_and_type_ref_index_at(scratch_i); sspitsyn@4504: int new_name_and_type_ref_i = find_or_append_indirect_entry(scratch_cp, name_and_type_ref_i, sspitsyn@4504: merge_cp_p, merge_cp_length_p, THREAD); duke@435: duke@435: const char *entry_name; duke@435: switch (scratch_cp->tag_at(scratch_i).value()) { duke@435: case JVM_CONSTANT_Fieldref: duke@435: entry_name = "Fieldref"; duke@435: (*merge_cp_p)->field_at_put(*merge_cp_length_p, new_klass_ref_i, duke@435: new_name_and_type_ref_i); duke@435: break; duke@435: case JVM_CONSTANT_InterfaceMethodref: duke@435: entry_name = "IFMethodref"; duke@435: (*merge_cp_p)->interface_method_at_put(*merge_cp_length_p, duke@435: new_klass_ref_i, new_name_and_type_ref_i); duke@435: break; duke@435: case JVM_CONSTANT_Methodref: duke@435: entry_name = "Methodref"; duke@435: (*merge_cp_p)->method_at_put(*merge_cp_length_p, new_klass_ref_i, duke@435: new_name_and_type_ref_i); duke@435: break; duke@435: default: duke@435: guarantee(false, "bad switch"); duke@435: break; duke@435: } duke@435: duke@435: if (klass_ref_i != new_klass_ref_i) { duke@435: RC_TRACE(0x00080000, ("%s entry@%d class_index changed: %d to %d", duke@435: entry_name, *merge_cp_length_p, klass_ref_i, new_klass_ref_i)); duke@435: } duke@435: if (name_and_type_ref_i != new_name_and_type_ref_i) { duke@435: RC_TRACE(0x00080000, duke@435: ("%s entry@%d name_and_type_index changed: %d to %d", duke@435: entry_name, *merge_cp_length_p, name_and_type_ref_i, duke@435: new_name_and_type_ref_i)); duke@435: } duke@435: duke@435: if (scratch_i != *merge_cp_length_p) { duke@435: // The new entry in *merge_cp_p is at a different index than duke@435: // the new entry in scratch_cp so we need to map the index values. duke@435: map_index(scratch_cp, scratch_i, *merge_cp_length_p); duke@435: } duke@435: (*merge_cp_length_p)++; duke@435: } break; duke@435: sspitsyn@4504: // this is an indirect CP entry so it needs special handling sspitsyn@4504: case JVM_CONSTANT_MethodType: sspitsyn@4504: { sspitsyn@4504: int ref_i = scratch_cp->method_type_index_at(scratch_i); sspitsyn@4504: int new_ref_i = find_or_append_indirect_entry(scratch_cp, ref_i, merge_cp_p, sspitsyn@4504: merge_cp_length_p, THREAD); sspitsyn@4504: if (new_ref_i != ref_i) { sspitsyn@4504: RC_TRACE(0x00080000, sspitsyn@4504: ("MethodType entry@%d ref_index change: %d to %d", sspitsyn@4504: *merge_cp_length_p, ref_i, new_ref_i)); sspitsyn@4504: } sspitsyn@4504: (*merge_cp_p)->method_type_index_at_put(*merge_cp_length_p, new_ref_i); sspitsyn@4504: if (scratch_i != *merge_cp_length_p) { sspitsyn@4504: // The new entry in *merge_cp_p is at a different index than sspitsyn@4504: // the new entry in scratch_cp so we need to map the index values. sspitsyn@4504: map_index(scratch_cp, scratch_i, *merge_cp_length_p); sspitsyn@4504: } sspitsyn@4504: (*merge_cp_length_p)++; sspitsyn@4504: } break; sspitsyn@4504: sspitsyn@4504: // this is an indirect CP entry so it needs special handling sspitsyn@4504: case JVM_CONSTANT_MethodHandle: sspitsyn@4504: { sspitsyn@4504: int ref_kind = scratch_cp->method_handle_ref_kind_at(scratch_i); sspitsyn@4504: int ref_i = scratch_cp->method_handle_index_at(scratch_i); sspitsyn@4504: int new_ref_i = find_or_append_indirect_entry(scratch_cp, ref_i, merge_cp_p, sspitsyn@4504: merge_cp_length_p, THREAD); sspitsyn@4504: if (new_ref_i != ref_i) { sspitsyn@4504: RC_TRACE(0x00080000, sspitsyn@4504: ("MethodHandle entry@%d ref_index change: %d to %d", sspitsyn@4504: *merge_cp_length_p, ref_i, new_ref_i)); sspitsyn@4504: } sspitsyn@4504: (*merge_cp_p)->method_handle_index_at_put(*merge_cp_length_p, ref_kind, new_ref_i); sspitsyn@4504: if (scratch_i != *merge_cp_length_p) { sspitsyn@4504: // The new entry in *merge_cp_p is at a different index than sspitsyn@4504: // the new entry in scratch_cp so we need to map the index values. sspitsyn@4504: map_index(scratch_cp, scratch_i, *merge_cp_length_p); sspitsyn@4504: } sspitsyn@4504: (*merge_cp_length_p)++; sspitsyn@4504: } break; sspitsyn@4504: sspitsyn@4504: // this is an indirect CP entry so it needs special handling sspitsyn@4504: case JVM_CONSTANT_InvokeDynamic: sspitsyn@4504: { sspitsyn@4983: // Index of the bootstrap specifier in the operands array sspitsyn@4983: int old_bs_i = scratch_cp->invoke_dynamic_bootstrap_specifier_index(scratch_i); sspitsyn@4983: int new_bs_i = find_or_append_operand(scratch_cp, old_bs_i, merge_cp_p, sspitsyn@4983: merge_cp_length_p, THREAD); sspitsyn@4983: // The bootstrap method NameAndType_info index sspitsyn@4983: int old_ref_i = scratch_cp->invoke_dynamic_name_and_type_ref_index_at(scratch_i); sspitsyn@4983: int new_ref_i = find_or_append_indirect_entry(scratch_cp, old_ref_i, merge_cp_p, sspitsyn@4504: merge_cp_length_p, THREAD); sspitsyn@4983: if (new_bs_i != old_bs_i) { sspitsyn@4504: RC_TRACE(0x00080000, sspitsyn@4983: ("InvokeDynamic entry@%d bootstrap_method_attr_index change: %d to %d", sspitsyn@4983: *merge_cp_length_p, old_bs_i, new_bs_i)); sspitsyn@4504: } sspitsyn@4983: if (new_ref_i != old_ref_i) { sspitsyn@4983: RC_TRACE(0x00080000, sspitsyn@4983: ("InvokeDynamic entry@%d name_and_type_index change: %d to %d", sspitsyn@4983: *merge_cp_length_p, old_ref_i, new_ref_i)); sspitsyn@4983: } sspitsyn@4983: sspitsyn@4983: (*merge_cp_p)->invoke_dynamic_at_put(*merge_cp_length_p, new_bs_i, new_ref_i); sspitsyn@4504: if (scratch_i != *merge_cp_length_p) { sspitsyn@4504: // The new entry in *merge_cp_p is at a different index than sspitsyn@4504: // the new entry in scratch_cp so we need to map the index values. sspitsyn@4504: map_index(scratch_cp, scratch_i, *merge_cp_length_p); sspitsyn@4504: } sspitsyn@4504: (*merge_cp_length_p)++; sspitsyn@4504: } break; sspitsyn@4504: duke@435: // At this stage, Class or UnresolvedClass could be here, but not duke@435: // ClassIndex duke@435: case JVM_CONSTANT_ClassIndex: // fall through duke@435: duke@435: // Invalid is used as the tag for the second constant pool entry duke@435: // occupied by JVM_CONSTANT_Double or JVM_CONSTANT_Long. It should duke@435: // not be seen by itself. duke@435: case JVM_CONSTANT_Invalid: // fall through duke@435: coleenp@4037: // At this stage, String could be here, but not StringIndex duke@435: case JVM_CONSTANT_StringIndex: // fall through duke@435: duke@435: // At this stage JVM_CONSTANT_UnresolvedClassInError should not be duke@435: // here duke@435: case JVM_CONSTANT_UnresolvedClassInError: // fall through duke@435: duke@435: default: duke@435: { duke@435: // leave a breadcrumb duke@435: jbyte bad_value = scratch_cp->tag_at(scratch_i).value(); duke@435: ShouldNotReachHere(); duke@435: } break; duke@435: } // end switch tag value duke@435: } // end append_entry() duke@435: duke@435: sspitsyn@4504: int VM_RedefineClasses::find_or_append_indirect_entry(constantPoolHandle scratch_cp, sspitsyn@4504: int ref_i, constantPoolHandle *merge_cp_p, int *merge_cp_length_p, TRAPS) { sspitsyn@4504: sspitsyn@4504: int new_ref_i = ref_i; sspitsyn@4504: bool match = (ref_i < *merge_cp_length_p) && sspitsyn@4504: scratch_cp->compare_entry_to(ref_i, *merge_cp_p, ref_i, THREAD); sspitsyn@4504: sspitsyn@4504: if (!match) { sspitsyn@4504: // forward reference in *merge_cp_p or not a direct match sspitsyn@4504: int found_i = scratch_cp->find_matching_entry(ref_i, *merge_cp_p, THREAD); sspitsyn@4504: if (found_i != 0) { sspitsyn@4504: guarantee(found_i != ref_i, "compare_entry_to() and find_matching_entry() do not agree"); sspitsyn@4504: // Found a matching entry somewhere else in *merge_cp_p so just need a mapping entry. sspitsyn@4504: new_ref_i = found_i; sspitsyn@4504: map_index(scratch_cp, ref_i, found_i); sspitsyn@4504: } else { sspitsyn@4504: // no match found so we have to append this entry to *merge_cp_p sspitsyn@4504: append_entry(scratch_cp, ref_i, merge_cp_p, merge_cp_length_p, THREAD); sspitsyn@4504: // The above call to append_entry() can only append one entry sspitsyn@4504: // so the post call query of *merge_cp_length_p is only for sspitsyn@4504: // the sake of consistency. sspitsyn@4504: new_ref_i = *merge_cp_length_p - 1; sspitsyn@4504: } sspitsyn@4504: } sspitsyn@4504: sspitsyn@4504: return new_ref_i; sspitsyn@4504: } // end find_or_append_indirect_entry() sspitsyn@4504: sspitsyn@4504: sspitsyn@4983: // Append a bootstrap specifier into the merge_cp operands that is semantically equal sspitsyn@4983: // to the scratch_cp operands bootstrap specifier passed by the old_bs_i index. sspitsyn@4983: // Recursively append new merge_cp entries referenced by the new bootstrap specifier. sspitsyn@4983: void VM_RedefineClasses::append_operand(constantPoolHandle scratch_cp, int old_bs_i, sspitsyn@4983: constantPoolHandle *merge_cp_p, int *merge_cp_length_p, TRAPS) { sspitsyn@4983: sspitsyn@4983: int old_ref_i = scratch_cp->operand_bootstrap_method_ref_index_at(old_bs_i); sspitsyn@4983: int new_ref_i = find_or_append_indirect_entry(scratch_cp, old_ref_i, merge_cp_p, sspitsyn@4983: merge_cp_length_p, THREAD); sspitsyn@4983: if (new_ref_i != old_ref_i) { sspitsyn@4983: RC_TRACE(0x00080000, sspitsyn@4983: ("operands entry@%d bootstrap method ref_index change: %d to %d", sspitsyn@4983: _operands_cur_length, old_ref_i, new_ref_i)); sspitsyn@4983: } sspitsyn@4983: sspitsyn@4983: Array* merge_ops = (*merge_cp_p)->operands(); sspitsyn@4983: int new_bs_i = _operands_cur_length; sspitsyn@4983: // We have _operands_cur_length == 0 when the merge_cp operands is empty yet. sspitsyn@4983: // However, the operand_offset_at(0) was set in the extend_operands() call. sspitsyn@4983: int new_base = (new_bs_i == 0) ? (*merge_cp_p)->operand_offset_at(0) sspitsyn@4983: : (*merge_cp_p)->operand_next_offset_at(new_bs_i - 1); sspitsyn@4983: int argc = scratch_cp->operand_argument_count_at(old_bs_i); sspitsyn@4983: sspitsyn@4983: ConstantPool::operand_offset_at_put(merge_ops, _operands_cur_length, new_base); sspitsyn@4983: merge_ops->at_put(new_base++, new_ref_i); sspitsyn@4983: merge_ops->at_put(new_base++, argc); sspitsyn@4983: sspitsyn@4983: for (int i = 0; i < argc; i++) { sspitsyn@4983: int old_arg_ref_i = scratch_cp->operand_argument_index_at(old_bs_i, i); sspitsyn@4983: int new_arg_ref_i = find_or_append_indirect_entry(scratch_cp, old_arg_ref_i, merge_cp_p, sspitsyn@4983: merge_cp_length_p, THREAD); sspitsyn@4983: merge_ops->at_put(new_base++, new_arg_ref_i); sspitsyn@4983: if (new_arg_ref_i != old_arg_ref_i) { sspitsyn@4983: RC_TRACE(0x00080000, sspitsyn@4983: ("operands entry@%d bootstrap method argument ref_index change: %d to %d", sspitsyn@4983: _operands_cur_length, old_arg_ref_i, new_arg_ref_i)); sspitsyn@4983: } sspitsyn@4983: } sspitsyn@4983: if (old_bs_i != _operands_cur_length) { sspitsyn@4983: // The bootstrap specifier in *merge_cp_p is at a different index than sspitsyn@4983: // that in scratch_cp so we need to map the index values. sspitsyn@4983: map_operand_index(old_bs_i, new_bs_i); sspitsyn@4983: } sspitsyn@4983: _operands_cur_length++; sspitsyn@4983: } // end append_operand() sspitsyn@4983: sspitsyn@4983: sspitsyn@4983: int VM_RedefineClasses::find_or_append_operand(constantPoolHandle scratch_cp, sspitsyn@4983: int old_bs_i, constantPoolHandle *merge_cp_p, int *merge_cp_length_p, TRAPS) { sspitsyn@4983: sspitsyn@4983: int new_bs_i = old_bs_i; // bootstrap specifier index sspitsyn@4983: bool match = (old_bs_i < _operands_cur_length) && sspitsyn@4983: scratch_cp->compare_operand_to(old_bs_i, *merge_cp_p, old_bs_i, THREAD); sspitsyn@4983: sspitsyn@4983: if (!match) { sspitsyn@4983: // forward reference in *merge_cp_p or not a direct match sspitsyn@4983: int found_i = scratch_cp->find_matching_operand(old_bs_i, *merge_cp_p, sspitsyn@4983: _operands_cur_length, THREAD); sspitsyn@4983: if (found_i != -1) { sspitsyn@4983: guarantee(found_i != old_bs_i, "compare_operand_to() and find_matching_operand() disagree"); sspitsyn@4983: // found a matching operand somewhere else in *merge_cp_p so just need a mapping sspitsyn@4983: new_bs_i = found_i; sspitsyn@4983: map_operand_index(old_bs_i, found_i); sspitsyn@4983: } else { sspitsyn@4983: // no match found so we have to append this bootstrap specifier to *merge_cp_p sspitsyn@4983: append_operand(scratch_cp, old_bs_i, merge_cp_p, merge_cp_length_p, THREAD); sspitsyn@4983: new_bs_i = _operands_cur_length - 1; sspitsyn@4983: } sspitsyn@4983: } sspitsyn@4983: return new_bs_i; sspitsyn@4983: } // end find_or_append_operand() sspitsyn@4983: sspitsyn@4983: sspitsyn@4983: void VM_RedefineClasses::finalize_operands_merge(constantPoolHandle merge_cp, TRAPS) { sspitsyn@4983: if (merge_cp->operands() == NULL) { sspitsyn@4983: return; sspitsyn@4983: } sspitsyn@4983: // Shrink the merge_cp operands sspitsyn@4983: merge_cp->shrink_operands(_operands_cur_length, CHECK); sspitsyn@4983: sspitsyn@4983: if (RC_TRACE_ENABLED(0x00040000)) { sspitsyn@4983: // don't want to loop unless we are tracing sspitsyn@4983: int count = 0; sspitsyn@4983: for (int i = 1; i < _operands_index_map_p->length(); i++) { sspitsyn@4983: int value = _operands_index_map_p->at(i); sspitsyn@4983: if (value != -1) { sspitsyn@4983: RC_TRACE_WITH_THREAD(0x00040000, THREAD, sspitsyn@4983: ("operands_index_map[%d]: old=%d new=%d", count, i, value)); sspitsyn@4983: count++; sspitsyn@4983: } sspitsyn@4983: } sspitsyn@4983: } sspitsyn@4983: // Clean-up sspitsyn@4983: _operands_index_map_p = NULL; sspitsyn@4983: _operands_cur_length = 0; sspitsyn@4983: _operands_index_map_count = 0; sspitsyn@4983: } // end finalize_operands_merge() sspitsyn@4983: sspitsyn@4983: duke@435: jvmtiError VM_RedefineClasses::compare_and_normalize_class_versions( duke@435: instanceKlassHandle the_class, duke@435: instanceKlassHandle scratch_class) { duke@435: int i; duke@435: duke@435: // Check superclasses, or rather their names, since superclasses themselves can be duke@435: // requested to replace. duke@435: // Check for NULL superclass first since this might be java.lang.Object duke@435: if (the_class->super() != scratch_class->super() && duke@435: (the_class->super() == NULL || scratch_class->super() == NULL || hseigel@4278: the_class->super()->name() != hseigel@4278: scratch_class->super()->name())) { duke@435: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_HIERARCHY_CHANGED; duke@435: } duke@435: duke@435: // Check if the number, names and order of directly implemented interfaces are the same. duke@435: // I think in principle we should just check if the sets of names of directly implemented duke@435: // interfaces are the same, i.e. the order of declaration (which, however, if changed in the duke@435: // .java file, also changes in .class file) should not matter. However, comparing sets is duke@435: // technically a bit more difficult, and, more importantly, I am not sure at present that the duke@435: // order of interfaces does not matter on the implementation level, i.e. that the VM does not duke@435: // rely on it somewhere. coleenp@4037: Array* k_interfaces = the_class->local_interfaces(); coleenp@4037: Array* k_new_interfaces = scratch_class->local_interfaces(); duke@435: int n_intfs = k_interfaces->length(); duke@435: if (n_intfs != k_new_interfaces->length()) { duke@435: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_HIERARCHY_CHANGED; duke@435: } duke@435: for (i = 0; i < n_intfs; i++) { hseigel@4278: if (k_interfaces->at(i)->name() != hseigel@4278: k_new_interfaces->at(i)->name()) { duke@435: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_HIERARCHY_CHANGED; duke@435: } duke@435: } duke@435: duke@435: // Check whether class is in the error init state. duke@435: if (the_class->is_in_error_state()) { duke@435: // TBD #5057930: special error code is needed in 1.6 duke@435: return JVMTI_ERROR_INVALID_CLASS; duke@435: } duke@435: duke@435: // Check whether class modifiers are the same. duke@435: jushort old_flags = (jushort) the_class->access_flags().get_flags(); duke@435: jushort new_flags = (jushort) scratch_class->access_flags().get_flags(); duke@435: if (old_flags != new_flags) { duke@435: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_CLASS_MODIFIERS_CHANGED; duke@435: } duke@435: duke@435: // Check if the number, names, types and order of fields declared in these classes duke@435: // are the same. never@3137: JavaFieldStream old_fs(the_class); never@3137: JavaFieldStream new_fs(scratch_class); never@3137: for (; !old_fs.done() && !new_fs.done(); old_fs.next(), new_fs.next()) { duke@435: // access never@3137: old_flags = old_fs.access_flags().as_short(); never@3137: new_flags = new_fs.access_flags().as_short(); duke@435: if ((old_flags ^ new_flags) & JVM_RECOGNIZED_FIELD_MODIFIERS) { duke@435: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_SCHEMA_CHANGED; duke@435: } duke@435: // offset never@3137: if (old_fs.offset() != new_fs.offset()) { duke@435: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_SCHEMA_CHANGED; duke@435: } duke@435: // name and signature never@3137: Symbol* name_sym1 = the_class->constants()->symbol_at(old_fs.name_index()); never@3137: Symbol* sig_sym1 = the_class->constants()->symbol_at(old_fs.signature_index()); never@3137: Symbol* name_sym2 = scratch_class->constants()->symbol_at(new_fs.name_index()); never@3137: Symbol* sig_sym2 = scratch_class->constants()->symbol_at(new_fs.signature_index()); duke@435: if (name_sym1 != name_sym2 || sig_sym1 != sig_sym2) { duke@435: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_SCHEMA_CHANGED; duke@435: } duke@435: } duke@435: never@3137: // If both streams aren't done then we have a differing number of never@3137: // fields. never@3137: if (!old_fs.done() || !new_fs.done()) { never@3137: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_SCHEMA_CHANGED; never@3137: } never@3137: duke@435: // Do a parallel walk through the old and new methods. Detect duke@435: // cases where they match (exist in both), have been added in duke@435: // the new methods, or have been deleted (exist only in the duke@435: // old methods). The class file parser places methods in order duke@435: // by method name, but does not order overloaded methods by duke@435: // signature. In order to determine what fate befell the methods, duke@435: // this code places the overloaded new methods that have matching duke@435: // old methods in the same order as the old methods and places duke@435: // new overloaded methods at the end of overloaded methods of duke@435: // that name. The code for this order normalization is adapted coleenp@4037: // from the algorithm used in InstanceKlass::find_method(). duke@435: // Since we are swapping out of order entries as we find them, duke@435: // we only have to search forward through the overloaded methods. duke@435: // Methods which are added and have the same name as an existing duke@435: // method (but different signature) will be put at the end of duke@435: // the methods with that name, and the name mismatch code will duke@435: // handle them. coleenp@4037: Array* k_old_methods(the_class->methods()); coleenp@4037: Array* k_new_methods(scratch_class->methods()); duke@435: int n_old_methods = k_old_methods->length(); duke@435: int n_new_methods = k_new_methods->length(); coleenp@4037: Thread* thread = Thread::current(); duke@435: duke@435: int ni = 0; duke@435: int oi = 0; duke@435: while (true) { coleenp@4037: Method* k_old_method; coleenp@4037: Method* k_new_method; duke@435: enum { matched, added, deleted, undetermined } method_was = undetermined; duke@435: duke@435: if (oi >= n_old_methods) { duke@435: if (ni >= n_new_methods) { duke@435: break; // we've looked at everything, done duke@435: } duke@435: // New method at the end coleenp@4037: k_new_method = k_new_methods->at(ni); duke@435: method_was = added; duke@435: } else if (ni >= n_new_methods) { duke@435: // Old method, at the end, is deleted coleenp@4037: k_old_method = k_old_methods->at(oi); duke@435: method_was = deleted; duke@435: } else { duke@435: // There are more methods in both the old and new lists coleenp@4037: k_old_method = k_old_methods->at(oi); coleenp@4037: k_new_method = k_new_methods->at(ni); duke@435: if (k_old_method->name() != k_new_method->name()) { duke@435: // Methods are sorted by method name, so a mismatch means added duke@435: // or deleted duke@435: if (k_old_method->name()->fast_compare(k_new_method->name()) > 0) { duke@435: method_was = added; duke@435: } else { duke@435: method_was = deleted; duke@435: } duke@435: } else if (k_old_method->signature() == k_new_method->signature()) { duke@435: // Both the name and signature match duke@435: method_was = matched; duke@435: } else { duke@435: // The name matches, but the signature doesn't, which means we have to duke@435: // search forward through the new overloaded methods. duke@435: int nj; // outside the loop for post-loop check duke@435: for (nj = ni + 1; nj < n_new_methods; nj++) { coleenp@4037: Method* m = k_new_methods->at(nj); duke@435: if (k_old_method->name() != m->name()) { duke@435: // reached another method name so no more overloaded methods duke@435: method_was = deleted; duke@435: break; duke@435: } duke@435: if (k_old_method->signature() == m->signature()) { duke@435: // found a match so swap the methods coleenp@4037: k_new_methods->at_put(ni, m); coleenp@4037: k_new_methods->at_put(nj, k_new_method); duke@435: k_new_method = m; duke@435: method_was = matched; duke@435: break; duke@435: } duke@435: } duke@435: duke@435: if (nj >= n_new_methods) { duke@435: // reached the end without a match; so method was deleted duke@435: method_was = deleted; duke@435: } duke@435: } duke@435: } duke@435: duke@435: switch (method_was) { duke@435: case matched: duke@435: // methods match, be sure modifiers do too duke@435: old_flags = (jushort) k_old_method->access_flags().get_flags(); duke@435: new_flags = (jushort) k_new_method->access_flags().get_flags(); duke@435: if ((old_flags ^ new_flags) & ~(JVM_ACC_NATIVE)) { duke@435: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_METHOD_MODIFIERS_CHANGED; duke@435: } duke@435: { duke@435: u2 new_num = k_new_method->method_idnum(); duke@435: u2 old_num = k_old_method->method_idnum(); duke@435: if (new_num != old_num) { coleenp@4037: Method* idnum_owner = scratch_class->method_with_idnum(old_num); duke@435: if (idnum_owner != NULL) { duke@435: // There is already a method assigned this idnum -- switch them sspitsyn@7636: // Take current and original idnum from the new_method duke@435: idnum_owner->set_method_idnum(new_num); sspitsyn@7636: idnum_owner->set_orig_method_idnum(k_new_method->orig_method_idnum()); duke@435: } sspitsyn@7636: // Take current and original idnum from the old_method duke@435: k_new_method->set_method_idnum(old_num); sspitsyn@7636: k_new_method->set_orig_method_idnum(k_old_method->orig_method_idnum()); coleenp@4572: if (thread->has_pending_exception()) { coleenp@4572: return JVMTI_ERROR_OUT_OF_MEMORY; coleenp@4572: } duke@435: } duke@435: } duke@435: RC_TRACE(0x00008000, ("Method matched: new: %s [%d] == old: %s [%d]", duke@435: k_new_method->name_and_sig_as_C_string(), ni, duke@435: k_old_method->name_and_sig_as_C_string(), oi)); duke@435: // advance to next pair of methods duke@435: ++oi; duke@435: ++ni; duke@435: break; duke@435: case added: duke@435: // method added, see if it is OK duke@435: new_flags = (jushort) k_new_method->access_flags().get_flags(); duke@435: if ((new_flags & JVM_ACC_PRIVATE) == 0 duke@435: // hack: private should be treated as final, but alas duke@435: || (new_flags & (JVM_ACC_FINAL|JVM_ACC_STATIC)) == 0 duke@435: ) { duke@435: // new methods must be private duke@435: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_METHOD_ADDED; duke@435: } duke@435: { duke@435: u2 num = the_class->next_method_idnum(); coleenp@4037: if (num == ConstMethod::UNSET_IDNUM) { duke@435: // cannot add any more methods duke@435: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_METHOD_ADDED; duke@435: } duke@435: u2 new_num = k_new_method->method_idnum(); coleenp@4037: Method* idnum_owner = scratch_class->method_with_idnum(num); duke@435: if (idnum_owner != NULL) { duke@435: // There is already a method assigned this idnum -- switch them sspitsyn@7636: // Take current and original idnum from the new_method duke@435: idnum_owner->set_method_idnum(new_num); sspitsyn@7636: idnum_owner->set_orig_method_idnum(k_new_method->orig_method_idnum()); duke@435: } duke@435: k_new_method->set_method_idnum(num); sspitsyn@7636: k_new_method->set_orig_method_idnum(num); coleenp@4037: if (thread->has_pending_exception()) { coleenp@4037: return JVMTI_ERROR_OUT_OF_MEMORY; coleenp@4037: } duke@435: } duke@435: RC_TRACE(0x00008000, ("Method added: new: %s [%d]", duke@435: k_new_method->name_and_sig_as_C_string(), ni)); duke@435: ++ni; // advance to next new method duke@435: break; duke@435: case deleted: duke@435: // method deleted, see if it is OK duke@435: old_flags = (jushort) k_old_method->access_flags().get_flags(); duke@435: if ((old_flags & JVM_ACC_PRIVATE) == 0 duke@435: // hack: private should be treated as final, but alas duke@435: || (old_flags & (JVM_ACC_FINAL|JVM_ACC_STATIC)) == 0 duke@435: ) { duke@435: // deleted methods must be private duke@435: return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_METHOD_DELETED; duke@435: } duke@435: RC_TRACE(0x00008000, ("Method deleted: old: %s [%d]", duke@435: k_old_method->name_and_sig_as_C_string(), oi)); duke@435: ++oi; // advance to next old method duke@435: break; duke@435: default: duke@435: ShouldNotReachHere(); duke@435: } duke@435: } duke@435: duke@435: return JVMTI_ERROR_NONE; duke@435: } duke@435: duke@435: duke@435: // Find new constant pool index value for old constant pool index value duke@435: // by seaching the index map. Returns zero (0) if there is no mapped duke@435: // value for the old constant pool index. duke@435: int VM_RedefineClasses::find_new_index(int old_index) { duke@435: if (_index_map_count == 0) { duke@435: // map is empty so nothing can be found duke@435: return 0; duke@435: } duke@435: duke@435: if (old_index < 1 || old_index >= _index_map_p->length()) { duke@435: // The old_index is out of range so it is not mapped. This should duke@435: // not happen in regular constant pool merging use, but it can duke@435: // happen if a corrupt annotation is processed. duke@435: return 0; duke@435: } duke@435: duke@435: int value = _index_map_p->at(old_index); duke@435: if (value == -1) { duke@435: // the old_index is not mapped duke@435: return 0; duke@435: } duke@435: duke@435: return value; duke@435: } // end find_new_index() duke@435: duke@435: sspitsyn@4983: // Find new bootstrap specifier index value for old bootstrap specifier index sspitsyn@4983: // value by seaching the index map. Returns unused index (-1) if there is sspitsyn@4983: // no mapped value for the old bootstrap specifier index. sspitsyn@4983: int VM_RedefineClasses::find_new_operand_index(int old_index) { sspitsyn@4983: if (_operands_index_map_count == 0) { sspitsyn@4983: // map is empty so nothing can be found sspitsyn@4983: return -1; sspitsyn@4983: } sspitsyn@4983: sspitsyn@4983: if (old_index == -1 || old_index >= _operands_index_map_p->length()) { sspitsyn@4983: // The old_index is out of range so it is not mapped. sspitsyn@4983: // This should not happen in regular constant pool merging use. sspitsyn@4983: return -1; sspitsyn@4983: } sspitsyn@4983: sspitsyn@4983: int value = _operands_index_map_p->at(old_index); sspitsyn@4983: if (value == -1) { sspitsyn@4983: // the old_index is not mapped sspitsyn@4983: return -1; sspitsyn@4983: } sspitsyn@4983: sspitsyn@4983: return value; sspitsyn@4983: } // end find_new_operand_index() sspitsyn@4983: sspitsyn@4983: duke@435: // Returns true if the current mismatch is due to a resolved/unresolved duke@435: // class pair. Otherwise, returns false. duke@435: bool VM_RedefineClasses::is_unresolved_class_mismatch(constantPoolHandle cp1, duke@435: int index1, constantPoolHandle cp2, int index2) { duke@435: duke@435: jbyte t1 = cp1->tag_at(index1).value(); duke@435: if (t1 != JVM_CONSTANT_Class && t1 != JVM_CONSTANT_UnresolvedClass) { duke@435: return false; // wrong entry type; not our special case duke@435: } duke@435: duke@435: jbyte t2 = cp2->tag_at(index2).value(); duke@435: if (t2 != JVM_CONSTANT_Class && t2 != JVM_CONSTANT_UnresolvedClass) { duke@435: return false; // wrong entry type; not our special case duke@435: } duke@435: duke@435: if (t1 == t2) { duke@435: return false; // not a mismatch; not our special case duke@435: } duke@435: duke@435: char *s1 = cp1->klass_name_at(index1)->as_C_string(); duke@435: char *s2 = cp2->klass_name_at(index2)->as_C_string(); duke@435: if (strcmp(s1, s2) != 0) { duke@435: return false; // strings don't match; not our special case duke@435: } duke@435: duke@435: return true; // made it through the gauntlet; this is our special case duke@435: } // end is_unresolved_class_mismatch() duke@435: duke@435: duke@435: jvmtiError VM_RedefineClasses::load_new_class_versions(TRAPS) { coleenp@4037: duke@435: // For consistency allocate memory using os::malloc wrapper. coleenp@4037: _scratch_classes = (Klass**) coleenp@4037: os::malloc(sizeof(Klass*) * _class_count, mtClass); duke@435: if (_scratch_classes == NULL) { duke@435: return JVMTI_ERROR_OUT_OF_MEMORY; duke@435: } coleenp@4037: // Zero initialize the _scratch_classes array. coleenp@4037: for (int i = 0; i < _class_count; i++) { coleenp@4037: _scratch_classes[i] = NULL; coleenp@4037: } duke@435: duke@435: ResourceMark rm(THREAD); duke@435: duke@435: JvmtiThreadState *state = JvmtiThreadState::state_for(JavaThread::current()); dcubed@1044: // state can only be NULL if the current thread is exiting which dcubed@1044: // should not happen since we're trying to do a RedefineClasses dcubed@1044: guarantee(state != NULL, "exiting thread calling load_new_class_versions"); duke@435: for (int i = 0; i < _class_count; i++) { coleenp@4037: // Create HandleMark so that any handles created while loading new class coleenp@4037: // versions are deleted. Constant pools are deallocated while merging coleenp@4037: // constant pools coleenp@4037: HandleMark hm(THREAD); coleenp@4037: duke@435: oop mirror = JNIHandles::resolve_non_null(_class_defs[i].klass); duke@435: // classes for primitives cannot be redefined duke@435: if (!is_modifiable_class(mirror)) { duke@435: return JVMTI_ERROR_UNMODIFIABLE_CLASS; duke@435: } coleenp@4037: Klass* the_class_oop = java_lang_Class::as_Klass(mirror); duke@435: instanceKlassHandle the_class = instanceKlassHandle(THREAD, the_class_oop); coleenp@2497: Symbol* the_class_sym = the_class->name(); duke@435: duke@435: // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark duke@435: RC_TRACE_WITH_THREAD(0x00000001, THREAD, dcubed@3360: ("loading name=%s kind=%d (avail_mem=" UINT64_FORMAT "K)", dcubed@3360: the_class->external_name(), _class_load_kind, dcubed@3360: os::available_memory() >> 10)); duke@435: duke@435: ClassFileStream st((u1*) _class_defs[i].class_bytes, duke@435: _class_defs[i].class_byte_count, (char *)"__VM_RedefineClasses__"); duke@435: duke@435: // Parse the stream. duke@435: Handle the_class_loader(THREAD, the_class->class_loader()); duke@435: Handle protection_domain(THREAD, the_class->protection_domain()); duke@435: // Set redefined class handle in JvmtiThreadState class. duke@435: // This redefined class is sent to agent event handler for class file duke@435: // load hook event. duke@435: state->set_class_being_redefined(&the_class, _class_load_kind); duke@435: coleenp@4037: Klass* k = SystemDictionary::parse_stream(the_class_sym, duke@435: the_class_loader, duke@435: protection_domain, duke@435: &st, duke@435: THREAD); duke@435: // Clear class_being_redefined just to be sure. duke@435: state->clear_class_being_redefined(); duke@435: duke@435: // TODO: if this is retransform, and nothing changed we can skip it duke@435: duke@435: instanceKlassHandle scratch_class (THREAD, k); duke@435: coleenp@4037: // Need to clean up allocated InstanceKlass if there's an error so assign coleenp@4037: // the result here. Caller deallocates all the scratch classes in case of coleenp@4037: // an error. coleenp@4037: _scratch_classes[i] = k; coleenp@4037: duke@435: if (HAS_PENDING_EXCEPTION) { coleenp@4037: Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); duke@435: // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark duke@435: RC_TRACE_WITH_THREAD(0x00000002, THREAD, ("parse_stream exception: '%s'", duke@435: ex_name->as_C_string())); duke@435: CLEAR_PENDING_EXCEPTION; duke@435: duke@435: if (ex_name == vmSymbols::java_lang_UnsupportedClassVersionError()) { duke@435: return JVMTI_ERROR_UNSUPPORTED_VERSION; duke@435: } else if (ex_name == vmSymbols::java_lang_ClassFormatError()) { duke@435: return JVMTI_ERROR_INVALID_CLASS_FORMAT; duke@435: } else if (ex_name == vmSymbols::java_lang_ClassCircularityError()) { duke@435: return JVMTI_ERROR_CIRCULAR_CLASS_DEFINITION; duke@435: } else if (ex_name == vmSymbols::java_lang_NoClassDefFoundError()) { duke@435: // The message will be "XXX (wrong name: YYY)" duke@435: return JVMTI_ERROR_NAMES_DONT_MATCH; duke@435: } else if (ex_name == vmSymbols::java_lang_OutOfMemoryError()) { duke@435: return JVMTI_ERROR_OUT_OF_MEMORY; duke@435: } else { // Just in case more exceptions can be thrown.. duke@435: return JVMTI_ERROR_FAILS_VERIFICATION; duke@435: } duke@435: } duke@435: duke@435: // Ensure class is linked before redefine duke@435: if (!the_class->is_linked()) { duke@435: the_class->link_class(THREAD); duke@435: if (HAS_PENDING_EXCEPTION) { coleenp@4037: Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); duke@435: // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark duke@435: RC_TRACE_WITH_THREAD(0x00000002, THREAD, ("link_class exception: '%s'", duke@435: ex_name->as_C_string())); duke@435: CLEAR_PENDING_EXCEPTION; duke@435: if (ex_name == vmSymbols::java_lang_OutOfMemoryError()) { duke@435: return JVMTI_ERROR_OUT_OF_MEMORY; duke@435: } else { duke@435: return JVMTI_ERROR_INTERNAL; duke@435: } duke@435: } duke@435: } duke@435: duke@435: // Do the validity checks in compare_and_normalize_class_versions() duke@435: // before verifying the byte codes. By doing these checks first, we duke@435: // limit the number of functions that require redirection from duke@435: // the_class to scratch_class. In particular, we don't have to duke@435: // modify JNI GetSuperclass() and thus won't change its performance. duke@435: jvmtiError res = compare_and_normalize_class_versions(the_class, duke@435: scratch_class); duke@435: if (res != JVMTI_ERROR_NONE) { duke@435: return res; duke@435: } duke@435: duke@435: // verify what the caller passed us duke@435: { duke@435: // The bug 6214132 caused the verification to fail. duke@435: // Information about the_class and scratch_class is temporarily duke@435: // recorded into jvmtiThreadState. This data is used to redirect duke@435: // the_class to scratch_class in the JVM_* functions called by the duke@435: // verifier. Please, refer to jvmtiThreadState.hpp for the detailed duke@435: // description. duke@435: RedefineVerifyMark rvm(&the_class, &scratch_class, state); duke@435: Verifier::verify( acorn@1408: scratch_class, Verifier::ThrowException, true, THREAD); duke@435: } duke@435: duke@435: if (HAS_PENDING_EXCEPTION) { coleenp@4037: Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); duke@435: // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark duke@435: RC_TRACE_WITH_THREAD(0x00000002, THREAD, duke@435: ("verify_byte_codes exception: '%s'", ex_name->as_C_string())); duke@435: CLEAR_PENDING_EXCEPTION; duke@435: if (ex_name == vmSymbols::java_lang_OutOfMemoryError()) { duke@435: return JVMTI_ERROR_OUT_OF_MEMORY; duke@435: } else { duke@435: // tell the caller the bytecodes are bad duke@435: return JVMTI_ERROR_FAILS_VERIFICATION; duke@435: } duke@435: } duke@435: duke@435: res = merge_cp_and_rewrite(the_class, scratch_class, THREAD); sspitsyn@5677: if (HAS_PENDING_EXCEPTION) { sspitsyn@5677: Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); sspitsyn@5677: // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark sspitsyn@5677: RC_TRACE_WITH_THREAD(0x00000002, THREAD, sspitsyn@5677: ("merge_cp_and_rewrite exception: '%s'", ex_name->as_C_string())); sspitsyn@5677: CLEAR_PENDING_EXCEPTION; sspitsyn@5677: if (ex_name == vmSymbols::java_lang_OutOfMemoryError()) { sspitsyn@5677: return JVMTI_ERROR_OUT_OF_MEMORY; sspitsyn@5677: } else { sspitsyn@5677: return JVMTI_ERROR_INTERNAL; sspitsyn@5677: } duke@435: } duke@435: duke@435: if (VerifyMergedCPBytecodes) { duke@435: // verify what we have done during constant pool merging duke@435: { duke@435: RedefineVerifyMark rvm(&the_class, &scratch_class, state); acorn@1408: Verifier::verify(scratch_class, Verifier::ThrowException, true, THREAD); duke@435: } duke@435: duke@435: if (HAS_PENDING_EXCEPTION) { coleenp@4037: Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); duke@435: // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark duke@435: RC_TRACE_WITH_THREAD(0x00000002, THREAD, duke@435: ("verify_byte_codes post merge-CP exception: '%s'", duke@435: ex_name->as_C_string())); duke@435: CLEAR_PENDING_EXCEPTION; duke@435: if (ex_name == vmSymbols::java_lang_OutOfMemoryError()) { duke@435: return JVMTI_ERROR_OUT_OF_MEMORY; duke@435: } else { duke@435: // tell the caller that constant pool merging screwed up duke@435: return JVMTI_ERROR_INTERNAL; duke@435: } duke@435: } duke@435: } duke@435: duke@435: Rewriter::rewrite(scratch_class, THREAD); coleenp@2945: if (!HAS_PENDING_EXCEPTION) { coleenp@4395: scratch_class->link_methods(THREAD); coleenp@2945: } duke@435: if (HAS_PENDING_EXCEPTION) { coleenp@4037: Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); sspitsyn@5677: // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark sspitsyn@5677: RC_TRACE_WITH_THREAD(0x00000002, THREAD, sspitsyn@5677: ("Rewriter::rewrite or link_methods exception: '%s'", ex_name->as_C_string())); duke@435: CLEAR_PENDING_EXCEPTION; duke@435: if (ex_name == vmSymbols::java_lang_OutOfMemoryError()) { duke@435: return JVMTI_ERROR_OUT_OF_MEMORY; duke@435: } else { duke@435: return JVMTI_ERROR_INTERNAL; duke@435: } duke@435: } duke@435: duke@435: // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark duke@435: RC_TRACE_WITH_THREAD(0x00000001, THREAD, duke@435: ("loaded name=%s (avail_mem=" UINT64_FORMAT "K)", duke@435: the_class->external_name(), os::available_memory() >> 10)); duke@435: } duke@435: duke@435: return JVMTI_ERROR_NONE; duke@435: } duke@435: duke@435: duke@435: // Map old_index to new_index as needed. scratch_cp is only needed duke@435: // for RC_TRACE() calls. duke@435: void VM_RedefineClasses::map_index(constantPoolHandle scratch_cp, duke@435: int old_index, int new_index) { duke@435: if (find_new_index(old_index) != 0) { duke@435: // old_index is already mapped duke@435: return; duke@435: } duke@435: duke@435: if (old_index == new_index) { duke@435: // no mapping is needed duke@435: return; duke@435: } duke@435: duke@435: _index_map_p->at_put(old_index, new_index); duke@435: _index_map_count++; duke@435: duke@435: RC_TRACE(0x00040000, ("mapped tag %d at index %d to %d", duke@435: scratch_cp->tag_at(old_index).value(), old_index, new_index)); duke@435: } // end map_index() duke@435: duke@435: sspitsyn@4983: // Map old_index to new_index as needed. sspitsyn@4983: void VM_RedefineClasses::map_operand_index(int old_index, int new_index) { sspitsyn@4983: if (find_new_operand_index(old_index) != -1) { sspitsyn@4983: // old_index is already mapped sspitsyn@4983: return; sspitsyn@4983: } sspitsyn@4983: sspitsyn@4983: if (old_index == new_index) { sspitsyn@4983: // no mapping is needed sspitsyn@4983: return; sspitsyn@4983: } sspitsyn@4983: sspitsyn@4983: _operands_index_map_p->at_put(old_index, new_index); sspitsyn@4983: _operands_index_map_count++; sspitsyn@4983: sspitsyn@4983: RC_TRACE(0x00040000, ("mapped bootstrap specifier at index %d to %d", old_index, new_index)); sspitsyn@4983: } // end map_index() sspitsyn@4983: sspitsyn@4983: duke@435: // Merge old_cp and scratch_cp and return the results of the merge via duke@435: // merge_cp_p. The number of entries in *merge_cp_p is returned via duke@435: // merge_cp_length_p. The entries in old_cp occupy the same locations duke@435: // in *merge_cp_p. Also creates a map of indices from entries in duke@435: // scratch_cp to the corresponding entry in *merge_cp_p. Index map duke@435: // entries are only created for entries in scratch_cp that occupy a duke@435: // different location in *merged_cp_p. duke@435: bool VM_RedefineClasses::merge_constant_pools(constantPoolHandle old_cp, duke@435: constantPoolHandle scratch_cp, constantPoolHandle *merge_cp_p, duke@435: int *merge_cp_length_p, TRAPS) { duke@435: duke@435: if (merge_cp_p == NULL) { coleenp@4037: assert(false, "caller must provide scratch constantPool"); duke@435: return false; // robustness duke@435: } duke@435: if (merge_cp_length_p == NULL) { coleenp@4037: assert(false, "caller must provide scratch CP length"); duke@435: return false; // robustness duke@435: } duke@435: // Worst case we need old_cp->length() + scratch_cp()->length(), duke@435: // but the caller might be smart so make sure we have at least duke@435: // the minimum. duke@435: if ((*merge_cp_p)->length() < old_cp->length()) { duke@435: assert(false, "merge area too small"); duke@435: return false; // robustness duke@435: } duke@435: duke@435: RC_TRACE_WITH_THREAD(0x00010000, THREAD, duke@435: ("old_cp_len=%d, scratch_cp_len=%d", old_cp->length(), duke@435: scratch_cp->length())); duke@435: duke@435: { duke@435: // Pass 0: duke@435: // The old_cp is copied to *merge_cp_p; this means that any code duke@435: // using old_cp does not have to change. This work looks like a coleenp@4037: // perfect fit for ConstantPool*::copy_cp_to(), but we need to duke@435: // handle one special case: duke@435: // - revert JVM_CONSTANT_Class to JVM_CONSTANT_UnresolvedClass duke@435: // This will make verification happy. duke@435: duke@435: int old_i; // index into old_cp duke@435: duke@435: // index zero (0) is not used in constantPools duke@435: for (old_i = 1; old_i < old_cp->length(); old_i++) { duke@435: // leave debugging crumb duke@435: jbyte old_tag = old_cp->tag_at(old_i).value(); duke@435: switch (old_tag) { duke@435: case JVM_CONSTANT_Class: coleenp@2614: case JVM_CONSTANT_UnresolvedClass: duke@435: // revert the copy to JVM_CONSTANT_UnresolvedClass coleenp@2614: // May be resolving while calling this so do the same for coleenp@2614: // JVM_CONSTANT_UnresolvedClass (klass_name_at() deals with transition) duke@435: (*merge_cp_p)->unresolved_klass_at_put(old_i, duke@435: old_cp->klass_name_at(old_i)); duke@435: break; duke@435: duke@435: case JVM_CONSTANT_Double: duke@435: case JVM_CONSTANT_Long: duke@435: // just copy the entry to *merge_cp_p, but double and long take duke@435: // two constant pool entries coleenp@4037: ConstantPool::copy_entry_to(old_cp, old_i, *merge_cp_p, old_i, CHECK_0); duke@435: old_i++; duke@435: break; duke@435: duke@435: default: duke@435: // just copy the entry to *merge_cp_p coleenp@4037: ConstantPool::copy_entry_to(old_cp, old_i, *merge_cp_p, old_i, CHECK_0); duke@435: break; duke@435: } duke@435: } // end for each old_cp entry duke@435: sspitsyn@4493: ConstantPool::copy_operands(old_cp, *merge_cp_p, CHECK_0); sspitsyn@4983: (*merge_cp_p)->extend_operands(scratch_cp, CHECK_0); sspitsyn@4493: duke@435: // We don't need to sanity check that *merge_cp_length_p is within duke@435: // *merge_cp_p bounds since we have the minimum on-entry check above. duke@435: (*merge_cp_length_p) = old_i; duke@435: } duke@435: duke@435: // merge_cp_len should be the same as old_cp->length() at this point duke@435: // so this trace message is really a "warm-and-breathing" message. duke@435: RC_TRACE_WITH_THREAD(0x00020000, THREAD, duke@435: ("after pass 0: merge_cp_len=%d", *merge_cp_length_p)); duke@435: duke@435: int scratch_i; // index into scratch_cp duke@435: { duke@435: // Pass 1a: duke@435: // Compare scratch_cp entries to the old_cp entries that we have duke@435: // already copied to *merge_cp_p. In this pass, we are eliminating duke@435: // exact duplicates (matching entry at same index) so we only duke@435: // compare entries in the common indice range. duke@435: int increment = 1; duke@435: int pass1a_length = MIN2(old_cp->length(), scratch_cp->length()); duke@435: for (scratch_i = 1; scratch_i < pass1a_length; scratch_i += increment) { duke@435: switch (scratch_cp->tag_at(scratch_i).value()) { duke@435: case JVM_CONSTANT_Double: duke@435: case JVM_CONSTANT_Long: duke@435: // double and long take two constant pool entries duke@435: increment = 2; duke@435: break; duke@435: duke@435: default: duke@435: increment = 1; duke@435: break; duke@435: } duke@435: duke@435: bool match = scratch_cp->compare_entry_to(scratch_i, *merge_cp_p, duke@435: scratch_i, CHECK_0); duke@435: if (match) { duke@435: // found a match at the same index so nothing more to do duke@435: continue; duke@435: } else if (is_unresolved_class_mismatch(scratch_cp, scratch_i, duke@435: *merge_cp_p, scratch_i)) { duke@435: // The mismatch in compare_entry_to() above is because of a duke@435: // resolved versus unresolved class entry at the same index duke@435: // with the same string value. Since Pass 0 reverted any duke@435: // class entries to unresolved class entries in *merge_cp_p, duke@435: // we go with the unresolved class entry. duke@435: continue; duke@435: } duke@435: duke@435: int found_i = scratch_cp->find_matching_entry(scratch_i, *merge_cp_p, duke@435: CHECK_0); duke@435: if (found_i != 0) { duke@435: guarantee(found_i != scratch_i, duke@435: "compare_entry_to() and find_matching_entry() do not agree"); duke@435: duke@435: // Found a matching entry somewhere else in *merge_cp_p so duke@435: // just need a mapping entry. duke@435: map_index(scratch_cp, scratch_i, found_i); duke@435: continue; duke@435: } duke@435: duke@435: // The find_matching_entry() call above could fail to find a match duke@435: // due to a resolved versus unresolved class or string entry situation duke@435: // like we solved above with the is_unresolved_*_mismatch() calls. duke@435: // However, we would have to call is_unresolved_*_mismatch() over duke@435: // all of *merge_cp_p (potentially) and that doesn't seem to be duke@435: // worth the time. duke@435: duke@435: // No match found so we have to append this entry and any unique duke@435: // referenced entries to *merge_cp_p. duke@435: append_entry(scratch_cp, scratch_i, merge_cp_p, merge_cp_length_p, duke@435: CHECK_0); duke@435: } duke@435: } duke@435: duke@435: RC_TRACE_WITH_THREAD(0x00020000, THREAD, duke@435: ("after pass 1a: merge_cp_len=%d, scratch_i=%d, index_map_len=%d", duke@435: *merge_cp_length_p, scratch_i, _index_map_count)); duke@435: duke@435: if (scratch_i < scratch_cp->length()) { duke@435: // Pass 1b: duke@435: // old_cp is smaller than scratch_cp so there are entries in duke@435: // scratch_cp that we have not yet processed. We take care of duke@435: // those now. duke@435: int increment = 1; duke@435: for (; scratch_i < scratch_cp->length(); scratch_i += increment) { duke@435: switch (scratch_cp->tag_at(scratch_i).value()) { duke@435: case JVM_CONSTANT_Double: duke@435: case JVM_CONSTANT_Long: duke@435: // double and long take two constant pool entries duke@435: increment = 2; duke@435: break; duke@435: duke@435: default: duke@435: increment = 1; duke@435: break; duke@435: } duke@435: duke@435: int found_i = duke@435: scratch_cp->find_matching_entry(scratch_i, *merge_cp_p, CHECK_0); duke@435: if (found_i != 0) { duke@435: // Found a matching entry somewhere else in *merge_cp_p so duke@435: // just need a mapping entry. duke@435: map_index(scratch_cp, scratch_i, found_i); duke@435: continue; duke@435: } duke@435: duke@435: // No match found so we have to append this entry and any unique duke@435: // referenced entries to *merge_cp_p. duke@435: append_entry(scratch_cp, scratch_i, merge_cp_p, merge_cp_length_p, duke@435: CHECK_0); duke@435: } duke@435: duke@435: RC_TRACE_WITH_THREAD(0x00020000, THREAD, duke@435: ("after pass 1b: merge_cp_len=%d, scratch_i=%d, index_map_len=%d", duke@435: *merge_cp_length_p, scratch_i, _index_map_count)); duke@435: } sspitsyn@5214: finalize_operands_merge(*merge_cp_p, THREAD); duke@435: duke@435: return true; duke@435: } // end merge_constant_pools() duke@435: duke@435: coleenp@4037: // Scoped object to clean up the constant pool(s) created for merging coleenp@4037: class MergeCPCleaner { coleenp@4037: ClassLoaderData* _loader_data; coleenp@4037: ConstantPool* _cp; coleenp@4037: ConstantPool* _scratch_cp; coleenp@4037: public: coleenp@4037: MergeCPCleaner(ClassLoaderData* loader_data, ConstantPool* merge_cp) : coleenp@4037: _loader_data(loader_data), _cp(merge_cp), _scratch_cp(NULL) {} coleenp@4037: ~MergeCPCleaner() { coleenp@4037: _loader_data->add_to_deallocate_list(_cp); coleenp@4037: if (_scratch_cp != NULL) { coleenp@4037: _loader_data->add_to_deallocate_list(_scratch_cp); coleenp@4037: } coleenp@4037: } coleenp@4037: void add_scratch_cp(ConstantPool* scratch_cp) { _scratch_cp = scratch_cp; } coleenp@4037: }; coleenp@4037: duke@435: // Merge constant pools between the_class and scratch_class and duke@435: // potentially rewrite bytecodes in scratch_class to use the merged duke@435: // constant pool. duke@435: jvmtiError VM_RedefineClasses::merge_cp_and_rewrite( duke@435: instanceKlassHandle the_class, instanceKlassHandle scratch_class, duke@435: TRAPS) { duke@435: // worst case merged constant pool length is old and new combined duke@435: int merge_cp_length = the_class->constants()->length() duke@435: + scratch_class->constants()->length(); duke@435: duke@435: // Constant pools are not easily reused so we allocate a new one duke@435: // each time. jmasa@953: // merge_cp is created unsafe for concurrent GC processing. It ysr@2533: // should be marked safe before discarding it. Even though ysr@2533: // garbage, if it crosses a card boundary, it may be scanned jmasa@953: // in order to find the start of the first complete object on the card. coleenp@4037: ClassLoaderData* loader_data = the_class->class_loader_data(); coleenp@4037: ConstantPool* merge_cp_oop = coleenp@4037: ConstantPool::allocate(loader_data, sspitsyn@5676: merge_cp_length, sspitsyn@5676: CHECK_(JVMTI_ERROR_OUT_OF_MEMORY)); coleenp@4037: MergeCPCleaner cp_cleaner(loader_data, merge_cp_oop); coleenp@4037: coleenp@4037: HandleMark hm(THREAD); // make sure handles are cleared before coleenp@4037: // MergeCPCleaner clears out merge_cp_oop coleenp@4037: constantPoolHandle merge_cp(THREAD, merge_cp_oop); coleenp@4037: coleenp@4037: // Get constants() from the old class because it could have been rewritten coleenp@4037: // while we were at a safepoint allocating a new constant pool. coleenp@4037: constantPoolHandle old_cp(THREAD, the_class->constants()); coleenp@4037: constantPoolHandle scratch_cp(THREAD, scratch_class->constants()); coleenp@4037: coleenp@4037: // If the length changed, the class was redefined out from under us. Return coleenp@4037: // an error. coleenp@4037: if (merge_cp_length != the_class->constants()->length() coleenp@4037: + scratch_class->constants()->length()) { coleenp@4037: return JVMTI_ERROR_INTERNAL; coleenp@4037: } coleenp@4037: coleenp@4466: // Update the version number of the constant pool coleenp@4466: merge_cp->increment_and_save_version(old_cp->version()); duke@435: duke@435: ResourceMark rm(THREAD); duke@435: _index_map_count = 0; duke@435: _index_map_p = new intArray(scratch_cp->length(), -1); duke@435: sspitsyn@4983: _operands_cur_length = ConstantPool::operand_array_length(old_cp->operands()); sspitsyn@4983: _operands_index_map_count = 0; sspitsyn@4983: _operands_index_map_p = new intArray( sspitsyn@4983: ConstantPool::operand_array_length(scratch_cp->operands()), -1); sspitsyn@4983: sspitsyn@4493: // reference to the cp holder is needed for copy_operands() sspitsyn@4493: merge_cp->set_pool_holder(scratch_class()); duke@435: bool result = merge_constant_pools(old_cp, scratch_cp, &merge_cp, duke@435: &merge_cp_length, THREAD); sspitsyn@4493: merge_cp->set_pool_holder(NULL); sspitsyn@4493: duke@435: if (!result) { duke@435: // The merge can fail due to memory allocation failure or due duke@435: // to robustness checks. duke@435: return JVMTI_ERROR_INTERNAL; duke@435: } duke@435: duke@435: RC_TRACE_WITH_THREAD(0x00010000, THREAD, duke@435: ("merge_cp_len=%d, index_map_len=%d", merge_cp_length, _index_map_count)); duke@435: duke@435: if (_index_map_count == 0) { duke@435: // there is nothing to map between the new and merged constant pools duke@435: duke@435: if (old_cp->length() == scratch_cp->length()) { duke@435: // The old and new constant pools are the same length and the duke@435: // index map is empty. This means that the three constant pools duke@435: // are equivalent (but not the same). Unfortunately, the new duke@435: // constant pool has not gone through link resolution nor have duke@435: // the new class bytecodes gone through constant pool cache duke@435: // rewriting so we can't use the old constant pool with the new duke@435: // class. duke@435: coleenp@4037: // toss the merged constant pool at return duke@435: } else if (old_cp->length() < scratch_cp->length()) { duke@435: // The old constant pool has fewer entries than the new constant duke@435: // pool and the index map is empty. This means the new constant duke@435: // pool is a superset of the old constant pool. However, the old duke@435: // class bytecodes have already gone through constant pool cache duke@435: // rewriting so we can't use the new constant pool with the old duke@435: // class. duke@435: coleenp@4037: // toss the merged constant pool at return duke@435: } else { duke@435: // The old constant pool has more entries than the new constant duke@435: // pool and the index map is empty. This means that both the old duke@435: // and merged constant pools are supersets of the new constant duke@435: // pool. duke@435: duke@435: // Replace the new constant pool with a shrunken copy of the coleenp@4037: // merged constant pool sspitsyn@5676: set_new_constant_pool(loader_data, scratch_class, merge_cp, merge_cp_length, sspitsyn@5676: CHECK_(JVMTI_ERROR_OUT_OF_MEMORY)); coleenp@4037: // The new constant pool replaces scratch_cp so have cleaner clean it up. coleenp@4037: // It can't be cleaned up while there are handles to it. coleenp@4037: cp_cleaner.add_scratch_cp(scratch_cp()); duke@435: } duke@435: } else { duke@435: if (RC_TRACE_ENABLED(0x00040000)) { duke@435: // don't want to loop unless we are tracing duke@435: int count = 0; duke@435: for (int i = 1; i < _index_map_p->length(); i++) { duke@435: int value = _index_map_p->at(i); duke@435: duke@435: if (value != -1) { duke@435: RC_TRACE_WITH_THREAD(0x00040000, THREAD, duke@435: ("index_map[%d]: old=%d new=%d", count, i, value)); duke@435: count++; duke@435: } duke@435: } duke@435: } duke@435: duke@435: // We have entries mapped between the new and merged constant pools duke@435: // so we have to rewrite some constant pool references. duke@435: if (!rewrite_cp_refs(scratch_class, THREAD)) { duke@435: return JVMTI_ERROR_INTERNAL; duke@435: } duke@435: duke@435: // Replace the new constant pool with a shrunken copy of the duke@435: // merged constant pool so now the rewritten bytecodes have duke@435: // valid references; the previous new constant pool will get duke@435: // GCed. sspitsyn@5676: set_new_constant_pool(loader_data, scratch_class, merge_cp, merge_cp_length, sspitsyn@5676: CHECK_(JVMTI_ERROR_OUT_OF_MEMORY)); coleenp@4037: // The new constant pool replaces scratch_cp so have cleaner clean it up. coleenp@4037: // It can't be cleaned up while there are handles to it. coleenp@4037: cp_cleaner.add_scratch_cp(scratch_cp()); duke@435: } duke@435: duke@435: return JVMTI_ERROR_NONE; duke@435: } // end merge_cp_and_rewrite() duke@435: duke@435: duke@435: // Rewrite constant pool references in klass scratch_class. duke@435: bool VM_RedefineClasses::rewrite_cp_refs(instanceKlassHandle scratch_class, duke@435: TRAPS) { duke@435: duke@435: // rewrite constant pool references in the methods: duke@435: if (!rewrite_cp_refs_in_methods(scratch_class, THREAD)) { twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: duke@435: // rewrite constant pool references in the class_annotations: duke@435: if (!rewrite_cp_refs_in_class_annotations(scratch_class, THREAD)) { twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: duke@435: // rewrite constant pool references in the fields_annotations: duke@435: if (!rewrite_cp_refs_in_fields_annotations(scratch_class, THREAD)) { twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: duke@435: // rewrite constant pool references in the methods_annotations: duke@435: if (!rewrite_cp_refs_in_methods_annotations(scratch_class, THREAD)) { twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: duke@435: // rewrite constant pool references in the methods_parameter_annotations: duke@435: if (!rewrite_cp_refs_in_methods_parameter_annotations(scratch_class, duke@435: THREAD)) { twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: duke@435: // rewrite constant pool references in the methods_default_annotations: duke@435: if (!rewrite_cp_refs_in_methods_default_annotations(scratch_class, duke@435: THREAD)) { twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: aeriksso@7327: // rewrite constant pool references in the class_type_annotations: aeriksso@7327: if (!rewrite_cp_refs_in_class_type_annotations(scratch_class, THREAD)) { aeriksso@7327: // propagate failure back to caller aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: // rewrite constant pool references in the fields_type_annotations: aeriksso@7327: if (!rewrite_cp_refs_in_fields_type_annotations(scratch_class, THREAD)) { aeriksso@7327: // propagate failure back to caller aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: // rewrite constant pool references in the methods_type_annotations: aeriksso@7327: if (!rewrite_cp_refs_in_methods_type_annotations(scratch_class, THREAD)) { aeriksso@7327: // propagate failure back to caller aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: // There can be type annotations in the Code part of a method_info attribute. aeriksso@7327: // These annotations are not accessible, even by reflection. aeriksso@7327: // Currently they are not even parsed by the ClassFileParser. aeriksso@7327: // If runtime access is added they will also need to be rewritten. aeriksso@7327: jiangli@5569: // rewrite source file name index: jiangli@5535: u2 source_file_name_idx = scratch_class->source_file_name_index(); jiangli@5535: if (source_file_name_idx != 0) { jiangli@5535: u2 new_source_file_name_idx = find_new_index(source_file_name_idx); jiangli@5569: if (new_source_file_name_idx != 0) { jiangli@5569: scratch_class->set_source_file_name_index(new_source_file_name_idx); jiangli@5569: } jiangli@5535: } jiangli@5535: jiangli@5535: // rewrite class generic signature index: jiangli@5535: u2 generic_signature_index = scratch_class->generic_signature_index(); jiangli@5535: if (generic_signature_index != 0) { jiangli@5535: u2 new_generic_signature_index = find_new_index(generic_signature_index); jiangli@5569: if (new_generic_signature_index != 0) { jiangli@5569: scratch_class->set_generic_signature_index(new_generic_signature_index); jiangli@5569: } jiangli@5535: } jiangli@5535: duke@435: return true; duke@435: } // end rewrite_cp_refs() duke@435: duke@435: // Rewrite constant pool references in the methods. duke@435: bool VM_RedefineClasses::rewrite_cp_refs_in_methods( duke@435: instanceKlassHandle scratch_class, TRAPS) { duke@435: coleenp@4037: Array* methods = scratch_class->methods(); coleenp@4037: coleenp@4037: if (methods == NULL || methods->length() == 0) { duke@435: // no methods so nothing to do duke@435: return true; duke@435: } duke@435: duke@435: // rewrite constant pool references in the methods: duke@435: for (int i = methods->length() - 1; i >= 0; i--) { coleenp@4037: methodHandle method(THREAD, methods->at(i)); duke@435: methodHandle new_method; sspitsyn@5675: rewrite_cp_refs_in_method(method, &new_method, THREAD); duke@435: if (!new_method.is_null()) { duke@435: // the method has been replaced so save the new method version sspitsyn@5675: // even in the case of an exception. original method is on the sspitsyn@5675: // deallocation list. coleenp@4037: methods->at_put(i, new_method()); duke@435: } sspitsyn@5675: if (HAS_PENDING_EXCEPTION) { sspitsyn@5675: Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); sspitsyn@5675: // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark sspitsyn@5675: RC_TRACE_WITH_THREAD(0x00000002, THREAD, sspitsyn@5675: ("rewrite_cp_refs_in_method exception: '%s'", ex_name->as_C_string())); sspitsyn@5675: // Need to clear pending exception here as the super caller sets sspitsyn@5675: // the JVMTI_ERROR_INTERNAL if the returned value is false. sspitsyn@5675: CLEAR_PENDING_EXCEPTION; sspitsyn@5675: return false; sspitsyn@5675: } duke@435: } duke@435: duke@435: return true; duke@435: } duke@435: duke@435: duke@435: // Rewrite constant pool references in the specific method. This code duke@435: // was adapted from Rewriter::rewrite_method(). duke@435: void VM_RedefineClasses::rewrite_cp_refs_in_method(methodHandle method, duke@435: methodHandle *new_method_p, TRAPS) { duke@435: duke@435: *new_method_p = methodHandle(); // default is no new method duke@435: duke@435: // We cache a pointer to the bytecodes here in code_base. If GC coleenp@4037: // moves the Method*, then the bytecodes will also move which duke@435: // will likely cause a crash. We create a No_Safepoint_Verifier duke@435: // object to detect whether we pass a possible safepoint in this duke@435: // code block. duke@435: No_Safepoint_Verifier nsv; duke@435: duke@435: // Bytecodes and their length duke@435: address code_base = method->code_base(); duke@435: int code_length = method->code_size(); duke@435: duke@435: int bc_length; duke@435: for (int bci = 0; bci < code_length; bci += bc_length) { duke@435: address bcp = code_base + bci; duke@435: Bytecodes::Code c = (Bytecodes::Code)(*bcp); duke@435: duke@435: bc_length = Bytecodes::length_for(c); duke@435: if (bc_length == 0) { duke@435: // More complicated bytecodes report a length of zero so duke@435: // we have to try again a slightly different way. never@2462: bc_length = Bytecodes::length_at(method(), bcp); duke@435: } duke@435: duke@435: assert(bc_length != 0, "impossible bytecode length"); duke@435: duke@435: switch (c) { duke@435: case Bytecodes::_ldc: duke@435: { duke@435: int cp_index = *(bcp + 1); duke@435: int new_index = find_new_index(cp_index); duke@435: duke@435: if (StressLdcRewrite && new_index == 0) { duke@435: // If we are stressing ldc -> ldc_w rewriting, then we duke@435: // always need a new_index value. duke@435: new_index = cp_index; duke@435: } duke@435: if (new_index != 0) { duke@435: // the original index is mapped so we have more work to do duke@435: if (!StressLdcRewrite && new_index <= max_jubyte) { duke@435: // The new value can still use ldc instead of ldc_w duke@435: // unless we are trying to stress ldc -> ldc_w rewriting duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("%s@" INTPTR_FORMAT " old=%d, new=%d", Bytecodes::name(c), duke@435: bcp, cp_index, new_index)); duke@435: *(bcp + 1) = new_index; duke@435: } else { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("%s->ldc_w@" INTPTR_FORMAT " old=%d, new=%d", duke@435: Bytecodes::name(c), bcp, cp_index, new_index)); duke@435: // the new value needs ldc_w instead of ldc duke@435: u_char inst_buffer[4]; // max instruction size is 4 bytes duke@435: bcp = (address)inst_buffer; duke@435: // construct new instruction sequence duke@435: *bcp = Bytecodes::_ldc_w; duke@435: bcp++; duke@435: // Rewriter::rewrite_method() does not rewrite ldc -> ldc_w. duke@435: // See comment below for difference between put_Java_u2() duke@435: // and put_native_u2(). duke@435: Bytes::put_Java_u2(bcp, new_index); duke@435: duke@435: Relocator rc(method, NULL /* no RelocatorListener needed */); duke@435: methodHandle m; duke@435: { duke@435: Pause_No_Safepoint_Verifier pnsv(&nsv); duke@435: duke@435: // ldc is 2 bytes and ldc_w is 3 bytes sspitsyn@5675: m = rc.insert_space_at(bci, 3, inst_buffer, CHECK); duke@435: } duke@435: duke@435: // return the new method so that the caller can update duke@435: // the containing class duke@435: *new_method_p = method = m; duke@435: // switch our bytecode processing loop from the old method duke@435: // to the new method duke@435: code_base = method->code_base(); duke@435: code_length = method->code_size(); duke@435: bcp = code_base + bci; duke@435: c = (Bytecodes::Code)(*bcp); duke@435: bc_length = Bytecodes::length_for(c); duke@435: assert(bc_length != 0, "sanity check"); duke@435: } // end we need ldc_w instead of ldc duke@435: } // end if there is a mapped index duke@435: } break; duke@435: duke@435: // these bytecodes have a two-byte constant pool index duke@435: case Bytecodes::_anewarray : // fall through duke@435: case Bytecodes::_checkcast : // fall through duke@435: case Bytecodes::_getfield : // fall through duke@435: case Bytecodes::_getstatic : // fall through duke@435: case Bytecodes::_instanceof : // fall through sspitsyn@4506: case Bytecodes::_invokedynamic : // fall through duke@435: case Bytecodes::_invokeinterface: // fall through duke@435: case Bytecodes::_invokespecial : // fall through duke@435: case Bytecodes::_invokestatic : // fall through duke@435: case Bytecodes::_invokevirtual : // fall through duke@435: case Bytecodes::_ldc_w : // fall through duke@435: case Bytecodes::_ldc2_w : // fall through duke@435: case Bytecodes::_multianewarray : // fall through duke@435: case Bytecodes::_new : // fall through duke@435: case Bytecodes::_putfield : // fall through duke@435: case Bytecodes::_putstatic : duke@435: { duke@435: address p = bcp + 1; duke@435: int cp_index = Bytes::get_Java_u2(p); duke@435: int new_index = find_new_index(cp_index); duke@435: if (new_index != 0) { duke@435: // the original index is mapped so update w/ new value duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("%s@" INTPTR_FORMAT " old=%d, new=%d", Bytecodes::name(c), duke@435: bcp, cp_index, new_index)); duke@435: // Rewriter::rewrite_method() uses put_native_u2() in this duke@435: // situation because it is reusing the constant pool index dcubed@4562: // location for a native index into the ConstantPoolCache. duke@435: // Since we are updating the constant pool index prior to dcubed@4562: // verification and ConstantPoolCache initialization, we duke@435: // need to keep the new index in Java byte order. duke@435: Bytes::put_Java_u2(p, new_index); duke@435: } duke@435: } break; duke@435: } duke@435: } // end for each bytecode emc@4609: emc@4609: // We also need to rewrite the parameter name indexes, if there is emc@4609: // method parameter data present emc@4609: if(method->has_method_parameters()) { emc@4609: const int len = method->method_parameters_length(); emc@4609: MethodParametersElement* elem = method->method_parameters_start(); emc@4609: emc@4609: for (int i = 0; i < len; i++) { emc@4609: const u2 cp_index = elem[i].name_cp_index; jiangli@5569: const u2 new_cp_index = find_new_index(cp_index); jiangli@5569: if (new_cp_index != 0) { jiangli@5569: elem[i].name_cp_index = new_cp_index; jiangli@5569: } emc@4609: } emc@4609: } duke@435: } // end rewrite_cp_refs_in_method() duke@435: duke@435: duke@435: // Rewrite constant pool references in the class_annotations field. duke@435: bool VM_RedefineClasses::rewrite_cp_refs_in_class_annotations( duke@435: instanceKlassHandle scratch_class, TRAPS) { duke@435: coleenp@4037: AnnotationArray* class_annotations = scratch_class->class_annotations(); coleenp@4037: if (class_annotations == NULL || class_annotations->length() == 0) { duke@435: // no class_annotations so nothing to do duke@435: return true; duke@435: } duke@435: duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("class_annotations length=%d", class_annotations->length())); duke@435: duke@435: int byte_i = 0; // byte index into class_annotations duke@435: return rewrite_cp_refs_in_annotations_typeArray(class_annotations, byte_i, duke@435: THREAD); duke@435: } duke@435: duke@435: duke@435: // Rewrite constant pool references in an annotations typeArray. This duke@435: // "structure" is adapted from the RuntimeVisibleAnnotations_attribute duke@435: // that is described in section 4.8.15 of the 2nd-edition of the VM spec: duke@435: // duke@435: // annotations_typeArray { duke@435: // u2 num_annotations; duke@435: // annotation annotations[num_annotations]; duke@435: // } duke@435: // duke@435: bool VM_RedefineClasses::rewrite_cp_refs_in_annotations_typeArray( coleenp@4037: AnnotationArray* annotations_typeArray, int &byte_i_ref, TRAPS) { duke@435: duke@435: if ((byte_i_ref + 2) > annotations_typeArray->length()) { duke@435: // not enough room for num_annotations field duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("length() is too small for num_annotations field")); duke@435: return false; duke@435: } duke@435: duke@435: u2 num_annotations = Bytes::get_Java_u2((address) coleenp@4037: annotations_typeArray->adr_at(byte_i_ref)); duke@435: byte_i_ref += 2; duke@435: duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("num_annotations=%d", num_annotations)); duke@435: duke@435: int calc_num_annotations = 0; duke@435: for (; calc_num_annotations < num_annotations; calc_num_annotations++) { duke@435: if (!rewrite_cp_refs_in_annotation_struct(annotations_typeArray, duke@435: byte_i_ref, THREAD)) { duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("bad annotation_struct at %d", calc_num_annotations)); twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: } duke@435: assert(num_annotations == calc_num_annotations, "sanity check"); duke@435: duke@435: return true; duke@435: } // end rewrite_cp_refs_in_annotations_typeArray() duke@435: duke@435: duke@435: // Rewrite constant pool references in the annotation struct portion of duke@435: // an annotations_typeArray. This "structure" is from section 4.8.15 of duke@435: // the 2nd-edition of the VM spec: duke@435: // duke@435: // struct annotation { duke@435: // u2 type_index; duke@435: // u2 num_element_value_pairs; duke@435: // { duke@435: // u2 element_name_index; duke@435: // element_value value; duke@435: // } element_value_pairs[num_element_value_pairs]; duke@435: // } duke@435: // duke@435: bool VM_RedefineClasses::rewrite_cp_refs_in_annotation_struct( coleenp@4037: AnnotationArray* annotations_typeArray, int &byte_i_ref, TRAPS) { duke@435: if ((byte_i_ref + 2 + 2) > annotations_typeArray->length()) { duke@435: // not enough room for smallest annotation_struct duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("length() is too small for annotation_struct")); duke@435: return false; duke@435: } duke@435: duke@435: u2 type_index = rewrite_cp_ref_in_annotation_data(annotations_typeArray, duke@435: byte_i_ref, "mapped old type_index=%d", THREAD); duke@435: duke@435: u2 num_element_value_pairs = Bytes::get_Java_u2((address) coleenp@4037: annotations_typeArray->adr_at(byte_i_ref)); duke@435: byte_i_ref += 2; duke@435: duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("type_index=%d num_element_value_pairs=%d", type_index, duke@435: num_element_value_pairs)); duke@435: duke@435: int calc_num_element_value_pairs = 0; duke@435: for (; calc_num_element_value_pairs < num_element_value_pairs; duke@435: calc_num_element_value_pairs++) { duke@435: if ((byte_i_ref + 2) > annotations_typeArray->length()) { duke@435: // not enough room for another element_name_index, let alone duke@435: // the rest of another component duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("length() is too small for element_name_index")); duke@435: return false; duke@435: } duke@435: duke@435: u2 element_name_index = rewrite_cp_ref_in_annotation_data( duke@435: annotations_typeArray, byte_i_ref, duke@435: "mapped old element_name_index=%d", THREAD); duke@435: duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("element_name_index=%d", element_name_index)); duke@435: duke@435: if (!rewrite_cp_refs_in_element_value(annotations_typeArray, duke@435: byte_i_ref, THREAD)) { duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("bad element_value at %d", calc_num_element_value_pairs)); twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: } // end for each component duke@435: assert(num_element_value_pairs == calc_num_element_value_pairs, duke@435: "sanity check"); duke@435: duke@435: return true; duke@435: } // end rewrite_cp_refs_in_annotation_struct() duke@435: duke@435: duke@435: // Rewrite a constant pool reference at the current position in duke@435: // annotations_typeArray if needed. Returns the original constant duke@435: // pool reference if a rewrite was not needed or the new constant duke@435: // pool reference if a rewrite was needed. drchase@6680: PRAGMA_DIAG_PUSH drchase@6680: PRAGMA_FORMAT_NONLITERAL_IGNORED duke@435: u2 VM_RedefineClasses::rewrite_cp_ref_in_annotation_data( coleenp@4037: AnnotationArray* annotations_typeArray, int &byte_i_ref, duke@435: const char * trace_mesg, TRAPS) { duke@435: duke@435: address cp_index_addr = (address) coleenp@4037: annotations_typeArray->adr_at(byte_i_ref); duke@435: u2 old_cp_index = Bytes::get_Java_u2(cp_index_addr); duke@435: u2 new_cp_index = find_new_index(old_cp_index); duke@435: if (new_cp_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, (trace_mesg, old_cp_index)); duke@435: Bytes::put_Java_u2(cp_index_addr, new_cp_index); duke@435: old_cp_index = new_cp_index; duke@435: } duke@435: byte_i_ref += 2; duke@435: return old_cp_index; duke@435: } drchase@6680: PRAGMA_DIAG_POP duke@435: duke@435: duke@435: // Rewrite constant pool references in the element_value portion of an duke@435: // annotations_typeArray. This "structure" is from section 4.8.15.1 of duke@435: // the 2nd-edition of the VM spec: duke@435: // duke@435: // struct element_value { duke@435: // u1 tag; duke@435: // union { duke@435: // u2 const_value_index; duke@435: // { duke@435: // u2 type_name_index; duke@435: // u2 const_name_index; duke@435: // } enum_const_value; duke@435: // u2 class_info_index; duke@435: // annotation annotation_value; duke@435: // struct { duke@435: // u2 num_values; duke@435: // element_value values[num_values]; duke@435: // } array_value; duke@435: // } value; duke@435: // } duke@435: // duke@435: bool VM_RedefineClasses::rewrite_cp_refs_in_element_value( coleenp@4037: AnnotationArray* annotations_typeArray, int &byte_i_ref, TRAPS) { duke@435: duke@435: if ((byte_i_ref + 1) > annotations_typeArray->length()) { duke@435: // not enough room for a tag let alone the rest of an element_value duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("length() is too small for a tag")); duke@435: return false; duke@435: } duke@435: coleenp@4037: u1 tag = annotations_typeArray->at(byte_i_ref); duke@435: byte_i_ref++; duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, ("tag='%c'", tag)); duke@435: duke@435: switch (tag) { duke@435: // These BaseType tag values are from Table 4.2 in VM spec: duke@435: case 'B': // byte duke@435: case 'C': // char duke@435: case 'D': // double duke@435: case 'F': // float duke@435: case 'I': // int duke@435: case 'J': // long duke@435: case 'S': // short duke@435: case 'Z': // boolean duke@435: duke@435: // The remaining tag values are from Table 4.8 in the 2nd-edition of duke@435: // the VM spec: duke@435: case 's': duke@435: { duke@435: // For the above tag values (including the BaseType values), duke@435: // value.const_value_index is right union field. duke@435: duke@435: if ((byte_i_ref + 2) > annotations_typeArray->length()) { duke@435: // not enough room for a const_value_index duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("length() is too small for a const_value_index")); duke@435: return false; duke@435: } duke@435: duke@435: u2 const_value_index = rewrite_cp_ref_in_annotation_data( duke@435: annotations_typeArray, byte_i_ref, duke@435: "mapped old const_value_index=%d", THREAD); duke@435: duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("const_value_index=%d", const_value_index)); duke@435: } break; duke@435: duke@435: case 'e': duke@435: { duke@435: // for the above tag value, value.enum_const_value is right union field duke@435: duke@435: if ((byte_i_ref + 4) > annotations_typeArray->length()) { duke@435: // not enough room for a enum_const_value duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("length() is too small for a enum_const_value")); duke@435: return false; duke@435: } duke@435: duke@435: u2 type_name_index = rewrite_cp_ref_in_annotation_data( duke@435: annotations_typeArray, byte_i_ref, duke@435: "mapped old type_name_index=%d", THREAD); duke@435: duke@435: u2 const_name_index = rewrite_cp_ref_in_annotation_data( duke@435: annotations_typeArray, byte_i_ref, duke@435: "mapped old const_name_index=%d", THREAD); duke@435: duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("type_name_index=%d const_name_index=%d", type_name_index, duke@435: const_name_index)); duke@435: } break; duke@435: duke@435: case 'c': duke@435: { duke@435: // for the above tag value, value.class_info_index is right union field duke@435: duke@435: if ((byte_i_ref + 2) > annotations_typeArray->length()) { duke@435: // not enough room for a class_info_index duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("length() is too small for a class_info_index")); duke@435: return false; duke@435: } duke@435: duke@435: u2 class_info_index = rewrite_cp_ref_in_annotation_data( duke@435: annotations_typeArray, byte_i_ref, duke@435: "mapped old class_info_index=%d", THREAD); duke@435: duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("class_info_index=%d", class_info_index)); duke@435: } break; duke@435: duke@435: case '@': duke@435: // For the above tag value, value.attr_value is the right union duke@435: // field. This is a nested annotation. duke@435: if (!rewrite_cp_refs_in_annotation_struct(annotations_typeArray, duke@435: byte_i_ref, THREAD)) { twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: break; duke@435: duke@435: case '[': duke@435: { duke@435: if ((byte_i_ref + 2) > annotations_typeArray->length()) { duke@435: // not enough room for a num_values field duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("length() is too small for a num_values field")); duke@435: return false; duke@435: } duke@435: duke@435: // For the above tag value, value.array_value is the right union duke@435: // field. This is an array of nested element_value. duke@435: u2 num_values = Bytes::get_Java_u2((address) coleenp@4037: annotations_typeArray->adr_at(byte_i_ref)); duke@435: byte_i_ref += 2; duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, ("num_values=%d", num_values)); duke@435: duke@435: int calc_num_values = 0; duke@435: for (; calc_num_values < num_values; calc_num_values++) { duke@435: if (!rewrite_cp_refs_in_element_value( duke@435: annotations_typeArray, byte_i_ref, THREAD)) { duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("bad nested element_value at %d", calc_num_values)); twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: } duke@435: assert(num_values == calc_num_values, "sanity check"); duke@435: } break; duke@435: duke@435: default: duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, ("bad tag=0x%x", tag)); duke@435: return false; duke@435: } // end decode tag field duke@435: duke@435: return true; duke@435: } // end rewrite_cp_refs_in_element_value() duke@435: duke@435: duke@435: // Rewrite constant pool references in a fields_annotations field. duke@435: bool VM_RedefineClasses::rewrite_cp_refs_in_fields_annotations( duke@435: instanceKlassHandle scratch_class, TRAPS) { duke@435: coleenp@4572: Array* fields_annotations = scratch_class->fields_annotations(); coleenp@4037: coleenp@4037: if (fields_annotations == NULL || fields_annotations->length() == 0) { duke@435: // no fields_annotations so nothing to do duke@435: return true; duke@435: } duke@435: duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("fields_annotations length=%d", fields_annotations->length())); duke@435: duke@435: for (int i = 0; i < fields_annotations->length(); i++) { coleenp@4037: AnnotationArray* field_annotations = fields_annotations->at(i); coleenp@4037: if (field_annotations == NULL || field_annotations->length() == 0) { duke@435: // this field does not have any annotations so skip it duke@435: continue; duke@435: } duke@435: duke@435: int byte_i = 0; // byte index into field_annotations duke@435: if (!rewrite_cp_refs_in_annotations_typeArray(field_annotations, byte_i, duke@435: THREAD)) { duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("bad field_annotations at %d", i)); twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: } duke@435: duke@435: return true; duke@435: } // end rewrite_cp_refs_in_fields_annotations() duke@435: duke@435: duke@435: // Rewrite constant pool references in a methods_annotations field. duke@435: bool VM_RedefineClasses::rewrite_cp_refs_in_methods_annotations( duke@435: instanceKlassHandle scratch_class, TRAPS) { duke@435: coleenp@4572: for (int i = 0; i < scratch_class->methods()->length(); i++) { coleenp@4572: Method* m = scratch_class->methods()->at(i); coleenp@4572: AnnotationArray* method_annotations = m->constMethod()->method_annotations(); coleenp@4572: coleenp@4037: if (method_annotations == NULL || method_annotations->length() == 0) { duke@435: // this method does not have any annotations so skip it duke@435: continue; duke@435: } duke@435: duke@435: int byte_i = 0; // byte index into method_annotations duke@435: if (!rewrite_cp_refs_in_annotations_typeArray(method_annotations, byte_i, duke@435: THREAD)) { duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("bad method_annotations at %d", i)); twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: } duke@435: duke@435: return true; duke@435: } // end rewrite_cp_refs_in_methods_annotations() duke@435: duke@435: duke@435: // Rewrite constant pool references in a methods_parameter_annotations duke@435: // field. This "structure" is adapted from the duke@435: // RuntimeVisibleParameterAnnotations_attribute described in section duke@435: // 4.8.17 of the 2nd-edition of the VM spec: duke@435: // duke@435: // methods_parameter_annotations_typeArray { duke@435: // u1 num_parameters; duke@435: // { duke@435: // u2 num_annotations; duke@435: // annotation annotations[num_annotations]; duke@435: // } parameter_annotations[num_parameters]; duke@435: // } duke@435: // duke@435: bool VM_RedefineClasses::rewrite_cp_refs_in_methods_parameter_annotations( duke@435: instanceKlassHandle scratch_class, TRAPS) { duke@435: coleenp@4572: for (int i = 0; i < scratch_class->methods()->length(); i++) { coleenp@4572: Method* m = scratch_class->methods()->at(i); coleenp@4572: AnnotationArray* method_parameter_annotations = m->constMethod()->parameter_annotations(); coleenp@4037: if (method_parameter_annotations == NULL duke@435: || method_parameter_annotations->length() == 0) { duke@435: // this method does not have any parameter annotations so skip it duke@435: continue; duke@435: } duke@435: duke@435: if (method_parameter_annotations->length() < 1) { duke@435: // not enough room for a num_parameters field duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("length() is too small for a num_parameters field at %d", i)); duke@435: return false; duke@435: } duke@435: duke@435: int byte_i = 0; // byte index into method_parameter_annotations duke@435: coleenp@4037: u1 num_parameters = method_parameter_annotations->at(byte_i); duke@435: byte_i++; duke@435: duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("num_parameters=%d", num_parameters)); duke@435: duke@435: int calc_num_parameters = 0; duke@435: for (; calc_num_parameters < num_parameters; calc_num_parameters++) { duke@435: if (!rewrite_cp_refs_in_annotations_typeArray( duke@435: method_parameter_annotations, byte_i, THREAD)) { duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("bad method_parameter_annotations at %d", calc_num_parameters)); twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: } duke@435: assert(num_parameters == calc_num_parameters, "sanity check"); duke@435: } duke@435: duke@435: return true; duke@435: } // end rewrite_cp_refs_in_methods_parameter_annotations() duke@435: duke@435: duke@435: // Rewrite constant pool references in a methods_default_annotations duke@435: // field. This "structure" is adapted from the AnnotationDefault_attribute duke@435: // that is described in section 4.8.19 of the 2nd-edition of the VM spec: duke@435: // duke@435: // methods_default_annotations_typeArray { duke@435: // element_value default_value; duke@435: // } duke@435: // duke@435: bool VM_RedefineClasses::rewrite_cp_refs_in_methods_default_annotations( duke@435: instanceKlassHandle scratch_class, TRAPS) { duke@435: coleenp@4572: for (int i = 0; i < scratch_class->methods()->length(); i++) { coleenp@4572: Method* m = scratch_class->methods()->at(i); coleenp@4572: AnnotationArray* method_default_annotations = m->constMethod()->default_annotations(); coleenp@4037: if (method_default_annotations == NULL duke@435: || method_default_annotations->length() == 0) { duke@435: // this method does not have any default annotations so skip it duke@435: continue; duke@435: } duke@435: duke@435: int byte_i = 0; // byte index into method_default_annotations duke@435: duke@435: if (!rewrite_cp_refs_in_element_value( duke@435: method_default_annotations, byte_i, THREAD)) { duke@435: RC_TRACE_WITH_THREAD(0x02000000, THREAD, duke@435: ("bad default element_value at %d", i)); twisti@1040: // propagate failure back to caller duke@435: return false; duke@435: } duke@435: } duke@435: duke@435: return true; duke@435: } // end rewrite_cp_refs_in_methods_default_annotations() duke@435: duke@435: aeriksso@7327: // Rewrite constant pool references in a class_type_annotations field. aeriksso@7327: bool VM_RedefineClasses::rewrite_cp_refs_in_class_type_annotations( aeriksso@7327: instanceKlassHandle scratch_class, TRAPS) { aeriksso@7327: aeriksso@7327: AnnotationArray* class_type_annotations = scratch_class->class_type_annotations(); aeriksso@7327: if (class_type_annotations == NULL || class_type_annotations->length() == 0) { aeriksso@7327: // no class_type_annotations so nothing to do aeriksso@7327: return true; aeriksso@7327: } aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("class_type_annotations length=%d", class_type_annotations->length())); aeriksso@7327: aeriksso@7327: int byte_i = 0; // byte index into class_type_annotations aeriksso@7327: return rewrite_cp_refs_in_type_annotations_typeArray(class_type_annotations, aeriksso@7327: byte_i, "ClassFile", THREAD); aeriksso@7327: } // end rewrite_cp_refs_in_class_type_annotations() aeriksso@7327: aeriksso@7327: aeriksso@7327: // Rewrite constant pool references in a fields_type_annotations field. aeriksso@7327: bool VM_RedefineClasses::rewrite_cp_refs_in_fields_type_annotations( aeriksso@7327: instanceKlassHandle scratch_class, TRAPS) { aeriksso@7327: aeriksso@7327: Array* fields_type_annotations = scratch_class->fields_type_annotations(); aeriksso@7327: if (fields_type_annotations == NULL || fields_type_annotations->length() == 0) { aeriksso@7327: // no fields_type_annotations so nothing to do aeriksso@7327: return true; aeriksso@7327: } aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("fields_type_annotations length=%d", fields_type_annotations->length())); aeriksso@7327: aeriksso@7327: for (int i = 0; i < fields_type_annotations->length(); i++) { aeriksso@7327: AnnotationArray* field_type_annotations = fields_type_annotations->at(i); aeriksso@7327: if (field_type_annotations == NULL || field_type_annotations->length() == 0) { aeriksso@7327: // this field does not have any annotations so skip it aeriksso@7327: continue; aeriksso@7327: } aeriksso@7327: aeriksso@7327: int byte_i = 0; // byte index into field_type_annotations aeriksso@7327: if (!rewrite_cp_refs_in_type_annotations_typeArray(field_type_annotations, aeriksso@7327: byte_i, "field_info", THREAD)) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("bad field_type_annotations at %d", i)); aeriksso@7327: // propagate failure back to caller aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: } aeriksso@7327: aeriksso@7327: return true; aeriksso@7327: } // end rewrite_cp_refs_in_fields_type_annotations() aeriksso@7327: aeriksso@7327: aeriksso@7327: // Rewrite constant pool references in a methods_type_annotations field. aeriksso@7327: bool VM_RedefineClasses::rewrite_cp_refs_in_methods_type_annotations( aeriksso@7327: instanceKlassHandle scratch_class, TRAPS) { aeriksso@7327: aeriksso@7327: for (int i = 0; i < scratch_class->methods()->length(); i++) { aeriksso@7327: Method* m = scratch_class->methods()->at(i); aeriksso@7327: AnnotationArray* method_type_annotations = m->constMethod()->type_annotations(); aeriksso@7327: aeriksso@7327: if (method_type_annotations == NULL || method_type_annotations->length() == 0) { aeriksso@7327: // this method does not have any annotations so skip it aeriksso@7327: continue; aeriksso@7327: } aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("methods type_annotations length=%d", method_type_annotations->length())); aeriksso@7327: aeriksso@7327: int byte_i = 0; // byte index into method_type_annotations aeriksso@7327: if (!rewrite_cp_refs_in_type_annotations_typeArray(method_type_annotations, aeriksso@7327: byte_i, "method_info", THREAD)) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("bad method_type_annotations at %d", i)); aeriksso@7327: // propagate failure back to caller aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: } aeriksso@7327: aeriksso@7327: return true; aeriksso@7327: } // end rewrite_cp_refs_in_methods_type_annotations() aeriksso@7327: aeriksso@7327: aeriksso@7327: // Rewrite constant pool references in a type_annotations aeriksso@7327: // field. This "structure" is adapted from the aeriksso@7327: // RuntimeVisibleTypeAnnotations_attribute described in aeriksso@7327: // section 4.7.20 of the Java SE 8 Edition of the VM spec: aeriksso@7327: // aeriksso@7327: // type_annotations_typeArray { aeriksso@7327: // u2 num_annotations; aeriksso@7327: // type_annotation annotations[num_annotations]; aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: bool VM_RedefineClasses::rewrite_cp_refs_in_type_annotations_typeArray( aeriksso@7327: AnnotationArray* type_annotations_typeArray, int &byte_i_ref, aeriksso@7327: const char * location_mesg, TRAPS) { aeriksso@7327: aeriksso@7327: if ((byte_i_ref + 2) > type_annotations_typeArray->length()) { aeriksso@7327: // not enough room for num_annotations field aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for num_annotations field")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u2 num_annotations = Bytes::get_Java_u2((address) aeriksso@7327: type_annotations_typeArray->adr_at(byte_i_ref)); aeriksso@7327: byte_i_ref += 2; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("num_type_annotations=%d", num_annotations)); aeriksso@7327: aeriksso@7327: int calc_num_annotations = 0; aeriksso@7327: for (; calc_num_annotations < num_annotations; calc_num_annotations++) { aeriksso@7327: if (!rewrite_cp_refs_in_type_annotation_struct(type_annotations_typeArray, aeriksso@7327: byte_i_ref, location_mesg, THREAD)) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("bad type_annotation_struct at %d", calc_num_annotations)); aeriksso@7327: // propagate failure back to caller aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: } aeriksso@7327: assert(num_annotations == calc_num_annotations, "sanity check"); aeriksso@7327: aeriksso@7327: if (byte_i_ref != type_annotations_typeArray->length()) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("read wrong amount of bytes at end of processing " aeriksso@7327: "type_annotations_typeArray (%d of %d bytes were read)", aeriksso@7327: byte_i_ref, type_annotations_typeArray->length())); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: return true; aeriksso@7327: } // end rewrite_cp_refs_in_type_annotations_typeArray() aeriksso@7327: aeriksso@7327: aeriksso@7327: // Rewrite constant pool references in a type_annotation aeriksso@7327: // field. This "structure" is adapted from the aeriksso@7327: // RuntimeVisibleTypeAnnotations_attribute described in aeriksso@7327: // section 4.7.20 of the Java SE 8 Edition of the VM spec: aeriksso@7327: // aeriksso@7327: // type_annotation { aeriksso@7327: // u1 target_type; aeriksso@7327: // union { aeriksso@7327: // type_parameter_target; aeriksso@7327: // supertype_target; aeriksso@7327: // type_parameter_bound_target; aeriksso@7327: // empty_target; aeriksso@7327: // method_formal_parameter_target; aeriksso@7327: // throws_target; aeriksso@7327: // localvar_target; aeriksso@7327: // catch_target; aeriksso@7327: // offset_target; aeriksso@7327: // type_argument_target; aeriksso@7327: // } target_info; aeriksso@7327: // type_path target_path; aeriksso@7327: // annotation anno; aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: bool VM_RedefineClasses::rewrite_cp_refs_in_type_annotation_struct( aeriksso@7327: AnnotationArray* type_annotations_typeArray, int &byte_i_ref, aeriksso@7327: const char * location_mesg, TRAPS) { aeriksso@7327: aeriksso@7327: if (!skip_type_annotation_target(type_annotations_typeArray, aeriksso@7327: byte_i_ref, location_mesg, THREAD)) { aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: if (!skip_type_annotation_type_path(type_annotations_typeArray, aeriksso@7327: byte_i_ref, THREAD)) { aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: if (!rewrite_cp_refs_in_annotation_struct(type_annotations_typeArray, aeriksso@7327: byte_i_ref, THREAD)) { aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: return true; aeriksso@7327: } // end rewrite_cp_refs_in_type_annotation_struct() aeriksso@7327: aeriksso@7327: aeriksso@7327: // Read, verify and skip over the target_type and target_info part aeriksso@7327: // so that rewriting can continue in the later parts of the struct. aeriksso@7327: // aeriksso@7327: // u1 target_type; aeriksso@7327: // union { aeriksso@7327: // type_parameter_target; aeriksso@7327: // supertype_target; aeriksso@7327: // type_parameter_bound_target; aeriksso@7327: // empty_target; aeriksso@7327: // method_formal_parameter_target; aeriksso@7327: // throws_target; aeriksso@7327: // localvar_target; aeriksso@7327: // catch_target; aeriksso@7327: // offset_target; aeriksso@7327: // type_argument_target; aeriksso@7327: // } target_info; aeriksso@7327: // aeriksso@7327: bool VM_RedefineClasses::skip_type_annotation_target( aeriksso@7327: AnnotationArray* type_annotations_typeArray, int &byte_i_ref, aeriksso@7327: const char * location_mesg, TRAPS) { aeriksso@7327: aeriksso@7327: if ((byte_i_ref + 1) > type_annotations_typeArray->length()) { aeriksso@7327: // not enough room for a target_type let alone the rest of a type_annotation aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a target_type")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u1 target_type = type_annotations_typeArray->at(byte_i_ref); aeriksso@7327: byte_i_ref += 1; aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, ("target_type=0x%.2x", target_type)); aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, ("location=%s", location_mesg)); aeriksso@7327: aeriksso@7327: // Skip over target_info aeriksso@7327: switch (target_type) { aeriksso@7327: case 0x00: aeriksso@7327: // kind: type parameter declaration of generic class or interface aeriksso@7327: // location: ClassFile aeriksso@7327: case 0x01: aeriksso@7327: // kind: type parameter declaration of generic method or constructor aeriksso@7327: // location: method_info aeriksso@7327: aeriksso@7327: { aeriksso@7327: // struct: aeriksso@7327: // type_parameter_target { aeriksso@7327: // u1 type_parameter_index; aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: if ((byte_i_ref + 1) > type_annotations_typeArray->length()) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a type_parameter_target")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u1 type_parameter_index = type_annotations_typeArray->at(byte_i_ref); aeriksso@7327: byte_i_ref += 1; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("type_parameter_target: type_parameter_index=%d", aeriksso@7327: type_parameter_index)); aeriksso@7327: } break; aeriksso@7327: aeriksso@7327: case 0x10: aeriksso@7327: // kind: type in extends clause of class or interface declaration aeriksso@7327: // (including the direct superclass of an anonymous class declaration), aeriksso@7327: // or in implements clause of interface declaration aeriksso@7327: // location: ClassFile aeriksso@7327: aeriksso@7327: { aeriksso@7327: // struct: aeriksso@7327: // supertype_target { aeriksso@7327: // u2 supertype_index; aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: if ((byte_i_ref + 2) > type_annotations_typeArray->length()) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a supertype_target")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u2 supertype_index = Bytes::get_Java_u2((address) aeriksso@7327: type_annotations_typeArray->adr_at(byte_i_ref)); aeriksso@7327: byte_i_ref += 2; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("supertype_target: supertype_index=%d", supertype_index)); aeriksso@7327: } break; aeriksso@7327: aeriksso@7327: case 0x11: aeriksso@7327: // kind: type in bound of type parameter declaration of generic class or interface aeriksso@7327: // location: ClassFile aeriksso@7327: case 0x12: aeriksso@7327: // kind: type in bound of type parameter declaration of generic method or constructor aeriksso@7327: // location: method_info aeriksso@7327: aeriksso@7327: { aeriksso@7327: // struct: aeriksso@7327: // type_parameter_bound_target { aeriksso@7327: // u1 type_parameter_index; aeriksso@7327: // u1 bound_index; aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: if ((byte_i_ref + 2) > type_annotations_typeArray->length()) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a type_parameter_bound_target")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u1 type_parameter_index = type_annotations_typeArray->at(byte_i_ref); aeriksso@7327: byte_i_ref += 1; aeriksso@7327: u1 bound_index = type_annotations_typeArray->at(byte_i_ref); aeriksso@7327: byte_i_ref += 1; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("type_parameter_bound_target: type_parameter_index=%d, bound_index=%d", aeriksso@7327: type_parameter_index, bound_index)); aeriksso@7327: } break; aeriksso@7327: aeriksso@7327: case 0x13: aeriksso@7327: // kind: type in field declaration aeriksso@7327: // location: field_info aeriksso@7327: case 0x14: aeriksso@7327: // kind: return type of method, or type of newly constructed object aeriksso@7327: // location: method_info aeriksso@7327: case 0x15: aeriksso@7327: // kind: receiver type of method or constructor aeriksso@7327: // location: method_info aeriksso@7327: aeriksso@7327: { aeriksso@7327: // struct: aeriksso@7327: // empty_target { aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("empty_target")); aeriksso@7327: } break; aeriksso@7327: aeriksso@7327: case 0x16: aeriksso@7327: // kind: type in formal parameter declaration of method, constructor, or lambda expression aeriksso@7327: // location: method_info aeriksso@7327: aeriksso@7327: { aeriksso@7327: // struct: aeriksso@7327: // formal_parameter_target { aeriksso@7327: // u1 formal_parameter_index; aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: if ((byte_i_ref + 1) > type_annotations_typeArray->length()) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a formal_parameter_target")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u1 formal_parameter_index = type_annotations_typeArray->at(byte_i_ref); aeriksso@7327: byte_i_ref += 1; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("formal_parameter_target: formal_parameter_index=%d", aeriksso@7327: formal_parameter_index)); aeriksso@7327: } break; aeriksso@7327: aeriksso@7327: case 0x17: aeriksso@7327: // kind: type in throws clause of method or constructor aeriksso@7327: // location: method_info aeriksso@7327: aeriksso@7327: { aeriksso@7327: // struct: aeriksso@7327: // throws_target { aeriksso@7327: // u2 throws_type_index aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: if ((byte_i_ref + 2) > type_annotations_typeArray->length()) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a throws_target")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u2 throws_type_index = Bytes::get_Java_u2((address) aeriksso@7327: type_annotations_typeArray->adr_at(byte_i_ref)); aeriksso@7327: byte_i_ref += 2; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("throws_target: throws_type_index=%d", throws_type_index)); aeriksso@7327: } break; aeriksso@7327: aeriksso@7327: case 0x40: aeriksso@7327: // kind: type in local variable declaration aeriksso@7327: // location: Code aeriksso@7327: case 0x41: aeriksso@7327: // kind: type in resource variable declaration aeriksso@7327: // location: Code aeriksso@7327: aeriksso@7327: { aeriksso@7327: // struct: aeriksso@7327: // localvar_target { aeriksso@7327: // u2 table_length; aeriksso@7327: // struct { aeriksso@7327: // u2 start_pc; aeriksso@7327: // u2 length; aeriksso@7327: // u2 index; aeriksso@7327: // } table[table_length]; aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: if ((byte_i_ref + 2) > type_annotations_typeArray->length()) { aeriksso@7327: // not enough room for a table_length let alone the rest of a localvar_target aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a localvar_target table_length")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u2 table_length = Bytes::get_Java_u2((address) aeriksso@7327: type_annotations_typeArray->adr_at(byte_i_ref)); aeriksso@7327: byte_i_ref += 2; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("localvar_target: table_length=%d", table_length)); aeriksso@7327: aeriksso@7327: int table_struct_size = 2 + 2 + 2; // 3 u2 variables per table entry aeriksso@7327: int table_size = table_length * table_struct_size; aeriksso@7327: aeriksso@7327: if ((byte_i_ref + table_size) > type_annotations_typeArray->length()) { aeriksso@7327: // not enough room for a table aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a table array of length %d", table_length)); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: // Skip over table aeriksso@7327: byte_i_ref += table_size; aeriksso@7327: } break; aeriksso@7327: aeriksso@7327: case 0x42: aeriksso@7327: // kind: type in exception parameter declaration aeriksso@7327: // location: Code aeriksso@7327: aeriksso@7327: { aeriksso@7327: // struct: aeriksso@7327: // catch_target { aeriksso@7327: // u2 exception_table_index; aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: if ((byte_i_ref + 2) > type_annotations_typeArray->length()) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a catch_target")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u2 exception_table_index = Bytes::get_Java_u2((address) aeriksso@7327: type_annotations_typeArray->adr_at(byte_i_ref)); aeriksso@7327: byte_i_ref += 2; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("catch_target: exception_table_index=%d", exception_table_index)); aeriksso@7327: } break; aeriksso@7327: aeriksso@7327: case 0x43: aeriksso@7327: // kind: type in instanceof expression aeriksso@7327: // location: Code aeriksso@7327: case 0x44: aeriksso@7327: // kind: type in new expression aeriksso@7327: // location: Code aeriksso@7327: case 0x45: aeriksso@7327: // kind: type in method reference expression using ::new aeriksso@7327: // location: Code aeriksso@7327: case 0x46: aeriksso@7327: // kind: type in method reference expression using ::Identifier aeriksso@7327: // location: Code aeriksso@7327: aeriksso@7327: { aeriksso@7327: // struct: aeriksso@7327: // offset_target { aeriksso@7327: // u2 offset; aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: if ((byte_i_ref + 2) > type_annotations_typeArray->length()) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a offset_target")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u2 offset = Bytes::get_Java_u2((address) aeriksso@7327: type_annotations_typeArray->adr_at(byte_i_ref)); aeriksso@7327: byte_i_ref += 2; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("offset_target: offset=%d", offset)); aeriksso@7327: } break; aeriksso@7327: aeriksso@7327: case 0x47: aeriksso@7327: // kind: type in cast expression aeriksso@7327: // location: Code aeriksso@7327: case 0x48: aeriksso@7327: // kind: type argument for generic constructor in new expression or aeriksso@7327: // explicit constructor invocation statement aeriksso@7327: // location: Code aeriksso@7327: case 0x49: aeriksso@7327: // kind: type argument for generic method in method invocation expression aeriksso@7327: // location: Code aeriksso@7327: case 0x4A: aeriksso@7327: // kind: type argument for generic constructor in method reference expression using ::new aeriksso@7327: // location: Code aeriksso@7327: case 0x4B: aeriksso@7327: // kind: type argument for generic method in method reference expression using ::Identifier aeriksso@7327: // location: Code aeriksso@7327: aeriksso@7327: { aeriksso@7327: // struct: aeriksso@7327: // type_argument_target { aeriksso@7327: // u2 offset; aeriksso@7327: // u1 type_argument_index; aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: if ((byte_i_ref + 3) > type_annotations_typeArray->length()) { aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a type_argument_target")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u2 offset = Bytes::get_Java_u2((address) aeriksso@7327: type_annotations_typeArray->adr_at(byte_i_ref)); aeriksso@7327: byte_i_ref += 2; aeriksso@7327: u1 type_argument_index = type_annotations_typeArray->at(byte_i_ref); aeriksso@7327: byte_i_ref += 1; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("type_argument_target: offset=%d, type_argument_index=%d", aeriksso@7327: offset, type_argument_index)); aeriksso@7327: } break; aeriksso@7327: aeriksso@7327: default: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("unknown target_type")); aeriksso@7327: #ifdef ASSERT aeriksso@7327: ShouldNotReachHere(); aeriksso@7327: #endif aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: return true; aeriksso@7327: } // end skip_type_annotation_target() aeriksso@7327: aeriksso@7327: aeriksso@7327: // Read, verify and skip over the type_path part so that rewriting aeriksso@7327: // can continue in the later parts of the struct. aeriksso@7327: // aeriksso@7327: // type_path { aeriksso@7327: // u1 path_length; aeriksso@7327: // { aeriksso@7327: // u1 type_path_kind; aeriksso@7327: // u1 type_argument_index; aeriksso@7327: // } path[path_length]; aeriksso@7327: // } aeriksso@7327: // aeriksso@7327: bool VM_RedefineClasses::skip_type_annotation_type_path( aeriksso@7327: AnnotationArray* type_annotations_typeArray, int &byte_i_ref, TRAPS) { aeriksso@7327: aeriksso@7327: if ((byte_i_ref + 1) > type_annotations_typeArray->length()) { aeriksso@7327: // not enough room for a path_length let alone the rest of the type_path aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for a type_path")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u1 path_length = type_annotations_typeArray->at(byte_i_ref); aeriksso@7327: byte_i_ref += 1; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("type_path: path_length=%d", path_length)); aeriksso@7327: aeriksso@7327: int calc_path_length = 0; aeriksso@7327: for (; calc_path_length < path_length; calc_path_length++) { aeriksso@7327: if ((byte_i_ref + 1 + 1) > type_annotations_typeArray->length()) { aeriksso@7327: // not enough room for a path aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("length() is too small for path entry %d of %d", aeriksso@7327: calc_path_length, path_length)); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: aeriksso@7327: u1 type_path_kind = type_annotations_typeArray->at(byte_i_ref); aeriksso@7327: byte_i_ref += 1; aeriksso@7327: u1 type_argument_index = type_annotations_typeArray->at(byte_i_ref); aeriksso@7327: byte_i_ref += 1; aeriksso@7327: aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("type_path: path[%d]: type_path_kind=%d, type_argument_index=%d", aeriksso@7327: calc_path_length, type_path_kind, type_argument_index)); aeriksso@7327: aeriksso@7327: if (type_path_kind > 3 || (type_path_kind != 3 && type_argument_index != 0)) { aeriksso@7327: // not enough room for a path aeriksso@7327: RC_TRACE_WITH_THREAD(0x02000000, THREAD, aeriksso@7327: ("inconsistent type_path values")); aeriksso@7327: return false; aeriksso@7327: } aeriksso@7327: } aeriksso@7327: assert(path_length == calc_path_length, "sanity check"); aeriksso@7327: aeriksso@7327: return true; aeriksso@7327: } // end skip_type_annotation_type_path() aeriksso@7327: aeriksso@7327: duke@435: // Rewrite constant pool references in the method's stackmap table. duke@435: // These "structures" are adapted from the StackMapTable_attribute that duke@435: // is described in section 4.8.4 of the 6.0 version of the VM spec duke@435: // (dated 2005.10.26): duke@435: // file:///net/quincunx.sfbay/export/gbracha/ClassFile-Java6.pdf duke@435: // duke@435: // stack_map { duke@435: // u2 number_of_entries; duke@435: // stack_map_frame entries[number_of_entries]; duke@435: // } duke@435: // duke@435: void VM_RedefineClasses::rewrite_cp_refs_in_stack_map_table( duke@435: methodHandle method, TRAPS) { duke@435: duke@435: if (!method->has_stackmap_table()) { duke@435: return; duke@435: } duke@435: coleenp@4037: AnnotationArray* stackmap_data = method->stackmap_data(); coleenp@4037: address stackmap_p = (address)stackmap_data->adr_at(0); duke@435: address stackmap_end = stackmap_p + stackmap_data->length(); duke@435: duke@435: assert(stackmap_p + 2 <= stackmap_end, "no room for number_of_entries"); duke@435: u2 number_of_entries = Bytes::get_Java_u2(stackmap_p); duke@435: stackmap_p += 2; duke@435: duke@435: RC_TRACE_WITH_THREAD(0x04000000, THREAD, duke@435: ("number_of_entries=%u", number_of_entries)); duke@435: duke@435: // walk through each stack_map_frame duke@435: u2 calc_number_of_entries = 0; duke@435: for (; calc_number_of_entries < number_of_entries; calc_number_of_entries++) { duke@435: // The stack_map_frame structure is a u1 frame_type followed by duke@435: // 0 or more bytes of data: duke@435: // duke@435: // union stack_map_frame { duke@435: // same_frame; duke@435: // same_locals_1_stack_item_frame; duke@435: // same_locals_1_stack_item_frame_extended; duke@435: // chop_frame; duke@435: // same_frame_extended; duke@435: // append_frame; duke@435: // full_frame; duke@435: // } duke@435: duke@435: assert(stackmap_p + 1 <= stackmap_end, "no room for frame_type"); duke@435: // The Linux compiler does not like frame_type to be u1 or u2. It duke@435: // issues the following warning for the first if-statement below: duke@435: // duke@435: // "warning: comparison is always true due to limited range of data type" duke@435: // duke@435: u4 frame_type = *stackmap_p; duke@435: stackmap_p++; duke@435: duke@435: // same_frame { duke@435: // u1 frame_type = SAME; /* 0-63 */ duke@435: // } duke@435: if (frame_type >= 0 && frame_type <= 63) { duke@435: // nothing more to do for same_frame duke@435: } duke@435: duke@435: // same_locals_1_stack_item_frame { duke@435: // u1 frame_type = SAME_LOCALS_1_STACK_ITEM; /* 64-127 */ duke@435: // verification_type_info stack[1]; duke@435: // } duke@435: else if (frame_type >= 64 && frame_type <= 127) { duke@435: rewrite_cp_refs_in_verification_type_info(stackmap_p, stackmap_end, duke@435: calc_number_of_entries, frame_type, THREAD); duke@435: } duke@435: duke@435: // reserved for future use duke@435: else if (frame_type >= 128 && frame_type <= 246) { duke@435: // nothing more to do for reserved frame_types duke@435: } duke@435: duke@435: // same_locals_1_stack_item_frame_extended { duke@435: // u1 frame_type = SAME_LOCALS_1_STACK_ITEM_EXTENDED; /* 247 */ duke@435: // u2 offset_delta; duke@435: // verification_type_info stack[1]; duke@435: // } duke@435: else if (frame_type == 247) { duke@435: stackmap_p += 2; duke@435: rewrite_cp_refs_in_verification_type_info(stackmap_p, stackmap_end, duke@435: calc_number_of_entries, frame_type, THREAD); duke@435: } duke@435: duke@435: // chop_frame { duke@435: // u1 frame_type = CHOP; /* 248-250 */ duke@435: // u2 offset_delta; duke@435: // } duke@435: else if (frame_type >= 248 && frame_type <= 250) { duke@435: stackmap_p += 2; duke@435: } duke@435: duke@435: // same_frame_extended { duke@435: // u1 frame_type = SAME_FRAME_EXTENDED; /* 251*/ duke@435: // u2 offset_delta; duke@435: // } duke@435: else if (frame_type == 251) { duke@435: stackmap_p += 2; duke@435: } duke@435: duke@435: // append_frame { duke@435: // u1 frame_type = APPEND; /* 252-254 */ duke@435: // u2 offset_delta; duke@435: // verification_type_info locals[frame_type - 251]; duke@435: // } duke@435: else if (frame_type >= 252 && frame_type <= 254) { duke@435: assert(stackmap_p + 2 <= stackmap_end, duke@435: "no room for offset_delta"); duke@435: stackmap_p += 2; duke@435: u1 len = frame_type - 251; duke@435: for (u1 i = 0; i < len; i++) { duke@435: rewrite_cp_refs_in_verification_type_info(stackmap_p, stackmap_end, duke@435: calc_number_of_entries, frame_type, THREAD); duke@435: } duke@435: } duke@435: duke@435: // full_frame { duke@435: // u1 frame_type = FULL_FRAME; /* 255 */ duke@435: // u2 offset_delta; duke@435: // u2 number_of_locals; duke@435: // verification_type_info locals[number_of_locals]; duke@435: // u2 number_of_stack_items; duke@435: // verification_type_info stack[number_of_stack_items]; duke@435: // } duke@435: else if (frame_type == 255) { duke@435: assert(stackmap_p + 2 + 2 <= stackmap_end, duke@435: "no room for smallest full_frame"); duke@435: stackmap_p += 2; duke@435: duke@435: u2 number_of_locals = Bytes::get_Java_u2(stackmap_p); duke@435: stackmap_p += 2; duke@435: duke@435: for (u2 locals_i = 0; locals_i < number_of_locals; locals_i++) { duke@435: rewrite_cp_refs_in_verification_type_info(stackmap_p, stackmap_end, duke@435: calc_number_of_entries, frame_type, THREAD); duke@435: } duke@435: duke@435: // Use the largest size for the number_of_stack_items, but only get duke@435: // the right number of bytes. duke@435: u2 number_of_stack_items = Bytes::get_Java_u2(stackmap_p); duke@435: stackmap_p += 2; duke@435: duke@435: for (u2 stack_i = 0; stack_i < number_of_stack_items; stack_i++) { duke@435: rewrite_cp_refs_in_verification_type_info(stackmap_p, stackmap_end, duke@435: calc_number_of_entries, frame_type, THREAD); duke@435: } duke@435: } duke@435: } // end while there is a stack_map_frame duke@435: assert(number_of_entries == calc_number_of_entries, "sanity check"); duke@435: } // end rewrite_cp_refs_in_stack_map_table() duke@435: duke@435: duke@435: // Rewrite constant pool references in the verification type info duke@435: // portion of the method's stackmap table. These "structures" are duke@435: // adapted from the StackMapTable_attribute that is described in duke@435: // section 4.8.4 of the 6.0 version of the VM spec (dated 2005.10.26): duke@435: // file:///net/quincunx.sfbay/export/gbracha/ClassFile-Java6.pdf duke@435: // duke@435: // The verification_type_info structure is a u1 tag followed by 0 or duke@435: // more bytes of data: duke@435: // duke@435: // union verification_type_info { duke@435: // Top_variable_info; duke@435: // Integer_variable_info; duke@435: // Float_variable_info; duke@435: // Long_variable_info; duke@435: // Double_variable_info; duke@435: // Null_variable_info; duke@435: // UninitializedThis_variable_info; duke@435: // Object_variable_info; duke@435: // Uninitialized_variable_info; duke@435: // } duke@435: // duke@435: void VM_RedefineClasses::rewrite_cp_refs_in_verification_type_info( duke@435: address& stackmap_p_ref, address stackmap_end, u2 frame_i, duke@435: u1 frame_type, TRAPS) { duke@435: duke@435: assert(stackmap_p_ref + 1 <= stackmap_end, "no room for tag"); duke@435: u1 tag = *stackmap_p_ref; duke@435: stackmap_p_ref++; duke@435: duke@435: switch (tag) { duke@435: // Top_variable_info { duke@435: // u1 tag = ITEM_Top; /* 0 */ duke@435: // } duke@435: // verificationType.hpp has zero as ITEM_Bogus instead of ITEM_Top duke@435: case 0: // fall through duke@435: duke@435: // Integer_variable_info { duke@435: // u1 tag = ITEM_Integer; /* 1 */ duke@435: // } duke@435: case ITEM_Integer: // fall through duke@435: duke@435: // Float_variable_info { duke@435: // u1 tag = ITEM_Float; /* 2 */ duke@435: // } duke@435: case ITEM_Float: // fall through duke@435: duke@435: // Double_variable_info { duke@435: // u1 tag = ITEM_Double; /* 3 */ duke@435: // } duke@435: case ITEM_Double: // fall through duke@435: duke@435: // Long_variable_info { duke@435: // u1 tag = ITEM_Long; /* 4 */ duke@435: // } duke@435: case ITEM_Long: // fall through duke@435: duke@435: // Null_variable_info { duke@435: // u1 tag = ITEM_Null; /* 5 */ duke@435: // } duke@435: case ITEM_Null: // fall through duke@435: duke@435: // UninitializedThis_variable_info { duke@435: // u1 tag = ITEM_UninitializedThis; /* 6 */ duke@435: // } duke@435: case ITEM_UninitializedThis: duke@435: // nothing more to do for the above tag types duke@435: break; duke@435: duke@435: // Object_variable_info { duke@435: // u1 tag = ITEM_Object; /* 7 */ duke@435: // u2 cpool_index; duke@435: // } duke@435: case ITEM_Object: duke@435: { duke@435: assert(stackmap_p_ref + 2 <= stackmap_end, "no room for cpool_index"); duke@435: u2 cpool_index = Bytes::get_Java_u2(stackmap_p_ref); duke@435: u2 new_cp_index = find_new_index(cpool_index); duke@435: if (new_cp_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x04000000, THREAD, duke@435: ("mapped old cpool_index=%d", cpool_index)); duke@435: Bytes::put_Java_u2(stackmap_p_ref, new_cp_index); duke@435: cpool_index = new_cp_index; duke@435: } duke@435: stackmap_p_ref += 2; duke@435: duke@435: RC_TRACE_WITH_THREAD(0x04000000, THREAD, duke@435: ("frame_i=%u, frame_type=%u, cpool_index=%d", frame_i, duke@435: frame_type, cpool_index)); duke@435: } break; duke@435: duke@435: // Uninitialized_variable_info { duke@435: // u1 tag = ITEM_Uninitialized; /* 8 */ duke@435: // u2 offset; duke@435: // } duke@435: case ITEM_Uninitialized: duke@435: assert(stackmap_p_ref + 2 <= stackmap_end, "no room for offset"); duke@435: stackmap_p_ref += 2; duke@435: break; duke@435: duke@435: default: duke@435: RC_TRACE_WITH_THREAD(0x04000000, THREAD, duke@435: ("frame_i=%u, frame_type=%u, bad tag=0x%x", frame_i, frame_type, tag)); duke@435: ShouldNotReachHere(); duke@435: break; duke@435: } // end switch (tag) duke@435: } // end rewrite_cp_refs_in_verification_type_info() duke@435: duke@435: duke@435: // Change the constant pool associated with klass scratch_class to duke@435: // scratch_cp. If shrink is true, then scratch_cp_length elements duke@435: // are copied from scratch_cp to a smaller constant pool and the duke@435: // smaller constant pool is associated with scratch_class. duke@435: void VM_RedefineClasses::set_new_constant_pool( coleenp@4037: ClassLoaderData* loader_data, duke@435: instanceKlassHandle scratch_class, constantPoolHandle scratch_cp, coleenp@4037: int scratch_cp_length, TRAPS) { coleenp@4037: assert(scratch_cp->length() >= scratch_cp_length, "sanity check"); coleenp@4037: coleenp@4466: // scratch_cp is a merged constant pool and has enough space for a coleenp@4466: // worst case merge situation. We want to associate the minimum coleenp@4466: // sized constant pool with the klass to save space. sspitsyn@5676: ConstantPool* cp = ConstantPool::allocate(loader_data, scratch_cp_length, CHECK); sspitsyn@5676: constantPoolHandle smaller_cp(THREAD, cp); coleenp@4466: coleenp@4466: // preserve version() value in the smaller copy coleenp@4466: int version = scratch_cp->version(); coleenp@4466: assert(version != 0, "sanity check"); coleenp@4466: smaller_cp->set_version(version); coleenp@4466: sspitsyn@4493: // attach klass to new constant pool sspitsyn@4493: // reference to the cp holder is needed for copy_operands() sspitsyn@4493: smaller_cp->set_pool_holder(scratch_class()); sspitsyn@4493: coleenp@4466: scratch_cp->copy_cp_to(1, scratch_cp_length - 1, smaller_cp, 1, THREAD); sspitsyn@5676: if (HAS_PENDING_EXCEPTION) { sspitsyn@5676: // Exception is handled in the caller sspitsyn@5676: loader_data->add_to_deallocate_list(smaller_cp()); sspitsyn@5676: return; sspitsyn@5676: } coleenp@4466: scratch_cp = smaller_cp; duke@435: duke@435: // attach new constant pool to klass duke@435: scratch_class->set_constants(scratch_cp()); duke@435: duke@435: int i; // for portability duke@435: duke@435: // update each field in klass to use new constant pool indices as needed never@3137: for (JavaFieldStream fs(scratch_class); !fs.done(); fs.next()) { never@3137: jshort cur_index = fs.name_index(); duke@435: jshort new_index = find_new_index(cur_index); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("field-name_index change: %d to %d", cur_index, new_index)); never@3137: fs.set_name_index(new_index); duke@435: } never@3137: cur_index = fs.signature_index(); duke@435: new_index = find_new_index(cur_index); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("field-signature_index change: %d to %d", cur_index, new_index)); never@3137: fs.set_signature_index(new_index); duke@435: } never@3137: cur_index = fs.initval_index(); duke@435: new_index = find_new_index(cur_index); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("field-initval_index change: %d to %d", cur_index, new_index)); never@3137: fs.set_initval_index(new_index); duke@435: } never@3137: cur_index = fs.generic_signature_index(); duke@435: new_index = find_new_index(cur_index); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("field-generic_signature change: %d to %d", cur_index, new_index)); never@3137: fs.set_generic_signature_index(new_index); duke@435: } duke@435: } // end for each field duke@435: duke@435: // Update constant pool indices in the inner classes info to use duke@435: // new constant indices as needed. The inner classes info is a duke@435: // quadruple: duke@435: // (inner_class_info, outer_class_info, inner_name, inner_access_flags) jiangli@3670: InnerClassesIterator iter(scratch_class); jiangli@3670: for (; !iter.done(); iter.next()) { jiangli@3670: int cur_index = iter.inner_class_info_index(); jiangli@3670: if (cur_index == 0) { jiangli@3670: continue; // JVM spec. allows null inner class refs so skip it jiangli@3670: } jiangli@3670: int new_index = find_new_index(cur_index); jiangli@3670: if (new_index != 0) { jiangli@3670: RC_TRACE_WITH_THREAD(0x00080000, THREAD, jiangli@3670: ("inner_class_info change: %d to %d", cur_index, new_index)); jiangli@3670: iter.set_inner_class_info_index(new_index); jiangli@3670: } jiangli@3670: cur_index = iter.outer_class_info_index(); jiangli@3670: new_index = find_new_index(cur_index); jiangli@3670: if (new_index != 0) { jiangli@3670: RC_TRACE_WITH_THREAD(0x00080000, THREAD, jiangli@3670: ("outer_class_info change: %d to %d", cur_index, new_index)); jiangli@3670: iter.set_outer_class_info_index(new_index); jiangli@3670: } jiangli@3670: cur_index = iter.inner_name_index(); jiangli@3670: new_index = find_new_index(cur_index); jiangli@3670: if (new_index != 0) { jiangli@3670: RC_TRACE_WITH_THREAD(0x00080000, THREAD, jiangli@3670: ("inner_name change: %d to %d", cur_index, new_index)); jiangli@3670: iter.set_inner_name_index(new_index); jiangli@3670: } jiangli@3670: } // end for each inner class duke@435: duke@435: // Attach each method in klass to the new constant pool and update duke@435: // to use new constant pool indices as needed: coleenp@4037: Array* methods = scratch_class->methods(); duke@435: for (i = methods->length() - 1; i >= 0; i--) { coleenp@4037: methodHandle method(THREAD, methods->at(i)); duke@435: method->set_constants(scratch_cp()); duke@435: duke@435: int new_index = find_new_index(method->name_index()); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("method-name_index change: %d to %d", method->name_index(), duke@435: new_index)); duke@435: method->set_name_index(new_index); duke@435: } duke@435: new_index = find_new_index(method->signature_index()); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("method-signature_index change: %d to %d", duke@435: method->signature_index(), new_index)); duke@435: method->set_signature_index(new_index); duke@435: } duke@435: new_index = find_new_index(method->generic_signature_index()); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("method-generic_signature_index change: %d to %d", duke@435: method->generic_signature_index(), new_index)); duke@435: method->set_generic_signature_index(new_index); duke@435: } duke@435: duke@435: // Update constant pool indices in the method's checked exception duke@435: // table to use new constant indices as needed. duke@435: int cext_length = method->checked_exceptions_length(); duke@435: if (cext_length > 0) { duke@435: CheckedExceptionElement * cext_table = duke@435: method->checked_exceptions_start(); duke@435: for (int j = 0; j < cext_length; j++) { duke@435: int cur_index = cext_table[j].class_cp_index; duke@435: int new_index = find_new_index(cur_index); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("cext-class_cp_index change: %d to %d", cur_index, new_index)); duke@435: cext_table[j].class_cp_index = (u2)new_index; duke@435: } duke@435: } // end for each checked exception table entry duke@435: } // end if there are checked exception table entries duke@435: duke@435: // Update each catch type index in the method's exception table duke@435: // to use new constant pool indices as needed. The exception table duke@435: // holds quadruple entries of the form: duke@435: // (beg_bci, end_bci, handler_bci, klass_index) jiangli@3917: jiangli@3917: ExceptionTable ex_table(method()); jiangli@3917: int ext_length = ex_table.length(); jiangli@3917: jiangli@3917: for (int j = 0; j < ext_length; j ++) { jiangli@3917: int cur_index = ex_table.catch_type_index(j); duke@435: int new_index = find_new_index(cur_index); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("ext-klass_index change: %d to %d", cur_index, new_index)); jiangli@3917: ex_table.set_catch_type_index(j, new_index); duke@435: } duke@435: } // end for each exception table entry duke@435: duke@435: // Update constant pool indices in the method's local variable duke@435: // table to use new constant indices as needed. The local variable duke@435: // table hold sextuple entries of the form: duke@435: // (start_pc, length, name_index, descriptor_index, signature_index, slot) duke@435: int lvt_length = method->localvariable_table_length(); duke@435: if (lvt_length > 0) { duke@435: LocalVariableTableElement * lv_table = duke@435: method->localvariable_table_start(); duke@435: for (int j = 0; j < lvt_length; j++) { duke@435: int cur_index = lv_table[j].name_cp_index; duke@435: int new_index = find_new_index(cur_index); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("lvt-name_cp_index change: %d to %d", cur_index, new_index)); duke@435: lv_table[j].name_cp_index = (u2)new_index; duke@435: } duke@435: cur_index = lv_table[j].descriptor_cp_index; duke@435: new_index = find_new_index(cur_index); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("lvt-descriptor_cp_index change: %d to %d", cur_index, duke@435: new_index)); duke@435: lv_table[j].descriptor_cp_index = (u2)new_index; duke@435: } duke@435: cur_index = lv_table[j].signature_cp_index; duke@435: new_index = find_new_index(cur_index); duke@435: if (new_index != 0) { duke@435: RC_TRACE_WITH_THREAD(0x00080000, THREAD, duke@435: ("lvt-signature_cp_index change: %d to %d", cur_index, new_index)); duke@435: lv_table[j].signature_cp_index = (u2)new_index; duke@435: } duke@435: } // end for each local variable table entry duke@435: } // end if there are local variable table entries duke@435: duke@435: rewrite_cp_refs_in_stack_map_table(method, THREAD); duke@435: } // end for each method duke@435: } // end set_new_constant_pool() duke@435: duke@435: duke@435: // Unevolving classes may point to methods of the_class directly duke@435: // from their constant pool caches, itables, and/or vtables. We coleenp@5100: // use the ClassLoaderDataGraph::classes_do() facility and this helper duke@435: // to fix up these pointers. coleenp@5100: coleenp@5100: // Adjust cpools and vtables closure coleenp@5100: void VM_RedefineClasses::AdjustCpoolCacheAndVtable::do_klass(Klass* k) { coleenp@5100: coleenp@5100: // This is a very busy routine. We don't want too much tracing coleenp@5100: // printed out. coleenp@5100: bool trace_name_printed = false; sspitsyn@7636: InstanceKlass *the_class = InstanceKlass::cast(_the_class_oop); coleenp@5100: coleenp@5100: // Very noisy: only enable this call if you are trying to determine coleenp@5100: // that a specific class gets found by this routine. coleenp@5100: // RC_TRACE macro has an embedded ResourceMark coleenp@5100: // RC_TRACE_WITH_THREAD(0x00100000, THREAD, coleenp@5100: // ("adjust check: name=%s", k->external_name())); coleenp@5100: // trace_name_printed = true; coleenp@5100: coleenp@5100: // If the class being redefined is java.lang.Object, we need to fix all coleenp@5100: // array class vtables also coleenp@5100: if (k->oop_is_array() && _the_class_oop == SystemDictionary::Object_klass()) { sspitsyn@7636: k->vtable()->adjust_method_entries(the_class, &trace_name_printed); sspitsyn@7636: coleenp@5100: } else if (k->oop_is_instance()) { coleenp@5100: HandleMark hm(_thread); coleenp@5100: InstanceKlass *ik = InstanceKlass::cast(k); duke@435: duke@435: // HotSpot specific optimization! HotSpot does not currently duke@435: // support delegation from the bootstrap class loader to a duke@435: // user-defined class loader. This means that if the bootstrap duke@435: // class loader is the initiating class loader, then it will also duke@435: // be the defining class loader. This also means that classes duke@435: // loaded by the bootstrap class loader cannot refer to classes duke@435: // loaded by a user-defined class loader. Note: a user-defined duke@435: // class loader can delegate to the bootstrap class loader. duke@435: // duke@435: // If the current class being redefined has a user-defined class duke@435: // loader as its defining class loader, then we can skip all duke@435: // classes loaded by the bootstrap class loader. duke@435: bool is_user_defined = coleenp@4037: InstanceKlass::cast(_the_class_oop)->class_loader() != NULL; duke@435: if (is_user_defined && ik->class_loader() == NULL) { duke@435: return; duke@435: } duke@435: duke@435: // Fix the vtable embedded in the_class and subclasses of the_class, duke@435: // if one exists. We discard scratch_class and we don't keep an coleenp@4037: // InstanceKlass around to hold obsolete methods so we don't have coleenp@4037: // any other InstanceKlass embedded vtables to update. The vtable coleenp@4037: // holds the Method*s for virtual (but not final) methods. acorn@5848: // Default methods, or concrete methods in interfaces are stored acorn@5848: // in the vtable, so if an interface changes we need to check acorn@5848: // adjust_method_entries() for every InstanceKlass, which will also acorn@5848: // adjust the default method vtable indices. acorn@5848: // We also need to adjust any default method entries that are acorn@5848: // not yet in the vtable, because the vtable setup is in progress. acorn@5848: // This must be done after we adjust the default_methods and acorn@5848: // default_vtable_indices for methods already in the vtable. acorn@5848: if (ik->vtable_length() > 0 && (_the_class_oop->is_interface() acorn@5848: || ik->is_subtype_of(_the_class_oop))) { duke@435: // ik->vtable() creates a wrapper object; rm cleans it up coleenp@5100: ResourceMark rm(_thread); sspitsyn@7636: sspitsyn@7636: ik->vtable()->adjust_method_entries(the_class, &trace_name_printed); sspitsyn@7636: ik->adjust_default_methods(the_class, &trace_name_printed); duke@435: } duke@435: duke@435: // If the current class has an itable and we are either redefining an duke@435: // interface or if the current class is a subclass of the_class, then duke@435: // we potentially have to fix the itable. If we are redefining an duke@435: // interface, then we have to call adjust_method_entries() for coleenp@4037: // every InstanceKlass that has an itable since there isn't a coleenp@4037: // subclass relationship between an interface and an InstanceKlass. hseigel@4278: if (ik->itable_length() > 0 && (_the_class_oop->is_interface() duke@435: || ik->is_subclass_of(_the_class_oop))) { duke@435: // ik->itable() creates a wrapper object; rm cleans it up coleenp@5100: ResourceMark rm(_thread); sspitsyn@7636: sspitsyn@7636: ik->itable()->adjust_method_entries(the_class, &trace_name_printed); duke@435: } duke@435: duke@435: // The constant pools in other classes (other_cp) can refer to duke@435: // methods in the_class. We have to update method information in duke@435: // other_cp's cache. If other_cp has a previous version, then we duke@435: // have to repeat the process for each previous version. The coleenp@4037: // constant pool cache holds the Method*s for non-virtual duke@435: // methods and for virtual, final methods. duke@435: // duke@435: // Special case: if the current class is the_class, then new_cp duke@435: // has already been attached to the_class and old_cp has already duke@435: // been added as a previous version. The new_cp doesn't have any duke@435: // cached references to old methods so it doesn't need to be duke@435: // updated. We can simply start with the previous version(s) in duke@435: // that case. duke@435: constantPoolHandle other_cp; coleenp@4037: ConstantPoolCache* cp_cache; duke@435: coleenp@5100: if (ik != _the_class_oop) { duke@435: // this klass' constant pool cache may need adjustment duke@435: other_cp = constantPoolHandle(ik->constants()); duke@435: cp_cache = other_cp->cache(); duke@435: if (cp_cache != NULL) { sspitsyn@7636: cp_cache->adjust_method_entries(the_class, &trace_name_printed); duke@435: } duke@435: } coleenp@5749: coleenp@5749: // the previous versions' constant pool caches may need adjustment coleenp@5749: PreviousVersionWalker pvw(_thread, ik); coleenp@5749: for (PreviousVersionNode * pv_node = pvw.next_previous_version(); coleenp@5749: pv_node != NULL; pv_node = pvw.next_previous_version()) { coleenp@5749: other_cp = pv_node->prev_constant_pool(); coleenp@5749: cp_cache = other_cp->cache(); coleenp@5749: if (cp_cache != NULL) { coleenp@5749: cp_cache->adjust_method_entries(_matching_old_methods, coleenp@5749: _matching_new_methods, coleenp@5749: _matching_methods_length, coleenp@5749: &trace_name_printed); coleenp@5749: } coleenp@5749: } duke@435: } duke@435: } duke@435: duke@435: void VM_RedefineClasses::update_jmethod_ids() { duke@435: for (int j = 0; j < _matching_methods_length; ++j) { coleenp@4037: Method* old_method = _matching_old_methods[j]; duke@435: jmethodID jmid = old_method->find_jmethod_id_or_null(); duke@435: if (jmid != NULL) { duke@435: // There is a jmethodID, change it to point to the new method duke@435: methodHandle new_method_h(_matching_new_methods[j]); coleenp@4037: Method::change_method_associated_with_jmethod_id(jmid, new_method_h()); coleenp@4037: assert(Method::resolve_jmethod_id(jmid) == _matching_new_methods[j], duke@435: "should be replaced"); duke@435: } duke@435: } duke@435: } duke@435: duke@435: void VM_RedefineClasses::check_methods_and_mark_as_obsolete( duke@435: BitMap *emcp_methods, int * emcp_method_count_p) { duke@435: *emcp_method_count_p = 0; duke@435: int obsolete_count = 0; duke@435: int old_index = 0; duke@435: for (int j = 0; j < _matching_methods_length; ++j, ++old_index) { coleenp@4037: Method* old_method = _matching_old_methods[j]; coleenp@4037: Method* new_method = _matching_new_methods[j]; coleenp@4037: Method* old_array_method; duke@435: duke@435: // Maintain an old_index into the _old_methods array by skipping duke@435: // deleted methods coleenp@4037: while ((old_array_method = _old_methods->at(old_index)) != old_method) { duke@435: ++old_index; duke@435: } duke@435: duke@435: if (MethodComparator::methods_EMCP(old_method, new_method)) { duke@435: // The EMCP definition from JSR-163 requires the bytecodes to be duke@435: // the same with the exception of constant pool indices which may duke@435: // differ. However, the constants referred to by those indices duke@435: // must be the same. duke@435: // duke@435: // We use methods_EMCP() for comparison since constant pool duke@435: // merging can remove duplicate constant pool entries that were duke@435: // present in the old method and removed from the rewritten new duke@435: // method. A faster binary comparison function would consider the duke@435: // old and new methods to be different when they are actually duke@435: // EMCP. duke@435: // duke@435: // The old and new methods are EMCP and you would think that we duke@435: // could get rid of one of them here and now and save some space. duke@435: // However, the concept of EMCP only considers the bytecodes and duke@435: // the constant pool entries in the comparison. Other things, duke@435: // e.g., the line number table (LNT) or the local variable table duke@435: // (LVT) don't count in the comparison. So the new (and EMCP) duke@435: // method can have a new LNT that we need so we can't just duke@435: // overwrite the new method with the old method. duke@435: // duke@435: // When this routine is called, we have already attached the new duke@435: // methods to the_class so the old methods are effectively duke@435: // overwritten. However, if an old method is still executing, duke@435: // then the old method cannot be collected until sometime after duke@435: // the old method call has returned. So the overwriting of old duke@435: // methods by new methods will save us space except for those duke@435: // (hopefully few) old methods that are still executing. duke@435: // coleenp@4037: // A method refers to a ConstMethod* and this presents another coleenp@4037: // possible avenue to space savings. The ConstMethod* in the duke@435: // new method contains possibly new attributes (LNT, LVT, etc). duke@435: // At first glance, it seems possible to save space by replacing coleenp@4037: // the ConstMethod* in the old method with the ConstMethod* duke@435: // from the new method. The old and new methods would share the coleenp@4037: // same ConstMethod* and we would save the space occupied by coleenp@4037: // the old ConstMethod*. However, the ConstMethod* contains duke@435: // a back reference to the containing method. Sharing the coleenp@4037: // ConstMethod* between two methods could lead to confusion in duke@435: // the code that uses the back reference. This would lead to duke@435: // brittle code that could be broken in non-obvious ways now or duke@435: // in the future. duke@435: // coleenp@4037: // Another possibility is to copy the ConstMethod* from the new duke@435: // method to the old method and then overwrite the new method with coleenp@4037: // the old method. Since the ConstMethod* contains the bytecodes duke@435: // for the method embedded in the oop, this option would change duke@435: // the bytecodes out from under any threads executing the old duke@435: // method and make the thread's bcp invalid. Since EMCP requires duke@435: // that the bytecodes be the same modulo constant pool indices, it duke@435: // is straight forward to compute the correct new bcp in the new coleenp@4037: // ConstMethod* from the old bcp in the old ConstMethod*. The duke@435: // time consuming part would be searching all the frames in all duke@435: // of the threads to find all of the calls to the old method. duke@435: // duke@435: // It looks like we will have to live with the limited savings duke@435: // that we get from effectively overwriting the old methods duke@435: // when the new methods are attached to the_class. duke@435: duke@435: // track which methods are EMCP for add_previous_version() call duke@435: emcp_methods->set_bit(old_index); duke@435: (*emcp_method_count_p)++; duke@435: duke@435: // An EMCP method is _not_ obsolete. An obsolete method has a duke@435: // different jmethodID than the current method. An EMCP method duke@435: // has the same jmethodID as the current method. Having the duke@435: // same jmethodID for all EMCP versions of a method allows for duke@435: // a consistent view of the EMCP methods regardless of which duke@435: // EMCP method you happen to have in hand. For example, a duke@435: // breakpoint set in one EMCP method will work for all EMCP duke@435: // versions of the method including the current one. duke@435: } else { duke@435: // mark obsolete methods as such duke@435: old_method->set_is_obsolete(); duke@435: obsolete_count++; duke@435: coleenp@5835: // obsolete methods need a unique idnum so they become new entries in coleenp@5835: // the jmethodID cache in InstanceKlass sspitsyn@7636: assert(old_method->method_idnum() == new_method->method_idnum(), "must match"); coleenp@4037: u2 num = InstanceKlass::cast(_the_class_oop)->next_method_idnum(); coleenp@4037: if (num != ConstMethod::UNSET_IDNUM) { duke@435: old_method->set_method_idnum(num); duke@435: } coleenp@5749: duke@435: // With tracing we try not to "yack" too much. The position of duke@435: // this trace assumes there are fewer obsolete methods than duke@435: // EMCP methods. duke@435: RC_TRACE(0x00000100, ("mark %s(%s) as obsolete", duke@435: old_method->name()->as_C_string(), duke@435: old_method->signature()->as_C_string())); duke@435: } duke@435: old_method->set_is_old(); duke@435: } duke@435: for (int i = 0; i < _deleted_methods_length; ++i) { coleenp@4037: Method* old_method = _deleted_methods[i]; duke@435: drchase@5732: assert(!old_method->has_vtable_index(), duke@435: "cannot delete methods with vtable entries");; duke@435: sspitsyn@7635: // Mark all deleted methods as old, obsolete and deleted sspitsyn@7635: old_method->set_is_deleted(); duke@435: old_method->set_is_old(); duke@435: old_method->set_is_obsolete(); duke@435: ++obsolete_count; duke@435: // With tracing we try not to "yack" too much. The position of duke@435: // this trace assumes there are fewer obsolete methods than duke@435: // EMCP methods. duke@435: RC_TRACE(0x00000100, ("mark deleted %s(%s) as obsolete", duke@435: old_method->name()->as_C_string(), duke@435: old_method->signature()->as_C_string())); duke@435: } duke@435: assert((*emcp_method_count_p + obsolete_count) == _old_methods->length(), duke@435: "sanity check"); duke@435: RC_TRACE(0x00000100, ("EMCP_cnt=%d, obsolete_cnt=%d", *emcp_method_count_p, duke@435: obsolete_count)); duke@435: } duke@435: duke@435: // This internal class transfers the native function registration from old methods duke@435: // to new methods. It is designed to handle both the simple case of unchanged duke@435: // native methods and the complex cases of native method prefixes being added and/or duke@435: // removed. duke@435: // It expects only to be used during the VM_RedefineClasses op (a safepoint). duke@435: // duke@435: // This class is used after the new methods have been installed in "the_class". duke@435: // duke@435: // So, for example, the following must be handled. Where 'm' is a method and duke@435: // a number followed by an underscore is a prefix. duke@435: // duke@435: // Old Name New Name duke@435: // Simple transfer to new method m -> m duke@435: // Add prefix m -> 1_m duke@435: // Remove prefix 1_m -> m duke@435: // Simultaneous add of prefixes m -> 3_2_1_m duke@435: // Simultaneous removal of prefixes 3_2_1_m -> m duke@435: // Simultaneous add and remove 1_m -> 2_m duke@435: // Same, caused by prefix removal only 3_2_1_m -> 3_2_m duke@435: // duke@435: class TransferNativeFunctionRegistration { duke@435: private: duke@435: instanceKlassHandle the_class; duke@435: int prefix_count; duke@435: char** prefixes; duke@435: duke@435: // Recursively search the binary tree of possibly prefixed method names. duke@435: // Iteration could be used if all agents were well behaved. Full tree walk is duke@435: // more resilent to agents not cleaning up intermediate methods. duke@435: // Branch at each depth in the binary tree is: duke@435: // (1) without the prefix. duke@435: // (2) with the prefix. duke@435: // where 'prefix' is the prefix at that 'depth' (first prefix, second prefix,...) coleenp@4037: Method* search_prefix_name_space(int depth, char* name_str, size_t name_len, coleenp@2497: Symbol* signature) { coleenp@2497: TempNewSymbol name_symbol = SymbolTable::probe(name_str, (int)name_len); duke@435: if (name_symbol != NULL) { hseigel@4278: Method* method = the_class()->lookup_method(name_symbol, signature); duke@435: if (method != NULL) { duke@435: // Even if prefixed, intermediate methods must exist. duke@435: if (method->is_native()) { duke@435: // Wahoo, we found a (possibly prefixed) version of the method, return it. duke@435: return method; duke@435: } duke@435: if (depth < prefix_count) { duke@435: // Try applying further prefixes (other than this one). duke@435: method = search_prefix_name_space(depth+1, name_str, name_len, signature); duke@435: if (method != NULL) { duke@435: return method; // found duke@435: } duke@435: duke@435: // Try adding this prefix to the method name and see if it matches duke@435: // another method name. duke@435: char* prefix = prefixes[depth]; duke@435: size_t prefix_len = strlen(prefix); duke@435: size_t trial_len = name_len + prefix_len; duke@435: char* trial_name_str = NEW_RESOURCE_ARRAY(char, trial_len + 1); duke@435: strcpy(trial_name_str, prefix); duke@435: strcat(trial_name_str, name_str); duke@435: method = search_prefix_name_space(depth+1, trial_name_str, trial_len, duke@435: signature); duke@435: if (method != NULL) { duke@435: // If found along this branch, it was prefixed, mark as such duke@435: method->set_is_prefixed_native(); duke@435: return method; // found duke@435: } duke@435: } duke@435: } duke@435: } duke@435: return NULL; // This whole branch bore nothing duke@435: } duke@435: duke@435: // Return the method name with old prefixes stripped away. coleenp@4037: char* method_name_without_prefixes(Method* method) { coleenp@2497: Symbol* name = method->name(); duke@435: char* name_str = name->as_utf8(); duke@435: duke@435: // Old prefixing may be defunct, strip prefixes, if any. duke@435: for (int i = prefix_count-1; i >= 0; i--) { duke@435: char* prefix = prefixes[i]; duke@435: size_t prefix_len = strlen(prefix); duke@435: if (strncmp(prefix, name_str, prefix_len) == 0) { duke@435: name_str += prefix_len; duke@435: } duke@435: } duke@435: return name_str; duke@435: } duke@435: duke@435: // Strip any prefixes off the old native method, then try to find a duke@435: // (possibly prefixed) new native that matches it. coleenp@4037: Method* strip_and_search_for_new_native(Method* method) { duke@435: ResourceMark rm; duke@435: char* name_str = method_name_without_prefixes(method); duke@435: return search_prefix_name_space(0, name_str, strlen(name_str), duke@435: method->signature()); duke@435: } duke@435: duke@435: public: duke@435: duke@435: // Construct a native method transfer processor for this class. duke@435: TransferNativeFunctionRegistration(instanceKlassHandle _the_class) { duke@435: assert(SafepointSynchronize::is_at_safepoint(), "sanity check"); duke@435: duke@435: the_class = _the_class; duke@435: prefixes = JvmtiExport::get_all_native_method_prefixes(&prefix_count); duke@435: } duke@435: duke@435: // Attempt to transfer any of the old or deleted methods that are native coleenp@4037: void transfer_registrations(Method** old_methods, int methods_length) { duke@435: for (int j = 0; j < methods_length; j++) { coleenp@4037: Method* old_method = old_methods[j]; duke@435: duke@435: if (old_method->is_native() && old_method->has_native_function()) { coleenp@4037: Method* new_method = strip_and_search_for_new_native(old_method); duke@435: if (new_method != NULL) { duke@435: // Actually set the native function in the new method. duke@435: // Redefine does not send events (except CFLH), certainly not this duke@435: // behind the scenes re-registration. duke@435: new_method->set_native_function(old_method->native_function(), coleenp@4037: !Method::native_bind_event_is_interesting); duke@435: } duke@435: } duke@435: } duke@435: } duke@435: }; duke@435: duke@435: // Don't lose the association between a native method and its JNI function. duke@435: void VM_RedefineClasses::transfer_old_native_function_registrations(instanceKlassHandle the_class) { duke@435: TransferNativeFunctionRegistration transfer(the_class); duke@435: transfer.transfer_registrations(_deleted_methods, _deleted_methods_length); duke@435: transfer.transfer_registrations(_matching_old_methods, _matching_methods_length); duke@435: } duke@435: duke@435: // Deoptimize all compiled code that depends on this class. duke@435: // duke@435: // If the can_redefine_classes capability is obtained in the onload duke@435: // phase then the compiler has recorded all dependencies from startup. duke@435: // In that case we need only deoptimize and throw away all compiled code duke@435: // that depends on the class. duke@435: // duke@435: // If can_redefine_classes is obtained sometime after the onload duke@435: // phase then the dependency information may be incomplete. In that case duke@435: // the first call to RedefineClasses causes all compiled code to be duke@435: // thrown away. As can_redefine_classes has been obtained then duke@435: // all future compilations will record dependencies so second and duke@435: // subsequent calls to RedefineClasses need only throw away code duke@435: // that depends on the class. duke@435: // duke@435: void VM_RedefineClasses::flush_dependent_code(instanceKlassHandle k_h, TRAPS) { duke@435: assert_locked_or_safepoint(Compile_lock); duke@435: duke@435: // All dependencies have been recorded from startup or this is a second or duke@435: // subsequent use of RedefineClasses duke@435: if (JvmtiExport::all_dependencies_are_recorded()) { duke@435: Universe::flush_evol_dependents_on(k_h); duke@435: } else { duke@435: CodeCache::mark_all_nmethods_for_deoptimization(); duke@435: duke@435: ResourceMark rm(THREAD); duke@435: DeoptimizationMarker dm; duke@435: duke@435: // Deoptimize all activations depending on marked nmethods duke@435: Deoptimization::deoptimize_dependents(); duke@435: duke@435: // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies) duke@435: CodeCache::make_marked_nmethods_not_entrant(); duke@435: duke@435: // From now on we know that the dependency information is complete duke@435: JvmtiExport::set_all_dependencies_are_recorded(true); duke@435: } duke@435: } duke@435: duke@435: void VM_RedefineClasses::compute_added_deleted_matching_methods() { coleenp@4037: Method* old_method; coleenp@4037: Method* new_method; coleenp@4037: coleenp@4037: _matching_old_methods = NEW_RESOURCE_ARRAY(Method*, _old_methods->length()); coleenp@4037: _matching_new_methods = NEW_RESOURCE_ARRAY(Method*, _old_methods->length()); coleenp@4037: _added_methods = NEW_RESOURCE_ARRAY(Method*, _new_methods->length()); coleenp@4037: _deleted_methods = NEW_RESOURCE_ARRAY(Method*, _old_methods->length()); duke@435: duke@435: _matching_methods_length = 0; duke@435: _deleted_methods_length = 0; duke@435: _added_methods_length = 0; duke@435: duke@435: int nj = 0; duke@435: int oj = 0; duke@435: while (true) { duke@435: if (oj >= _old_methods->length()) { duke@435: if (nj >= _new_methods->length()) { duke@435: break; // we've looked at everything, done duke@435: } duke@435: // New method at the end coleenp@4037: new_method = _new_methods->at(nj); duke@435: _added_methods[_added_methods_length++] = new_method; duke@435: ++nj; duke@435: } else if (nj >= _new_methods->length()) { duke@435: // Old method, at the end, is deleted coleenp@4037: old_method = _old_methods->at(oj); duke@435: _deleted_methods[_deleted_methods_length++] = old_method; duke@435: ++oj; duke@435: } else { coleenp@4037: old_method = _old_methods->at(oj); coleenp@4037: new_method = _new_methods->at(nj); duke@435: if (old_method->name() == new_method->name()) { duke@435: if (old_method->signature() == new_method->signature()) { duke@435: _matching_old_methods[_matching_methods_length ] = old_method; duke@435: _matching_new_methods[_matching_methods_length++] = new_method; duke@435: ++nj; duke@435: ++oj; duke@435: } else { duke@435: // added overloaded have already been moved to the end, duke@435: // so this is a deleted overloaded method duke@435: _deleted_methods[_deleted_methods_length++] = old_method; duke@435: ++oj; duke@435: } duke@435: } else { // names don't match duke@435: if (old_method->name()->fast_compare(new_method->name()) > 0) { duke@435: // new method duke@435: _added_methods[_added_methods_length++] = new_method; duke@435: ++nj; duke@435: } else { duke@435: // deleted method duke@435: _deleted_methods[_deleted_methods_length++] = old_method; duke@435: ++oj; duke@435: } duke@435: } duke@435: } duke@435: } duke@435: assert(_matching_methods_length + _deleted_methods_length == _old_methods->length(), "sanity"); duke@435: assert(_matching_methods_length + _added_methods_length == _new_methods->length(), "sanity"); duke@435: } duke@435: duke@435: coleenp@4572: void VM_RedefineClasses::swap_annotations(instanceKlassHandle the_class, coleenp@4572: instanceKlassHandle scratch_class) { coleenp@4572: // Swap annotation fields values coleenp@4572: Annotations* old_annotations = the_class->annotations(); coleenp@4572: the_class->set_annotations(scratch_class->annotations()); coleenp@4572: scratch_class->set_annotations(old_annotations); coleenp@4572: } coleenp@4572: duke@435: duke@435: // Install the redefinition of a class: duke@435: // - house keeping (flushing breakpoints and caches, deoptimizing duke@435: // dependent compiled code) duke@435: // - replacing parts in the_class with parts from scratch_class duke@435: // - adding a weak reference to track the obsolete but interesting duke@435: // parts of the_class duke@435: // - adjusting constant pool caches and vtables in other classes duke@435: // that refer to methods in the_class. These adjustments use the coleenp@5100: // ClassLoaderDataGraph::classes_do() facility which only allows duke@435: // a helper method to be specified. The interesting parameters duke@435: // that we would like to pass to the helper method are saved in duke@435: // static global fields in the VM operation. duke@435: void VM_RedefineClasses::redefine_single_class(jclass the_jclass, coleenp@4037: Klass* scratch_class_oop, TRAPS) { coleenp@4037: coleenp@4037: HandleMark hm(THREAD); // make sure handles from this call are freed duke@435: RC_TIMER_START(_timer_rsc_phase1); duke@435: coleenp@4037: instanceKlassHandle scratch_class(scratch_class_oop); coleenp@4037: duke@435: oop the_class_mirror = JNIHandles::resolve_non_null(the_jclass); coleenp@4037: Klass* the_class_oop = java_lang_Class::as_Klass(the_class_mirror); duke@435: instanceKlassHandle the_class = instanceKlassHandle(THREAD, the_class_oop); duke@435: duke@435: // Remove all breakpoints in methods of this class duke@435: JvmtiBreakpoints& jvmti_breakpoints = JvmtiCurrentBreakpoints::get_jvmti_breakpoints(); duke@435: jvmti_breakpoints.clearall_in_class_at_safepoint(the_class_oop); duke@435: duke@435: // Deoptimize all compiled code that depends on this class duke@435: flush_dependent_code(the_class, THREAD); duke@435: duke@435: _old_methods = the_class->methods(); duke@435: _new_methods = scratch_class->methods(); duke@435: _the_class_oop = the_class_oop; duke@435: compute_added_deleted_matching_methods(); duke@435: update_jmethod_ids(); duke@435: duke@435: // Attach new constant pool to the original klass. The original duke@435: // klass still refers to the old constant pool (for now). duke@435: scratch_class->constants()->set_pool_holder(the_class()); duke@435: duke@435: #if 0 duke@435: // In theory, with constant pool merging in place we should be able duke@435: // to save space by using the new, merged constant pool in place of duke@435: // the old constant pool(s). By "pool(s)" I mean the constant pool in duke@435: // the klass version we are replacing now and any constant pool(s) in duke@435: // previous versions of klass. Nice theory, doesn't work in practice. duke@435: // When this code is enabled, even simple programs throw NullPointer duke@435: // exceptions. I'm guessing that this is caused by some constant pool duke@435: // cache difference between the new, merged constant pool and the duke@435: // constant pool that was just being used by the klass. I'm keeping duke@435: // this code around to archive the idea, but the code has to remain duke@435: // disabled for now. duke@435: duke@435: // Attach each old method to the new constant pool. This can be duke@435: // done here since we are past the bytecode verification and duke@435: // constant pool optimization phases. duke@435: for (int i = _old_methods->length() - 1; i >= 0; i--) { coleenp@4037: Method* method = _old_methods->at(i); duke@435: method->set_constants(scratch_class->constants()); duke@435: } duke@435: duke@435: { duke@435: // walk all previous versions of the klass coleenp@4037: InstanceKlass *ik = (InstanceKlass *)the_class(); duke@435: PreviousVersionWalker pvw(ik); duke@435: instanceKlassHandle ikh; duke@435: do { duke@435: ikh = pvw.next_previous_version(); duke@435: if (!ikh.is_null()) { duke@435: ik = ikh(); duke@435: duke@435: // attach previous version of klass to the new constant pool duke@435: ik->set_constants(scratch_class->constants()); duke@435: duke@435: // Attach each method in the previous version of klass to the duke@435: // new constant pool coleenp@4037: Array* prev_methods = ik->methods(); duke@435: for (int i = prev_methods->length() - 1; i >= 0; i--) { coleenp@4037: Method* method = prev_methods->at(i); duke@435: method->set_constants(scratch_class->constants()); duke@435: } duke@435: } duke@435: } while (!ikh.is_null()); duke@435: } duke@435: #endif duke@435: duke@435: // Replace methods and constantpool duke@435: the_class->set_methods(_new_methods); duke@435: scratch_class->set_methods(_old_methods); // To prevent potential GCing of the old methods, duke@435: // and to be able to undo operation easily. duke@435: coleenp@4037: ConstantPool* old_constants = the_class->constants(); duke@435: the_class->set_constants(scratch_class->constants()); duke@435: scratch_class->set_constants(old_constants); // See the previous comment. duke@435: #if 0 duke@435: // We are swapping the guts of "the new class" with the guts of "the duke@435: // class". Since the old constant pool has just been attached to "the duke@435: // new class", it seems logical to set the pool holder in the old duke@435: // constant pool also. However, doing this will change the observable duke@435: // class hierarchy for any old methods that are still executing. A duke@435: // method can query the identity of its "holder" and this query uses duke@435: // the method's constant pool link to find the holder. The change in duke@435: // holding class from "the class" to "the new class" can confuse duke@435: // things. duke@435: // duke@435: // Setting the old constant pool's holder will also cause duke@435: // verification done during vtable initialization below to fail. duke@435: // During vtable initialization, the vtable's class is verified to be duke@435: // a subtype of the method's holder. The vtable's class is "the duke@435: // class" and the method's holder is gotten from the constant pool duke@435: // link in the method itself. For "the class"'s directly implemented duke@435: // methods, the method holder is "the class" itself (as gotten from duke@435: // the new constant pool). The check works fine in this case. The duke@435: // check also works fine for methods inherited from super classes. duke@435: // duke@435: // Miranda methods are a little more complicated. A miranda method is duke@435: // provided by an interface when the class implementing the interface duke@435: // does not provide its own method. These interfaces are implemented coleenp@4037: // internally as an InstanceKlass. These special instanceKlasses duke@435: // share the constant pool of the class that "implements" the duke@435: // interface. By sharing the constant pool, the method holder of a duke@435: // miranda method is the class that "implements" the interface. In a duke@435: // non-redefine situation, the subtype check works fine. However, if duke@435: // the old constant pool's pool holder is modified, then the check duke@435: // fails because there is no class hierarchy relationship between the duke@435: // vtable's class and "the new class". duke@435: duke@435: old_constants->set_pool_holder(scratch_class()); duke@435: #endif duke@435: duke@435: // track which methods are EMCP for add_previous_version() call below duke@435: BitMap emcp_methods(_old_methods->length()); duke@435: int emcp_method_count = 0; duke@435: emcp_methods.clear(); // clears 0..(length() - 1) duke@435: check_methods_and_mark_as_obsolete(&emcp_methods, &emcp_method_count); duke@435: transfer_old_native_function_registrations(the_class); duke@435: duke@435: // The class file bytes from before any retransformable agents mucked duke@435: // with them was cached on the scratch class, move to the_class. duke@435: // Note: we still want to do this if nothing needed caching since it duke@435: // should get cleared in the_class too. dcubed@3360: if (the_class->get_cached_class_file_bytes() == 0) { dcubed@3360: // the_class doesn't have a cache yet so copy it jiangli@5421: the_class->set_cached_class_file(scratch_class->get_cached_class_file()); dcubed@3360: } sspitsyn@7692: else if (scratch_class->get_cached_class_file_bytes() != sspitsyn@7692: the_class->get_cached_class_file_bytes()) { sspitsyn@7692: // The same class can be present twice in the scratch classes list or there sspitsyn@7692: // are multiple concurrent RetransformClasses calls on different threads. sspitsyn@7692: // In such cases we have to deallocate scratch_class cached_class_file_bytes. sspitsyn@7692: os::free(scratch_class->get_cached_class_file_bytes()); dcubed@3360: } duke@435: coleenp@5084: // NULL out in scratch class to not delete twice. The class to be redefined coleenp@5084: // always owns these bytes. jiangli@5421: scratch_class->set_cached_class_file(NULL); coleenp@5084: duke@435: // Replace inner_classes coleenp@4037: Array* old_inner_classes = the_class->inner_classes(); duke@435: the_class->set_inner_classes(scratch_class->inner_classes()); duke@435: scratch_class->set_inner_classes(old_inner_classes); duke@435: duke@435: // Initialize the vtable and interface table after duke@435: // methods have been rewritten duke@435: { duke@435: ResourceMark rm(THREAD); duke@435: // no exception should happen here since we explicitly duke@435: // do not check loader constraints. duke@435: // compare_and_normalize_class_versions has already checked: duke@435: // - classloaders unchanged, signatures unchanged duke@435: // - all instanceKlasses for redefined classes reused & contents updated duke@435: the_class->vtable()->initialize_vtable(false, THREAD); duke@435: the_class->itable()->initialize_itable(false, THREAD); never@1577: assert(!HAS_PENDING_EXCEPTION || (THREAD->pending_exception()->is_a(SystemDictionary::ThreadDeath_klass())), "redefine exception"); duke@435: } duke@435: duke@435: // Leave arrays of jmethodIDs and itable index cache unchanged duke@435: duke@435: // Copy the "source file name" attribute from new class version jiangli@5535: the_class->set_source_file_name_index( jiangli@5535: scratch_class->source_file_name_index()); duke@435: duke@435: // Copy the "source debug extension" attribute from new class version duke@435: the_class->set_source_debug_extension( fparain@3906: scratch_class->source_debug_extension(), fparain@3906: scratch_class->source_debug_extension() == NULL ? 0 : fparain@3906: (int)strlen(scratch_class->source_debug_extension())); duke@435: duke@435: // Use of javac -g could be different in the old and the new duke@435: if (scratch_class->access_flags().has_localvariable_table() != duke@435: the_class->access_flags().has_localvariable_table()) { duke@435: duke@435: AccessFlags flags = the_class->access_flags(); duke@435: if (scratch_class->access_flags().has_localvariable_table()) { duke@435: flags.set_has_localvariable_table(); duke@435: } else { duke@435: flags.clear_has_localvariable_table(); duke@435: } duke@435: the_class->set_access_flags(flags); duke@435: } duke@435: coleenp@4572: swap_annotations(the_class, scratch_class); duke@435: duke@435: // Replace minor version number of class file duke@435: u2 old_minor_version = the_class->minor_version(); duke@435: the_class->set_minor_version(scratch_class->minor_version()); duke@435: scratch_class->set_minor_version(old_minor_version); duke@435: duke@435: // Replace major version number of class file duke@435: u2 old_major_version = the_class->major_version(); duke@435: the_class->set_major_version(scratch_class->major_version()); duke@435: scratch_class->set_major_version(old_major_version); duke@435: duke@435: // Replace CP indexes for class and name+type of enclosing method duke@435: u2 old_class_idx = the_class->enclosing_method_class_index(); duke@435: u2 old_method_idx = the_class->enclosing_method_method_index(); duke@435: the_class->set_enclosing_method_indices( duke@435: scratch_class->enclosing_method_class_index(), duke@435: scratch_class->enclosing_method_method_index()); duke@435: scratch_class->set_enclosing_method_indices(old_class_idx, old_method_idx); duke@435: duke@435: // keep track of previous versions of this class duke@435: the_class->add_previous_version(scratch_class, &emcp_methods, duke@435: emcp_method_count); duke@435: duke@435: RC_TIMER_STOP(_timer_rsc_phase1); duke@435: RC_TIMER_START(_timer_rsc_phase2); duke@435: duke@435: // Adjust constantpool caches and vtables for all classes duke@435: // that reference methods of the evolved class. coleenp@5100: AdjustCpoolCacheAndVtable adjust_cpool_cache_and_vtable(THREAD); coleenp@5100: ClassLoaderDataGraph::classes_do(&adjust_cpool_cache_and_vtable); duke@435: sspitsyn@4965: // JSR-292 support sspitsyn@4965: MemberNameTable* mnt = the_class->member_names(); sspitsyn@4965: if (mnt != NULL) { sspitsyn@4965: bool trace_name_printed = false; sspitsyn@4965: mnt->adjust_method_entries(_matching_old_methods, sspitsyn@4965: _matching_new_methods, sspitsyn@4965: _matching_methods_length, sspitsyn@4965: &trace_name_printed); sspitsyn@4965: } sspitsyn@4965: coleenp@4037: // Fix Resolution Error table also to remove old constant pools coleenp@4037: SystemDictionary::delete_resolution_error(old_constants); coleenp@4037: duke@435: if (the_class->oop_map_cache() != NULL) { duke@435: // Flush references to any obsolete methods from the oop map cache duke@435: // so that obsolete methods are not pinned. duke@435: the_class->oop_map_cache()->flush_obsolete_entries(); duke@435: } duke@435: duke@435: // increment the classRedefinedCount field in the_class and in any duke@435: // direct and indirect subclasses of the_class coleenp@4037: increment_class_counter((InstanceKlass *)the_class(), THREAD); duke@435: duke@435: // RC_TRACE macro has an embedded ResourceMark duke@435: RC_TRACE_WITH_THREAD(0x00000001, THREAD, duke@435: ("redefined name=%s, count=%d (avail_mem=" UINT64_FORMAT "K)", duke@435: the_class->external_name(), duke@435: java_lang_Class::classRedefinedCount(the_class_mirror), duke@435: os::available_memory() >> 10)); duke@435: duke@435: RC_TIMER_STOP(_timer_rsc_phase2); duke@435: } // end redefine_single_class() duke@435: duke@435: coleenp@4037: // Increment the classRedefinedCount field in the specific InstanceKlass duke@435: // and in all direct and indirect subclasses. coleenp@4037: void VM_RedefineClasses::increment_class_counter(InstanceKlass *ik, TRAPS) { duke@435: oop class_mirror = ik->java_mirror(); coleenp@4037: Klass* class_oop = java_lang_Class::as_Klass(class_mirror); duke@435: int new_count = java_lang_Class::classRedefinedCount(class_mirror) + 1; duke@435: java_lang_Class::set_classRedefinedCount(class_mirror, new_count); duke@435: duke@435: if (class_oop != _the_class_oop) { duke@435: // _the_class_oop count is printed at end of redefine_single_class() duke@435: RC_TRACE_WITH_THREAD(0x00000008, THREAD, duke@435: ("updated count in subclass=%s to %d", ik->external_name(), new_count)); duke@435: } duke@435: duke@435: for (Klass *subk = ik->subklass(); subk != NULL; duke@435: subk = subk->next_sibling()) { never@2659: if (subk->oop_is_instance()) { never@2659: // Only update instanceKlasses coleenp@4037: InstanceKlass *subik = (InstanceKlass*)subk; never@2659: // recursively do subclasses of the current subclass never@2659: increment_class_counter(subik, THREAD); never@2659: } duke@435: } duke@435: } duke@435: coleenp@5100: void VM_RedefineClasses::CheckClass::do_klass(Klass* k) { coleenp@5100: bool no_old_methods = true; // be optimistic coleenp@5100: coleenp@5100: // Both array and instance classes have vtables. coleenp@5100: // a vtable should never contain old or obsolete methods coleenp@5100: ResourceMark rm(_thread); coleenp@5100: if (k->vtable_length() > 0 && coleenp@5100: !k->vtable()->check_no_old_or_obsolete_entries()) { coleenp@5100: if (RC_TRACE_ENABLED(0x00004000)) { coleenp@5100: RC_TRACE_WITH_THREAD(0x00004000, _thread, coleenp@5100: ("klassVtable::check_no_old_or_obsolete_entries failure" coleenp@5100: " -- OLD or OBSOLETE method found -- class: %s", coleenp@5100: k->signature_name())); coleenp@5100: k->vtable()->dump_vtable(); coleenp@5100: } coleenp@5100: no_old_methods = false; coleenp@5100: } coleenp@5100: duke@435: if (k->oop_is_instance()) { coleenp@5100: HandleMark hm(_thread); coleenp@5100: InstanceKlass *ik = InstanceKlass::cast(k); dcubed@4562: dcubed@4562: // an itable should never contain old or obsolete methods dcubed@4562: if (ik->itable_length() > 0 && dcubed@4562: !ik->itable()->check_no_old_or_obsolete_entries()) { dcubed@4562: if (RC_TRACE_ENABLED(0x00004000)) { coleenp@5100: RC_TRACE_WITH_THREAD(0x00004000, _thread, dcubed@4562: ("klassItable::check_no_old_or_obsolete_entries failure" dcubed@4562: " -- OLD or OBSOLETE method found -- class: %s", dcubed@4562: ik->signature_name())); dcubed@4562: ik->itable()->dump_itable(); coleenp@4037: } dcubed@4562: no_old_methods = false; coleenp@4037: } dcubed@4562: sspitsyn@7635: // the constant pool cache should never contain non-deleted old or obsolete methods coleenp@4037: if (ik->constants() != NULL && coleenp@4037: ik->constants()->cache() != NULL && dcubed@4562: !ik->constants()->cache()->check_no_old_or_obsolete_entries()) { dcubed@4562: if (RC_TRACE_ENABLED(0x00004000)) { coleenp@5100: RC_TRACE_WITH_THREAD(0x00004000, _thread, dcubed@4562: ("cp-cache::check_no_old_or_obsolete_entries failure" dcubed@4562: " -- OLD or OBSOLETE method found -- class: %s", dcubed@4562: ik->signature_name())); dcubed@4562: ik->constants()->cache()->dump_cache(); dcubed@4562: } dcubed@4562: no_old_methods = false; dcubed@4562: } coleenp@5100: } coleenp@5100: coleenp@5100: // print and fail guarantee if old methods are found. coleenp@5100: if (!no_old_methods) { coleenp@5100: if (RC_TRACE_ENABLED(0x00004000)) { coleenp@5100: dump_methods(); coleenp@5100: } else { coleenp@5100: tty->print_cr("INFO: use the '-XX:TraceRedefineClasses=16384' option " coleenp@5100: "to see more info about the following guarantee() failure."); coleenp@4037: } coleenp@5100: guarantee(false, "OLD and/or OBSOLETE method(s) found"); duke@435: } duke@435: } duke@435: coleenp@5100: duke@435: void VM_RedefineClasses::dump_methods() { dcubed@4562: int j; dcubed@4562: RC_TRACE(0x00004000, ("_old_methods --")); dcubed@4562: for (j = 0; j < _old_methods->length(); ++j) { dcubed@4562: Method* m = _old_methods->at(j); dcubed@4562: RC_TRACE_NO_CR(0x00004000, ("%4d (%5d) ", j, m->vtable_index())); dcubed@4562: m->access_flags().print_on(tty); dcubed@4562: tty->print(" -- "); dcubed@4562: m->print_name(tty); dcubed@4562: tty->cr(); dcubed@4562: } dcubed@4562: RC_TRACE(0x00004000, ("_new_methods --")); dcubed@4562: for (j = 0; j < _new_methods->length(); ++j) { dcubed@4562: Method* m = _new_methods->at(j); dcubed@4562: RC_TRACE_NO_CR(0x00004000, ("%4d (%5d) ", j, m->vtable_index())); dcubed@4562: m->access_flags().print_on(tty); dcubed@4562: tty->print(" -- "); dcubed@4562: m->print_name(tty); dcubed@4562: tty->cr(); dcubed@4562: } dcubed@4562: RC_TRACE(0x00004000, ("_matching_(old/new)_methods --")); dcubed@4562: for (j = 0; j < _matching_methods_length; ++j) { dcubed@4562: Method* m = _matching_old_methods[j]; dcubed@4562: RC_TRACE_NO_CR(0x00004000, ("%4d (%5d) ", j, m->vtable_index())); dcubed@4562: m->access_flags().print_on(tty); dcubed@4562: tty->print(" -- "); dcubed@4562: m->print_name(tty); dcubed@4562: tty->cr(); dcubed@4562: m = _matching_new_methods[j]; dcubed@4562: RC_TRACE_NO_CR(0x00004000, (" (%5d) ", m->vtable_index())); dcubed@4562: m->access_flags().print_on(tty); dcubed@4562: tty->cr(); dcubed@4562: } dcubed@4562: RC_TRACE(0x00004000, ("_deleted_methods --")); dcubed@4562: for (j = 0; j < _deleted_methods_length; ++j) { dcubed@4562: Method* m = _deleted_methods[j]; dcubed@4562: RC_TRACE_NO_CR(0x00004000, ("%4d (%5d) ", j, m->vtable_index())); dcubed@4562: m->access_flags().print_on(tty); dcubed@4562: tty->print(" -- "); dcubed@4562: m->print_name(tty); dcubed@4562: tty->cr(); dcubed@4562: } dcubed@4562: RC_TRACE(0x00004000, ("_added_methods --")); dcubed@4562: for (j = 0; j < _added_methods_length; ++j) { dcubed@4562: Method* m = _added_methods[j]; dcubed@4562: RC_TRACE_NO_CR(0x00004000, ("%4d (%5d) ", j, m->vtable_index())); dcubed@4562: m->access_flags().print_on(tty); dcubed@4562: tty->print(" -- "); dcubed@4562: m->print_name(tty); dcubed@4562: tty->cr(); dcubed@4562: } duke@435: }