Tue, 26 Mar 2013 15:00:34 +0100
8009382: Add JVM_Get{Field|Method}TypeAnnotations
Reviewed-by: dcubed, rbackman
Contributed-by: Joel Borggren-Franck <joel.franck@oracle.com>
duke@435 | 1 | /* |
coleenp@4466 | 2 | * Copyright (c) 2003, 2013, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
coleenp@4490 | 26 | #include "classfile/metadataOnStackMark.hpp" |
stefank@2314 | 27 | #include "classfile/systemDictionary.hpp" |
stefank@2314 | 28 | #include "classfile/verifier.hpp" |
stefank@2314 | 29 | #include "code/codeCache.hpp" |
coleenp@4037 | 30 | #include "compiler/compileBroker.hpp" |
stefank@2314 | 31 | #include "interpreter/oopMapCache.hpp" |
stefank@2314 | 32 | #include "interpreter/rewriter.hpp" |
stefank@2314 | 33 | #include "memory/gcLocker.hpp" |
coleenp@4037 | 34 | #include "memory/metadataFactory.hpp" |
coleenp@4037 | 35 | #include "memory/metaspaceShared.hpp" |
stefank@2314 | 36 | #include "memory/universe.inline.hpp" |
never@3137 | 37 | #include "oops/fieldStreams.hpp" |
stefank@2314 | 38 | #include "oops/klassVtable.hpp" |
stefank@2314 | 39 | #include "prims/jvmtiImpl.hpp" |
stefank@2314 | 40 | #include "prims/jvmtiRedefineClasses.hpp" |
stefank@2314 | 41 | #include "prims/methodComparator.hpp" |
stefank@2314 | 42 | #include "runtime/deoptimization.hpp" |
stefank@2314 | 43 | #include "runtime/relocator.hpp" |
stefank@2314 | 44 | #include "utilities/bitMap.inline.hpp" |
duke@435 | 45 | |
duke@435 | 46 | |
coleenp@4037 | 47 | Array<Method*>* VM_RedefineClasses::_old_methods = NULL; |
coleenp@4037 | 48 | Array<Method*>* VM_RedefineClasses::_new_methods = NULL; |
coleenp@4037 | 49 | Method** VM_RedefineClasses::_matching_old_methods = NULL; |
coleenp@4037 | 50 | Method** VM_RedefineClasses::_matching_new_methods = NULL; |
coleenp@4037 | 51 | Method** VM_RedefineClasses::_deleted_methods = NULL; |
coleenp@4037 | 52 | Method** VM_RedefineClasses::_added_methods = NULL; |
duke@435 | 53 | int VM_RedefineClasses::_matching_methods_length = 0; |
duke@435 | 54 | int VM_RedefineClasses::_deleted_methods_length = 0; |
duke@435 | 55 | int VM_RedefineClasses::_added_methods_length = 0; |
coleenp@4037 | 56 | Klass* VM_RedefineClasses::_the_class_oop = NULL; |
duke@435 | 57 | |
duke@435 | 58 | |
duke@435 | 59 | VM_RedefineClasses::VM_RedefineClasses(jint class_count, |
duke@435 | 60 | const jvmtiClassDefinition *class_defs, |
duke@435 | 61 | JvmtiClassLoadKind class_load_kind) { |
duke@435 | 62 | _class_count = class_count; |
duke@435 | 63 | _class_defs = class_defs; |
duke@435 | 64 | _class_load_kind = class_load_kind; |
duke@435 | 65 | _res = JVMTI_ERROR_NONE; |
duke@435 | 66 | } |
duke@435 | 67 | |
duke@435 | 68 | bool VM_RedefineClasses::doit_prologue() { |
duke@435 | 69 | if (_class_count == 0) { |
duke@435 | 70 | _res = JVMTI_ERROR_NONE; |
duke@435 | 71 | return false; |
duke@435 | 72 | } |
duke@435 | 73 | if (_class_defs == NULL) { |
duke@435 | 74 | _res = JVMTI_ERROR_NULL_POINTER; |
duke@435 | 75 | return false; |
duke@435 | 76 | } |
duke@435 | 77 | for (int i = 0; i < _class_count; i++) { |
duke@435 | 78 | if (_class_defs[i].klass == NULL) { |
duke@435 | 79 | _res = JVMTI_ERROR_INVALID_CLASS; |
duke@435 | 80 | return false; |
duke@435 | 81 | } |
duke@435 | 82 | if (_class_defs[i].class_byte_count == 0) { |
duke@435 | 83 | _res = JVMTI_ERROR_INVALID_CLASS_FORMAT; |
duke@435 | 84 | return false; |
duke@435 | 85 | } |
duke@435 | 86 | if (_class_defs[i].class_bytes == NULL) { |
duke@435 | 87 | _res = JVMTI_ERROR_NULL_POINTER; |
duke@435 | 88 | return false; |
duke@435 | 89 | } |
duke@435 | 90 | } |
duke@435 | 91 | |
duke@435 | 92 | // Start timer after all the sanity checks; not quite accurate, but |
duke@435 | 93 | // better than adding a bunch of stop() calls. |
duke@435 | 94 | RC_TIMER_START(_timer_vm_op_prologue); |
duke@435 | 95 | |
duke@435 | 96 | // We first load new class versions in the prologue, because somewhere down the |
duke@435 | 97 | // call chain it is required that the current thread is a Java thread. |
duke@435 | 98 | _res = load_new_class_versions(Thread::current()); |
duke@435 | 99 | if (_res != JVMTI_ERROR_NONE) { |
coleenp@4037 | 100 | // free any successfully created classes, since none are redefined |
coleenp@4037 | 101 | for (int i = 0; i < _class_count; i++) { |
coleenp@4037 | 102 | if (_scratch_classes[i] != NULL) { |
coleenp@4037 | 103 | ClassLoaderData* cld = _scratch_classes[i]->class_loader_data(); |
coleenp@4037 | 104 | // Free the memory for this class at class unloading time. Not before |
coleenp@4037 | 105 | // because CMS might think this is still live. |
coleenp@4037 | 106 | cld->add_to_deallocate_list((InstanceKlass*)_scratch_classes[i]); |
coleenp@4037 | 107 | } |
coleenp@4037 | 108 | } |
duke@435 | 109 | // Free os::malloc allocated memory in load_new_class_version. |
duke@435 | 110 | os::free(_scratch_classes); |
duke@435 | 111 | RC_TIMER_STOP(_timer_vm_op_prologue); |
duke@435 | 112 | return false; |
duke@435 | 113 | } |
duke@435 | 114 | |
duke@435 | 115 | RC_TIMER_STOP(_timer_vm_op_prologue); |
duke@435 | 116 | return true; |
duke@435 | 117 | } |
duke@435 | 118 | |
duke@435 | 119 | void VM_RedefineClasses::doit() { |
duke@435 | 120 | Thread *thread = Thread::current(); |
duke@435 | 121 | |
duke@435 | 122 | if (UseSharedSpaces) { |
duke@435 | 123 | // Sharing is enabled so we remap the shared readonly space to |
duke@435 | 124 | // shared readwrite, private just in case we need to redefine |
duke@435 | 125 | // a shared class. We do the remap during the doit() phase of |
duke@435 | 126 | // the safepoint to be safer. |
coleenp@4037 | 127 | if (!MetaspaceShared::remap_shared_readonly_as_readwrite()) { |
duke@435 | 128 | RC_TRACE_WITH_THREAD(0x00000001, thread, |
duke@435 | 129 | ("failed to remap shared readonly space to readwrite, private")); |
duke@435 | 130 | _res = JVMTI_ERROR_INTERNAL; |
duke@435 | 131 | return; |
duke@435 | 132 | } |
duke@435 | 133 | } |
duke@435 | 134 | |
coleenp@4037 | 135 | // Mark methods seen on stack and everywhere else so old methods are not |
coleenp@4037 | 136 | // cleaned up if they're on the stack. |
coleenp@4037 | 137 | MetadataOnStackMark md_on_stack; |
coleenp@4037 | 138 | HandleMark hm(thread); // make sure any handles created are deleted |
coleenp@4037 | 139 | // before the stack walk again. |
coleenp@4037 | 140 | |
duke@435 | 141 | for (int i = 0; i < _class_count; i++) { |
duke@435 | 142 | redefine_single_class(_class_defs[i].klass, _scratch_classes[i], thread); |
coleenp@4037 | 143 | ClassLoaderData* cld = _scratch_classes[i]->class_loader_data(); |
coleenp@4037 | 144 | // Free the memory for this class at class unloading time. Not before |
coleenp@4037 | 145 | // because CMS might think this is still live. |
coleenp@4037 | 146 | cld->add_to_deallocate_list((InstanceKlass*)_scratch_classes[i]); |
coleenp@4037 | 147 | _scratch_classes[i] = NULL; |
duke@435 | 148 | } |
coleenp@4037 | 149 | |
duke@435 | 150 | // Disable any dependent concurrent compilations |
duke@435 | 151 | SystemDictionary::notice_modification(); |
duke@435 | 152 | |
duke@435 | 153 | // Set flag indicating that some invariants are no longer true. |
duke@435 | 154 | // See jvmtiExport.hpp for detailed explanation. |
duke@435 | 155 | JvmtiExport::set_has_redefined_a_class(); |
duke@435 | 156 | |
dcubed@4562 | 157 | // check_class() is optionally called for product bits, but is |
dcubed@4562 | 158 | // always called for non-product bits. |
dcubed@4562 | 159 | #ifdef PRODUCT |
dcubed@4562 | 160 | if (RC_TRACE_ENABLED(0x00004000)) { |
dcubed@4562 | 161 | #endif |
dcubed@4562 | 162 | RC_TRACE_WITH_THREAD(0x00004000, thread, ("calling check_class")); |
dcubed@4562 | 163 | SystemDictionary::classes_do(check_class, thread); |
dcubed@4562 | 164 | #ifdef PRODUCT |
dcubed@4562 | 165 | } |
duke@435 | 166 | #endif |
duke@435 | 167 | } |
duke@435 | 168 | |
duke@435 | 169 | void VM_RedefineClasses::doit_epilogue() { |
duke@435 | 170 | // Free os::malloc allocated memory. |
duke@435 | 171 | os::free(_scratch_classes); |
duke@435 | 172 | |
duke@435 | 173 | if (RC_TRACE_ENABLED(0x00000004)) { |
duke@435 | 174 | // Used to have separate timers for "doit" and "all", but the timer |
duke@435 | 175 | // overhead skewed the measurements. |
duke@435 | 176 | jlong doit_time = _timer_rsc_phase1.milliseconds() + |
duke@435 | 177 | _timer_rsc_phase2.milliseconds(); |
duke@435 | 178 | jlong all_time = _timer_vm_op_prologue.milliseconds() + doit_time; |
duke@435 | 179 | |
duke@435 | 180 | RC_TRACE(0x00000004, ("vm_op: all=" UINT64_FORMAT |
duke@435 | 181 | " prologue=" UINT64_FORMAT " doit=" UINT64_FORMAT, all_time, |
duke@435 | 182 | _timer_vm_op_prologue.milliseconds(), doit_time)); |
duke@435 | 183 | RC_TRACE(0x00000004, |
duke@435 | 184 | ("redefine_single_class: phase1=" UINT64_FORMAT " phase2=" UINT64_FORMAT, |
duke@435 | 185 | _timer_rsc_phase1.milliseconds(), _timer_rsc_phase2.milliseconds())); |
duke@435 | 186 | } |
duke@435 | 187 | } |
duke@435 | 188 | |
duke@435 | 189 | bool VM_RedefineClasses::is_modifiable_class(oop klass_mirror) { |
duke@435 | 190 | // classes for primitives cannot be redefined |
duke@435 | 191 | if (java_lang_Class::is_primitive(klass_mirror)) { |
duke@435 | 192 | return false; |
duke@435 | 193 | } |
coleenp@4037 | 194 | Klass* the_class_oop = java_lang_Class::as_Klass(klass_mirror); |
duke@435 | 195 | // classes for arrays cannot be redefined |
hseigel@4278 | 196 | if (the_class_oop == NULL || !the_class_oop->oop_is_instance()) { |
duke@435 | 197 | return false; |
duke@435 | 198 | } |
duke@435 | 199 | return true; |
duke@435 | 200 | } |
duke@435 | 201 | |
duke@435 | 202 | // Append the current entry at scratch_i in scratch_cp to *merge_cp_p |
duke@435 | 203 | // where the end of *merge_cp_p is specified by *merge_cp_length_p. For |
duke@435 | 204 | // direct CP entries, there is just the current entry to append. For |
duke@435 | 205 | // indirect and double-indirect CP entries, there are zero or more |
duke@435 | 206 | // referenced CP entries along with the current entry to append. |
duke@435 | 207 | // Indirect and double-indirect CP entries are handled by recursive |
duke@435 | 208 | // calls to append_entry() as needed. The referenced CP entries are |
duke@435 | 209 | // always appended to *merge_cp_p before the referee CP entry. These |
duke@435 | 210 | // referenced CP entries may already exist in *merge_cp_p in which case |
duke@435 | 211 | // there is nothing extra to append and only the current entry is |
duke@435 | 212 | // appended. |
duke@435 | 213 | void VM_RedefineClasses::append_entry(constantPoolHandle scratch_cp, |
duke@435 | 214 | int scratch_i, constantPoolHandle *merge_cp_p, int *merge_cp_length_p, |
duke@435 | 215 | TRAPS) { |
duke@435 | 216 | |
duke@435 | 217 | // append is different depending on entry tag type |
duke@435 | 218 | switch (scratch_cp->tag_at(scratch_i).value()) { |
duke@435 | 219 | |
duke@435 | 220 | // The old verifier is implemented outside the VM. It loads classes, |
duke@435 | 221 | // but does not resolve constant pool entries directly so we never |
duke@435 | 222 | // see Class entries here with the old verifier. Similarly the old |
duke@435 | 223 | // verifier does not like Class entries in the input constant pool. |
duke@435 | 224 | // The split-verifier is implemented in the VM so it can optionally |
duke@435 | 225 | // and directly resolve constant pool entries to load classes. The |
duke@435 | 226 | // split-verifier can accept either Class entries or UnresolvedClass |
duke@435 | 227 | // entries in the input constant pool. We revert the appended copy |
duke@435 | 228 | // back to UnresolvedClass so that either verifier will be happy |
duke@435 | 229 | // with the constant pool entry. |
duke@435 | 230 | case JVM_CONSTANT_Class: |
duke@435 | 231 | { |
duke@435 | 232 | // revert the copy to JVM_CONSTANT_UnresolvedClass |
duke@435 | 233 | (*merge_cp_p)->unresolved_klass_at_put(*merge_cp_length_p, |
duke@435 | 234 | scratch_cp->klass_name_at(scratch_i)); |
duke@435 | 235 | |
duke@435 | 236 | if (scratch_i != *merge_cp_length_p) { |
duke@435 | 237 | // The new entry in *merge_cp_p is at a different index than |
duke@435 | 238 | // the new entry in scratch_cp so we need to map the index values. |
duke@435 | 239 | map_index(scratch_cp, scratch_i, *merge_cp_length_p); |
duke@435 | 240 | } |
duke@435 | 241 | (*merge_cp_length_p)++; |
duke@435 | 242 | } break; |
duke@435 | 243 | |
duke@435 | 244 | // these are direct CP entries so they can be directly appended, |
duke@435 | 245 | // but double and long take two constant pool entries |
duke@435 | 246 | case JVM_CONSTANT_Double: // fall through |
duke@435 | 247 | case JVM_CONSTANT_Long: |
duke@435 | 248 | { |
coleenp@4037 | 249 | ConstantPool::copy_entry_to(scratch_cp, scratch_i, *merge_cp_p, *merge_cp_length_p, |
duke@435 | 250 | THREAD); |
duke@435 | 251 | |
duke@435 | 252 | if (scratch_i != *merge_cp_length_p) { |
duke@435 | 253 | // The new entry in *merge_cp_p is at a different index than |
duke@435 | 254 | // the new entry in scratch_cp so we need to map the index values. |
duke@435 | 255 | map_index(scratch_cp, scratch_i, *merge_cp_length_p); |
duke@435 | 256 | } |
duke@435 | 257 | (*merge_cp_length_p) += 2; |
duke@435 | 258 | } break; |
duke@435 | 259 | |
duke@435 | 260 | // these are direct CP entries so they can be directly appended |
duke@435 | 261 | case JVM_CONSTANT_Float: // fall through |
duke@435 | 262 | case JVM_CONSTANT_Integer: // fall through |
duke@435 | 263 | case JVM_CONSTANT_Utf8: // fall through |
duke@435 | 264 | |
duke@435 | 265 | // This was an indirect CP entry, but it has been changed into |
coleenp@4037 | 266 | // Symbol*s so this entry can be directly appended. |
duke@435 | 267 | case JVM_CONSTANT_String: // fall through |
duke@435 | 268 | |
duke@435 | 269 | // These were indirect CP entries, but they have been changed into |
coleenp@2497 | 270 | // Symbol*s so these entries can be directly appended. |
duke@435 | 271 | case JVM_CONSTANT_UnresolvedClass: // fall through |
duke@435 | 272 | { |
coleenp@4037 | 273 | ConstantPool::copy_entry_to(scratch_cp, scratch_i, *merge_cp_p, *merge_cp_length_p, |
duke@435 | 274 | THREAD); |
duke@435 | 275 | |
duke@435 | 276 | if (scratch_i != *merge_cp_length_p) { |
duke@435 | 277 | // The new entry in *merge_cp_p is at a different index than |
duke@435 | 278 | // the new entry in scratch_cp so we need to map the index values. |
duke@435 | 279 | map_index(scratch_cp, scratch_i, *merge_cp_length_p); |
duke@435 | 280 | } |
duke@435 | 281 | (*merge_cp_length_p)++; |
duke@435 | 282 | } break; |
duke@435 | 283 | |
duke@435 | 284 | // this is an indirect CP entry so it needs special handling |
duke@435 | 285 | case JVM_CONSTANT_NameAndType: |
duke@435 | 286 | { |
duke@435 | 287 | int name_ref_i = scratch_cp->name_ref_index_at(scratch_i); |
sspitsyn@4504 | 288 | int new_name_ref_i = find_or_append_indirect_entry(scratch_cp, name_ref_i, merge_cp_p, |
sspitsyn@4504 | 289 | merge_cp_length_p, THREAD); |
duke@435 | 290 | |
duke@435 | 291 | int signature_ref_i = scratch_cp->signature_ref_index_at(scratch_i); |
sspitsyn@4504 | 292 | int new_signature_ref_i = find_or_append_indirect_entry(scratch_cp, signature_ref_i, |
sspitsyn@4504 | 293 | merge_cp_p, merge_cp_length_p, |
sspitsyn@4504 | 294 | THREAD); |
duke@435 | 295 | |
duke@435 | 296 | // If the referenced entries already exist in *merge_cp_p, then |
duke@435 | 297 | // both new_name_ref_i and new_signature_ref_i will both be 0. |
duke@435 | 298 | // In that case, all we are appending is the current entry. |
sspitsyn@4504 | 299 | if (new_name_ref_i != name_ref_i) { |
duke@435 | 300 | RC_TRACE(0x00080000, |
duke@435 | 301 | ("NameAndType entry@%d name_ref_index change: %d to %d", |
duke@435 | 302 | *merge_cp_length_p, name_ref_i, new_name_ref_i)); |
duke@435 | 303 | } |
sspitsyn@4504 | 304 | if (new_signature_ref_i != signature_ref_i) { |
duke@435 | 305 | RC_TRACE(0x00080000, |
duke@435 | 306 | ("NameAndType entry@%d signature_ref_index change: %d to %d", |
duke@435 | 307 | *merge_cp_length_p, signature_ref_i, new_signature_ref_i)); |
duke@435 | 308 | } |
duke@435 | 309 | |
duke@435 | 310 | (*merge_cp_p)->name_and_type_at_put(*merge_cp_length_p, |
duke@435 | 311 | new_name_ref_i, new_signature_ref_i); |
duke@435 | 312 | if (scratch_i != *merge_cp_length_p) { |
duke@435 | 313 | // The new entry in *merge_cp_p is at a different index than |
duke@435 | 314 | // the new entry in scratch_cp so we need to map the index values. |
duke@435 | 315 | map_index(scratch_cp, scratch_i, *merge_cp_length_p); |
duke@435 | 316 | } |
duke@435 | 317 | (*merge_cp_length_p)++; |
duke@435 | 318 | } break; |
duke@435 | 319 | |
duke@435 | 320 | // this is a double-indirect CP entry so it needs special handling |
duke@435 | 321 | case JVM_CONSTANT_Fieldref: // fall through |
duke@435 | 322 | case JVM_CONSTANT_InterfaceMethodref: // fall through |
duke@435 | 323 | case JVM_CONSTANT_Methodref: |
duke@435 | 324 | { |
duke@435 | 325 | int klass_ref_i = scratch_cp->uncached_klass_ref_index_at(scratch_i); |
sspitsyn@4504 | 326 | int new_klass_ref_i = find_or_append_indirect_entry(scratch_cp, klass_ref_i, |
sspitsyn@4504 | 327 | merge_cp_p, merge_cp_length_p, THREAD); |
sspitsyn@4504 | 328 | |
sspitsyn@4504 | 329 | int name_and_type_ref_i = scratch_cp->uncached_name_and_type_ref_index_at(scratch_i); |
sspitsyn@4504 | 330 | int new_name_and_type_ref_i = find_or_append_indirect_entry(scratch_cp, name_and_type_ref_i, |
sspitsyn@4504 | 331 | merge_cp_p, merge_cp_length_p, THREAD); |
duke@435 | 332 | |
duke@435 | 333 | const char *entry_name; |
duke@435 | 334 | switch (scratch_cp->tag_at(scratch_i).value()) { |
duke@435 | 335 | case JVM_CONSTANT_Fieldref: |
duke@435 | 336 | entry_name = "Fieldref"; |
duke@435 | 337 | (*merge_cp_p)->field_at_put(*merge_cp_length_p, new_klass_ref_i, |
duke@435 | 338 | new_name_and_type_ref_i); |
duke@435 | 339 | break; |
duke@435 | 340 | case JVM_CONSTANT_InterfaceMethodref: |
duke@435 | 341 | entry_name = "IFMethodref"; |
duke@435 | 342 | (*merge_cp_p)->interface_method_at_put(*merge_cp_length_p, |
duke@435 | 343 | new_klass_ref_i, new_name_and_type_ref_i); |
duke@435 | 344 | break; |
duke@435 | 345 | case JVM_CONSTANT_Methodref: |
duke@435 | 346 | entry_name = "Methodref"; |
duke@435 | 347 | (*merge_cp_p)->method_at_put(*merge_cp_length_p, new_klass_ref_i, |
duke@435 | 348 | new_name_and_type_ref_i); |
duke@435 | 349 | break; |
duke@435 | 350 | default: |
duke@435 | 351 | guarantee(false, "bad switch"); |
duke@435 | 352 | break; |
duke@435 | 353 | } |
duke@435 | 354 | |
duke@435 | 355 | if (klass_ref_i != new_klass_ref_i) { |
duke@435 | 356 | RC_TRACE(0x00080000, ("%s entry@%d class_index changed: %d to %d", |
duke@435 | 357 | entry_name, *merge_cp_length_p, klass_ref_i, new_klass_ref_i)); |
duke@435 | 358 | } |
duke@435 | 359 | if (name_and_type_ref_i != new_name_and_type_ref_i) { |
duke@435 | 360 | RC_TRACE(0x00080000, |
duke@435 | 361 | ("%s entry@%d name_and_type_index changed: %d to %d", |
duke@435 | 362 | entry_name, *merge_cp_length_p, name_and_type_ref_i, |
duke@435 | 363 | new_name_and_type_ref_i)); |
duke@435 | 364 | } |
duke@435 | 365 | |
duke@435 | 366 | if (scratch_i != *merge_cp_length_p) { |
duke@435 | 367 | // The new entry in *merge_cp_p is at a different index than |
duke@435 | 368 | // the new entry in scratch_cp so we need to map the index values. |
duke@435 | 369 | map_index(scratch_cp, scratch_i, *merge_cp_length_p); |
duke@435 | 370 | } |
duke@435 | 371 | (*merge_cp_length_p)++; |
duke@435 | 372 | } break; |
duke@435 | 373 | |
sspitsyn@4504 | 374 | // this is an indirect CP entry so it needs special handling |
sspitsyn@4504 | 375 | case JVM_CONSTANT_MethodType: |
sspitsyn@4504 | 376 | { |
sspitsyn@4504 | 377 | int ref_i = scratch_cp->method_type_index_at(scratch_i); |
sspitsyn@4504 | 378 | int new_ref_i = find_or_append_indirect_entry(scratch_cp, ref_i, merge_cp_p, |
sspitsyn@4504 | 379 | merge_cp_length_p, THREAD); |
sspitsyn@4504 | 380 | if (new_ref_i != ref_i) { |
sspitsyn@4504 | 381 | RC_TRACE(0x00080000, |
sspitsyn@4504 | 382 | ("MethodType entry@%d ref_index change: %d to %d", |
sspitsyn@4504 | 383 | *merge_cp_length_p, ref_i, new_ref_i)); |
sspitsyn@4504 | 384 | } |
sspitsyn@4504 | 385 | (*merge_cp_p)->method_type_index_at_put(*merge_cp_length_p, new_ref_i); |
sspitsyn@4504 | 386 | if (scratch_i != *merge_cp_length_p) { |
sspitsyn@4504 | 387 | // The new entry in *merge_cp_p is at a different index than |
sspitsyn@4504 | 388 | // the new entry in scratch_cp so we need to map the index values. |
sspitsyn@4504 | 389 | map_index(scratch_cp, scratch_i, *merge_cp_length_p); |
sspitsyn@4504 | 390 | } |
sspitsyn@4504 | 391 | (*merge_cp_length_p)++; |
sspitsyn@4504 | 392 | } break; |
sspitsyn@4504 | 393 | |
sspitsyn@4504 | 394 | // this is an indirect CP entry so it needs special handling |
sspitsyn@4504 | 395 | case JVM_CONSTANT_MethodHandle: |
sspitsyn@4504 | 396 | { |
sspitsyn@4504 | 397 | int ref_kind = scratch_cp->method_handle_ref_kind_at(scratch_i); |
sspitsyn@4504 | 398 | int ref_i = scratch_cp->method_handle_index_at(scratch_i); |
sspitsyn@4504 | 399 | int new_ref_i = find_or_append_indirect_entry(scratch_cp, ref_i, merge_cp_p, |
sspitsyn@4504 | 400 | merge_cp_length_p, THREAD); |
sspitsyn@4504 | 401 | if (new_ref_i != ref_i) { |
sspitsyn@4504 | 402 | RC_TRACE(0x00080000, |
sspitsyn@4504 | 403 | ("MethodHandle entry@%d ref_index change: %d to %d", |
sspitsyn@4504 | 404 | *merge_cp_length_p, ref_i, new_ref_i)); |
sspitsyn@4504 | 405 | } |
sspitsyn@4504 | 406 | (*merge_cp_p)->method_handle_index_at_put(*merge_cp_length_p, ref_kind, new_ref_i); |
sspitsyn@4504 | 407 | if (scratch_i != *merge_cp_length_p) { |
sspitsyn@4504 | 408 | // The new entry in *merge_cp_p is at a different index than |
sspitsyn@4504 | 409 | // the new entry in scratch_cp so we need to map the index values. |
sspitsyn@4504 | 410 | map_index(scratch_cp, scratch_i, *merge_cp_length_p); |
sspitsyn@4504 | 411 | } |
sspitsyn@4504 | 412 | (*merge_cp_length_p)++; |
sspitsyn@4504 | 413 | } break; |
sspitsyn@4504 | 414 | |
sspitsyn@4504 | 415 | // this is an indirect CP entry so it needs special handling |
sspitsyn@4504 | 416 | case JVM_CONSTANT_InvokeDynamic: |
sspitsyn@4504 | 417 | { |
sspitsyn@4504 | 418 | // TBD: cross-checks and possible extra appends into CP and bsm operands |
sspitsyn@4504 | 419 | // are needed as well. This issue is tracked by a separate bug 8007037. |
sspitsyn@4504 | 420 | int bss_idx = scratch_cp->invoke_dynamic_bootstrap_specifier_index(scratch_i); |
sspitsyn@4504 | 421 | |
sspitsyn@4504 | 422 | int ref_i = scratch_cp->invoke_dynamic_name_and_type_ref_index_at(scratch_i); |
sspitsyn@4504 | 423 | int new_ref_i = find_or_append_indirect_entry(scratch_cp, ref_i, merge_cp_p, |
sspitsyn@4504 | 424 | merge_cp_length_p, THREAD); |
sspitsyn@4504 | 425 | if (new_ref_i != ref_i) { |
sspitsyn@4504 | 426 | RC_TRACE(0x00080000, |
sspitsyn@4504 | 427 | ("InvokeDynamic entry@%d name_and_type ref_index change: %d to %d", |
sspitsyn@4504 | 428 | *merge_cp_length_p, ref_i, new_ref_i)); |
sspitsyn@4504 | 429 | } |
sspitsyn@4504 | 430 | |
sspitsyn@4504 | 431 | (*merge_cp_p)->invoke_dynamic_at_put(*merge_cp_length_p, bss_idx, new_ref_i); |
sspitsyn@4504 | 432 | if (scratch_i != *merge_cp_length_p) { |
sspitsyn@4504 | 433 | // The new entry in *merge_cp_p is at a different index than |
sspitsyn@4504 | 434 | // the new entry in scratch_cp so we need to map the index values. |
sspitsyn@4504 | 435 | map_index(scratch_cp, scratch_i, *merge_cp_length_p); |
sspitsyn@4504 | 436 | } |
sspitsyn@4504 | 437 | (*merge_cp_length_p)++; |
sspitsyn@4504 | 438 | } break; |
sspitsyn@4504 | 439 | |
duke@435 | 440 | // At this stage, Class or UnresolvedClass could be here, but not |
duke@435 | 441 | // ClassIndex |
duke@435 | 442 | case JVM_CONSTANT_ClassIndex: // fall through |
duke@435 | 443 | |
duke@435 | 444 | // Invalid is used as the tag for the second constant pool entry |
duke@435 | 445 | // occupied by JVM_CONSTANT_Double or JVM_CONSTANT_Long. It should |
duke@435 | 446 | // not be seen by itself. |
duke@435 | 447 | case JVM_CONSTANT_Invalid: // fall through |
duke@435 | 448 | |
coleenp@4037 | 449 | // At this stage, String could be here, but not StringIndex |
duke@435 | 450 | case JVM_CONSTANT_StringIndex: // fall through |
duke@435 | 451 | |
duke@435 | 452 | // At this stage JVM_CONSTANT_UnresolvedClassInError should not be |
duke@435 | 453 | // here |
duke@435 | 454 | case JVM_CONSTANT_UnresolvedClassInError: // fall through |
duke@435 | 455 | |
duke@435 | 456 | default: |
duke@435 | 457 | { |
duke@435 | 458 | // leave a breadcrumb |
duke@435 | 459 | jbyte bad_value = scratch_cp->tag_at(scratch_i).value(); |
duke@435 | 460 | ShouldNotReachHere(); |
duke@435 | 461 | } break; |
duke@435 | 462 | } // end switch tag value |
duke@435 | 463 | } // end append_entry() |
duke@435 | 464 | |
duke@435 | 465 | |
sspitsyn@4504 | 466 | int VM_RedefineClasses::find_or_append_indirect_entry(constantPoolHandle scratch_cp, |
sspitsyn@4504 | 467 | int ref_i, constantPoolHandle *merge_cp_p, int *merge_cp_length_p, TRAPS) { |
sspitsyn@4504 | 468 | |
sspitsyn@4504 | 469 | int new_ref_i = ref_i; |
sspitsyn@4504 | 470 | bool match = (ref_i < *merge_cp_length_p) && |
sspitsyn@4504 | 471 | scratch_cp->compare_entry_to(ref_i, *merge_cp_p, ref_i, THREAD); |
sspitsyn@4504 | 472 | |
sspitsyn@4504 | 473 | if (!match) { |
sspitsyn@4504 | 474 | // forward reference in *merge_cp_p or not a direct match |
sspitsyn@4504 | 475 | int found_i = scratch_cp->find_matching_entry(ref_i, *merge_cp_p, THREAD); |
sspitsyn@4504 | 476 | if (found_i != 0) { |
sspitsyn@4504 | 477 | guarantee(found_i != ref_i, "compare_entry_to() and find_matching_entry() do not agree"); |
sspitsyn@4504 | 478 | // Found a matching entry somewhere else in *merge_cp_p so just need a mapping entry. |
sspitsyn@4504 | 479 | new_ref_i = found_i; |
sspitsyn@4504 | 480 | map_index(scratch_cp, ref_i, found_i); |
sspitsyn@4504 | 481 | } else { |
sspitsyn@4504 | 482 | // no match found so we have to append this entry to *merge_cp_p |
sspitsyn@4504 | 483 | append_entry(scratch_cp, ref_i, merge_cp_p, merge_cp_length_p, THREAD); |
sspitsyn@4504 | 484 | // The above call to append_entry() can only append one entry |
sspitsyn@4504 | 485 | // so the post call query of *merge_cp_length_p is only for |
sspitsyn@4504 | 486 | // the sake of consistency. |
sspitsyn@4504 | 487 | new_ref_i = *merge_cp_length_p - 1; |
sspitsyn@4504 | 488 | } |
sspitsyn@4504 | 489 | } |
sspitsyn@4504 | 490 | |
sspitsyn@4504 | 491 | return new_ref_i; |
sspitsyn@4504 | 492 | } // end find_or_append_indirect_entry() |
sspitsyn@4504 | 493 | |
sspitsyn@4504 | 494 | |
duke@435 | 495 | jvmtiError VM_RedefineClasses::compare_and_normalize_class_versions( |
duke@435 | 496 | instanceKlassHandle the_class, |
duke@435 | 497 | instanceKlassHandle scratch_class) { |
duke@435 | 498 | int i; |
duke@435 | 499 | |
duke@435 | 500 | // Check superclasses, or rather their names, since superclasses themselves can be |
duke@435 | 501 | // requested to replace. |
duke@435 | 502 | // Check for NULL superclass first since this might be java.lang.Object |
duke@435 | 503 | if (the_class->super() != scratch_class->super() && |
duke@435 | 504 | (the_class->super() == NULL || scratch_class->super() == NULL || |
hseigel@4278 | 505 | the_class->super()->name() != |
hseigel@4278 | 506 | scratch_class->super()->name())) { |
duke@435 | 507 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_HIERARCHY_CHANGED; |
duke@435 | 508 | } |
duke@435 | 509 | |
duke@435 | 510 | // Check if the number, names and order of directly implemented interfaces are the same. |
duke@435 | 511 | // I think in principle we should just check if the sets of names of directly implemented |
duke@435 | 512 | // interfaces are the same, i.e. the order of declaration (which, however, if changed in the |
duke@435 | 513 | // .java file, also changes in .class file) should not matter. However, comparing sets is |
duke@435 | 514 | // technically a bit more difficult, and, more importantly, I am not sure at present that the |
duke@435 | 515 | // order of interfaces does not matter on the implementation level, i.e. that the VM does not |
duke@435 | 516 | // rely on it somewhere. |
coleenp@4037 | 517 | Array<Klass*>* k_interfaces = the_class->local_interfaces(); |
coleenp@4037 | 518 | Array<Klass*>* k_new_interfaces = scratch_class->local_interfaces(); |
duke@435 | 519 | int n_intfs = k_interfaces->length(); |
duke@435 | 520 | if (n_intfs != k_new_interfaces->length()) { |
duke@435 | 521 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_HIERARCHY_CHANGED; |
duke@435 | 522 | } |
duke@435 | 523 | for (i = 0; i < n_intfs; i++) { |
hseigel@4278 | 524 | if (k_interfaces->at(i)->name() != |
hseigel@4278 | 525 | k_new_interfaces->at(i)->name()) { |
duke@435 | 526 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_HIERARCHY_CHANGED; |
duke@435 | 527 | } |
duke@435 | 528 | } |
duke@435 | 529 | |
duke@435 | 530 | // Check whether class is in the error init state. |
duke@435 | 531 | if (the_class->is_in_error_state()) { |
duke@435 | 532 | // TBD #5057930: special error code is needed in 1.6 |
duke@435 | 533 | return JVMTI_ERROR_INVALID_CLASS; |
duke@435 | 534 | } |
duke@435 | 535 | |
duke@435 | 536 | // Check whether class modifiers are the same. |
duke@435 | 537 | jushort old_flags = (jushort) the_class->access_flags().get_flags(); |
duke@435 | 538 | jushort new_flags = (jushort) scratch_class->access_flags().get_flags(); |
duke@435 | 539 | if (old_flags != new_flags) { |
duke@435 | 540 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_CLASS_MODIFIERS_CHANGED; |
duke@435 | 541 | } |
duke@435 | 542 | |
duke@435 | 543 | // Check if the number, names, types and order of fields declared in these classes |
duke@435 | 544 | // are the same. |
never@3137 | 545 | JavaFieldStream old_fs(the_class); |
never@3137 | 546 | JavaFieldStream new_fs(scratch_class); |
never@3137 | 547 | for (; !old_fs.done() && !new_fs.done(); old_fs.next(), new_fs.next()) { |
duke@435 | 548 | // access |
never@3137 | 549 | old_flags = old_fs.access_flags().as_short(); |
never@3137 | 550 | new_flags = new_fs.access_flags().as_short(); |
duke@435 | 551 | if ((old_flags ^ new_flags) & JVM_RECOGNIZED_FIELD_MODIFIERS) { |
duke@435 | 552 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_SCHEMA_CHANGED; |
duke@435 | 553 | } |
duke@435 | 554 | // offset |
never@3137 | 555 | if (old_fs.offset() != new_fs.offset()) { |
duke@435 | 556 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_SCHEMA_CHANGED; |
duke@435 | 557 | } |
duke@435 | 558 | // name and signature |
never@3137 | 559 | Symbol* name_sym1 = the_class->constants()->symbol_at(old_fs.name_index()); |
never@3137 | 560 | Symbol* sig_sym1 = the_class->constants()->symbol_at(old_fs.signature_index()); |
never@3137 | 561 | Symbol* name_sym2 = scratch_class->constants()->symbol_at(new_fs.name_index()); |
never@3137 | 562 | Symbol* sig_sym2 = scratch_class->constants()->symbol_at(new_fs.signature_index()); |
duke@435 | 563 | if (name_sym1 != name_sym2 || sig_sym1 != sig_sym2) { |
duke@435 | 564 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_SCHEMA_CHANGED; |
duke@435 | 565 | } |
duke@435 | 566 | } |
duke@435 | 567 | |
never@3137 | 568 | // If both streams aren't done then we have a differing number of |
never@3137 | 569 | // fields. |
never@3137 | 570 | if (!old_fs.done() || !new_fs.done()) { |
never@3137 | 571 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_SCHEMA_CHANGED; |
never@3137 | 572 | } |
never@3137 | 573 | |
duke@435 | 574 | // Do a parallel walk through the old and new methods. Detect |
duke@435 | 575 | // cases where they match (exist in both), have been added in |
duke@435 | 576 | // the new methods, or have been deleted (exist only in the |
duke@435 | 577 | // old methods). The class file parser places methods in order |
duke@435 | 578 | // by method name, but does not order overloaded methods by |
duke@435 | 579 | // signature. In order to determine what fate befell the methods, |
duke@435 | 580 | // this code places the overloaded new methods that have matching |
duke@435 | 581 | // old methods in the same order as the old methods and places |
duke@435 | 582 | // new overloaded methods at the end of overloaded methods of |
duke@435 | 583 | // that name. The code for this order normalization is adapted |
coleenp@4037 | 584 | // from the algorithm used in InstanceKlass::find_method(). |
duke@435 | 585 | // Since we are swapping out of order entries as we find them, |
duke@435 | 586 | // we only have to search forward through the overloaded methods. |
duke@435 | 587 | // Methods which are added and have the same name as an existing |
duke@435 | 588 | // method (but different signature) will be put at the end of |
duke@435 | 589 | // the methods with that name, and the name mismatch code will |
duke@435 | 590 | // handle them. |
coleenp@4037 | 591 | Array<Method*>* k_old_methods(the_class->methods()); |
coleenp@4037 | 592 | Array<Method*>* k_new_methods(scratch_class->methods()); |
duke@435 | 593 | int n_old_methods = k_old_methods->length(); |
duke@435 | 594 | int n_new_methods = k_new_methods->length(); |
coleenp@4037 | 595 | Thread* thread = Thread::current(); |
duke@435 | 596 | |
duke@435 | 597 | int ni = 0; |
duke@435 | 598 | int oi = 0; |
duke@435 | 599 | while (true) { |
coleenp@4037 | 600 | Method* k_old_method; |
coleenp@4037 | 601 | Method* k_new_method; |
duke@435 | 602 | enum { matched, added, deleted, undetermined } method_was = undetermined; |
duke@435 | 603 | |
duke@435 | 604 | if (oi >= n_old_methods) { |
duke@435 | 605 | if (ni >= n_new_methods) { |
duke@435 | 606 | break; // we've looked at everything, done |
duke@435 | 607 | } |
duke@435 | 608 | // New method at the end |
coleenp@4037 | 609 | k_new_method = k_new_methods->at(ni); |
duke@435 | 610 | method_was = added; |
duke@435 | 611 | } else if (ni >= n_new_methods) { |
duke@435 | 612 | // Old method, at the end, is deleted |
coleenp@4037 | 613 | k_old_method = k_old_methods->at(oi); |
duke@435 | 614 | method_was = deleted; |
duke@435 | 615 | } else { |
duke@435 | 616 | // There are more methods in both the old and new lists |
coleenp@4037 | 617 | k_old_method = k_old_methods->at(oi); |
coleenp@4037 | 618 | k_new_method = k_new_methods->at(ni); |
duke@435 | 619 | if (k_old_method->name() != k_new_method->name()) { |
duke@435 | 620 | // Methods are sorted by method name, so a mismatch means added |
duke@435 | 621 | // or deleted |
duke@435 | 622 | if (k_old_method->name()->fast_compare(k_new_method->name()) > 0) { |
duke@435 | 623 | method_was = added; |
duke@435 | 624 | } else { |
duke@435 | 625 | method_was = deleted; |
duke@435 | 626 | } |
duke@435 | 627 | } else if (k_old_method->signature() == k_new_method->signature()) { |
duke@435 | 628 | // Both the name and signature match |
duke@435 | 629 | method_was = matched; |
duke@435 | 630 | } else { |
duke@435 | 631 | // The name matches, but the signature doesn't, which means we have to |
duke@435 | 632 | // search forward through the new overloaded methods. |
duke@435 | 633 | int nj; // outside the loop for post-loop check |
duke@435 | 634 | for (nj = ni + 1; nj < n_new_methods; nj++) { |
coleenp@4037 | 635 | Method* m = k_new_methods->at(nj); |
duke@435 | 636 | if (k_old_method->name() != m->name()) { |
duke@435 | 637 | // reached another method name so no more overloaded methods |
duke@435 | 638 | method_was = deleted; |
duke@435 | 639 | break; |
duke@435 | 640 | } |
duke@435 | 641 | if (k_old_method->signature() == m->signature()) { |
duke@435 | 642 | // found a match so swap the methods |
coleenp@4037 | 643 | k_new_methods->at_put(ni, m); |
coleenp@4037 | 644 | k_new_methods->at_put(nj, k_new_method); |
duke@435 | 645 | k_new_method = m; |
duke@435 | 646 | method_was = matched; |
duke@435 | 647 | break; |
duke@435 | 648 | } |
duke@435 | 649 | } |
duke@435 | 650 | |
duke@435 | 651 | if (nj >= n_new_methods) { |
duke@435 | 652 | // reached the end without a match; so method was deleted |
duke@435 | 653 | method_was = deleted; |
duke@435 | 654 | } |
duke@435 | 655 | } |
duke@435 | 656 | } |
duke@435 | 657 | |
duke@435 | 658 | switch (method_was) { |
duke@435 | 659 | case matched: |
duke@435 | 660 | // methods match, be sure modifiers do too |
duke@435 | 661 | old_flags = (jushort) k_old_method->access_flags().get_flags(); |
duke@435 | 662 | new_flags = (jushort) k_new_method->access_flags().get_flags(); |
duke@435 | 663 | if ((old_flags ^ new_flags) & ~(JVM_ACC_NATIVE)) { |
duke@435 | 664 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_METHOD_MODIFIERS_CHANGED; |
duke@435 | 665 | } |
duke@435 | 666 | { |
duke@435 | 667 | u2 new_num = k_new_method->method_idnum(); |
duke@435 | 668 | u2 old_num = k_old_method->method_idnum(); |
duke@435 | 669 | if (new_num != old_num) { |
coleenp@4037 | 670 | Method* idnum_owner = scratch_class->method_with_idnum(old_num); |
duke@435 | 671 | if (idnum_owner != NULL) { |
duke@435 | 672 | // There is already a method assigned this idnum -- switch them |
duke@435 | 673 | idnum_owner->set_method_idnum(new_num); |
duke@435 | 674 | } |
duke@435 | 675 | k_new_method->set_method_idnum(old_num); |
coleenp@4572 | 676 | if (thread->has_pending_exception()) { |
coleenp@4572 | 677 | return JVMTI_ERROR_OUT_OF_MEMORY; |
coleenp@4572 | 678 | } |
duke@435 | 679 | } |
duke@435 | 680 | } |
duke@435 | 681 | RC_TRACE(0x00008000, ("Method matched: new: %s [%d] == old: %s [%d]", |
duke@435 | 682 | k_new_method->name_and_sig_as_C_string(), ni, |
duke@435 | 683 | k_old_method->name_and_sig_as_C_string(), oi)); |
duke@435 | 684 | // advance to next pair of methods |
duke@435 | 685 | ++oi; |
duke@435 | 686 | ++ni; |
duke@435 | 687 | break; |
duke@435 | 688 | case added: |
duke@435 | 689 | // method added, see if it is OK |
duke@435 | 690 | new_flags = (jushort) k_new_method->access_flags().get_flags(); |
duke@435 | 691 | if ((new_flags & JVM_ACC_PRIVATE) == 0 |
duke@435 | 692 | // hack: private should be treated as final, but alas |
duke@435 | 693 | || (new_flags & (JVM_ACC_FINAL|JVM_ACC_STATIC)) == 0 |
duke@435 | 694 | ) { |
duke@435 | 695 | // new methods must be private |
duke@435 | 696 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_METHOD_ADDED; |
duke@435 | 697 | } |
duke@435 | 698 | { |
duke@435 | 699 | u2 num = the_class->next_method_idnum(); |
coleenp@4037 | 700 | if (num == ConstMethod::UNSET_IDNUM) { |
duke@435 | 701 | // cannot add any more methods |
duke@435 | 702 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_METHOD_ADDED; |
duke@435 | 703 | } |
duke@435 | 704 | u2 new_num = k_new_method->method_idnum(); |
coleenp@4037 | 705 | Method* idnum_owner = scratch_class->method_with_idnum(num); |
duke@435 | 706 | if (idnum_owner != NULL) { |
duke@435 | 707 | // There is already a method assigned this idnum -- switch them |
duke@435 | 708 | idnum_owner->set_method_idnum(new_num); |
duke@435 | 709 | } |
duke@435 | 710 | k_new_method->set_method_idnum(num); |
coleenp@4037 | 711 | if (thread->has_pending_exception()) { |
coleenp@4037 | 712 | return JVMTI_ERROR_OUT_OF_MEMORY; |
coleenp@4037 | 713 | } |
duke@435 | 714 | } |
duke@435 | 715 | RC_TRACE(0x00008000, ("Method added: new: %s [%d]", |
duke@435 | 716 | k_new_method->name_and_sig_as_C_string(), ni)); |
duke@435 | 717 | ++ni; // advance to next new method |
duke@435 | 718 | break; |
duke@435 | 719 | case deleted: |
duke@435 | 720 | // method deleted, see if it is OK |
duke@435 | 721 | old_flags = (jushort) k_old_method->access_flags().get_flags(); |
duke@435 | 722 | if ((old_flags & JVM_ACC_PRIVATE) == 0 |
duke@435 | 723 | // hack: private should be treated as final, but alas |
duke@435 | 724 | || (old_flags & (JVM_ACC_FINAL|JVM_ACC_STATIC)) == 0 |
duke@435 | 725 | ) { |
duke@435 | 726 | // deleted methods must be private |
duke@435 | 727 | return JVMTI_ERROR_UNSUPPORTED_REDEFINITION_METHOD_DELETED; |
duke@435 | 728 | } |
duke@435 | 729 | RC_TRACE(0x00008000, ("Method deleted: old: %s [%d]", |
duke@435 | 730 | k_old_method->name_and_sig_as_C_string(), oi)); |
duke@435 | 731 | ++oi; // advance to next old method |
duke@435 | 732 | break; |
duke@435 | 733 | default: |
duke@435 | 734 | ShouldNotReachHere(); |
duke@435 | 735 | } |
duke@435 | 736 | } |
duke@435 | 737 | |
duke@435 | 738 | return JVMTI_ERROR_NONE; |
duke@435 | 739 | } |
duke@435 | 740 | |
duke@435 | 741 | |
duke@435 | 742 | // Find new constant pool index value for old constant pool index value |
duke@435 | 743 | // by seaching the index map. Returns zero (0) if there is no mapped |
duke@435 | 744 | // value for the old constant pool index. |
duke@435 | 745 | int VM_RedefineClasses::find_new_index(int old_index) { |
duke@435 | 746 | if (_index_map_count == 0) { |
duke@435 | 747 | // map is empty so nothing can be found |
duke@435 | 748 | return 0; |
duke@435 | 749 | } |
duke@435 | 750 | |
duke@435 | 751 | if (old_index < 1 || old_index >= _index_map_p->length()) { |
duke@435 | 752 | // The old_index is out of range so it is not mapped. This should |
duke@435 | 753 | // not happen in regular constant pool merging use, but it can |
duke@435 | 754 | // happen if a corrupt annotation is processed. |
duke@435 | 755 | return 0; |
duke@435 | 756 | } |
duke@435 | 757 | |
duke@435 | 758 | int value = _index_map_p->at(old_index); |
duke@435 | 759 | if (value == -1) { |
duke@435 | 760 | // the old_index is not mapped |
duke@435 | 761 | return 0; |
duke@435 | 762 | } |
duke@435 | 763 | |
duke@435 | 764 | return value; |
duke@435 | 765 | } // end find_new_index() |
duke@435 | 766 | |
duke@435 | 767 | |
duke@435 | 768 | // Returns true if the current mismatch is due to a resolved/unresolved |
duke@435 | 769 | // class pair. Otherwise, returns false. |
duke@435 | 770 | bool VM_RedefineClasses::is_unresolved_class_mismatch(constantPoolHandle cp1, |
duke@435 | 771 | int index1, constantPoolHandle cp2, int index2) { |
duke@435 | 772 | |
duke@435 | 773 | jbyte t1 = cp1->tag_at(index1).value(); |
duke@435 | 774 | if (t1 != JVM_CONSTANT_Class && t1 != JVM_CONSTANT_UnresolvedClass) { |
duke@435 | 775 | return false; // wrong entry type; not our special case |
duke@435 | 776 | } |
duke@435 | 777 | |
duke@435 | 778 | jbyte t2 = cp2->tag_at(index2).value(); |
duke@435 | 779 | if (t2 != JVM_CONSTANT_Class && t2 != JVM_CONSTANT_UnresolvedClass) { |
duke@435 | 780 | return false; // wrong entry type; not our special case |
duke@435 | 781 | } |
duke@435 | 782 | |
duke@435 | 783 | if (t1 == t2) { |
duke@435 | 784 | return false; // not a mismatch; not our special case |
duke@435 | 785 | } |
duke@435 | 786 | |
duke@435 | 787 | char *s1 = cp1->klass_name_at(index1)->as_C_string(); |
duke@435 | 788 | char *s2 = cp2->klass_name_at(index2)->as_C_string(); |
duke@435 | 789 | if (strcmp(s1, s2) != 0) { |
duke@435 | 790 | return false; // strings don't match; not our special case |
duke@435 | 791 | } |
duke@435 | 792 | |
duke@435 | 793 | return true; // made it through the gauntlet; this is our special case |
duke@435 | 794 | } // end is_unresolved_class_mismatch() |
duke@435 | 795 | |
duke@435 | 796 | |
duke@435 | 797 | jvmtiError VM_RedefineClasses::load_new_class_versions(TRAPS) { |
coleenp@4037 | 798 | |
duke@435 | 799 | // For consistency allocate memory using os::malloc wrapper. |
coleenp@4037 | 800 | _scratch_classes = (Klass**) |
coleenp@4037 | 801 | os::malloc(sizeof(Klass*) * _class_count, mtClass); |
duke@435 | 802 | if (_scratch_classes == NULL) { |
duke@435 | 803 | return JVMTI_ERROR_OUT_OF_MEMORY; |
duke@435 | 804 | } |
coleenp@4037 | 805 | // Zero initialize the _scratch_classes array. |
coleenp@4037 | 806 | for (int i = 0; i < _class_count; i++) { |
coleenp@4037 | 807 | _scratch_classes[i] = NULL; |
coleenp@4037 | 808 | } |
duke@435 | 809 | |
duke@435 | 810 | ResourceMark rm(THREAD); |
duke@435 | 811 | |
duke@435 | 812 | JvmtiThreadState *state = JvmtiThreadState::state_for(JavaThread::current()); |
dcubed@1044 | 813 | // state can only be NULL if the current thread is exiting which |
dcubed@1044 | 814 | // should not happen since we're trying to do a RedefineClasses |
dcubed@1044 | 815 | guarantee(state != NULL, "exiting thread calling load_new_class_versions"); |
duke@435 | 816 | for (int i = 0; i < _class_count; i++) { |
coleenp@4037 | 817 | // Create HandleMark so that any handles created while loading new class |
coleenp@4037 | 818 | // versions are deleted. Constant pools are deallocated while merging |
coleenp@4037 | 819 | // constant pools |
coleenp@4037 | 820 | HandleMark hm(THREAD); |
coleenp@4037 | 821 | |
duke@435 | 822 | oop mirror = JNIHandles::resolve_non_null(_class_defs[i].klass); |
duke@435 | 823 | // classes for primitives cannot be redefined |
duke@435 | 824 | if (!is_modifiable_class(mirror)) { |
duke@435 | 825 | return JVMTI_ERROR_UNMODIFIABLE_CLASS; |
duke@435 | 826 | } |
coleenp@4037 | 827 | Klass* the_class_oop = java_lang_Class::as_Klass(mirror); |
duke@435 | 828 | instanceKlassHandle the_class = instanceKlassHandle(THREAD, the_class_oop); |
coleenp@2497 | 829 | Symbol* the_class_sym = the_class->name(); |
duke@435 | 830 | |
duke@435 | 831 | // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark |
duke@435 | 832 | RC_TRACE_WITH_THREAD(0x00000001, THREAD, |
dcubed@3360 | 833 | ("loading name=%s kind=%d (avail_mem=" UINT64_FORMAT "K)", |
dcubed@3360 | 834 | the_class->external_name(), _class_load_kind, |
dcubed@3360 | 835 | os::available_memory() >> 10)); |
duke@435 | 836 | |
duke@435 | 837 | ClassFileStream st((u1*) _class_defs[i].class_bytes, |
duke@435 | 838 | _class_defs[i].class_byte_count, (char *)"__VM_RedefineClasses__"); |
duke@435 | 839 | |
duke@435 | 840 | // Parse the stream. |
duke@435 | 841 | Handle the_class_loader(THREAD, the_class->class_loader()); |
duke@435 | 842 | Handle protection_domain(THREAD, the_class->protection_domain()); |
duke@435 | 843 | // Set redefined class handle in JvmtiThreadState class. |
duke@435 | 844 | // This redefined class is sent to agent event handler for class file |
duke@435 | 845 | // load hook event. |
duke@435 | 846 | state->set_class_being_redefined(&the_class, _class_load_kind); |
duke@435 | 847 | |
coleenp@4037 | 848 | Klass* k = SystemDictionary::parse_stream(the_class_sym, |
duke@435 | 849 | the_class_loader, |
duke@435 | 850 | protection_domain, |
duke@435 | 851 | &st, |
duke@435 | 852 | THREAD); |
duke@435 | 853 | // Clear class_being_redefined just to be sure. |
duke@435 | 854 | state->clear_class_being_redefined(); |
duke@435 | 855 | |
duke@435 | 856 | // TODO: if this is retransform, and nothing changed we can skip it |
duke@435 | 857 | |
duke@435 | 858 | instanceKlassHandle scratch_class (THREAD, k); |
duke@435 | 859 | |
coleenp@4037 | 860 | // Need to clean up allocated InstanceKlass if there's an error so assign |
coleenp@4037 | 861 | // the result here. Caller deallocates all the scratch classes in case of |
coleenp@4037 | 862 | // an error. |
coleenp@4037 | 863 | _scratch_classes[i] = k; |
coleenp@4037 | 864 | |
duke@435 | 865 | if (HAS_PENDING_EXCEPTION) { |
coleenp@4037 | 866 | Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); |
duke@435 | 867 | // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark |
duke@435 | 868 | RC_TRACE_WITH_THREAD(0x00000002, THREAD, ("parse_stream exception: '%s'", |
duke@435 | 869 | ex_name->as_C_string())); |
duke@435 | 870 | CLEAR_PENDING_EXCEPTION; |
duke@435 | 871 | |
duke@435 | 872 | if (ex_name == vmSymbols::java_lang_UnsupportedClassVersionError()) { |
duke@435 | 873 | return JVMTI_ERROR_UNSUPPORTED_VERSION; |
duke@435 | 874 | } else if (ex_name == vmSymbols::java_lang_ClassFormatError()) { |
duke@435 | 875 | return JVMTI_ERROR_INVALID_CLASS_FORMAT; |
duke@435 | 876 | } else if (ex_name == vmSymbols::java_lang_ClassCircularityError()) { |
duke@435 | 877 | return JVMTI_ERROR_CIRCULAR_CLASS_DEFINITION; |
duke@435 | 878 | } else if (ex_name == vmSymbols::java_lang_NoClassDefFoundError()) { |
duke@435 | 879 | // The message will be "XXX (wrong name: YYY)" |
duke@435 | 880 | return JVMTI_ERROR_NAMES_DONT_MATCH; |
duke@435 | 881 | } else if (ex_name == vmSymbols::java_lang_OutOfMemoryError()) { |
duke@435 | 882 | return JVMTI_ERROR_OUT_OF_MEMORY; |
duke@435 | 883 | } else { // Just in case more exceptions can be thrown.. |
duke@435 | 884 | return JVMTI_ERROR_FAILS_VERIFICATION; |
duke@435 | 885 | } |
duke@435 | 886 | } |
duke@435 | 887 | |
duke@435 | 888 | // Ensure class is linked before redefine |
duke@435 | 889 | if (!the_class->is_linked()) { |
duke@435 | 890 | the_class->link_class(THREAD); |
duke@435 | 891 | if (HAS_PENDING_EXCEPTION) { |
coleenp@4037 | 892 | Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); |
duke@435 | 893 | // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark |
duke@435 | 894 | RC_TRACE_WITH_THREAD(0x00000002, THREAD, ("link_class exception: '%s'", |
duke@435 | 895 | ex_name->as_C_string())); |
duke@435 | 896 | CLEAR_PENDING_EXCEPTION; |
duke@435 | 897 | if (ex_name == vmSymbols::java_lang_OutOfMemoryError()) { |
duke@435 | 898 | return JVMTI_ERROR_OUT_OF_MEMORY; |
duke@435 | 899 | } else { |
duke@435 | 900 | return JVMTI_ERROR_INTERNAL; |
duke@435 | 901 | } |
duke@435 | 902 | } |
duke@435 | 903 | } |
duke@435 | 904 | |
duke@435 | 905 | // Do the validity checks in compare_and_normalize_class_versions() |
duke@435 | 906 | // before verifying the byte codes. By doing these checks first, we |
duke@435 | 907 | // limit the number of functions that require redirection from |
duke@435 | 908 | // the_class to scratch_class. In particular, we don't have to |
duke@435 | 909 | // modify JNI GetSuperclass() and thus won't change its performance. |
duke@435 | 910 | jvmtiError res = compare_and_normalize_class_versions(the_class, |
duke@435 | 911 | scratch_class); |
duke@435 | 912 | if (res != JVMTI_ERROR_NONE) { |
duke@435 | 913 | return res; |
duke@435 | 914 | } |
duke@435 | 915 | |
duke@435 | 916 | // verify what the caller passed us |
duke@435 | 917 | { |
duke@435 | 918 | // The bug 6214132 caused the verification to fail. |
duke@435 | 919 | // Information about the_class and scratch_class is temporarily |
duke@435 | 920 | // recorded into jvmtiThreadState. This data is used to redirect |
duke@435 | 921 | // the_class to scratch_class in the JVM_* functions called by the |
duke@435 | 922 | // verifier. Please, refer to jvmtiThreadState.hpp for the detailed |
duke@435 | 923 | // description. |
duke@435 | 924 | RedefineVerifyMark rvm(&the_class, &scratch_class, state); |
duke@435 | 925 | Verifier::verify( |
acorn@1408 | 926 | scratch_class, Verifier::ThrowException, true, THREAD); |
duke@435 | 927 | } |
duke@435 | 928 | |
duke@435 | 929 | if (HAS_PENDING_EXCEPTION) { |
coleenp@4037 | 930 | Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); |
duke@435 | 931 | // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark |
duke@435 | 932 | RC_TRACE_WITH_THREAD(0x00000002, THREAD, |
duke@435 | 933 | ("verify_byte_codes exception: '%s'", ex_name->as_C_string())); |
duke@435 | 934 | CLEAR_PENDING_EXCEPTION; |
duke@435 | 935 | if (ex_name == vmSymbols::java_lang_OutOfMemoryError()) { |
duke@435 | 936 | return JVMTI_ERROR_OUT_OF_MEMORY; |
duke@435 | 937 | } else { |
duke@435 | 938 | // tell the caller the bytecodes are bad |
duke@435 | 939 | return JVMTI_ERROR_FAILS_VERIFICATION; |
duke@435 | 940 | } |
duke@435 | 941 | } |
duke@435 | 942 | |
duke@435 | 943 | res = merge_cp_and_rewrite(the_class, scratch_class, THREAD); |
duke@435 | 944 | if (res != JVMTI_ERROR_NONE) { |
duke@435 | 945 | return res; |
duke@435 | 946 | } |
duke@435 | 947 | |
duke@435 | 948 | if (VerifyMergedCPBytecodes) { |
duke@435 | 949 | // verify what we have done during constant pool merging |
duke@435 | 950 | { |
duke@435 | 951 | RedefineVerifyMark rvm(&the_class, &scratch_class, state); |
acorn@1408 | 952 | Verifier::verify(scratch_class, Verifier::ThrowException, true, THREAD); |
duke@435 | 953 | } |
duke@435 | 954 | |
duke@435 | 955 | if (HAS_PENDING_EXCEPTION) { |
coleenp@4037 | 956 | Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); |
duke@435 | 957 | // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark |
duke@435 | 958 | RC_TRACE_WITH_THREAD(0x00000002, THREAD, |
duke@435 | 959 | ("verify_byte_codes post merge-CP exception: '%s'", |
duke@435 | 960 | ex_name->as_C_string())); |
duke@435 | 961 | CLEAR_PENDING_EXCEPTION; |
duke@435 | 962 | if (ex_name == vmSymbols::java_lang_OutOfMemoryError()) { |
duke@435 | 963 | return JVMTI_ERROR_OUT_OF_MEMORY; |
duke@435 | 964 | } else { |
duke@435 | 965 | // tell the caller that constant pool merging screwed up |
duke@435 | 966 | return JVMTI_ERROR_INTERNAL; |
duke@435 | 967 | } |
duke@435 | 968 | } |
duke@435 | 969 | } |
duke@435 | 970 | |
duke@435 | 971 | Rewriter::rewrite(scratch_class, THREAD); |
coleenp@2945 | 972 | if (!HAS_PENDING_EXCEPTION) { |
coleenp@4395 | 973 | scratch_class->link_methods(THREAD); |
coleenp@2945 | 974 | } |
duke@435 | 975 | if (HAS_PENDING_EXCEPTION) { |
coleenp@4037 | 976 | Symbol* ex_name = PENDING_EXCEPTION->klass()->name(); |
duke@435 | 977 | CLEAR_PENDING_EXCEPTION; |
duke@435 | 978 | if (ex_name == vmSymbols::java_lang_OutOfMemoryError()) { |
duke@435 | 979 | return JVMTI_ERROR_OUT_OF_MEMORY; |
duke@435 | 980 | } else { |
duke@435 | 981 | return JVMTI_ERROR_INTERNAL; |
duke@435 | 982 | } |
duke@435 | 983 | } |
duke@435 | 984 | |
duke@435 | 985 | // RC_TRACE_WITH_THREAD macro has an embedded ResourceMark |
duke@435 | 986 | RC_TRACE_WITH_THREAD(0x00000001, THREAD, |
duke@435 | 987 | ("loaded name=%s (avail_mem=" UINT64_FORMAT "K)", |
duke@435 | 988 | the_class->external_name(), os::available_memory() >> 10)); |
duke@435 | 989 | } |
duke@435 | 990 | |
duke@435 | 991 | return JVMTI_ERROR_NONE; |
duke@435 | 992 | } |
duke@435 | 993 | |
duke@435 | 994 | |
duke@435 | 995 | // Map old_index to new_index as needed. scratch_cp is only needed |
duke@435 | 996 | // for RC_TRACE() calls. |
duke@435 | 997 | void VM_RedefineClasses::map_index(constantPoolHandle scratch_cp, |
duke@435 | 998 | int old_index, int new_index) { |
duke@435 | 999 | if (find_new_index(old_index) != 0) { |
duke@435 | 1000 | // old_index is already mapped |
duke@435 | 1001 | return; |
duke@435 | 1002 | } |
duke@435 | 1003 | |
duke@435 | 1004 | if (old_index == new_index) { |
duke@435 | 1005 | // no mapping is needed |
duke@435 | 1006 | return; |
duke@435 | 1007 | } |
duke@435 | 1008 | |
duke@435 | 1009 | _index_map_p->at_put(old_index, new_index); |
duke@435 | 1010 | _index_map_count++; |
duke@435 | 1011 | |
duke@435 | 1012 | RC_TRACE(0x00040000, ("mapped tag %d at index %d to %d", |
duke@435 | 1013 | scratch_cp->tag_at(old_index).value(), old_index, new_index)); |
duke@435 | 1014 | } // end map_index() |
duke@435 | 1015 | |
duke@435 | 1016 | |
duke@435 | 1017 | // Merge old_cp and scratch_cp and return the results of the merge via |
duke@435 | 1018 | // merge_cp_p. The number of entries in *merge_cp_p is returned via |
duke@435 | 1019 | // merge_cp_length_p. The entries in old_cp occupy the same locations |
duke@435 | 1020 | // in *merge_cp_p. Also creates a map of indices from entries in |
duke@435 | 1021 | // scratch_cp to the corresponding entry in *merge_cp_p. Index map |
duke@435 | 1022 | // entries are only created for entries in scratch_cp that occupy a |
duke@435 | 1023 | // different location in *merged_cp_p. |
duke@435 | 1024 | bool VM_RedefineClasses::merge_constant_pools(constantPoolHandle old_cp, |
duke@435 | 1025 | constantPoolHandle scratch_cp, constantPoolHandle *merge_cp_p, |
duke@435 | 1026 | int *merge_cp_length_p, TRAPS) { |
duke@435 | 1027 | |
duke@435 | 1028 | if (merge_cp_p == NULL) { |
coleenp@4037 | 1029 | assert(false, "caller must provide scratch constantPool"); |
duke@435 | 1030 | return false; // robustness |
duke@435 | 1031 | } |
duke@435 | 1032 | if (merge_cp_length_p == NULL) { |
coleenp@4037 | 1033 | assert(false, "caller must provide scratch CP length"); |
duke@435 | 1034 | return false; // robustness |
duke@435 | 1035 | } |
duke@435 | 1036 | // Worst case we need old_cp->length() + scratch_cp()->length(), |
duke@435 | 1037 | // but the caller might be smart so make sure we have at least |
duke@435 | 1038 | // the minimum. |
duke@435 | 1039 | if ((*merge_cp_p)->length() < old_cp->length()) { |
duke@435 | 1040 | assert(false, "merge area too small"); |
duke@435 | 1041 | return false; // robustness |
duke@435 | 1042 | } |
duke@435 | 1043 | |
duke@435 | 1044 | RC_TRACE_WITH_THREAD(0x00010000, THREAD, |
duke@435 | 1045 | ("old_cp_len=%d, scratch_cp_len=%d", old_cp->length(), |
duke@435 | 1046 | scratch_cp->length())); |
duke@435 | 1047 | |
duke@435 | 1048 | { |
duke@435 | 1049 | // Pass 0: |
duke@435 | 1050 | // The old_cp is copied to *merge_cp_p; this means that any code |
duke@435 | 1051 | // using old_cp does not have to change. This work looks like a |
coleenp@4037 | 1052 | // perfect fit for ConstantPool*::copy_cp_to(), but we need to |
duke@435 | 1053 | // handle one special case: |
duke@435 | 1054 | // - revert JVM_CONSTANT_Class to JVM_CONSTANT_UnresolvedClass |
duke@435 | 1055 | // This will make verification happy. |
duke@435 | 1056 | |
duke@435 | 1057 | int old_i; // index into old_cp |
duke@435 | 1058 | |
duke@435 | 1059 | // index zero (0) is not used in constantPools |
duke@435 | 1060 | for (old_i = 1; old_i < old_cp->length(); old_i++) { |
duke@435 | 1061 | // leave debugging crumb |
duke@435 | 1062 | jbyte old_tag = old_cp->tag_at(old_i).value(); |
duke@435 | 1063 | switch (old_tag) { |
duke@435 | 1064 | case JVM_CONSTANT_Class: |
coleenp@2614 | 1065 | case JVM_CONSTANT_UnresolvedClass: |
duke@435 | 1066 | // revert the copy to JVM_CONSTANT_UnresolvedClass |
coleenp@2614 | 1067 | // May be resolving while calling this so do the same for |
coleenp@2614 | 1068 | // JVM_CONSTANT_UnresolvedClass (klass_name_at() deals with transition) |
duke@435 | 1069 | (*merge_cp_p)->unresolved_klass_at_put(old_i, |
duke@435 | 1070 | old_cp->klass_name_at(old_i)); |
duke@435 | 1071 | break; |
duke@435 | 1072 | |
duke@435 | 1073 | case JVM_CONSTANT_Double: |
duke@435 | 1074 | case JVM_CONSTANT_Long: |
duke@435 | 1075 | // just copy the entry to *merge_cp_p, but double and long take |
duke@435 | 1076 | // two constant pool entries |
coleenp@4037 | 1077 | ConstantPool::copy_entry_to(old_cp, old_i, *merge_cp_p, old_i, CHECK_0); |
duke@435 | 1078 | old_i++; |
duke@435 | 1079 | break; |
duke@435 | 1080 | |
duke@435 | 1081 | default: |
duke@435 | 1082 | // just copy the entry to *merge_cp_p |
coleenp@4037 | 1083 | ConstantPool::copy_entry_to(old_cp, old_i, *merge_cp_p, old_i, CHECK_0); |
duke@435 | 1084 | break; |
duke@435 | 1085 | } |
duke@435 | 1086 | } // end for each old_cp entry |
duke@435 | 1087 | |
sspitsyn@4493 | 1088 | ConstantPool::copy_operands(old_cp, *merge_cp_p, CHECK_0); |
sspitsyn@4493 | 1089 | |
duke@435 | 1090 | // We don't need to sanity check that *merge_cp_length_p is within |
duke@435 | 1091 | // *merge_cp_p bounds since we have the minimum on-entry check above. |
duke@435 | 1092 | (*merge_cp_length_p) = old_i; |
duke@435 | 1093 | } |
duke@435 | 1094 | |
duke@435 | 1095 | // merge_cp_len should be the same as old_cp->length() at this point |
duke@435 | 1096 | // so this trace message is really a "warm-and-breathing" message. |
duke@435 | 1097 | RC_TRACE_WITH_THREAD(0x00020000, THREAD, |
duke@435 | 1098 | ("after pass 0: merge_cp_len=%d", *merge_cp_length_p)); |
duke@435 | 1099 | |
duke@435 | 1100 | int scratch_i; // index into scratch_cp |
duke@435 | 1101 | { |
duke@435 | 1102 | // Pass 1a: |
duke@435 | 1103 | // Compare scratch_cp entries to the old_cp entries that we have |
duke@435 | 1104 | // already copied to *merge_cp_p. In this pass, we are eliminating |
duke@435 | 1105 | // exact duplicates (matching entry at same index) so we only |
duke@435 | 1106 | // compare entries in the common indice range. |
duke@435 | 1107 | int increment = 1; |
duke@435 | 1108 | int pass1a_length = MIN2(old_cp->length(), scratch_cp->length()); |
duke@435 | 1109 | for (scratch_i = 1; scratch_i < pass1a_length; scratch_i += increment) { |
duke@435 | 1110 | switch (scratch_cp->tag_at(scratch_i).value()) { |
duke@435 | 1111 | case JVM_CONSTANT_Double: |
duke@435 | 1112 | case JVM_CONSTANT_Long: |
duke@435 | 1113 | // double and long take two constant pool entries |
duke@435 | 1114 | increment = 2; |
duke@435 | 1115 | break; |
duke@435 | 1116 | |
duke@435 | 1117 | default: |
duke@435 | 1118 | increment = 1; |
duke@435 | 1119 | break; |
duke@435 | 1120 | } |
duke@435 | 1121 | |
duke@435 | 1122 | bool match = scratch_cp->compare_entry_to(scratch_i, *merge_cp_p, |
duke@435 | 1123 | scratch_i, CHECK_0); |
duke@435 | 1124 | if (match) { |
duke@435 | 1125 | // found a match at the same index so nothing more to do |
duke@435 | 1126 | continue; |
duke@435 | 1127 | } else if (is_unresolved_class_mismatch(scratch_cp, scratch_i, |
duke@435 | 1128 | *merge_cp_p, scratch_i)) { |
duke@435 | 1129 | // The mismatch in compare_entry_to() above is because of a |
duke@435 | 1130 | // resolved versus unresolved class entry at the same index |
duke@435 | 1131 | // with the same string value. Since Pass 0 reverted any |
duke@435 | 1132 | // class entries to unresolved class entries in *merge_cp_p, |
duke@435 | 1133 | // we go with the unresolved class entry. |
duke@435 | 1134 | continue; |
duke@435 | 1135 | } |
duke@435 | 1136 | |
duke@435 | 1137 | int found_i = scratch_cp->find_matching_entry(scratch_i, *merge_cp_p, |
duke@435 | 1138 | CHECK_0); |
duke@435 | 1139 | if (found_i != 0) { |
duke@435 | 1140 | guarantee(found_i != scratch_i, |
duke@435 | 1141 | "compare_entry_to() and find_matching_entry() do not agree"); |
duke@435 | 1142 | |
duke@435 | 1143 | // Found a matching entry somewhere else in *merge_cp_p so |
duke@435 | 1144 | // just need a mapping entry. |
duke@435 | 1145 | map_index(scratch_cp, scratch_i, found_i); |
duke@435 | 1146 | continue; |
duke@435 | 1147 | } |
duke@435 | 1148 | |
duke@435 | 1149 | // The find_matching_entry() call above could fail to find a match |
duke@435 | 1150 | // due to a resolved versus unresolved class or string entry situation |
duke@435 | 1151 | // like we solved above with the is_unresolved_*_mismatch() calls. |
duke@435 | 1152 | // However, we would have to call is_unresolved_*_mismatch() over |
duke@435 | 1153 | // all of *merge_cp_p (potentially) and that doesn't seem to be |
duke@435 | 1154 | // worth the time. |
duke@435 | 1155 | |
duke@435 | 1156 | // No match found so we have to append this entry and any unique |
duke@435 | 1157 | // referenced entries to *merge_cp_p. |
duke@435 | 1158 | append_entry(scratch_cp, scratch_i, merge_cp_p, merge_cp_length_p, |
duke@435 | 1159 | CHECK_0); |
duke@435 | 1160 | } |
duke@435 | 1161 | } |
duke@435 | 1162 | |
duke@435 | 1163 | RC_TRACE_WITH_THREAD(0x00020000, THREAD, |
duke@435 | 1164 | ("after pass 1a: merge_cp_len=%d, scratch_i=%d, index_map_len=%d", |
duke@435 | 1165 | *merge_cp_length_p, scratch_i, _index_map_count)); |
duke@435 | 1166 | |
duke@435 | 1167 | if (scratch_i < scratch_cp->length()) { |
duke@435 | 1168 | // Pass 1b: |
duke@435 | 1169 | // old_cp is smaller than scratch_cp so there are entries in |
duke@435 | 1170 | // scratch_cp that we have not yet processed. We take care of |
duke@435 | 1171 | // those now. |
duke@435 | 1172 | int increment = 1; |
duke@435 | 1173 | for (; scratch_i < scratch_cp->length(); scratch_i += increment) { |
duke@435 | 1174 | switch (scratch_cp->tag_at(scratch_i).value()) { |
duke@435 | 1175 | case JVM_CONSTANT_Double: |
duke@435 | 1176 | case JVM_CONSTANT_Long: |
duke@435 | 1177 | // double and long take two constant pool entries |
duke@435 | 1178 | increment = 2; |
duke@435 | 1179 | break; |
duke@435 | 1180 | |
duke@435 | 1181 | default: |
duke@435 | 1182 | increment = 1; |
duke@435 | 1183 | break; |
duke@435 | 1184 | } |
duke@435 | 1185 | |
duke@435 | 1186 | int found_i = |
duke@435 | 1187 | scratch_cp->find_matching_entry(scratch_i, *merge_cp_p, CHECK_0); |
duke@435 | 1188 | if (found_i != 0) { |
duke@435 | 1189 | // Found a matching entry somewhere else in *merge_cp_p so |
duke@435 | 1190 | // just need a mapping entry. |
duke@435 | 1191 | map_index(scratch_cp, scratch_i, found_i); |
duke@435 | 1192 | continue; |
duke@435 | 1193 | } |
duke@435 | 1194 | |
duke@435 | 1195 | // No match found so we have to append this entry and any unique |
duke@435 | 1196 | // referenced entries to *merge_cp_p. |
duke@435 | 1197 | append_entry(scratch_cp, scratch_i, merge_cp_p, merge_cp_length_p, |
duke@435 | 1198 | CHECK_0); |
duke@435 | 1199 | } |
duke@435 | 1200 | |
duke@435 | 1201 | RC_TRACE_WITH_THREAD(0x00020000, THREAD, |
duke@435 | 1202 | ("after pass 1b: merge_cp_len=%d, scratch_i=%d, index_map_len=%d", |
duke@435 | 1203 | *merge_cp_length_p, scratch_i, _index_map_count)); |
duke@435 | 1204 | } |
duke@435 | 1205 | |
duke@435 | 1206 | return true; |
duke@435 | 1207 | } // end merge_constant_pools() |
duke@435 | 1208 | |
duke@435 | 1209 | |
coleenp@4037 | 1210 | // Scoped object to clean up the constant pool(s) created for merging |
coleenp@4037 | 1211 | class MergeCPCleaner { |
coleenp@4037 | 1212 | ClassLoaderData* _loader_data; |
coleenp@4037 | 1213 | ConstantPool* _cp; |
coleenp@4037 | 1214 | ConstantPool* _scratch_cp; |
coleenp@4037 | 1215 | public: |
coleenp@4037 | 1216 | MergeCPCleaner(ClassLoaderData* loader_data, ConstantPool* merge_cp) : |
coleenp@4037 | 1217 | _loader_data(loader_data), _cp(merge_cp), _scratch_cp(NULL) {} |
coleenp@4037 | 1218 | ~MergeCPCleaner() { |
coleenp@4037 | 1219 | _loader_data->add_to_deallocate_list(_cp); |
coleenp@4037 | 1220 | if (_scratch_cp != NULL) { |
coleenp@4037 | 1221 | _loader_data->add_to_deallocate_list(_scratch_cp); |
coleenp@4037 | 1222 | } |
coleenp@4037 | 1223 | } |
coleenp@4037 | 1224 | void add_scratch_cp(ConstantPool* scratch_cp) { _scratch_cp = scratch_cp; } |
coleenp@4037 | 1225 | }; |
coleenp@4037 | 1226 | |
duke@435 | 1227 | // Merge constant pools between the_class and scratch_class and |
duke@435 | 1228 | // potentially rewrite bytecodes in scratch_class to use the merged |
duke@435 | 1229 | // constant pool. |
duke@435 | 1230 | jvmtiError VM_RedefineClasses::merge_cp_and_rewrite( |
duke@435 | 1231 | instanceKlassHandle the_class, instanceKlassHandle scratch_class, |
duke@435 | 1232 | TRAPS) { |
duke@435 | 1233 | // worst case merged constant pool length is old and new combined |
duke@435 | 1234 | int merge_cp_length = the_class->constants()->length() |
duke@435 | 1235 | + scratch_class->constants()->length(); |
duke@435 | 1236 | |
duke@435 | 1237 | // Constant pools are not easily reused so we allocate a new one |
duke@435 | 1238 | // each time. |
jmasa@953 | 1239 | // merge_cp is created unsafe for concurrent GC processing. It |
ysr@2533 | 1240 | // should be marked safe before discarding it. Even though |
ysr@2533 | 1241 | // garbage, if it crosses a card boundary, it may be scanned |
jmasa@953 | 1242 | // in order to find the start of the first complete object on the card. |
coleenp@4037 | 1243 | ClassLoaderData* loader_data = the_class->class_loader_data(); |
coleenp@4037 | 1244 | ConstantPool* merge_cp_oop = |
coleenp@4037 | 1245 | ConstantPool::allocate(loader_data, |
coleenp@4037 | 1246 | merge_cp_length, |
coleenp@4037 | 1247 | THREAD); |
coleenp@4037 | 1248 | MergeCPCleaner cp_cleaner(loader_data, merge_cp_oop); |
coleenp@4037 | 1249 | |
coleenp@4037 | 1250 | HandleMark hm(THREAD); // make sure handles are cleared before |
coleenp@4037 | 1251 | // MergeCPCleaner clears out merge_cp_oop |
coleenp@4037 | 1252 | constantPoolHandle merge_cp(THREAD, merge_cp_oop); |
coleenp@4037 | 1253 | |
coleenp@4037 | 1254 | // Get constants() from the old class because it could have been rewritten |
coleenp@4037 | 1255 | // while we were at a safepoint allocating a new constant pool. |
coleenp@4037 | 1256 | constantPoolHandle old_cp(THREAD, the_class->constants()); |
coleenp@4037 | 1257 | constantPoolHandle scratch_cp(THREAD, scratch_class->constants()); |
coleenp@4037 | 1258 | |
coleenp@4037 | 1259 | // If the length changed, the class was redefined out from under us. Return |
coleenp@4037 | 1260 | // an error. |
coleenp@4037 | 1261 | if (merge_cp_length != the_class->constants()->length() |
coleenp@4037 | 1262 | + scratch_class->constants()->length()) { |
coleenp@4037 | 1263 | return JVMTI_ERROR_INTERNAL; |
coleenp@4037 | 1264 | } |
coleenp@4037 | 1265 | |
coleenp@4466 | 1266 | // Update the version number of the constant pool |
coleenp@4466 | 1267 | merge_cp->increment_and_save_version(old_cp->version()); |
duke@435 | 1268 | |
duke@435 | 1269 | ResourceMark rm(THREAD); |
duke@435 | 1270 | _index_map_count = 0; |
duke@435 | 1271 | _index_map_p = new intArray(scratch_cp->length(), -1); |
duke@435 | 1272 | |
sspitsyn@4493 | 1273 | // reference to the cp holder is needed for copy_operands() |
sspitsyn@4493 | 1274 | merge_cp->set_pool_holder(scratch_class()); |
duke@435 | 1275 | bool result = merge_constant_pools(old_cp, scratch_cp, &merge_cp, |
duke@435 | 1276 | &merge_cp_length, THREAD); |
sspitsyn@4493 | 1277 | merge_cp->set_pool_holder(NULL); |
sspitsyn@4493 | 1278 | |
duke@435 | 1279 | if (!result) { |
duke@435 | 1280 | // The merge can fail due to memory allocation failure or due |
duke@435 | 1281 | // to robustness checks. |
duke@435 | 1282 | return JVMTI_ERROR_INTERNAL; |
duke@435 | 1283 | } |
duke@435 | 1284 | |
duke@435 | 1285 | RC_TRACE_WITH_THREAD(0x00010000, THREAD, |
duke@435 | 1286 | ("merge_cp_len=%d, index_map_len=%d", merge_cp_length, _index_map_count)); |
duke@435 | 1287 | |
duke@435 | 1288 | if (_index_map_count == 0) { |
duke@435 | 1289 | // there is nothing to map between the new and merged constant pools |
duke@435 | 1290 | |
duke@435 | 1291 | if (old_cp->length() == scratch_cp->length()) { |
duke@435 | 1292 | // The old and new constant pools are the same length and the |
duke@435 | 1293 | // index map is empty. This means that the three constant pools |
duke@435 | 1294 | // are equivalent (but not the same). Unfortunately, the new |
duke@435 | 1295 | // constant pool has not gone through link resolution nor have |
duke@435 | 1296 | // the new class bytecodes gone through constant pool cache |
duke@435 | 1297 | // rewriting so we can't use the old constant pool with the new |
duke@435 | 1298 | // class. |
duke@435 | 1299 | |
coleenp@4037 | 1300 | // toss the merged constant pool at return |
duke@435 | 1301 | } else if (old_cp->length() < scratch_cp->length()) { |
duke@435 | 1302 | // The old constant pool has fewer entries than the new constant |
duke@435 | 1303 | // pool and the index map is empty. This means the new constant |
duke@435 | 1304 | // pool is a superset of the old constant pool. However, the old |
duke@435 | 1305 | // class bytecodes have already gone through constant pool cache |
duke@435 | 1306 | // rewriting so we can't use the new constant pool with the old |
duke@435 | 1307 | // class. |
duke@435 | 1308 | |
coleenp@4037 | 1309 | // toss the merged constant pool at return |
duke@435 | 1310 | } else { |
duke@435 | 1311 | // The old constant pool has more entries than the new constant |
duke@435 | 1312 | // pool and the index map is empty. This means that both the old |
duke@435 | 1313 | // and merged constant pools are supersets of the new constant |
duke@435 | 1314 | // pool. |
duke@435 | 1315 | |
duke@435 | 1316 | // Replace the new constant pool with a shrunken copy of the |
coleenp@4037 | 1317 | // merged constant pool |
coleenp@4037 | 1318 | set_new_constant_pool(loader_data, scratch_class, merge_cp, merge_cp_length, THREAD); |
coleenp@4037 | 1319 | // The new constant pool replaces scratch_cp so have cleaner clean it up. |
coleenp@4037 | 1320 | // It can't be cleaned up while there are handles to it. |
coleenp@4037 | 1321 | cp_cleaner.add_scratch_cp(scratch_cp()); |
duke@435 | 1322 | } |
duke@435 | 1323 | } else { |
duke@435 | 1324 | if (RC_TRACE_ENABLED(0x00040000)) { |
duke@435 | 1325 | // don't want to loop unless we are tracing |
duke@435 | 1326 | int count = 0; |
duke@435 | 1327 | for (int i = 1; i < _index_map_p->length(); i++) { |
duke@435 | 1328 | int value = _index_map_p->at(i); |
duke@435 | 1329 | |
duke@435 | 1330 | if (value != -1) { |
duke@435 | 1331 | RC_TRACE_WITH_THREAD(0x00040000, THREAD, |
duke@435 | 1332 | ("index_map[%d]: old=%d new=%d", count, i, value)); |
duke@435 | 1333 | count++; |
duke@435 | 1334 | } |
duke@435 | 1335 | } |
duke@435 | 1336 | } |
duke@435 | 1337 | |
duke@435 | 1338 | // We have entries mapped between the new and merged constant pools |
duke@435 | 1339 | // so we have to rewrite some constant pool references. |
duke@435 | 1340 | if (!rewrite_cp_refs(scratch_class, THREAD)) { |
duke@435 | 1341 | return JVMTI_ERROR_INTERNAL; |
duke@435 | 1342 | } |
duke@435 | 1343 | |
duke@435 | 1344 | // Replace the new constant pool with a shrunken copy of the |
duke@435 | 1345 | // merged constant pool so now the rewritten bytecodes have |
duke@435 | 1346 | // valid references; the previous new constant pool will get |
duke@435 | 1347 | // GCed. |
coleenp@4037 | 1348 | set_new_constant_pool(loader_data, scratch_class, merge_cp, merge_cp_length, THREAD); |
coleenp@4037 | 1349 | // The new constant pool replaces scratch_cp so have cleaner clean it up. |
coleenp@4037 | 1350 | // It can't be cleaned up while there are handles to it. |
coleenp@4037 | 1351 | cp_cleaner.add_scratch_cp(scratch_cp()); |
duke@435 | 1352 | } |
duke@435 | 1353 | |
duke@435 | 1354 | return JVMTI_ERROR_NONE; |
duke@435 | 1355 | } // end merge_cp_and_rewrite() |
duke@435 | 1356 | |
duke@435 | 1357 | |
duke@435 | 1358 | // Rewrite constant pool references in klass scratch_class. |
duke@435 | 1359 | bool VM_RedefineClasses::rewrite_cp_refs(instanceKlassHandle scratch_class, |
duke@435 | 1360 | TRAPS) { |
duke@435 | 1361 | |
duke@435 | 1362 | // rewrite constant pool references in the methods: |
duke@435 | 1363 | if (!rewrite_cp_refs_in_methods(scratch_class, THREAD)) { |
twisti@1040 | 1364 | // propagate failure back to caller |
duke@435 | 1365 | return false; |
duke@435 | 1366 | } |
duke@435 | 1367 | |
duke@435 | 1368 | // rewrite constant pool references in the class_annotations: |
duke@435 | 1369 | if (!rewrite_cp_refs_in_class_annotations(scratch_class, THREAD)) { |
twisti@1040 | 1370 | // propagate failure back to caller |
duke@435 | 1371 | return false; |
duke@435 | 1372 | } |
duke@435 | 1373 | |
duke@435 | 1374 | // rewrite constant pool references in the fields_annotations: |
duke@435 | 1375 | if (!rewrite_cp_refs_in_fields_annotations(scratch_class, THREAD)) { |
twisti@1040 | 1376 | // propagate failure back to caller |
duke@435 | 1377 | return false; |
duke@435 | 1378 | } |
duke@435 | 1379 | |
duke@435 | 1380 | // rewrite constant pool references in the methods_annotations: |
duke@435 | 1381 | if (!rewrite_cp_refs_in_methods_annotations(scratch_class, THREAD)) { |
twisti@1040 | 1382 | // propagate failure back to caller |
duke@435 | 1383 | return false; |
duke@435 | 1384 | } |
duke@435 | 1385 | |
duke@435 | 1386 | // rewrite constant pool references in the methods_parameter_annotations: |
duke@435 | 1387 | if (!rewrite_cp_refs_in_methods_parameter_annotations(scratch_class, |
duke@435 | 1388 | THREAD)) { |
twisti@1040 | 1389 | // propagate failure back to caller |
duke@435 | 1390 | return false; |
duke@435 | 1391 | } |
duke@435 | 1392 | |
duke@435 | 1393 | // rewrite constant pool references in the methods_default_annotations: |
duke@435 | 1394 | if (!rewrite_cp_refs_in_methods_default_annotations(scratch_class, |
duke@435 | 1395 | THREAD)) { |
twisti@1040 | 1396 | // propagate failure back to caller |
duke@435 | 1397 | return false; |
duke@435 | 1398 | } |
duke@435 | 1399 | |
duke@435 | 1400 | return true; |
duke@435 | 1401 | } // end rewrite_cp_refs() |
duke@435 | 1402 | |
duke@435 | 1403 | |
duke@435 | 1404 | // Rewrite constant pool references in the methods. |
duke@435 | 1405 | bool VM_RedefineClasses::rewrite_cp_refs_in_methods( |
duke@435 | 1406 | instanceKlassHandle scratch_class, TRAPS) { |
duke@435 | 1407 | |
coleenp@4037 | 1408 | Array<Method*>* methods = scratch_class->methods(); |
coleenp@4037 | 1409 | |
coleenp@4037 | 1410 | if (methods == NULL || methods->length() == 0) { |
duke@435 | 1411 | // no methods so nothing to do |
duke@435 | 1412 | return true; |
duke@435 | 1413 | } |
duke@435 | 1414 | |
duke@435 | 1415 | // rewrite constant pool references in the methods: |
duke@435 | 1416 | for (int i = methods->length() - 1; i >= 0; i--) { |
coleenp@4037 | 1417 | methodHandle method(THREAD, methods->at(i)); |
duke@435 | 1418 | methodHandle new_method; |
duke@435 | 1419 | rewrite_cp_refs_in_method(method, &new_method, CHECK_false); |
duke@435 | 1420 | if (!new_method.is_null()) { |
duke@435 | 1421 | // the method has been replaced so save the new method version |
coleenp@4037 | 1422 | methods->at_put(i, new_method()); |
duke@435 | 1423 | } |
duke@435 | 1424 | } |
duke@435 | 1425 | |
duke@435 | 1426 | return true; |
duke@435 | 1427 | } |
duke@435 | 1428 | |
duke@435 | 1429 | |
duke@435 | 1430 | // Rewrite constant pool references in the specific method. This code |
duke@435 | 1431 | // was adapted from Rewriter::rewrite_method(). |
duke@435 | 1432 | void VM_RedefineClasses::rewrite_cp_refs_in_method(methodHandle method, |
duke@435 | 1433 | methodHandle *new_method_p, TRAPS) { |
duke@435 | 1434 | |
duke@435 | 1435 | *new_method_p = methodHandle(); // default is no new method |
duke@435 | 1436 | |
duke@435 | 1437 | // We cache a pointer to the bytecodes here in code_base. If GC |
coleenp@4037 | 1438 | // moves the Method*, then the bytecodes will also move which |
duke@435 | 1439 | // will likely cause a crash. We create a No_Safepoint_Verifier |
duke@435 | 1440 | // object to detect whether we pass a possible safepoint in this |
duke@435 | 1441 | // code block. |
duke@435 | 1442 | No_Safepoint_Verifier nsv; |
duke@435 | 1443 | |
duke@435 | 1444 | // Bytecodes and their length |
duke@435 | 1445 | address code_base = method->code_base(); |
duke@435 | 1446 | int code_length = method->code_size(); |
duke@435 | 1447 | |
duke@435 | 1448 | int bc_length; |
duke@435 | 1449 | for (int bci = 0; bci < code_length; bci += bc_length) { |
duke@435 | 1450 | address bcp = code_base + bci; |
duke@435 | 1451 | Bytecodes::Code c = (Bytecodes::Code)(*bcp); |
duke@435 | 1452 | |
duke@435 | 1453 | bc_length = Bytecodes::length_for(c); |
duke@435 | 1454 | if (bc_length == 0) { |
duke@435 | 1455 | // More complicated bytecodes report a length of zero so |
duke@435 | 1456 | // we have to try again a slightly different way. |
never@2462 | 1457 | bc_length = Bytecodes::length_at(method(), bcp); |
duke@435 | 1458 | } |
duke@435 | 1459 | |
duke@435 | 1460 | assert(bc_length != 0, "impossible bytecode length"); |
duke@435 | 1461 | |
duke@435 | 1462 | switch (c) { |
duke@435 | 1463 | case Bytecodes::_ldc: |
duke@435 | 1464 | { |
duke@435 | 1465 | int cp_index = *(bcp + 1); |
duke@435 | 1466 | int new_index = find_new_index(cp_index); |
duke@435 | 1467 | |
duke@435 | 1468 | if (StressLdcRewrite && new_index == 0) { |
duke@435 | 1469 | // If we are stressing ldc -> ldc_w rewriting, then we |
duke@435 | 1470 | // always need a new_index value. |
duke@435 | 1471 | new_index = cp_index; |
duke@435 | 1472 | } |
duke@435 | 1473 | if (new_index != 0) { |
duke@435 | 1474 | // the original index is mapped so we have more work to do |
duke@435 | 1475 | if (!StressLdcRewrite && new_index <= max_jubyte) { |
duke@435 | 1476 | // The new value can still use ldc instead of ldc_w |
duke@435 | 1477 | // unless we are trying to stress ldc -> ldc_w rewriting |
duke@435 | 1478 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 1479 | ("%s@" INTPTR_FORMAT " old=%d, new=%d", Bytecodes::name(c), |
duke@435 | 1480 | bcp, cp_index, new_index)); |
duke@435 | 1481 | *(bcp + 1) = new_index; |
duke@435 | 1482 | } else { |
duke@435 | 1483 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 1484 | ("%s->ldc_w@" INTPTR_FORMAT " old=%d, new=%d", |
duke@435 | 1485 | Bytecodes::name(c), bcp, cp_index, new_index)); |
duke@435 | 1486 | // the new value needs ldc_w instead of ldc |
duke@435 | 1487 | u_char inst_buffer[4]; // max instruction size is 4 bytes |
duke@435 | 1488 | bcp = (address)inst_buffer; |
duke@435 | 1489 | // construct new instruction sequence |
duke@435 | 1490 | *bcp = Bytecodes::_ldc_w; |
duke@435 | 1491 | bcp++; |
duke@435 | 1492 | // Rewriter::rewrite_method() does not rewrite ldc -> ldc_w. |
duke@435 | 1493 | // See comment below for difference between put_Java_u2() |
duke@435 | 1494 | // and put_native_u2(). |
duke@435 | 1495 | Bytes::put_Java_u2(bcp, new_index); |
duke@435 | 1496 | |
duke@435 | 1497 | Relocator rc(method, NULL /* no RelocatorListener needed */); |
duke@435 | 1498 | methodHandle m; |
duke@435 | 1499 | { |
duke@435 | 1500 | Pause_No_Safepoint_Verifier pnsv(&nsv); |
duke@435 | 1501 | |
duke@435 | 1502 | // ldc is 2 bytes and ldc_w is 3 bytes |
duke@435 | 1503 | m = rc.insert_space_at(bci, 3, inst_buffer, THREAD); |
duke@435 | 1504 | if (m.is_null() || HAS_PENDING_EXCEPTION) { |
duke@435 | 1505 | guarantee(false, "insert_space_at() failed"); |
duke@435 | 1506 | } |
duke@435 | 1507 | } |
duke@435 | 1508 | |
duke@435 | 1509 | // return the new method so that the caller can update |
duke@435 | 1510 | // the containing class |
duke@435 | 1511 | *new_method_p = method = m; |
duke@435 | 1512 | // switch our bytecode processing loop from the old method |
duke@435 | 1513 | // to the new method |
duke@435 | 1514 | code_base = method->code_base(); |
duke@435 | 1515 | code_length = method->code_size(); |
duke@435 | 1516 | bcp = code_base + bci; |
duke@435 | 1517 | c = (Bytecodes::Code)(*bcp); |
duke@435 | 1518 | bc_length = Bytecodes::length_for(c); |
duke@435 | 1519 | assert(bc_length != 0, "sanity check"); |
duke@435 | 1520 | } // end we need ldc_w instead of ldc |
duke@435 | 1521 | } // end if there is a mapped index |
duke@435 | 1522 | } break; |
duke@435 | 1523 | |
duke@435 | 1524 | // these bytecodes have a two-byte constant pool index |
duke@435 | 1525 | case Bytecodes::_anewarray : // fall through |
duke@435 | 1526 | case Bytecodes::_checkcast : // fall through |
duke@435 | 1527 | case Bytecodes::_getfield : // fall through |
duke@435 | 1528 | case Bytecodes::_getstatic : // fall through |
duke@435 | 1529 | case Bytecodes::_instanceof : // fall through |
sspitsyn@4506 | 1530 | case Bytecodes::_invokedynamic : // fall through |
duke@435 | 1531 | case Bytecodes::_invokeinterface: // fall through |
duke@435 | 1532 | case Bytecodes::_invokespecial : // fall through |
duke@435 | 1533 | case Bytecodes::_invokestatic : // fall through |
duke@435 | 1534 | case Bytecodes::_invokevirtual : // fall through |
duke@435 | 1535 | case Bytecodes::_ldc_w : // fall through |
duke@435 | 1536 | case Bytecodes::_ldc2_w : // fall through |
duke@435 | 1537 | case Bytecodes::_multianewarray : // fall through |
duke@435 | 1538 | case Bytecodes::_new : // fall through |
duke@435 | 1539 | case Bytecodes::_putfield : // fall through |
duke@435 | 1540 | case Bytecodes::_putstatic : |
duke@435 | 1541 | { |
duke@435 | 1542 | address p = bcp + 1; |
duke@435 | 1543 | int cp_index = Bytes::get_Java_u2(p); |
duke@435 | 1544 | int new_index = find_new_index(cp_index); |
duke@435 | 1545 | if (new_index != 0) { |
duke@435 | 1546 | // the original index is mapped so update w/ new value |
duke@435 | 1547 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 1548 | ("%s@" INTPTR_FORMAT " old=%d, new=%d", Bytecodes::name(c), |
duke@435 | 1549 | bcp, cp_index, new_index)); |
duke@435 | 1550 | // Rewriter::rewrite_method() uses put_native_u2() in this |
duke@435 | 1551 | // situation because it is reusing the constant pool index |
dcubed@4562 | 1552 | // location for a native index into the ConstantPoolCache. |
duke@435 | 1553 | // Since we are updating the constant pool index prior to |
dcubed@4562 | 1554 | // verification and ConstantPoolCache initialization, we |
duke@435 | 1555 | // need to keep the new index in Java byte order. |
duke@435 | 1556 | Bytes::put_Java_u2(p, new_index); |
duke@435 | 1557 | } |
duke@435 | 1558 | } break; |
duke@435 | 1559 | } |
duke@435 | 1560 | } // end for each bytecode |
emc@4609 | 1561 | |
emc@4609 | 1562 | // We also need to rewrite the parameter name indexes, if there is |
emc@4609 | 1563 | // method parameter data present |
emc@4609 | 1564 | if(method->has_method_parameters()) { |
emc@4609 | 1565 | const int len = method->method_parameters_length(); |
emc@4609 | 1566 | MethodParametersElement* elem = method->method_parameters_start(); |
emc@4609 | 1567 | |
emc@4609 | 1568 | for (int i = 0; i < len; i++) { |
emc@4609 | 1569 | const u2 cp_index = elem[i].name_cp_index; |
emc@4609 | 1570 | elem[i].name_cp_index = find_new_index(cp_index); |
emc@4609 | 1571 | } |
emc@4609 | 1572 | } |
duke@435 | 1573 | } // end rewrite_cp_refs_in_method() |
duke@435 | 1574 | |
duke@435 | 1575 | |
duke@435 | 1576 | // Rewrite constant pool references in the class_annotations field. |
duke@435 | 1577 | bool VM_RedefineClasses::rewrite_cp_refs_in_class_annotations( |
duke@435 | 1578 | instanceKlassHandle scratch_class, TRAPS) { |
duke@435 | 1579 | |
coleenp@4037 | 1580 | AnnotationArray* class_annotations = scratch_class->class_annotations(); |
coleenp@4037 | 1581 | if (class_annotations == NULL || class_annotations->length() == 0) { |
duke@435 | 1582 | // no class_annotations so nothing to do |
duke@435 | 1583 | return true; |
duke@435 | 1584 | } |
duke@435 | 1585 | |
duke@435 | 1586 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1587 | ("class_annotations length=%d", class_annotations->length())); |
duke@435 | 1588 | |
duke@435 | 1589 | int byte_i = 0; // byte index into class_annotations |
duke@435 | 1590 | return rewrite_cp_refs_in_annotations_typeArray(class_annotations, byte_i, |
duke@435 | 1591 | THREAD); |
duke@435 | 1592 | } |
duke@435 | 1593 | |
duke@435 | 1594 | |
duke@435 | 1595 | // Rewrite constant pool references in an annotations typeArray. This |
duke@435 | 1596 | // "structure" is adapted from the RuntimeVisibleAnnotations_attribute |
duke@435 | 1597 | // that is described in section 4.8.15 of the 2nd-edition of the VM spec: |
duke@435 | 1598 | // |
duke@435 | 1599 | // annotations_typeArray { |
duke@435 | 1600 | // u2 num_annotations; |
duke@435 | 1601 | // annotation annotations[num_annotations]; |
duke@435 | 1602 | // } |
duke@435 | 1603 | // |
duke@435 | 1604 | bool VM_RedefineClasses::rewrite_cp_refs_in_annotations_typeArray( |
coleenp@4037 | 1605 | AnnotationArray* annotations_typeArray, int &byte_i_ref, TRAPS) { |
duke@435 | 1606 | |
duke@435 | 1607 | if ((byte_i_ref + 2) > annotations_typeArray->length()) { |
duke@435 | 1608 | // not enough room for num_annotations field |
duke@435 | 1609 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1610 | ("length() is too small for num_annotations field")); |
duke@435 | 1611 | return false; |
duke@435 | 1612 | } |
duke@435 | 1613 | |
duke@435 | 1614 | u2 num_annotations = Bytes::get_Java_u2((address) |
coleenp@4037 | 1615 | annotations_typeArray->adr_at(byte_i_ref)); |
duke@435 | 1616 | byte_i_ref += 2; |
duke@435 | 1617 | |
duke@435 | 1618 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1619 | ("num_annotations=%d", num_annotations)); |
duke@435 | 1620 | |
duke@435 | 1621 | int calc_num_annotations = 0; |
duke@435 | 1622 | for (; calc_num_annotations < num_annotations; calc_num_annotations++) { |
duke@435 | 1623 | if (!rewrite_cp_refs_in_annotation_struct(annotations_typeArray, |
duke@435 | 1624 | byte_i_ref, THREAD)) { |
duke@435 | 1625 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1626 | ("bad annotation_struct at %d", calc_num_annotations)); |
twisti@1040 | 1627 | // propagate failure back to caller |
duke@435 | 1628 | return false; |
duke@435 | 1629 | } |
duke@435 | 1630 | } |
duke@435 | 1631 | assert(num_annotations == calc_num_annotations, "sanity check"); |
duke@435 | 1632 | |
duke@435 | 1633 | return true; |
duke@435 | 1634 | } // end rewrite_cp_refs_in_annotations_typeArray() |
duke@435 | 1635 | |
duke@435 | 1636 | |
duke@435 | 1637 | // Rewrite constant pool references in the annotation struct portion of |
duke@435 | 1638 | // an annotations_typeArray. This "structure" is from section 4.8.15 of |
duke@435 | 1639 | // the 2nd-edition of the VM spec: |
duke@435 | 1640 | // |
duke@435 | 1641 | // struct annotation { |
duke@435 | 1642 | // u2 type_index; |
duke@435 | 1643 | // u2 num_element_value_pairs; |
duke@435 | 1644 | // { |
duke@435 | 1645 | // u2 element_name_index; |
duke@435 | 1646 | // element_value value; |
duke@435 | 1647 | // } element_value_pairs[num_element_value_pairs]; |
duke@435 | 1648 | // } |
duke@435 | 1649 | // |
duke@435 | 1650 | bool VM_RedefineClasses::rewrite_cp_refs_in_annotation_struct( |
coleenp@4037 | 1651 | AnnotationArray* annotations_typeArray, int &byte_i_ref, TRAPS) { |
duke@435 | 1652 | if ((byte_i_ref + 2 + 2) > annotations_typeArray->length()) { |
duke@435 | 1653 | // not enough room for smallest annotation_struct |
duke@435 | 1654 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1655 | ("length() is too small for annotation_struct")); |
duke@435 | 1656 | return false; |
duke@435 | 1657 | } |
duke@435 | 1658 | |
duke@435 | 1659 | u2 type_index = rewrite_cp_ref_in_annotation_data(annotations_typeArray, |
duke@435 | 1660 | byte_i_ref, "mapped old type_index=%d", THREAD); |
duke@435 | 1661 | |
duke@435 | 1662 | u2 num_element_value_pairs = Bytes::get_Java_u2((address) |
coleenp@4037 | 1663 | annotations_typeArray->adr_at(byte_i_ref)); |
duke@435 | 1664 | byte_i_ref += 2; |
duke@435 | 1665 | |
duke@435 | 1666 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1667 | ("type_index=%d num_element_value_pairs=%d", type_index, |
duke@435 | 1668 | num_element_value_pairs)); |
duke@435 | 1669 | |
duke@435 | 1670 | int calc_num_element_value_pairs = 0; |
duke@435 | 1671 | for (; calc_num_element_value_pairs < num_element_value_pairs; |
duke@435 | 1672 | calc_num_element_value_pairs++) { |
duke@435 | 1673 | if ((byte_i_ref + 2) > annotations_typeArray->length()) { |
duke@435 | 1674 | // not enough room for another element_name_index, let alone |
duke@435 | 1675 | // the rest of another component |
duke@435 | 1676 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1677 | ("length() is too small for element_name_index")); |
duke@435 | 1678 | return false; |
duke@435 | 1679 | } |
duke@435 | 1680 | |
duke@435 | 1681 | u2 element_name_index = rewrite_cp_ref_in_annotation_data( |
duke@435 | 1682 | annotations_typeArray, byte_i_ref, |
duke@435 | 1683 | "mapped old element_name_index=%d", THREAD); |
duke@435 | 1684 | |
duke@435 | 1685 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1686 | ("element_name_index=%d", element_name_index)); |
duke@435 | 1687 | |
duke@435 | 1688 | if (!rewrite_cp_refs_in_element_value(annotations_typeArray, |
duke@435 | 1689 | byte_i_ref, THREAD)) { |
duke@435 | 1690 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1691 | ("bad element_value at %d", calc_num_element_value_pairs)); |
twisti@1040 | 1692 | // propagate failure back to caller |
duke@435 | 1693 | return false; |
duke@435 | 1694 | } |
duke@435 | 1695 | } // end for each component |
duke@435 | 1696 | assert(num_element_value_pairs == calc_num_element_value_pairs, |
duke@435 | 1697 | "sanity check"); |
duke@435 | 1698 | |
duke@435 | 1699 | return true; |
duke@435 | 1700 | } // end rewrite_cp_refs_in_annotation_struct() |
duke@435 | 1701 | |
duke@435 | 1702 | |
duke@435 | 1703 | // Rewrite a constant pool reference at the current position in |
duke@435 | 1704 | // annotations_typeArray if needed. Returns the original constant |
duke@435 | 1705 | // pool reference if a rewrite was not needed or the new constant |
duke@435 | 1706 | // pool reference if a rewrite was needed. |
duke@435 | 1707 | u2 VM_RedefineClasses::rewrite_cp_ref_in_annotation_data( |
coleenp@4037 | 1708 | AnnotationArray* annotations_typeArray, int &byte_i_ref, |
duke@435 | 1709 | const char * trace_mesg, TRAPS) { |
duke@435 | 1710 | |
duke@435 | 1711 | address cp_index_addr = (address) |
coleenp@4037 | 1712 | annotations_typeArray->adr_at(byte_i_ref); |
duke@435 | 1713 | u2 old_cp_index = Bytes::get_Java_u2(cp_index_addr); |
duke@435 | 1714 | u2 new_cp_index = find_new_index(old_cp_index); |
duke@435 | 1715 | if (new_cp_index != 0) { |
duke@435 | 1716 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, (trace_mesg, old_cp_index)); |
duke@435 | 1717 | Bytes::put_Java_u2(cp_index_addr, new_cp_index); |
duke@435 | 1718 | old_cp_index = new_cp_index; |
duke@435 | 1719 | } |
duke@435 | 1720 | byte_i_ref += 2; |
duke@435 | 1721 | return old_cp_index; |
duke@435 | 1722 | } |
duke@435 | 1723 | |
duke@435 | 1724 | |
duke@435 | 1725 | // Rewrite constant pool references in the element_value portion of an |
duke@435 | 1726 | // annotations_typeArray. This "structure" is from section 4.8.15.1 of |
duke@435 | 1727 | // the 2nd-edition of the VM spec: |
duke@435 | 1728 | // |
duke@435 | 1729 | // struct element_value { |
duke@435 | 1730 | // u1 tag; |
duke@435 | 1731 | // union { |
duke@435 | 1732 | // u2 const_value_index; |
duke@435 | 1733 | // { |
duke@435 | 1734 | // u2 type_name_index; |
duke@435 | 1735 | // u2 const_name_index; |
duke@435 | 1736 | // } enum_const_value; |
duke@435 | 1737 | // u2 class_info_index; |
duke@435 | 1738 | // annotation annotation_value; |
duke@435 | 1739 | // struct { |
duke@435 | 1740 | // u2 num_values; |
duke@435 | 1741 | // element_value values[num_values]; |
duke@435 | 1742 | // } array_value; |
duke@435 | 1743 | // } value; |
duke@435 | 1744 | // } |
duke@435 | 1745 | // |
duke@435 | 1746 | bool VM_RedefineClasses::rewrite_cp_refs_in_element_value( |
coleenp@4037 | 1747 | AnnotationArray* annotations_typeArray, int &byte_i_ref, TRAPS) { |
duke@435 | 1748 | |
duke@435 | 1749 | if ((byte_i_ref + 1) > annotations_typeArray->length()) { |
duke@435 | 1750 | // not enough room for a tag let alone the rest of an element_value |
duke@435 | 1751 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1752 | ("length() is too small for a tag")); |
duke@435 | 1753 | return false; |
duke@435 | 1754 | } |
duke@435 | 1755 | |
coleenp@4037 | 1756 | u1 tag = annotations_typeArray->at(byte_i_ref); |
duke@435 | 1757 | byte_i_ref++; |
duke@435 | 1758 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, ("tag='%c'", tag)); |
duke@435 | 1759 | |
duke@435 | 1760 | switch (tag) { |
duke@435 | 1761 | // These BaseType tag values are from Table 4.2 in VM spec: |
duke@435 | 1762 | case 'B': // byte |
duke@435 | 1763 | case 'C': // char |
duke@435 | 1764 | case 'D': // double |
duke@435 | 1765 | case 'F': // float |
duke@435 | 1766 | case 'I': // int |
duke@435 | 1767 | case 'J': // long |
duke@435 | 1768 | case 'S': // short |
duke@435 | 1769 | case 'Z': // boolean |
duke@435 | 1770 | |
duke@435 | 1771 | // The remaining tag values are from Table 4.8 in the 2nd-edition of |
duke@435 | 1772 | // the VM spec: |
duke@435 | 1773 | case 's': |
duke@435 | 1774 | { |
duke@435 | 1775 | // For the above tag values (including the BaseType values), |
duke@435 | 1776 | // value.const_value_index is right union field. |
duke@435 | 1777 | |
duke@435 | 1778 | if ((byte_i_ref + 2) > annotations_typeArray->length()) { |
duke@435 | 1779 | // not enough room for a const_value_index |
duke@435 | 1780 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1781 | ("length() is too small for a const_value_index")); |
duke@435 | 1782 | return false; |
duke@435 | 1783 | } |
duke@435 | 1784 | |
duke@435 | 1785 | u2 const_value_index = rewrite_cp_ref_in_annotation_data( |
duke@435 | 1786 | annotations_typeArray, byte_i_ref, |
duke@435 | 1787 | "mapped old const_value_index=%d", THREAD); |
duke@435 | 1788 | |
duke@435 | 1789 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1790 | ("const_value_index=%d", const_value_index)); |
duke@435 | 1791 | } break; |
duke@435 | 1792 | |
duke@435 | 1793 | case 'e': |
duke@435 | 1794 | { |
duke@435 | 1795 | // for the above tag value, value.enum_const_value is right union field |
duke@435 | 1796 | |
duke@435 | 1797 | if ((byte_i_ref + 4) > annotations_typeArray->length()) { |
duke@435 | 1798 | // not enough room for a enum_const_value |
duke@435 | 1799 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1800 | ("length() is too small for a enum_const_value")); |
duke@435 | 1801 | return false; |
duke@435 | 1802 | } |
duke@435 | 1803 | |
duke@435 | 1804 | u2 type_name_index = rewrite_cp_ref_in_annotation_data( |
duke@435 | 1805 | annotations_typeArray, byte_i_ref, |
duke@435 | 1806 | "mapped old type_name_index=%d", THREAD); |
duke@435 | 1807 | |
duke@435 | 1808 | u2 const_name_index = rewrite_cp_ref_in_annotation_data( |
duke@435 | 1809 | annotations_typeArray, byte_i_ref, |
duke@435 | 1810 | "mapped old const_name_index=%d", THREAD); |
duke@435 | 1811 | |
duke@435 | 1812 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1813 | ("type_name_index=%d const_name_index=%d", type_name_index, |
duke@435 | 1814 | const_name_index)); |
duke@435 | 1815 | } break; |
duke@435 | 1816 | |
duke@435 | 1817 | case 'c': |
duke@435 | 1818 | { |
duke@435 | 1819 | // for the above tag value, value.class_info_index is right union field |
duke@435 | 1820 | |
duke@435 | 1821 | if ((byte_i_ref + 2) > annotations_typeArray->length()) { |
duke@435 | 1822 | // not enough room for a class_info_index |
duke@435 | 1823 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1824 | ("length() is too small for a class_info_index")); |
duke@435 | 1825 | return false; |
duke@435 | 1826 | } |
duke@435 | 1827 | |
duke@435 | 1828 | u2 class_info_index = rewrite_cp_ref_in_annotation_data( |
duke@435 | 1829 | annotations_typeArray, byte_i_ref, |
duke@435 | 1830 | "mapped old class_info_index=%d", THREAD); |
duke@435 | 1831 | |
duke@435 | 1832 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1833 | ("class_info_index=%d", class_info_index)); |
duke@435 | 1834 | } break; |
duke@435 | 1835 | |
duke@435 | 1836 | case '@': |
duke@435 | 1837 | // For the above tag value, value.attr_value is the right union |
duke@435 | 1838 | // field. This is a nested annotation. |
duke@435 | 1839 | if (!rewrite_cp_refs_in_annotation_struct(annotations_typeArray, |
duke@435 | 1840 | byte_i_ref, THREAD)) { |
twisti@1040 | 1841 | // propagate failure back to caller |
duke@435 | 1842 | return false; |
duke@435 | 1843 | } |
duke@435 | 1844 | break; |
duke@435 | 1845 | |
duke@435 | 1846 | case '[': |
duke@435 | 1847 | { |
duke@435 | 1848 | if ((byte_i_ref + 2) > annotations_typeArray->length()) { |
duke@435 | 1849 | // not enough room for a num_values field |
duke@435 | 1850 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1851 | ("length() is too small for a num_values field")); |
duke@435 | 1852 | return false; |
duke@435 | 1853 | } |
duke@435 | 1854 | |
duke@435 | 1855 | // For the above tag value, value.array_value is the right union |
duke@435 | 1856 | // field. This is an array of nested element_value. |
duke@435 | 1857 | u2 num_values = Bytes::get_Java_u2((address) |
coleenp@4037 | 1858 | annotations_typeArray->adr_at(byte_i_ref)); |
duke@435 | 1859 | byte_i_ref += 2; |
duke@435 | 1860 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, ("num_values=%d", num_values)); |
duke@435 | 1861 | |
duke@435 | 1862 | int calc_num_values = 0; |
duke@435 | 1863 | for (; calc_num_values < num_values; calc_num_values++) { |
duke@435 | 1864 | if (!rewrite_cp_refs_in_element_value( |
duke@435 | 1865 | annotations_typeArray, byte_i_ref, THREAD)) { |
duke@435 | 1866 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1867 | ("bad nested element_value at %d", calc_num_values)); |
twisti@1040 | 1868 | // propagate failure back to caller |
duke@435 | 1869 | return false; |
duke@435 | 1870 | } |
duke@435 | 1871 | } |
duke@435 | 1872 | assert(num_values == calc_num_values, "sanity check"); |
duke@435 | 1873 | } break; |
duke@435 | 1874 | |
duke@435 | 1875 | default: |
duke@435 | 1876 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, ("bad tag=0x%x", tag)); |
duke@435 | 1877 | return false; |
duke@435 | 1878 | } // end decode tag field |
duke@435 | 1879 | |
duke@435 | 1880 | return true; |
duke@435 | 1881 | } // end rewrite_cp_refs_in_element_value() |
duke@435 | 1882 | |
duke@435 | 1883 | |
duke@435 | 1884 | // Rewrite constant pool references in a fields_annotations field. |
duke@435 | 1885 | bool VM_RedefineClasses::rewrite_cp_refs_in_fields_annotations( |
duke@435 | 1886 | instanceKlassHandle scratch_class, TRAPS) { |
duke@435 | 1887 | |
coleenp@4572 | 1888 | Array<AnnotationArray*>* fields_annotations = scratch_class->fields_annotations(); |
coleenp@4037 | 1889 | |
coleenp@4037 | 1890 | if (fields_annotations == NULL || fields_annotations->length() == 0) { |
duke@435 | 1891 | // no fields_annotations so nothing to do |
duke@435 | 1892 | return true; |
duke@435 | 1893 | } |
duke@435 | 1894 | |
duke@435 | 1895 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1896 | ("fields_annotations length=%d", fields_annotations->length())); |
duke@435 | 1897 | |
duke@435 | 1898 | for (int i = 0; i < fields_annotations->length(); i++) { |
coleenp@4037 | 1899 | AnnotationArray* field_annotations = fields_annotations->at(i); |
coleenp@4037 | 1900 | if (field_annotations == NULL || field_annotations->length() == 0) { |
duke@435 | 1901 | // this field does not have any annotations so skip it |
duke@435 | 1902 | continue; |
duke@435 | 1903 | } |
duke@435 | 1904 | |
duke@435 | 1905 | int byte_i = 0; // byte index into field_annotations |
duke@435 | 1906 | if (!rewrite_cp_refs_in_annotations_typeArray(field_annotations, byte_i, |
duke@435 | 1907 | THREAD)) { |
duke@435 | 1908 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1909 | ("bad field_annotations at %d", i)); |
twisti@1040 | 1910 | // propagate failure back to caller |
duke@435 | 1911 | return false; |
duke@435 | 1912 | } |
duke@435 | 1913 | } |
duke@435 | 1914 | |
duke@435 | 1915 | return true; |
duke@435 | 1916 | } // end rewrite_cp_refs_in_fields_annotations() |
duke@435 | 1917 | |
duke@435 | 1918 | |
duke@435 | 1919 | // Rewrite constant pool references in a methods_annotations field. |
duke@435 | 1920 | bool VM_RedefineClasses::rewrite_cp_refs_in_methods_annotations( |
duke@435 | 1921 | instanceKlassHandle scratch_class, TRAPS) { |
duke@435 | 1922 | |
coleenp@4572 | 1923 | for (int i = 0; i < scratch_class->methods()->length(); i++) { |
coleenp@4572 | 1924 | Method* m = scratch_class->methods()->at(i); |
coleenp@4572 | 1925 | AnnotationArray* method_annotations = m->constMethod()->method_annotations(); |
coleenp@4572 | 1926 | |
coleenp@4037 | 1927 | if (method_annotations == NULL || method_annotations->length() == 0) { |
duke@435 | 1928 | // this method does not have any annotations so skip it |
duke@435 | 1929 | continue; |
duke@435 | 1930 | } |
duke@435 | 1931 | |
duke@435 | 1932 | int byte_i = 0; // byte index into method_annotations |
duke@435 | 1933 | if (!rewrite_cp_refs_in_annotations_typeArray(method_annotations, byte_i, |
duke@435 | 1934 | THREAD)) { |
duke@435 | 1935 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1936 | ("bad method_annotations at %d", i)); |
twisti@1040 | 1937 | // propagate failure back to caller |
duke@435 | 1938 | return false; |
duke@435 | 1939 | } |
duke@435 | 1940 | } |
duke@435 | 1941 | |
duke@435 | 1942 | return true; |
duke@435 | 1943 | } // end rewrite_cp_refs_in_methods_annotations() |
duke@435 | 1944 | |
duke@435 | 1945 | |
duke@435 | 1946 | // Rewrite constant pool references in a methods_parameter_annotations |
duke@435 | 1947 | // field. This "structure" is adapted from the |
duke@435 | 1948 | // RuntimeVisibleParameterAnnotations_attribute described in section |
duke@435 | 1949 | // 4.8.17 of the 2nd-edition of the VM spec: |
duke@435 | 1950 | // |
duke@435 | 1951 | // methods_parameter_annotations_typeArray { |
duke@435 | 1952 | // u1 num_parameters; |
duke@435 | 1953 | // { |
duke@435 | 1954 | // u2 num_annotations; |
duke@435 | 1955 | // annotation annotations[num_annotations]; |
duke@435 | 1956 | // } parameter_annotations[num_parameters]; |
duke@435 | 1957 | // } |
duke@435 | 1958 | // |
duke@435 | 1959 | bool VM_RedefineClasses::rewrite_cp_refs_in_methods_parameter_annotations( |
duke@435 | 1960 | instanceKlassHandle scratch_class, TRAPS) { |
duke@435 | 1961 | |
coleenp@4572 | 1962 | for (int i = 0; i < scratch_class->methods()->length(); i++) { |
coleenp@4572 | 1963 | Method* m = scratch_class->methods()->at(i); |
coleenp@4572 | 1964 | AnnotationArray* method_parameter_annotations = m->constMethod()->parameter_annotations(); |
coleenp@4037 | 1965 | if (method_parameter_annotations == NULL |
duke@435 | 1966 | || method_parameter_annotations->length() == 0) { |
duke@435 | 1967 | // this method does not have any parameter annotations so skip it |
duke@435 | 1968 | continue; |
duke@435 | 1969 | } |
duke@435 | 1970 | |
duke@435 | 1971 | if (method_parameter_annotations->length() < 1) { |
duke@435 | 1972 | // not enough room for a num_parameters field |
duke@435 | 1973 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1974 | ("length() is too small for a num_parameters field at %d", i)); |
duke@435 | 1975 | return false; |
duke@435 | 1976 | } |
duke@435 | 1977 | |
duke@435 | 1978 | int byte_i = 0; // byte index into method_parameter_annotations |
duke@435 | 1979 | |
coleenp@4037 | 1980 | u1 num_parameters = method_parameter_annotations->at(byte_i); |
duke@435 | 1981 | byte_i++; |
duke@435 | 1982 | |
duke@435 | 1983 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1984 | ("num_parameters=%d", num_parameters)); |
duke@435 | 1985 | |
duke@435 | 1986 | int calc_num_parameters = 0; |
duke@435 | 1987 | for (; calc_num_parameters < num_parameters; calc_num_parameters++) { |
duke@435 | 1988 | if (!rewrite_cp_refs_in_annotations_typeArray( |
duke@435 | 1989 | method_parameter_annotations, byte_i, THREAD)) { |
duke@435 | 1990 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 1991 | ("bad method_parameter_annotations at %d", calc_num_parameters)); |
twisti@1040 | 1992 | // propagate failure back to caller |
duke@435 | 1993 | return false; |
duke@435 | 1994 | } |
duke@435 | 1995 | } |
duke@435 | 1996 | assert(num_parameters == calc_num_parameters, "sanity check"); |
duke@435 | 1997 | } |
duke@435 | 1998 | |
duke@435 | 1999 | return true; |
duke@435 | 2000 | } // end rewrite_cp_refs_in_methods_parameter_annotations() |
duke@435 | 2001 | |
duke@435 | 2002 | |
duke@435 | 2003 | // Rewrite constant pool references in a methods_default_annotations |
duke@435 | 2004 | // field. This "structure" is adapted from the AnnotationDefault_attribute |
duke@435 | 2005 | // that is described in section 4.8.19 of the 2nd-edition of the VM spec: |
duke@435 | 2006 | // |
duke@435 | 2007 | // methods_default_annotations_typeArray { |
duke@435 | 2008 | // element_value default_value; |
duke@435 | 2009 | // } |
duke@435 | 2010 | // |
duke@435 | 2011 | bool VM_RedefineClasses::rewrite_cp_refs_in_methods_default_annotations( |
duke@435 | 2012 | instanceKlassHandle scratch_class, TRAPS) { |
duke@435 | 2013 | |
coleenp@4572 | 2014 | for (int i = 0; i < scratch_class->methods()->length(); i++) { |
coleenp@4572 | 2015 | Method* m = scratch_class->methods()->at(i); |
coleenp@4572 | 2016 | AnnotationArray* method_default_annotations = m->constMethod()->default_annotations(); |
coleenp@4037 | 2017 | if (method_default_annotations == NULL |
duke@435 | 2018 | || method_default_annotations->length() == 0) { |
duke@435 | 2019 | // this method does not have any default annotations so skip it |
duke@435 | 2020 | continue; |
duke@435 | 2021 | } |
duke@435 | 2022 | |
duke@435 | 2023 | int byte_i = 0; // byte index into method_default_annotations |
duke@435 | 2024 | |
duke@435 | 2025 | if (!rewrite_cp_refs_in_element_value( |
duke@435 | 2026 | method_default_annotations, byte_i, THREAD)) { |
duke@435 | 2027 | RC_TRACE_WITH_THREAD(0x02000000, THREAD, |
duke@435 | 2028 | ("bad default element_value at %d", i)); |
twisti@1040 | 2029 | // propagate failure back to caller |
duke@435 | 2030 | return false; |
duke@435 | 2031 | } |
duke@435 | 2032 | } |
duke@435 | 2033 | |
duke@435 | 2034 | return true; |
duke@435 | 2035 | } // end rewrite_cp_refs_in_methods_default_annotations() |
duke@435 | 2036 | |
duke@435 | 2037 | |
duke@435 | 2038 | // Rewrite constant pool references in the method's stackmap table. |
duke@435 | 2039 | // These "structures" are adapted from the StackMapTable_attribute that |
duke@435 | 2040 | // is described in section 4.8.4 of the 6.0 version of the VM spec |
duke@435 | 2041 | // (dated 2005.10.26): |
duke@435 | 2042 | // file:///net/quincunx.sfbay/export/gbracha/ClassFile-Java6.pdf |
duke@435 | 2043 | // |
duke@435 | 2044 | // stack_map { |
duke@435 | 2045 | // u2 number_of_entries; |
duke@435 | 2046 | // stack_map_frame entries[number_of_entries]; |
duke@435 | 2047 | // } |
duke@435 | 2048 | // |
duke@435 | 2049 | void VM_RedefineClasses::rewrite_cp_refs_in_stack_map_table( |
duke@435 | 2050 | methodHandle method, TRAPS) { |
duke@435 | 2051 | |
duke@435 | 2052 | if (!method->has_stackmap_table()) { |
duke@435 | 2053 | return; |
duke@435 | 2054 | } |
duke@435 | 2055 | |
coleenp@4037 | 2056 | AnnotationArray* stackmap_data = method->stackmap_data(); |
coleenp@4037 | 2057 | address stackmap_p = (address)stackmap_data->adr_at(0); |
duke@435 | 2058 | address stackmap_end = stackmap_p + stackmap_data->length(); |
duke@435 | 2059 | |
duke@435 | 2060 | assert(stackmap_p + 2 <= stackmap_end, "no room for number_of_entries"); |
duke@435 | 2061 | u2 number_of_entries = Bytes::get_Java_u2(stackmap_p); |
duke@435 | 2062 | stackmap_p += 2; |
duke@435 | 2063 | |
duke@435 | 2064 | RC_TRACE_WITH_THREAD(0x04000000, THREAD, |
duke@435 | 2065 | ("number_of_entries=%u", number_of_entries)); |
duke@435 | 2066 | |
duke@435 | 2067 | // walk through each stack_map_frame |
duke@435 | 2068 | u2 calc_number_of_entries = 0; |
duke@435 | 2069 | for (; calc_number_of_entries < number_of_entries; calc_number_of_entries++) { |
duke@435 | 2070 | // The stack_map_frame structure is a u1 frame_type followed by |
duke@435 | 2071 | // 0 or more bytes of data: |
duke@435 | 2072 | // |
duke@435 | 2073 | // union stack_map_frame { |
duke@435 | 2074 | // same_frame; |
duke@435 | 2075 | // same_locals_1_stack_item_frame; |
duke@435 | 2076 | // same_locals_1_stack_item_frame_extended; |
duke@435 | 2077 | // chop_frame; |
duke@435 | 2078 | // same_frame_extended; |
duke@435 | 2079 | // append_frame; |
duke@435 | 2080 | // full_frame; |
duke@435 | 2081 | // } |
duke@435 | 2082 | |
duke@435 | 2083 | assert(stackmap_p + 1 <= stackmap_end, "no room for frame_type"); |
duke@435 | 2084 | // The Linux compiler does not like frame_type to be u1 or u2. It |
duke@435 | 2085 | // issues the following warning for the first if-statement below: |
duke@435 | 2086 | // |
duke@435 | 2087 | // "warning: comparison is always true due to limited range of data type" |
duke@435 | 2088 | // |
duke@435 | 2089 | u4 frame_type = *stackmap_p; |
duke@435 | 2090 | stackmap_p++; |
duke@435 | 2091 | |
duke@435 | 2092 | // same_frame { |
duke@435 | 2093 | // u1 frame_type = SAME; /* 0-63 */ |
duke@435 | 2094 | // } |
duke@435 | 2095 | if (frame_type >= 0 && frame_type <= 63) { |
duke@435 | 2096 | // nothing more to do for same_frame |
duke@435 | 2097 | } |
duke@435 | 2098 | |
duke@435 | 2099 | // same_locals_1_stack_item_frame { |
duke@435 | 2100 | // u1 frame_type = SAME_LOCALS_1_STACK_ITEM; /* 64-127 */ |
duke@435 | 2101 | // verification_type_info stack[1]; |
duke@435 | 2102 | // } |
duke@435 | 2103 | else if (frame_type >= 64 && frame_type <= 127) { |
duke@435 | 2104 | rewrite_cp_refs_in_verification_type_info(stackmap_p, stackmap_end, |
duke@435 | 2105 | calc_number_of_entries, frame_type, THREAD); |
duke@435 | 2106 | } |
duke@435 | 2107 | |
duke@435 | 2108 | // reserved for future use |
duke@435 | 2109 | else if (frame_type >= 128 && frame_type <= 246) { |
duke@435 | 2110 | // nothing more to do for reserved frame_types |
duke@435 | 2111 | } |
duke@435 | 2112 | |
duke@435 | 2113 | // same_locals_1_stack_item_frame_extended { |
duke@435 | 2114 | // u1 frame_type = SAME_LOCALS_1_STACK_ITEM_EXTENDED; /* 247 */ |
duke@435 | 2115 | // u2 offset_delta; |
duke@435 | 2116 | // verification_type_info stack[1]; |
duke@435 | 2117 | // } |
duke@435 | 2118 | else if (frame_type == 247) { |
duke@435 | 2119 | stackmap_p += 2; |
duke@435 | 2120 | rewrite_cp_refs_in_verification_type_info(stackmap_p, stackmap_end, |
duke@435 | 2121 | calc_number_of_entries, frame_type, THREAD); |
duke@435 | 2122 | } |
duke@435 | 2123 | |
duke@435 | 2124 | // chop_frame { |
duke@435 | 2125 | // u1 frame_type = CHOP; /* 248-250 */ |
duke@435 | 2126 | // u2 offset_delta; |
duke@435 | 2127 | // } |
duke@435 | 2128 | else if (frame_type >= 248 && frame_type <= 250) { |
duke@435 | 2129 | stackmap_p += 2; |
duke@435 | 2130 | } |
duke@435 | 2131 | |
duke@435 | 2132 | // same_frame_extended { |
duke@435 | 2133 | // u1 frame_type = SAME_FRAME_EXTENDED; /* 251*/ |
duke@435 | 2134 | // u2 offset_delta; |
duke@435 | 2135 | // } |
duke@435 | 2136 | else if (frame_type == 251) { |
duke@435 | 2137 | stackmap_p += 2; |
duke@435 | 2138 | } |
duke@435 | 2139 | |
duke@435 | 2140 | // append_frame { |
duke@435 | 2141 | // u1 frame_type = APPEND; /* 252-254 */ |
duke@435 | 2142 | // u2 offset_delta; |
duke@435 | 2143 | // verification_type_info locals[frame_type - 251]; |
duke@435 | 2144 | // } |
duke@435 | 2145 | else if (frame_type >= 252 && frame_type <= 254) { |
duke@435 | 2146 | assert(stackmap_p + 2 <= stackmap_end, |
duke@435 | 2147 | "no room for offset_delta"); |
duke@435 | 2148 | stackmap_p += 2; |
duke@435 | 2149 | u1 len = frame_type - 251; |
duke@435 | 2150 | for (u1 i = 0; i < len; i++) { |
duke@435 | 2151 | rewrite_cp_refs_in_verification_type_info(stackmap_p, stackmap_end, |
duke@435 | 2152 | calc_number_of_entries, frame_type, THREAD); |
duke@435 | 2153 | } |
duke@435 | 2154 | } |
duke@435 | 2155 | |
duke@435 | 2156 | // full_frame { |
duke@435 | 2157 | // u1 frame_type = FULL_FRAME; /* 255 */ |
duke@435 | 2158 | // u2 offset_delta; |
duke@435 | 2159 | // u2 number_of_locals; |
duke@435 | 2160 | // verification_type_info locals[number_of_locals]; |
duke@435 | 2161 | // u2 number_of_stack_items; |
duke@435 | 2162 | // verification_type_info stack[number_of_stack_items]; |
duke@435 | 2163 | // } |
duke@435 | 2164 | else if (frame_type == 255) { |
duke@435 | 2165 | assert(stackmap_p + 2 + 2 <= stackmap_end, |
duke@435 | 2166 | "no room for smallest full_frame"); |
duke@435 | 2167 | stackmap_p += 2; |
duke@435 | 2168 | |
duke@435 | 2169 | u2 number_of_locals = Bytes::get_Java_u2(stackmap_p); |
duke@435 | 2170 | stackmap_p += 2; |
duke@435 | 2171 | |
duke@435 | 2172 | for (u2 locals_i = 0; locals_i < number_of_locals; locals_i++) { |
duke@435 | 2173 | rewrite_cp_refs_in_verification_type_info(stackmap_p, stackmap_end, |
duke@435 | 2174 | calc_number_of_entries, frame_type, THREAD); |
duke@435 | 2175 | } |
duke@435 | 2176 | |
duke@435 | 2177 | // Use the largest size for the number_of_stack_items, but only get |
duke@435 | 2178 | // the right number of bytes. |
duke@435 | 2179 | u2 number_of_stack_items = Bytes::get_Java_u2(stackmap_p); |
duke@435 | 2180 | stackmap_p += 2; |
duke@435 | 2181 | |
duke@435 | 2182 | for (u2 stack_i = 0; stack_i < number_of_stack_items; stack_i++) { |
duke@435 | 2183 | rewrite_cp_refs_in_verification_type_info(stackmap_p, stackmap_end, |
duke@435 | 2184 | calc_number_of_entries, frame_type, THREAD); |
duke@435 | 2185 | } |
duke@435 | 2186 | } |
duke@435 | 2187 | } // end while there is a stack_map_frame |
duke@435 | 2188 | assert(number_of_entries == calc_number_of_entries, "sanity check"); |
duke@435 | 2189 | } // end rewrite_cp_refs_in_stack_map_table() |
duke@435 | 2190 | |
duke@435 | 2191 | |
duke@435 | 2192 | // Rewrite constant pool references in the verification type info |
duke@435 | 2193 | // portion of the method's stackmap table. These "structures" are |
duke@435 | 2194 | // adapted from the StackMapTable_attribute that is described in |
duke@435 | 2195 | // section 4.8.4 of the 6.0 version of the VM spec (dated 2005.10.26): |
duke@435 | 2196 | // file:///net/quincunx.sfbay/export/gbracha/ClassFile-Java6.pdf |
duke@435 | 2197 | // |
duke@435 | 2198 | // The verification_type_info structure is a u1 tag followed by 0 or |
duke@435 | 2199 | // more bytes of data: |
duke@435 | 2200 | // |
duke@435 | 2201 | // union verification_type_info { |
duke@435 | 2202 | // Top_variable_info; |
duke@435 | 2203 | // Integer_variable_info; |
duke@435 | 2204 | // Float_variable_info; |
duke@435 | 2205 | // Long_variable_info; |
duke@435 | 2206 | // Double_variable_info; |
duke@435 | 2207 | // Null_variable_info; |
duke@435 | 2208 | // UninitializedThis_variable_info; |
duke@435 | 2209 | // Object_variable_info; |
duke@435 | 2210 | // Uninitialized_variable_info; |
duke@435 | 2211 | // } |
duke@435 | 2212 | // |
duke@435 | 2213 | void VM_RedefineClasses::rewrite_cp_refs_in_verification_type_info( |
duke@435 | 2214 | address& stackmap_p_ref, address stackmap_end, u2 frame_i, |
duke@435 | 2215 | u1 frame_type, TRAPS) { |
duke@435 | 2216 | |
duke@435 | 2217 | assert(stackmap_p_ref + 1 <= stackmap_end, "no room for tag"); |
duke@435 | 2218 | u1 tag = *stackmap_p_ref; |
duke@435 | 2219 | stackmap_p_ref++; |
duke@435 | 2220 | |
duke@435 | 2221 | switch (tag) { |
duke@435 | 2222 | // Top_variable_info { |
duke@435 | 2223 | // u1 tag = ITEM_Top; /* 0 */ |
duke@435 | 2224 | // } |
duke@435 | 2225 | // verificationType.hpp has zero as ITEM_Bogus instead of ITEM_Top |
duke@435 | 2226 | case 0: // fall through |
duke@435 | 2227 | |
duke@435 | 2228 | // Integer_variable_info { |
duke@435 | 2229 | // u1 tag = ITEM_Integer; /* 1 */ |
duke@435 | 2230 | // } |
duke@435 | 2231 | case ITEM_Integer: // fall through |
duke@435 | 2232 | |
duke@435 | 2233 | // Float_variable_info { |
duke@435 | 2234 | // u1 tag = ITEM_Float; /* 2 */ |
duke@435 | 2235 | // } |
duke@435 | 2236 | case ITEM_Float: // fall through |
duke@435 | 2237 | |
duke@435 | 2238 | // Double_variable_info { |
duke@435 | 2239 | // u1 tag = ITEM_Double; /* 3 */ |
duke@435 | 2240 | // } |
duke@435 | 2241 | case ITEM_Double: // fall through |
duke@435 | 2242 | |
duke@435 | 2243 | // Long_variable_info { |
duke@435 | 2244 | // u1 tag = ITEM_Long; /* 4 */ |
duke@435 | 2245 | // } |
duke@435 | 2246 | case ITEM_Long: // fall through |
duke@435 | 2247 | |
duke@435 | 2248 | // Null_variable_info { |
duke@435 | 2249 | // u1 tag = ITEM_Null; /* 5 */ |
duke@435 | 2250 | // } |
duke@435 | 2251 | case ITEM_Null: // fall through |
duke@435 | 2252 | |
duke@435 | 2253 | // UninitializedThis_variable_info { |
duke@435 | 2254 | // u1 tag = ITEM_UninitializedThis; /* 6 */ |
duke@435 | 2255 | // } |
duke@435 | 2256 | case ITEM_UninitializedThis: |
duke@435 | 2257 | // nothing more to do for the above tag types |
duke@435 | 2258 | break; |
duke@435 | 2259 | |
duke@435 | 2260 | // Object_variable_info { |
duke@435 | 2261 | // u1 tag = ITEM_Object; /* 7 */ |
duke@435 | 2262 | // u2 cpool_index; |
duke@435 | 2263 | // } |
duke@435 | 2264 | case ITEM_Object: |
duke@435 | 2265 | { |
duke@435 | 2266 | assert(stackmap_p_ref + 2 <= stackmap_end, "no room for cpool_index"); |
duke@435 | 2267 | u2 cpool_index = Bytes::get_Java_u2(stackmap_p_ref); |
duke@435 | 2268 | u2 new_cp_index = find_new_index(cpool_index); |
duke@435 | 2269 | if (new_cp_index != 0) { |
duke@435 | 2270 | RC_TRACE_WITH_THREAD(0x04000000, THREAD, |
duke@435 | 2271 | ("mapped old cpool_index=%d", cpool_index)); |
duke@435 | 2272 | Bytes::put_Java_u2(stackmap_p_ref, new_cp_index); |
duke@435 | 2273 | cpool_index = new_cp_index; |
duke@435 | 2274 | } |
duke@435 | 2275 | stackmap_p_ref += 2; |
duke@435 | 2276 | |
duke@435 | 2277 | RC_TRACE_WITH_THREAD(0x04000000, THREAD, |
duke@435 | 2278 | ("frame_i=%u, frame_type=%u, cpool_index=%d", frame_i, |
duke@435 | 2279 | frame_type, cpool_index)); |
duke@435 | 2280 | } break; |
duke@435 | 2281 | |
duke@435 | 2282 | // Uninitialized_variable_info { |
duke@435 | 2283 | // u1 tag = ITEM_Uninitialized; /* 8 */ |
duke@435 | 2284 | // u2 offset; |
duke@435 | 2285 | // } |
duke@435 | 2286 | case ITEM_Uninitialized: |
duke@435 | 2287 | assert(stackmap_p_ref + 2 <= stackmap_end, "no room for offset"); |
duke@435 | 2288 | stackmap_p_ref += 2; |
duke@435 | 2289 | break; |
duke@435 | 2290 | |
duke@435 | 2291 | default: |
duke@435 | 2292 | RC_TRACE_WITH_THREAD(0x04000000, THREAD, |
duke@435 | 2293 | ("frame_i=%u, frame_type=%u, bad tag=0x%x", frame_i, frame_type, tag)); |
duke@435 | 2294 | ShouldNotReachHere(); |
duke@435 | 2295 | break; |
duke@435 | 2296 | } // end switch (tag) |
duke@435 | 2297 | } // end rewrite_cp_refs_in_verification_type_info() |
duke@435 | 2298 | |
duke@435 | 2299 | |
duke@435 | 2300 | // Change the constant pool associated with klass scratch_class to |
duke@435 | 2301 | // scratch_cp. If shrink is true, then scratch_cp_length elements |
duke@435 | 2302 | // are copied from scratch_cp to a smaller constant pool and the |
duke@435 | 2303 | // smaller constant pool is associated with scratch_class. |
duke@435 | 2304 | void VM_RedefineClasses::set_new_constant_pool( |
coleenp@4037 | 2305 | ClassLoaderData* loader_data, |
duke@435 | 2306 | instanceKlassHandle scratch_class, constantPoolHandle scratch_cp, |
coleenp@4037 | 2307 | int scratch_cp_length, TRAPS) { |
coleenp@4037 | 2308 | assert(scratch_cp->length() >= scratch_cp_length, "sanity check"); |
coleenp@4037 | 2309 | |
coleenp@4466 | 2310 | // scratch_cp is a merged constant pool and has enough space for a |
coleenp@4466 | 2311 | // worst case merge situation. We want to associate the minimum |
coleenp@4466 | 2312 | // sized constant pool with the klass to save space. |
coleenp@4466 | 2313 | constantPoolHandle smaller_cp(THREAD, |
coleenp@4466 | 2314 | ConstantPool::allocate(loader_data, scratch_cp_length, THREAD)); |
coleenp@4466 | 2315 | |
coleenp@4466 | 2316 | // preserve version() value in the smaller copy |
coleenp@4466 | 2317 | int version = scratch_cp->version(); |
coleenp@4466 | 2318 | assert(version != 0, "sanity check"); |
coleenp@4466 | 2319 | smaller_cp->set_version(version); |
coleenp@4466 | 2320 | |
sspitsyn@4493 | 2321 | // attach klass to new constant pool |
sspitsyn@4493 | 2322 | // reference to the cp holder is needed for copy_operands() |
sspitsyn@4493 | 2323 | smaller_cp->set_pool_holder(scratch_class()); |
sspitsyn@4493 | 2324 | |
coleenp@4466 | 2325 | scratch_cp->copy_cp_to(1, scratch_cp_length - 1, smaller_cp, 1, THREAD); |
coleenp@4466 | 2326 | scratch_cp = smaller_cp; |
duke@435 | 2327 | |
duke@435 | 2328 | // attach new constant pool to klass |
duke@435 | 2329 | scratch_class->set_constants(scratch_cp()); |
duke@435 | 2330 | |
duke@435 | 2331 | int i; // for portability |
duke@435 | 2332 | |
duke@435 | 2333 | // update each field in klass to use new constant pool indices as needed |
never@3137 | 2334 | for (JavaFieldStream fs(scratch_class); !fs.done(); fs.next()) { |
never@3137 | 2335 | jshort cur_index = fs.name_index(); |
duke@435 | 2336 | jshort new_index = find_new_index(cur_index); |
duke@435 | 2337 | if (new_index != 0) { |
duke@435 | 2338 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2339 | ("field-name_index change: %d to %d", cur_index, new_index)); |
never@3137 | 2340 | fs.set_name_index(new_index); |
duke@435 | 2341 | } |
never@3137 | 2342 | cur_index = fs.signature_index(); |
duke@435 | 2343 | new_index = find_new_index(cur_index); |
duke@435 | 2344 | if (new_index != 0) { |
duke@435 | 2345 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2346 | ("field-signature_index change: %d to %d", cur_index, new_index)); |
never@3137 | 2347 | fs.set_signature_index(new_index); |
duke@435 | 2348 | } |
never@3137 | 2349 | cur_index = fs.initval_index(); |
duke@435 | 2350 | new_index = find_new_index(cur_index); |
duke@435 | 2351 | if (new_index != 0) { |
duke@435 | 2352 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2353 | ("field-initval_index change: %d to %d", cur_index, new_index)); |
never@3137 | 2354 | fs.set_initval_index(new_index); |
duke@435 | 2355 | } |
never@3137 | 2356 | cur_index = fs.generic_signature_index(); |
duke@435 | 2357 | new_index = find_new_index(cur_index); |
duke@435 | 2358 | if (new_index != 0) { |
duke@435 | 2359 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2360 | ("field-generic_signature change: %d to %d", cur_index, new_index)); |
never@3137 | 2361 | fs.set_generic_signature_index(new_index); |
duke@435 | 2362 | } |
duke@435 | 2363 | } // end for each field |
duke@435 | 2364 | |
duke@435 | 2365 | // Update constant pool indices in the inner classes info to use |
duke@435 | 2366 | // new constant indices as needed. The inner classes info is a |
duke@435 | 2367 | // quadruple: |
duke@435 | 2368 | // (inner_class_info, outer_class_info, inner_name, inner_access_flags) |
jiangli@3670 | 2369 | InnerClassesIterator iter(scratch_class); |
jiangli@3670 | 2370 | for (; !iter.done(); iter.next()) { |
jiangli@3670 | 2371 | int cur_index = iter.inner_class_info_index(); |
jiangli@3670 | 2372 | if (cur_index == 0) { |
jiangli@3670 | 2373 | continue; // JVM spec. allows null inner class refs so skip it |
jiangli@3670 | 2374 | } |
jiangli@3670 | 2375 | int new_index = find_new_index(cur_index); |
jiangli@3670 | 2376 | if (new_index != 0) { |
jiangli@3670 | 2377 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
jiangli@3670 | 2378 | ("inner_class_info change: %d to %d", cur_index, new_index)); |
jiangli@3670 | 2379 | iter.set_inner_class_info_index(new_index); |
jiangli@3670 | 2380 | } |
jiangli@3670 | 2381 | cur_index = iter.outer_class_info_index(); |
jiangli@3670 | 2382 | new_index = find_new_index(cur_index); |
jiangli@3670 | 2383 | if (new_index != 0) { |
jiangli@3670 | 2384 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
jiangli@3670 | 2385 | ("outer_class_info change: %d to %d", cur_index, new_index)); |
jiangli@3670 | 2386 | iter.set_outer_class_info_index(new_index); |
jiangli@3670 | 2387 | } |
jiangli@3670 | 2388 | cur_index = iter.inner_name_index(); |
jiangli@3670 | 2389 | new_index = find_new_index(cur_index); |
jiangli@3670 | 2390 | if (new_index != 0) { |
jiangli@3670 | 2391 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
jiangli@3670 | 2392 | ("inner_name change: %d to %d", cur_index, new_index)); |
jiangli@3670 | 2393 | iter.set_inner_name_index(new_index); |
jiangli@3670 | 2394 | } |
jiangli@3670 | 2395 | } // end for each inner class |
duke@435 | 2396 | |
duke@435 | 2397 | // Attach each method in klass to the new constant pool and update |
duke@435 | 2398 | // to use new constant pool indices as needed: |
coleenp@4037 | 2399 | Array<Method*>* methods = scratch_class->methods(); |
duke@435 | 2400 | for (i = methods->length() - 1; i >= 0; i--) { |
coleenp@4037 | 2401 | methodHandle method(THREAD, methods->at(i)); |
duke@435 | 2402 | method->set_constants(scratch_cp()); |
duke@435 | 2403 | |
duke@435 | 2404 | int new_index = find_new_index(method->name_index()); |
duke@435 | 2405 | if (new_index != 0) { |
duke@435 | 2406 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2407 | ("method-name_index change: %d to %d", method->name_index(), |
duke@435 | 2408 | new_index)); |
duke@435 | 2409 | method->set_name_index(new_index); |
duke@435 | 2410 | } |
duke@435 | 2411 | new_index = find_new_index(method->signature_index()); |
duke@435 | 2412 | if (new_index != 0) { |
duke@435 | 2413 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2414 | ("method-signature_index change: %d to %d", |
duke@435 | 2415 | method->signature_index(), new_index)); |
duke@435 | 2416 | method->set_signature_index(new_index); |
duke@435 | 2417 | } |
duke@435 | 2418 | new_index = find_new_index(method->generic_signature_index()); |
duke@435 | 2419 | if (new_index != 0) { |
duke@435 | 2420 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2421 | ("method-generic_signature_index change: %d to %d", |
duke@435 | 2422 | method->generic_signature_index(), new_index)); |
duke@435 | 2423 | method->set_generic_signature_index(new_index); |
duke@435 | 2424 | } |
duke@435 | 2425 | |
duke@435 | 2426 | // Update constant pool indices in the method's checked exception |
duke@435 | 2427 | // table to use new constant indices as needed. |
duke@435 | 2428 | int cext_length = method->checked_exceptions_length(); |
duke@435 | 2429 | if (cext_length > 0) { |
duke@435 | 2430 | CheckedExceptionElement * cext_table = |
duke@435 | 2431 | method->checked_exceptions_start(); |
duke@435 | 2432 | for (int j = 0; j < cext_length; j++) { |
duke@435 | 2433 | int cur_index = cext_table[j].class_cp_index; |
duke@435 | 2434 | int new_index = find_new_index(cur_index); |
duke@435 | 2435 | if (new_index != 0) { |
duke@435 | 2436 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2437 | ("cext-class_cp_index change: %d to %d", cur_index, new_index)); |
duke@435 | 2438 | cext_table[j].class_cp_index = (u2)new_index; |
duke@435 | 2439 | } |
duke@435 | 2440 | } // end for each checked exception table entry |
duke@435 | 2441 | } // end if there are checked exception table entries |
duke@435 | 2442 | |
duke@435 | 2443 | // Update each catch type index in the method's exception table |
duke@435 | 2444 | // to use new constant pool indices as needed. The exception table |
duke@435 | 2445 | // holds quadruple entries of the form: |
duke@435 | 2446 | // (beg_bci, end_bci, handler_bci, klass_index) |
jiangli@3917 | 2447 | |
jiangli@3917 | 2448 | ExceptionTable ex_table(method()); |
jiangli@3917 | 2449 | int ext_length = ex_table.length(); |
jiangli@3917 | 2450 | |
jiangli@3917 | 2451 | for (int j = 0; j < ext_length; j ++) { |
jiangli@3917 | 2452 | int cur_index = ex_table.catch_type_index(j); |
duke@435 | 2453 | int new_index = find_new_index(cur_index); |
duke@435 | 2454 | if (new_index != 0) { |
duke@435 | 2455 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2456 | ("ext-klass_index change: %d to %d", cur_index, new_index)); |
jiangli@3917 | 2457 | ex_table.set_catch_type_index(j, new_index); |
duke@435 | 2458 | } |
duke@435 | 2459 | } // end for each exception table entry |
duke@435 | 2460 | |
duke@435 | 2461 | // Update constant pool indices in the method's local variable |
duke@435 | 2462 | // table to use new constant indices as needed. The local variable |
duke@435 | 2463 | // table hold sextuple entries of the form: |
duke@435 | 2464 | // (start_pc, length, name_index, descriptor_index, signature_index, slot) |
duke@435 | 2465 | int lvt_length = method->localvariable_table_length(); |
duke@435 | 2466 | if (lvt_length > 0) { |
duke@435 | 2467 | LocalVariableTableElement * lv_table = |
duke@435 | 2468 | method->localvariable_table_start(); |
duke@435 | 2469 | for (int j = 0; j < lvt_length; j++) { |
duke@435 | 2470 | int cur_index = lv_table[j].name_cp_index; |
duke@435 | 2471 | int new_index = find_new_index(cur_index); |
duke@435 | 2472 | if (new_index != 0) { |
duke@435 | 2473 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2474 | ("lvt-name_cp_index change: %d to %d", cur_index, new_index)); |
duke@435 | 2475 | lv_table[j].name_cp_index = (u2)new_index; |
duke@435 | 2476 | } |
duke@435 | 2477 | cur_index = lv_table[j].descriptor_cp_index; |
duke@435 | 2478 | new_index = find_new_index(cur_index); |
duke@435 | 2479 | if (new_index != 0) { |
duke@435 | 2480 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2481 | ("lvt-descriptor_cp_index change: %d to %d", cur_index, |
duke@435 | 2482 | new_index)); |
duke@435 | 2483 | lv_table[j].descriptor_cp_index = (u2)new_index; |
duke@435 | 2484 | } |
duke@435 | 2485 | cur_index = lv_table[j].signature_cp_index; |
duke@435 | 2486 | new_index = find_new_index(cur_index); |
duke@435 | 2487 | if (new_index != 0) { |
duke@435 | 2488 | RC_TRACE_WITH_THREAD(0x00080000, THREAD, |
duke@435 | 2489 | ("lvt-signature_cp_index change: %d to %d", cur_index, new_index)); |
duke@435 | 2490 | lv_table[j].signature_cp_index = (u2)new_index; |
duke@435 | 2491 | } |
duke@435 | 2492 | } // end for each local variable table entry |
duke@435 | 2493 | } // end if there are local variable table entries |
duke@435 | 2494 | |
duke@435 | 2495 | rewrite_cp_refs_in_stack_map_table(method, THREAD); |
duke@435 | 2496 | } // end for each method |
duke@435 | 2497 | } // end set_new_constant_pool() |
duke@435 | 2498 | |
duke@435 | 2499 | |
coleenp@4037 | 2500 | void VM_RedefineClasses::adjust_array_vtable(Klass* k_oop) { |
coleenp@4142 | 2501 | ArrayKlass* ak = ArrayKlass::cast(k_oop); |
coleenp@4037 | 2502 | bool trace_name_printed = false; |
coleenp@4037 | 2503 | ak->vtable()->adjust_method_entries(_matching_old_methods, |
coleenp@4037 | 2504 | _matching_new_methods, |
coleenp@4037 | 2505 | _matching_methods_length, |
coleenp@4037 | 2506 | &trace_name_printed); |
coleenp@4037 | 2507 | } |
coleenp@4037 | 2508 | |
duke@435 | 2509 | // Unevolving classes may point to methods of the_class directly |
duke@435 | 2510 | // from their constant pool caches, itables, and/or vtables. We |
duke@435 | 2511 | // use the SystemDictionary::classes_do() facility and this helper |
duke@435 | 2512 | // to fix up these pointers. |
duke@435 | 2513 | // |
duke@435 | 2514 | // Note: We currently don't support updating the vtable in |
duke@435 | 2515 | // arrayKlassOops. See Open Issues in jvmtiRedefineClasses.hpp. |
coleenp@4037 | 2516 | void VM_RedefineClasses::adjust_cpool_cache_and_vtable(Klass* k_oop, |
coleenp@4037 | 2517 | ClassLoaderData* initiating_loader, |
coleenp@4037 | 2518 | TRAPS) { |
coleenp@4037 | 2519 | Klass *k = k_oop; |
duke@435 | 2520 | if (k->oop_is_instance()) { |
duke@435 | 2521 | HandleMark hm(THREAD); |
coleenp@4037 | 2522 | InstanceKlass *ik = (InstanceKlass *) k; |
duke@435 | 2523 | |
duke@435 | 2524 | // HotSpot specific optimization! HotSpot does not currently |
duke@435 | 2525 | // support delegation from the bootstrap class loader to a |
duke@435 | 2526 | // user-defined class loader. This means that if the bootstrap |
duke@435 | 2527 | // class loader is the initiating class loader, then it will also |
duke@435 | 2528 | // be the defining class loader. This also means that classes |
duke@435 | 2529 | // loaded by the bootstrap class loader cannot refer to classes |
duke@435 | 2530 | // loaded by a user-defined class loader. Note: a user-defined |
duke@435 | 2531 | // class loader can delegate to the bootstrap class loader. |
duke@435 | 2532 | // |
duke@435 | 2533 | // If the current class being redefined has a user-defined class |
duke@435 | 2534 | // loader as its defining class loader, then we can skip all |
duke@435 | 2535 | // classes loaded by the bootstrap class loader. |
duke@435 | 2536 | bool is_user_defined = |
coleenp@4037 | 2537 | InstanceKlass::cast(_the_class_oop)->class_loader() != NULL; |
duke@435 | 2538 | if (is_user_defined && ik->class_loader() == NULL) { |
duke@435 | 2539 | return; |
duke@435 | 2540 | } |
duke@435 | 2541 | |
coleenp@4037 | 2542 | // If the class being redefined is java.lang.Object, we need to fix all |
coleenp@4037 | 2543 | // array class vtables also |
coleenp@4037 | 2544 | if (_the_class_oop == SystemDictionary::Object_klass()) { |
coleenp@4037 | 2545 | ik->array_klasses_do(adjust_array_vtable); |
coleenp@4037 | 2546 | } |
coleenp@4037 | 2547 | |
duke@435 | 2548 | // This is a very busy routine. We don't want too much tracing |
duke@435 | 2549 | // printed out. |
duke@435 | 2550 | bool trace_name_printed = false; |
duke@435 | 2551 | |
duke@435 | 2552 | // Very noisy: only enable this call if you are trying to determine |
duke@435 | 2553 | // that a specific class gets found by this routine. |
duke@435 | 2554 | // RC_TRACE macro has an embedded ResourceMark |
duke@435 | 2555 | // RC_TRACE_WITH_THREAD(0x00100000, THREAD, |
duke@435 | 2556 | // ("adjust check: name=%s", ik->external_name())); |
duke@435 | 2557 | // trace_name_printed = true; |
duke@435 | 2558 | |
duke@435 | 2559 | // Fix the vtable embedded in the_class and subclasses of the_class, |
duke@435 | 2560 | // if one exists. We discard scratch_class and we don't keep an |
coleenp@4037 | 2561 | // InstanceKlass around to hold obsolete methods so we don't have |
coleenp@4037 | 2562 | // any other InstanceKlass embedded vtables to update. The vtable |
coleenp@4037 | 2563 | // holds the Method*s for virtual (but not final) methods. |
duke@435 | 2564 | if (ik->vtable_length() > 0 && ik->is_subtype_of(_the_class_oop)) { |
duke@435 | 2565 | // ik->vtable() creates a wrapper object; rm cleans it up |
duke@435 | 2566 | ResourceMark rm(THREAD); |
duke@435 | 2567 | ik->vtable()->adjust_method_entries(_matching_old_methods, |
duke@435 | 2568 | _matching_new_methods, |
duke@435 | 2569 | _matching_methods_length, |
duke@435 | 2570 | &trace_name_printed); |
duke@435 | 2571 | } |
duke@435 | 2572 | |
duke@435 | 2573 | // If the current class has an itable and we are either redefining an |
duke@435 | 2574 | // interface or if the current class is a subclass of the_class, then |
duke@435 | 2575 | // we potentially have to fix the itable. If we are redefining an |
duke@435 | 2576 | // interface, then we have to call adjust_method_entries() for |
coleenp@4037 | 2577 | // every InstanceKlass that has an itable since there isn't a |
coleenp@4037 | 2578 | // subclass relationship between an interface and an InstanceKlass. |
hseigel@4278 | 2579 | if (ik->itable_length() > 0 && (_the_class_oop->is_interface() |
duke@435 | 2580 | || ik->is_subclass_of(_the_class_oop))) { |
duke@435 | 2581 | // ik->itable() creates a wrapper object; rm cleans it up |
duke@435 | 2582 | ResourceMark rm(THREAD); |
duke@435 | 2583 | ik->itable()->adjust_method_entries(_matching_old_methods, |
duke@435 | 2584 | _matching_new_methods, |
duke@435 | 2585 | _matching_methods_length, |
duke@435 | 2586 | &trace_name_printed); |
duke@435 | 2587 | } |
duke@435 | 2588 | |
duke@435 | 2589 | // The constant pools in other classes (other_cp) can refer to |
duke@435 | 2590 | // methods in the_class. We have to update method information in |
duke@435 | 2591 | // other_cp's cache. If other_cp has a previous version, then we |
duke@435 | 2592 | // have to repeat the process for each previous version. The |
coleenp@4037 | 2593 | // constant pool cache holds the Method*s for non-virtual |
duke@435 | 2594 | // methods and for virtual, final methods. |
duke@435 | 2595 | // |
duke@435 | 2596 | // Special case: if the current class is the_class, then new_cp |
duke@435 | 2597 | // has already been attached to the_class and old_cp has already |
duke@435 | 2598 | // been added as a previous version. The new_cp doesn't have any |
duke@435 | 2599 | // cached references to old methods so it doesn't need to be |
duke@435 | 2600 | // updated. We can simply start with the previous version(s) in |
duke@435 | 2601 | // that case. |
duke@435 | 2602 | constantPoolHandle other_cp; |
coleenp@4037 | 2603 | ConstantPoolCache* cp_cache; |
duke@435 | 2604 | |
duke@435 | 2605 | if (k_oop != _the_class_oop) { |
duke@435 | 2606 | // this klass' constant pool cache may need adjustment |
duke@435 | 2607 | other_cp = constantPoolHandle(ik->constants()); |
duke@435 | 2608 | cp_cache = other_cp->cache(); |
duke@435 | 2609 | if (cp_cache != NULL) { |
duke@435 | 2610 | cp_cache->adjust_method_entries(_matching_old_methods, |
duke@435 | 2611 | _matching_new_methods, |
duke@435 | 2612 | _matching_methods_length, |
duke@435 | 2613 | &trace_name_printed); |
duke@435 | 2614 | } |
duke@435 | 2615 | } |
duke@435 | 2616 | { |
duke@435 | 2617 | ResourceMark rm(THREAD); |
duke@435 | 2618 | // PreviousVersionInfo objects returned via PreviousVersionWalker |
duke@435 | 2619 | // contain a GrowableArray of handles. We have to clean up the |
duke@435 | 2620 | // GrowableArray _after_ the PreviousVersionWalker destructor |
duke@435 | 2621 | // has destroyed the handles. |
duke@435 | 2622 | { |
duke@435 | 2623 | // the previous versions' constant pool caches may need adjustment |
duke@435 | 2624 | PreviousVersionWalker pvw(ik); |
duke@435 | 2625 | for (PreviousVersionInfo * pv_info = pvw.next_previous_version(); |
duke@435 | 2626 | pv_info != NULL; pv_info = pvw.next_previous_version()) { |
duke@435 | 2627 | other_cp = pv_info->prev_constant_pool_handle(); |
duke@435 | 2628 | cp_cache = other_cp->cache(); |
duke@435 | 2629 | if (cp_cache != NULL) { |
duke@435 | 2630 | cp_cache->adjust_method_entries(_matching_old_methods, |
duke@435 | 2631 | _matching_new_methods, |
duke@435 | 2632 | _matching_methods_length, |
duke@435 | 2633 | &trace_name_printed); |
duke@435 | 2634 | } |
duke@435 | 2635 | } |
duke@435 | 2636 | } // pvw is cleaned up |
duke@435 | 2637 | } // rm is cleaned up |
duke@435 | 2638 | } |
duke@435 | 2639 | } |
duke@435 | 2640 | |
duke@435 | 2641 | void VM_RedefineClasses::update_jmethod_ids() { |
duke@435 | 2642 | for (int j = 0; j < _matching_methods_length; ++j) { |
coleenp@4037 | 2643 | Method* old_method = _matching_old_methods[j]; |
duke@435 | 2644 | jmethodID jmid = old_method->find_jmethod_id_or_null(); |
duke@435 | 2645 | if (jmid != NULL) { |
duke@435 | 2646 | // There is a jmethodID, change it to point to the new method |
duke@435 | 2647 | methodHandle new_method_h(_matching_new_methods[j]); |
coleenp@4037 | 2648 | Method::change_method_associated_with_jmethod_id(jmid, new_method_h()); |
coleenp@4037 | 2649 | assert(Method::resolve_jmethod_id(jmid) == _matching_new_methods[j], |
duke@435 | 2650 | "should be replaced"); |
duke@435 | 2651 | } |
duke@435 | 2652 | } |
duke@435 | 2653 | } |
duke@435 | 2654 | |
duke@435 | 2655 | void VM_RedefineClasses::check_methods_and_mark_as_obsolete( |
duke@435 | 2656 | BitMap *emcp_methods, int * emcp_method_count_p) { |
duke@435 | 2657 | *emcp_method_count_p = 0; |
duke@435 | 2658 | int obsolete_count = 0; |
duke@435 | 2659 | int old_index = 0; |
duke@435 | 2660 | for (int j = 0; j < _matching_methods_length; ++j, ++old_index) { |
coleenp@4037 | 2661 | Method* old_method = _matching_old_methods[j]; |
coleenp@4037 | 2662 | Method* new_method = _matching_new_methods[j]; |
coleenp@4037 | 2663 | Method* old_array_method; |
duke@435 | 2664 | |
duke@435 | 2665 | // Maintain an old_index into the _old_methods array by skipping |
duke@435 | 2666 | // deleted methods |
coleenp@4037 | 2667 | while ((old_array_method = _old_methods->at(old_index)) != old_method) { |
duke@435 | 2668 | ++old_index; |
duke@435 | 2669 | } |
duke@435 | 2670 | |
duke@435 | 2671 | if (MethodComparator::methods_EMCP(old_method, new_method)) { |
duke@435 | 2672 | // The EMCP definition from JSR-163 requires the bytecodes to be |
duke@435 | 2673 | // the same with the exception of constant pool indices which may |
duke@435 | 2674 | // differ. However, the constants referred to by those indices |
duke@435 | 2675 | // must be the same. |
duke@435 | 2676 | // |
duke@435 | 2677 | // We use methods_EMCP() for comparison since constant pool |
duke@435 | 2678 | // merging can remove duplicate constant pool entries that were |
duke@435 | 2679 | // present in the old method and removed from the rewritten new |
duke@435 | 2680 | // method. A faster binary comparison function would consider the |
duke@435 | 2681 | // old and new methods to be different when they are actually |
duke@435 | 2682 | // EMCP. |
duke@435 | 2683 | // |
duke@435 | 2684 | // The old and new methods are EMCP and you would think that we |
duke@435 | 2685 | // could get rid of one of them here and now and save some space. |
duke@435 | 2686 | // However, the concept of EMCP only considers the bytecodes and |
duke@435 | 2687 | // the constant pool entries in the comparison. Other things, |
duke@435 | 2688 | // e.g., the line number table (LNT) or the local variable table |
duke@435 | 2689 | // (LVT) don't count in the comparison. So the new (and EMCP) |
duke@435 | 2690 | // method can have a new LNT that we need so we can't just |
duke@435 | 2691 | // overwrite the new method with the old method. |
duke@435 | 2692 | // |
duke@435 | 2693 | // When this routine is called, we have already attached the new |
duke@435 | 2694 | // methods to the_class so the old methods are effectively |
duke@435 | 2695 | // overwritten. However, if an old method is still executing, |
duke@435 | 2696 | // then the old method cannot be collected until sometime after |
duke@435 | 2697 | // the old method call has returned. So the overwriting of old |
duke@435 | 2698 | // methods by new methods will save us space except for those |
duke@435 | 2699 | // (hopefully few) old methods that are still executing. |
duke@435 | 2700 | // |
coleenp@4037 | 2701 | // A method refers to a ConstMethod* and this presents another |
coleenp@4037 | 2702 | // possible avenue to space savings. The ConstMethod* in the |
duke@435 | 2703 | // new method contains possibly new attributes (LNT, LVT, etc). |
duke@435 | 2704 | // At first glance, it seems possible to save space by replacing |
coleenp@4037 | 2705 | // the ConstMethod* in the old method with the ConstMethod* |
duke@435 | 2706 | // from the new method. The old and new methods would share the |
coleenp@4037 | 2707 | // same ConstMethod* and we would save the space occupied by |
coleenp@4037 | 2708 | // the old ConstMethod*. However, the ConstMethod* contains |
duke@435 | 2709 | // a back reference to the containing method. Sharing the |
coleenp@4037 | 2710 | // ConstMethod* between two methods could lead to confusion in |
duke@435 | 2711 | // the code that uses the back reference. This would lead to |
duke@435 | 2712 | // brittle code that could be broken in non-obvious ways now or |
duke@435 | 2713 | // in the future. |
duke@435 | 2714 | // |
coleenp@4037 | 2715 | // Another possibility is to copy the ConstMethod* from the new |
duke@435 | 2716 | // method to the old method and then overwrite the new method with |
coleenp@4037 | 2717 | // the old method. Since the ConstMethod* contains the bytecodes |
duke@435 | 2718 | // for the method embedded in the oop, this option would change |
duke@435 | 2719 | // the bytecodes out from under any threads executing the old |
duke@435 | 2720 | // method and make the thread's bcp invalid. Since EMCP requires |
duke@435 | 2721 | // that the bytecodes be the same modulo constant pool indices, it |
duke@435 | 2722 | // is straight forward to compute the correct new bcp in the new |
coleenp@4037 | 2723 | // ConstMethod* from the old bcp in the old ConstMethod*. The |
duke@435 | 2724 | // time consuming part would be searching all the frames in all |
duke@435 | 2725 | // of the threads to find all of the calls to the old method. |
duke@435 | 2726 | // |
duke@435 | 2727 | // It looks like we will have to live with the limited savings |
duke@435 | 2728 | // that we get from effectively overwriting the old methods |
duke@435 | 2729 | // when the new methods are attached to the_class. |
duke@435 | 2730 | |
duke@435 | 2731 | // track which methods are EMCP for add_previous_version() call |
duke@435 | 2732 | emcp_methods->set_bit(old_index); |
duke@435 | 2733 | (*emcp_method_count_p)++; |
duke@435 | 2734 | |
duke@435 | 2735 | // An EMCP method is _not_ obsolete. An obsolete method has a |
duke@435 | 2736 | // different jmethodID than the current method. An EMCP method |
duke@435 | 2737 | // has the same jmethodID as the current method. Having the |
duke@435 | 2738 | // same jmethodID for all EMCP versions of a method allows for |
duke@435 | 2739 | // a consistent view of the EMCP methods regardless of which |
duke@435 | 2740 | // EMCP method you happen to have in hand. For example, a |
duke@435 | 2741 | // breakpoint set in one EMCP method will work for all EMCP |
duke@435 | 2742 | // versions of the method including the current one. |
duke@435 | 2743 | } else { |
duke@435 | 2744 | // mark obsolete methods as such |
duke@435 | 2745 | old_method->set_is_obsolete(); |
duke@435 | 2746 | obsolete_count++; |
duke@435 | 2747 | |
duke@435 | 2748 | // obsolete methods need a unique idnum |
coleenp@4037 | 2749 | u2 num = InstanceKlass::cast(_the_class_oop)->next_method_idnum(); |
coleenp@4037 | 2750 | if (num != ConstMethod::UNSET_IDNUM) { |
duke@435 | 2751 | // u2 old_num = old_method->method_idnum(); |
duke@435 | 2752 | old_method->set_method_idnum(num); |
duke@435 | 2753 | // TO DO: attach obsolete annotations to obsolete method's new idnum |
duke@435 | 2754 | } |
duke@435 | 2755 | // With tracing we try not to "yack" too much. The position of |
duke@435 | 2756 | // this trace assumes there are fewer obsolete methods than |
duke@435 | 2757 | // EMCP methods. |
duke@435 | 2758 | RC_TRACE(0x00000100, ("mark %s(%s) as obsolete", |
duke@435 | 2759 | old_method->name()->as_C_string(), |
duke@435 | 2760 | old_method->signature()->as_C_string())); |
duke@435 | 2761 | } |
duke@435 | 2762 | old_method->set_is_old(); |
duke@435 | 2763 | } |
duke@435 | 2764 | for (int i = 0; i < _deleted_methods_length; ++i) { |
coleenp@4037 | 2765 | Method* old_method = _deleted_methods[i]; |
duke@435 | 2766 | |
duke@435 | 2767 | assert(old_method->vtable_index() < 0, |
duke@435 | 2768 | "cannot delete methods with vtable entries");; |
duke@435 | 2769 | |
duke@435 | 2770 | // Mark all deleted methods as old and obsolete |
duke@435 | 2771 | old_method->set_is_old(); |
duke@435 | 2772 | old_method->set_is_obsolete(); |
duke@435 | 2773 | ++obsolete_count; |
duke@435 | 2774 | // With tracing we try not to "yack" too much. The position of |
duke@435 | 2775 | // this trace assumes there are fewer obsolete methods than |
duke@435 | 2776 | // EMCP methods. |
duke@435 | 2777 | RC_TRACE(0x00000100, ("mark deleted %s(%s) as obsolete", |
duke@435 | 2778 | old_method->name()->as_C_string(), |
duke@435 | 2779 | old_method->signature()->as_C_string())); |
duke@435 | 2780 | } |
duke@435 | 2781 | assert((*emcp_method_count_p + obsolete_count) == _old_methods->length(), |
duke@435 | 2782 | "sanity check"); |
duke@435 | 2783 | RC_TRACE(0x00000100, ("EMCP_cnt=%d, obsolete_cnt=%d", *emcp_method_count_p, |
duke@435 | 2784 | obsolete_count)); |
duke@435 | 2785 | } |
duke@435 | 2786 | |
duke@435 | 2787 | // This internal class transfers the native function registration from old methods |
duke@435 | 2788 | // to new methods. It is designed to handle both the simple case of unchanged |
duke@435 | 2789 | // native methods and the complex cases of native method prefixes being added and/or |
duke@435 | 2790 | // removed. |
duke@435 | 2791 | // It expects only to be used during the VM_RedefineClasses op (a safepoint). |
duke@435 | 2792 | // |
duke@435 | 2793 | // This class is used after the new methods have been installed in "the_class". |
duke@435 | 2794 | // |
duke@435 | 2795 | // So, for example, the following must be handled. Where 'm' is a method and |
duke@435 | 2796 | // a number followed by an underscore is a prefix. |
duke@435 | 2797 | // |
duke@435 | 2798 | // Old Name New Name |
duke@435 | 2799 | // Simple transfer to new method m -> m |
duke@435 | 2800 | // Add prefix m -> 1_m |
duke@435 | 2801 | // Remove prefix 1_m -> m |
duke@435 | 2802 | // Simultaneous add of prefixes m -> 3_2_1_m |
duke@435 | 2803 | // Simultaneous removal of prefixes 3_2_1_m -> m |
duke@435 | 2804 | // Simultaneous add and remove 1_m -> 2_m |
duke@435 | 2805 | // Same, caused by prefix removal only 3_2_1_m -> 3_2_m |
duke@435 | 2806 | // |
duke@435 | 2807 | class TransferNativeFunctionRegistration { |
duke@435 | 2808 | private: |
duke@435 | 2809 | instanceKlassHandle the_class; |
duke@435 | 2810 | int prefix_count; |
duke@435 | 2811 | char** prefixes; |
duke@435 | 2812 | |
duke@435 | 2813 | // Recursively search the binary tree of possibly prefixed method names. |
duke@435 | 2814 | // Iteration could be used if all agents were well behaved. Full tree walk is |
duke@435 | 2815 | // more resilent to agents not cleaning up intermediate methods. |
duke@435 | 2816 | // Branch at each depth in the binary tree is: |
duke@435 | 2817 | // (1) without the prefix. |
duke@435 | 2818 | // (2) with the prefix. |
duke@435 | 2819 | // where 'prefix' is the prefix at that 'depth' (first prefix, second prefix,...) |
coleenp@4037 | 2820 | Method* search_prefix_name_space(int depth, char* name_str, size_t name_len, |
coleenp@2497 | 2821 | Symbol* signature) { |
coleenp@2497 | 2822 | TempNewSymbol name_symbol = SymbolTable::probe(name_str, (int)name_len); |
duke@435 | 2823 | if (name_symbol != NULL) { |
hseigel@4278 | 2824 | Method* method = the_class()->lookup_method(name_symbol, signature); |
duke@435 | 2825 | if (method != NULL) { |
duke@435 | 2826 | // Even if prefixed, intermediate methods must exist. |
duke@435 | 2827 | if (method->is_native()) { |
duke@435 | 2828 | // Wahoo, we found a (possibly prefixed) version of the method, return it. |
duke@435 | 2829 | return method; |
duke@435 | 2830 | } |
duke@435 | 2831 | if (depth < prefix_count) { |
duke@435 | 2832 | // Try applying further prefixes (other than this one). |
duke@435 | 2833 | method = search_prefix_name_space(depth+1, name_str, name_len, signature); |
duke@435 | 2834 | if (method != NULL) { |
duke@435 | 2835 | return method; // found |
duke@435 | 2836 | } |
duke@435 | 2837 | |
duke@435 | 2838 | // Try adding this prefix to the method name and see if it matches |
duke@435 | 2839 | // another method name. |
duke@435 | 2840 | char* prefix = prefixes[depth]; |
duke@435 | 2841 | size_t prefix_len = strlen(prefix); |
duke@435 | 2842 | size_t trial_len = name_len + prefix_len; |
duke@435 | 2843 | char* trial_name_str = NEW_RESOURCE_ARRAY(char, trial_len + 1); |
duke@435 | 2844 | strcpy(trial_name_str, prefix); |
duke@435 | 2845 | strcat(trial_name_str, name_str); |
duke@435 | 2846 | method = search_prefix_name_space(depth+1, trial_name_str, trial_len, |
duke@435 | 2847 | signature); |
duke@435 | 2848 | if (method != NULL) { |
duke@435 | 2849 | // If found along this branch, it was prefixed, mark as such |
duke@435 | 2850 | method->set_is_prefixed_native(); |
duke@435 | 2851 | return method; // found |
duke@435 | 2852 | } |
duke@435 | 2853 | } |
duke@435 | 2854 | } |
duke@435 | 2855 | } |
duke@435 | 2856 | return NULL; // This whole branch bore nothing |
duke@435 | 2857 | } |
duke@435 | 2858 | |
duke@435 | 2859 | // Return the method name with old prefixes stripped away. |
coleenp@4037 | 2860 | char* method_name_without_prefixes(Method* method) { |
coleenp@2497 | 2861 | Symbol* name = method->name(); |
duke@435 | 2862 | char* name_str = name->as_utf8(); |
duke@435 | 2863 | |
duke@435 | 2864 | // Old prefixing may be defunct, strip prefixes, if any. |
duke@435 | 2865 | for (int i = prefix_count-1; i >= 0; i--) { |
duke@435 | 2866 | char* prefix = prefixes[i]; |
duke@435 | 2867 | size_t prefix_len = strlen(prefix); |
duke@435 | 2868 | if (strncmp(prefix, name_str, prefix_len) == 0) { |
duke@435 | 2869 | name_str += prefix_len; |
duke@435 | 2870 | } |
duke@435 | 2871 | } |
duke@435 | 2872 | return name_str; |
duke@435 | 2873 | } |
duke@435 | 2874 | |
duke@435 | 2875 | // Strip any prefixes off the old native method, then try to find a |
duke@435 | 2876 | // (possibly prefixed) new native that matches it. |
coleenp@4037 | 2877 | Method* strip_and_search_for_new_native(Method* method) { |
duke@435 | 2878 | ResourceMark rm; |
duke@435 | 2879 | char* name_str = method_name_without_prefixes(method); |
duke@435 | 2880 | return search_prefix_name_space(0, name_str, strlen(name_str), |
duke@435 | 2881 | method->signature()); |
duke@435 | 2882 | } |
duke@435 | 2883 | |
duke@435 | 2884 | public: |
duke@435 | 2885 | |
duke@435 | 2886 | // Construct a native method transfer processor for this class. |
duke@435 | 2887 | TransferNativeFunctionRegistration(instanceKlassHandle _the_class) { |
duke@435 | 2888 | assert(SafepointSynchronize::is_at_safepoint(), "sanity check"); |
duke@435 | 2889 | |
duke@435 | 2890 | the_class = _the_class; |
duke@435 | 2891 | prefixes = JvmtiExport::get_all_native_method_prefixes(&prefix_count); |
duke@435 | 2892 | } |
duke@435 | 2893 | |
duke@435 | 2894 | // Attempt to transfer any of the old or deleted methods that are native |
coleenp@4037 | 2895 | void transfer_registrations(Method** old_methods, int methods_length) { |
duke@435 | 2896 | for (int j = 0; j < methods_length; j++) { |
coleenp@4037 | 2897 | Method* old_method = old_methods[j]; |
duke@435 | 2898 | |
duke@435 | 2899 | if (old_method->is_native() && old_method->has_native_function()) { |
coleenp@4037 | 2900 | Method* new_method = strip_and_search_for_new_native(old_method); |
duke@435 | 2901 | if (new_method != NULL) { |
duke@435 | 2902 | // Actually set the native function in the new method. |
duke@435 | 2903 | // Redefine does not send events (except CFLH), certainly not this |
duke@435 | 2904 | // behind the scenes re-registration. |
duke@435 | 2905 | new_method->set_native_function(old_method->native_function(), |
coleenp@4037 | 2906 | !Method::native_bind_event_is_interesting); |
duke@435 | 2907 | } |
duke@435 | 2908 | } |
duke@435 | 2909 | } |
duke@435 | 2910 | } |
duke@435 | 2911 | }; |
duke@435 | 2912 | |
duke@435 | 2913 | // Don't lose the association between a native method and its JNI function. |
duke@435 | 2914 | void VM_RedefineClasses::transfer_old_native_function_registrations(instanceKlassHandle the_class) { |
duke@435 | 2915 | TransferNativeFunctionRegistration transfer(the_class); |
duke@435 | 2916 | transfer.transfer_registrations(_deleted_methods, _deleted_methods_length); |
duke@435 | 2917 | transfer.transfer_registrations(_matching_old_methods, _matching_methods_length); |
duke@435 | 2918 | } |
duke@435 | 2919 | |
duke@435 | 2920 | // Deoptimize all compiled code that depends on this class. |
duke@435 | 2921 | // |
duke@435 | 2922 | // If the can_redefine_classes capability is obtained in the onload |
duke@435 | 2923 | // phase then the compiler has recorded all dependencies from startup. |
duke@435 | 2924 | // In that case we need only deoptimize and throw away all compiled code |
duke@435 | 2925 | // that depends on the class. |
duke@435 | 2926 | // |
duke@435 | 2927 | // If can_redefine_classes is obtained sometime after the onload |
duke@435 | 2928 | // phase then the dependency information may be incomplete. In that case |
duke@435 | 2929 | // the first call to RedefineClasses causes all compiled code to be |
duke@435 | 2930 | // thrown away. As can_redefine_classes has been obtained then |
duke@435 | 2931 | // all future compilations will record dependencies so second and |
duke@435 | 2932 | // subsequent calls to RedefineClasses need only throw away code |
duke@435 | 2933 | // that depends on the class. |
duke@435 | 2934 | // |
duke@435 | 2935 | void VM_RedefineClasses::flush_dependent_code(instanceKlassHandle k_h, TRAPS) { |
duke@435 | 2936 | assert_locked_or_safepoint(Compile_lock); |
duke@435 | 2937 | |
duke@435 | 2938 | // All dependencies have been recorded from startup or this is a second or |
duke@435 | 2939 | // subsequent use of RedefineClasses |
duke@435 | 2940 | if (JvmtiExport::all_dependencies_are_recorded()) { |
duke@435 | 2941 | Universe::flush_evol_dependents_on(k_h); |
duke@435 | 2942 | } else { |
duke@435 | 2943 | CodeCache::mark_all_nmethods_for_deoptimization(); |
duke@435 | 2944 | |
duke@435 | 2945 | ResourceMark rm(THREAD); |
duke@435 | 2946 | DeoptimizationMarker dm; |
duke@435 | 2947 | |
duke@435 | 2948 | // Deoptimize all activations depending on marked nmethods |
duke@435 | 2949 | Deoptimization::deoptimize_dependents(); |
duke@435 | 2950 | |
duke@435 | 2951 | // Make the dependent methods not entrant (in VM_Deoptimize they are made zombies) |
duke@435 | 2952 | CodeCache::make_marked_nmethods_not_entrant(); |
duke@435 | 2953 | |
duke@435 | 2954 | // From now on we know that the dependency information is complete |
duke@435 | 2955 | JvmtiExport::set_all_dependencies_are_recorded(true); |
duke@435 | 2956 | } |
duke@435 | 2957 | } |
duke@435 | 2958 | |
duke@435 | 2959 | void VM_RedefineClasses::compute_added_deleted_matching_methods() { |
coleenp@4037 | 2960 | Method* old_method; |
coleenp@4037 | 2961 | Method* new_method; |
coleenp@4037 | 2962 | |
coleenp@4037 | 2963 | _matching_old_methods = NEW_RESOURCE_ARRAY(Method*, _old_methods->length()); |
coleenp@4037 | 2964 | _matching_new_methods = NEW_RESOURCE_ARRAY(Method*, _old_methods->length()); |
coleenp@4037 | 2965 | _added_methods = NEW_RESOURCE_ARRAY(Method*, _new_methods->length()); |
coleenp@4037 | 2966 | _deleted_methods = NEW_RESOURCE_ARRAY(Method*, _old_methods->length()); |
duke@435 | 2967 | |
duke@435 | 2968 | _matching_methods_length = 0; |
duke@435 | 2969 | _deleted_methods_length = 0; |
duke@435 | 2970 | _added_methods_length = 0; |
duke@435 | 2971 | |
duke@435 | 2972 | int nj = 0; |
duke@435 | 2973 | int oj = 0; |
duke@435 | 2974 | while (true) { |
duke@435 | 2975 | if (oj >= _old_methods->length()) { |
duke@435 | 2976 | if (nj >= _new_methods->length()) { |
duke@435 | 2977 | break; // we've looked at everything, done |
duke@435 | 2978 | } |
duke@435 | 2979 | // New method at the end |
coleenp@4037 | 2980 | new_method = _new_methods->at(nj); |
duke@435 | 2981 | _added_methods[_added_methods_length++] = new_method; |
duke@435 | 2982 | ++nj; |
duke@435 | 2983 | } else if (nj >= _new_methods->length()) { |
duke@435 | 2984 | // Old method, at the end, is deleted |
coleenp@4037 | 2985 | old_method = _old_methods->at(oj); |
duke@435 | 2986 | _deleted_methods[_deleted_methods_length++] = old_method; |
duke@435 | 2987 | ++oj; |
duke@435 | 2988 | } else { |
coleenp@4037 | 2989 | old_method = _old_methods->at(oj); |
coleenp@4037 | 2990 | new_method = _new_methods->at(nj); |
duke@435 | 2991 | if (old_method->name() == new_method->name()) { |
duke@435 | 2992 | if (old_method->signature() == new_method->signature()) { |
duke@435 | 2993 | _matching_old_methods[_matching_methods_length ] = old_method; |
duke@435 | 2994 | _matching_new_methods[_matching_methods_length++] = new_method; |
duke@435 | 2995 | ++nj; |
duke@435 | 2996 | ++oj; |
duke@435 | 2997 | } else { |
duke@435 | 2998 | // added overloaded have already been moved to the end, |
duke@435 | 2999 | // so this is a deleted overloaded method |
duke@435 | 3000 | _deleted_methods[_deleted_methods_length++] = old_method; |
duke@435 | 3001 | ++oj; |
duke@435 | 3002 | } |
duke@435 | 3003 | } else { // names don't match |
duke@435 | 3004 | if (old_method->name()->fast_compare(new_method->name()) > 0) { |
duke@435 | 3005 | // new method |
duke@435 | 3006 | _added_methods[_added_methods_length++] = new_method; |
duke@435 | 3007 | ++nj; |
duke@435 | 3008 | } else { |
duke@435 | 3009 | // deleted method |
duke@435 | 3010 | _deleted_methods[_deleted_methods_length++] = old_method; |
duke@435 | 3011 | ++oj; |
duke@435 | 3012 | } |
duke@435 | 3013 | } |
duke@435 | 3014 | } |
duke@435 | 3015 | } |
duke@435 | 3016 | assert(_matching_methods_length + _deleted_methods_length == _old_methods->length(), "sanity"); |
duke@435 | 3017 | assert(_matching_methods_length + _added_methods_length == _new_methods->length(), "sanity"); |
duke@435 | 3018 | } |
duke@435 | 3019 | |
duke@435 | 3020 | |
coleenp@4572 | 3021 | void VM_RedefineClasses::swap_annotations(instanceKlassHandle the_class, |
coleenp@4572 | 3022 | instanceKlassHandle scratch_class) { |
coleenp@4572 | 3023 | // Since there is currently no rewriting of type annotations indexes |
coleenp@4572 | 3024 | // into the CP, we null out type annotations on scratch_class before |
coleenp@4572 | 3025 | // we swap annotations with the_class rather than facing the |
coleenp@4572 | 3026 | // possibility of shipping annotations with broken indexes to |
coleenp@4572 | 3027 | // Java-land. |
coleenp@4572 | 3028 | ClassLoaderData* loader_data = scratch_class->class_loader_data(); |
coleenp@4572 | 3029 | AnnotationArray* new_class_type_annotations = scratch_class->class_type_annotations(); |
coleenp@4572 | 3030 | if (new_class_type_annotations != NULL) { |
coleenp@4572 | 3031 | MetadataFactory::free_array<u1>(loader_data, new_class_type_annotations); |
coleenp@4572 | 3032 | scratch_class->annotations()->set_class_type_annotations(NULL); |
coleenp@4572 | 3033 | } |
coleenp@4572 | 3034 | Array<AnnotationArray*>* new_field_type_annotations = scratch_class->fields_type_annotations(); |
coleenp@4572 | 3035 | if (new_field_type_annotations != NULL) { |
coleenp@4572 | 3036 | Annotations::free_contents(loader_data, new_field_type_annotations); |
coleenp@4572 | 3037 | scratch_class->annotations()->set_fields_type_annotations(NULL); |
coleenp@4572 | 3038 | } |
coleenp@4572 | 3039 | |
coleenp@4572 | 3040 | // Swap annotation fields values |
coleenp@4572 | 3041 | Annotations* old_annotations = the_class->annotations(); |
coleenp@4572 | 3042 | the_class->set_annotations(scratch_class->annotations()); |
coleenp@4572 | 3043 | scratch_class->set_annotations(old_annotations); |
coleenp@4572 | 3044 | } |
coleenp@4572 | 3045 | |
duke@435 | 3046 | |
duke@435 | 3047 | // Install the redefinition of a class: |
duke@435 | 3048 | // - house keeping (flushing breakpoints and caches, deoptimizing |
duke@435 | 3049 | // dependent compiled code) |
duke@435 | 3050 | // - replacing parts in the_class with parts from scratch_class |
duke@435 | 3051 | // - adding a weak reference to track the obsolete but interesting |
duke@435 | 3052 | // parts of the_class |
duke@435 | 3053 | // - adjusting constant pool caches and vtables in other classes |
duke@435 | 3054 | // that refer to methods in the_class. These adjustments use the |
duke@435 | 3055 | // SystemDictionary::classes_do() facility which only allows |
duke@435 | 3056 | // a helper method to be specified. The interesting parameters |
duke@435 | 3057 | // that we would like to pass to the helper method are saved in |
duke@435 | 3058 | // static global fields in the VM operation. |
duke@435 | 3059 | void VM_RedefineClasses::redefine_single_class(jclass the_jclass, |
coleenp@4037 | 3060 | Klass* scratch_class_oop, TRAPS) { |
coleenp@4037 | 3061 | |
coleenp@4037 | 3062 | HandleMark hm(THREAD); // make sure handles from this call are freed |
duke@435 | 3063 | RC_TIMER_START(_timer_rsc_phase1); |
duke@435 | 3064 | |
coleenp@4037 | 3065 | instanceKlassHandle scratch_class(scratch_class_oop); |
coleenp@4037 | 3066 | |
duke@435 | 3067 | oop the_class_mirror = JNIHandles::resolve_non_null(the_jclass); |
coleenp@4037 | 3068 | Klass* the_class_oop = java_lang_Class::as_Klass(the_class_mirror); |
duke@435 | 3069 | instanceKlassHandle the_class = instanceKlassHandle(THREAD, the_class_oop); |
duke@435 | 3070 | |
duke@435 | 3071 | // Remove all breakpoints in methods of this class |
duke@435 | 3072 | JvmtiBreakpoints& jvmti_breakpoints = JvmtiCurrentBreakpoints::get_jvmti_breakpoints(); |
duke@435 | 3073 | jvmti_breakpoints.clearall_in_class_at_safepoint(the_class_oop); |
duke@435 | 3074 | |
duke@435 | 3075 | if (the_class_oop == Universe::reflect_invoke_cache()->klass()) { |
duke@435 | 3076 | // We are redefining java.lang.reflect.Method. Method.invoke() is |
duke@435 | 3077 | // cached and users of the cache care about each active version of |
duke@435 | 3078 | // the method so we have to track this previous version. |
duke@435 | 3079 | // Do this before methods get switched |
duke@435 | 3080 | Universe::reflect_invoke_cache()->add_previous_version( |
duke@435 | 3081 | the_class->method_with_idnum(Universe::reflect_invoke_cache()->method_idnum())); |
duke@435 | 3082 | } |
duke@435 | 3083 | |
duke@435 | 3084 | // Deoptimize all compiled code that depends on this class |
duke@435 | 3085 | flush_dependent_code(the_class, THREAD); |
duke@435 | 3086 | |
duke@435 | 3087 | _old_methods = the_class->methods(); |
duke@435 | 3088 | _new_methods = scratch_class->methods(); |
duke@435 | 3089 | _the_class_oop = the_class_oop; |
duke@435 | 3090 | compute_added_deleted_matching_methods(); |
duke@435 | 3091 | update_jmethod_ids(); |
duke@435 | 3092 | |
duke@435 | 3093 | // Attach new constant pool to the original klass. The original |
duke@435 | 3094 | // klass still refers to the old constant pool (for now). |
duke@435 | 3095 | scratch_class->constants()->set_pool_holder(the_class()); |
duke@435 | 3096 | |
duke@435 | 3097 | #if 0 |
duke@435 | 3098 | // In theory, with constant pool merging in place we should be able |
duke@435 | 3099 | // to save space by using the new, merged constant pool in place of |
duke@435 | 3100 | // the old constant pool(s). By "pool(s)" I mean the constant pool in |
duke@435 | 3101 | // the klass version we are replacing now and any constant pool(s) in |
duke@435 | 3102 | // previous versions of klass. Nice theory, doesn't work in practice. |
duke@435 | 3103 | // When this code is enabled, even simple programs throw NullPointer |
duke@435 | 3104 | // exceptions. I'm guessing that this is caused by some constant pool |
duke@435 | 3105 | // cache difference between the new, merged constant pool and the |
duke@435 | 3106 | // constant pool that was just being used by the klass. I'm keeping |
duke@435 | 3107 | // this code around to archive the idea, but the code has to remain |
duke@435 | 3108 | // disabled for now. |
duke@435 | 3109 | |
duke@435 | 3110 | // Attach each old method to the new constant pool. This can be |
duke@435 | 3111 | // done here since we are past the bytecode verification and |
duke@435 | 3112 | // constant pool optimization phases. |
duke@435 | 3113 | for (int i = _old_methods->length() - 1; i >= 0; i--) { |
coleenp@4037 | 3114 | Method* method = _old_methods->at(i); |
duke@435 | 3115 | method->set_constants(scratch_class->constants()); |
duke@435 | 3116 | } |
duke@435 | 3117 | |
duke@435 | 3118 | { |
duke@435 | 3119 | // walk all previous versions of the klass |
coleenp@4037 | 3120 | InstanceKlass *ik = (InstanceKlass *)the_class(); |
duke@435 | 3121 | PreviousVersionWalker pvw(ik); |
duke@435 | 3122 | instanceKlassHandle ikh; |
duke@435 | 3123 | do { |
duke@435 | 3124 | ikh = pvw.next_previous_version(); |
duke@435 | 3125 | if (!ikh.is_null()) { |
duke@435 | 3126 | ik = ikh(); |
duke@435 | 3127 | |
duke@435 | 3128 | // attach previous version of klass to the new constant pool |
duke@435 | 3129 | ik->set_constants(scratch_class->constants()); |
duke@435 | 3130 | |
duke@435 | 3131 | // Attach each method in the previous version of klass to the |
duke@435 | 3132 | // new constant pool |
coleenp@4037 | 3133 | Array<Method*>* prev_methods = ik->methods(); |
duke@435 | 3134 | for (int i = prev_methods->length() - 1; i >= 0; i--) { |
coleenp@4037 | 3135 | Method* method = prev_methods->at(i); |
duke@435 | 3136 | method->set_constants(scratch_class->constants()); |
duke@435 | 3137 | } |
duke@435 | 3138 | } |
duke@435 | 3139 | } while (!ikh.is_null()); |
duke@435 | 3140 | } |
duke@435 | 3141 | #endif |
duke@435 | 3142 | |
duke@435 | 3143 | // Replace methods and constantpool |
duke@435 | 3144 | the_class->set_methods(_new_methods); |
duke@435 | 3145 | scratch_class->set_methods(_old_methods); // To prevent potential GCing of the old methods, |
duke@435 | 3146 | // and to be able to undo operation easily. |
duke@435 | 3147 | |
coleenp@4037 | 3148 | ConstantPool* old_constants = the_class->constants(); |
duke@435 | 3149 | the_class->set_constants(scratch_class->constants()); |
duke@435 | 3150 | scratch_class->set_constants(old_constants); // See the previous comment. |
duke@435 | 3151 | #if 0 |
duke@435 | 3152 | // We are swapping the guts of "the new class" with the guts of "the |
duke@435 | 3153 | // class". Since the old constant pool has just been attached to "the |
duke@435 | 3154 | // new class", it seems logical to set the pool holder in the old |
duke@435 | 3155 | // constant pool also. However, doing this will change the observable |
duke@435 | 3156 | // class hierarchy for any old methods that are still executing. A |
duke@435 | 3157 | // method can query the identity of its "holder" and this query uses |
duke@435 | 3158 | // the method's constant pool link to find the holder. The change in |
duke@435 | 3159 | // holding class from "the class" to "the new class" can confuse |
duke@435 | 3160 | // things. |
duke@435 | 3161 | // |
duke@435 | 3162 | // Setting the old constant pool's holder will also cause |
duke@435 | 3163 | // verification done during vtable initialization below to fail. |
duke@435 | 3164 | // During vtable initialization, the vtable's class is verified to be |
duke@435 | 3165 | // a subtype of the method's holder. The vtable's class is "the |
duke@435 | 3166 | // class" and the method's holder is gotten from the constant pool |
duke@435 | 3167 | // link in the method itself. For "the class"'s directly implemented |
duke@435 | 3168 | // methods, the method holder is "the class" itself (as gotten from |
duke@435 | 3169 | // the new constant pool). The check works fine in this case. The |
duke@435 | 3170 | // check also works fine for methods inherited from super classes. |
duke@435 | 3171 | // |
duke@435 | 3172 | // Miranda methods are a little more complicated. A miranda method is |
duke@435 | 3173 | // provided by an interface when the class implementing the interface |
duke@435 | 3174 | // does not provide its own method. These interfaces are implemented |
coleenp@4037 | 3175 | // internally as an InstanceKlass. These special instanceKlasses |
duke@435 | 3176 | // share the constant pool of the class that "implements" the |
duke@435 | 3177 | // interface. By sharing the constant pool, the method holder of a |
duke@435 | 3178 | // miranda method is the class that "implements" the interface. In a |
duke@435 | 3179 | // non-redefine situation, the subtype check works fine. However, if |
duke@435 | 3180 | // the old constant pool's pool holder is modified, then the check |
duke@435 | 3181 | // fails because there is no class hierarchy relationship between the |
duke@435 | 3182 | // vtable's class and "the new class". |
duke@435 | 3183 | |
duke@435 | 3184 | old_constants->set_pool_holder(scratch_class()); |
duke@435 | 3185 | #endif |
duke@435 | 3186 | |
duke@435 | 3187 | // track which methods are EMCP for add_previous_version() call below |
duke@435 | 3188 | BitMap emcp_methods(_old_methods->length()); |
duke@435 | 3189 | int emcp_method_count = 0; |
duke@435 | 3190 | emcp_methods.clear(); // clears 0..(length() - 1) |
duke@435 | 3191 | check_methods_and_mark_as_obsolete(&emcp_methods, &emcp_method_count); |
duke@435 | 3192 | transfer_old_native_function_registrations(the_class); |
duke@435 | 3193 | |
duke@435 | 3194 | // The class file bytes from before any retransformable agents mucked |
duke@435 | 3195 | // with them was cached on the scratch class, move to the_class. |
duke@435 | 3196 | // Note: we still want to do this if nothing needed caching since it |
duke@435 | 3197 | // should get cleared in the_class too. |
dcubed@3360 | 3198 | if (the_class->get_cached_class_file_bytes() == 0) { |
dcubed@3360 | 3199 | // the_class doesn't have a cache yet so copy it |
dcubed@3360 | 3200 | the_class->set_cached_class_file( |
dcubed@3360 | 3201 | scratch_class->get_cached_class_file_bytes(), |
dcubed@3360 | 3202 | scratch_class->get_cached_class_file_len()); |
dcubed@3360 | 3203 | } |
dcubed@3360 | 3204 | #ifndef PRODUCT |
dcubed@3360 | 3205 | else { |
dcubed@3360 | 3206 | assert(the_class->get_cached_class_file_bytes() == |
dcubed@3360 | 3207 | scratch_class->get_cached_class_file_bytes(), "cache ptrs must match"); |
dcubed@3360 | 3208 | assert(the_class->get_cached_class_file_len() == |
dcubed@3360 | 3209 | scratch_class->get_cached_class_file_len(), "cache lens must match"); |
dcubed@3360 | 3210 | } |
dcubed@3360 | 3211 | #endif |
duke@435 | 3212 | |
duke@435 | 3213 | // Replace inner_classes |
coleenp@4037 | 3214 | Array<u2>* old_inner_classes = the_class->inner_classes(); |
duke@435 | 3215 | the_class->set_inner_classes(scratch_class->inner_classes()); |
duke@435 | 3216 | scratch_class->set_inner_classes(old_inner_classes); |
duke@435 | 3217 | |
duke@435 | 3218 | // Initialize the vtable and interface table after |
duke@435 | 3219 | // methods have been rewritten |
duke@435 | 3220 | { |
duke@435 | 3221 | ResourceMark rm(THREAD); |
duke@435 | 3222 | // no exception should happen here since we explicitly |
duke@435 | 3223 | // do not check loader constraints. |
duke@435 | 3224 | // compare_and_normalize_class_versions has already checked: |
duke@435 | 3225 | // - classloaders unchanged, signatures unchanged |
duke@435 | 3226 | // - all instanceKlasses for redefined classes reused & contents updated |
duke@435 | 3227 | the_class->vtable()->initialize_vtable(false, THREAD); |
duke@435 | 3228 | the_class->itable()->initialize_itable(false, THREAD); |
never@1577 | 3229 | assert(!HAS_PENDING_EXCEPTION || (THREAD->pending_exception()->is_a(SystemDictionary::ThreadDeath_klass())), "redefine exception"); |
duke@435 | 3230 | } |
duke@435 | 3231 | |
duke@435 | 3232 | // Leave arrays of jmethodIDs and itable index cache unchanged |
duke@435 | 3233 | |
duke@435 | 3234 | // Copy the "source file name" attribute from new class version |
duke@435 | 3235 | the_class->set_source_file_name(scratch_class->source_file_name()); |
duke@435 | 3236 | |
duke@435 | 3237 | // Copy the "source debug extension" attribute from new class version |
duke@435 | 3238 | the_class->set_source_debug_extension( |
fparain@3906 | 3239 | scratch_class->source_debug_extension(), |
fparain@3906 | 3240 | scratch_class->source_debug_extension() == NULL ? 0 : |
fparain@3906 | 3241 | (int)strlen(scratch_class->source_debug_extension())); |
duke@435 | 3242 | |
duke@435 | 3243 | // Use of javac -g could be different in the old and the new |
duke@435 | 3244 | if (scratch_class->access_flags().has_localvariable_table() != |
duke@435 | 3245 | the_class->access_flags().has_localvariable_table()) { |
duke@435 | 3246 | |
duke@435 | 3247 | AccessFlags flags = the_class->access_flags(); |
duke@435 | 3248 | if (scratch_class->access_flags().has_localvariable_table()) { |
duke@435 | 3249 | flags.set_has_localvariable_table(); |
duke@435 | 3250 | } else { |
duke@435 | 3251 | flags.clear_has_localvariable_table(); |
duke@435 | 3252 | } |
duke@435 | 3253 | the_class->set_access_flags(flags); |
duke@435 | 3254 | } |
duke@435 | 3255 | |
coleenp@4572 | 3256 | swap_annotations(the_class, scratch_class); |
duke@435 | 3257 | |
duke@435 | 3258 | // Replace minor version number of class file |
duke@435 | 3259 | u2 old_minor_version = the_class->minor_version(); |
duke@435 | 3260 | the_class->set_minor_version(scratch_class->minor_version()); |
duke@435 | 3261 | scratch_class->set_minor_version(old_minor_version); |
duke@435 | 3262 | |
duke@435 | 3263 | // Replace major version number of class file |
duke@435 | 3264 | u2 old_major_version = the_class->major_version(); |
duke@435 | 3265 | the_class->set_major_version(scratch_class->major_version()); |
duke@435 | 3266 | scratch_class->set_major_version(old_major_version); |
duke@435 | 3267 | |
duke@435 | 3268 | // Replace CP indexes for class and name+type of enclosing method |
duke@435 | 3269 | u2 old_class_idx = the_class->enclosing_method_class_index(); |
duke@435 | 3270 | u2 old_method_idx = the_class->enclosing_method_method_index(); |
duke@435 | 3271 | the_class->set_enclosing_method_indices( |
duke@435 | 3272 | scratch_class->enclosing_method_class_index(), |
duke@435 | 3273 | scratch_class->enclosing_method_method_index()); |
duke@435 | 3274 | scratch_class->set_enclosing_method_indices(old_class_idx, old_method_idx); |
duke@435 | 3275 | |
duke@435 | 3276 | // keep track of previous versions of this class |
duke@435 | 3277 | the_class->add_previous_version(scratch_class, &emcp_methods, |
duke@435 | 3278 | emcp_method_count); |
duke@435 | 3279 | |
duke@435 | 3280 | RC_TIMER_STOP(_timer_rsc_phase1); |
duke@435 | 3281 | RC_TIMER_START(_timer_rsc_phase2); |
duke@435 | 3282 | |
duke@435 | 3283 | // Adjust constantpool caches and vtables for all classes |
duke@435 | 3284 | // that reference methods of the evolved class. |
duke@435 | 3285 | SystemDictionary::classes_do(adjust_cpool_cache_and_vtable, THREAD); |
duke@435 | 3286 | |
coleenp@4037 | 3287 | // Fix Resolution Error table also to remove old constant pools |
coleenp@4037 | 3288 | SystemDictionary::delete_resolution_error(old_constants); |
coleenp@4037 | 3289 | |
duke@435 | 3290 | if (the_class->oop_map_cache() != NULL) { |
duke@435 | 3291 | // Flush references to any obsolete methods from the oop map cache |
duke@435 | 3292 | // so that obsolete methods are not pinned. |
duke@435 | 3293 | the_class->oop_map_cache()->flush_obsolete_entries(); |
duke@435 | 3294 | } |
duke@435 | 3295 | |
duke@435 | 3296 | // increment the classRedefinedCount field in the_class and in any |
duke@435 | 3297 | // direct and indirect subclasses of the_class |
coleenp@4037 | 3298 | increment_class_counter((InstanceKlass *)the_class(), THREAD); |
duke@435 | 3299 | |
duke@435 | 3300 | // RC_TRACE macro has an embedded ResourceMark |
duke@435 | 3301 | RC_TRACE_WITH_THREAD(0x00000001, THREAD, |
duke@435 | 3302 | ("redefined name=%s, count=%d (avail_mem=" UINT64_FORMAT "K)", |
duke@435 | 3303 | the_class->external_name(), |
duke@435 | 3304 | java_lang_Class::classRedefinedCount(the_class_mirror), |
duke@435 | 3305 | os::available_memory() >> 10)); |
duke@435 | 3306 | |
duke@435 | 3307 | RC_TIMER_STOP(_timer_rsc_phase2); |
duke@435 | 3308 | } // end redefine_single_class() |
duke@435 | 3309 | |
duke@435 | 3310 | |
coleenp@4037 | 3311 | // Increment the classRedefinedCount field in the specific InstanceKlass |
duke@435 | 3312 | // and in all direct and indirect subclasses. |
coleenp@4037 | 3313 | void VM_RedefineClasses::increment_class_counter(InstanceKlass *ik, TRAPS) { |
duke@435 | 3314 | oop class_mirror = ik->java_mirror(); |
coleenp@4037 | 3315 | Klass* class_oop = java_lang_Class::as_Klass(class_mirror); |
duke@435 | 3316 | int new_count = java_lang_Class::classRedefinedCount(class_mirror) + 1; |
duke@435 | 3317 | java_lang_Class::set_classRedefinedCount(class_mirror, new_count); |
duke@435 | 3318 | |
duke@435 | 3319 | if (class_oop != _the_class_oop) { |
duke@435 | 3320 | // _the_class_oop count is printed at end of redefine_single_class() |
duke@435 | 3321 | RC_TRACE_WITH_THREAD(0x00000008, THREAD, |
duke@435 | 3322 | ("updated count in subclass=%s to %d", ik->external_name(), new_count)); |
duke@435 | 3323 | } |
duke@435 | 3324 | |
duke@435 | 3325 | for (Klass *subk = ik->subklass(); subk != NULL; |
duke@435 | 3326 | subk = subk->next_sibling()) { |
never@2659 | 3327 | if (subk->oop_is_instance()) { |
never@2659 | 3328 | // Only update instanceKlasses |
coleenp@4037 | 3329 | InstanceKlass *subik = (InstanceKlass*)subk; |
never@2659 | 3330 | // recursively do subclasses of the current subclass |
never@2659 | 3331 | increment_class_counter(subik, THREAD); |
never@2659 | 3332 | } |
duke@435 | 3333 | } |
duke@435 | 3334 | } |
duke@435 | 3335 | |
coleenp@4037 | 3336 | void VM_RedefineClasses::check_class(Klass* k_oop, |
coleenp@4037 | 3337 | ClassLoaderData* initiating_loader, |
coleenp@4037 | 3338 | TRAPS) { |
coleenp@4037 | 3339 | Klass *k = k_oop; |
duke@435 | 3340 | if (k->oop_is_instance()) { |
duke@435 | 3341 | HandleMark hm(THREAD); |
coleenp@4037 | 3342 | InstanceKlass *ik = (InstanceKlass *) k; |
dcubed@4562 | 3343 | bool no_old_methods = true; // be optimistic |
dcubed@4562 | 3344 | ResourceMark rm(THREAD); |
dcubed@4562 | 3345 | |
dcubed@4562 | 3346 | // a vtable should never contain old or obsolete methods |
dcubed@4562 | 3347 | if (ik->vtable_length() > 0 && |
dcubed@4562 | 3348 | !ik->vtable()->check_no_old_or_obsolete_entries()) { |
dcubed@4562 | 3349 | if (RC_TRACE_ENABLED(0x00004000)) { |
dcubed@4562 | 3350 | RC_TRACE_WITH_THREAD(0x00004000, THREAD, |
dcubed@4562 | 3351 | ("klassVtable::check_no_old_or_obsolete_entries failure" |
dcubed@4562 | 3352 | " -- OLD or OBSOLETE method found -- class: %s", |
dcubed@4562 | 3353 | ik->signature_name())); |
duke@435 | 3354 | ik->vtable()->dump_vtable(); |
duke@435 | 3355 | } |
dcubed@4562 | 3356 | no_old_methods = false; |
duke@435 | 3357 | } |
dcubed@4562 | 3358 | |
dcubed@4562 | 3359 | // an itable should never contain old or obsolete methods |
dcubed@4562 | 3360 | if (ik->itable_length() > 0 && |
dcubed@4562 | 3361 | !ik->itable()->check_no_old_or_obsolete_entries()) { |
dcubed@4562 | 3362 | if (RC_TRACE_ENABLED(0x00004000)) { |
dcubed@4562 | 3363 | RC_TRACE_WITH_THREAD(0x00004000, THREAD, |
dcubed@4562 | 3364 | ("klassItable::check_no_old_or_obsolete_entries failure" |
dcubed@4562 | 3365 | " -- OLD or OBSOLETE method found -- class: %s", |
dcubed@4562 | 3366 | ik->signature_name())); |
dcubed@4562 | 3367 | ik->itable()->dump_itable(); |
coleenp@4037 | 3368 | } |
dcubed@4562 | 3369 | no_old_methods = false; |
coleenp@4037 | 3370 | } |
dcubed@4562 | 3371 | |
dcubed@4562 | 3372 | // the constant pool cache should never contain old or obsolete methods |
coleenp@4037 | 3373 | if (ik->constants() != NULL && |
coleenp@4037 | 3374 | ik->constants()->cache() != NULL && |
dcubed@4562 | 3375 | !ik->constants()->cache()->check_no_old_or_obsolete_entries()) { |
dcubed@4562 | 3376 | if (RC_TRACE_ENABLED(0x00004000)) { |
dcubed@4562 | 3377 | RC_TRACE_WITH_THREAD(0x00004000, THREAD, |
dcubed@4562 | 3378 | ("cp-cache::check_no_old_or_obsolete_entries failure" |
dcubed@4562 | 3379 | " -- OLD or OBSOLETE method found -- class: %s", |
dcubed@4562 | 3380 | ik->signature_name())); |
dcubed@4562 | 3381 | ik->constants()->cache()->dump_cache(); |
dcubed@4562 | 3382 | } |
dcubed@4562 | 3383 | no_old_methods = false; |
dcubed@4562 | 3384 | } |
dcubed@4562 | 3385 | |
dcubed@4562 | 3386 | if (!no_old_methods) { |
dcubed@4562 | 3387 | if (RC_TRACE_ENABLED(0x00004000)) { |
dcubed@4562 | 3388 | dump_methods(); |
dcubed@4562 | 3389 | } else { |
dcubed@4562 | 3390 | tty->print_cr("INFO: use the '-XX:TraceRedefineClasses=16384' option " |
dcubed@4562 | 3391 | "to see more info about the following guarantee() failure."); |
dcubed@4562 | 3392 | } |
dcubed@4562 | 3393 | guarantee(false, "OLD and/or OBSOLETE method(s) found"); |
coleenp@4037 | 3394 | } |
duke@435 | 3395 | } |
duke@435 | 3396 | } |
duke@435 | 3397 | |
duke@435 | 3398 | void VM_RedefineClasses::dump_methods() { |
dcubed@4562 | 3399 | int j; |
dcubed@4562 | 3400 | RC_TRACE(0x00004000, ("_old_methods --")); |
dcubed@4562 | 3401 | for (j = 0; j < _old_methods->length(); ++j) { |
dcubed@4562 | 3402 | Method* m = _old_methods->at(j); |
dcubed@4562 | 3403 | RC_TRACE_NO_CR(0x00004000, ("%4d (%5d) ", j, m->vtable_index())); |
dcubed@4562 | 3404 | m->access_flags().print_on(tty); |
dcubed@4562 | 3405 | tty->print(" -- "); |
dcubed@4562 | 3406 | m->print_name(tty); |
dcubed@4562 | 3407 | tty->cr(); |
dcubed@4562 | 3408 | } |
dcubed@4562 | 3409 | RC_TRACE(0x00004000, ("_new_methods --")); |
dcubed@4562 | 3410 | for (j = 0; j < _new_methods->length(); ++j) { |
dcubed@4562 | 3411 | Method* m = _new_methods->at(j); |
dcubed@4562 | 3412 | RC_TRACE_NO_CR(0x00004000, ("%4d (%5d) ", j, m->vtable_index())); |
dcubed@4562 | 3413 | m->access_flags().print_on(tty); |
dcubed@4562 | 3414 | tty->print(" -- "); |
dcubed@4562 | 3415 | m->print_name(tty); |
dcubed@4562 | 3416 | tty->cr(); |
dcubed@4562 | 3417 | } |
dcubed@4562 | 3418 | RC_TRACE(0x00004000, ("_matching_(old/new)_methods --")); |
dcubed@4562 | 3419 | for (j = 0; j < _matching_methods_length; ++j) { |
dcubed@4562 | 3420 | Method* m = _matching_old_methods[j]; |
dcubed@4562 | 3421 | RC_TRACE_NO_CR(0x00004000, ("%4d (%5d) ", j, m->vtable_index())); |
dcubed@4562 | 3422 | m->access_flags().print_on(tty); |
dcubed@4562 | 3423 | tty->print(" -- "); |
dcubed@4562 | 3424 | m->print_name(tty); |
dcubed@4562 | 3425 | tty->cr(); |
dcubed@4562 | 3426 | m = _matching_new_methods[j]; |
dcubed@4562 | 3427 | RC_TRACE_NO_CR(0x00004000, (" (%5d) ", m->vtable_index())); |
dcubed@4562 | 3428 | m->access_flags().print_on(tty); |
dcubed@4562 | 3429 | tty->cr(); |
dcubed@4562 | 3430 | } |
dcubed@4562 | 3431 | RC_TRACE(0x00004000, ("_deleted_methods --")); |
dcubed@4562 | 3432 | for (j = 0; j < _deleted_methods_length; ++j) { |
dcubed@4562 | 3433 | Method* m = _deleted_methods[j]; |
dcubed@4562 | 3434 | RC_TRACE_NO_CR(0x00004000, ("%4d (%5d) ", j, m->vtable_index())); |
dcubed@4562 | 3435 | m->access_flags().print_on(tty); |
dcubed@4562 | 3436 | tty->print(" -- "); |
dcubed@4562 | 3437 | m->print_name(tty); |
dcubed@4562 | 3438 | tty->cr(); |
dcubed@4562 | 3439 | } |
dcubed@4562 | 3440 | RC_TRACE(0x00004000, ("_added_methods --")); |
dcubed@4562 | 3441 | for (j = 0; j < _added_methods_length; ++j) { |
dcubed@4562 | 3442 | Method* m = _added_methods[j]; |
dcubed@4562 | 3443 | RC_TRACE_NO_CR(0x00004000, ("%4d (%5d) ", j, m->vtable_index())); |
dcubed@4562 | 3444 | m->access_flags().print_on(tty); |
dcubed@4562 | 3445 | tty->print(" -- "); |
dcubed@4562 | 3446 | m->print_name(tty); |
dcubed@4562 | 3447 | tty->cr(); |
dcubed@4562 | 3448 | } |
duke@435 | 3449 | } |