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