Cross Reference: /openjdk7/hotspot/src/share/vm/prims/jvmtiRedefineClasses.cpp

Lines Matching defs:scratch_cp
178 // Append the current entry at scratch_i in scratch_cp to *merge_cp_p
189 void VM_RedefineClasses::append_entry(constantPoolHandle scratch_cp,
194   switch (scratch_cp->tag_at(scratch_i).value()) {
210         scratch_cp->klass_name_at(scratch_i));
214         // the new entry in scratch_cp so we need to map the index values.
215         map_index(scratch_cp, scratch_i, *merge_cp_length_p);
225       constantPoolOopDesc::copy_entry_to(scratch_cp, scratch_i, *merge_cp_p, *merge_cp_length_p,
230         // the new entry in scratch_cp so we need to map the index values.
231         map_index(scratch_cp, scratch_i, *merge_cp_length_p);
250       constantPoolOopDesc::copy_entry_to(scratch_cp, scratch_i, *merge_cp_p, *merge_cp_length_p,
255         // the new entry in scratch_cp so we need to map the index values.
256         map_index(scratch_cp, scratch_i, *merge_cp_length_p);
264       int name_ref_i = scratch_cp->name_ref_index_at(scratch_i);
267         scratch_cp->compare_entry_to(name_ref_i, *merge_cp_p, name_ref_i,
272         int found_i = scratch_cp->find_matching_entry(name_ref_i, *merge_cp_p,
281           map_index(scratch_cp, name_ref_i, found_i);
284           append_entry(scratch_cp, name_ref_i, merge_cp_p, merge_cp_length_p,
293       int signature_ref_i = scratch_cp->signature_ref_index_at(scratch_i);
296         scratch_cp->compare_entry_to(signature_ref_i, *merge_cp_p,
301         int found_i = scratch_cp->find_matching_entry(signature_ref_i,
310           map_index(scratch_cp, signature_ref_i, found_i);
313           append_entry(scratch_cp, signature_ref_i, merge_cp_p,
344         // the new entry in scratch_cp so we need to map the index values.
345         map_index(scratch_cp, scratch_i, *merge_cp_length_p);
355       int klass_ref_i = scratch_cp->uncached_klass_ref_index_at(scratch_i);
358         scratch_cp->compare_entry_to(klass_ref_i, *merge_cp_p, klass_ref_i,
363         int found_i = scratch_cp->find_matching_entry(klass_ref_i, *merge_cp_p,
372           map_index(scratch_cp, klass_ref_i, found_i);
375           append_entry(scratch_cp, klass_ref_i, merge_cp_p, merge_cp_length_p,
387         scratch_cp->uncached_name_and_type_ref_index_at(scratch_i);
390         scratch_cp->compare_entry_to(name_and_type_ref_i, *merge_cp_p,
395         int found_i = scratch_cp->find_matching_entry(name_and_type_ref_i,
404           map_index(scratch_cp, name_and_type_ref_i, found_i);
407           append_entry(scratch_cp, name_and_type_ref_i, merge_cp_p,
428       switch (scratch_cp->tag_at(scratch_i).value()) {
462         // the new entry in scratch_cp so we need to map the index values.
463         map_index(scratch_cp, scratch_i, *merge_cp_length_p);
488       jbyte bad_value = scratch_cp->tag_at(scratch_i).value();
1023 // Map old_index to new_index as needed. scratch_cp is only needed
1025 void VM_RedefineClasses::map_index(constantPoolHandle scratch_cp,
1041     scratch_cp->tag_at(old_index).value(), old_index, new_index));
1045 // Merge old_cp and scratch_cp and return the results of the merge via
1049 // scratch_cp to the corresponding entry in *merge_cp_p. Index map
1050 // entries are only created for entries in scratch_cp that occupy a
1053        constantPoolHandle scratch_cp, constantPoolHandle *merge_cp_p,
1064   // Worst case we need old_cp->length() + scratch_cp()->length(),
1074     scratch_cp->length()));
1126   int scratch_i;  // index into scratch_cp
1129     // Compare scratch_cp entries to the old_cp entries that we have
1134     int pass1a_length = MIN2(old_cp->length(), scratch_cp->length());
1136       switch (scratch_cp->tag_at(scratch_i).value()) {
1148       bool match = scratch_cp->compare_entry_to(scratch_i, *merge_cp_p,
1153       } else if (is_unresolved_class_mismatch(scratch_cp, scratch_i,
1161       } else if (is_unresolved_string_mismatch(scratch_cp, scratch_i,
1170       int found_i = scratch_cp->find_matching_entry(scratch_i, *merge_cp_p,
1178         map_index(scratch_cp, scratch_i, found_i);
1191       append_entry(scratch_cp, scratch_i, merge_cp_p, merge_cp_length_p,
1200   if (scratch_i < scratch_cp->length()) {
1202     // old_cp is smaller than scratch_cp so there are entries in
1203     // scratch_cp that we have not yet processed. We take care of
1206     for (; scratch_i < scratch_cp->length(); scratch_i += increment) {
1207       switch (scratch_cp->tag_at(scratch_i).value()) {
1220         scratch_cp->find_matching_entry(scratch_i, *merge_cp_p, CHECK_0);
1224         map_index(scratch_cp, scratch_i, found_i);
1230       append_entry(scratch_cp, scratch_i, merge_cp_p, merge_cp_length_p,
1254   constantPoolHandle scratch_cp(THREAD, scratch_class->constants());
1283   _index_map_p = new intArray(scratch_cp->length(), -1);
1285   bool result = merge_constant_pools(old_cp, scratch_cp, &merge_cp,
1299     if (old_cp->length() == scratch_cp->length()) {
1310     } else if (old_cp->length() < scratch_cp->length()) {
1365   assert(scratch_cp()->is_conc_safe(), "Just checking");
2341 // scratch_cp. If shrink is true, then scratch_cp_length elements
2342 // are copied from scratch_cp to a smaller constant pool and the
2345        instanceKlassHandle scratch_class, constantPoolHandle scratch_cp,
2347   assert(!shrink || scratch_cp->length() >= scratch_cp_length, "sanity check");
2350     // scratch_cp is a merged constant pool and has enough space for a
2358     int orig_length = scratch_cp->orig_length();
2361     scratch_cp->copy_cp_to(1, scratch_cp_length - 1, smaller_cp, 1, THREAD);
2362     scratch_cp = smaller_cp;
2367   scratch_cp->set_pool_holder(scratch_class());
2370   scratch_class->set_constants(scratch_cp());
2443     method->set_constants(scratch_cp());
2538   assert(scratch_cp()->is_conc_safe(), "Just checking");