duke@435: /*
dholmes@3601:  * Copyright (c) 1998, 2012, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "gc_implementation/shared/markSweep.inline.hpp"
stefank@2314: #include "interpreter/interpreter.hpp"
stefank@2314: #include "interpreter/rewriter.hpp"
stefank@2314: #include "memory/universe.inline.hpp"
stefank@2314: #include "oops/cpCacheOop.hpp"
stefank@2314: #include "oops/objArrayOop.hpp"
stefank@2314: #include "oops/oop.inline.hpp"
stefank@2314: #include "prims/jvmtiRedefineClassesTrace.hpp"
twisti@3969: #include "prims/methodHandles.hpp"
stefank@2314: #include "runtime/handles.inline.hpp"
duke@435: 
duke@435: 
duke@435: // Implememtation of ConstantPoolCacheEntry
duke@435: 
jrose@1494: void ConstantPoolCacheEntry::initialize_entry(int index) {
jrose@1161:   assert(0 < index && index < 0x10000, "sanity check");
duke@435:   _indices = index;
jrose@1161:   assert(constant_pool_index() == index, "");
duke@435: }
duke@435: 
jrose@1494: void ConstantPoolCacheEntry::initialize_secondary_entry(int main_index) {
jrose@1494:   assert(0 <= main_index && main_index < 0x10000, "sanity check");
twisti@3969:   _indices = (main_index << main_cp_index_bits);
jrose@1494:   assert(main_entry_index() == main_index, "");
jrose@1494: }
duke@435: 
twisti@3969: int ConstantPoolCacheEntry::make_flags(TosState state,
twisti@3969:                                        int option_bits,
twisti@3969:                                        int field_index_or_method_params) {
twisti@3969:   assert(state < number_of_states, "Invalid state in make_flags");
twisti@3969:   int f = ((int)state << tos_state_shift) | option_bits | field_index_or_method_params;
duke@435:   // Preserve existing flag bit values
twisti@3969:   // The low bits are a field offset, or else the method parameter size.
duke@435: #ifdef ASSERT
twisti@3969:   TosState old_state = flag_state();
twisti@3969:   assert(old_state == (TosState)0 || old_state == state,
duke@435:          "inconsistent cpCache flags state");
duke@435: #endif
duke@435:   return (_flags | f) ;
duke@435: }
duke@435: 
duke@435: void ConstantPoolCacheEntry::set_bytecode_1(Bytecodes::Code code) {
twisti@3969:   assert(!is_secondary_entry(), "must not overwrite main_entry_index");
duke@435: #ifdef ASSERT
duke@435:   // Read once.
duke@435:   volatile Bytecodes::Code c = bytecode_1();
duke@435:   assert(c == 0 || c == code || code == 0, "update must be consistent");
duke@435: #endif
duke@435:   // Need to flush pending stores here before bytecode is written.
twisti@3969:   OrderAccess::release_store_ptr(&_indices, _indices | ((u_char)code << bytecode_1_shift));
duke@435: }
duke@435: 
duke@435: void ConstantPoolCacheEntry::set_bytecode_2(Bytecodes::Code code) {
twisti@3969:   assert(!is_secondary_entry(), "must not overwrite main_entry_index");
duke@435: #ifdef ASSERT
duke@435:   // Read once.
duke@435:   volatile Bytecodes::Code c = bytecode_2();
duke@435:   assert(c == 0 || c == code || code == 0, "update must be consistent");
duke@435: #endif
duke@435:   // Need to flush pending stores here before bytecode is written.
twisti@3969:   OrderAccess::release_store_ptr(&_indices, _indices | ((u_char)code << bytecode_2_shift));
duke@435: }
duke@435: 
twisti@3969: // Sets f1, ordering with previous writes.
twisti@3969: void ConstantPoolCacheEntry::release_set_f1(oop f1) {
twisti@2553:   // Use barriers as in oop_store
twisti@3969:   assert(f1 != NULL, "");
twisti@2553:   oop* f1_addr = (oop*) &_f1;
twisti@2553:   update_barrier_set_pre(f1_addr, f1);
twisti@3969:   OrderAccess::release_store_ptr((intptr_t*)f1_addr, f1);
twisti@3969:   update_barrier_set((void*) f1_addr, f1);
twisti@3969: }
twisti@3969: 
twisti@3969: // Sets flags, but only if the value was previously zero.
twisti@3969: bool ConstantPoolCacheEntry::init_flags_atomic(intptr_t flags) {
twisti@3969:   intptr_t result = Atomic::cmpxchg_ptr(flags, &_flags, 0);
twisti@3969:   return (result == 0);
twisti@2553: }
twisti@2258: 
duke@435: #ifdef ASSERT
duke@435: // It is possible to have two different dummy methodOops created
duke@435: // when the resolve code for invoke interface executes concurrently
duke@435: // Hence the assertion below is weakened a bit for the invokeinterface
duke@435: // case.
duke@435: bool ConstantPoolCacheEntry::same_methodOop(oop cur_f1, oop f1) {
duke@435:   return (cur_f1 == f1 || ((methodOop)cur_f1)->name() ==
duke@435:          ((methodOop)f1)->name() || ((methodOop)cur_f1)->signature() ==
duke@435:          ((methodOop)f1)->signature());
duke@435: }
duke@435: #endif
duke@435: 
duke@435: // Note that concurrent update of both bytecodes can leave one of them
duke@435: // reset to zero.  This is harmless; the interpreter will simply re-resolve
duke@435: // the damaged entry.  More seriously, the memory synchronization is needed
duke@435: // to flush other fields (f1, f2) completely to memory before the bytecodes
duke@435: // are updated, lest other processors see a non-zero bytecode but zero f1/f2.
duke@435: void ConstantPoolCacheEntry::set_field(Bytecodes::Code get_code,
duke@435:                                        Bytecodes::Code put_code,
duke@435:                                        KlassHandle field_holder,
never@3137:                                        int field_index,
duke@435:                                        int field_offset,
duke@435:                                        TosState field_type,
duke@435:                                        bool is_final,
duke@435:                                        bool is_volatile) {
never@2658:   set_f1(field_holder()->java_mirror());
duke@435:   set_f2(field_offset);
twisti@3969:   assert((field_index & field_index_mask) == field_index,
duke@435:          "field index does not fit in low flag bits");
twisti@3969:   set_field_flags(field_type,
twisti@3969:                   ((is_volatile ? 1 : 0) << is_volatile_shift) |
twisti@3969:                   ((is_final    ? 1 : 0) << is_final_shift),
twisti@3969:                   field_index);
duke@435:   set_bytecode_1(get_code);
duke@435:   set_bytecode_2(put_code);
duke@435:   NOT_PRODUCT(verify(tty));
duke@435: }
duke@435: 
twisti@3969: void ConstantPoolCacheEntry::set_parameter_size(int value) {
twisti@3969:   // This routine is called only in corner cases where the CPCE is not yet initialized.
twisti@3969:   // See AbstractInterpreter::deopt_continue_after_entry.
twisti@3969:   assert(_flags == 0 || parameter_size() == 0 || parameter_size() == value,
twisti@3969:          err_msg("size must not change: parameter_size=%d, value=%d", parameter_size(), value));
twisti@3969:   // Setting the parameter size by itself is only safe if the
twisti@3969:   // current value of _flags is 0, otherwise another thread may have
twisti@3969:   // updated it and we don't want to overwrite that value.  Don't
twisti@3969:   // bother trying to update it once it's nonzero but always make
twisti@3969:   // sure that the final parameter size agrees with what was passed.
twisti@3969:   if (_flags == 0) {
twisti@3969:     Atomic::cmpxchg_ptr((value & parameter_size_mask), &_flags, 0);
twisti@3969:   }
twisti@3969:   guarantee(parameter_size() == value,
twisti@3969:             err_msg("size must not change: parameter_size=%d, value=%d", parameter_size(), value));
duke@435: }
duke@435: 
duke@435: void ConstantPoolCacheEntry::set_method(Bytecodes::Code invoke_code,
duke@435:                                         methodHandle method,
duke@435:                                         int vtable_index) {
jrose@2015:   assert(!is_secondary_entry(), "");
duke@435:   assert(method->interpreter_entry() != NULL, "should have been set at this point");
duke@435:   assert(!method->is_obsolete(),  "attempt to write obsolete method to cpCache");
duke@435: 
duke@435:   int byte_no = -1;
twisti@3969:   bool change_to_virtual = false;
twisti@3969: 
duke@435:   switch (invoke_code) {
twisti@3969:     case Bytecodes::_invokeinterface:
twisti@3969:       // We get here from InterpreterRuntime::resolve_invoke when an invokeinterface
twisti@3969:       // instruction somehow links to a non-interface method (in Object).
twisti@3969:       // In that case, the method has no itable index and must be invoked as a virtual.
twisti@3969:       // Set a flag to keep track of this corner case.
twisti@3969:       change_to_virtual = true;
twisti@3969: 
twisti@3969:       // ...and fall through as if we were handling invokevirtual:
duke@435:     case Bytecodes::_invokevirtual:
twisti@3969:       {
duke@435:         if (method->can_be_statically_bound()) {
twisti@3969:           // set_f2_as_vfinal_method checks if is_vfinal flag is true.
twisti@3969:           set_method_flags(as_TosState(method->result_type()),
twisti@3969:                            (                             1      << is_vfinal_shift) |
twisti@3969:                            ((method->is_final_method() ? 1 : 0) << is_final_shift)  |
twisti@3969:                            ((change_to_virtual         ? 1 : 0) << is_forced_virtual_shift),
twisti@3969:                            method()->size_of_parameters());
twisti@3969:           set_f2_as_vfinal_method(method());
duke@435:         } else {
duke@435:           assert(vtable_index >= 0, "valid index");
twisti@3969:           assert(!method->is_final_method(), "sanity");
twisti@3969:           set_method_flags(as_TosState(method->result_type()),
twisti@3969:                            ((change_to_virtual ? 1 : 0) << is_forced_virtual_shift),
twisti@3969:                            method()->size_of_parameters());
duke@435:           set_f2(vtable_index);
duke@435:         }
duke@435:         byte_no = 2;
duke@435:         break;
jrose@2015:       }
jrose@2015: 
duke@435:     case Bytecodes::_invokespecial:
duke@435:     case Bytecodes::_invokestatic:
twisti@3969:       // Note:  Read and preserve the value of the is_vfinal flag on any
twisti@3969:       // invokevirtual bytecode shared with this constant pool cache entry.
twisti@3969:       // It is cheap and safe to consult is_vfinal() at all times.
twisti@3969:       // Once is_vfinal is set, it must stay that way, lest we get a dangling oop.
twisti@3969:       set_method_flags(as_TosState(method->result_type()),
twisti@3969:                        ((is_vfinal()               ? 1 : 0) << is_vfinal_shift) |
twisti@3969:                        ((method->is_final_method() ? 1 : 0) << is_final_shift),
twisti@3969:                        method()->size_of_parameters());
duke@435:       set_f1(method());
duke@435:       byte_no = 1;
duke@435:       break;
duke@435:     default:
duke@435:       ShouldNotReachHere();
duke@435:       break;
duke@435:   }
duke@435: 
duke@435:   // Note:  byte_no also appears in TemplateTable::resolve.
duke@435:   if (byte_no == 1) {
twisti@3969:     assert(invoke_code != Bytecodes::_invokevirtual &&
twisti@3969:            invoke_code != Bytecodes::_invokeinterface, "");
duke@435:     set_bytecode_1(invoke_code);
duke@435:   } else if (byte_no == 2)  {
duke@435:     if (change_to_virtual) {
twisti@3969:       assert(invoke_code == Bytecodes::_invokeinterface, "");
duke@435:       // NOTE: THIS IS A HACK - BE VERY CAREFUL!!!
duke@435:       //
duke@435:       // Workaround for the case where we encounter an invokeinterface, but we
duke@435:       // should really have an _invokevirtual since the resolved method is a
duke@435:       // virtual method in java.lang.Object. This is a corner case in the spec
duke@435:       // but is presumably legal. javac does not generate this code.
duke@435:       //
duke@435:       // We set bytecode_1() to _invokeinterface, because that is the
duke@435:       // bytecode # used by the interpreter to see if it is resolved.
duke@435:       // We set bytecode_2() to _invokevirtual.
duke@435:       // See also interpreterRuntime.cpp. (8/25/2000)
duke@435:       // Only set resolved for the invokeinterface case if method is public.
duke@435:       // Otherwise, the method needs to be reresolved with caller for each
duke@435:       // interface call.
duke@435:       if (method->is_public()) set_bytecode_1(invoke_code);
duke@435:     } else {
twisti@3969:       assert(invoke_code == Bytecodes::_invokevirtual, "");
duke@435:     }
twisti@3969:     // set up for invokevirtual, even if linking for invokeinterface also:
twisti@3969:     set_bytecode_2(Bytecodes::_invokevirtual);
duke@435:   } else {
duke@435:     ShouldNotReachHere();
duke@435:   }
duke@435:   NOT_PRODUCT(verify(tty));
duke@435: }
duke@435: 
duke@435: 
duke@435: void ConstantPoolCacheEntry::set_interface_call(methodHandle method, int index) {
jrose@2015:   assert(!is_secondary_entry(), "");
duke@435:   klassOop interf = method->method_holder();
duke@435:   assert(instanceKlass::cast(interf)->is_interface(), "must be an interface");
twisti@3969:   assert(!method->is_final_method(), "interfaces do not have final methods; cannot link to one here");
duke@435:   set_f1(interf);
duke@435:   set_f2(index);
twisti@3969:   set_method_flags(as_TosState(method->result_type()),
twisti@3969:                    0,  // no option bits
twisti@3969:                    method()->size_of_parameters());
duke@435:   set_bytecode_1(Bytecodes::_invokeinterface);
duke@435: }
duke@435: 
duke@435: 
twisti@3969: void ConstantPoolCacheEntry::set_method_handle(methodHandle adapter, Handle appendix) {
twisti@3969:   assert(!is_secondary_entry(), "");
twisti@3969:   set_method_handle_common(Bytecodes::_invokehandle, adapter, appendix);
jrose@2015: }
jrose@2015: 
twisti@3969: void ConstantPoolCacheEntry::set_dynamic_call(methodHandle adapter, Handle appendix) {
twisti@3969:   assert(is_secondary_entry(), "");
twisti@3969:   set_method_handle_common(Bytecodes::_invokedynamic, adapter, appendix);
jrose@2015: }
jrose@2015: 
twisti@3969: void ConstantPoolCacheEntry::set_method_handle_common(Bytecodes::Code invoke_code, methodHandle adapter, Handle appendix) {
twisti@3969:   // NOTE: This CPCE can be the subject of data races.
twisti@3969:   // There are three words to update: flags, f2, f1 (in that order).
twisti@3969:   // Writers must store all other values before f1.
twisti@3969:   // Readers must test f1 first for non-null before reading other fields.
twisti@3969:   // Competing writers must acquire exclusive access on the first
twisti@3969:   // write, to flags, using a compare/exchange.
twisti@3969:   // A losing writer must spin until the winner writes f1,
twisti@3969:   // so that when he returns, he can use the linked cache entry.
twisti@3969: 
twisti@3969:   bool has_appendix = appendix.not_null();
twisti@3969:   if (!has_appendix) {
twisti@3969:     // The extra argument is not used, but we need a non-null value to signify linkage state.
twisti@3969:     // Set it to something benign that will never leak memory.
twisti@3969:     appendix = Universe::void_mirror();
twisti@3969:   }
twisti@3969: 
twisti@3969:   bool owner =
twisti@3969:     init_method_flags_atomic(as_TosState(adapter->result_type()),
twisti@3969:                    ((has_appendix ?  1 : 0) << has_appendix_shift) |
twisti@3969:                    (                 1      << is_vfinal_shift)    |
twisti@3969:                    (                 1      << is_final_shift),
twisti@3969:                    adapter->size_of_parameters());
twisti@3969:   if (!owner) {
twisti@3969:     while (is_f1_null()) {
twisti@3969:       // Pause momentarily on a low-level lock, to allow racing thread to win.
twisti@3969:       MutexLockerEx mu(Patching_lock, Mutex::_no_safepoint_check_flag);
twisti@3969:       os::yield();
twisti@3969:     }
twisti@3969:     return;
twisti@3969:   }
twisti@3969: 
twisti@3969:   if (TraceInvokeDynamic) {
twisti@3969:     tty->print_cr("set_method_handle bc=%d appendix="PTR_FORMAT"%s method="PTR_FORMAT" ",
twisti@3969:                   invoke_code,
twisti@3969:                   (intptr_t)appendix(), (has_appendix ? "" : " (unused)"),
twisti@3969:                   (intptr_t)adapter());
twisti@3969:     adapter->print();
twisti@3969:     if (has_appendix)  appendix()->print();
twisti@3969:   }
twisti@3969: 
twisti@3969:   // Method handle invokes and invokedynamic sites use both cp cache words.
twisti@3969:   // f1, if not null, contains a value passed as a trailing argument to the adapter.
twisti@3969:   // In the general case, this could be the call site's MethodType,
twisti@3969:   // for use with java.lang.Invokers.checkExactType, or else a CallSite object.
twisti@3969:   // f2 contains the adapter method which manages the actual call.
twisti@3969:   // In the general case, this is a compiled LambdaForm.
twisti@3969:   // (The Java code is free to optimize these calls by binding other
twisti@3969:   // sorts of methods and appendices to call sites.)
twisti@3969:   // JVM-level linking is via f2, as if for invokevfinal, and signatures are erased.
twisti@3969:   // The appendix argument (if any) is added to the signature, and is counted in the parameter_size bits.
twisti@3969:   // In principle this means that the method (with appendix) could take up to 256 parameter slots.
twisti@3969:   //
twisti@3969:   // This means that given a call site like (List)mh.invoke("foo"),
twisti@3969:   // the f2 method has signature '(Ljl/Object;Ljl/invoke/MethodType;)Ljl/Object;',
twisti@3969:   // not '(Ljava/lang/String;)Ljava/util/List;'.
twisti@3969:   // The fact that String and List are involved is encoded in the MethodType in f1.
twisti@3969:   // This allows us to create fewer method oops, while keeping type safety.
twisti@3969:   //
twisti@3969:   set_f2_as_vfinal_method(adapter());
twisti@3969:   assert(appendix.not_null(), "needed for linkage state");
twisti@3969:   release_set_f1(appendix());  // This must be the last one to set (see NOTE above)!
twisti@3969:   if (!is_secondary_entry()) {
twisti@3969:     // The interpreter assembly code does not check byte_2,
twisti@3969:     // but it is used by is_resolved, method_if_resolved, etc.
twisti@3969:     set_bytecode_2(invoke_code);
twisti@3969:   }
twisti@3969:   NOT_PRODUCT(verify(tty));
twisti@3969:   if (TraceInvokeDynamic) {
twisti@3969:     this->print(tty, 0);
twisti@3969:   }
jrose@1161: }
jrose@1161: 
twisti@3969: methodOop ConstantPoolCacheEntry::method_if_resolved(constantPoolHandle cpool) {
jrose@2982:   if (is_secondary_entry()) {
twisti@3969:     if (!is_f1_null())
twisti@3969:       return f2_as_vfinal_method();
twisti@3969:     return NULL;
jrose@2982:   }
jrose@2982:   // Decode the action of set_method and set_interface_call
twisti@3969:   Bytecodes::Code invoke_code = bytecode_1();
twisti@3969:   if (invoke_code != (Bytecodes::Code)0) {
jrose@2982:     oop f1 = _f1;
jrose@2982:     if (f1 != NULL) {
jrose@2982:       switch (invoke_code) {
jrose@2982:       case Bytecodes::_invokeinterface:
jrose@2982:         assert(f1->is_klass(), "");
twisti@3969:         return klassItable::method_for_itable_index(klassOop(f1), f2_as_index());
jrose@2982:       case Bytecodes::_invokestatic:
jrose@2982:       case Bytecodes::_invokespecial:
twisti@3969:         assert(!has_appendix(), "");
jrose@2982:         assert(f1->is_method(), "");
jrose@2982:         return methodOop(f1);
jrose@2982:       }
jrose@2982:     }
jrose@2982:   }
twisti@3969:   invoke_code = bytecode_2();
twisti@3969:   if (invoke_code != (Bytecodes::Code)0) {
jrose@2982:     switch (invoke_code) {
jrose@2982:     case Bytecodes::_invokevirtual:
jrose@2982:       if (is_vfinal()) {
jrose@2982:         // invokevirtual
twisti@3969:         methodOop m = f2_as_vfinal_method();
jrose@2982:         assert(m->is_method(), "");
jrose@2982:         return m;
jrose@2982:       } else {
jrose@2982:         int holder_index = cpool->uncached_klass_ref_index_at(constant_pool_index());
jrose@2982:         if (cpool->tag_at(holder_index).is_klass()) {
jrose@2982:           klassOop klass = cpool->resolved_klass_at(holder_index);
jrose@2982:           if (!Klass::cast(klass)->oop_is_instance())
jrose@2982:             klass = SystemDictionary::Object_klass();
twisti@3969:           return instanceKlass::cast(klass)->method_at_vtable(f2_as_index());
jrose@2982:         }
jrose@2982:       }
twisti@3969:       break;
twisti@3969:     case Bytecodes::_invokehandle:
twisti@3969:     case Bytecodes::_invokedynamic:
twisti@3969:       return f2_as_vfinal_method();
jrose@2982:     }
jrose@2982:   }
jrose@2982:   return NULL;
jrose@2982: }
jrose@2982: 
jrose@2982: 
duke@435: class LocalOopClosure: public OopClosure {
duke@435:  private:
duke@435:   void (*_f)(oop*);
duke@435: 
duke@435:  public:
duke@435:   LocalOopClosure(void f(oop*))        { _f = f; }
duke@435:   virtual void do_oop(oop* o)          { _f(o); }
coleenp@548:   virtual void do_oop(narrowOop *o)    { ShouldNotReachHere(); }
duke@435: };
duke@435: 
duke@435: 
duke@435: void ConstantPoolCacheEntry::oops_do(void f(oop*)) {
duke@435:   LocalOopClosure blk(f);
duke@435:   oop_iterate(&blk);
duke@435: }
duke@435: 
duke@435: 
duke@435: void ConstantPoolCacheEntry::oop_iterate(OopClosure* blk) {
duke@435:   assert(in_words(size()) == 4, "check code below - may need adjustment");
duke@435:   // field[1] is always oop or NULL
duke@435:   blk->do_oop((oop*)&_f1);
duke@435:   if (is_vfinal()) {
duke@435:     blk->do_oop((oop*)&_f2);
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: void ConstantPoolCacheEntry::oop_iterate_m(OopClosure* blk, MemRegion mr) {
duke@435:   assert(in_words(size()) == 4, "check code below - may need adjustment");
duke@435:   // field[1] is always oop or NULL
duke@435:   if (mr.contains((oop *)&_f1)) blk->do_oop((oop*)&_f1);
duke@435:   if (is_vfinal()) {
duke@435:     if (mr.contains((oop *)&_f2)) blk->do_oop((oop*)&_f2);
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: void ConstantPoolCacheEntry::follow_contents() {
duke@435:   assert(in_words(size()) == 4, "check code below - may need adjustment");
duke@435:   // field[1] is always oop or NULL
duke@435:   MarkSweep::mark_and_push((oop*)&_f1);
duke@435:   if (is_vfinal()) {
duke@435:     MarkSweep::mark_and_push((oop*)&_f2);
duke@435:   }
duke@435: }
duke@435: 
duke@435: #ifndef SERIALGC
duke@435: void ConstantPoolCacheEntry::follow_contents(ParCompactionManager* cm) {
duke@435:   assert(in_words(size()) == 4, "check code below - may need adjustment");
duke@435:   // field[1] is always oop or NULL
duke@435:   PSParallelCompact::mark_and_push(cm, (oop*)&_f1);
duke@435:   if (is_vfinal()) {
duke@435:     PSParallelCompact::mark_and_push(cm, (oop*)&_f2);
duke@435:   }
duke@435: }
duke@435: #endif // SERIALGC
duke@435: 
duke@435: void ConstantPoolCacheEntry::adjust_pointers() {
duke@435:   assert(in_words(size()) == 4, "check code below - may need adjustment");
duke@435:   // field[1] is always oop or NULL
duke@435:   MarkSweep::adjust_pointer((oop*)&_f1);
duke@435:   if (is_vfinal()) {
duke@435:     MarkSweep::adjust_pointer((oop*)&_f2);
duke@435:   }
duke@435: }
duke@435: 
duke@435: #ifndef SERIALGC
duke@435: void ConstantPoolCacheEntry::update_pointers() {
duke@435:   assert(in_words(size()) == 4, "check code below - may need adjustment");
duke@435:   // field[1] is always oop or NULL
duke@435:   PSParallelCompact::adjust_pointer((oop*)&_f1);
duke@435:   if (is_vfinal()) {
duke@435:     PSParallelCompact::adjust_pointer((oop*)&_f2);
duke@435:   }
duke@435: }
duke@435: #endif // SERIALGC
duke@435: 
duke@435: // RedefineClasses() API support:
duke@435: // If this constantPoolCacheEntry refers to old_method then update it
duke@435: // to refer to new_method.
duke@435: bool ConstantPoolCacheEntry::adjust_method_entry(methodOop old_method,
duke@435:        methodOop new_method, bool * trace_name_printed) {
duke@435: 
duke@435:   if (is_vfinal()) {
twisti@3969:     // virtual and final so _f2 contains method ptr instead of vtable index
twisti@3969:     if (f2_as_vfinal_method() == old_method) {
duke@435:       // match old_method so need an update
twisti@3969:       // NOTE: can't use set_f2_as_vfinal_method as it asserts on different values
duke@435:       _f2 = (intptr_t)new_method;
duke@435:       if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) {
duke@435:         if (!(*trace_name_printed)) {
duke@435:           // RC_TRACE_MESG macro has an embedded ResourceMark
duke@435:           RC_TRACE_MESG(("adjust: name=%s",
duke@435:             Klass::cast(old_method->method_holder())->external_name()));
duke@435:           *trace_name_printed = true;
duke@435:         }
duke@435:         // RC_TRACE macro has an embedded ResourceMark
duke@435:         RC_TRACE(0x00400000, ("cpc vf-entry update: %s(%s)",
duke@435:           new_method->name()->as_C_string(),
duke@435:           new_method->signature()->as_C_string()));
duke@435:       }
duke@435: 
duke@435:       return true;
duke@435:     }
duke@435: 
duke@435:     // f1() is not used with virtual entries so bail out
duke@435:     return false;
duke@435:   }
duke@435: 
duke@435:   if ((oop)_f1 == NULL) {
duke@435:     // NULL f1() means this is a virtual entry so bail out
duke@435:     // We are assuming that the vtable index does not need change.
duke@435:     return false;
duke@435:   }
duke@435: 
duke@435:   if ((oop)_f1 == old_method) {
duke@435:     _f1 = new_method;
duke@435:     if (RC_TRACE_IN_RANGE(0x00100000, 0x00400000)) {
duke@435:       if (!(*trace_name_printed)) {
duke@435:         // RC_TRACE_MESG macro has an embedded ResourceMark
duke@435:         RC_TRACE_MESG(("adjust: name=%s",
duke@435:           Klass::cast(old_method->method_holder())->external_name()));
duke@435:         *trace_name_printed = true;
duke@435:       }
duke@435:       // RC_TRACE macro has an embedded ResourceMark
duke@435:       RC_TRACE(0x00400000, ("cpc entry update: %s(%s)",
duke@435:         new_method->name()->as_C_string(),
duke@435:         new_method->signature()->as_C_string()));
duke@435:     }
duke@435: 
duke@435:     return true;
duke@435:   }
duke@435: 
duke@435:   return false;
duke@435: }
duke@435: 
duke@435: bool ConstantPoolCacheEntry::is_interesting_method_entry(klassOop k) {
duke@435:   if (!is_method_entry()) {
duke@435:     // not a method entry so not interesting by default
duke@435:     return false;
duke@435:   }
duke@435: 
duke@435:   methodOop m = NULL;
duke@435:   if (is_vfinal()) {
duke@435:     // virtual and final so _f2 contains method ptr instead of vtable index
twisti@3969:     m = f2_as_vfinal_method();
twisti@3969:   } else if (is_f1_null()) {
duke@435:     // NULL _f1 means this is a virtual entry so also not interesting
duke@435:     return false;
duke@435:   } else {
twisti@3969:     oop f1 = _f1;  // _f1 is volatile
twisti@3969:     if (!f1->is_method()) {
duke@435:       // _f1 can also contain a klassOop for an interface
duke@435:       return false;
duke@435:     }
twisti@3969:     m = f1_as_method();
duke@435:   }
duke@435: 
duke@435:   assert(m != NULL && m->is_method(), "sanity check");
duke@435:   if (m == NULL || !m->is_method() || m->method_holder() != k) {
duke@435:     // robustness for above sanity checks or method is not in
duke@435:     // the interesting class
duke@435:     return false;
duke@435:   }
duke@435: 
duke@435:   // the method is in the interesting class so the entry is interesting
duke@435:   return true;
duke@435: }
duke@435: 
duke@435: void ConstantPoolCacheEntry::print(outputStream* st, int index) const {
duke@435:   // print separator
dholmes@3601:   if (index == 0) st->print_cr("                 -------------");
duke@435:   // print entry
dholmes@3601:   st->print("%3d  ("PTR_FORMAT")  ", index, (intptr_t)this);
jrose@1161:   if (is_secondary_entry())
dholmes@3601:     st->print_cr("[%5d|secondary]", main_entry_index());
jrose@1161:   else
dholmes@3601:     st->print_cr("[%02x|%02x|%5d]", bytecode_2(), bytecode_1(), constant_pool_index());
dholmes@3601:   st->print_cr("                 [   "PTR_FORMAT"]", (intptr_t)(oop)_f1);
dholmes@3601:   st->print_cr("                 [   "PTR_FORMAT"]", (intptr_t)_f2);
dholmes@3601:   st->print_cr("                 [   "PTR_FORMAT"]", (intptr_t)_flags);
dholmes@3601:   st->print_cr("                 -------------");
duke@435: }
duke@435: 
duke@435: void ConstantPoolCacheEntry::verify(outputStream* st) const {
duke@435:   // not implemented yet
duke@435: }
duke@435: 
duke@435: // Implementation of ConstantPoolCache
duke@435: 
duke@435: void constantPoolCacheOopDesc::initialize(intArray& inverse_index_map) {
duke@435:   assert(inverse_index_map.length() == length(), "inverse index map must have same length as cache");
jrose@1494:   for (int i = 0; i < length(); i++) {
jrose@1494:     ConstantPoolCacheEntry* e = entry_at(i);
jrose@1494:     int original_index = inverse_index_map[i];
jrose@1494:     if ((original_index & Rewriter::_secondary_entry_tag) != 0) {
jrose@1494:       int main_index = (original_index - Rewriter::_secondary_entry_tag);
jrose@1494:       assert(!entry_at(main_index)->is_secondary_entry(), "valid main index");
jrose@1494:       e->initialize_secondary_entry(main_index);
jrose@1494:     } else {
jrose@1494:       e->initialize_entry(original_index);
jrose@1494:     }
jrose@1494:     assert(entry_at(i) == e, "sanity");
jrose@1494:   }
duke@435: }
duke@435: 
duke@435: // RedefineClasses() API support:
duke@435: // If any entry of this constantPoolCache points to any of
duke@435: // old_methods, replace it with the corresponding new_method.
duke@435: void constantPoolCacheOopDesc::adjust_method_entries(methodOop* old_methods, methodOop* new_methods,
duke@435:                                                      int methods_length, bool * trace_name_printed) {
duke@435: 
duke@435:   if (methods_length == 0) {
duke@435:     // nothing to do if there are no methods
duke@435:     return;
duke@435:   }
duke@435: 
duke@435:   // get shorthand for the interesting class
duke@435:   klassOop old_holder = old_methods[0]->method_holder();
duke@435: 
duke@435:   for (int i = 0; i < length(); i++) {
duke@435:     if (!entry_at(i)->is_interesting_method_entry(old_holder)) {
duke@435:       // skip uninteresting methods
duke@435:       continue;
duke@435:     }
duke@435: 
duke@435:     // The constantPoolCache contains entries for several different
duke@435:     // things, but we only care about methods. In fact, we only care
duke@435:     // about methods in the same class as the one that contains the
duke@435:     // old_methods. At this point, we have an interesting entry.
duke@435: 
duke@435:     for (int j = 0; j < methods_length; j++) {
duke@435:       methodOop old_method = old_methods[j];
duke@435:       methodOop new_method = new_methods[j];
duke@435: 
duke@435:       if (entry_at(i)->adjust_method_entry(old_method, new_method,
duke@435:           trace_name_printed)) {
duke@435:         // current old_method matched this entry and we updated it so
duke@435:         // break out and get to the next interesting entry if there one
duke@435:         break;
duke@435:       }
duke@435:     }
duke@435:   }
duke@435: }