src/share/vm/prims/jvmtiRedefineClasses.hpp

Wed, 08 Oct 2008 08:10:51 -0700

author
ksrini
date
Wed, 08 Oct 2008 08:10:51 -0700
changeset 823
f008d3631bd1
parent 435
a61af66fc99e
child 1907
c18cbe5936b8
permissions
-rw-r--r--

6755845: JVM_FindClassFromBoot triggers assertions
Summary: Fixes assertions caused by one jvm_entry calling another, solved by refactoring code and modified gamma test.
Reviewed-by: dholmes, xlu

duke@435 1 /*
duke@435 2 * Copyright 2003-2006 Sun Microsystems, Inc. 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 *
duke@435 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435 21 * have any questions.
duke@435 22 *
duke@435 23 */
duke@435 24
duke@435 25 // Introduction:
duke@435 26 //
duke@435 27 // The RedefineClasses() API is used to change the definition of one or
duke@435 28 // more classes. While the API supports redefining more than one class
duke@435 29 // in a single call, in general, the API is discussed in the context of
duke@435 30 // changing the definition of a single current class to a single new
duke@435 31 // class. For clarity, the current class is will always be called
duke@435 32 // "the_class" and the new class will always be called "scratch_class".
duke@435 33 //
duke@435 34 // The name "the_class" is used because there is only one structure
duke@435 35 // that represents a specific class; redefinition does not replace the
duke@435 36 // structure, but instead replaces parts of the structure. The name
duke@435 37 // "scratch_class" is used because the structure that represents the
duke@435 38 // new definition of a specific class is simply used to carry around
duke@435 39 // the parts of the new definition until they are used to replace the
duke@435 40 // appropriate parts in the_class. Once redefinition of a class is
duke@435 41 // complete, scratch_class is thrown away.
duke@435 42 //
duke@435 43 //
duke@435 44 // Implementation Overview:
duke@435 45 //
duke@435 46 // The RedefineClasses() API is mostly a wrapper around the VM op that
duke@435 47 // does the real work. The work is split in varying degrees between
duke@435 48 // doit_prologue(), doit() and doit_epilogue().
duke@435 49 //
duke@435 50 // 1) doit_prologue() is called by the JavaThread on the way to a
duke@435 51 // safepoint. It does parameter verification and loads scratch_class
duke@435 52 // which involves:
duke@435 53 // - parsing the incoming class definition using the_class' class
duke@435 54 // loader and security context
duke@435 55 // - linking scratch_class
duke@435 56 // - merging constant pools and rewriting bytecodes as needed
duke@435 57 // for the merged constant pool
duke@435 58 // - verifying the bytecodes in scratch_class
duke@435 59 // - setting up the constant pool cache and rewriting bytecodes
duke@435 60 // as needed to use the cache
duke@435 61 // - finally, scratch_class is compared to the_class to verify
duke@435 62 // that it is a valid replacement class
duke@435 63 // - if everything is good, then scratch_class is saved in an
duke@435 64 // instance field in the VM operation for the doit() call
duke@435 65 //
duke@435 66 // Note: A JavaThread must do the above work.
duke@435 67 //
duke@435 68 // 2) doit() is called by the VMThread during a safepoint. It installs
duke@435 69 // the new class definition(s) which involves:
duke@435 70 // - retrieving the scratch_class from the instance field in the
duke@435 71 // VM operation
duke@435 72 // - house keeping (flushing breakpoints and caches, deoptimizing
duke@435 73 // dependent compiled code)
duke@435 74 // - replacing parts in the_class with parts from scratch_class
duke@435 75 // - adding weak reference(s) to track the obsolete but interesting
duke@435 76 // parts of the_class
duke@435 77 // - adjusting constant pool caches and vtables in other classes
duke@435 78 // that refer to methods in the_class. These adjustments use the
duke@435 79 // SystemDictionary::classes_do() facility which only allows
duke@435 80 // a helper method to be specified. The interesting parameters
duke@435 81 // that we would like to pass to the helper method are saved in
duke@435 82 // static global fields in the VM operation.
duke@435 83 // - telling the SystemDictionary to notice our changes
duke@435 84 //
duke@435 85 // Note: the above work must be done by the VMThread to be safe.
duke@435 86 //
duke@435 87 // 3) doit_epilogue() is called by the JavaThread after the VM op
duke@435 88 // is finished and the safepoint is done. It simply cleans up
duke@435 89 // memory allocated in doit_prologue() and used in doit().
duke@435 90 //
duke@435 91 //
duke@435 92 // Constant Pool Details:
duke@435 93 //
duke@435 94 // When the_class is redefined, we cannot just replace the constant
duke@435 95 // pool in the_class with the constant pool from scratch_class because
duke@435 96 // that could confuse obsolete methods that may still be running.
duke@435 97 // Instead, the constant pool from the_class, old_cp, is merged with
duke@435 98 // the constant pool from scratch_class, scratch_cp. The resulting
duke@435 99 // constant pool, merge_cp, replaces old_cp in the_class.
duke@435 100 //
duke@435 101 // The key part of any merging algorithm is the entry comparison
duke@435 102 // function so we have to know the types of entries in a constant pool
duke@435 103 // in order to merge two of them together. Constant pools can contain
duke@435 104 // up to 12 different kinds of entries; the JVM_CONSTANT_Unicode entry
duke@435 105 // is not presently used so we only have to worry about the other 11
duke@435 106 // entry types. For the purposes of constant pool merging, it is
duke@435 107 // helpful to know that the 11 entry types fall into 3 different
duke@435 108 // subtypes: "direct", "indirect" and "double-indirect".
duke@435 109 //
duke@435 110 // Direct CP entries contain data and do not contain references to
duke@435 111 // other CP entries. The following are direct CP entries:
duke@435 112 // JVM_CONSTANT_{Double,Float,Integer,Long,Utf8}
duke@435 113 //
duke@435 114 // Indirect CP entries contain 1 or 2 references to a direct CP entry
duke@435 115 // and no other data. The following are indirect CP entries:
duke@435 116 // JVM_CONSTANT_{Class,NameAndType,String}
duke@435 117 //
duke@435 118 // Double-indirect CP entries contain two references to indirect CP
duke@435 119 // entries and no other data. The following are double-indirect CP
duke@435 120 // entries:
duke@435 121 // JVM_CONSTANT_{Fieldref,InterfaceMethodref,Methodref}
duke@435 122 //
duke@435 123 // When comparing entries between two constant pools, the entry types
duke@435 124 // are compared first and if they match, then further comparisons are
duke@435 125 // made depending on the entry subtype. Comparing direct CP entries is
duke@435 126 // simply a matter of comparing the data associated with each entry.
duke@435 127 // Comparing both indirect and double-indirect CP entries requires
duke@435 128 // recursion.
duke@435 129 //
duke@435 130 // Fortunately, the recursive combinations are limited because indirect
duke@435 131 // CP entries can only refer to direct CP entries and double-indirect
duke@435 132 // CP entries can only refer to indirect CP entries. The following is
duke@435 133 // an example illustration of the deepest set of indirections needed to
duke@435 134 // access the data associated with a JVM_CONSTANT_Fieldref entry:
duke@435 135 //
duke@435 136 // JVM_CONSTANT_Fieldref {
duke@435 137 // class_index => JVM_CONSTANT_Class {
duke@435 138 // name_index => JVM_CONSTANT_Utf8 {
duke@435 139 // <data-1>
duke@435 140 // }
duke@435 141 // }
duke@435 142 // name_and_type_index => JVM_CONSTANT_NameAndType {
duke@435 143 // name_index => JVM_CONSTANT_Utf8 {
duke@435 144 // <data-2>
duke@435 145 // }
duke@435 146 // descriptor_index => JVM_CONSTANT_Utf8 {
duke@435 147 // <data-3>
duke@435 148 // }
duke@435 149 // }
duke@435 150 // }
duke@435 151 //
duke@435 152 // The above illustration is not a data structure definition for any
duke@435 153 // computer language. The curly braces ('{' and '}') are meant to
duke@435 154 // delimit the context of the "fields" in the CP entry types shown.
duke@435 155 // Each indirection from the JVM_CONSTANT_Fieldref entry is shown via
duke@435 156 // "=>", e.g., the class_index is used to indirectly reference a
duke@435 157 // JVM_CONSTANT_Class entry where the name_index is used to indirectly
duke@435 158 // reference a JVM_CONSTANT_Utf8 entry which contains the interesting
duke@435 159 // <data-1>. In order to understand a JVM_CONSTANT_Fieldref entry, we
duke@435 160 // have to do a total of 5 indirections just to get to the CP entries
duke@435 161 // that contain the interesting pieces of data and then we have to
duke@435 162 // fetch the three pieces of data. This means we have to do a total of
duke@435 163 // (5 + 3) * 2 == 16 dereferences to compare two JVM_CONSTANT_Fieldref
duke@435 164 // entries.
duke@435 165 //
duke@435 166 // Here is the indirection, data and dereference count for each entry
duke@435 167 // type:
duke@435 168 //
duke@435 169 // JVM_CONSTANT_Class 1 indir, 1 data, 2 derefs
duke@435 170 // JVM_CONSTANT_Double 0 indir, 1 data, 1 deref
duke@435 171 // JVM_CONSTANT_Fieldref 2 indir, 3 data, 8 derefs
duke@435 172 // JVM_CONSTANT_Float 0 indir, 1 data, 1 deref
duke@435 173 // JVM_CONSTANT_Integer 0 indir, 1 data, 1 deref
duke@435 174 // JVM_CONSTANT_InterfaceMethodref 2 indir, 3 data, 8 derefs
duke@435 175 // JVM_CONSTANT_Long 0 indir, 1 data, 1 deref
duke@435 176 // JVM_CONSTANT_Methodref 2 indir, 3 data, 8 derefs
duke@435 177 // JVM_CONSTANT_NameAndType 1 indir, 2 data, 4 derefs
duke@435 178 // JVM_CONSTANT_String 1 indir, 1 data, 2 derefs
duke@435 179 // JVM_CONSTANT_Utf8 0 indir, 1 data, 1 deref
duke@435 180 //
duke@435 181 // So different subtypes of CP entries require different amounts of
duke@435 182 // work for a proper comparison.
duke@435 183 //
duke@435 184 // Now that we've talked about the different entry types and how to
duke@435 185 // compare them we need to get back to merging. This is not a merge in
duke@435 186 // the "sort -u" sense or even in the "sort" sense. When we merge two
duke@435 187 // constant pools, we copy all the entries from old_cp to merge_cp,
duke@435 188 // preserving entry order. Next we append all the unique entries from
duke@435 189 // scratch_cp to merge_cp and we track the index changes from the
duke@435 190 // location in scratch_cp to the possibly new location in merge_cp.
duke@435 191 // When we are done, any obsolete code that is still running that
duke@435 192 // uses old_cp should not be able to observe any difference if it
duke@435 193 // were to use merge_cp. As for the new code in scratch_class, it is
duke@435 194 // modified to use the appropriate index values in merge_cp before it
duke@435 195 // is used to replace the code in the_class.
duke@435 196 //
duke@435 197 // There is one small complication in copying the entries from old_cp
duke@435 198 // to merge_cp. Two of the CP entry types are special in that they are
duke@435 199 // lazily resolved. Before explaining the copying complication, we need
duke@435 200 // to digress into CP entry resolution.
duke@435 201 //
duke@435 202 // JVM_CONSTANT_Class and JVM_CONSTANT_String entries are present in
duke@435 203 // the class file, but are not stored in memory as such until they are
duke@435 204 // resolved. The entries are not resolved unless they are used because
duke@435 205 // resolution is expensive. During class file parsing the entries are
duke@435 206 // initially stored in memory as JVM_CONSTANT_ClassIndex and
duke@435 207 // JVM_CONSTANT_StringIndex entries. These special CP entry types
duke@435 208 // indicate that the JVM_CONSTANT_Class and JVM_CONSTANT_String entries
duke@435 209 // have been parsed, but the index values in the entries have not been
duke@435 210 // validated. After the entire constant pool has been parsed, the index
duke@435 211 // values can be validated and then the entries are converted into
duke@435 212 // JVM_CONSTANT_UnresolvedClass and JVM_CONSTANT_UnresolvedString
duke@435 213 // entries. During this conversion process, the UTF8 values that are
duke@435 214 // indirectly referenced by the JVM_CONSTANT_ClassIndex and
duke@435 215 // JVM_CONSTANT_StringIndex entries are changed into symbolOops and the
duke@435 216 // entries are modified to refer to the symbolOops. This optimization
duke@435 217 // eliminates one level of indirection for those two CP entry types and
duke@435 218 // gets the entries ready for verification. During class file parsing
duke@435 219 // it is also possible for JVM_CONSTANT_UnresolvedString entries to be
duke@435 220 // resolved into JVM_CONSTANT_String entries. Verification expects to
duke@435 221 // find JVM_CONSTANT_UnresolvedClass and either JVM_CONSTANT_String or
duke@435 222 // JVM_CONSTANT_UnresolvedString entries and not JVM_CONSTANT_Class
duke@435 223 // entries.
duke@435 224 //
duke@435 225 // Now we can get back to the copying complication. When we copy
duke@435 226 // entries from old_cp to merge_cp, we have to revert any
duke@435 227 // JVM_CONSTANT_Class entries to JVM_CONSTANT_UnresolvedClass entries
duke@435 228 // or verification will fail.
duke@435 229 //
duke@435 230 // It is important to explicitly state that the merging algorithm
duke@435 231 // effectively unresolves JVM_CONSTANT_Class entries that were in the
duke@435 232 // old_cp when they are changed into JVM_CONSTANT_UnresolvedClass
duke@435 233 // entries in the merge_cp. This is done both to make verification
duke@435 234 // happy and to avoid adding more brittleness between RedefineClasses
duke@435 235 // and the constant pool cache. By allowing the constant pool cache
duke@435 236 // implementation to (re)resolve JVM_CONSTANT_UnresolvedClass entries
duke@435 237 // into JVM_CONSTANT_Class entries, we avoid having to embed knowledge
duke@435 238 // about those algorithms in RedefineClasses.
duke@435 239 //
duke@435 240 // Appending unique entries from scratch_cp to merge_cp is straight
duke@435 241 // forward for direct CP entries and most indirect CP entries. For the
duke@435 242 // indirect CP entry type JVM_CONSTANT_NameAndType and for the double-
duke@435 243 // indirect CP entry types, the presence of more than one piece of
duke@435 244 // interesting data makes appending the entries more complicated.
duke@435 245 //
duke@435 246 // For the JVM_CONSTANT_{Double,Float,Integer,Long,Utf8} entry types,
duke@435 247 // the entry is simply copied from scratch_cp to the end of merge_cp.
duke@435 248 // If the index in scratch_cp is different than the destination index
duke@435 249 // in merge_cp, then the change in index value is tracked.
duke@435 250 //
duke@435 251 // Note: the above discussion for the direct CP entries also applies
duke@435 252 // to the JVM_CONSTANT_Unresolved{Class,String} entry types.
duke@435 253 //
duke@435 254 // For the JVM_CONSTANT_{Class,String} entry types, since there is only
duke@435 255 // one data element at the end of the recursion, we know that we have
duke@435 256 // either one or two unique entries. If the JVM_CONSTANT_Utf8 entry is
duke@435 257 // unique then it is appended to merge_cp before the current entry.
duke@435 258 // If the JVM_CONSTANT_Utf8 entry is not unique, then the current entry
duke@435 259 // is updated to refer to the duplicate entry in merge_cp before it is
duke@435 260 // appended to merge_cp. Again, any changes in index values are tracked
duke@435 261 // as needed.
duke@435 262 //
duke@435 263 // Note: the above discussion for JVM_CONSTANT_{Class,String} entry
duke@435 264 // types is theoretical. Since those entry types have already been
duke@435 265 // optimized into JVM_CONSTANT_Unresolved{Class,String} entry types,
duke@435 266 // they are handled as direct CP entries.
duke@435 267 //
duke@435 268 // For the JVM_CONSTANT_NameAndType entry type, since there are two
duke@435 269 // data elements at the end of the recursions, we know that we have
duke@435 270 // between one and three unique entries. Any unique JVM_CONSTANT_Utf8
duke@435 271 // entries are appended to merge_cp before the current entry. For any
duke@435 272 // JVM_CONSTANT_Utf8 entries that are not unique, the current entry is
duke@435 273 // updated to refer to the duplicate entry in merge_cp before it is
duke@435 274 // appended to merge_cp. Again, any changes in index values are tracked
duke@435 275 // as needed.
duke@435 276 //
duke@435 277 // For the JVM_CONSTANT_{Fieldref,InterfaceMethodref,Methodref} entry
duke@435 278 // types, since there are two indirect CP entries and three data
duke@435 279 // elements at the end of the recursions, we know that we have between
duke@435 280 // one and six unique entries. See the JVM_CONSTANT_Fieldref diagram
duke@435 281 // above for an example of all six entries. The uniqueness algorithm
duke@435 282 // for the JVM_CONSTANT_Class and JVM_CONSTANT_NameAndType entries is
duke@435 283 // covered above. Any unique entries are appended to merge_cp before
duke@435 284 // the current entry. For any entries that are not unique, the current
duke@435 285 // entry is updated to refer to the duplicate entry in merge_cp before
duke@435 286 // it is appended to merge_cp. Again, any changes in index values are
duke@435 287 // tracked as needed.
duke@435 288 //
duke@435 289 //
duke@435 290 // Other Details:
duke@435 291 //
duke@435 292 // Details for other parts of RedefineClasses need to be written.
duke@435 293 // This is a placeholder section.
duke@435 294 //
duke@435 295 //
duke@435 296 // Open Issues (in no particular order):
duke@435 297 //
duke@435 298 // - How do we serialize the RedefineClasses() API without deadlocking?
duke@435 299 //
duke@435 300 // - SystemDictionary::parse_stream() was called with a NULL protection
duke@435 301 // domain since the initial version. This has been changed to pass
duke@435 302 // the_class->protection_domain(). This change has been tested with
duke@435 303 // all NSK tests and nothing broke, but what will adding it now break
duke@435 304 // in ways that we don't test?
duke@435 305 //
duke@435 306 // - GenerateOopMap::rewrite_load_or_store() has a comment in its
duke@435 307 // (indirect) use of the Relocator class that the max instruction
duke@435 308 // size is 4 bytes. goto_w and jsr_w are 5 bytes and wide/iinc is
duke@435 309 // 6 bytes. Perhaps Relocator only needs a 4 byte buffer to do
duke@435 310 // what it does to the bytecodes. More investigation is needed.
duke@435 311 //
duke@435 312 // - java.lang.Object methods can be called on arrays. This is
duke@435 313 // implemented via the arrayKlassOop vtable which we don't
duke@435 314 // update. For example, if we redefine java.lang.Object.toString(),
duke@435 315 // then the new version of the method will not be called for array
duke@435 316 // objects.
duke@435 317 //
duke@435 318 // - How do we know if redefine_single_class() and the guts of
duke@435 319 // instanceKlass are out of sync? I don't think this can be
duke@435 320 // automated, but we should probably order the work in
duke@435 321 // redefine_single_class() to match the order of field
duke@435 322 // definitions in instanceKlass. We also need to add some
duke@435 323 // comments about keeping things in sync.
duke@435 324 //
duke@435 325 // - set_new_constant_pool() is huge and we should consider refactoring
duke@435 326 // it into smaller chunks of work.
duke@435 327 //
duke@435 328 // - The exception table update code in set_new_constant_pool() defines
duke@435 329 // const values that are also defined in a local context elsewhere.
duke@435 330 // The same literal values are also used in elsewhere. We need to
duke@435 331 // coordinate a cleanup of these constants with Runtime.
duke@435 332 //
duke@435 333
duke@435 334 class VM_RedefineClasses: public VM_Operation {
duke@435 335 private:
duke@435 336 // These static fields are needed by SystemDictionary::classes_do()
duke@435 337 // facility and the adjust_cpool_cache_and_vtable() helper:
duke@435 338 static objArrayOop _old_methods;
duke@435 339 static objArrayOop _new_methods;
duke@435 340 static methodOop* _matching_old_methods;
duke@435 341 static methodOop* _matching_new_methods;
duke@435 342 static methodOop* _deleted_methods;
duke@435 343 static methodOop* _added_methods;
duke@435 344 static int _matching_methods_length;
duke@435 345 static int _deleted_methods_length;
duke@435 346 static int _added_methods_length;
duke@435 347 static klassOop _the_class_oop;
duke@435 348
duke@435 349 // The instance fields are used to pass information from
duke@435 350 // doit_prologue() to doit() and doit_epilogue().
duke@435 351 jint _class_count;
duke@435 352 const jvmtiClassDefinition *_class_defs; // ptr to _class_count defs
duke@435 353
duke@435 354 // This operation is used by both RedefineClasses and
duke@435 355 // RetransformClasses. Indicate which.
duke@435 356 JvmtiClassLoadKind _class_load_kind;
duke@435 357
duke@435 358 // _index_map_count is just an optimization for knowing if
duke@435 359 // _index_map_p contains any entries.
duke@435 360 int _index_map_count;
duke@435 361 intArray * _index_map_p;
duke@435 362 // ptr to _class_count scratch_classes
duke@435 363 instanceKlassHandle * _scratch_classes;
duke@435 364 jvmtiError _res;
duke@435 365
duke@435 366 // Performance measurement support. These timers do not cover all
duke@435 367 // the work done for JVM/TI RedefineClasses() but they do cover
duke@435 368 // the heavy lifting.
duke@435 369 elapsedTimer _timer_rsc_phase1;
duke@435 370 elapsedTimer _timer_rsc_phase2;
duke@435 371 elapsedTimer _timer_vm_op_prologue;
duke@435 372
duke@435 373 // These routines are roughly in call order unless otherwise noted.
duke@435 374
duke@435 375 // Load the caller's new class definition(s) into _scratch_classes.
duke@435 376 // Constant pool merging work is done here as needed. Also calls
duke@435 377 // compare_and_normalize_class_versions() to verify the class
duke@435 378 // definition(s).
duke@435 379 jvmtiError load_new_class_versions(TRAPS);
duke@435 380
duke@435 381 // Verify that the caller provided class definition(s) that meet
duke@435 382 // the restrictions of RedefineClasses. Normalize the order of
duke@435 383 // overloaded methods as needed.
duke@435 384 jvmtiError compare_and_normalize_class_versions(
duke@435 385 instanceKlassHandle the_class, instanceKlassHandle scratch_class);
duke@435 386
duke@435 387 // Swap annotations[i] with annotations[j]
duke@435 388 // Used by compare_and_normalize_class_versions() when normalizing
duke@435 389 // overloaded methods or changing idnum as when adding or deleting methods.
duke@435 390 void swap_all_method_annotations(int i, int j, instanceKlassHandle scratch_class);
duke@435 391
duke@435 392 // Figure out which new methods match old methods in name and signature,
duke@435 393 // which methods have been added, and which are no longer present
duke@435 394 void compute_added_deleted_matching_methods();
duke@435 395
duke@435 396 // Change jmethodIDs to point to the new methods
duke@435 397 void update_jmethod_ids();
duke@435 398
duke@435 399 // In addition to marking methods as obsolete, this routine
duke@435 400 // records which methods are EMCP (Equivalent Module Constant
duke@435 401 // Pool) in the emcp_methods BitMap and returns the number of
duke@435 402 // EMCP methods via emcp_method_count_p. This information is
duke@435 403 // used when information about the previous version of the_class
duke@435 404 // is squirreled away.
duke@435 405 void check_methods_and_mark_as_obsolete(BitMap *emcp_methods,
duke@435 406 int * emcp_method_count_p);
duke@435 407 void transfer_old_native_function_registrations(instanceKlassHandle the_class);
duke@435 408
duke@435 409 // Unevolving classes may point to methods of the_class directly
duke@435 410 // from their constant pool caches, itables, and/or vtables. We
duke@435 411 // use the SystemDictionary::classes_do() facility and this helper
duke@435 412 // to fix up these pointers.
duke@435 413 static void adjust_cpool_cache_and_vtable(klassOop k_oop, oop loader, TRAPS);
duke@435 414
duke@435 415 // Install the redefinition of a class
duke@435 416 void redefine_single_class(jclass the_jclass,
duke@435 417 instanceKlassHandle scratch_class, TRAPS);
duke@435 418
duke@435 419 // Increment the classRedefinedCount field in the specific instanceKlass
duke@435 420 // and in all direct and indirect subclasses.
duke@435 421 void increment_class_counter(instanceKlass *ik, TRAPS);
duke@435 422
duke@435 423 // Support for constant pool merging (these routines are in alpha
duke@435 424 // order):
duke@435 425 void append_entry(constantPoolHandle scratch_cp, int scratch_i,
duke@435 426 constantPoolHandle *merge_cp_p, int *merge_cp_length_p, TRAPS);
duke@435 427 int find_new_index(int old_index);
duke@435 428 bool is_unresolved_class_mismatch(constantPoolHandle cp1, int index1,
duke@435 429 constantPoolHandle cp2, int index2);
duke@435 430 bool is_unresolved_string_mismatch(constantPoolHandle cp1, int index1,
duke@435 431 constantPoolHandle cp2, int index2);
duke@435 432 void map_index(constantPoolHandle scratch_cp, int old_index, int new_index);
duke@435 433 bool merge_constant_pools(constantPoolHandle old_cp,
duke@435 434 constantPoolHandle scratch_cp, constantPoolHandle *merge_cp_p,
duke@435 435 int *merge_cp_length_p, TRAPS);
duke@435 436 jvmtiError merge_cp_and_rewrite(instanceKlassHandle the_class,
duke@435 437 instanceKlassHandle scratch_class, TRAPS);
duke@435 438 u2 rewrite_cp_ref_in_annotation_data(
duke@435 439 typeArrayHandle annotations_typeArray, int &byte_i_ref,
duke@435 440 const char * trace_mesg, TRAPS);
duke@435 441 bool rewrite_cp_refs(instanceKlassHandle scratch_class, TRAPS);
duke@435 442 bool rewrite_cp_refs_in_annotation_struct(
duke@435 443 typeArrayHandle class_annotations, int &byte_i_ref, TRAPS);
duke@435 444 bool rewrite_cp_refs_in_annotations_typeArray(
duke@435 445 typeArrayHandle annotations_typeArray, int &byte_i_ref, TRAPS);
duke@435 446 bool rewrite_cp_refs_in_class_annotations(
duke@435 447 instanceKlassHandle scratch_class, TRAPS);
duke@435 448 bool rewrite_cp_refs_in_element_value(
duke@435 449 typeArrayHandle class_annotations, int &byte_i_ref, TRAPS);
duke@435 450 bool rewrite_cp_refs_in_fields_annotations(
duke@435 451 instanceKlassHandle scratch_class, TRAPS);
duke@435 452 void rewrite_cp_refs_in_method(methodHandle method,
duke@435 453 methodHandle * new_method_p, TRAPS);
duke@435 454 bool rewrite_cp_refs_in_methods(instanceKlassHandle scratch_class, TRAPS);
duke@435 455 bool rewrite_cp_refs_in_methods_annotations(
duke@435 456 instanceKlassHandle scratch_class, TRAPS);
duke@435 457 bool rewrite_cp_refs_in_methods_default_annotations(
duke@435 458 instanceKlassHandle scratch_class, TRAPS);
duke@435 459 bool rewrite_cp_refs_in_methods_parameter_annotations(
duke@435 460 instanceKlassHandle scratch_class, TRAPS);
duke@435 461 void rewrite_cp_refs_in_stack_map_table(methodHandle method, TRAPS);
duke@435 462 void rewrite_cp_refs_in_verification_type_info(
duke@435 463 address& stackmap_addr_ref, address stackmap_end, u2 frame_i,
duke@435 464 u1 frame_size, TRAPS);
duke@435 465 void set_new_constant_pool(instanceKlassHandle scratch_class,
duke@435 466 constantPoolHandle scratch_cp, int scratch_cp_length, bool shrink, TRAPS);
duke@435 467
duke@435 468 void flush_dependent_code(instanceKlassHandle k_h, TRAPS);
duke@435 469
duke@435 470 static void check_class(klassOop k_oop, oop initiating_loader, TRAPS) PRODUCT_RETURN;
duke@435 471
duke@435 472 static void dump_methods() PRODUCT_RETURN;
duke@435 473
duke@435 474 public:
duke@435 475 VM_RedefineClasses(jint class_count,
duke@435 476 const jvmtiClassDefinition *class_defs,
duke@435 477 JvmtiClassLoadKind class_load_kind);
duke@435 478 VMOp_Type type() const { return VMOp_RedefineClasses; }
duke@435 479 bool doit_prologue();
duke@435 480 void doit();
duke@435 481 void doit_epilogue();
duke@435 482
duke@435 483 bool allow_nested_vm_operations() const { return true; }
duke@435 484 jvmtiError check_error() { return _res; }
duke@435 485
duke@435 486 // Modifiable test must be shared between IsModifiableClass query
duke@435 487 // and redefine implementation
duke@435 488 static bool is_modifiable_class(oop klass_mirror);
duke@435 489 };

mercurial