duke@435: /* dcubed@4562: * Copyright (c) 1998, 2013, 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" coleenp@4037: #include "oops/cpCache.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" jprovino@4542: #include "utilities/macros.hpp" jprovino@4542: #if INCLUDE_ALL_GCS coleenp@4037: # include "gc_implementation/parallelScavenge/psPromotionManager.hpp" jprovino@4542: #endif // INCLUDE_ALL_GCS 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: 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) { 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) { 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. coleenp@4037: void ConstantPoolCacheEntry::release_set_f1(Metadata* f1) { twisti@3969: assert(f1 != NULL, ""); coleenp@4037: OrderAccess::release_store_ptr((HeapWord*) &_f1, 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: // 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, coleenp@4037: bool is_volatile, coleenp@4037: Klass* root_klass) { coleenp@4037: set_f1(field_holder()); 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) { 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) { coleenp@4251: InstanceKlass* interf = method->method_holder(); coleenp@4251: assert(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@4253: void ConstantPoolCacheEntry::set_method_handle(constantPoolHandle cpool, const CallInfo &call_info) { twisti@4253: set_method_handle_common(cpool, Bytecodes::_invokehandle, call_info); jrose@2015: } jrose@2015: twisti@4253: void ConstantPoolCacheEntry::set_dynamic_call(constantPoolHandle cpool, const CallInfo &call_info) { twisti@4253: set_method_handle_common(cpool, Bytecodes::_invokedynamic, call_info); jrose@2015: } jrose@2015: twisti@4049: void ConstantPoolCacheEntry::set_method_handle_common(constantPoolHandle cpool, twisti@4049: Bytecodes::Code invoke_code, twisti@4253: const CallInfo &call_info) { twisti@3969: // NOTE: This CPCE can be the subject of data races. coleenp@4037: // There are three words to update: flags, refs[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@4049: // Competing writers must acquire exclusive access via a lock. twisti@4049: // A losing writer waits on the lock until the winner writes f1 and leaves twisti@4049: // the lock, so that when the losing writer returns, he can use the linked twisti@4049: // cache entry. twisti@4049: twisti@4049: MonitorLockerEx ml(cpool->lock()); twisti@4049: if (!is_f1_null()) { twisti@4049: return; twisti@4049: } twisti@3969: twisti@4253: const methodHandle adapter = call_info.resolved_method(); twisti@4253: const Handle appendix = call_info.resolved_appendix(); twisti@4253: const Handle method_type = call_info.resolved_method_type(); twisti@4133: const bool has_appendix = appendix.not_null(); twisti@4133: const bool has_method_type = method_type.not_null(); twisti@3969: coleenp@4037: // Write the flags. twisti@4049: set_method_flags(as_TosState(adapter->result_type()), twisti@4133: ((has_appendix ? 1 : 0) << has_appendix_shift ) | twisti@4133: ((has_method_type ? 1 : 0) << has_method_type_shift) | twisti@4133: ( 1 << is_final_shift ), twisti@3969: adapter->size_of_parameters()); twisti@3969: twisti@3969: if (TraceInvokeDynamic) { twisti@4133: tty->print_cr("set_method_handle bc=%d appendix="PTR_FORMAT"%s method_type="PTR_FORMAT"%s method="PTR_FORMAT" ", twisti@3969: invoke_code, twisti@4133: (intptr_t)appendix(), (has_appendix ? "" : " (unused)"), twisti@4133: (intptr_t)method_type(), (has_method_type ? "" : " (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. coleenp@4037: // refs[f2], 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. coleenp@4037: // f1 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.) coleenp@4037: // JVM-level linking is via f1, as if for invokespecial, and signatures are erased. twisti@3969: // The appendix argument (if any) is added to the signature, and is counted in the parameter_size bits. coleenp@4037: // Even with the appendix, the method will never take more than 255 parameter slots. twisti@3969: // twisti@3969: // This means that given a call site like (List)mh.invoke("foo"), coleenp@4037: // the f1 method has signature '(Ljl/Object;Ljl/invoke/MethodType;)Ljl/Object;', twisti@3969: // not '(Ljava/lang/String;)Ljava/util/List;'. coleenp@4037: // The fact that String and List are involved is encoded in the MethodType in refs[f2]. twisti@3969: // This allows us to create fewer method oops, while keeping type safety. twisti@3969: // coleenp@4037: twisti@4253: objArrayHandle resolved_references = cpool->resolved_references(); twisti@4133: // Store appendix, if any. coleenp@4037: if (has_appendix) { twisti@4133: const int appendix_index = f2_as_index() + _indy_resolved_references_appendix_offset; twisti@4133: assert(appendix_index >= 0 && appendix_index < resolved_references->length(), "oob"); twisti@4133: assert(resolved_references->obj_at(appendix_index) == NULL, "init just once"); twisti@4133: resolved_references->obj_at_put(appendix_index, appendix()); twisti@4133: } twisti@4133: twisti@4133: // Store MethodType, if any. twisti@4133: if (has_method_type) { twisti@4133: const int method_type_index = f2_as_index() + _indy_resolved_references_method_type_offset; twisti@4133: assert(method_type_index >= 0 && method_type_index < resolved_references->length(), "oob"); twisti@4133: assert(resolved_references->obj_at(method_type_index) == NULL, "init just once"); twisti@4133: resolved_references->obj_at_put(method_type_index, method_type()); coleenp@4037: } coleenp@4037: coleenp@4037: release_set_f1(adapter()); // This must be the last one to set (see NOTE above)! coleenp@4037: twisti@4133: // The interpreter assembly code does not check byte_2, twisti@4133: // but it is used by is_resolved, method_if_resolved, etc. coleenp@4037: set_bytecode_1(invoke_code); twisti@3969: NOT_PRODUCT(verify(tty)); twisti@3969: if (TraceInvokeDynamic) { twisti@3969: this->print(tty, 0); twisti@3969: } jrose@1161: } jrose@1161: coleenp@4037: Method* ConstantPoolCacheEntry::method_if_resolved(constantPoolHandle cpool) { 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) { coleenp@4037: Metadata* f1 = (Metadata*)_f1; jrose@2982: if (f1 != NULL) { jrose@2982: switch (invoke_code) { jrose@2982: case Bytecodes::_invokeinterface: jrose@2982: assert(f1->is_klass(), ""); coleenp@4037: return klassItable::method_for_itable_index((Klass*)f1, f2_as_index()); jrose@2982: case Bytecodes::_invokestatic: jrose@2982: case Bytecodes::_invokespecial: twisti@3969: assert(!has_appendix(), ""); coleenp@4037: case Bytecodes::_invokehandle: coleenp@4037: case Bytecodes::_invokedynamic: jrose@2982: assert(f1->is_method(), ""); coleenp@4037: return (Method*)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 coleenp@4037: Method* 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()) { coleenp@4037: Klass* klass = cpool->resolved_klass_at(holder_index); hseigel@4278: if (!klass->oop_is_instance()) jrose@2982: klass = SystemDictionary::Object_klass(); coleenp@4037: return InstanceKlass::cast(klass)->method_at_vtable(f2_as_index()); jrose@2982: } jrose@2982: } twisti@3969: break; jrose@2982: } jrose@2982: } jrose@2982: return NULL; jrose@2982: } jrose@2982: jrose@2982: coleenp@4037: oop ConstantPoolCacheEntry::appendix_if_resolved(constantPoolHandle cpool) { coleenp@4037: if (is_f1_null() || !has_appendix()) coleenp@4037: return NULL; twisti@4133: const int ref_index = f2_as_index() + _indy_resolved_references_appendix_offset; twisti@4133: objArrayOop resolved_references = cpool->resolved_references(); twisti@4133: return resolved_references->obj_at(ref_index); twisti@4133: } twisti@4133: twisti@4133: twisti@4133: oop ConstantPoolCacheEntry::method_type_if_resolved(constantPoolHandle cpool) { twisti@4133: if (is_f1_null() || !has_method_type()) twisti@4133: return NULL; twisti@4133: const int ref_index = f2_as_index() + _indy_resolved_references_method_type_offset; coleenp@4037: objArrayOop resolved_references = cpool->resolved_references(); coleenp@4037: return resolved_references->obj_at(ref_index); duke@435: } duke@435: duke@435: dcubed@4562: #if INCLUDE_JVMTI duke@435: // RedefineClasses() API support: dcubed@4562: // If this ConstantPoolCacheEntry refers to old_method then update it duke@435: // to refer to new_method. coleenp@4037: bool ConstantPoolCacheEntry::adjust_method_entry(Method* old_method, coleenp@4037: Method* 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", coleenp@4251: 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: coleenp@4037: if (_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: coleenp@4037: if (_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", coleenp@4251: 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: dcubed@4562: // a constant pool cache entry should never contain old or obsolete methods dcubed@4562: bool ConstantPoolCacheEntry::check_no_old_or_obsolete_entries() { coleenp@4037: if (is_vfinal()) { dcubed@4562: // virtual and final so _f2 contains method ptr instead of vtable index coleenp@4037: Metadata* f2 = (Metadata*)_f2; dcubed@4562: // Return false if _f2 refers to an old or an obsolete method. dcubed@4562: // _f2 == NULL || !_f2->is_method() are just as unexpected here. dcubed@4562: return (f2 != NULL NOT_PRODUCT(&& f2->is_valid()) && f2->is_method() && dcubed@4562: !((Method*)f2)->is_old() && !((Method*)f2)->is_obsolete()); dcubed@4562: } else if (_f1 == NULL || dcubed@4562: (NOT_PRODUCT(_f1->is_valid() &&) !_f1->is_method())) { dcubed@4562: // _f1 == NULL || !_f1->is_method() are OK here dcubed@4562: return true; coleenp@4037: } dcubed@4562: // return false if _f1 refers to an old or an obsolete method dcubed@4562: return (NOT_PRODUCT(_f1->is_valid() &&) _f1->is_method() && dcubed@4562: !((Method*)_f1)->is_old() && !((Method*)_f1)->is_obsolete()); coleenp@4037: } coleenp@4037: coleenp@4037: bool ConstantPoolCacheEntry::is_interesting_method_entry(Klass* 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: coleenp@4037: Method* 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 { coleenp@4037: if (!(_f1->is_method())) { coleenp@4037: // _f1 can also contain a Klass* 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"); coleenp@4037: if (m == NULL || !m->is_method() || (k != NULL && 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: } dcubed@4562: #endif // INCLUDE_JVMTI 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); dcubed@4562: st->print_cr("[%02x|%02x|%5d]", bytecode_2(), bytecode_1(), dcubed@4562: constant_pool_index()); coleenp@4037: st->print_cr(" [ "PTR_FORMAT"]", (intptr_t)_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: coleenp@4037: ConstantPoolCache* ConstantPoolCache::allocate(ClassLoaderData* loader_data, int length, TRAPS) { coleenp@4037: int size = ConstantPoolCache::size(length); coleenp@4037: coleenp@4037: return new (loader_data, size, false, THREAD) ConstantPoolCache(length); coleenp@4037: } coleenp@4037: coleenp@4037: void ConstantPoolCache::initialize(intArray& inverse_index_map, intArray& invokedynamic_references_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]; twisti@4133: e->initialize_entry(original_index); coleenp@4037: assert(entry_at(i) == e, "sanity"); twisti@4133: } twisti@4133: for (int ref = 0; ref < invokedynamic_references_map.length(); ref++) { twisti@4133: const int cpci = invokedynamic_references_map[ref]; twisti@4133: if (cpci >= 0) { twisti@4133: #ifdef ASSERT twisti@4133: // invokedynamic and invokehandle have more entries; check if they twisti@4133: // all point to the same constant pool cache entry. twisti@4133: for (int entry = 1; entry < ConstantPoolCacheEntry::_indy_resolved_references_entries; entry++) { twisti@4133: const int cpci_next = invokedynamic_references_map[ref + entry]; twisti@4133: assert(cpci == cpci_next, err_msg_res("%d == %d", cpci, cpci_next)); twisti@4133: } twisti@4133: #endif twisti@4133: entry_at(cpci)->initialize_resolved_reference_index(ref); twisti@4133: ref += ConstantPoolCacheEntry::_indy_resolved_references_entries - 1; // skip extra entries jrose@1494: } jrose@1494: } duke@435: } duke@435: dcubed@4562: #if INCLUDE_JVMTI duke@435: // RedefineClasses() API support: dcubed@4562: // If any entry of this ConstantPoolCache points to any of duke@435: // old_methods, replace it with the corresponding new_method. coleenp@4037: void ConstantPoolCache::adjust_method_entries(Method** old_methods, Method** 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 coleenp@4037: Klass* 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: dcubed@4562: // 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++) { coleenp@4037: Method* old_method = old_methods[j]; coleenp@4037: Method* 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: } coleenp@4037: dcubed@4562: // the constant pool cache should never contain old or obsolete methods dcubed@4562: bool ConstantPoolCache::check_no_old_or_obsolete_entries() { coleenp@4037: for (int i = 1; i < length(); i++) { coleenp@4037: if (entry_at(i)->is_interesting_method_entry(NULL) && dcubed@4562: !entry_at(i)->check_no_old_or_obsolete_entries()) { coleenp@4037: return false; coleenp@4037: } coleenp@4037: } coleenp@4037: return true; coleenp@4037: } dcubed@4562: dcubed@4562: void ConstantPoolCache::dump_cache() { dcubed@4562: for (int i = 1; i < length(); i++) { dcubed@4562: if (entry_at(i)->is_interesting_method_entry(NULL)) { dcubed@4562: entry_at(i)->print(tty, i); dcubed@4562: } dcubed@4562: } dcubed@4562: } dcubed@4562: #endif // INCLUDE_JVMTI coleenp@4037: coleenp@4037: coleenp@4037: // Printing coleenp@4037: coleenp@4037: void ConstantPoolCache::print_on(outputStream* st) const { coleenp@4037: assert(is_constantPoolCache(), "obj must be constant pool cache"); coleenp@4037: st->print_cr(internal_name()); coleenp@4037: // print constant pool cache entries coleenp@4037: for (int i = 0; i < length(); i++) entry_at(i)->print(st, i); coleenp@4037: } coleenp@4037: coleenp@4037: void ConstantPoolCache::print_value_on(outputStream* st) const { coleenp@4037: assert(is_constantPoolCache(), "obj must be constant pool cache"); coleenp@4037: st->print("cache [%d]", length()); coleenp@4037: print_address_on(st); coleenp@4037: st->print(" for "); coleenp@4037: constant_pool()->print_value_on(st); coleenp@4037: } coleenp@4037: coleenp@4037: coleenp@4037: // Verification coleenp@4037: coleenp@4037: void ConstantPoolCache::verify_on(outputStream* st) { coleenp@4037: guarantee(is_constantPoolCache(), "obj must be constant pool cache"); coleenp@4037: // print constant pool cache entries coleenp@4037: for (int i = 0; i < length(); i++) entry_at(i)->verify(st); coleenp@4037: }