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