1 /* 2 * Copyright (c) 1998, 2019, 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 "classfile/resolutionErrors.hpp" 27 #include "interpreter/bytecodeStream.hpp" 28 #include "interpreter/bytecodes.hpp" 29 #include "interpreter/interpreter.hpp" 30 #include "interpreter/linkResolver.hpp" 31 #include "interpreter/rewriter.hpp" 32 #include "logging/log.hpp" 33 #include "memory/heapShared.hpp" 34 #include "memory/metadataFactory.hpp" 35 #include "memory/metaspaceClosure.hpp" 36 #include "memory/metaspaceShared.hpp" 37 #include "memory/resourceArea.hpp" 38 #include "memory/universe.hpp" 39 #include "oops/access.inline.hpp" 40 #include "oops/constantPool.inline.hpp" 41 #include "oops/cpCache.inline.hpp" 42 #include "oops/objArrayOop.inline.hpp" 43 #include "oops/oop.inline.hpp" 44 #include "prims/methodHandles.hpp" 45 #include "runtime/atomic.hpp" 46 #include "runtime/handles.inline.hpp" 47 #include "runtime/orderAccess.hpp" 48 #include "utilities/macros.hpp" 49 50 // Implementation of ConstantPoolCacheEntry 51 52 void ConstantPoolCacheEntry::initialize_entry(int index) { 53 assert(0 < index && index < 0x10000, "sanity check"); 54 _indices = index; 55 _f1 = NULL; 56 _f2 = _flags = 0; 57 assert(constant_pool_index() == index, ""); 58 } 59 60 void ConstantPoolCacheEntry::verify_just_initialized(bool f2_used) { 61 assert((_indices & (~cp_index_mask)) == 0, "sanity"); 62 assert(_f1 == NULL, "sanity"); 63 assert(_flags == 0, "sanity"); 64 if (!f2_used) { 65 assert(_f2 == 0, "sanity"); 66 } 67 } 68 69 void ConstantPoolCacheEntry::reinitialize(bool f2_used) { 70 _indices &= cp_index_mask; 71 _f1 = NULL; 72 _flags = 0; 73 if (!f2_used) { 74 _f2 = 0; 75 } 76 } 77 78 int ConstantPoolCacheEntry::make_flags(TosState state, 79 int option_bits, 80 int field_index_or_method_params) { 81 assert(state < number_of_states, "Invalid state in make_flags"); 82 int f = ((int)state << tos_state_shift) | option_bits | field_index_or_method_params; 83 // Preserve existing flag bit values 84 // The low bits are a field offset, or else the method parameter size. 85 #ifdef ASSERT 86 TosState old_state = flag_state(); 87 assert(old_state == (TosState)0 || old_state == state, 88 "inconsistent cpCache flags state"); 89 #endif 90 return (_flags | f) ; 91 } 92 93 void ConstantPoolCacheEntry::set_bytecode_1(Bytecodes::Code code) { 94 #ifdef ASSERT 95 // Read once. 96 volatile Bytecodes::Code c = bytecode_1(); 97 assert(c == 0 || c == code || code == 0, "update must be consistent"); 98 #endif 99 // Need to flush pending stores here before bytecode is written. 100 OrderAccess::release_store(&_indices, _indices | ((u_char)code << bytecode_1_shift)); 101 } 102 103 void ConstantPoolCacheEntry::set_bytecode_2(Bytecodes::Code code) { 104 #ifdef ASSERT 105 // Read once. 106 volatile Bytecodes::Code c = bytecode_2(); 107 assert(c == 0 || c == code || code == 0, "update must be consistent"); 108 #endif 109 // Need to flush pending stores here before bytecode is written. 110 OrderAccess::release_store(&_indices, _indices | ((u_char)code << bytecode_2_shift)); 111 } 112 113 // Sets f1, ordering with previous writes. 114 void ConstantPoolCacheEntry::release_set_f1(Metadata* f1) { 115 assert(f1 != NULL, ""); 116 OrderAccess::release_store(&_f1, f1); 117 } 118 119 void ConstantPoolCacheEntry::set_indy_resolution_failed() { 120 OrderAccess::release_store(&_flags, _flags | (1 << indy_resolution_failed_shift)); 121 } 122 123 // Note that concurrent update of both bytecodes can leave one of them 124 // reset to zero. This is harmless; the interpreter will simply re-resolve 125 // the damaged entry. More seriously, the memory synchronization is needed 126 // to flush other fields (f1, f2) completely to memory before the bytecodes 127 // are updated, lest other processors see a non-zero bytecode but zero f1/f2. 128 void ConstantPoolCacheEntry::set_field(Bytecodes::Code get_code, 129 Bytecodes::Code put_code, 130 Klass* field_holder, 131 int field_index, 132 int field_offset, 133 TosState field_type, 134 bool is_final, 135 bool is_volatile, 136 Klass* root_klass) { 137 set_f1(field_holder); 138 set_f2(field_offset); 139 assert((field_index & field_index_mask) == field_index, 140 "field index does not fit in low flag bits"); 141 set_field_flags(field_type, 142 ((is_volatile ? 1 : 0) << is_volatile_shift) | 143 ((is_final ? 1 : 0) << is_final_shift), 144 field_index); 145 set_bytecode_1(get_code); 146 set_bytecode_2(put_code); 147 NOT_PRODUCT(verify(tty)); 148 } 149 150 void ConstantPoolCacheEntry::set_parameter_size(int value) { 151 // This routine is called only in corner cases where the CPCE is not yet initialized. 152 // See AbstractInterpreter::deopt_continue_after_entry. 153 assert(_flags == 0 || parameter_size() == 0 || parameter_size() == value, 154 "size must not change: parameter_size=%d, value=%d", parameter_size(), value); 155 // Setting the parameter size by itself is only safe if the 156 // current value of _flags is 0, otherwise another thread may have 157 // updated it and we don't want to overwrite that value. Don't 158 // bother trying to update it once it's nonzero but always make 159 // sure that the final parameter size agrees with what was passed. 160 if (_flags == 0) { 161 intx newflags = (value & parameter_size_mask); 162 Atomic::cmpxchg(newflags, &_flags, (intx)0); 163 } 164 guarantee(parameter_size() == value, 165 "size must not change: parameter_size=%d, value=%d", parameter_size(), value); 166 } 167 168 void ConstantPoolCacheEntry::set_direct_or_vtable_call(Bytecodes::Code invoke_code, 169 const methodHandle& method, 170 int vtable_index, 171 bool sender_is_interface) { 172 bool is_vtable_call = (vtable_index >= 0); // FIXME: split this method on this boolean 173 assert(method->interpreter_entry() != NULL, "should have been set at this point"); 174 assert(!method->is_obsolete(), "attempt to write obsolete method to cpCache"); 175 176 int byte_no = -1; 177 bool change_to_virtual = false; 178 InstanceKlass* holder = NULL; // have to declare this outside the switch 179 switch (invoke_code) { 180 case Bytecodes::_invokeinterface: 181 holder = method->method_holder(); 182 // check for private interface method invocations 183 if (vtable_index == Method::nonvirtual_vtable_index && holder->is_interface() ) { 184 assert(method->is_private(), "unexpected non-private method"); 185 assert(method->can_be_statically_bound(), "unexpected non-statically-bound method"); 186 // set_f2_as_vfinal_method checks if is_vfinal flag is true. 187 set_method_flags(as_TosState(method->result_type()), 188 ( 1 << is_vfinal_shift) | 189 ((method->is_final_method() ? 1 : 0) << is_final_shift), 190 method()->size_of_parameters()); 191 set_f2_as_vfinal_method(method()); 192 byte_no = 2; 193 set_f1(holder); // interface klass* 194 break; 195 } 196 else { 197 // We get here from InterpreterRuntime::resolve_invoke when an invokeinterface 198 // instruction links to a non-interface method (in Object). This can happen when 199 // an interface redeclares an Object method (like CharSequence declaring toString()) 200 // or when invokeinterface is used explicitly. 201 // In that case, the method has no itable index and must be invoked as a virtual. 202 // Set a flag to keep track of this corner case. 203 assert(holder->is_interface() || holder == SystemDictionary::Object_klass(), "unexpected holder class"); 204 assert(method->is_public(), "Calling non-public method in Object with invokeinterface"); 205 change_to_virtual = true; 206 207 // ...and fall through as if we were handling invokevirtual: 208 } 209 case Bytecodes::_invokevirtual: 210 { 211 if (!is_vtable_call) { 212 assert(method->can_be_statically_bound(), ""); 213 // set_f2_as_vfinal_method checks if is_vfinal flag is true. 214 set_method_flags(as_TosState(method->result_type()), 215 ( 1 << is_vfinal_shift) | 216 ((method->is_final_method() ? 1 : 0) << is_final_shift) | 217 ((change_to_virtual ? 1 : 0) << is_forced_virtual_shift), 218 method()->size_of_parameters()); 219 set_f2_as_vfinal_method(method()); 220 } else { 221 assert(!method->can_be_statically_bound(), ""); 222 assert(vtable_index >= 0, "valid index"); 223 assert(!method->is_final_method(), "sanity"); 224 set_method_flags(as_TosState(method->result_type()), 225 ((change_to_virtual ? 1 : 0) << is_forced_virtual_shift), 226 method()->size_of_parameters()); 227 set_f2(vtable_index); 228 } 229 byte_no = 2; 230 break; 231 } 232 233 case Bytecodes::_invokespecial: 234 case Bytecodes::_invokestatic: 235 assert(!is_vtable_call, ""); 236 // Note: Read and preserve the value of the is_vfinal flag on any 237 // invokevirtual bytecode shared with this constant pool cache entry. 238 // It is cheap and safe to consult is_vfinal() at all times. 239 // Once is_vfinal is set, it must stay that way, lest we get a dangling oop. 240 set_method_flags(as_TosState(method->result_type()), 241 ((is_vfinal() ? 1 : 0) << is_vfinal_shift) | 242 ((method->is_final_method() ? 1 : 0) << is_final_shift), 243 method()->size_of_parameters()); 244 set_f1(method()); 245 byte_no = 1; 246 break; 247 default: 248 ShouldNotReachHere(); 249 break; 250 } 251 252 // Note: byte_no also appears in TemplateTable::resolve. 253 if (byte_no == 1) { 254 assert(invoke_code != Bytecodes::_invokevirtual && 255 invoke_code != Bytecodes::_invokeinterface, ""); 256 bool do_resolve = true; 257 // Don't mark invokespecial to method as resolved if sender is an interface. The receiver 258 // has to be checked that it is a subclass of the current class every time this bytecode 259 // is executed. 260 if (invoke_code == Bytecodes::_invokespecial && sender_is_interface && 261 method->name() != vmSymbols::object_initializer_name()) { 262 do_resolve = false; 263 } 264 // Don't mark invokestatic to method as resolved if the holder class has not yet completed 265 // initialization. An invokestatic must only proceed if the class is initialized, but if 266 // we resolve it before then that class initialization check is skipped. 267 if (invoke_code == Bytecodes::_invokestatic && !method->method_holder()->is_initialized()) { 268 do_resolve = false; 269 } 270 if (do_resolve) { 271 set_bytecode_1(invoke_code); 272 } 273 } else if (byte_no == 2) { 274 if (change_to_virtual) { 275 assert(invoke_code == Bytecodes::_invokeinterface, ""); 276 // NOTE: THIS IS A HACK - BE VERY CAREFUL!!! 277 // 278 // Workaround for the case where we encounter an invokeinterface, but we 279 // should really have an _invokevirtual since the resolved method is a 280 // virtual method in java.lang.Object. This is a corner case in the spec 281 // but is presumably legal. javac does not generate this code. 282 // 283 // We do not set bytecode_1() to _invokeinterface, because that is the 284 // bytecode # used by the interpreter to see if it is resolved. In this 285 // case, the method gets reresolved with caller for each interface call 286 // because the actual selected method may not be public. 287 // 288 // We set bytecode_2() to _invokevirtual. 289 // See also interpreterRuntime.cpp. (8/25/2000) 290 } else { 291 assert(invoke_code == Bytecodes::_invokevirtual || 292 (invoke_code == Bytecodes::_invokeinterface && 293 ((method->is_private() || 294 (method->is_final() && method->method_holder() == SystemDictionary::Object_klass())))), 295 "unexpected invocation mode"); 296 if (invoke_code == Bytecodes::_invokeinterface && 297 (method->is_private() || method->is_final())) { 298 // We set bytecode_1() to _invokeinterface, because that is the 299 // bytecode # used by the interpreter to see if it is resolved. 300 // We set bytecode_2() to _invokevirtual. 301 set_bytecode_1(invoke_code); 302 } 303 } 304 // set up for invokevirtual, even if linking for invokeinterface also: 305 set_bytecode_2(Bytecodes::_invokevirtual); 306 } else { 307 ShouldNotReachHere(); 308 } 309 NOT_PRODUCT(verify(tty)); 310 } 311 312 void ConstantPoolCacheEntry::set_direct_call(Bytecodes::Code invoke_code, const methodHandle& method, 313 bool sender_is_interface) { 314 int index = Method::nonvirtual_vtable_index; 315 // index < 0; FIXME: inline and customize set_direct_or_vtable_call 316 set_direct_or_vtable_call(invoke_code, method, index, sender_is_interface); 317 } 318 319 void ConstantPoolCacheEntry::set_vtable_call(Bytecodes::Code invoke_code, const methodHandle& method, int index) { 320 // either the method is a miranda or its holder should accept the given index 321 assert(method->method_holder()->is_interface() || method->method_holder()->verify_vtable_index(index), ""); 322 // index >= 0; FIXME: inline and customize set_direct_or_vtable_call 323 set_direct_or_vtable_call(invoke_code, method, index, false); 324 } 325 326 void ConstantPoolCacheEntry::set_itable_call(Bytecodes::Code invoke_code, 327 Klass* referenced_klass, 328 const methodHandle& method, int index) { 329 assert(method->method_holder()->verify_itable_index(index), ""); 330 assert(invoke_code == Bytecodes::_invokeinterface, ""); 331 InstanceKlass* interf = method->method_holder(); 332 assert(interf->is_interface(), "must be an interface"); 333 assert(!method->is_final_method(), "interfaces do not have final methods; cannot link to one here"); 334 set_f1(referenced_klass); 335 set_f2((intx)method()); 336 set_method_flags(as_TosState(method->result_type()), 337 0, // no option bits 338 method()->size_of_parameters()); 339 set_bytecode_1(Bytecodes::_invokeinterface); 340 } 341 342 343 void ConstantPoolCacheEntry::set_method_handle(const constantPoolHandle& cpool, const CallInfo &call_info) { 344 set_method_handle_common(cpool, Bytecodes::_invokehandle, call_info); 345 } 346 347 void ConstantPoolCacheEntry::set_dynamic_call(const constantPoolHandle& cpool, const CallInfo &call_info) { 348 set_method_handle_common(cpool, Bytecodes::_invokedynamic, call_info); 349 } 350 351 void ConstantPoolCacheEntry::set_method_handle_common(const constantPoolHandle& cpool, 352 Bytecodes::Code invoke_code, 353 const CallInfo &call_info) { 354 // NOTE: This CPCE can be the subject of data races. 355 // There are three words to update: flags, refs[f2], f1 (in that order). 356 // Writers must store all other values before f1. 357 // Readers must test f1 first for non-null before reading other fields. 358 // Competing writers must acquire exclusive access via a lock. 359 // A losing writer waits on the lock until the winner writes f1 and leaves 360 // the lock, so that when the losing writer returns, he can use the linked 361 // cache entry. 362 363 objArrayHandle resolved_references(Thread::current(), cpool->resolved_references()); 364 // Use the resolved_references() lock for this cpCache entry. 365 // resolved_references are created for all classes with Invokedynamic, MethodHandle 366 // or MethodType constant pool cache entries. 367 assert(resolved_references() != NULL, 368 "a resolved_references array should have been created for this class"); 369 ObjectLocker ol(resolved_references, Thread::current()); 370 if (!is_f1_null()) { 371 return; 372 } 373 374 if (indy_resolution_failed()) { 375 // Before we got here, another thread got a LinkageError exception during 376 // resolution. Ignore our success and throw their exception. 377 ConstantPoolCache* cpCache = cpool->cache(); 378 int index = -1; 379 for (int i = 0; i < cpCache->length(); i++) { 380 if (cpCache->entry_at(i) == this) { 381 index = i; 382 break; 383 } 384 } 385 guarantee(index >= 0, "Didn't find cpCache entry!"); 386 int encoded_index = ResolutionErrorTable::encode_cpcache_index( 387 ConstantPool::encode_invokedynamic_index(index)); 388 Thread* THREAD = Thread::current(); 389 ConstantPool::throw_resolution_error(cpool, encoded_index, THREAD); 390 return; 391 } 392 393 const methodHandle adapter = call_info.resolved_method(); 394 const Handle appendix = call_info.resolved_appendix(); 395 const bool has_appendix = appendix.not_null(); 396 397 // Write the flags. 398 // MHs and indy are always sig-poly and have a local signature. 399 set_method_flags(as_TosState(adapter->result_type()), 400 ((has_appendix ? 1 : 0) << has_appendix_shift ) | 401 ( 1 << has_local_signature_shift ) | 402 ( 1 << is_final_shift ), 403 adapter->size_of_parameters()); 404 405 if (TraceInvokeDynamic) { 406 ttyLocker ttyl; 407 tty->print_cr("set_method_handle bc=%d appendix=" PTR_FORMAT "%s method=" PTR_FORMAT " (local signature) ", 408 invoke_code, 409 p2i(appendix()), 410 (has_appendix ? "" : " (unused)"), 411 p2i(adapter())); 412 adapter->print(); 413 if (has_appendix) appendix()->print(); 414 } 415 416 // Method handle invokes and invokedynamic sites use both cp cache words. 417 // refs[f2], if not null, contains a value passed as a trailing argument to the adapter. 418 // In the general case, this could be the call site's MethodType, 419 // for use with java.lang.Invokers.checkExactType, or else a CallSite object. 420 // f1 contains the adapter method which manages the actual call. 421 // In the general case, this is a compiled LambdaForm. 422 // (The Java code is free to optimize these calls by binding other 423 // sorts of methods and appendices to call sites.) 424 // JVM-level linking is via f1, as if for invokespecial, and signatures are erased. 425 // The appendix argument (if any) is added to the signature, and is counted in the parameter_size bits. 426 // Even with the appendix, the method will never take more than 255 parameter slots. 427 // 428 // This means that given a call site like (List)mh.invoke("foo"), 429 // the f1 method has signature '(Ljl/Object;Ljl/invoke/MethodType;)Ljl/Object;', 430 // not '(Ljava/lang/String;)Ljava/util/List;'. 431 // The fact that String and List are involved is encoded in the MethodType in refs[f2]. 432 // This allows us to create fewer Methods, while keeping type safety. 433 // 434 435 // Store appendix, if any. 436 if (has_appendix) { 437 const int appendix_index = f2_as_index(); 438 assert(appendix_index >= 0 && appendix_index < resolved_references->length(), "oob"); 439 assert(resolved_references->obj_at(appendix_index) == NULL, "init just once"); 440 resolved_references->obj_at_put(appendix_index, appendix()); 441 } 442 443 release_set_f1(adapter()); // This must be the last one to set (see NOTE above)! 444 445 // The interpreter assembly code does not check byte_2, 446 // but it is used by is_resolved, method_if_resolved, etc. 447 set_bytecode_1(invoke_code); 448 NOT_PRODUCT(verify(tty)); 449 if (TraceInvokeDynamic) { 450 ttyLocker ttyl; 451 this->print(tty, 0); 452 } 453 454 assert(has_appendix == this->has_appendix(), "proper storage of appendix flag"); 455 assert(this->has_local_signature(), "proper storage of signature flag"); 456 } 457 458 bool ConstantPoolCacheEntry::save_and_throw_indy_exc( 459 const constantPoolHandle& cpool, int cpool_index, int index, constantTag tag, TRAPS) { 460 461 assert(HAS_PENDING_EXCEPTION, "No exception got thrown!"); 462 assert(PENDING_EXCEPTION->is_a(SystemDictionary::LinkageError_klass()), 463 "No LinkageError exception"); 464 465 // Use the resolved_references() lock for this cpCache entry. 466 // resolved_references are created for all classes with Invokedynamic, MethodHandle 467 // or MethodType constant pool cache entries. 468 objArrayHandle resolved_references(Thread::current(), cpool->resolved_references()); 469 assert(resolved_references() != NULL, 470 "a resolved_references array should have been created for this class"); 471 ObjectLocker ol(resolved_references, THREAD); 472 473 // if f1 is not null or the indy_resolution_failed flag is set then another 474 // thread either succeeded in resolving the method or got a LinkageError 475 // exception, before this thread was able to record its failure. So, clear 476 // this thread's exception and return false so caller can use the earlier 477 // thread's result. 478 if (!is_f1_null() || indy_resolution_failed()) { 479 CLEAR_PENDING_EXCEPTION; 480 return false; 481 } 482 483 Symbol* error = PENDING_EXCEPTION->klass()->name(); 484 Symbol* message = java_lang_Throwable::detail_message(PENDING_EXCEPTION); 485 486 SystemDictionary::add_resolution_error(cpool, index, error, message); 487 set_indy_resolution_failed(); 488 return true; 489 } 490 491 Method* ConstantPoolCacheEntry::method_if_resolved(const constantPoolHandle& cpool) { 492 // Decode the action of set_method and set_interface_call 493 Bytecodes::Code invoke_code = bytecode_1(); 494 if (invoke_code != (Bytecodes::Code)0) { 495 Metadata* f1 = f1_ord(); 496 if (f1 != NULL) { 497 switch (invoke_code) { 498 case Bytecodes::_invokeinterface: 499 assert(f1->is_klass(), ""); 500 return klassItable::method_for_itable_index((InstanceKlass*)f1, f2_as_index()); 501 case Bytecodes::_invokestatic: 502 case Bytecodes::_invokespecial: 503 assert(!has_appendix(), ""); 504 case Bytecodes::_invokehandle: 505 case Bytecodes::_invokedynamic: 506 assert(f1->is_method(), ""); 507 return (Method*)f1; 508 default: 509 break; 510 } 511 } 512 } 513 invoke_code = bytecode_2(); 514 if (invoke_code != (Bytecodes::Code)0) { 515 switch (invoke_code) { 516 case Bytecodes::_invokevirtual: 517 if (is_vfinal()) { 518 // invokevirtual 519 Method* m = f2_as_vfinal_method(); 520 assert(m->is_method(), ""); 521 return m; 522 } else { 523 int holder_index = cpool->uncached_klass_ref_index_at(constant_pool_index()); 524 if (cpool->tag_at(holder_index).is_klass()) { 525 Klass* klass = cpool->resolved_klass_at(holder_index); 526 return klass->method_at_vtable(f2_as_index()); 527 } 528 } 529 break; 530 default: 531 break; 532 } 533 } 534 return NULL; 535 } 536 537 538 oop ConstantPoolCacheEntry::appendix_if_resolved(const constantPoolHandle& cpool) { 539 if (!has_appendix()) 540 return NULL; 541 const int ref_index = f2_as_index(); 542 objArrayOop resolved_references = cpool->resolved_references(); 543 return resolved_references->obj_at(ref_index); 544 } 545 546 547 #if INCLUDE_JVMTI 548 549 void log_adjust(const char* entry_type, Method* old_method, Method* new_method, bool* trace_name_printed) { 550 if (log_is_enabled(Info, redefine, class, update)) { 551 ResourceMark rm; 552 if (!(*trace_name_printed)) { 553 log_info(redefine, class, update)("adjust: name=%s", old_method->method_holder()->external_name()); 554 *trace_name_printed = true; 555 } 556 log_debug(redefine, class, update, constantpool) 557 ("cpc %s entry update: %s(%s)", entry_type, new_method->name()->as_C_string(), new_method->signature()->as_C_string()); 558 } 559 } 560 561 // RedefineClasses() API support: 562 // If this ConstantPoolCacheEntry refers to old_method then update it 563 // to refer to new_method. 564 void ConstantPoolCacheEntry::adjust_method_entry(Method* old_method, 565 Method* new_method, bool * trace_name_printed) { 566 567 if (is_vfinal()) { 568 // virtual and final so _f2 contains method ptr instead of vtable index 569 if (f2_as_vfinal_method() == old_method) { 570 // match old_method so need an update 571 // NOTE: can't use set_f2_as_vfinal_method as it asserts on different values 572 _f2 = (intptr_t)new_method; 573 log_adjust("vfinal", old_method, new_method, trace_name_printed); 574 } 575 return; 576 } 577 578 assert (_f1 != NULL, "should not call with uninteresting entry"); 579 580 if (!(_f1->is_method())) { 581 // _f1 is a Klass* for an interface, _f2 is the method 582 if (f2_as_interface_method() == old_method) { 583 _f2 = (intptr_t)new_method; 584 log_adjust("interface", old_method, new_method, trace_name_printed); 585 } 586 } else if (_f1 == old_method) { 587 _f1 = new_method; 588 log_adjust("special, static or dynamic", old_method, new_method, trace_name_printed); 589 } 590 } 591 592 // a constant pool cache entry should never contain old or obsolete methods 593 bool ConstantPoolCacheEntry::check_no_old_or_obsolete_entries() { 594 Method* m = get_interesting_method_entry(); 595 // return false if m refers to a non-deleted old or obsolete method 596 if (m != NULL) { 597 assert(m->is_valid() && m->is_method(), "m is a valid method"); 598 return !m->is_old() && !m->is_obsolete(); // old is always set for old and obsolete 599 } else { 600 return true; 601 } 602 } 603 604 Method* ConstantPoolCacheEntry::get_interesting_method_entry() { 605 if (!is_method_entry()) { 606 // not a method entry so not interesting by default 607 return NULL; 608 } 609 Method* m = NULL; 610 if (is_vfinal()) { 611 // virtual and final so _f2 contains method ptr instead of vtable index 612 m = f2_as_vfinal_method(); 613 } else if (is_f1_null()) { 614 // NULL _f1 means this is a virtual entry so also not interesting 615 return NULL; 616 } else { 617 if (!(_f1->is_method())) { 618 // _f1 is a Klass* for an interface 619 m = f2_as_interface_method(); 620 } else { 621 m = f1_as_method(); 622 } 623 } 624 assert(m != NULL && m->is_method(), "sanity check"); 625 if (m == NULL || !m->is_method()) { 626 return NULL; 627 } 628 return m; 629 } 630 #endif // INCLUDE_JVMTI 631 632 void ConstantPoolCacheEntry::print(outputStream* st, int index) const { 633 // print separator 634 if (index == 0) st->print_cr(" -------------"); 635 // print entry 636 st->print("%3d (" PTR_FORMAT ") ", index, (intptr_t)this); 637 st->print_cr("[%02x|%02x|%5d]", bytecode_2(), bytecode_1(), 638 constant_pool_index()); 639 st->print_cr(" [ " PTR_FORMAT "]", (intptr_t)_f1); 640 st->print_cr(" [ " PTR_FORMAT "]", (intptr_t)_f2); 641 st->print_cr(" [ " PTR_FORMAT "]", (intptr_t)_flags); 642 st->print_cr(" -------------"); 643 } 644 645 void ConstantPoolCacheEntry::verify(outputStream* st) const { 646 // not implemented yet 647 } 648 649 // Implementation of ConstantPoolCache 650 651 ConstantPoolCache* ConstantPoolCache::allocate(ClassLoaderData* loader_data, 652 const intStack& index_map, 653 const intStack& invokedynamic_index_map, 654 const intStack& invokedynamic_map, TRAPS) { 655 656 const int length = index_map.length() + invokedynamic_index_map.length(); 657 int size = ConstantPoolCache::size(length); 658 659 return new (loader_data, size, MetaspaceObj::ConstantPoolCacheType, THREAD) 660 ConstantPoolCache(length, index_map, invokedynamic_index_map, invokedynamic_map); 661 } 662 663 void ConstantPoolCache::initialize(const intArray& inverse_index_map, 664 const intArray& invokedynamic_inverse_index_map, 665 const intArray& invokedynamic_references_map) { 666 for (int i = 0; i < inverse_index_map.length(); i++) { 667 ConstantPoolCacheEntry* e = entry_at(i); 668 int original_index = inverse_index_map.at(i); 669 e->initialize_entry(original_index); 670 assert(entry_at(i) == e, "sanity"); 671 } 672 673 // Append invokedynamic entries at the end 674 int invokedynamic_offset = inverse_index_map.length(); 675 for (int i = 0; i < invokedynamic_inverse_index_map.length(); i++) { 676 int offset = i + invokedynamic_offset; 677 ConstantPoolCacheEntry* e = entry_at(offset); 678 int original_index = invokedynamic_inverse_index_map.at(i); 679 e->initialize_entry(original_index); 680 assert(entry_at(offset) == e, "sanity"); 681 } 682 683 for (int ref = 0; ref < invokedynamic_references_map.length(); ref++) { 684 const int cpci = invokedynamic_references_map.at(ref); 685 if (cpci >= 0) { 686 entry_at(cpci)->initialize_resolved_reference_index(ref); 687 } 688 } 689 } 690 691 void ConstantPoolCache::verify_just_initialized() { 692 DEBUG_ONLY(walk_entries_for_initialization(/*check_only = */ true)); 693 } 694 695 void ConstantPoolCache::remove_unshareable_info() { 696 walk_entries_for_initialization(/*check_only = */ false); 697 } 698 699 void ConstantPoolCache::walk_entries_for_initialization(bool check_only) { 700 assert(DumpSharedSpaces, "sanity"); 701 // When dumping the archive, we want to clean up the ConstantPoolCache 702 // to remove any effect of linking due to the execution of Java code -- 703 // each ConstantPoolCacheEntry will have the same contents as if 704 // ConstantPoolCache::initialize has just returned: 705 // 706 // - We keep the ConstantPoolCache::constant_pool_index() bits for all entries. 707 // - We keep the "f2" field for entries used by invokedynamic and invokehandle 708 // - All other bits in the entries are cleared to zero. 709 ResourceMark rm; 710 711 InstanceKlass* ik = constant_pool()->pool_holder(); 712 bool* f2_used = NEW_RESOURCE_ARRAY(bool, length()); 713 memset(f2_used, 0, sizeof(bool) * length()); 714 715 // Find all the slots that we need to preserve f2 716 for (int i = 0; i < ik->methods()->length(); i++) { 717 Method* m = ik->methods()->at(i); 718 RawBytecodeStream bcs(m); 719 while (!bcs.is_last_bytecode()) { 720 Bytecodes::Code opcode = bcs.raw_next(); 721 switch (opcode) { 722 case Bytecodes::_invokedynamic: { 723 int index = Bytes::get_native_u4(bcs.bcp() + 1); 724 int cp_cache_index = constant_pool()->invokedynamic_cp_cache_index(index); 725 f2_used[cp_cache_index] = 1; 726 } 727 break; 728 case Bytecodes::_invokehandle: { 729 int cp_cache_index = Bytes::get_native_u2(bcs.bcp() + 1); 730 f2_used[cp_cache_index] = 1; 731 } 732 break; 733 default: 734 break; 735 } 736 } 737 } 738 739 if (check_only) { 740 DEBUG_ONLY( 741 for (int i=0; i<length(); i++) { 742 entry_at(i)->verify_just_initialized(f2_used[i]); 743 }) 744 } else { 745 for (int i=0; i<length(); i++) { 746 entry_at(i)->reinitialize(f2_used[i]); 747 } 748 } 749 } 750 751 void ConstantPoolCache::deallocate_contents(ClassLoaderData* data) { 752 assert(!is_shared(), "shared caches are not deallocated"); 753 data->remove_handle(_resolved_references); 754 set_resolved_references(NULL); 755 MetadataFactory::free_array<u2>(data, _reference_map); 756 set_reference_map(NULL); 757 } 758 759 #if INCLUDE_CDS_JAVA_HEAP 760 oop ConstantPoolCache::archived_references() { 761 if (CompressedOops::is_null(_archived_references)) { 762 return NULL; 763 } 764 return HeapShared::materialize_archived_object(_archived_references); 765 } 766 767 void ConstantPoolCache::set_archived_references(oop o) { 768 assert(DumpSharedSpaces, "called only during runtime"); 769 _archived_references = CompressedOops::encode(o); 770 } 771 #endif 772 773 #if INCLUDE_JVMTI 774 // RedefineClasses() API support: 775 // If any entry of this ConstantPoolCache points to any of 776 // old_methods, replace it with the corresponding new_method. 777 void ConstantPoolCache::adjust_method_entries(bool * trace_name_printed) { 778 for (int i = 0; i < length(); i++) { 779 ConstantPoolCacheEntry* entry = entry_at(i); 780 Method* old_method = entry->get_interesting_method_entry(); 781 if (old_method == NULL || !old_method->is_old()) { 782 continue; // skip uninteresting entries 783 } 784 if (old_method->is_deleted()) { 785 // clean up entries with deleted methods 786 entry->initialize_entry(entry->constant_pool_index()); 787 continue; 788 } 789 Method* new_method = old_method->get_new_method(); 790 entry_at(i)->adjust_method_entry(old_method, new_method, trace_name_printed); 791 } 792 } 793 794 // the constant pool cache should never contain old or obsolete methods 795 bool ConstantPoolCache::check_no_old_or_obsolete_entries() { 796 for (int i = 1; i < length(); i++) { 797 if (entry_at(i)->get_interesting_method_entry() != NULL && 798 !entry_at(i)->check_no_old_or_obsolete_entries()) { 799 return false; 800 } 801 } 802 return true; 803 } 804 805 void ConstantPoolCache::dump_cache() { 806 for (int i = 1; i < length(); i++) { 807 if (entry_at(i)->get_interesting_method_entry() != NULL) { 808 entry_at(i)->print(tty, i); 809 } 810 } 811 } 812 #endif // INCLUDE_JVMTI 813 814 void ConstantPoolCache::metaspace_pointers_do(MetaspaceClosure* it) { 815 log_trace(cds)("Iter(ConstantPoolCache): %p", this); 816 it->push(&_constant_pool); 817 it->push(&_reference_map); 818 } 819 820 // Printing 821 822 void ConstantPoolCache::print_on(outputStream* st) const { 823 st->print_cr("%s", internal_name()); 824 // print constant pool cache entries 825 for (int i = 0; i < length(); i++) entry_at(i)->print(st, i); 826 } 827 828 void ConstantPoolCache::print_value_on(outputStream* st) const { 829 st->print("cache [%d]", length()); 830 print_address_on(st); 831 st->print(" for "); 832 constant_pool()->print_value_on(st); 833 } 834 835 836 // Verification 837 838 void ConstantPoolCache::verify_on(outputStream* st) { 839 // print constant pool cache entries 840 for (int i = 0; i < length(); i++) entry_at(i)->verify(st); 841 }