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