duke@435: /* xdono@631: * Copyright 1997-2008 Sun Microsystems, Inc. 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: * duke@435: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, duke@435: * CA 95054 USA or visit www.sun.com if you need additional information or duke@435: * have any questions. duke@435: * duke@435: */ duke@435: duke@435: # include "incls/_precompiled.incl" duke@435: # include "incls/_methodOop.cpp.incl" duke@435: duke@435: duke@435: // Implementation of methodOopDesc duke@435: duke@435: address methodOopDesc::get_i2c_entry() { duke@435: assert(_adapter != NULL, "must have"); duke@435: return _adapter->get_i2c_entry(); duke@435: } duke@435: duke@435: address methodOopDesc::get_c2i_entry() { duke@435: assert(_adapter != NULL, "must have"); duke@435: return _adapter->get_c2i_entry(); duke@435: } duke@435: duke@435: address methodOopDesc::get_c2i_unverified_entry() { duke@435: assert(_adapter != NULL, "must have"); duke@435: return _adapter->get_c2i_unverified_entry(); duke@435: } duke@435: duke@435: char* methodOopDesc::name_and_sig_as_C_string() { duke@435: return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature()); duke@435: } duke@435: duke@435: char* methodOopDesc::name_and_sig_as_C_string(char* buf, int size) { duke@435: return name_and_sig_as_C_string(Klass::cast(constants()->pool_holder()), name(), signature(), buf, size); duke@435: } duke@435: duke@435: char* methodOopDesc::name_and_sig_as_C_string(Klass* klass, symbolOop method_name, symbolOop signature) { duke@435: const char* klass_name = klass->external_name(); duke@435: int klass_name_len = (int)strlen(klass_name); duke@435: int method_name_len = method_name->utf8_length(); duke@435: int len = klass_name_len + 1 + method_name_len + signature->utf8_length(); duke@435: char* dest = NEW_RESOURCE_ARRAY(char, len + 1); duke@435: strcpy(dest, klass_name); duke@435: dest[klass_name_len] = '.'; duke@435: strcpy(&dest[klass_name_len + 1], method_name->as_C_string()); duke@435: strcpy(&dest[klass_name_len + 1 + method_name_len], signature->as_C_string()); duke@435: dest[len] = 0; duke@435: return dest; duke@435: } duke@435: duke@435: char* methodOopDesc::name_and_sig_as_C_string(Klass* klass, symbolOop method_name, symbolOop signature, char* buf, int size) { duke@435: symbolOop klass_name = klass->name(); duke@435: klass_name->as_klass_external_name(buf, size); duke@435: int len = (int)strlen(buf); duke@435: duke@435: if (len < size - 1) { duke@435: buf[len++] = '.'; duke@435: duke@435: method_name->as_C_string(&(buf[len]), size - len); duke@435: len = (int)strlen(buf); duke@435: duke@435: signature->as_C_string(&(buf[len]), size - len); duke@435: } duke@435: duke@435: return buf; duke@435: } duke@435: duke@435: int methodOopDesc::fast_exception_handler_bci_for(KlassHandle ex_klass, int throw_bci, TRAPS) { duke@435: // exception table holds quadruple entries of the form (beg_bci, end_bci, handler_bci, klass_index) duke@435: const int beg_bci_offset = 0; duke@435: const int end_bci_offset = 1; duke@435: const int handler_bci_offset = 2; duke@435: const int klass_index_offset = 3; duke@435: const int entry_size = 4; duke@435: // access exception table duke@435: typeArrayHandle table (THREAD, constMethod()->exception_table()); duke@435: int length = table->length(); duke@435: assert(length % entry_size == 0, "exception table format has changed"); duke@435: // iterate through all entries sequentially duke@435: constantPoolHandle pool(THREAD, constants()); duke@435: for (int i = 0; i < length; i += entry_size) { duke@435: int beg_bci = table->int_at(i + beg_bci_offset); duke@435: int end_bci = table->int_at(i + end_bci_offset); duke@435: assert(beg_bci <= end_bci, "inconsistent exception table"); duke@435: if (beg_bci <= throw_bci && throw_bci < end_bci) { duke@435: // exception handler bci range covers throw_bci => investigate further duke@435: int handler_bci = table->int_at(i + handler_bci_offset); duke@435: int klass_index = table->int_at(i + klass_index_offset); duke@435: if (klass_index == 0) { duke@435: return handler_bci; duke@435: } else if (ex_klass.is_null()) { duke@435: return handler_bci; duke@435: } else { duke@435: // we know the exception class => get the constraint class duke@435: // this may require loading of the constraint class; if verification duke@435: // fails or some other exception occurs, return handler_bci duke@435: klassOop k = pool->klass_at(klass_index, CHECK_(handler_bci)); duke@435: KlassHandle klass = KlassHandle(THREAD, k); duke@435: assert(klass.not_null(), "klass not loaded"); duke@435: if (ex_klass->is_subtype_of(klass())) { duke@435: return handler_bci; duke@435: } duke@435: } duke@435: } duke@435: } duke@435: duke@435: return -1; duke@435: } duke@435: duke@435: methodOop methodOopDesc::method_from_bcp(address bcp) { duke@435: debug_only(static int count = 0; count++); duke@435: assert(Universe::heap()->is_in_permanent(bcp), "bcp not in perm_gen"); duke@435: // TO DO: this may be unsafe in some configurations duke@435: HeapWord* p = Universe::heap()->block_start(bcp); duke@435: assert(Universe::heap()->block_is_obj(p), "must be obj"); duke@435: assert(oop(p)->is_constMethod(), "not a method"); duke@435: return constMethodOop(p)->method(); duke@435: } duke@435: duke@435: duke@435: void methodOopDesc::mask_for(int bci, InterpreterOopMap* mask) { duke@435: duke@435: Thread* myThread = Thread::current(); duke@435: methodHandle h_this(myThread, this); duke@435: #ifdef ASSERT duke@435: bool has_capability = myThread->is_VM_thread() || duke@435: myThread->is_ConcurrentGC_thread() || duke@435: myThread->is_GC_task_thread(); duke@435: duke@435: if (!has_capability) { duke@435: if (!VerifyStack && !VerifyLastFrame) { duke@435: // verify stack calls this outside VM thread duke@435: warning("oopmap should only be accessed by the " duke@435: "VM, GC task or CMS threads (or during debugging)"); duke@435: InterpreterOopMap local_mask; duke@435: instanceKlass::cast(method_holder())->mask_for(h_this, bci, &local_mask); duke@435: local_mask.print(); duke@435: } duke@435: } duke@435: #endif duke@435: instanceKlass::cast(method_holder())->mask_for(h_this, bci, mask); duke@435: return; duke@435: } duke@435: duke@435: duke@435: int methodOopDesc::bci_from(address bcp) const { duke@435: assert(is_native() && bcp == code_base() || contains(bcp), "bcp doesn't belong to this method"); duke@435: return bcp - code_base(); duke@435: } duke@435: duke@435: duke@435: // Return (int)bcx if it appears to be a valid BCI. duke@435: // Return bci_from((address)bcx) if it appears to be a valid BCP. duke@435: // Return -1 otherwise. duke@435: // Used by profiling code, when invalid data is a possibility. duke@435: // The caller is responsible for validating the methodOop itself. duke@435: int methodOopDesc::validate_bci_from_bcx(intptr_t bcx) const { duke@435: // keep bci as -1 if not a valid bci duke@435: int bci = -1; duke@435: if (bcx == 0 || (address)bcx == code_base()) { duke@435: // code_size() may return 0 and we allow 0 here duke@435: // the method may be native duke@435: bci = 0; duke@435: } else if (frame::is_bci(bcx)) { duke@435: if (bcx < code_size()) { duke@435: bci = (int)bcx; duke@435: } duke@435: } else if (contains((address)bcx)) { duke@435: bci = (address)bcx - code_base(); duke@435: } duke@435: // Assert that if we have dodged any asserts, bci is negative. duke@435: assert(bci == -1 || bci == bci_from(bcp_from(bci)), "sane bci if >=0"); duke@435: return bci; duke@435: } duke@435: duke@435: address methodOopDesc::bcp_from(int bci) const { duke@435: assert((is_native() && bci == 0) || (!is_native() && 0 <= bci && bci < code_size()), "illegal bci"); duke@435: address bcp = code_base() + bci; duke@435: assert(is_native() && bcp == code_base() || contains(bcp), "bcp doesn't belong to this method"); duke@435: return bcp; duke@435: } duke@435: duke@435: duke@435: int methodOopDesc::object_size(bool is_native) { duke@435: // If native, then include pointers for native_function and signature_handler duke@435: int extra_bytes = (is_native) ? 2*sizeof(address*) : 0; duke@435: int extra_words = align_size_up(extra_bytes, BytesPerWord) / BytesPerWord; duke@435: return align_object_size(header_size() + extra_words); duke@435: } duke@435: duke@435: duke@435: symbolOop methodOopDesc::klass_name() const { duke@435: klassOop k = method_holder(); duke@435: assert(k->is_klass(), "must be klass"); duke@435: instanceKlass* ik = (instanceKlass*) k->klass_part(); duke@435: return ik->name(); duke@435: } duke@435: duke@435: duke@435: void methodOopDesc::set_interpreter_kind() { duke@435: int kind = Interpreter::method_kind(methodOop(this)); duke@435: assert(kind != Interpreter::invalid, duke@435: "interpreter entry must be valid"); duke@435: set_interpreter_kind(kind); duke@435: } duke@435: duke@435: duke@435: // Attempt to return method oop to original state. Clear any pointers duke@435: // (to objects outside the shared spaces). We won't be able to predict duke@435: // where they should point in a new JVM. Further initialize some duke@435: // entries now in order allow them to be write protected later. duke@435: duke@435: void methodOopDesc::remove_unshareable_info() { duke@435: unlink_method(); duke@435: set_interpreter_kind(); duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::was_executed_more_than(int n) const { duke@435: // Invocation counter is reset when the methodOop is compiled. duke@435: // If the method has compiled code we therefore assume it has duke@435: // be excuted more than n times. duke@435: if (is_accessor() || is_empty_method() || (code() != NULL)) { duke@435: // interpreter doesn't bump invocation counter of trivial methods duke@435: // compiler does not bump invocation counter of compiled methods duke@435: return true; duke@435: } else if (_invocation_counter.carry()) { duke@435: // The carry bit is set when the counter overflows and causes duke@435: // a compilation to occur. We don't know how many times duke@435: // the counter has been reset, so we simply assume it has duke@435: // been executed more than n times. duke@435: return true; duke@435: } else { duke@435: return invocation_count() > n; duke@435: } duke@435: } duke@435: duke@435: #ifndef PRODUCT duke@435: void methodOopDesc::print_invocation_count() const { duke@435: if (is_static()) tty->print("static "); duke@435: if (is_final()) tty->print("final "); duke@435: if (is_synchronized()) tty->print("synchronized "); duke@435: if (is_native()) tty->print("native "); duke@435: method_holder()->klass_part()->name()->print_symbol_on(tty); duke@435: tty->print("."); duke@435: name()->print_symbol_on(tty); duke@435: signature()->print_symbol_on(tty); duke@435: duke@435: if (WizardMode) { duke@435: // dump the size of the byte codes duke@435: tty->print(" {%d}", code_size()); duke@435: } duke@435: tty->cr(); duke@435: duke@435: tty->print_cr (" interpreter_invocation_count: %8d ", interpreter_invocation_count()); duke@435: tty->print_cr (" invocation_counter: %8d ", invocation_count()); duke@435: tty->print_cr (" backedge_counter: %8d ", backedge_count()); duke@435: if (CountCompiledCalls) { duke@435: tty->print_cr (" compiled_invocation_count: %8d ", compiled_invocation_count()); duke@435: } duke@435: duke@435: } duke@435: #endif duke@435: duke@435: // Build a methodDataOop object to hold information about this method duke@435: // collected in the interpreter. duke@435: void methodOopDesc::build_interpreter_method_data(methodHandle method, TRAPS) { duke@435: // Grab a lock here to prevent multiple duke@435: // methodDataOops from being created. duke@435: MutexLocker ml(MethodData_lock, THREAD); duke@435: if (method->method_data() == NULL) { duke@435: methodDataOop method_data = oopFactory::new_methodData(method, CHECK); duke@435: method->set_method_data(method_data); duke@435: if (PrintMethodData && (Verbose || WizardMode)) { duke@435: ResourceMark rm(THREAD); duke@435: tty->print("build_interpreter_method_data for "); duke@435: method->print_name(tty); duke@435: tty->cr(); duke@435: // At the end of the run, the MDO, full of data, will be dumped. duke@435: } duke@435: } duke@435: } duke@435: duke@435: void methodOopDesc::cleanup_inline_caches() { duke@435: // The current system doesn't use inline caches in the interpreter duke@435: // => nothing to do (keep this method around for future use) duke@435: } duke@435: duke@435: duke@435: void methodOopDesc::compute_size_of_parameters(Thread *thread) { duke@435: symbolHandle h_signature(thread, signature()); duke@435: ArgumentSizeComputer asc(h_signature); duke@435: set_size_of_parameters(asc.size() + (is_static() ? 0 : 1)); duke@435: } duke@435: duke@435: #ifdef CC_INTERP duke@435: void methodOopDesc::set_result_index(BasicType type) { duke@435: _result_index = Interpreter::BasicType_as_index(type); duke@435: } duke@435: #endif duke@435: duke@435: BasicType methodOopDesc::result_type() const { duke@435: ResultTypeFinder rtf(signature()); duke@435: return rtf.type(); duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::is_empty_method() const { duke@435: return code_size() == 1 duke@435: && *code_base() == Bytecodes::_return; duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::is_vanilla_constructor() const { duke@435: // Returns true if this method is a vanilla constructor, i.e. an "" "()V" method duke@435: // which only calls the superclass vanilla constructor and possibly does stores of duke@435: // zero constants to local fields: duke@435: // duke@435: // aload_0 duke@435: // invokespecial duke@435: // indexbyte1 duke@435: // indexbyte2 duke@435: // duke@435: // followed by an (optional) sequence of: duke@435: // duke@435: // aload_0 duke@435: // aconst_null / iconst_0 / fconst_0 / dconst_0 duke@435: // putfield duke@435: // indexbyte1 duke@435: // indexbyte2 duke@435: // duke@435: // followed by: duke@435: // duke@435: // return duke@435: duke@435: assert(name() == vmSymbols::object_initializer_name(), "Should only be called for default constructors"); duke@435: assert(signature() == vmSymbols::void_method_signature(), "Should only be called for default constructors"); duke@435: int size = code_size(); duke@435: // Check if size match duke@435: if (size == 0 || size % 5 != 0) return false; duke@435: address cb = code_base(); duke@435: int last = size - 1; duke@435: if (cb[0] != Bytecodes::_aload_0 || cb[1] != Bytecodes::_invokespecial || cb[last] != Bytecodes::_return) { duke@435: // Does not call superclass default constructor duke@435: return false; duke@435: } duke@435: // Check optional sequence duke@435: for (int i = 4; i < last; i += 5) { duke@435: if (cb[i] != Bytecodes::_aload_0) return false; duke@435: if (!Bytecodes::is_zero_const(Bytecodes::cast(cb[i+1]))) return false; duke@435: if (cb[i+2] != Bytecodes::_putfield) return false; duke@435: } duke@435: return true; duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::compute_has_loops_flag() { duke@435: BytecodeStream bcs(methodOop(this)); duke@435: Bytecodes::Code bc; duke@435: duke@435: while ((bc = bcs.next()) >= 0) { duke@435: switch( bc ) { duke@435: case Bytecodes::_ifeq: duke@435: case Bytecodes::_ifnull: duke@435: case Bytecodes::_iflt: duke@435: case Bytecodes::_ifle: duke@435: case Bytecodes::_ifne: duke@435: case Bytecodes::_ifnonnull: duke@435: case Bytecodes::_ifgt: duke@435: case Bytecodes::_ifge: duke@435: case Bytecodes::_if_icmpeq: duke@435: case Bytecodes::_if_icmpne: duke@435: case Bytecodes::_if_icmplt: duke@435: case Bytecodes::_if_icmpgt: duke@435: case Bytecodes::_if_icmple: duke@435: case Bytecodes::_if_icmpge: duke@435: case Bytecodes::_if_acmpeq: duke@435: case Bytecodes::_if_acmpne: duke@435: case Bytecodes::_goto: duke@435: case Bytecodes::_jsr: duke@435: if( bcs.dest() < bcs.next_bci() ) _access_flags.set_has_loops(); duke@435: break; duke@435: duke@435: case Bytecodes::_goto_w: duke@435: case Bytecodes::_jsr_w: duke@435: if( bcs.dest_w() < bcs.next_bci() ) _access_flags.set_has_loops(); duke@435: break; duke@435: } duke@435: } duke@435: _access_flags.set_loops_flag_init(); duke@435: return _access_flags.has_loops(); duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::is_final_method() const { duke@435: // %%% Should return true for private methods also, duke@435: // since there is no way to override them. duke@435: return is_final() || Klass::cast(method_holder())->is_final(); duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::is_strict_method() const { duke@435: return is_strict(); duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::can_be_statically_bound() const { duke@435: if (is_final_method()) return true; duke@435: return vtable_index() == nonvirtual_vtable_index; duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::is_accessor() const { duke@435: if (code_size() != 5) return false; duke@435: if (size_of_parameters() != 1) return false; coleenp@548: methodOop m = (methodOop)this; // pass to code_at() to avoid method_from_bcp coleenp@548: if (Bytecodes::java_code_at(code_base()+0, m) != Bytecodes::_aload_0 ) return false; coleenp@548: if (Bytecodes::java_code_at(code_base()+1, m) != Bytecodes::_getfield) return false; coleenp@548: if (Bytecodes::java_code_at(code_base()+4, m) != Bytecodes::_areturn && coleenp@548: Bytecodes::java_code_at(code_base()+4, m) != Bytecodes::_ireturn ) return false; duke@435: return true; duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::is_initializer() const { duke@435: return name() == vmSymbols::object_initializer_name() || name() == vmSymbols::class_initializer_name(); duke@435: } duke@435: duke@435: duke@435: objArrayHandle methodOopDesc::resolved_checked_exceptions_impl(methodOop this_oop, TRAPS) { duke@435: int length = this_oop->checked_exceptions_length(); duke@435: if (length == 0) { // common case duke@435: return objArrayHandle(THREAD, Universe::the_empty_class_klass_array()); duke@435: } else { duke@435: methodHandle h_this(THREAD, this_oop); duke@435: objArrayOop m_oop = oopFactory::new_objArray(SystemDictionary::class_klass(), length, CHECK_(objArrayHandle())); duke@435: objArrayHandle mirrors (THREAD, m_oop); duke@435: for (int i = 0; i < length; i++) { duke@435: CheckedExceptionElement* table = h_this->checked_exceptions_start(); // recompute on each iteration, not gc safe duke@435: klassOop k = h_this->constants()->klass_at(table[i].class_cp_index, CHECK_(objArrayHandle())); duke@435: assert(Klass::cast(k)->is_subclass_of(SystemDictionary::throwable_klass()), "invalid exception class"); duke@435: mirrors->obj_at_put(i, Klass::cast(k)->java_mirror()); duke@435: } duke@435: return mirrors; duke@435: } duke@435: }; duke@435: duke@435: duke@435: int methodOopDesc::line_number_from_bci(int bci) const { duke@435: if (bci == SynchronizationEntryBCI) bci = 0; duke@435: assert(bci == 0 || 0 <= bci && bci < code_size(), "illegal bci"); duke@435: int best_bci = 0; duke@435: int best_line = -1; duke@435: duke@435: if (has_linenumber_table()) { duke@435: // The line numbers are a short array of 2-tuples [start_pc, line_number]. duke@435: // Not necessarily sorted and not necessarily one-to-one. duke@435: CompressedLineNumberReadStream stream(compressed_linenumber_table()); duke@435: while (stream.read_pair()) { duke@435: if (stream.bci() == bci) { duke@435: // perfect match duke@435: return stream.line(); duke@435: } else { duke@435: // update best_bci/line duke@435: if (stream.bci() < bci && stream.bci() >= best_bci) { duke@435: best_bci = stream.bci(); duke@435: best_line = stream.line(); duke@435: } duke@435: } duke@435: } duke@435: } duke@435: return best_line; duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::is_klass_loaded_by_klass_index(int klass_index) const { duke@435: if( _constants->tag_at(klass_index).is_unresolved_klass() ) { duke@435: Thread *thread = Thread::current(); duke@435: symbolHandle klass_name(thread, _constants->klass_name_at(klass_index)); duke@435: Handle loader(thread, instanceKlass::cast(method_holder())->class_loader()); duke@435: Handle prot (thread, Klass::cast(method_holder())->protection_domain()); duke@435: return SystemDictionary::find(klass_name, loader, prot, thread) != NULL; duke@435: } else { duke@435: return true; duke@435: } duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::is_klass_loaded(int refinfo_index, bool must_be_resolved) const { duke@435: int klass_index = _constants->klass_ref_index_at(refinfo_index); duke@435: if (must_be_resolved) { duke@435: // Make sure klass is resolved in constantpool. duke@435: if (constants()->tag_at(klass_index).is_unresolved_klass()) return false; duke@435: } duke@435: return is_klass_loaded_by_klass_index(klass_index); duke@435: } duke@435: duke@435: duke@435: void methodOopDesc::set_native_function(address function, bool post_event_flag) { duke@435: assert(function != NULL, "use clear_native_function to unregister natives"); duke@435: address* native_function = native_function_addr(); duke@435: duke@435: // We can see racers trying to place the same native function into place. Once duke@435: // is plenty. duke@435: address current = *native_function; duke@435: if (current == function) return; duke@435: if (post_event_flag && JvmtiExport::should_post_native_method_bind() && duke@435: function != NULL) { duke@435: // native_method_throw_unsatisfied_link_error_entry() should only duke@435: // be passed when post_event_flag is false. duke@435: assert(function != duke@435: SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), duke@435: "post_event_flag mis-match"); duke@435: duke@435: // post the bind event, and possible change the bind function duke@435: JvmtiExport::post_native_method_bind(this, &function); duke@435: } duke@435: *native_function = function; duke@435: // This function can be called more than once. We must make sure that we always duke@435: // use the latest registered method -> check if a stub already has been generated. duke@435: // If so, we have to make it not_entrant. duke@435: nmethod* nm = code(); // Put it into local variable to guard against concurrent updates duke@435: if (nm != NULL) { duke@435: nm->make_not_entrant(); duke@435: } duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::has_native_function() const { duke@435: address func = native_function(); duke@435: return (func != NULL && func != SharedRuntime::native_method_throw_unsatisfied_link_error_entry()); duke@435: } duke@435: duke@435: duke@435: void methodOopDesc::clear_native_function() { duke@435: set_native_function( duke@435: SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), duke@435: !native_bind_event_is_interesting); duke@435: clear_code(); duke@435: } duke@435: duke@435: duke@435: void methodOopDesc::set_signature_handler(address handler) { duke@435: address* signature_handler = signature_handler_addr(); duke@435: *signature_handler = handler; duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::is_not_compilable(int comp_level) const { duke@435: methodDataOop mdo = method_data(); duke@435: if (mdo != NULL duke@435: && (uint)mdo->decompile_count() > (uint)PerMethodRecompilationCutoff) { duke@435: // Since (uint)-1 is large, -1 really means 'no cutoff'. duke@435: return true; duke@435: } duke@435: #ifdef COMPILER2 duke@435: if (is_tier1_compile(comp_level)) { duke@435: if (is_not_tier1_compilable()) { duke@435: return true; duke@435: } duke@435: } duke@435: #endif // COMPILER2 duke@435: return (_invocation_counter.state() == InvocationCounter::wait_for_nothing) duke@435: || (number_of_breakpoints() > 0); duke@435: } duke@435: duke@435: // call this when compiler finds that this method is not compilable duke@435: void methodOopDesc::set_not_compilable(int comp_level) { duke@435: if ((TraceDeoptimization || LogCompilation) && (xtty != NULL)) { duke@435: ttyLocker ttyl; duke@435: xtty->begin_elem("make_not_compilable thread='%d'", (int) os::current_thread_id()); duke@435: xtty->method(methodOop(this)); duke@435: xtty->stamp(); duke@435: xtty->end_elem(); duke@435: } duke@435: #ifdef COMPILER2 duke@435: if (is_tier1_compile(comp_level)) { duke@435: set_not_tier1_compilable(); duke@435: return; duke@435: } duke@435: #endif /* COMPILER2 */ duke@435: assert(comp_level == CompLevel_highest_tier, "unexpected compilation level"); duke@435: invocation_counter()->set_state(InvocationCounter::wait_for_nothing); duke@435: backedge_counter()->set_state(InvocationCounter::wait_for_nothing); duke@435: } duke@435: duke@435: // Revert to using the interpreter and clear out the nmethod duke@435: void methodOopDesc::clear_code() { duke@435: duke@435: // this may be NULL if c2i adapters have not been made yet duke@435: // Only should happen at allocate time. duke@435: if (_adapter == NULL) { duke@435: _from_compiled_entry = NULL; duke@435: } else { duke@435: _from_compiled_entry = _adapter->get_c2i_entry(); duke@435: } duke@435: OrderAccess::storestore(); duke@435: _from_interpreted_entry = _i2i_entry; duke@435: OrderAccess::storestore(); duke@435: _code = NULL; duke@435: } duke@435: duke@435: // Called by class data sharing to remove any entry points (which are not shared) duke@435: void methodOopDesc::unlink_method() { duke@435: _code = NULL; duke@435: _i2i_entry = NULL; duke@435: _from_interpreted_entry = NULL; duke@435: if (is_native()) { duke@435: *native_function_addr() = NULL; duke@435: set_signature_handler(NULL); duke@435: } duke@435: NOT_PRODUCT(set_compiled_invocation_count(0);) duke@435: invocation_counter()->reset(); duke@435: backedge_counter()->reset(); duke@435: _adapter = NULL; duke@435: _from_compiled_entry = NULL; duke@435: assert(_method_data == NULL, "unexpected method data?"); duke@435: set_method_data(NULL); duke@435: set_interpreter_throwout_count(0); duke@435: set_interpreter_invocation_count(0); duke@435: _highest_tier_compile = CompLevel_none; duke@435: } duke@435: duke@435: // Called when the method_holder is getting linked. Setup entrypoints so the method duke@435: // is ready to be called from interpreter, compiler, and vtables. duke@435: void methodOopDesc::link_method(methodHandle h_method, TRAPS) { duke@435: assert(_i2i_entry == NULL, "should only be called once"); duke@435: assert(_adapter == NULL, "init'd to NULL" ); duke@435: assert( _code == NULL, "nothing compiled yet" ); duke@435: duke@435: // Setup interpreter entrypoint duke@435: assert(this == h_method(), "wrong h_method()" ); duke@435: address entry = Interpreter::entry_for_method(h_method); duke@435: assert(entry != NULL, "interpreter entry must be non-null"); duke@435: // Sets both _i2i_entry and _from_interpreted_entry duke@435: set_interpreter_entry(entry); duke@435: if (is_native()) { duke@435: set_native_function( duke@435: SharedRuntime::native_method_throw_unsatisfied_link_error_entry(), duke@435: !native_bind_event_is_interesting); duke@435: } duke@435: duke@435: // Setup compiler entrypoint. This is made eagerly, so we do not need duke@435: // special handling of vtables. An alternative is to make adapters more duke@435: // lazily by calling make_adapter() from from_compiled_entry() for the duke@435: // normal calls. For vtable calls life gets more complicated. When a duke@435: // call-site goes mega-morphic we need adapters in all methods which can be duke@435: // called from the vtable. We need adapters on such methods that get loaded duke@435: // later. Ditto for mega-morphic itable calls. If this proves to be a duke@435: // problem we'll make these lazily later. duke@435: (void) make_adapters(h_method, CHECK); duke@435: duke@435: // ONLY USE the h_method now as make_adapter may have blocked duke@435: duke@435: } duke@435: duke@435: address methodOopDesc::make_adapters(methodHandle mh, TRAPS) { duke@435: // Adapters for compiled code are made eagerly here. They are fairly duke@435: // small (generally < 100 bytes) and quick to make (and cached and shared) duke@435: // so making them eagerly shouldn't be too expensive. duke@435: AdapterHandlerEntry* adapter = AdapterHandlerLibrary::get_adapter(mh); duke@435: if (adapter == NULL ) { duke@435: THROW_0(vmSymbols::java_lang_OutOfMemoryError()); duke@435: } duke@435: duke@435: mh->set_adapter_entry(adapter); duke@435: mh->_from_compiled_entry = adapter->get_c2i_entry(); duke@435: return adapter->get_c2i_entry(); duke@435: } duke@435: duke@435: // The verified_code_entry() must be called when a invoke is resolved duke@435: // on this method. duke@435: duke@435: // It returns the compiled code entry point, after asserting not null. duke@435: // This function is called after potential safepoints so that nmethod duke@435: // or adapter that it points to is still live and valid. duke@435: // This function must not hit a safepoint! duke@435: address methodOopDesc::verified_code_entry() { duke@435: debug_only(No_Safepoint_Verifier nsv;) duke@435: assert(_from_compiled_entry != NULL, "must be set"); duke@435: return _from_compiled_entry; duke@435: } duke@435: duke@435: // Check that if an nmethod ref exists, it has a backlink to this or no backlink at all duke@435: // (could be racing a deopt). duke@435: // Not inline to avoid circular ref. duke@435: bool methodOopDesc::check_code() const { duke@435: // cached in a register or local. There's a race on the value of the field. duke@435: nmethod *code = (nmethod *)OrderAccess::load_ptr_acquire(&_code); duke@435: return code == NULL || (code->method() == NULL) || (code->method() == (methodOop)this && !code->is_osr_method()); duke@435: } duke@435: duke@435: // Install compiled code. Instantly it can execute. duke@435: void methodOopDesc::set_code(methodHandle mh, nmethod *code) { duke@435: assert( code, "use clear_code to remove code" ); duke@435: assert( mh->check_code(), "" ); duke@435: duke@435: guarantee(mh->adapter() != NULL, "Adapter blob must already exist!"); duke@435: duke@435: // These writes must happen in this order, because the interpreter will duke@435: // directly jump to from_interpreted_entry which jumps to an i2c adapter duke@435: // which jumps to _from_compiled_entry. duke@435: mh->_code = code; // Assign before allowing compiled code to exec duke@435: duke@435: int comp_level = code->comp_level(); duke@435: // In theory there could be a race here. In practice it is unlikely duke@435: // and not worth worrying about. duke@435: if (comp_level > highest_tier_compile()) { duke@435: set_highest_tier_compile(comp_level); duke@435: } duke@435: duke@435: OrderAccess::storestore(); duke@435: mh->_from_compiled_entry = code->verified_entry_point(); duke@435: OrderAccess::storestore(); duke@435: // Instantly compiled code can execute. duke@435: mh->_from_interpreted_entry = mh->get_i2c_entry(); duke@435: duke@435: } duke@435: duke@435: duke@435: bool methodOopDesc::is_overridden_in(klassOop k) const { duke@435: instanceKlass* ik = instanceKlass::cast(k); duke@435: duke@435: if (ik->is_interface()) return false; duke@435: duke@435: // If method is an interface, we skip it - except if it duke@435: // is a miranda method duke@435: if (instanceKlass::cast(method_holder())->is_interface()) { duke@435: // Check that method is not a miranda method duke@435: if (ik->lookup_method(name(), signature()) == NULL) { duke@435: // No implementation exist - so miranda method duke@435: return false; duke@435: } duke@435: return true; duke@435: } duke@435: duke@435: assert(ik->is_subclass_of(method_holder()), "should be subklass"); duke@435: assert(ik->vtable() != NULL, "vtable should exist"); duke@435: if (vtable_index() == nonvirtual_vtable_index) { duke@435: return false; duke@435: } else { duke@435: methodOop vt_m = ik->method_at_vtable(vtable_index()); duke@435: return vt_m != methodOop(this); duke@435: } duke@435: } duke@435: duke@435: dcubed@483: // give advice about whether this methodOop should be cached or not dcubed@483: bool methodOopDesc::should_not_be_cached() const { dcubed@483: if (is_old()) { dcubed@483: // This method has been redefined. It is either EMCP or obsolete dcubed@483: // and we don't want to cache it because that would pin the method dcubed@483: // down and prevent it from being collectible if and when it dcubed@483: // finishes executing. dcubed@483: return true; dcubed@483: } dcubed@483: dcubed@483: if (mark()->should_not_be_cached()) { dcubed@483: // It is either not safe or not a good idea to cache this dcubed@483: // method at this time because of the state of the embedded dcubed@483: // markOop. See markOop.cpp for the gory details. dcubed@483: return true; dcubed@483: } dcubed@483: dcubed@483: // caching this method should be just fine dcubed@483: return false; dcubed@483: } dcubed@483: dcubed@483: duke@435: methodHandle methodOopDesc:: clone_with_new_data(methodHandle m, u_char* new_code, int new_code_length, duke@435: u_char* new_compressed_linenumber_table, int new_compressed_linenumber_size, TRAPS) { duke@435: // Code below does not work for native methods - they should never get rewritten anyway duke@435: assert(!m->is_native(), "cannot rewrite native methods"); duke@435: // Allocate new methodOop duke@435: AccessFlags flags = m->access_flags(); duke@435: int checked_exceptions_len = m->checked_exceptions_length(); duke@435: int localvariable_len = m->localvariable_table_length(); jmasa@953: // Allocate newm_oop with the is_conc_safe parameter set jmasa@953: // to IsUnsafeConc to indicate that newm_oop is not yet jmasa@953: // safe for concurrent processing by a GC. jmasa@953: methodOop newm_oop = oopFactory::new_method(new_code_length, jmasa@953: flags, jmasa@953: new_compressed_linenumber_size, jmasa@953: localvariable_len, jmasa@953: checked_exceptions_len, jmasa@953: IsUnsafeConc, jmasa@953: CHECK_(methodHandle())); duke@435: methodHandle newm (THREAD, newm_oop); duke@435: int new_method_size = newm->method_size(); duke@435: // Create a shallow copy of methodOopDesc part, but be careful to preserve the new constMethodOop duke@435: constMethodOop newcm = newm->constMethod(); duke@435: int new_const_method_size = newm->constMethod()->object_size(); jmasa@953: duke@435: memcpy(newm(), m(), sizeof(methodOopDesc)); duke@435: // Create shallow copy of constMethodOopDesc, but be careful to preserve the methodOop jmasa@953: // is_conc_safe is set to false because that is the value of jmasa@953: // is_conc_safe initialzied into newcm and the copy should jmasa@953: // not overwrite that value. During the window during which it is jmasa@953: // tagged as unsafe, some extra work could be needed during precleaning jmasa@953: // or concurrent marking but those phases will be correct. Setting and jmasa@953: // resetting is done in preference to a careful copying into newcm to jmasa@953: // avoid having to know the precise layout of a constMethodOop. jmasa@953: m->constMethod()->set_is_conc_safe(false); duke@435: memcpy(newcm, m->constMethod(), sizeof(constMethodOopDesc)); jmasa@953: m->constMethod()->set_is_conc_safe(true); duke@435: // Reset correct method/const method, method size, and parameter info duke@435: newcm->set_method(newm()); duke@435: newm->set_constMethod(newcm); duke@435: assert(newcm->method() == newm(), "check"); duke@435: newm->constMethod()->set_code_size(new_code_length); duke@435: newm->constMethod()->set_constMethod_size(new_const_method_size); duke@435: newm->set_method_size(new_method_size); duke@435: assert(newm->code_size() == new_code_length, "check"); duke@435: assert(newm->checked_exceptions_length() == checked_exceptions_len, "check"); duke@435: assert(newm->localvariable_table_length() == localvariable_len, "check"); duke@435: // Copy new byte codes duke@435: memcpy(newm->code_base(), new_code, new_code_length); duke@435: // Copy line number table duke@435: if (new_compressed_linenumber_size > 0) { duke@435: memcpy(newm->compressed_linenumber_table(), duke@435: new_compressed_linenumber_table, duke@435: new_compressed_linenumber_size); duke@435: } duke@435: // Copy checked_exceptions duke@435: if (checked_exceptions_len > 0) { duke@435: memcpy(newm->checked_exceptions_start(), duke@435: m->checked_exceptions_start(), duke@435: checked_exceptions_len * sizeof(CheckedExceptionElement)); duke@435: } duke@435: // Copy local variable number table duke@435: if (localvariable_len > 0) { duke@435: memcpy(newm->localvariable_table_start(), duke@435: m->localvariable_table_start(), duke@435: localvariable_len * sizeof(LocalVariableTableElement)); duke@435: } jmasa@953: jmasa@953: // Only set is_conc_safe to true when changes to newcm are jmasa@953: // complete. jmasa@953: newcm->set_is_conc_safe(true); duke@435: return newm; duke@435: } duke@435: duke@435: vmIntrinsics::ID methodOopDesc::compute_intrinsic_id() const { duke@435: assert(vmIntrinsics::_none == 0, "correct coding of default case"); duke@435: const uintptr_t max_cache_uint = right_n_bits((int)(sizeof(_intrinsic_id_cache) * BitsPerByte)); duke@435: assert((uintptr_t)vmIntrinsics::ID_LIMIT <= max_cache_uint, "else fix cache size"); duke@435: // if loader is not the default loader (i.e., != NULL), we can't know the intrinsics duke@435: // because we are not loading from core libraries duke@435: if (instanceKlass::cast(method_holder())->class_loader() != NULL) return vmIntrinsics::_none; duke@435: duke@435: // see if the klass name is well-known: duke@435: symbolOop klass_name = instanceKlass::cast(method_holder())->name(); duke@435: vmSymbols::SID klass_id = vmSymbols::find_sid(klass_name); duke@435: if (klass_id == vmSymbols::NO_SID) return vmIntrinsics::_none; duke@435: duke@435: // ditto for method and signature: duke@435: vmSymbols::SID name_id = vmSymbols::find_sid(name()); duke@435: if (name_id == vmSymbols::NO_SID) return vmIntrinsics::_none; duke@435: vmSymbols::SID sig_id = vmSymbols::find_sid(signature()); duke@435: if (sig_id == vmSymbols::NO_SID) return vmIntrinsics::_none; duke@435: jshort flags = access_flags().as_short(); duke@435: duke@435: // A few slightly irregular cases: duke@435: switch (klass_id) { duke@435: case vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_StrictMath): duke@435: // Second chance: check in regular Math. duke@435: switch (name_id) { duke@435: case vmSymbols::VM_SYMBOL_ENUM_NAME(min_name): duke@435: case vmSymbols::VM_SYMBOL_ENUM_NAME(max_name): duke@435: case vmSymbols::VM_SYMBOL_ENUM_NAME(sqrt_name): duke@435: // pretend it is the corresponding method in the non-strict class: duke@435: klass_id = vmSymbols::VM_SYMBOL_ENUM_NAME(java_lang_Math); duke@435: break; duke@435: } duke@435: } duke@435: duke@435: // return intrinsic id if any duke@435: return vmIntrinsics::find_id(klass_id, name_id, sig_id, flags); duke@435: } duke@435: duke@435: duke@435: // These two methods are static since a GC may move the methodOopDesc duke@435: bool methodOopDesc::load_signature_classes(methodHandle m, TRAPS) { duke@435: bool sig_is_loaded = true; duke@435: Handle class_loader(THREAD, instanceKlass::cast(m->method_holder())->class_loader()); duke@435: Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain()); duke@435: symbolHandle signature(THREAD, m->signature()); duke@435: for(SignatureStream ss(signature); !ss.is_done(); ss.next()) { duke@435: if (ss.is_object()) { duke@435: symbolOop sym = ss.as_symbol(CHECK_(false)); duke@435: symbolHandle name (THREAD, sym); duke@435: klassOop klass = SystemDictionary::resolve_or_null(name, class_loader, duke@435: protection_domain, THREAD); rasbold@539: // We are loading classes eagerly. If a ClassNotFoundException or rasbold@539: // a LinkageError was generated, be sure to ignore it. duke@435: if (HAS_PENDING_EXCEPTION) { rasbold@539: if (PENDING_EXCEPTION->is_a(SystemDictionary::classNotFoundException_klass()) || rasbold@539: PENDING_EXCEPTION->is_a(SystemDictionary::linkageError_klass())) { duke@435: CLEAR_PENDING_EXCEPTION; duke@435: } else { duke@435: return false; duke@435: } duke@435: } duke@435: if( klass == NULL) { sig_is_loaded = false; } duke@435: } duke@435: } duke@435: return sig_is_loaded; duke@435: } duke@435: duke@435: bool methodOopDesc::has_unloaded_classes_in_signature(methodHandle m, TRAPS) { duke@435: Handle class_loader(THREAD, instanceKlass::cast(m->method_holder())->class_loader()); duke@435: Handle protection_domain(THREAD, Klass::cast(m->method_holder())->protection_domain()); duke@435: symbolHandle signature(THREAD, m->signature()); duke@435: for(SignatureStream ss(signature); !ss.is_done(); ss.next()) { duke@435: if (ss.type() == T_OBJECT) { duke@435: symbolHandle name(THREAD, ss.as_symbol_or_null()); duke@435: if (name() == NULL) return true; duke@435: klassOop klass = SystemDictionary::find(name, class_loader, protection_domain, THREAD); duke@435: if (klass == NULL) return true; duke@435: } duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: // Exposed so field engineers can debug VM duke@435: void methodOopDesc::print_short_name(outputStream* st) { duke@435: ResourceMark rm; duke@435: #ifdef PRODUCT duke@435: st->print(" %s::", method_holder()->klass_part()->external_name()); duke@435: #else duke@435: st->print(" %s::", method_holder()->klass_part()->internal_name()); duke@435: #endif duke@435: name()->print_symbol_on(st); duke@435: if (WizardMode) signature()->print_symbol_on(st); duke@435: } duke@435: duke@435: duke@435: extern "C" { duke@435: static int method_compare(methodOop* a, methodOop* b) { duke@435: return (*a)->name()->fast_compare((*b)->name()); duke@435: } duke@435: duke@435: // Prevent qsort from reordering a previous valid sort by duke@435: // considering the address of the methodOops if two methods duke@435: // would otherwise compare as equal. Required to preserve duke@435: // optimal access order in the shared archive. Slower than duke@435: // method_compare, only used for shared archive creation. duke@435: static int method_compare_idempotent(methodOop* a, methodOop* b) { duke@435: int i = method_compare(a, b); duke@435: if (i != 0) return i; duke@435: return ( a < b ? -1 : (a == b ? 0 : 1)); duke@435: } duke@435: duke@435: typedef int (*compareFn)(const void*, const void*); duke@435: } duke@435: duke@435: duke@435: // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array duke@435: static void reorder_based_on_method_index(objArrayOop methods, duke@435: objArrayOop annotations, coleenp@548: GrowableArray* temp_array) { duke@435: if (annotations == NULL) { duke@435: return; duke@435: } duke@435: duke@435: int length = methods->length(); duke@435: int i; duke@435: // Copy to temp array coleenp@548: temp_array->clear(); coleenp@548: for (i = 0; i < length; i++) { coleenp@548: temp_array->append(annotations->obj_at(i)); coleenp@548: } duke@435: duke@435: // Copy back using old method indices duke@435: for (i = 0; i < length; i++) { duke@435: methodOop m = (methodOop) methods->obj_at(i); coleenp@548: annotations->obj_at_put(i, temp_array->at(m->method_idnum())); duke@435: } duke@435: } duke@435: duke@435: duke@435: // This is only done during class loading, so it is OK to assume method_idnum matches the methods() array duke@435: void methodOopDesc::sort_methods(objArrayOop methods, duke@435: objArrayOop methods_annotations, duke@435: objArrayOop methods_parameter_annotations, duke@435: objArrayOop methods_default_annotations, duke@435: bool idempotent) { duke@435: int length = methods->length(); duke@435: if (length > 1) { duke@435: bool do_annotations = false; duke@435: if (methods_annotations != NULL || duke@435: methods_parameter_annotations != NULL || duke@435: methods_default_annotations != NULL) { duke@435: do_annotations = true; duke@435: } duke@435: if (do_annotations) { duke@435: // Remember current method ordering so we can reorder annotations duke@435: for (int i = 0; i < length; i++) { duke@435: methodOop m = (methodOop) methods->obj_at(i); duke@435: m->set_method_idnum(i); duke@435: } duke@435: } duke@435: duke@435: // Use a simple bubble sort for small number of methods since duke@435: // qsort requires a functional pointer call for each comparison. coleenp@548: if (UseCompressedOops || length < 8) { duke@435: bool sorted = true; duke@435: for (int i=length-1; i>0; i--) { duke@435: for (int j=0; jobj_at(j); duke@435: methodOop m2 = (methodOop)methods->obj_at(j+1); duke@435: if ((uintptr_t)m1->name() > (uintptr_t)m2->name()) { duke@435: methods->obj_at_put(j, m2); duke@435: methods->obj_at_put(j+1, m1); duke@435: sorted = false; duke@435: } duke@435: } duke@435: if (sorted) break; coleenp@548: sorted = true; duke@435: } duke@435: } else { coleenp@548: // XXX This doesn't work for UseCompressedOops because the compare fn coleenp@548: // will have to decode the methodOop anyway making it not much faster coleenp@548: // than above. duke@435: compareFn compare = (compareFn) (idempotent ? method_compare_idempotent : method_compare); coleenp@548: qsort(methods->base(), length, heapOopSize, compare); duke@435: } duke@435: duke@435: // Sort annotations if necessary duke@435: assert(methods_annotations == NULL || methods_annotations->length() == methods->length(), ""); duke@435: assert(methods_parameter_annotations == NULL || methods_parameter_annotations->length() == methods->length(), ""); duke@435: assert(methods_default_annotations == NULL || methods_default_annotations->length() == methods->length(), ""); duke@435: if (do_annotations) { coleenp@548: ResourceMark rm; duke@435: // Allocate temporary storage coleenp@548: GrowableArray* temp_array = new GrowableArray(length); duke@435: reorder_based_on_method_index(methods, methods_annotations, temp_array); duke@435: reorder_based_on_method_index(methods, methods_parameter_annotations, temp_array); duke@435: reorder_based_on_method_index(methods, methods_default_annotations, temp_array); duke@435: } duke@435: duke@435: // Reset method ordering duke@435: for (int i = 0; i < length; i++) { duke@435: methodOop m = (methodOop) methods->obj_at(i); duke@435: m->set_method_idnum(i); duke@435: } duke@435: } duke@435: } duke@435: duke@435: duke@435: //----------------------------------------------------------------------------------- duke@435: // Non-product code duke@435: duke@435: #ifndef PRODUCT duke@435: class SignatureTypePrinter : public SignatureTypeNames { duke@435: private: duke@435: outputStream* _st; duke@435: bool _use_separator; duke@435: duke@435: void type_name(const char* name) { duke@435: if (_use_separator) _st->print(", "); duke@435: _st->print(name); duke@435: _use_separator = true; duke@435: } duke@435: duke@435: public: duke@435: SignatureTypePrinter(symbolHandle signature, outputStream* st) : SignatureTypeNames(signature) { duke@435: _st = st; duke@435: _use_separator = false; duke@435: } duke@435: duke@435: void print_parameters() { _use_separator = false; iterate_parameters(); } duke@435: void print_returntype() { _use_separator = false; iterate_returntype(); } duke@435: }; duke@435: duke@435: duke@435: void methodOopDesc::print_name(outputStream* st) { duke@435: Thread *thread = Thread::current(); duke@435: ResourceMark rm(thread); duke@435: SignatureTypePrinter sig(signature(), st); duke@435: st->print("%s ", is_static() ? "static" : "virtual"); duke@435: sig.print_returntype(); duke@435: st->print(" %s.", method_holder()->klass_part()->internal_name()); duke@435: name()->print_symbol_on(st); duke@435: st->print("("); duke@435: sig.print_parameters(); duke@435: st->print(")"); duke@435: } duke@435: duke@435: duke@435: void methodOopDesc::print_codes_on(outputStream* st) const { duke@435: print_codes_on(0, code_size(), st); duke@435: } duke@435: duke@435: void methodOopDesc::print_codes_on(int from, int to, outputStream* st) const { duke@435: Thread *thread = Thread::current(); duke@435: ResourceMark rm(thread); duke@435: methodHandle mh (thread, (methodOop)this); duke@435: BytecodeStream s(mh); duke@435: s.set_interval(from, to); duke@435: BytecodeTracer::set_closure(BytecodeTracer::std_closure()); duke@435: while (s.next() >= 0) BytecodeTracer::trace(mh, s.bcp(), st); duke@435: } duke@435: #endif // not PRODUCT duke@435: duke@435: duke@435: // Simple compression of line number tables. We use a regular compressed stream, except that we compress deltas duke@435: // between (bci,line) pairs since they are smaller. If (bci delta, line delta) fits in (5-bit unsigned, 3-bit unsigned) duke@435: // we save it as one byte, otherwise we write a 0xFF escape character and use regular compression. 0x0 is used duke@435: // as end-of-stream terminator. duke@435: duke@435: void CompressedLineNumberWriteStream::write_pair_regular(int bci_delta, int line_delta) { duke@435: // bci and line number does not compress into single byte. duke@435: // Write out escape character and use regular compression for bci and line number. duke@435: write_byte((jubyte)0xFF); duke@435: write_signed_int(bci_delta); duke@435: write_signed_int(line_delta); duke@435: } duke@435: duke@435: // See comment in methodOop.hpp which explains why this exists. duke@435: #if defined(_M_AMD64) && MSC_VER >= 1400 duke@435: #pragma optimize("", off) duke@435: void CompressedLineNumberWriteStream::write_pair(int bci, int line) { duke@435: write_pair_inline(bci, line); duke@435: } duke@435: #pragma optimize("", on) duke@435: #endif duke@435: duke@435: CompressedLineNumberReadStream::CompressedLineNumberReadStream(u_char* buffer) : CompressedReadStream(buffer) { duke@435: _bci = 0; duke@435: _line = 0; duke@435: }; duke@435: duke@435: duke@435: bool CompressedLineNumberReadStream::read_pair() { duke@435: jubyte next = read_byte(); duke@435: // Check for terminator duke@435: if (next == 0) return false; duke@435: if (next == 0xFF) { duke@435: // Escape character, regular compression used duke@435: _bci += read_signed_int(); duke@435: _line += read_signed_int(); duke@435: } else { duke@435: // Single byte compression used duke@435: _bci += next >> 3; duke@435: _line += next & 0x7; duke@435: } duke@435: return true; duke@435: } duke@435: duke@435: duke@435: Bytecodes::Code methodOopDesc::orig_bytecode_at(int bci) { duke@435: BreakpointInfo* bp = instanceKlass::cast(method_holder())->breakpoints(); duke@435: for (; bp != NULL; bp = bp->next()) { duke@435: if (bp->match(this, bci)) { duke@435: return bp->orig_bytecode(); duke@435: } duke@435: } duke@435: ShouldNotReachHere(); duke@435: return Bytecodes::_shouldnotreachhere; duke@435: } duke@435: duke@435: void methodOopDesc::set_orig_bytecode_at(int bci, Bytecodes::Code code) { duke@435: assert(code != Bytecodes::_breakpoint, "cannot patch breakpoints this way"); duke@435: BreakpointInfo* bp = instanceKlass::cast(method_holder())->breakpoints(); duke@435: for (; bp != NULL; bp = bp->next()) { duke@435: if (bp->match(this, bci)) { duke@435: bp->set_orig_bytecode(code); duke@435: // and continue, in case there is more than one duke@435: } duke@435: } duke@435: } duke@435: duke@435: void methodOopDesc::set_breakpoint(int bci) { duke@435: instanceKlass* ik = instanceKlass::cast(method_holder()); duke@435: BreakpointInfo *bp = new BreakpointInfo(this, bci); duke@435: bp->set_next(ik->breakpoints()); duke@435: ik->set_breakpoints(bp); duke@435: // do this last: duke@435: bp->set(this); duke@435: } duke@435: duke@435: static void clear_matches(methodOop m, int bci) { duke@435: instanceKlass* ik = instanceKlass::cast(m->method_holder()); duke@435: BreakpointInfo* prev_bp = NULL; duke@435: BreakpointInfo* next_bp; duke@435: for (BreakpointInfo* bp = ik->breakpoints(); bp != NULL; bp = next_bp) { duke@435: next_bp = bp->next(); duke@435: // bci value of -1 is used to delete all breakpoints in method m (ex: clear_all_breakpoint). duke@435: if (bci >= 0 ? bp->match(m, bci) : bp->match(m)) { duke@435: // do this first: duke@435: bp->clear(m); duke@435: // unhook it duke@435: if (prev_bp != NULL) duke@435: prev_bp->set_next(next_bp); duke@435: else duke@435: ik->set_breakpoints(next_bp); duke@435: delete bp; duke@435: // When class is redefined JVMTI sets breakpoint in all versions of EMCP methods duke@435: // at same location. So we have multiple matching (method_index and bci) duke@435: // BreakpointInfo nodes in BreakpointInfo list. We should just delete one duke@435: // breakpoint for clear_breakpoint request and keep all other method versions duke@435: // BreakpointInfo for future clear_breakpoint request. duke@435: // bcivalue of -1 is used to clear all breakpoints (see clear_all_breakpoints) duke@435: // which is being called when class is unloaded. We delete all the Breakpoint duke@435: // information for all versions of method. We may not correctly restore the original duke@435: // bytecode in all method versions, but that is ok. Because the class is being unloaded duke@435: // so these methods won't be used anymore. duke@435: if (bci >= 0) { duke@435: break; duke@435: } duke@435: } else { duke@435: // This one is a keeper. duke@435: prev_bp = bp; duke@435: } duke@435: } duke@435: } duke@435: duke@435: void methodOopDesc::clear_breakpoint(int bci) { duke@435: assert(bci >= 0, ""); duke@435: clear_matches(this, bci); duke@435: } duke@435: duke@435: void methodOopDesc::clear_all_breakpoints() { duke@435: clear_matches(this, -1); duke@435: } duke@435: duke@435: duke@435: BreakpointInfo::BreakpointInfo(methodOop m, int bci) { duke@435: _bci = bci; duke@435: _name_index = m->name_index(); duke@435: _signature_index = m->signature_index(); duke@435: _orig_bytecode = (Bytecodes::Code) *m->bcp_from(_bci); duke@435: if (_orig_bytecode == Bytecodes::_breakpoint) duke@435: _orig_bytecode = m->orig_bytecode_at(_bci); duke@435: _next = NULL; duke@435: } duke@435: duke@435: void BreakpointInfo::set(methodOop method) { duke@435: #ifdef ASSERT duke@435: { duke@435: Bytecodes::Code code = (Bytecodes::Code) *method->bcp_from(_bci); duke@435: if (code == Bytecodes::_breakpoint) duke@435: code = method->orig_bytecode_at(_bci); duke@435: assert(orig_bytecode() == code, "original bytecode must be the same"); duke@435: } duke@435: #endif duke@435: *method->bcp_from(_bci) = Bytecodes::_breakpoint; duke@435: method->incr_number_of_breakpoints(); duke@435: SystemDictionary::notice_modification(); duke@435: { duke@435: // Deoptimize all dependents on this method duke@435: Thread *thread = Thread::current(); duke@435: HandleMark hm(thread); duke@435: methodHandle mh(thread, method); duke@435: Universe::flush_dependents_on_method(mh); duke@435: } duke@435: } duke@435: duke@435: void BreakpointInfo::clear(methodOop method) { duke@435: *method->bcp_from(_bci) = orig_bytecode(); duke@435: assert(method->number_of_breakpoints() > 0, "must not go negative"); duke@435: method->decr_number_of_breakpoints(); duke@435: }