Tue, 06 Nov 2012 15:09:37 -0500
8000725: NPG: method_holder() and pool_holder() and pool_holder field should be InstanceKlass
Summary: Change types of above methods and field to InstanceKlass and remove unneeded casts from the source files.
Reviewed-by: dholmes, coleenp, zgu
Contributed-by: harold.seigel@oracle.com
1 /*
2 * Copyright (c) 1998, 2012, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #include "precompiled.hpp"
26 #include "gc_implementation/shared/markSweep.inline.hpp"
27 #include "interpreter/interpreter.hpp"
28 #include "interpreter/rewriter.hpp"
29 #include "memory/universe.inline.hpp"
30 #include "oops/cpCache.hpp"
31 #include "oops/objArrayOop.hpp"
32 #include "oops/oop.inline.hpp"
33 #include "prims/jvmtiRedefineClassesTrace.hpp"
34 #include "prims/methodHandles.hpp"
35 #include "runtime/handles.inline.hpp"
36 #ifndef SERIALGC
37 # include "gc_implementation/parallelScavenge/psPromotionManager.hpp"
38 #endif
41 // Implememtation of ConstantPoolCacheEntry
43 void ConstantPoolCacheEntry::initialize_entry(int index) {
44 assert(0 < index && index < 0x10000, "sanity check");
45 _indices = index;
46 assert(constant_pool_index() == index, "");
47 }
49 int ConstantPoolCacheEntry::make_flags(TosState state,
50 int option_bits,
51 int field_index_or_method_params) {
52 assert(state < number_of_states, "Invalid state in make_flags");
53 int f = ((int)state << tos_state_shift) | option_bits | field_index_or_method_params;
54 // Preserve existing flag bit values
55 // The low bits are a field offset, or else the method parameter size.
56 #ifdef ASSERT
57 TosState old_state = flag_state();
58 assert(old_state == (TosState)0 || old_state == state,
59 "inconsistent cpCache flags state");
60 #endif
61 return (_flags | f) ;
62 }
64 void ConstantPoolCacheEntry::set_bytecode_1(Bytecodes::Code code) {
65 #ifdef ASSERT
66 // Read once.
67 volatile Bytecodes::Code c = bytecode_1();
68 assert(c == 0 || c == code || code == 0, "update must be consistent");
69 #endif
70 // Need to flush pending stores here before bytecode is written.
71 OrderAccess::release_store_ptr(&_indices, _indices | ((u_char)code << bytecode_1_shift));
72 }
74 void ConstantPoolCacheEntry::set_bytecode_2(Bytecodes::Code code) {
75 #ifdef ASSERT
76 // Read once.
77 volatile Bytecodes::Code c = bytecode_2();
78 assert(c == 0 || c == code || code == 0, "update must be consistent");
79 #endif
80 // Need to flush pending stores here before bytecode is written.
81 OrderAccess::release_store_ptr(&_indices, _indices | ((u_char)code << bytecode_2_shift));
82 }
84 // Sets f1, ordering with previous writes.
85 void ConstantPoolCacheEntry::release_set_f1(Metadata* f1) {
86 assert(f1 != NULL, "");
87 OrderAccess::release_store_ptr((HeapWord*) &_f1, f1);
88 }
90 // Sets flags, but only if the value was previously zero.
91 bool ConstantPoolCacheEntry::init_flags_atomic(intptr_t flags) {
92 intptr_t result = Atomic::cmpxchg_ptr(flags, &_flags, 0);
93 return (result == 0);
94 }
96 // Note that concurrent update of both bytecodes can leave one of them
97 // reset to zero. This is harmless; the interpreter will simply re-resolve
98 // the damaged entry. More seriously, the memory synchronization is needed
99 // to flush other fields (f1, f2) completely to memory before the bytecodes
100 // are updated, lest other processors see a non-zero bytecode but zero f1/f2.
101 void ConstantPoolCacheEntry::set_field(Bytecodes::Code get_code,
102 Bytecodes::Code put_code,
103 KlassHandle field_holder,
104 int field_index,
105 int field_offset,
106 TosState field_type,
107 bool is_final,
108 bool is_volatile,
109 Klass* root_klass) {
110 set_f1(field_holder());
111 set_f2(field_offset);
112 assert((field_index & field_index_mask) == field_index,
113 "field index does not fit in low flag bits");
114 set_field_flags(field_type,
115 ((is_volatile ? 1 : 0) << is_volatile_shift) |
116 ((is_final ? 1 : 0) << is_final_shift),
117 field_index);
118 set_bytecode_1(get_code);
119 set_bytecode_2(put_code);
120 NOT_PRODUCT(verify(tty));
121 }
123 void ConstantPoolCacheEntry::set_parameter_size(int value) {
124 // This routine is called only in corner cases where the CPCE is not yet initialized.
125 // See AbstractInterpreter::deopt_continue_after_entry.
126 assert(_flags == 0 || parameter_size() == 0 || parameter_size() == value,
127 err_msg("size must not change: parameter_size=%d, value=%d", parameter_size(), value));
128 // Setting the parameter size by itself is only safe if the
129 // current value of _flags is 0, otherwise another thread may have
130 // updated it and we don't want to overwrite that value. Don't
131 // bother trying to update it once it's nonzero but always make
132 // sure that the final parameter size agrees with what was passed.
133 if (_flags == 0) {
134 Atomic::cmpxchg_ptr((value & parameter_size_mask), &_flags, 0);
135 }
136 guarantee(parameter_size() == value,
137 err_msg("size must not change: parameter_size=%d, value=%d", parameter_size(), value));
138 }
140 void ConstantPoolCacheEntry::set_method(Bytecodes::Code invoke_code,
141 methodHandle method,
142 int vtable_index) {
143 assert(method->interpreter_entry() != NULL, "should have been set at this point");
144 assert(!method->is_obsolete(), "attempt to write obsolete method to cpCache");
146 int byte_no = -1;
147 bool change_to_virtual = false;
149 switch (invoke_code) {
150 case Bytecodes::_invokeinterface:
151 // We get here from InterpreterRuntime::resolve_invoke when an invokeinterface
152 // instruction somehow links to a non-interface method (in Object).
153 // In that case, the method has no itable index and must be invoked as a virtual.
154 // Set a flag to keep track of this corner case.
155 change_to_virtual = true;
157 // ...and fall through as if we were handling invokevirtual:
158 case Bytecodes::_invokevirtual:
159 {
160 if (method->can_be_statically_bound()) {
161 // set_f2_as_vfinal_method checks if is_vfinal flag is true.
162 set_method_flags(as_TosState(method->result_type()),
163 ( 1 << is_vfinal_shift) |
164 ((method->is_final_method() ? 1 : 0) << is_final_shift) |
165 ((change_to_virtual ? 1 : 0) << is_forced_virtual_shift),
166 method()->size_of_parameters());
167 set_f2_as_vfinal_method(method());
168 } else {
169 assert(vtable_index >= 0, "valid index");
170 assert(!method->is_final_method(), "sanity");
171 set_method_flags(as_TosState(method->result_type()),
172 ((change_to_virtual ? 1 : 0) << is_forced_virtual_shift),
173 method()->size_of_parameters());
174 set_f2(vtable_index);
175 }
176 byte_no = 2;
177 break;
178 }
180 case Bytecodes::_invokespecial:
181 case Bytecodes::_invokestatic:
182 // Note: Read and preserve the value of the is_vfinal flag on any
183 // invokevirtual bytecode shared with this constant pool cache entry.
184 // It is cheap and safe to consult is_vfinal() at all times.
185 // Once is_vfinal is set, it must stay that way, lest we get a dangling oop.
186 set_method_flags(as_TosState(method->result_type()),
187 ((is_vfinal() ? 1 : 0) << is_vfinal_shift) |
188 ((method->is_final_method() ? 1 : 0) << is_final_shift),
189 method()->size_of_parameters());
190 set_f1(method());
191 byte_no = 1;
192 break;
193 default:
194 ShouldNotReachHere();
195 break;
196 }
198 // Note: byte_no also appears in TemplateTable::resolve.
199 if (byte_no == 1) {
200 assert(invoke_code != Bytecodes::_invokevirtual &&
201 invoke_code != Bytecodes::_invokeinterface, "");
202 set_bytecode_1(invoke_code);
203 } else if (byte_no == 2) {
204 if (change_to_virtual) {
205 assert(invoke_code == Bytecodes::_invokeinterface, "");
206 // NOTE: THIS IS A HACK - BE VERY CAREFUL!!!
207 //
208 // Workaround for the case where we encounter an invokeinterface, but we
209 // should really have an _invokevirtual since the resolved method is a
210 // virtual method in java.lang.Object. This is a corner case in the spec
211 // but is presumably legal. javac does not generate this code.
212 //
213 // We set bytecode_1() to _invokeinterface, because that is the
214 // bytecode # used by the interpreter to see if it is resolved.
215 // We set bytecode_2() to _invokevirtual.
216 // See also interpreterRuntime.cpp. (8/25/2000)
217 // Only set resolved for the invokeinterface case if method is public.
218 // Otherwise, the method needs to be reresolved with caller for each
219 // interface call.
220 if (method->is_public()) set_bytecode_1(invoke_code);
221 } else {
222 assert(invoke_code == Bytecodes::_invokevirtual, "");
223 }
224 // set up for invokevirtual, even if linking for invokeinterface also:
225 set_bytecode_2(Bytecodes::_invokevirtual);
226 } else {
227 ShouldNotReachHere();
228 }
229 NOT_PRODUCT(verify(tty));
230 }
233 void ConstantPoolCacheEntry::set_interface_call(methodHandle method, int index) {
234 InstanceKlass* interf = method->method_holder();
235 assert(interf->is_interface(), "must be an interface");
236 assert(!method->is_final_method(), "interfaces do not have final methods; cannot link to one here");
237 set_f1(interf);
238 set_f2(index);
239 set_method_flags(as_TosState(method->result_type()),
240 0, // no option bits
241 method()->size_of_parameters());
242 set_bytecode_1(Bytecodes::_invokeinterface);
243 }
246 void ConstantPoolCacheEntry::set_method_handle(constantPoolHandle cpool,
247 methodHandle adapter,
248 Handle appendix, Handle method_type,
249 objArrayHandle resolved_references) {
250 set_method_handle_common(cpool, Bytecodes::_invokehandle, adapter, appendix, method_type, resolved_references);
251 }
253 void ConstantPoolCacheEntry::set_dynamic_call(constantPoolHandle cpool,
254 methodHandle adapter,
255 Handle appendix, Handle method_type,
256 objArrayHandle resolved_references) {
257 set_method_handle_common(cpool, Bytecodes::_invokedynamic, adapter, appendix, method_type, resolved_references);
258 }
260 void ConstantPoolCacheEntry::set_method_handle_common(constantPoolHandle cpool,
261 Bytecodes::Code invoke_code,
262 methodHandle adapter,
263 Handle appendix, Handle method_type,
264 objArrayHandle resolved_references) {
265 // NOTE: This CPCE can be the subject of data races.
266 // There are three words to update: flags, refs[f2], f1 (in that order).
267 // Writers must store all other values before f1.
268 // Readers must test f1 first for non-null before reading other fields.
269 // Competing writers must acquire exclusive access via a lock.
270 // A losing writer waits on the lock until the winner writes f1 and leaves
271 // the lock, so that when the losing writer returns, he can use the linked
272 // cache entry.
274 MonitorLockerEx ml(cpool->lock());
275 if (!is_f1_null()) {
276 return;
277 }
279 const bool has_appendix = appendix.not_null();
280 const bool has_method_type = method_type.not_null();
282 // Write the flags.
283 set_method_flags(as_TosState(adapter->result_type()),
284 ((has_appendix ? 1 : 0) << has_appendix_shift ) |
285 ((has_method_type ? 1 : 0) << has_method_type_shift) |
286 ( 1 << is_final_shift ),
287 adapter->size_of_parameters());
289 if (TraceInvokeDynamic) {
290 tty->print_cr("set_method_handle bc=%d appendix="PTR_FORMAT"%s method_type="PTR_FORMAT"%s method="PTR_FORMAT" ",
291 invoke_code,
292 (intptr_t)appendix(), (has_appendix ? "" : " (unused)"),
293 (intptr_t)method_type(), (has_method_type ? "" : " (unused)"),
294 (intptr_t)adapter());
295 adapter->print();
296 if (has_appendix) appendix()->print();
297 }
299 // Method handle invokes and invokedynamic sites use both cp cache words.
300 // refs[f2], if not null, contains a value passed as a trailing argument to the adapter.
301 // In the general case, this could be the call site's MethodType,
302 // for use with java.lang.Invokers.checkExactType, or else a CallSite object.
303 // f1 contains the adapter method which manages the actual call.
304 // In the general case, this is a compiled LambdaForm.
305 // (The Java code is free to optimize these calls by binding other
306 // sorts of methods and appendices to call sites.)
307 // JVM-level linking is via f1, as if for invokespecial, and signatures are erased.
308 // The appendix argument (if any) is added to the signature, and is counted in the parameter_size bits.
309 // Even with the appendix, the method will never take more than 255 parameter slots.
310 //
311 // This means that given a call site like (List)mh.invoke("foo"),
312 // the f1 method has signature '(Ljl/Object;Ljl/invoke/MethodType;)Ljl/Object;',
313 // not '(Ljava/lang/String;)Ljava/util/List;'.
314 // The fact that String and List are involved is encoded in the MethodType in refs[f2].
315 // This allows us to create fewer method oops, while keeping type safety.
316 //
318 // Store appendix, if any.
319 if (has_appendix) {
320 const int appendix_index = f2_as_index() + _indy_resolved_references_appendix_offset;
321 assert(appendix_index >= 0 && appendix_index < resolved_references->length(), "oob");
322 assert(resolved_references->obj_at(appendix_index) == NULL, "init just once");
323 resolved_references->obj_at_put(appendix_index, appendix());
324 }
326 // Store MethodType, if any.
327 if (has_method_type) {
328 const int method_type_index = f2_as_index() + _indy_resolved_references_method_type_offset;
329 assert(method_type_index >= 0 && method_type_index < resolved_references->length(), "oob");
330 assert(resolved_references->obj_at(method_type_index) == NULL, "init just once");
331 resolved_references->obj_at_put(method_type_index, method_type());
332 }
334 release_set_f1(adapter()); // This must be the last one to set (see NOTE above)!
336 // The interpreter assembly code does not check byte_2,
337 // but it is used by is_resolved, method_if_resolved, etc.
338 set_bytecode_1(invoke_code);
339 NOT_PRODUCT(verify(tty));
340 if (TraceInvokeDynamic) {
341 this->print(tty, 0);
342 }
343 }
345 Method* ConstantPoolCacheEntry::method_if_resolved(constantPoolHandle cpool) {
346 // Decode the action of set_method and set_interface_call
347 Bytecodes::Code invoke_code = bytecode_1();
348 if (invoke_code != (Bytecodes::Code)0) {
349 Metadata* f1 = (Metadata*)_f1;
350 if (f1 != NULL) {
351 switch (invoke_code) {
352 case Bytecodes::_invokeinterface:
353 assert(f1->is_klass(), "");
354 return klassItable::method_for_itable_index((Klass*)f1, f2_as_index());
355 case Bytecodes::_invokestatic:
356 case Bytecodes::_invokespecial:
357 assert(!has_appendix(), "");
358 case Bytecodes::_invokehandle:
359 case Bytecodes::_invokedynamic:
360 assert(f1->is_method(), "");
361 return (Method*)f1;
362 }
363 }
364 }
365 invoke_code = bytecode_2();
366 if (invoke_code != (Bytecodes::Code)0) {
367 switch (invoke_code) {
368 case Bytecodes::_invokevirtual:
369 if (is_vfinal()) {
370 // invokevirtual
371 Method* m = f2_as_vfinal_method();
372 assert(m->is_method(), "");
373 return m;
374 } else {
375 int holder_index = cpool->uncached_klass_ref_index_at(constant_pool_index());
376 if (cpool->tag_at(holder_index).is_klass()) {
377 Klass* klass = cpool->resolved_klass_at(holder_index);
378 if (!Klass::cast(klass)->oop_is_instance())
379 klass = SystemDictionary::Object_klass();
380 return InstanceKlass::cast(klass)->method_at_vtable(f2_as_index());
381 }
382 }
383 break;
384 }
385 }
386 return NULL;
387 }
390 oop ConstantPoolCacheEntry::appendix_if_resolved(constantPoolHandle cpool) {
391 if (is_f1_null() || !has_appendix())
392 return NULL;
393 const int ref_index = f2_as_index() + _indy_resolved_references_appendix_offset;
394 objArrayOop resolved_references = cpool->resolved_references();
395 return resolved_references->obj_at(ref_index);
396 }
399 oop ConstantPoolCacheEntry::method_type_if_resolved(constantPoolHandle cpool) {
400 if (is_f1_null() || !has_method_type())
401 return NULL;
402 const int ref_index = f2_as_index() + _indy_resolved_references_method_type_offset;
403 objArrayOop resolved_references = cpool->resolved_references();
404 return resolved_references->obj_at(ref_index);
405 }
408 // RedefineClasses() API support:
409 // If this constantPoolCacheEntry refers to old_method then update it
410 // to refer to new_method.
411 bool ConstantPoolCacheEntry::adjust_method_entry(Method* old_method,
412 Method* new_method, bool * trace_name_printed) {
414 if (is_vfinal()) {
415 // virtual and final so _f2 contains method ptr instead of vtable index
416 if (f2_as_vfinal_method() == old_method) {
417 // match old_method so need an update
418 // NOTE: can't use set_f2_as_vfinal_method as it asserts on different values
419 _f2 = (intptr_t)new_method;
420 if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) {
421 if (!(*trace_name_printed)) {
422 // RC_TRACE_MESG macro has an embedded ResourceMark
423 RC_TRACE_MESG(("adjust: name=%s",
424 old_method->method_holder()->external_name()));
425 *trace_name_printed = true;
426 }
427 // RC_TRACE macro has an embedded ResourceMark
428 RC_TRACE(0x00400000, ("cpc vf-entry update: %s(%s)",
429 new_method->name()->as_C_string(),
430 new_method->signature()->as_C_string()));
431 }
433 return true;
434 }
436 // f1() is not used with virtual entries so bail out
437 return false;
438 }
440 if (_f1 == NULL) {
441 // NULL f1() means this is a virtual entry so bail out
442 // We are assuming that the vtable index does not need change.
443 return false;
444 }
446 if (_f1 == old_method) {
447 _f1 = new_method;
448 if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) {
449 if (!(*trace_name_printed)) {
450 // RC_TRACE_MESG macro has an embedded ResourceMark
451 RC_TRACE_MESG(("adjust: name=%s",
452 old_method->method_holder()->external_name()));
453 *trace_name_printed = true;
454 }
455 // RC_TRACE macro has an embedded ResourceMark
456 RC_TRACE(0x00400000, ("cpc entry update: %s(%s)",
457 new_method->name()->as_C_string(),
458 new_method->signature()->as_C_string()));
459 }
461 return true;
462 }
464 return false;
465 }
467 #ifndef PRODUCT
468 bool ConstantPoolCacheEntry::check_no_old_entries() {
469 if (is_vfinal()) {
470 Metadata* f2 = (Metadata*)_f2;
471 return (f2->is_valid() && f2->is_method() && !((Method*)f2)->is_old());
472 } else {
473 return (_f1 == NULL || (_f1->is_valid() && _f1->is_method() && !((Method*)_f1)->is_old()));
474 }
475 }
476 #endif
478 bool ConstantPoolCacheEntry::is_interesting_method_entry(Klass* k) {
479 if (!is_method_entry()) {
480 // not a method entry so not interesting by default
481 return false;
482 }
484 Method* m = NULL;
485 if (is_vfinal()) {
486 // virtual and final so _f2 contains method ptr instead of vtable index
487 m = f2_as_vfinal_method();
488 } else if (is_f1_null()) {
489 // NULL _f1 means this is a virtual entry so also not interesting
490 return false;
491 } else {
492 if (!(_f1->is_method())) {
493 // _f1 can also contain a Klass* for an interface
494 return false;
495 }
496 m = f1_as_method();
497 }
499 assert(m != NULL && m->is_method(), "sanity check");
500 if (m == NULL || !m->is_method() || (k != NULL && m->method_holder() != k)) {
501 // robustness for above sanity checks or method is not in
502 // the interesting class
503 return false;
504 }
506 // the method is in the interesting class so the entry is interesting
507 return true;
508 }
510 void ConstantPoolCacheEntry::print(outputStream* st, int index) const {
511 // print separator
512 if (index == 0) st->print_cr(" -------------");
513 // print entry
514 st->print("%3d ("PTR_FORMAT") ", index, (intptr_t)this);
515 st->print_cr("[%02x|%02x|%5d]", bytecode_2(), bytecode_1(), constant_pool_index());
516 st->print_cr(" [ "PTR_FORMAT"]", (intptr_t)_f1);
517 st->print_cr(" [ "PTR_FORMAT"]", (intptr_t)_f2);
518 st->print_cr(" [ "PTR_FORMAT"]", (intptr_t)_flags);
519 st->print_cr(" -------------");
520 }
522 void ConstantPoolCacheEntry::verify(outputStream* st) const {
523 // not implemented yet
524 }
526 // Implementation of ConstantPoolCache
528 ConstantPoolCache* ConstantPoolCache::allocate(ClassLoaderData* loader_data, int length, TRAPS) {
529 int size = ConstantPoolCache::size(length);
531 return new (loader_data, size, false, THREAD) ConstantPoolCache(length);
532 }
534 void ConstantPoolCache::initialize(intArray& inverse_index_map, intArray& invokedynamic_references_map) {
535 assert(inverse_index_map.length() == length(), "inverse index map must have same length as cache");
536 for (int i = 0; i < length(); i++) {
537 ConstantPoolCacheEntry* e = entry_at(i);
538 int original_index = inverse_index_map[i];
539 e->initialize_entry(original_index);
540 assert(entry_at(i) == e, "sanity");
541 }
542 for (int ref = 0; ref < invokedynamic_references_map.length(); ref++) {
543 const int cpci = invokedynamic_references_map[ref];
544 if (cpci >= 0) {
545 #ifdef ASSERT
546 // invokedynamic and invokehandle have more entries; check if they
547 // all point to the same constant pool cache entry.
548 for (int entry = 1; entry < ConstantPoolCacheEntry::_indy_resolved_references_entries; entry++) {
549 const int cpci_next = invokedynamic_references_map[ref + entry];
550 assert(cpci == cpci_next, err_msg_res("%d == %d", cpci, cpci_next));
551 }
552 #endif
553 entry_at(cpci)->initialize_resolved_reference_index(ref);
554 ref += ConstantPoolCacheEntry::_indy_resolved_references_entries - 1; // skip extra entries
555 }
556 }
557 }
559 // RedefineClasses() API support:
560 // If any entry of this constantPoolCache points to any of
561 // old_methods, replace it with the corresponding new_method.
562 void ConstantPoolCache::adjust_method_entries(Method** old_methods, Method** new_methods,
563 int methods_length, bool * trace_name_printed) {
565 if (methods_length == 0) {
566 // nothing to do if there are no methods
567 return;
568 }
570 // get shorthand for the interesting class
571 Klass* old_holder = old_methods[0]->method_holder();
573 for (int i = 0; i < length(); i++) {
574 if (!entry_at(i)->is_interesting_method_entry(old_holder)) {
575 // skip uninteresting methods
576 continue;
577 }
579 // The constantPoolCache contains entries for several different
580 // things, but we only care about methods. In fact, we only care
581 // about methods in the same class as the one that contains the
582 // old_methods. At this point, we have an interesting entry.
584 for (int j = 0; j < methods_length; j++) {
585 Method* old_method = old_methods[j];
586 Method* new_method = new_methods[j];
588 if (entry_at(i)->adjust_method_entry(old_method, new_method,
589 trace_name_printed)) {
590 // current old_method matched this entry and we updated it so
591 // break out and get to the next interesting entry if there one
592 break;
593 }
594 }
595 }
596 }
598 #ifndef PRODUCT
599 bool ConstantPoolCache::check_no_old_entries() {
600 for (int i = 1; i < length(); i++) {
601 if (entry_at(i)->is_interesting_method_entry(NULL) &&
602 !entry_at(i)->check_no_old_entries()) {
603 return false;
604 }
605 }
606 return true;
607 }
608 #endif // PRODUCT
611 // Printing
613 void ConstantPoolCache::print_on(outputStream* st) const {
614 assert(is_constantPoolCache(), "obj must be constant pool cache");
615 st->print_cr(internal_name());
616 // print constant pool cache entries
617 for (int i = 0; i < length(); i++) entry_at(i)->print(st, i);
618 }
620 void ConstantPoolCache::print_value_on(outputStream* st) const {
621 assert(is_constantPoolCache(), "obj must be constant pool cache");
622 st->print("cache [%d]", length());
623 print_address_on(st);
624 st->print(" for ");
625 constant_pool()->print_value_on(st);
626 }
629 // Verification
631 void ConstantPoolCache::verify_on(outputStream* st) {
632 guarantee(is_constantPoolCache(), "obj must be constant pool cache");
633 // print constant pool cache entries
634 for (int i = 0; i < length(); i++) entry_at(i)->verify(st);
635 }