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