1 /*
2 * Copyright (c) 1998, 2016, 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 */
24
25 #include "precompiled.hpp"
26 #include "interpreter/interpreter.hpp"
27 #include "interpreter/rewriter.hpp"
28 #include "memory/universe.inline.hpp"
29 #include "oops/cpCache.hpp"
30 #include "oops/objArrayOop.inline.hpp"
31 #include "oops/oop.inline.hpp"
32 #include "prims/jvmtiRedefineClassesTrace.hpp"
33 #include "prims/methodHandles.hpp"
34 #include "runtime/atomic.inline.hpp"
35 #include "runtime/handles.inline.hpp"
36 #include "runtime/orderAccess.inline.hpp"
37 #include "utilities/macros.hpp"
38
39 // Implementation of ConstantPoolCacheEntry
40
41 void ConstantPoolCacheEntry::initialize_entry(int index) {
42 assert(0 < index && index < 0x10000, "sanity check");
43 _indices = index;
44 _f1 = NULL;
45 _f2 = _flags = 0;
46 assert(constant_pool_index() == index, "");
47 }
48
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 }
63
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 }
73
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 }
83
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 }
89
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 }
95
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 }
122
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 "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 "size must not change: parameter_size=%d, value=%d", parameter_size(), value);
138 }
139
140 void ConstantPoolCacheEntry::set_direct_or_vtable_call(Bytecodes::Code invoke_code,
141 methodHandle method,
142 int vtable_index) {
143 bool is_vtable_call = (vtable_index >= 0); // FIXME: split this method on this boolean
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");
146
147 int byte_no = -1;
148 bool change_to_virtual = false;
149
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;
157
158 // ...and fall through as if we were handling invokevirtual:
159 case Bytecodes::_invokevirtual:
160 {
161 if (!is_vtable_call) {
162 assert(method->can_be_statically_bound(), "");
163 // set_f2_as_vfinal_method checks if is_vfinal flag is true.
164 set_method_flags(as_TosState(method->result_type()),
165 ( 1 << is_vfinal_shift) |
166 ((method->is_final_method() ? 1 : 0) << is_final_shift) |
167 ((change_to_virtual ? 1 : 0) << is_forced_virtual_shift),
168 method()->size_of_parameters());
169 set_f2_as_vfinal_method(method());
170 } else {
171 assert(!method->can_be_statically_bound(), "");
172 assert(vtable_index >= 0, "valid index");
173 assert(!method->is_final_method(), "sanity");
174 set_method_flags(as_TosState(method->result_type()),
175 ((change_to_virtual ? 1 : 0) << is_forced_virtual_shift),
176 method()->size_of_parameters());
177 set_f2(vtable_index);
178 }
179 byte_no = 2;
180 break;
181 }
182
183 case Bytecodes::_invokespecial:
184 case Bytecodes::_invokestatic:
185 assert(!is_vtable_call, "");
186 // Note: Read and preserve the value of the is_vfinal flag on any
187 // invokevirtual bytecode shared with this constant pool cache entry.
188 // It is cheap and safe to consult is_vfinal() at all times.
189 // Once is_vfinal is set, it must stay that way, lest we get a dangling oop.
190 set_method_flags(as_TosState(method->result_type()),
191 ((is_vfinal() ? 1 : 0) << is_vfinal_shift) |
192 ((method->is_final_method() ? 1 : 0) << is_final_shift),
193 method()->size_of_parameters());
194 set_f1(method());
195 byte_no = 1;
196 break;
197 default:
198 ShouldNotReachHere();
199 break;
200 }
201
202 // Note: byte_no also appears in TemplateTable::resolve.
203 if (byte_no == 1) {
204 assert(invoke_code != Bytecodes::_invokevirtual &&
205 invoke_code != Bytecodes::_invokeinterface, "");
206 set_bytecode_1(invoke_code);
207 } else if (byte_no == 2) {
208 if (change_to_virtual) {
209 assert(invoke_code == Bytecodes::_invokeinterface, "");
210 // NOTE: THIS IS A HACK - BE VERY CAREFUL!!!
211 //
212 // Workaround for the case where we encounter an invokeinterface, but we
213 // should really have an _invokevirtual since the resolved method is a
214 // virtual method in java.lang.Object. This is a corner case in the spec
215 // but is presumably legal. javac does not generate this code.
216 //
217 // We set bytecode_1() to _invokeinterface, because that is the
218 // bytecode # used by the interpreter to see if it is resolved.
219 // We set bytecode_2() to _invokevirtual.
220 // See also interpreterRuntime.cpp. (8/25/2000)
221 // Only set resolved for the invokeinterface case if method is public.
222 // Otherwise, the method needs to be reresolved with caller for each
223 // interface call.
224 if (method->is_public()) set_bytecode_1(invoke_code);
225 } else {
226 assert(invoke_code == Bytecodes::_invokevirtual, "");
227 }
228 // set up for invokevirtual, even if linking for invokeinterface also:
229 set_bytecode_2(Bytecodes::_invokevirtual);
230 } else {
231 ShouldNotReachHere();
232 }
233 NOT_PRODUCT(verify(tty));
234 }
235
236 void ConstantPoolCacheEntry::set_direct_call(Bytecodes::Code invoke_code, methodHandle method) {
237 int index = Method::nonvirtual_vtable_index;
238 // index < 0; FIXME: inline and customize set_direct_or_vtable_call
239 set_direct_or_vtable_call(invoke_code, method, index);
240 }
241
242 void ConstantPoolCacheEntry::set_vtable_call(Bytecodes::Code invoke_code, methodHandle method, int index) {
243 // either the method is a miranda or its holder should accept the given index
244 assert(method->method_holder()->is_interface() || method->method_holder()->verify_vtable_index(index), "");
245 // index >= 0; FIXME: inline and customize set_direct_or_vtable_call
246 set_direct_or_vtable_call(invoke_code, method, index);
247 }
248
249 void ConstantPoolCacheEntry::set_itable_call(Bytecodes::Code invoke_code, const methodHandle& method, int index) {
250 assert(method->method_holder()->verify_itable_index(index), "");
251 assert(invoke_code == Bytecodes::_invokeinterface, "");
252 InstanceKlass* interf = method->method_holder();
253 assert(interf->is_interface(), "must be an interface");
254 assert(!method->is_final_method(), "interfaces do not have final methods; cannot link to one here");
255 set_f1(interf);
256 set_f2(index);
257 set_method_flags(as_TosState(method->result_type()),
258 0, // no option bits
259 method()->size_of_parameters());
260 set_bytecode_1(Bytecodes::_invokeinterface);
261 }
262
263
264 void ConstantPoolCacheEntry::set_method_handle(const constantPoolHandle& cpool, const CallInfo &call_info) {
265 set_method_handle_common(cpool, Bytecodes::_invokehandle, call_info);
266 }
267
268 void ConstantPoolCacheEntry::set_dynamic_call(const constantPoolHandle& cpool, const CallInfo &call_info) {
269 set_method_handle_common(cpool, Bytecodes::_invokedynamic, call_info);
270 }
271
272 void ConstantPoolCacheEntry::set_method_handle_common(const constantPoolHandle& cpool,
273 Bytecodes::Code invoke_code,
274 const CallInfo &call_info) {
275 // NOTE: This CPCE can be the subject of data races.
276 // There are three words to update: flags, refs[f2], f1 (in that order).
277 // Writers must store all other values before f1.
278 // Readers must test f1 first for non-null before reading other fields.
279 // Competing writers must acquire exclusive access via a lock.
280 // A losing writer waits on the lock until the winner writes f1 and leaves
281 // the lock, so that when the losing writer returns, he can use the linked
282 // cache entry.
283
284 objArrayHandle resolved_references = cpool->resolved_references();
285 // Use the resolved_references() lock for this cpCache entry.
286 // resolved_references are created for all classes with Invokedynamic, MethodHandle
287 // or MethodType constant pool cache entries.
288 assert(resolved_references() != NULL,
289 "a resolved_references array should have been created for this class");
290 ObjectLocker ol(resolved_references, Thread::current());
291 if (!is_f1_null()) {
292 return;
293 }
294
295 const methodHandle adapter = call_info.resolved_method();
296 const Handle appendix = call_info.resolved_appendix();
297 const Handle method_type = call_info.resolved_method_type();
298 const bool has_appendix = appendix.not_null();
299 const bool has_method_type = method_type.not_null();
300
301 // Write the flags.
302 set_method_flags(as_TosState(adapter->result_type()),
303 ((has_appendix ? 1 : 0) << has_appendix_shift ) |
304 ((has_method_type ? 1 : 0) << has_method_type_shift) |
305 ( 1 << is_final_shift ),
306 adapter->size_of_parameters());
307
308 if (TraceInvokeDynamic) {
309 ttyLocker ttyl;
310 tty->print_cr("set_method_handle bc=%d appendix=" PTR_FORMAT "%s method_type=" PTR_FORMAT "%s method=" PTR_FORMAT " ",
311 invoke_code,
312 p2i(appendix()), (has_appendix ? "" : " (unused)"),
313 p2i(method_type()), (has_method_type ? "" : " (unused)"),
314 p2i(adapter()));
315 adapter->print();
316 if (has_appendix) appendix()->print();
317 }
318
319 // Method handle invokes and invokedynamic sites use both cp cache words.
320 // refs[f2], if not null, contains a value passed as a trailing argument to the adapter.
321 // In the general case, this could be the call site's MethodType,
322 // for use with java.lang.Invokers.checkExactType, or else a CallSite object.
323 // f1 contains the adapter method which manages the actual call.
324 // In the general case, this is a compiled LambdaForm.
325 // (The Java code is free to optimize these calls by binding other
326 // sorts of methods and appendices to call sites.)
327 // JVM-level linking is via f1, as if for invokespecial, and signatures are erased.
328 // The appendix argument (if any) is added to the signature, and is counted in the parameter_size bits.
329 // Even with the appendix, the method will never take more than 255 parameter slots.
330 //
331 // This means that given a call site like (List)mh.invoke("foo"),
332 // the f1 method has signature '(Ljl/Object;Ljl/invoke/MethodType;)Ljl/Object;',
333 // not '(Ljava/lang/String;)Ljava/util/List;'.
334 // The fact that String and List are involved is encoded in the MethodType in refs[f2].
335 // This allows us to create fewer Methods, while keeping type safety.
336 //
337
338 // Store appendix, if any.
339 if (has_appendix) {
340 const int appendix_index = f2_as_index() + _indy_resolved_references_appendix_offset;
341 assert(appendix_index >= 0 && appendix_index < resolved_references->length(), "oob");
342 assert(resolved_references->obj_at(appendix_index) == NULL, "init just once");
343 resolved_references->obj_at_put(appendix_index, appendix());
344 }
345
346 // Store MethodType, if any.
347 if (has_method_type) {
348 const int method_type_index = f2_as_index() + _indy_resolved_references_method_type_offset;
349 assert(method_type_index >= 0 && method_type_index < resolved_references->length(), "oob");
350 assert(resolved_references->obj_at(method_type_index) == NULL, "init just once");
351 resolved_references->obj_at_put(method_type_index, method_type());
352 }
353
354 release_set_f1(adapter()); // This must be the last one to set (see NOTE above)!
355
356 // The interpreter assembly code does not check byte_2,
357 // but it is used by is_resolved, method_if_resolved, etc.
358 set_bytecode_1(invoke_code);
359 NOT_PRODUCT(verify(tty));
360 if (TraceInvokeDynamic) {
361 ttyLocker ttyl;
362 this->print(tty, 0);
363 }
364 }
365
366 Method* ConstantPoolCacheEntry::method_if_resolved(const constantPoolHandle& cpool) {
367 // Decode the action of set_method and set_interface_call
368 Bytecodes::Code invoke_code = bytecode_1();
369 if (invoke_code != (Bytecodes::Code)0) {
370 Metadata* f1 = f1_ord();
371 if (f1 != NULL) {
372 switch (invoke_code) {
373 case Bytecodes::_invokeinterface:
374 assert(f1->is_klass(), "");
375 return klassItable::method_for_itable_index((Klass*)f1, f2_as_index());
376 case Bytecodes::_invokestatic:
377 case Bytecodes::_invokespecial:
378 assert(!has_appendix(), "");
379 case Bytecodes::_invokehandle:
380 case Bytecodes::_invokedynamic:
381 assert(f1->is_method(), "");
382 return (Method*)f1;
383 }
384 }
385 }
386 invoke_code = bytecode_2();
387 if (invoke_code != (Bytecodes::Code)0) {
388 switch (invoke_code) {
389 case Bytecodes::_invokevirtual:
390 if (is_vfinal()) {
391 // invokevirtual
392 Method* m = f2_as_vfinal_method();
393 assert(m->is_method(), "");
394 return m;
395 } else {
396 int holder_index = cpool->uncached_klass_ref_index_at(constant_pool_index());
397 if (cpool->tag_at(holder_index).is_klass()) {
398 Klass* klass = cpool->resolved_klass_at(holder_index);
399 return klass->method_at_vtable(f2_as_index());
400 }
401 }
402 break;
403 }
404 }
405 return NULL;
406 }
407
408
409 oop ConstantPoolCacheEntry::appendix_if_resolved(const constantPoolHandle& cpool) {
410 if (!has_appendix())
411 return NULL;
412 const int ref_index = f2_as_index() + _indy_resolved_references_appendix_offset;
413 objArrayOop resolved_references = cpool->resolved_references();
414 return resolved_references->obj_at(ref_index);
415 }
416
417
418 oop ConstantPoolCacheEntry::method_type_if_resolved(const constantPoolHandle& cpool) {
419 if (!has_method_type())
420 return NULL;
421 const int ref_index = f2_as_index() + _indy_resolved_references_method_type_offset;
422 objArrayOop resolved_references = cpool->resolved_references();
423 return resolved_references->obj_at(ref_index);
424 }
425
426
427 #if INCLUDE_JVMTI
428 // RedefineClasses() API support:
429 // If this ConstantPoolCacheEntry refers to old_method then update it
430 // to refer to new_method.
431 bool ConstantPoolCacheEntry::adjust_method_entry(Method* old_method,
432 Method* new_method, bool * trace_name_printed) {
433
434 if (is_vfinal()) {
435 // virtual and final so _f2 contains method ptr instead of vtable index
436 if (f2_as_vfinal_method() == old_method) {
437 // match old_method so need an update
438 // NOTE: can't use set_f2_as_vfinal_method as it asserts on different values
439 _f2 = (intptr_t)new_method;
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 vf-entry update: %s(%s)",
449 new_method->name()->as_C_string(),
450 new_method->signature()->as_C_string()));
451 }
452 return true;
453 }
454
455 // f1() is not used with virtual entries so bail out
456 return false;
457 }
458
459 if (_f1 == NULL) {
460 // NULL f1() means this is a virtual entry so bail out
461 // We are assuming that the vtable index does not need change.
462 return false;
463 }
464
465 if (_f1 == old_method) {
466 _f1 = new_method;
467 if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) {
468 if (!(*trace_name_printed)) {
469 // RC_TRACE_MESG macro has an embedded ResourceMark
470 RC_TRACE_MESG(("adjust: name=%s",
471 old_method->method_holder()->external_name()));
472 *trace_name_printed = true;
473 }
474 // RC_TRACE macro has an embedded ResourceMark
475 RC_TRACE(0x00400000, ("cpc entry update: %s(%s)",
476 new_method->name()->as_C_string(),
477 new_method->signature()->as_C_string()));
478 }
479 return true;
480 }
481
482 return false;
483 }
484
485 // a constant pool cache entry should never contain old or obsolete methods
486 bool ConstantPoolCacheEntry::check_no_old_or_obsolete_entries() {
487 if (is_vfinal()) {
488 // virtual and final so _f2 contains method ptr instead of vtable index
489 Metadata* f2 = (Metadata*)_f2;
490 // Return false if _f2 refers to an old or an obsolete method.
491 // _f2 == NULL || !_f2->is_method() are just as unexpected here.
492 return (f2 != NULL NOT_PRODUCT(&& f2->is_valid()) && f2->is_method() &&
493 !((Method*)f2)->is_old() && !((Method*)f2)->is_obsolete());
494 } else if (_f1 == NULL ||
495 (NOT_PRODUCT(_f1->is_valid() &&) !_f1->is_method())) {
496 // _f1 == NULL || !_f1->is_method() are OK here
497 return true;
498 }
499 // return false if _f1 refers to a non-deleted old or obsolete method
500 return (NOT_PRODUCT(_f1->is_valid() &&) _f1->is_method() &&
501 (f1_as_method()->is_deleted() ||
502 (!f1_as_method()->is_old() && !f1_as_method()->is_obsolete())));
503 }
504
505 Method* ConstantPoolCacheEntry::get_interesting_method_entry(Klass* k) {
506 if (!is_method_entry()) {
507 // not a method entry so not interesting by default
508 return NULL;
509 }
510 Method* m = NULL;
511 if (is_vfinal()) {
512 // virtual and final so _f2 contains method ptr instead of vtable index
513 m = f2_as_vfinal_method();
514 } else if (is_f1_null()) {
515 // NULL _f1 means this is a virtual entry so also not interesting
516 return NULL;
517 } else {
518 if (!(_f1->is_method())) {
519 // _f1 can also contain a Klass* for an interface
520 return NULL;
521 }
522 m = f1_as_method();
523 }
524 assert(m != NULL && m->is_method(), "sanity check");
525 if (m == NULL || !m->is_method() || (k != NULL && m->method_holder() != k)) {
526 // robustness for above sanity checks or method is not in
527 // the interesting class
528 return NULL;
529 }
530 // the method is in the interesting class so the entry is interesting
531 return m;
532 }
533 #endif // INCLUDE_JVMTI
534
535 void ConstantPoolCacheEntry::print(outputStream* st, int index) const {
536 // print separator
537 if (index == 0) st->print_cr(" -------------");
538 // print entry
539 st->print("%3d (" PTR_FORMAT ") ", index, (intptr_t)this);
540 st->print_cr("[%02x|%02x|%5d]", bytecode_2(), bytecode_1(),
541 constant_pool_index());
542 st->print_cr(" [ " PTR_FORMAT "]", (intptr_t)_f1);
543 st->print_cr(" [ " PTR_FORMAT "]", (intptr_t)_f2);
544 st->print_cr(" [ " PTR_FORMAT "]", (intptr_t)_flags);
545 st->print_cr(" -------------");
546 }
547
548 void ConstantPoolCacheEntry::verify(outputStream* st) const {
549 // not implemented yet
550 }
551
552 // Implementation of ConstantPoolCache
553
554 ConstantPoolCache* ConstantPoolCache::allocate(ClassLoaderData* loader_data,
555 const intStack& index_map,
556 const intStack& invokedynamic_index_map,
557 const intStack& invokedynamic_map, TRAPS) {
558
559 const int length = index_map.length() + invokedynamic_index_map.length();
560 int size = ConstantPoolCache::size(length);
561
562 return new (loader_data, size, false, MetaspaceObj::ConstantPoolCacheType, THREAD)
563 ConstantPoolCache(length, index_map, invokedynamic_index_map, invokedynamic_map);
564 }
565
566 void ConstantPoolCache::initialize(const intArray& inverse_index_map,
567 const intArray& invokedynamic_inverse_index_map,
568 const intArray& invokedynamic_references_map) {
569 for (int i = 0; i < inverse_index_map.length(); i++) {
570 ConstantPoolCacheEntry* e = entry_at(i);
571 int original_index = inverse_index_map.at(i);
572 e->initialize_entry(original_index);
573 assert(entry_at(i) == e, "sanity");
574 }
575
576 // Append invokedynamic entries at the end
577 int invokedynamic_offset = inverse_index_map.length();
578 for (int i = 0; i < invokedynamic_inverse_index_map.length(); i++) {
579 int offset = i + invokedynamic_offset;
580 ConstantPoolCacheEntry* e = entry_at(offset);
581 int original_index = invokedynamic_inverse_index_map.at(i);
582 e->initialize_entry(original_index);
583 assert(entry_at(offset) == e, "sanity");
584 }
585
586 for (int ref = 0; ref < invokedynamic_references_map.length(); ref++) {
587 const int cpci = invokedynamic_references_map.at(ref);
588 if (cpci >= 0) {
589 #ifdef ASSERT
590 // invokedynamic and invokehandle have more entries; check if they
591 // all point to the same constant pool cache entry.
592 for (int entry = 1; entry < ConstantPoolCacheEntry::_indy_resolved_references_entries; entry++) {
593 const int cpci_next = invokedynamic_references_map.at(ref + entry);
594 assert(cpci == cpci_next, "%d == %d", cpci, cpci_next);
595 }
596 #endif
597 entry_at(cpci)->initialize_resolved_reference_index(ref);
598 ref += ConstantPoolCacheEntry::_indy_resolved_references_entries - 1; // skip extra entries
599 }
600 }
601 }
602
603 #if INCLUDE_JVMTI
604 // RedefineClasses() API support:
605 // If any entry of this ConstantPoolCache points to any of
606 // old_methods, replace it with the corresponding new_method.
607 void ConstantPoolCache::adjust_method_entries(InstanceKlass* holder, bool * trace_name_printed) {
608 for (int i = 0; i < length(); i++) {
609 ConstantPoolCacheEntry* entry = entry_at(i);
610 Method* old_method = entry->get_interesting_method_entry(holder);
611 if (old_method == NULL || !old_method->is_old()) {
612 continue; // skip uninteresting entries
613 }
614 if (old_method->is_deleted()) {
615 // clean up entries with deleted methods
616 entry->initialize_entry(entry->constant_pool_index());
617 continue;
618 }
619 Method* new_method = holder->method_with_idnum(old_method->orig_method_idnum());
620
621 assert(new_method != NULL, "method_with_idnum() should not be NULL");
622 assert(old_method != new_method, "sanity check");
623
624 entry_at(i)->adjust_method_entry(old_method, new_method, trace_name_printed);
625 }
626 }
627
628 // the constant pool cache should never contain old or obsolete methods
629 bool ConstantPoolCache::check_no_old_or_obsolete_entries() {
630 for (int i = 1; i < length(); i++) {
631 if (entry_at(i)->get_interesting_method_entry(NULL) != NULL &&
632 !entry_at(i)->check_no_old_or_obsolete_entries()) {
633 return false;
634 }
635 }
636 return true;
637 }
638
639 void ConstantPoolCache::dump_cache() {
640 for (int i = 1; i < length(); i++) {
641 if (entry_at(i)->get_interesting_method_entry(NULL) != NULL) {
642 entry_at(i)->print(tty, i);
643 }
644 }
645 }
646 #endif // INCLUDE_JVMTI
647
648
649 // Printing
650
651 void ConstantPoolCache::print_on(outputStream* st) const {
652 assert(is_constantPoolCache(), "obj must be constant pool cache");
653 st->print_cr("%s", internal_name());
654 // print constant pool cache entries
655 for (int i = 0; i < length(); i++) entry_at(i)->print(st, i);
656 }
657
658 void ConstantPoolCache::print_value_on(outputStream* st) const {
659 assert(is_constantPoolCache(), "obj must be constant pool cache");
660 st->print("cache [%d]", length());
661 print_address_on(st);
662 st->print(" for ");
663 constant_pool()->print_value_on(st);
664 }
665
666
667 // Verification
668
669 void ConstantPoolCache::verify_on(outputStream* st) {
670 guarantee(is_constantPoolCache(), "obj must be constant pool cache");
671 // print constant pool cache entries
672 for (int i = 0; i < length(); i++) entry_at(i)->verify(st);
673 }