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