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