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