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