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