duke@435: /* coleenp@5614: * Copyright (c) 1997, 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 "code/codeCache.hpp" stefank@2314: #include "code/compiledIC.hpp" twisti@3050: #include "code/dependencies.hpp" stefank@2314: #include "code/nmethod.hpp" stefank@2314: #include "code/scopeDesc.hpp" stefank@2314: #include "compiler/abstractCompiler.hpp" twisti@2687: #include "compiler/compileBroker.hpp" stefank@2314: #include "compiler/compileLog.hpp" stefank@2314: #include "compiler/compilerOracle.hpp" stefank@2314: #include "compiler/disassembler.hpp" stefank@2314: #include "interpreter/bytecode.hpp" coleenp@4037: #include "oops/methodData.hpp" stefank@2314: #include "prims/jvmtiRedefineClassesTrace.hpp" kamg@2511: #include "prims/jvmtiImpl.hpp" stefank@2314: #include "runtime/sharedRuntime.hpp" stefank@2314: #include "runtime/sweeper.hpp" stefank@2314: #include "utilities/dtrace.hpp" stefank@2314: #include "utilities/events.hpp" stefank@2314: #include "utilities/xmlstream.hpp" stefank@2314: #ifdef SHARK stefank@2314: #include "shark/sharkCompiler.hpp" stefank@2314: #endif duke@435: duke@435: #ifdef DTRACE_ENABLED duke@435: duke@435: // Only bother with this argument setup if dtrace is available duke@435: dcubed@3202: #ifndef USDT2 duke@435: HS_DTRACE_PROBE_DECL8(hotspot, compiled__method__load, duke@435: const char*, int, const char*, int, const char*, int, void*, size_t); duke@435: duke@435: HS_DTRACE_PROBE_DECL6(hotspot, compiled__method__unload, duke@435: char*, int, char*, int, char*, int); duke@435: duke@435: #define DTRACE_METHOD_UNLOAD_PROBE(method) \ duke@435: { \ coleenp@4037: Method* m = (method); \ duke@435: if (m != NULL) { \ coleenp@2497: Symbol* klass_name = m->klass_name(); \ coleenp@2497: Symbol* name = m->name(); \ coleenp@2497: Symbol* signature = m->signature(); \ duke@435: HS_DTRACE_PROBE6(hotspot, compiled__method__unload, \ duke@435: klass_name->bytes(), klass_name->utf8_length(), \ duke@435: name->bytes(), name->utf8_length(), \ duke@435: signature->bytes(), signature->utf8_length()); \ duke@435: } \ duke@435: } dcubed@3202: #else /* USDT2 */ dcubed@3202: #define DTRACE_METHOD_UNLOAD_PROBE(method) \ dcubed@3202: { \ coleenp@4037: Method* m = (method); \ dcubed@3202: if (m != NULL) { \ dcubed@3202: Symbol* klass_name = m->klass_name(); \ dcubed@3202: Symbol* name = m->name(); \ dcubed@3202: Symbol* signature = m->signature(); \ dcubed@3202: HOTSPOT_COMPILED_METHOD_UNLOAD( \ dcubed@3202: (char *) klass_name->bytes(), klass_name->utf8_length(), \ dcubed@3202: (char *) name->bytes(), name->utf8_length(), \ dcubed@3202: (char *) signature->bytes(), signature->utf8_length()); \ dcubed@3202: } \ dcubed@3202: } dcubed@3202: #endif /* USDT2 */ duke@435: duke@435: #else // ndef DTRACE_ENABLED duke@435: duke@435: #define DTRACE_METHOD_UNLOAD_PROBE(method) duke@435: duke@435: #endif duke@435: duke@435: bool nmethod::is_compiled_by_c1() const { roland@5629: if (compiler() == NULL) { roland@5629: return false; roland@5629: } duke@435: return compiler()->is_c1(); duke@435: } duke@435: bool nmethod::is_compiled_by_c2() const { roland@5629: if (compiler() == NULL) { roland@5629: return false; roland@5629: } duke@435: return compiler()->is_c2(); duke@435: } twisti@2047: bool nmethod::is_compiled_by_shark() const { roland@5629: if (compiler() == NULL) { roland@5629: return false; roland@5629: } twisti@2047: return compiler()->is_shark(); twisti@2047: } duke@435: duke@435: duke@435: duke@435: //--------------------------------------------------------------------------------- duke@435: // NMethod statistics duke@435: // They are printed under various flags, including: duke@435: // PrintC1Statistics, PrintOptoStatistics, LogVMOutput, and LogCompilation. duke@435: // (In the latter two cases, they like other stats are printed to the log only.) duke@435: duke@435: #ifndef PRODUCT duke@435: // These variables are put into one block to reduce relocations duke@435: // and make it simpler to print from the debugger. duke@435: static duke@435: struct nmethod_stats_struct { duke@435: int nmethod_count; duke@435: int total_size; duke@435: int relocation_size; twisti@2117: int consts_size; twisti@2103: int insts_size; duke@435: int stub_size; duke@435: int scopes_data_size; duke@435: int scopes_pcs_size; duke@435: int dependencies_size; duke@435: int handler_table_size; duke@435: int nul_chk_table_size; duke@435: int oops_size; duke@435: duke@435: void note_nmethod(nmethod* nm) { duke@435: nmethod_count += 1; duke@435: total_size += nm->size(); duke@435: relocation_size += nm->relocation_size(); twisti@2117: consts_size += nm->consts_size(); twisti@2103: insts_size += nm->insts_size(); duke@435: stub_size += nm->stub_size(); twisti@1918: oops_size += nm->oops_size(); duke@435: scopes_data_size += nm->scopes_data_size(); duke@435: scopes_pcs_size += nm->scopes_pcs_size(); duke@435: dependencies_size += nm->dependencies_size(); duke@435: handler_table_size += nm->handler_table_size(); duke@435: nul_chk_table_size += nm->nul_chk_table_size(); duke@435: } duke@435: void print_nmethod_stats() { duke@435: if (nmethod_count == 0) return; duke@435: tty->print_cr("Statistics for %d bytecoded nmethods:", nmethod_count); duke@435: if (total_size != 0) tty->print_cr(" total in heap = %d", total_size); duke@435: if (relocation_size != 0) tty->print_cr(" relocation = %d", relocation_size); twisti@2117: if (consts_size != 0) tty->print_cr(" constants = %d", consts_size); twisti@2103: if (insts_size != 0) tty->print_cr(" main code = %d", insts_size); duke@435: if (stub_size != 0) tty->print_cr(" stub code = %d", stub_size); twisti@1918: if (oops_size != 0) tty->print_cr(" oops = %d", oops_size); duke@435: if (scopes_data_size != 0) tty->print_cr(" scopes data = %d", scopes_data_size); duke@435: if (scopes_pcs_size != 0) tty->print_cr(" scopes pcs = %d", scopes_pcs_size); duke@435: if (dependencies_size != 0) tty->print_cr(" dependencies = %d", dependencies_size); duke@435: if (handler_table_size != 0) tty->print_cr(" handler table = %d", handler_table_size); duke@435: if (nul_chk_table_size != 0) tty->print_cr(" nul chk table = %d", nul_chk_table_size); duke@435: } duke@435: duke@435: int native_nmethod_count; duke@435: int native_total_size; duke@435: int native_relocation_size; twisti@2103: int native_insts_size; duke@435: int native_oops_size; duke@435: void note_native_nmethod(nmethod* nm) { duke@435: native_nmethod_count += 1; duke@435: native_total_size += nm->size(); duke@435: native_relocation_size += nm->relocation_size(); twisti@2103: native_insts_size += nm->insts_size(); duke@435: native_oops_size += nm->oops_size(); duke@435: } duke@435: void print_native_nmethod_stats() { duke@435: if (native_nmethod_count == 0) return; duke@435: tty->print_cr("Statistics for %d native nmethods:", native_nmethod_count); duke@435: if (native_total_size != 0) tty->print_cr(" N. total size = %d", native_total_size); duke@435: if (native_relocation_size != 0) tty->print_cr(" N. relocation = %d", native_relocation_size); twisti@2103: if (native_insts_size != 0) tty->print_cr(" N. main code = %d", native_insts_size); duke@435: if (native_oops_size != 0) tty->print_cr(" N. oops = %d", native_oops_size); duke@435: } duke@435: duke@435: int pc_desc_resets; // number of resets (= number of caches) duke@435: int pc_desc_queries; // queries to nmethod::find_pc_desc duke@435: int pc_desc_approx; // number of those which have approximate true phh@2621: int pc_desc_repeats; // number of _pc_descs[0] hits duke@435: int pc_desc_hits; // number of LRU cache hits duke@435: int pc_desc_tests; // total number of PcDesc examinations duke@435: int pc_desc_searches; // total number of quasi-binary search steps duke@435: int pc_desc_adds; // number of LUR cache insertions duke@435: duke@435: void print_pc_stats() { duke@435: tty->print_cr("PcDesc Statistics: %d queries, %.2f comparisons per query", duke@435: pc_desc_queries, duke@435: (double)(pc_desc_tests + pc_desc_searches) duke@435: / pc_desc_queries); duke@435: tty->print_cr(" caches=%d queries=%d/%d, hits=%d+%d, tests=%d+%d, adds=%d", duke@435: pc_desc_resets, duke@435: pc_desc_queries, pc_desc_approx, duke@435: pc_desc_repeats, pc_desc_hits, duke@435: pc_desc_tests, pc_desc_searches, pc_desc_adds); duke@435: } duke@435: } nmethod_stats; duke@435: #endif //PRODUCT duke@435: twisti@2603: duke@435: //--------------------------------------------------------------------------------- duke@435: duke@435: duke@435: ExceptionCache::ExceptionCache(Handle exception, address pc, address handler) { duke@435: assert(pc != NULL, "Must be non null"); duke@435: assert(exception.not_null(), "Must be non null"); duke@435: assert(handler != NULL, "Must be non null"); duke@435: duke@435: _count = 0; duke@435: _exception_type = exception->klass(); duke@435: _next = NULL; duke@435: duke@435: add_address_and_handler(pc,handler); duke@435: } duke@435: duke@435: duke@435: address ExceptionCache::match(Handle exception, address pc) { duke@435: assert(pc != NULL,"Must be non null"); duke@435: assert(exception.not_null(),"Must be non null"); duke@435: if (exception->klass() == exception_type()) { duke@435: return (test_address(pc)); duke@435: } duke@435: duke@435: return NULL; duke@435: } duke@435: duke@435: duke@435: bool ExceptionCache::match_exception_with_space(Handle exception) { duke@435: assert(exception.not_null(),"Must be non null"); duke@435: if (exception->klass() == exception_type() && count() < cache_size) { duke@435: return true; duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: duke@435: address ExceptionCache::test_address(address addr) { duke@435: for (int i=0; imatch_exception_with_space(exception)) { duke@435: return ec; duke@435: } duke@435: ec = ec->next(); duke@435: } duke@435: return NULL; duke@435: } duke@435: duke@435: duke@435: //----------------------------------------------------------------------------- duke@435: duke@435: duke@435: // Helper used by both find_pc_desc methods. duke@435: static inline bool match_desc(PcDesc* pc, int pc_offset, bool approximate) { duke@435: NOT_PRODUCT(++nmethod_stats.pc_desc_tests); duke@435: if (!approximate) duke@435: return pc->pc_offset() == pc_offset; duke@435: else duke@435: return (pc-1)->pc_offset() < pc_offset && pc_offset <= pc->pc_offset(); duke@435: } duke@435: duke@435: void PcDescCache::reset_to(PcDesc* initial_pc_desc) { duke@435: if (initial_pc_desc == NULL) { phh@2621: _pc_descs[0] = NULL; // native method; no PcDescs at all duke@435: return; duke@435: } duke@435: NOT_PRODUCT(++nmethod_stats.pc_desc_resets); duke@435: // reset the cache by filling it with benign (non-null) values duke@435: assert(initial_pc_desc->pc_offset() < 0, "must be sentinel"); duke@435: for (int i = 0; i < cache_size; i++) duke@435: _pc_descs[i] = initial_pc_desc; duke@435: } duke@435: duke@435: PcDesc* PcDescCache::find_pc_desc(int pc_offset, bool approximate) { duke@435: NOT_PRODUCT(++nmethod_stats.pc_desc_queries); phh@2621: NOT_PRODUCT(if (approximate) ++nmethod_stats.pc_desc_approx); phh@2621: phh@2621: // Note: one might think that caching the most recently phh@2621: // read value separately would be a win, but one would be phh@2621: // wrong. When many threads are updating it, the cache phh@2621: // line it's in would bounce between caches, negating phh@2621: // any benefit. duke@435: duke@435: // In order to prevent race conditions do not load cache elements duke@435: // repeatedly, but use a local copy: duke@435: PcDesc* res; duke@435: phh@2621: // Step one: Check the most recently added value. phh@2621: res = _pc_descs[0]; phh@2621: if (res == NULL) return NULL; // native method; no PcDescs at all duke@435: if (match_desc(res, pc_offset, approximate)) { duke@435: NOT_PRODUCT(++nmethod_stats.pc_desc_repeats); duke@435: return res; duke@435: } duke@435: phh@2621: // Step two: Check the rest of the LRU cache. phh@2621: for (int i = 1; i < cache_size; ++i) { duke@435: res = _pc_descs[i]; phh@2621: if (res->pc_offset() < 0) break; // optimization: skip empty cache duke@435: if (match_desc(res, pc_offset, approximate)) { duke@435: NOT_PRODUCT(++nmethod_stats.pc_desc_hits); duke@435: return res; duke@435: } duke@435: } duke@435: duke@435: // Report failure. duke@435: return NULL; duke@435: } duke@435: duke@435: void PcDescCache::add_pc_desc(PcDesc* pc_desc) { duke@435: NOT_PRODUCT(++nmethod_stats.pc_desc_adds); phh@2621: // Update the LRU cache by shifting pc_desc forward. duke@435: for (int i = 0; i < cache_size; i++) { duke@435: PcDesc* next = _pc_descs[i]; duke@435: _pc_descs[i] = pc_desc; duke@435: pc_desc = next; duke@435: } duke@435: } duke@435: duke@435: // adjust pcs_size so that it is a multiple of both oopSize and duke@435: // sizeof(PcDesc) (assumes that if sizeof(PcDesc) is not a multiple duke@435: // of oopSize, then 2*sizeof(PcDesc) is) phh@2621: static int adjust_pcs_size(int pcs_size) { duke@435: int nsize = round_to(pcs_size, oopSize); duke@435: if ((nsize % sizeof(PcDesc)) != 0) { duke@435: nsize = pcs_size + sizeof(PcDesc); duke@435: } phh@2621: assert((nsize % oopSize) == 0, "correct alignment"); duke@435: return nsize; duke@435: } duke@435: duke@435: //----------------------------------------------------------------------------- duke@435: duke@435: duke@435: void nmethod::add_exception_cache_entry(ExceptionCache* new_entry) { duke@435: assert(ExceptionCache_lock->owned_by_self(),"Must hold the ExceptionCache_lock"); duke@435: assert(new_entry != NULL,"Must be non null"); duke@435: assert(new_entry->next() == NULL, "Must be null"); duke@435: duke@435: if (exception_cache() != NULL) { duke@435: new_entry->set_next(exception_cache()); duke@435: } duke@435: set_exception_cache(new_entry); duke@435: } duke@435: duke@435: void nmethod::remove_from_exception_cache(ExceptionCache* ec) { duke@435: ExceptionCache* prev = NULL; duke@435: ExceptionCache* curr = exception_cache(); duke@435: assert(curr != NULL, "nothing to remove"); duke@435: // find the previous and next entry of ec duke@435: while (curr != ec) { duke@435: prev = curr; duke@435: curr = curr->next(); duke@435: assert(curr != NULL, "ExceptionCache not found"); duke@435: } duke@435: // now: curr == ec duke@435: ExceptionCache* next = curr->next(); duke@435: if (prev == NULL) { duke@435: set_exception_cache(next); duke@435: } else { duke@435: prev->set_next(next); duke@435: } duke@435: delete curr; duke@435: } duke@435: duke@435: duke@435: // public method for accessing the exception cache duke@435: // These are the public access methods. duke@435: address nmethod::handler_for_exception_and_pc(Handle exception, address pc) { duke@435: // We never grab a lock to read the exception cache, so we may duke@435: // have false negatives. This is okay, as it can only happen during duke@435: // the first few exception lookups for a given nmethod. duke@435: ExceptionCache* ec = exception_cache(); duke@435: while (ec != NULL) { duke@435: address ret_val; duke@435: if ((ret_val = ec->match(exception,pc)) != NULL) { duke@435: return ret_val; duke@435: } duke@435: ec = ec->next(); duke@435: } duke@435: return NULL; duke@435: } duke@435: duke@435: duke@435: void nmethod::add_handler_for_exception_and_pc(Handle exception, address pc, address handler) { duke@435: // There are potential race conditions during exception cache updates, so we duke@435: // must own the ExceptionCache_lock before doing ANY modifications. Because twisti@1040: // we don't lock during reads, it is possible to have several threads attempt duke@435: // to update the cache with the same data. We need to check for already inserted duke@435: // copies of the current data before adding it. duke@435: duke@435: MutexLocker ml(ExceptionCache_lock); duke@435: ExceptionCache* target_entry = exception_cache_entry_for_exception(exception); duke@435: duke@435: if (target_entry == NULL || !target_entry->add_address_and_handler(pc,handler)) { duke@435: target_entry = new ExceptionCache(exception,pc,handler); duke@435: add_exception_cache_entry(target_entry); duke@435: } duke@435: } duke@435: duke@435: duke@435: //-------------end of code for ExceptionCache-------------- duke@435: duke@435: duke@435: int nmethod::total_size() const { duke@435: return twisti@2117: consts_size() + twisti@2103: insts_size() + duke@435: stub_size() + duke@435: scopes_data_size() + duke@435: scopes_pcs_size() + duke@435: handler_table_size() + duke@435: nul_chk_table_size(); duke@435: } duke@435: duke@435: const char* nmethod::compile_kind() const { duke@435: if (is_osr_method()) return "osr"; never@1544: if (method() != NULL && is_native_method()) return "c2n"; duke@435: return NULL; duke@435: } duke@435: never@1999: // Fill in default values for various flag fields never@1999: void nmethod::init_defaults() { never@1999: _state = alive; never@1999: _marked_for_reclamation = 0; never@1999: _has_flushed_dependencies = 0; never@1999: _speculatively_disconnected = 0; never@1999: _has_unsafe_access = 0; never@1999: _has_method_handle_invokes = 0; never@3500: _lazy_critical_native = 0; kvn@4103: _has_wide_vectors = 0; never@1999: _marked_for_deoptimization = 0; never@1999: _lock_count = 0; never@1999: _stack_traversal_mark = 0; never@1999: _unload_reported = false; // jvmti state never@1999: never@2081: #ifdef ASSERT never@2081: _oops_are_stale = false; never@2081: #endif never@2081: never@1999: _oops_do_mark_link = NULL; never@1999: _jmethod_id = NULL; never@1999: _osr_link = NULL; never@1999: _scavenge_root_link = NULL; never@1999: _scavenge_root_state = 0; never@1999: _saved_nmethod_link = NULL; never@1999: _compiler = NULL; never@1999: never@1999: #ifdef HAVE_DTRACE_H never@1999: _trap_offset = 0; never@1999: #endif // def HAVE_DTRACE_H never@1999: } duke@435: duke@435: nmethod* nmethod::new_native_nmethod(methodHandle method, twisti@2687: int compile_id, duke@435: CodeBuffer *code_buffer, duke@435: int vep_offset, duke@435: int frame_complete, duke@435: int frame_size, duke@435: ByteSize basic_lock_owner_sp_offset, duke@435: ByteSize basic_lock_sp_offset, duke@435: OopMapSet* oop_maps) { coleenp@4037: code_buffer->finalize_oop_references(method); duke@435: // create nmethod duke@435: nmethod* nm = NULL; duke@435: { duke@435: MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); duke@435: int native_nmethod_size = allocation_size(code_buffer, sizeof(nmethod)); neliasso@4952: CodeOffsets offsets; neliasso@4952: offsets.set_value(CodeOffsets::Verified_Entry, vep_offset); neliasso@4952: offsets.set_value(CodeOffsets::Frame_Complete, frame_complete); neliasso@4952: nm = new (native_nmethod_size) nmethod(method(), native_nmethod_size, neliasso@4952: compile_id, &offsets, neliasso@4952: code_buffer, frame_size, neliasso@4952: basic_lock_owner_sp_offset, neliasso@4952: basic_lock_sp_offset, oop_maps); neliasso@4952: NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_native_nmethod(nm)); neliasso@4952: if (PrintAssembly && nm != NULL) { neliasso@4952: Disassembler::decode(nm); morris@4864: } duke@435: } duke@435: // verify nmethod duke@435: debug_only(if (nm) nm->verify();) // might block duke@435: duke@435: if (nm != NULL) { duke@435: nm->log_new_nmethod(); duke@435: } duke@435: duke@435: return nm; duke@435: } duke@435: kamg@551: #ifdef HAVE_DTRACE_H kamg@551: nmethod* nmethod::new_dtrace_nmethod(methodHandle method, kamg@551: CodeBuffer *code_buffer, kamg@551: int vep_offset, kamg@551: int trap_offset, kamg@551: int frame_complete, kamg@551: int frame_size) { coleenp@4037: code_buffer->finalize_oop_references(method); kamg@551: // create nmethod kamg@551: nmethod* nm = NULL; kamg@551: { kamg@551: MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); kamg@551: int nmethod_size = allocation_size(code_buffer, sizeof(nmethod)); neliasso@4952: CodeOffsets offsets; neliasso@4952: offsets.set_value(CodeOffsets::Verified_Entry, vep_offset); neliasso@4952: offsets.set_value(CodeOffsets::Dtrace_trap, trap_offset); neliasso@4952: offsets.set_value(CodeOffsets::Frame_Complete, frame_complete); kamg@551: neliasso@4952: nm = new (nmethod_size) nmethod(method(), nmethod_size, neliasso@4952: &offsets, code_buffer, frame_size); kamg@551: neliasso@4952: NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_nmethod(nm)); neliasso@4952: if (PrintAssembly && nm != NULL) { neliasso@4952: Disassembler::decode(nm); morris@4864: } kamg@551: } kamg@551: // verify nmethod kamg@551: debug_only(if (nm) nm->verify();) // might block kamg@551: kamg@551: if (nm != NULL) { kamg@551: nm->log_new_nmethod(); kamg@551: } kamg@551: kamg@551: return nm; kamg@551: } kamg@551: kamg@551: #endif // def HAVE_DTRACE_H kamg@551: duke@435: nmethod* nmethod::new_nmethod(methodHandle method, duke@435: int compile_id, duke@435: int entry_bci, duke@435: CodeOffsets* offsets, duke@435: int orig_pc_offset, duke@435: DebugInformationRecorder* debug_info, duke@435: Dependencies* dependencies, duke@435: CodeBuffer* code_buffer, int frame_size, duke@435: OopMapSet* oop_maps, duke@435: ExceptionHandlerTable* handler_table, duke@435: ImplicitExceptionTable* nul_chk_table, duke@435: AbstractCompiler* compiler, duke@435: int comp_level duke@435: ) duke@435: { duke@435: assert(debug_info->oop_recorder() == code_buffer->oop_recorder(), "shared OR"); coleenp@4037: code_buffer->finalize_oop_references(method); duke@435: // create nmethod duke@435: nmethod* nm = NULL; duke@435: { MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); duke@435: int nmethod_size = duke@435: allocation_size(code_buffer, sizeof(nmethod)) duke@435: + adjust_pcs_size(debug_info->pcs_size()) duke@435: + round_to(dependencies->size_in_bytes() , oopSize) duke@435: + round_to(handler_table->size_in_bytes(), oopSize) duke@435: + round_to(nul_chk_table->size_in_bytes(), oopSize) duke@435: + round_to(debug_info->data_size() , oopSize); neliasso@4952: neliasso@4952: nm = new (nmethod_size) neliasso@4952: nmethod(method(), nmethod_size, compile_id, entry_bci, offsets, neliasso@4952: orig_pc_offset, debug_info, dependencies, code_buffer, frame_size, neliasso@4952: oop_maps, neliasso@4952: handler_table, neliasso@4952: nul_chk_table, neliasso@4952: compiler, neliasso@4952: comp_level); neliasso@4952: duke@435: if (nm != NULL) { duke@435: // To make dependency checking during class loading fast, record duke@435: // the nmethod dependencies in the classes it is dependent on. duke@435: // This allows the dependency checking code to simply walk the duke@435: // class hierarchy above the loaded class, checking only nmethods duke@435: // which are dependent on those classes. The slow way is to duke@435: // check every nmethod for dependencies which makes it linear in duke@435: // the number of methods compiled. For applications with a lot duke@435: // classes the slow way is too slow. duke@435: for (Dependencies::DepStream deps(nm); deps.next(); ) { coleenp@4037: Klass* klass = deps.context_type(); neliasso@4952: if (klass == NULL) { neliasso@4952: continue; // ignore things like evol_method neliasso@4952: } duke@435: duke@435: // record this nmethod as dependent on this klass coleenp@4037: InstanceKlass::cast(klass)->add_dependent_nmethod(nm); duke@435: } duke@435: } duke@435: NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_nmethod(nm)); neliasso@4952: if (PrintAssembly && nm != NULL) { duke@435: Disassembler::decode(nm); neliasso@4952: } duke@435: } duke@435: duke@435: // verify nmethod duke@435: debug_only(if (nm) nm->verify();) // might block duke@435: duke@435: if (nm != NULL) { duke@435: nm->log_new_nmethod(); duke@435: } duke@435: duke@435: // done duke@435: return nm; duke@435: } duke@435: duke@435: duke@435: // For native wrappers duke@435: nmethod::nmethod( coleenp@4037: Method* method, duke@435: int nmethod_size, twisti@2687: int compile_id, duke@435: CodeOffsets* offsets, duke@435: CodeBuffer* code_buffer, duke@435: int frame_size, duke@435: ByteSize basic_lock_owner_sp_offset, duke@435: ByteSize basic_lock_sp_offset, duke@435: OopMapSet* oop_maps ) duke@435: : CodeBlob("native nmethod", code_buffer, sizeof(nmethod), duke@435: nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, oop_maps), kamg@2361: _native_receiver_sp_offset(basic_lock_owner_sp_offset), kamg@2361: _native_basic_lock_sp_offset(basic_lock_sp_offset) duke@435: { duke@435: { duke@435: debug_only(No_Safepoint_Verifier nsv;) duke@435: assert_locked_or_safepoint(CodeCache_lock); duke@435: never@1999: init_defaults(); duke@435: _method = method; duke@435: _entry_bci = InvocationEntryBci; duke@435: // We have no exception handler or deopt handler make the duke@435: // values something that will never match a pc like the nmethod vtable entry duke@435: _exception_offset = 0; duke@435: _deoptimize_offset = 0; twisti@1639: _deoptimize_mh_offset = 0; duke@435: _orig_pc_offset = 0; never@1999: twisti@2103: _consts_offset = data_offset(); duke@435: _stub_offset = data_offset(); twisti@1918: _oops_offset = data_offset(); coleenp@4037: _metadata_offset = _oops_offset + round_to(code_buffer->total_oop_size(), oopSize); coleenp@4037: _scopes_data_offset = _metadata_offset + round_to(code_buffer->total_metadata_size(), wordSize); duke@435: _scopes_pcs_offset = _scopes_data_offset; duke@435: _dependencies_offset = _scopes_pcs_offset; duke@435: _handler_table_offset = _dependencies_offset; duke@435: _nul_chk_table_offset = _handler_table_offset; duke@435: _nmethod_end_offset = _nul_chk_table_offset; twisti@2687: _compile_id = compile_id; duke@435: _comp_level = CompLevel_none; twisti@2103: _entry_point = code_begin() + offsets->value(CodeOffsets::Entry); twisti@2103: _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry); duke@435: _osr_entry_point = NULL; duke@435: _exception_cache = NULL; duke@435: _pc_desc_cache.reset_to(NULL); duke@435: coleenp@4037: code_buffer->copy_values_to(this); never@2658: if (ScavengeRootsInCode && detect_scavenge_root_oops()) { never@2658: CodeCache::add_scavenge_root_nmethod(this); johnc@5548: Universe::heap()->register_nmethod(this); never@2658: } jrose@1424: debug_only(verify_scavenge_root_oops()); duke@435: CodeCache::commit(this); duke@435: } duke@435: duke@435: if (PrintNativeNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) { duke@435: ttyLocker ttyl; // keep the following output all in one block duke@435: // This output goes directly to the tty, not the compiler log. duke@435: // To enable tools to match it up with the compilation activity, duke@435: // be sure to tag this tty output with the compile ID. duke@435: if (xtty != NULL) { duke@435: xtty->begin_head("print_native_nmethod"); duke@435: xtty->method(_method); duke@435: xtty->stamp(); duke@435: xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this); duke@435: } duke@435: // print the header part first duke@435: print(); duke@435: // then print the requested information duke@435: if (PrintNativeNMethods) { duke@435: print_code(); twisti@4101: if (oop_maps != NULL) { twisti@4101: oop_maps->print(); twisti@4101: } duke@435: } duke@435: if (PrintRelocations) { duke@435: print_relocations(); duke@435: } duke@435: if (xtty != NULL) { duke@435: xtty->tail("print_native_nmethod"); duke@435: } duke@435: } duke@435: } duke@435: kamg@551: // For dtrace wrappers kamg@551: #ifdef HAVE_DTRACE_H kamg@551: nmethod::nmethod( coleenp@4037: Method* method, kamg@551: int nmethod_size, kamg@551: CodeOffsets* offsets, kamg@551: CodeBuffer* code_buffer, kamg@551: int frame_size) kamg@551: : CodeBlob("dtrace nmethod", code_buffer, sizeof(nmethod), kamg@551: nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, NULL), kamg@2361: _native_receiver_sp_offset(in_ByteSize(-1)), kamg@2361: _native_basic_lock_sp_offset(in_ByteSize(-1)) kamg@551: { kamg@551: { kamg@551: debug_only(No_Safepoint_Verifier nsv;) kamg@551: assert_locked_or_safepoint(CodeCache_lock); kamg@551: never@1999: init_defaults(); kamg@551: _method = method; kamg@551: _entry_bci = InvocationEntryBci; kamg@551: // We have no exception handler or deopt handler make the kamg@551: // values something that will never match a pc like the nmethod vtable entry kamg@551: _exception_offset = 0; kamg@551: _deoptimize_offset = 0; twisti@1639: _deoptimize_mh_offset = 0; never@1813: _unwind_handler_offset = -1; kamg@551: _trap_offset = offsets->value(CodeOffsets::Dtrace_trap); kamg@551: _orig_pc_offset = 0; twisti@2103: _consts_offset = data_offset(); kamg@551: _stub_offset = data_offset(); twisti@1918: _oops_offset = data_offset(); coleenp@4037: _metadata_offset = _oops_offset + round_to(code_buffer->total_oop_size(), oopSize); coleenp@4037: _scopes_data_offset = _metadata_offset + round_to(code_buffer->total_metadata_size(), wordSize); kamg@551: _scopes_pcs_offset = _scopes_data_offset; kamg@551: _dependencies_offset = _scopes_pcs_offset; kamg@551: _handler_table_offset = _dependencies_offset; kamg@551: _nul_chk_table_offset = _handler_table_offset; kamg@551: _nmethod_end_offset = _nul_chk_table_offset; kamg@551: _compile_id = 0; // default kamg@551: _comp_level = CompLevel_none; twisti@2103: _entry_point = code_begin() + offsets->value(CodeOffsets::Entry); twisti@2103: _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry); kamg@551: _osr_entry_point = NULL; kamg@551: _exception_cache = NULL; kamg@551: _pc_desc_cache.reset_to(NULL); kamg@551: coleenp@4037: code_buffer->copy_values_to(this); jrose@1424: debug_only(verify_scavenge_root_oops()); kamg@551: CodeCache::commit(this); kamg@551: } kamg@551: kamg@551: if (PrintNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) { kamg@551: ttyLocker ttyl; // keep the following output all in one block kamg@551: // This output goes directly to the tty, not the compiler log. kamg@551: // To enable tools to match it up with the compilation activity, kamg@551: // be sure to tag this tty output with the compile ID. kamg@551: if (xtty != NULL) { kamg@551: xtty->begin_head("print_dtrace_nmethod"); kamg@551: xtty->method(_method); kamg@551: xtty->stamp(); kamg@551: xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this); kamg@551: } kamg@551: // print the header part first kamg@551: print(); kamg@551: // then print the requested information kamg@551: if (PrintNMethods) { kamg@551: print_code(); kamg@551: } kamg@551: if (PrintRelocations) { kamg@551: print_relocations(); kamg@551: } kamg@551: if (xtty != NULL) { kamg@551: xtty->tail("print_dtrace_nmethod"); kamg@551: } kamg@551: } kamg@551: } kamg@551: #endif // def HAVE_DTRACE_H duke@435: coleenp@5614: void* nmethod::operator new(size_t size, int nmethod_size) throw() { neliasso@4952: // Not critical, may return null if there is too little continuous memory neliasso@4952: return CodeCache::allocate(nmethod_size); duke@435: } duke@435: duke@435: nmethod::nmethod( coleenp@4037: Method* method, duke@435: int nmethod_size, duke@435: int compile_id, duke@435: int entry_bci, duke@435: CodeOffsets* offsets, duke@435: int orig_pc_offset, duke@435: DebugInformationRecorder* debug_info, duke@435: Dependencies* dependencies, duke@435: CodeBuffer *code_buffer, duke@435: int frame_size, duke@435: OopMapSet* oop_maps, duke@435: ExceptionHandlerTable* handler_table, duke@435: ImplicitExceptionTable* nul_chk_table, duke@435: AbstractCompiler* compiler, duke@435: int comp_level duke@435: ) duke@435: : CodeBlob("nmethod", code_buffer, sizeof(nmethod), duke@435: nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, oop_maps), kamg@2361: _native_receiver_sp_offset(in_ByteSize(-1)), kamg@2361: _native_basic_lock_sp_offset(in_ByteSize(-1)) duke@435: { duke@435: assert(debug_info->oop_recorder() == code_buffer->oop_recorder(), "shared OR"); duke@435: { duke@435: debug_only(No_Safepoint_Verifier nsv;) duke@435: assert_locked_or_safepoint(CodeCache_lock); duke@435: never@1999: init_defaults(); duke@435: _method = method; never@1999: _entry_bci = entry_bci; duke@435: _compile_id = compile_id; duke@435: _comp_level = comp_level; duke@435: _compiler = compiler; duke@435: _orig_pc_offset = orig_pc_offset; twisti@2103: twisti@2103: // Section offsets twisti@2117: _consts_offset = content_offset() + code_buffer->total_offset_of(code_buffer->consts()); twisti@2117: _stub_offset = content_offset() + code_buffer->total_offset_of(code_buffer->stubs()); duke@435: duke@435: // Exception handler and deopt handler are in the stub section twisti@2406: assert(offsets->value(CodeOffsets::Exceptions) != -1, "must be set"); twisti@2406: assert(offsets->value(CodeOffsets::Deopt ) != -1, "must be set"); twisti@2103: _exception_offset = _stub_offset + offsets->value(CodeOffsets::Exceptions); twisti@2103: _deoptimize_offset = _stub_offset + offsets->value(CodeOffsets::Deopt); twisti@2406: if (offsets->value(CodeOffsets::DeoptMH) != -1) { twisti@2117: _deoptimize_mh_offset = _stub_offset + offsets->value(CodeOffsets::DeoptMH); twisti@2117: } else { twisti@2117: _deoptimize_mh_offset = -1; twisti@2117: } never@1813: if (offsets->value(CodeOffsets::UnwindHandler) != -1) { twisti@2103: _unwind_handler_offset = code_offset() + offsets->value(CodeOffsets::UnwindHandler); never@1813: } else { twisti@2103: _unwind_handler_offset = -1; never@1813: } twisti@2103: twisti@1918: _oops_offset = data_offset(); coleenp@4037: _metadata_offset = _oops_offset + round_to(code_buffer->total_oop_size(), oopSize); coleenp@4037: _scopes_data_offset = _metadata_offset + round_to(code_buffer->total_metadata_size(), wordSize); coleenp@4037: twisti@1918: _scopes_pcs_offset = _scopes_data_offset + round_to(debug_info->data_size (), oopSize); duke@435: _dependencies_offset = _scopes_pcs_offset + adjust_pcs_size(debug_info->pcs_size()); duke@435: _handler_table_offset = _dependencies_offset + round_to(dependencies->size_in_bytes (), oopSize); duke@435: _nul_chk_table_offset = _handler_table_offset + round_to(handler_table->size_in_bytes(), oopSize); duke@435: _nmethod_end_offset = _nul_chk_table_offset + round_to(nul_chk_table->size_in_bytes(), oopSize); duke@435: twisti@2103: _entry_point = code_begin() + offsets->value(CodeOffsets::Entry); twisti@2103: _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry); twisti@2103: _osr_entry_point = code_begin() + offsets->value(CodeOffsets::OSR_Entry); duke@435: _exception_cache = NULL; duke@435: _pc_desc_cache.reset_to(scopes_pcs_begin()); duke@435: duke@435: // Copy contents of ScopeDescRecorder to nmethod coleenp@4037: code_buffer->copy_values_to(this); duke@435: debug_info->copy_to(this); duke@435: dependencies->copy_to(this); jrose@1424: if (ScavengeRootsInCode && detect_scavenge_root_oops()) { jrose@1424: CodeCache::add_scavenge_root_nmethod(this); johnc@5548: Universe::heap()->register_nmethod(this); jrose@1424: } jrose@1424: debug_only(verify_scavenge_root_oops()); duke@435: duke@435: CodeCache::commit(this); duke@435: duke@435: // Copy contents of ExceptionHandlerTable to nmethod duke@435: handler_table->copy_to(this); duke@435: nul_chk_table->copy_to(this); duke@435: duke@435: // we use the information of entry points to find out if a method is duke@435: // static or non static duke@435: assert(compiler->is_c2() || duke@435: _method->is_static() == (entry_point() == _verified_entry_point), duke@435: " entry points must be same for static methods and vice versa"); duke@435: } duke@435: jrose@535: bool printnmethods = PrintNMethods jrose@535: || CompilerOracle::should_print(_method) jrose@535: || CompilerOracle::has_option_string(_method, "PrintNMethods"); duke@435: if (printnmethods || PrintDebugInfo || PrintRelocations || PrintDependencies || PrintExceptionHandlers) { duke@435: print_nmethod(printnmethods); duke@435: } duke@435: } duke@435: duke@435: duke@435: // Print a short set of xml attributes to identify this nmethod. The duke@435: // output should be embedded in some other element. duke@435: void nmethod::log_identity(xmlStream* log) const { duke@435: log->print(" compile_id='%d'", compile_id()); duke@435: const char* nm_kind = compile_kind(); duke@435: if (nm_kind != NULL) log->print(" compile_kind='%s'", nm_kind); duke@435: if (compiler() != NULL) { duke@435: log->print(" compiler='%s'", compiler()->name()); duke@435: } iveresov@2138: if (TieredCompilation) { iveresov@2138: log->print(" level='%d'", comp_level()); iveresov@2138: } duke@435: } duke@435: duke@435: duke@435: #define LOG_OFFSET(log, name) \ duke@435: if ((intptr_t)name##_end() - (intptr_t)name##_begin()) \ duke@435: log->print(" " XSTR(name) "_offset='%d'" , \ duke@435: (intptr_t)name##_begin() - (intptr_t)this) duke@435: duke@435: duke@435: void nmethod::log_new_nmethod() const { duke@435: if (LogCompilation && xtty != NULL) { duke@435: ttyLocker ttyl; duke@435: HandleMark hm; duke@435: xtty->begin_elem("nmethod"); duke@435: log_identity(xtty); twisti@2103: xtty->print(" entry='" INTPTR_FORMAT "' size='%d'", code_begin(), size()); duke@435: xtty->print(" address='" INTPTR_FORMAT "'", (intptr_t) this); duke@435: duke@435: LOG_OFFSET(xtty, relocation); twisti@2117: LOG_OFFSET(xtty, consts); twisti@2103: LOG_OFFSET(xtty, insts); duke@435: LOG_OFFSET(xtty, stub); duke@435: LOG_OFFSET(xtty, scopes_data); duke@435: LOG_OFFSET(xtty, scopes_pcs); duke@435: LOG_OFFSET(xtty, dependencies); duke@435: LOG_OFFSET(xtty, handler_table); duke@435: LOG_OFFSET(xtty, nul_chk_table); duke@435: LOG_OFFSET(xtty, oops); duke@435: duke@435: xtty->method(method()); duke@435: xtty->stamp(); duke@435: xtty->end_elem(); duke@435: } duke@435: } duke@435: duke@435: #undef LOG_OFFSET duke@435: duke@435: duke@435: // Print out more verbose output usually for a newly created nmethod. twisti@2687: void nmethod::print_on(outputStream* st, const char* msg) const { duke@435: if (st != NULL) { duke@435: ttyLocker ttyl; twisti@3969: if (WizardMode) { twisti@3969: CompileTask::print_compilation(st, this, msg, /*short_form:*/ true); twisti@3969: st->print_cr(" (" INTPTR_FORMAT ")", this); twisti@3969: } else { twisti@3969: CompileTask::print_compilation(st, this, msg, /*short_form:*/ false); twisti@3969: } duke@435: } duke@435: } duke@435: duke@435: duke@435: void nmethod::print_nmethod(bool printmethod) { duke@435: ttyLocker ttyl; // keep the following output all in one block duke@435: if (xtty != NULL) { duke@435: xtty->begin_head("print_nmethod"); duke@435: xtty->stamp(); duke@435: xtty->end_head(); duke@435: } duke@435: // print the header part first duke@435: print(); duke@435: // then print the requested information duke@435: if (printmethod) { duke@435: print_code(); duke@435: print_pcs(); twisti@3969: if (oop_maps()) { twisti@3969: oop_maps()->print(); twisti@3969: } duke@435: } duke@435: if (PrintDebugInfo) { duke@435: print_scopes(); duke@435: } duke@435: if (PrintRelocations) { duke@435: print_relocations(); duke@435: } duke@435: if (PrintDependencies) { duke@435: print_dependencies(); duke@435: } duke@435: if (PrintExceptionHandlers) { duke@435: print_handler_table(); duke@435: print_nul_chk_table(); duke@435: } duke@435: if (xtty != NULL) { duke@435: xtty->tail("print_nmethod"); duke@435: } duke@435: } duke@435: duke@435: twisti@1918: // Promote one word from an assembly-time handle to a live embedded oop. twisti@1918: inline void nmethod::initialize_immediate_oop(oop* dest, jobject handle) { twisti@1918: if (handle == NULL || twisti@1918: // As a special case, IC oops are initialized to 1 or -1. twisti@1918: handle == (jobject) Universe::non_oop_word()) { twisti@1918: (*dest) = (oop) handle; twisti@1918: } else { twisti@1918: (*dest) = JNIHandles::resolve_non_null(handle); twisti@1918: } twisti@1918: } twisti@1918: twisti@1918: coleenp@4037: // Have to have the same name because it's called by a template coleenp@4037: void nmethod::copy_values(GrowableArray* array) { twisti@1918: int length = array->length(); coleenp@4037: assert((address)(oops_begin() + length) <= (address)oops_end(), "oops big enough"); twisti@1918: oop* dest = oops_begin(); twisti@1918: for (int index = 0 ; index < length; index++) { twisti@1918: initialize_immediate_oop(&dest[index], array->at(index)); twisti@1918: } twisti@1918: twisti@1918: // Now we can fix up all the oops in the code. We need to do this twisti@1918: // in the code because the assembler uses jobjects as placeholders. twisti@1918: // The code and relocations have already been initialized by the twisti@1918: // CodeBlob constructor, so it is valid even at this early point to twisti@1918: // iterate over relocations and patch the code. twisti@1918: fix_oop_relocations(NULL, NULL, /*initialize_immediates=*/ true); twisti@1918: } twisti@1918: coleenp@4037: void nmethod::copy_values(GrowableArray* array) { coleenp@4037: int length = array->length(); coleenp@4037: assert((address)(metadata_begin() + length) <= (address)metadata_end(), "big enough"); coleenp@4037: Metadata** dest = metadata_begin(); coleenp@4037: for (int index = 0 ; index < length; index++) { coleenp@4037: dest[index] = array->at(index); coleenp@4037: } coleenp@4037: } twisti@1918: twisti@1918: bool nmethod::is_at_poll_return(address pc) { twisti@1918: RelocIterator iter(this, pc, pc+1); twisti@1918: while (iter.next()) { twisti@1918: if (iter.type() == relocInfo::poll_return_type) twisti@1918: return true; twisti@1918: } twisti@1918: return false; twisti@1918: } twisti@1918: twisti@1918: twisti@1918: bool nmethod::is_at_poll_or_poll_return(address pc) { twisti@1918: RelocIterator iter(this, pc, pc+1); twisti@1918: while (iter.next()) { twisti@1918: relocInfo::relocType t = iter.type(); twisti@1918: if (t == relocInfo::poll_return_type || t == relocInfo::poll_type) twisti@1918: return true; twisti@1918: } twisti@1918: return false; twisti@1918: } twisti@1918: twisti@1918: twisti@1918: void nmethod::fix_oop_relocations(address begin, address end, bool initialize_immediates) { twisti@1918: // re-patch all oop-bearing instructions, just in case some oops moved twisti@1918: RelocIterator iter(this, begin, end); twisti@1918: while (iter.next()) { twisti@1918: if (iter.type() == relocInfo::oop_type) { twisti@1918: oop_Relocation* reloc = iter.oop_reloc(); twisti@1918: if (initialize_immediates && reloc->oop_is_immediate()) { twisti@1918: oop* dest = reloc->oop_addr(); twisti@1918: initialize_immediate_oop(dest, (jobject) *dest); twisti@1918: } twisti@1918: // Refresh the oop-related bits of this instruction. twisti@1918: reloc->fix_oop_relocation(); coleenp@4037: } else if (iter.type() == relocInfo::metadata_type) { coleenp@4037: metadata_Relocation* reloc = iter.metadata_reloc(); coleenp@4037: reloc->fix_metadata_relocation(); twisti@1918: } twisti@1918: } twisti@1918: } twisti@1918: twisti@1918: never@2657: void nmethod::verify_oop_relocations() { never@2657: // Ensure sure that the code matches the current oop values never@2657: RelocIterator iter(this, NULL, NULL); never@2657: while (iter.next()) { never@2657: if (iter.type() == relocInfo::oop_type) { never@2657: oop_Relocation* reloc = iter.oop_reloc(); never@2657: if (!reloc->oop_is_immediate()) { never@2657: reloc->verify_oop_relocation(); never@2657: } never@2657: } never@2657: } never@2657: } never@2657: never@2657: duke@435: ScopeDesc* nmethod::scope_desc_at(address pc) { duke@435: PcDesc* pd = pc_desc_at(pc); duke@435: guarantee(pd != NULL, "scope must be present"); duke@435: return new ScopeDesc(this, pd->scope_decode_offset(), kvn@1688: pd->obj_decode_offset(), pd->should_reexecute(), kvn@1688: pd->return_oop()); duke@435: } duke@435: duke@435: duke@435: void nmethod::clear_inline_caches() { duke@435: assert(SafepointSynchronize::is_at_safepoint(), "cleaning of IC's only allowed at safepoint"); duke@435: if (is_zombie()) { duke@435: return; duke@435: } duke@435: duke@435: RelocIterator iter(this); duke@435: while (iter.next()) { duke@435: iter.reloc()->clear_inline_cache(); duke@435: } duke@435: } duke@435: duke@435: duke@435: void nmethod::cleanup_inline_caches() { duke@435: never@1893: assert_locked_or_safepoint(CompiledIC_lock); duke@435: duke@435: // If the method is not entrant or zombie then a JMP is plastered over the duke@435: // first few bytes. If an oop in the old code was there, that oop duke@435: // should not get GC'd. Skip the first few bytes of oops on duke@435: // not-entrant methods. duke@435: address low_boundary = verified_entry_point(); duke@435: if (!is_in_use()) { duke@435: low_boundary += NativeJump::instruction_size; duke@435: // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump. duke@435: // This means that the low_boundary is going to be a little too high. duke@435: // This shouldn't matter, since oops of non-entrant methods are never used. duke@435: // In fact, why are we bothering to look at oops in a non-entrant method?? duke@435: } duke@435: duke@435: // Find all calls in an nmethod, and clear the ones that points to zombie methods duke@435: ResourceMark rm; duke@435: RelocIterator iter(this, low_boundary); duke@435: while(iter.next()) { duke@435: switch(iter.type()) { duke@435: case relocInfo::virtual_call_type: duke@435: case relocInfo::opt_virtual_call_type: { duke@435: CompiledIC *ic = CompiledIC_at(iter.reloc()); duke@435: // Ok, to lookup references to zombies here duke@435: CodeBlob *cb = CodeCache::find_blob_unsafe(ic->ic_destination()); duke@435: if( cb != NULL && cb->is_nmethod() ) { duke@435: nmethod* nm = (nmethod*)cb; duke@435: // Clean inline caches pointing to both zombie and not_entrant methods kvn@1637: if (!nm->is_in_use() || (nm->method()->code() != nm)) ic->set_to_clean(); duke@435: } duke@435: break; duke@435: } duke@435: case relocInfo::static_call_type: { duke@435: CompiledStaticCall *csc = compiledStaticCall_at(iter.reloc()); duke@435: CodeBlob *cb = CodeCache::find_blob_unsafe(csc->destination()); duke@435: if( cb != NULL && cb->is_nmethod() ) { duke@435: nmethod* nm = (nmethod*)cb; duke@435: // Clean inline caches pointing to both zombie and not_entrant methods kvn@1637: if (!nm->is_in_use() || (nm->method()->code() != nm)) csc->set_to_clean(); duke@435: } duke@435: break; duke@435: } duke@435: } duke@435: } duke@435: } duke@435: jrose@1424: // This is a private interface with the sweeper. duke@435: void nmethod::mark_as_seen_on_stack() { duke@435: assert(is_not_entrant(), "must be a non-entrant method"); never@1999: // Set the traversal mark to ensure that the sweeper does 2 never@1999: // cleaning passes before moving to zombie. duke@435: set_stack_traversal_mark(NMethodSweeper::traversal_count()); duke@435: } duke@435: dcubed@2624: // Tell if a non-entrant method can be converted to a zombie (i.e., dcubed@2624: // there are no activations on the stack, not in use by the VM, dcubed@2624: // and not in use by the ServiceThread) duke@435: bool nmethod::can_not_entrant_be_converted() { duke@435: assert(is_not_entrant(), "must be a non-entrant method"); duke@435: duke@435: // Since the nmethod sweeper only does partial sweep the sweeper's traversal duke@435: // count can be greater than the stack traversal count before it hits the duke@435: // nmethod for the second time. dcubed@2624: return stack_traversal_mark()+1 < NMethodSweeper::traversal_count() && dcubed@2624: !is_locked_by_vm(); duke@435: } duke@435: duke@435: void nmethod::inc_decompile_count() { iveresov@2138: if (!is_compiled_by_c2()) return; duke@435: // Could be gated by ProfileTraps, but do not bother... coleenp@4037: Method* m = method(); duke@435: if (m == NULL) return; coleenp@4037: MethodData* mdo = m->method_data(); duke@435: if (mdo == NULL) return; coleenp@4037: // There is a benign race here. See comments in methodData.hpp. duke@435: mdo->inc_decompile_count(); duke@435: } duke@435: duke@435: void nmethod::make_unloaded(BoolObjectClosure* is_alive, oop cause) { duke@435: duke@435: post_compiled_method_unload(); duke@435: duke@435: // Since this nmethod is being unloaded, make sure that dependencies duke@435: // recorded in instanceKlasses get flushed and pass non-NULL closure to duke@435: // indicate that this work is being done during a GC. duke@435: assert(Universe::heap()->is_gc_active(), "should only be called during gc"); duke@435: assert(is_alive != NULL, "Should be non-NULL"); duke@435: // A non-NULL is_alive closure indicates that this is being called during GC. duke@435: flush_dependencies(is_alive); duke@435: duke@435: // Break cycle between nmethod & method duke@435: if (TraceClassUnloading && WizardMode) { duke@435: tty->print_cr("[Class unloading: Making nmethod " INTPTR_FORMAT coleenp@4037: " unloadable], Method*(" INTPTR_FORMAT duke@435: "), cause(" INTPTR_FORMAT ")", duke@435: this, (address)_method, (address)cause); jrose@1424: if (!Universe::heap()->is_gc_active()) jrose@1424: cause->klass()->print(); duke@435: } ysr@1376: // Unlink the osr method, so we do not look this up again ysr@1376: if (is_osr_method()) { ysr@1376: invalidate_osr_method(); ysr@1376: } coleenp@4037: // If _method is already NULL the Method* is about to be unloaded, duke@435: // so we don't have to break the cycle. Note that it is possible to coleenp@4037: // have the Method* live here, in case we unload the nmethod because coleenp@4037: // it is pointing to some oop (other than the Method*) being unloaded. duke@435: if (_method != NULL) { coleenp@4037: // OSR methods point to the Method*, but the Method* does not duke@435: // point back! duke@435: if (_method->code() == this) { duke@435: _method->clear_code(); // Break a cycle duke@435: } duke@435: _method = NULL; // Clear the method of this dead nmethod duke@435: } duke@435: // Make the class unloaded - i.e., change state and notify sweeper never@1893: assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint"); duke@435: if (is_in_use()) { duke@435: // Transitioning directly from live to unloaded -- so duke@435: // we need to force a cache clean-up; remember this duke@435: // for later on. duke@435: CodeCache::set_needs_cache_clean(true); duke@435: } never@1999: _state = unloaded; duke@435: never@1544: // Log the unloading. never@1544: log_state_change(); never@1544: coleenp@4037: // The Method* is gone at this point duke@435: assert(_method == NULL, "Tautology"); duke@435: jrose@1424: set_osr_link(NULL); jrose@1424: //set_scavenge_root_link(NULL); // done by prune_scavenge_root_nmethods duke@435: NMethodSweeper::notify(this); duke@435: } duke@435: duke@435: void nmethod::invalidate_osr_method() { duke@435: assert(_entry_bci != InvocationEntryBci, "wrong kind of nmethod"); duke@435: // Remove from list of active nmethods duke@435: if (method() != NULL) coleenp@4251: method()->method_holder()->remove_osr_nmethod(this); duke@435: // Set entry as invalid duke@435: _entry_bci = InvalidOSREntryBci; duke@435: } duke@435: never@1544: void nmethod::log_state_change() const { duke@435: if (LogCompilation) { duke@435: if (xtty != NULL) { duke@435: ttyLocker ttyl; // keep the following output all in one block never@1999: if (_state == unloaded) { never@1544: xtty->begin_elem("make_unloaded thread='" UINTX_FORMAT "'", never@1544: os::current_thread_id()); never@1544: } else { never@1544: xtty->begin_elem("make_not_entrant thread='" UINTX_FORMAT "'%s", never@1544: os::current_thread_id(), never@1999: (_state == zombie ? " zombie='1'" : "")); never@1544: } duke@435: log_identity(xtty); duke@435: xtty->stamp(); duke@435: xtty->end_elem(); duke@435: } duke@435: } never@1999: if (PrintCompilation && _state != unloaded) { twisti@2687: print_on(tty, _state == zombie ? "made zombie" : "made not entrant"); duke@435: } duke@435: } duke@435: duke@435: // Common functionality for both make_not_entrant and make_zombie never@1576: bool nmethod::make_not_entrant_or_zombie(unsigned int state) { duke@435: assert(state == zombie || state == not_entrant, "must be zombie or not_entrant"); dcubed@2624: assert(!is_zombie(), "should not already be a zombie"); duke@435: never@1999: // Make sure neither the nmethod nor the method is flushed in case of a safepoint in code below. duke@435: nmethodLocker nml(this); never@1999: methodHandle the_method(method()); never@2081: No_Safepoint_Verifier nsv; duke@435: johnc@5548: // during patching, depending on the nmethod state we must notify the GC that johnc@5548: // code has been unloaded, unregistering it. We cannot do this right while johnc@5548: // holding the Patching_lock because we need to use the CodeCache_lock. This johnc@5548: // would be prone to deadlocks. johnc@5548: // This flag is used to remember whether we need to later lock and unregister. johnc@5548: bool nmethod_needs_unregister = false; johnc@5548: duke@435: { never@1544: // invalidate osr nmethod before acquiring the patching lock since never@1544: // they both acquire leaf locks and we don't want a deadlock. never@1544: // This logic is equivalent to the logic below for patching the never@1544: // verified entry point of regular methods. never@1544: if (is_osr_method()) { never@1544: // this effectively makes the osr nmethod not entrant never@1544: invalidate_osr_method(); never@1544: } never@1544: duke@435: // Enter critical section. Does not block for safepoint. duke@435: MutexLockerEx pl(Patching_lock, Mutex::_no_safepoint_check_flag); never@1544: never@1999: if (_state == state) { never@1544: // another thread already performed this transition so nothing never@1544: // to do, but return false to indicate this. never@1544: return false; never@1544: } never@1544: duke@435: // The caller can be calling the method statically or through an inline duke@435: // cache call. never@1544: if (!is_osr_method() && !is_not_entrant()) { duke@435: NativeJump::patch_verified_entry(entry_point(), verified_entry_point(), duke@435: SharedRuntime::get_handle_wrong_method_stub()); duke@435: } duke@435: never@1999: if (is_in_use()) { never@1999: // It's a true state change, so mark the method as decompiled. never@1999: // Do it only for transition from alive. never@1999: inc_decompile_count(); never@1999: } kvn@1641: johnc@5548: // If the state is becoming a zombie, signal to unregister the nmethod with johnc@5548: // the heap. johnc@5548: // This nmethod may have already been unloaded during a full GC. johnc@5548: if ((state == zombie) && !is_unloaded()) { johnc@5548: nmethod_needs_unregister = true; johnc@5548: } johnc@5548: duke@435: // Change state never@1999: _state = state; never@1544: never@1544: // Log the transition once never@1544: log_state_change(); never@1544: never@1999: // Remove nmethod from method. never@1999: // We need to check if both the _code and _from_compiled_code_entry_point never@1999: // refer to this nmethod because there is a race in setting these two fields coleenp@4037: // in Method* as seen in bugid 4947125. never@1999: // If the vep() points to the zombie nmethod, the memory for the nmethod never@1999: // could be flushed and the compiler and vtable stubs could still call never@1999: // through it. never@1999: if (method() != NULL && (method()->code() == this || never@1999: method()->from_compiled_entry() == verified_entry_point())) { never@1999: HandleMark hm; never@1999: method()->clear_code(); never@1999: } never@1999: never@1999: if (state == not_entrant) { never@1999: mark_as_seen_on_stack(); never@1999: } never@1999: duke@435: } // leave critical region under Patching_lock duke@435: never@1893: // When the nmethod becomes zombie it is no longer alive so the never@1893: // dependencies must be flushed. nmethods in the not_entrant never@1893: // state will be flushed later when the transition to zombie never@1893: // happens or they get unloaded. never@1893: if (state == zombie) { never@2081: { never@2081: // Flushing dependecies must be done before any possible never@2081: // safepoint can sneak in, otherwise the oops used by the never@2081: // dependency logic could have become stale. never@2081: MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); johnc@5548: if (nmethod_needs_unregister) { johnc@5548: Universe::heap()->unregister_nmethod(this); johnc@5548: } never@2081: flush_dependencies(NULL); never@2081: } never@1999: dcubed@2624: // zombie only - if a JVMTI agent has enabled the CompiledMethodUnload dcubed@2624: // event and it hasn't already been reported for this nmethod then dcubed@2624: // report it now. The event may have been reported earilier if the GC dcubed@2624: // marked it for unloading). JvmtiDeferredEventQueue support means dcubed@2624: // we no longer go to a safepoint here. dcubed@2624: post_compiled_method_unload(); never@2081: never@2081: #ifdef ASSERT never@2081: // It's no longer safe to access the oops section since zombie never@2081: // nmethods aren't scanned for GC. never@2081: _oops_are_stale = true; never@2081: #endif roland@5629: // the Method may be reclaimed by class unloading now that the roland@5629: // nmethod is in zombie state roland@5629: set_method(NULL); never@1893: } else { never@1893: assert(state == not_entrant, "other cases may need to be handled differently"); never@1893: } never@1893: duke@435: if (TraceCreateZombies) { duke@435: tty->print_cr("nmethod <" INTPTR_FORMAT "> code made %s", this, (state == not_entrant) ? "not entrant" : "zombie"); duke@435: } duke@435: duke@435: // Make sweeper aware that there is a zombie method that needs to be removed duke@435: NMethodSweeper::notify(this); duke@435: never@1544: return true; duke@435: } duke@435: duke@435: void nmethod::flush() { duke@435: // Note that there are no valid oops in the nmethod anymore. duke@435: assert(is_zombie() || (is_osr_method() && is_unloaded()), "must be a zombie method"); duke@435: assert(is_marked_for_reclamation() || (is_osr_method() && is_unloaded()), "must be marked for reclamation"); duke@435: duke@435: assert (!is_locked_by_vm(), "locked methods shouldn't be flushed"); never@1893: assert_locked_or_safepoint(CodeCache_lock); duke@435: duke@435: // completely deallocate this method never@3499: Events::log(JavaThread::current(), "flushing nmethod " INTPTR_FORMAT, this); duke@435: if (PrintMethodFlushing) { kvn@1637: tty->print_cr("*flushing nmethod %3d/" INTPTR_FORMAT ". Live blobs:" UINT32_FORMAT "/Free CodeCache:" SIZE_FORMAT "Kb", kvn@1637: _compile_id, this, CodeCache::nof_blobs(), CodeCache::unallocated_capacity()/1024); duke@435: } duke@435: duke@435: // We need to deallocate any ExceptionCache data. duke@435: // Note that we do not need to grab the nmethod lock for this, it duke@435: // better be thread safe if we're disposing of it! duke@435: ExceptionCache* ec = exception_cache(); duke@435: set_exception_cache(NULL); duke@435: while(ec != NULL) { duke@435: ExceptionCache* next = ec->next(); duke@435: delete ec; duke@435: ec = next; duke@435: } duke@435: jrose@1424: if (on_scavenge_root_list()) { jrose@1424: CodeCache::drop_scavenge_root_nmethod(this); jrose@1424: } jrose@1424: kvn@1637: if (is_speculatively_disconnected()) { kvn@1637: CodeCache::remove_saved_code(this); kvn@1637: } kvn@1637: twisti@2047: #ifdef SHARK twisti@2200: ((SharkCompiler *) compiler())->free_compiled_method(insts_begin()); twisti@2047: #endif // SHARK twisti@2047: duke@435: ((CodeBlob*)(this))->flush(); duke@435: duke@435: CodeCache::free(this); duke@435: } duke@435: duke@435: duke@435: // duke@435: // Notify all classes this nmethod is dependent on that it is no duke@435: // longer dependent. This should only be called in two situations. duke@435: // First, when a nmethod transitions to a zombie all dependents need duke@435: // to be clear. Since zombification happens at a safepoint there's no duke@435: // synchronization issues. The second place is a little more tricky. duke@435: // During phase 1 of mark sweep class unloading may happen and as a duke@435: // result some nmethods may get unloaded. In this case the flushing duke@435: // of dependencies must happen during phase 1 since after GC any duke@435: // dependencies in the unloaded nmethod won't be updated, so duke@435: // traversing the dependency information in unsafe. In that case this duke@435: // function is called with a non-NULL argument and this function only duke@435: // notifies instanceKlasses that are reachable duke@435: duke@435: void nmethod::flush_dependencies(BoolObjectClosure* is_alive) { never@1893: assert_locked_or_safepoint(CodeCache_lock); duke@435: assert(Universe::heap()->is_gc_active() == (is_alive != NULL), duke@435: "is_alive is non-NULL if and only if we are called during GC"); duke@435: if (!has_flushed_dependencies()) { duke@435: set_has_flushed_dependencies(); duke@435: for (Dependencies::DepStream deps(this); deps.next(); ) { coleenp@4037: Klass* klass = deps.context_type(); duke@435: if (klass == NULL) continue; // ignore things like evol_method duke@435: duke@435: // During GC the is_alive closure is non-NULL, and is used to duke@435: // determine liveness of dependees that need to be updated. coleenp@4037: if (is_alive == NULL || klass->is_loader_alive(is_alive)) { coleenp@4037: InstanceKlass::cast(klass)->remove_dependent_nmethod(this); duke@435: } duke@435: } duke@435: } duke@435: } duke@435: duke@435: duke@435: // If this oop is not live, the nmethod can be unloaded. brutisso@4098: bool nmethod::can_unload(BoolObjectClosure* is_alive, oop* root, bool unloading_occurred) { duke@435: assert(root != NULL, "just checking"); duke@435: oop obj = *root; duke@435: if (obj == NULL || is_alive->do_object_b(obj)) { duke@435: return false; duke@435: } coleenp@4037: jrose@1424: // If ScavengeRootsInCode is true, an nmethod might be unloaded jrose@1424: // simply because one of its constant oops has gone dead. jrose@1424: // No actual classes need to be unloaded in order for this to occur. jrose@1424: assert(unloading_occurred || ScavengeRootsInCode, "Inconsistency in unloading"); duke@435: make_unloaded(is_alive, obj); duke@435: return true; duke@435: } duke@435: duke@435: // ------------------------------------------------------------------ duke@435: // post_compiled_method_load_event duke@435: // new method for install_code() path duke@435: // Transfer information from compilation to jvmti duke@435: void nmethod::post_compiled_method_load_event() { duke@435: coleenp@4037: Method* moop = method(); dcubed@3202: #ifndef USDT2 duke@435: HS_DTRACE_PROBE8(hotspot, compiled__method__load, duke@435: moop->klass_name()->bytes(), duke@435: moop->klass_name()->utf8_length(), duke@435: moop->name()->bytes(), duke@435: moop->name()->utf8_length(), duke@435: moop->signature()->bytes(), duke@435: moop->signature()->utf8_length(), twisti@2103: insts_begin(), insts_size()); dcubed@3202: #else /* USDT2 */ dcubed@3202: HOTSPOT_COMPILED_METHOD_LOAD( dcubed@3202: (char *) moop->klass_name()->bytes(), dcubed@3202: moop->klass_name()->utf8_length(), dcubed@3202: (char *) moop->name()->bytes(), dcubed@3202: moop->name()->utf8_length(), dcubed@3202: (char *) moop->signature()->bytes(), dcubed@3202: moop->signature()->utf8_length(), dcubed@3202: insts_begin(), insts_size()); dcubed@3202: #endif /* USDT2 */ duke@435: never@1971: if (JvmtiExport::should_post_compiled_method_load() || never@1971: JvmtiExport::should_post_compiled_method_unload()) { never@1971: get_and_cache_jmethod_id(); never@1971: } never@1971: duke@435: if (JvmtiExport::should_post_compiled_method_load()) { kamg@2511: // Let the Service thread (which is a real Java thread) post the event kamg@2511: MutexLockerEx ml(Service_lock, Mutex::_no_safepoint_check_flag); kamg@2511: JvmtiDeferredEventQueue::enqueue( kamg@2511: JvmtiDeferredEvent::compiled_method_load_event(this)); duke@435: } duke@435: } duke@435: never@1971: jmethodID nmethod::get_and_cache_jmethod_id() { never@1971: if (_jmethod_id == NULL) { never@1971: // Cache the jmethod_id since it can no longer be looked up once the never@1971: // method itself has been marked for unloading. never@1971: _jmethod_id = method()->jmethod_id(); never@1971: } never@1971: return _jmethod_id; never@1971: } never@1971: duke@435: void nmethod::post_compiled_method_unload() { never@1932: if (unload_reported()) { never@1932: // During unloading we transition to unloaded and then to zombie never@1932: // and the unloading is reported during the first transition. never@1932: return; never@1932: } never@1932: duke@435: assert(_method != NULL && !is_unloaded(), "just checking"); duke@435: DTRACE_METHOD_UNLOAD_PROBE(method()); duke@435: duke@435: // If a JVMTI agent has enabled the CompiledMethodUnload event then never@1971: // post the event. Sometime later this nmethod will be made a zombie coleenp@4037: // by the sweeper but the Method* will not be valid at that point. never@1971: // If the _jmethod_id is null then no load event was ever requested never@1971: // so don't bother posting the unload. The main reason for this is coleenp@4037: // that the jmethodID is a weak reference to the Method* so if never@1971: // it's being unloaded there's no way to look it up since the weak never@1971: // ref will have been cleared. never@1971: if (_jmethod_id != NULL && JvmtiExport::should_post_compiled_method_unload()) { duke@435: assert(!unload_reported(), "already unloaded"); kamg@2511: JvmtiDeferredEvent event = dcubed@2624: JvmtiDeferredEvent::compiled_method_unload_event(this, kamg@2511: _jmethod_id, insts_begin()); kamg@2511: if (SafepointSynchronize::is_at_safepoint()) { kamg@2511: // Don't want to take the queueing lock. Add it as pending and kamg@2511: // it will get enqueued later. kamg@2511: JvmtiDeferredEventQueue::add_pending_event(event); kamg@2511: } else { kamg@2511: MutexLockerEx ml(Service_lock, Mutex::_no_safepoint_check_flag); kamg@2511: JvmtiDeferredEventQueue::enqueue(event); kamg@2511: } duke@435: } duke@435: duke@435: // The JVMTI CompiledMethodUnload event can be enabled or disabled at duke@435: // any time. As the nmethod is being unloaded now we mark it has duke@435: // having the unload event reported - this will ensure that we don't duke@435: // attempt to report the event in the unlikely scenario where the duke@435: // event is enabled at the time the nmethod is made a zombie. duke@435: set_unload_reported(); duke@435: } duke@435: duke@435: // This is called at the end of the strong tracing/marking phase of a duke@435: // GC to unload an nmethod if it contains otherwise unreachable duke@435: // oops. duke@435: brutisso@4098: void nmethod::do_unloading(BoolObjectClosure* is_alive, bool unloading_occurred) { duke@435: // Make sure the oop's ready to receive visitors duke@435: assert(!is_zombie() && !is_unloaded(), duke@435: "should not call follow on zombie or unloaded nmethod"); duke@435: duke@435: // If the method is not entrant then a JMP is plastered over the duke@435: // first few bytes. If an oop in the old code was there, that oop duke@435: // should not get GC'd. Skip the first few bytes of oops on duke@435: // not-entrant methods. duke@435: address low_boundary = verified_entry_point(); duke@435: if (is_not_entrant()) { duke@435: low_boundary += NativeJump::instruction_size; duke@435: // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump. duke@435: // (See comment above.) duke@435: } duke@435: duke@435: // The RedefineClasses() API can cause the class unloading invariant duke@435: // to no longer be true. See jvmtiExport.hpp for details. duke@435: // Also, leave a debugging breadcrumb in local flag. duke@435: bool a_class_was_redefined = JvmtiExport::has_redefined_a_class(); duke@435: if (a_class_was_redefined) { duke@435: // This set of the unloading_occurred flag is done before the duke@435: // call to post_compiled_method_unload() so that the unloading duke@435: // of this nmethod is reported. duke@435: unloading_occurred = true; duke@435: } duke@435: duke@435: // Exception cache duke@435: ExceptionCache* ec = exception_cache(); duke@435: while (ec != NULL) { coleenp@4037: Klass* ex_klass = ec->exception_type(); duke@435: ExceptionCache* next_ec = ec->next(); coleenp@4037: if (ex_klass != NULL && !ex_klass->is_loader_alive(is_alive)) { duke@435: remove_from_exception_cache(ec); duke@435: } duke@435: ec = next_ec; duke@435: } duke@435: duke@435: // If class unloading occurred we first iterate over all inline caches and duke@435: // clear ICs where the cached oop is referring to an unloaded klass or method. duke@435: // The remaining live cached oops will be traversed in the relocInfo::oop_type duke@435: // iteration below. duke@435: if (unloading_occurred) { duke@435: RelocIterator iter(this, low_boundary); duke@435: while(iter.next()) { duke@435: if (iter.type() == relocInfo::virtual_call_type) { duke@435: CompiledIC *ic = CompiledIC_at(iter.reloc()); coleenp@4037: if (ic->is_icholder_call()) { duke@435: // The only exception is compiledICHolder oops which may duke@435: // yet be marked below. (We check this further below). coleenp@4037: CompiledICHolder* cichk_oop = ic->cached_icholder(); coleenp@4037: if (cichk_oop->holder_method()->method_holder()->is_loader_alive(is_alive) && coleenp@4037: cichk_oop->holder_klass()->is_loader_alive(is_alive)) { duke@435: continue; duke@435: } coleenp@4037: } else { coleenp@4037: Metadata* ic_oop = ic->cached_metadata(); coleenp@4037: if (ic_oop != NULL) { coleenp@4037: if (ic_oop->is_klass()) { coleenp@4037: if (((Klass*)ic_oop)->is_loader_alive(is_alive)) { coleenp@4037: continue; coleenp@4037: } coleenp@4037: } else if (ic_oop->is_method()) { coleenp@4037: if (((Method*)ic_oop)->method_holder()->is_loader_alive(is_alive)) { coleenp@4037: continue; coleenp@4037: } coleenp@4037: } else { coleenp@4037: ShouldNotReachHere(); coleenp@4037: } coleenp@4037: } duke@435: } duke@435: ic->set_to_clean(); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // Compiled code coleenp@4037: { duke@435: RelocIterator iter(this, low_boundary); duke@435: while (iter.next()) { duke@435: if (iter.type() == relocInfo::oop_type) { duke@435: oop_Relocation* r = iter.oop_reloc(); duke@435: // In this loop, we must only traverse those oops directly embedded in duke@435: // the code. Other oops (oop_index>0) are seen as part of scopes_oops. duke@435: assert(1 == (r->oop_is_immediate()) + duke@435: (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()), duke@435: "oop must be found in exactly one place"); duke@435: if (r->oop_is_immediate() && r->oop_value() != NULL) { brutisso@4098: if (can_unload(is_alive, r->oop_addr(), unloading_occurred)) { duke@435: return; duke@435: } duke@435: } duke@435: } duke@435: } coleenp@4037: } duke@435: duke@435: duke@435: // Scopes duke@435: for (oop* p = oops_begin(); p < oops_end(); p++) { duke@435: if (*p == Universe::non_oop_word()) continue; // skip non-oops brutisso@4098: if (can_unload(is_alive, p, unloading_occurred)) { duke@435: return; duke@435: } duke@435: } duke@435: coleenp@4037: // Ensure that all metadata is still alive coleenp@4037: verify_metadata_loaders(low_boundary, is_alive); coleenp@4037: } coleenp@4037: coleenp@4037: #ifdef ASSERT coleenp@4037: coleenp@4037: class CheckClass : AllStatic { coleenp@4037: static BoolObjectClosure* _is_alive; coleenp@4037: coleenp@4037: // Check class_loader is alive for this bit of metadata. coleenp@4037: static void check_class(Metadata* md) { coleenp@4037: Klass* klass = NULL; coleenp@4037: if (md->is_klass()) { coleenp@4037: klass = ((Klass*)md); coleenp@4037: } else if (md->is_method()) { coleenp@4037: klass = ((Method*)md)->method_holder(); coleenp@4037: } else if (md->is_methodData()) { coleenp@4037: klass = ((MethodData*)md)->method()->method_holder(); coleenp@4037: } else { coleenp@4037: md->print(); coleenp@4037: ShouldNotReachHere(); coleenp@4037: } coleenp@4037: assert(klass->is_loader_alive(_is_alive), "must be alive"); coleenp@4037: } coleenp@4037: public: coleenp@4037: static void do_check_class(BoolObjectClosure* is_alive, nmethod* nm) { coleenp@4037: assert(SafepointSynchronize::is_at_safepoint(), "this is only ok at safepoint"); coleenp@4037: _is_alive = is_alive; coleenp@4037: nm->metadata_do(check_class); coleenp@4037: } coleenp@4037: }; coleenp@4037: coleenp@4037: // This is called during a safepoint so can use static data coleenp@4037: BoolObjectClosure* CheckClass::_is_alive = NULL; coleenp@4037: #endif // ASSERT coleenp@4037: coleenp@4037: coleenp@4037: // Processing of oop references should have been sufficient to keep coleenp@4037: // all strong references alive. Any weak references should have been coleenp@4037: // cleared as well. Visit all the metadata and ensure that it's coleenp@4037: // really alive. coleenp@4037: void nmethod::verify_metadata_loaders(address low_boundary, BoolObjectClosure* is_alive) { coleenp@4037: #ifdef ASSERT duke@435: RelocIterator iter(this, low_boundary); duke@435: while (iter.next()) { coleenp@4037: // static_stub_Relocations may have dangling references to coleenp@4037: // Method*s so trim them out here. Otherwise it looks like coleenp@4037: // compiled code is maintaining a link to dead metadata. coleenp@4037: address static_call_addr = NULL; coleenp@4037: if (iter.type() == relocInfo::opt_virtual_call_type) { coleenp@4037: CompiledIC* cic = CompiledIC_at(iter.reloc()); coleenp@4037: if (!cic->is_call_to_interpreted()) { coleenp@4037: static_call_addr = iter.addr(); coleenp@4037: } coleenp@4037: } else if (iter.type() == relocInfo::static_call_type) { coleenp@4037: CompiledStaticCall* csc = compiledStaticCall_at(iter.reloc()); coleenp@4037: if (!csc->is_call_to_interpreted()) { coleenp@4037: static_call_addr = iter.addr(); coleenp@4037: } coleenp@4037: } coleenp@4037: if (static_call_addr != NULL) { coleenp@4037: RelocIterator sciter(this, low_boundary); coleenp@4037: while (sciter.next()) { coleenp@4037: if (sciter.type() == relocInfo::static_stub_type && coleenp@4037: sciter.static_stub_reloc()->static_call() == static_call_addr) { coleenp@4037: sciter.static_stub_reloc()->clear_inline_cache(); coleenp@4037: } coleenp@4037: } duke@435: } duke@435: } coleenp@4037: // Check that the metadata embedded in the nmethod is alive coleenp@4037: CheckClass::do_check_class(is_alive, this); coleenp@4037: #endif duke@435: } duke@435: coleenp@4037: coleenp@4037: // Iterate over metadata calling this function. Used by RedefineClasses coleenp@4037: void nmethod::metadata_do(void f(Metadata*)) { coleenp@4037: address low_boundary = verified_entry_point(); coleenp@4037: if (is_not_entrant()) { coleenp@4037: low_boundary += NativeJump::instruction_size; coleenp@4037: // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump. coleenp@4037: // (See comment above.) coleenp@4037: } coleenp@4037: { coleenp@4037: // Visit all immediate references that are embedded in the instruction stream. coleenp@4037: RelocIterator iter(this, low_boundary); coleenp@4037: while (iter.next()) { coleenp@4037: if (iter.type() == relocInfo::metadata_type ) { coleenp@4037: metadata_Relocation* r = iter.metadata_reloc(); coleenp@4037: // In this lmetadata, we must only follow those metadatas directly embedded in coleenp@4037: // the code. Other metadatas (oop_index>0) are seen as part of coleenp@4037: // the metadata section below. coleenp@4037: assert(1 == (r->metadata_is_immediate()) + coleenp@4037: (r->metadata_addr() >= metadata_begin() && r->metadata_addr() < metadata_end()), coleenp@4037: "metadata must be found in exactly one place"); coleenp@4037: if (r->metadata_is_immediate() && r->metadata_value() != NULL) { coleenp@4037: Metadata* md = r->metadata_value(); coleenp@4037: f(md); coleenp@4037: } coleenp@5085: } else if (iter.type() == relocInfo::virtual_call_type) { coleenp@5085: // Check compiledIC holders associated with this nmethod coleenp@5085: CompiledIC *ic = CompiledIC_at(iter.reloc()); coleenp@5085: if (ic->is_icholder_call()) { coleenp@5085: CompiledICHolder* cichk = ic->cached_icholder(); coleenp@5085: f(cichk->holder_method()); coleenp@5085: f(cichk->holder_klass()); coleenp@5085: } else { coleenp@5085: Metadata* ic_oop = ic->cached_metadata(); coleenp@5085: if (ic_oop != NULL) { coleenp@5085: f(ic_oop); coleenp@5085: } coleenp@5085: } coleenp@4037: } coleenp@4037: } coleenp@4037: } coleenp@4037: coleenp@4037: // Visit the metadata section coleenp@4037: for (Metadata** p = metadata_begin(); p < metadata_end(); p++) { coleenp@4037: if (*p == Universe::non_oop_word() || *p == NULL) continue; // skip non-oops coleenp@4037: Metadata* md = *p; coleenp@4037: f(md); coleenp@4037: } coleenp@5085: coleenp@4037: // Call function Method*, not embedded in these other places. coleenp@4037: if (_method != NULL) f(_method); coleenp@4037: } coleenp@4037: johnc@5548: void nmethod::oops_do(OopClosure* f, bool allow_zombie) { duke@435: // make sure the oops ready to receive visitors johnc@5548: assert(allow_zombie || !is_zombie(), "should not call follow on zombie nmethod"); johnc@5548: assert(!is_unloaded(), "should not call follow on unloaded nmethod"); duke@435: duke@435: // If the method is not entrant or zombie then a JMP is plastered over the duke@435: // first few bytes. If an oop in the old code was there, that oop duke@435: // should not get GC'd. Skip the first few bytes of oops on duke@435: // not-entrant methods. duke@435: address low_boundary = verified_entry_point(); duke@435: if (is_not_entrant()) { duke@435: low_boundary += NativeJump::instruction_size; duke@435: // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump. duke@435: // (See comment above.) duke@435: } duke@435: duke@435: RelocIterator iter(this, low_boundary); ysr@1376: duke@435: while (iter.next()) { duke@435: if (iter.type() == relocInfo::oop_type ) { duke@435: oop_Relocation* r = iter.oop_reloc(); duke@435: // In this loop, we must only follow those oops directly embedded in duke@435: // the code. Other oops (oop_index>0) are seen as part of scopes_oops. ysr@1376: assert(1 == (r->oop_is_immediate()) + ysr@1376: (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()), ysr@1376: "oop must be found in exactly one place"); duke@435: if (r->oop_is_immediate() && r->oop_value() != NULL) { duke@435: f->do_oop(r->oop_addr()); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // Scopes jrose@1424: // This includes oop constants not inlined in the code stream. duke@435: for (oop* p = oops_begin(); p < oops_end(); p++) { duke@435: if (*p == Universe::non_oop_word()) continue; // skip non-oops duke@435: f->do_oop(p); duke@435: } duke@435: } duke@435: jrose@1424: #define NMETHOD_SENTINEL ((nmethod*)badAddress) jrose@1424: jrose@1424: nmethod* volatile nmethod::_oops_do_mark_nmethods; jrose@1424: jrose@1424: // An nmethod is "marked" if its _mark_link is set non-null. jrose@1424: // Even if it is the end of the linked list, it will have a non-null link value, jrose@1424: // as long as it is on the list. jrose@1424: // This code must be MP safe, because it is used from parallel GC passes. jrose@1424: bool nmethod::test_set_oops_do_mark() { jrose@1424: assert(nmethod::oops_do_marking_is_active(), "oops_do_marking_prologue must be called"); jrose@1424: nmethod* observed_mark_link = _oops_do_mark_link; jrose@1424: if (observed_mark_link == NULL) { jrose@1424: // Claim this nmethod for this thread to mark. jrose@1424: observed_mark_link = (nmethod*) jrose@1424: Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_link, NULL); jrose@1424: if (observed_mark_link == NULL) { jrose@1424: jrose@1424: // Atomically append this nmethod (now claimed) to the head of the list: jrose@1424: nmethod* observed_mark_nmethods = _oops_do_mark_nmethods; jrose@1424: for (;;) { jrose@1424: nmethod* required_mark_nmethods = observed_mark_nmethods; jrose@1424: _oops_do_mark_link = required_mark_nmethods; jrose@1424: observed_mark_nmethods = (nmethod*) jrose@1424: Atomic::cmpxchg_ptr(this, &_oops_do_mark_nmethods, required_mark_nmethods); jrose@1424: if (observed_mark_nmethods == required_mark_nmethods) jrose@1424: break; jrose@1424: } jrose@1424: // Mark was clear when we first saw this guy. twisti@2687: NOT_PRODUCT(if (TraceScavenge) print_on(tty, "oops_do, mark")); jrose@1424: return false; jrose@1424: } jrose@1424: } jrose@1424: // On fall through, another racing thread marked this nmethod before we did. jrose@1424: return true; jrose@1424: } jrose@1424: jrose@1424: void nmethod::oops_do_marking_prologue() { jrose@1424: NOT_PRODUCT(if (TraceScavenge) tty->print_cr("[oops_do_marking_prologue")); jrose@1424: assert(_oops_do_mark_nmethods == NULL, "must not call oops_do_marking_prologue twice in a row"); jrose@1424: // We use cmpxchg_ptr instead of regular assignment here because the user jrose@1424: // may fork a bunch of threads, and we need them all to see the same state. jrose@1424: void* observed = Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_nmethods, NULL); jrose@1424: guarantee(observed == NULL, "no races in this sequential code"); jrose@1424: } jrose@1424: jrose@1424: void nmethod::oops_do_marking_epilogue() { jrose@1424: assert(_oops_do_mark_nmethods != NULL, "must not call oops_do_marking_epilogue twice in a row"); jrose@1424: nmethod* cur = _oops_do_mark_nmethods; jrose@1424: while (cur != NMETHOD_SENTINEL) { jrose@1424: assert(cur != NULL, "not NULL-terminated"); jrose@1424: nmethod* next = cur->_oops_do_mark_link; jrose@1424: cur->_oops_do_mark_link = NULL; never@2657: cur->fix_oop_relocations(); twisti@2687: NOT_PRODUCT(if (TraceScavenge) cur->print_on(tty, "oops_do, unmark")); jrose@1424: cur = next; jrose@1424: } jrose@1424: void* required = _oops_do_mark_nmethods; jrose@1424: void* observed = Atomic::cmpxchg_ptr(NULL, &_oops_do_mark_nmethods, required); jrose@1424: guarantee(observed == required, "no races in this sequential code"); jrose@1424: NOT_PRODUCT(if (TraceScavenge) tty->print_cr("oops_do_marking_epilogue]")); jrose@1424: } jrose@1424: jrose@1424: class DetectScavengeRoot: public OopClosure { jrose@1424: bool _detected_scavenge_root; jrose@1424: public: jrose@1424: DetectScavengeRoot() : _detected_scavenge_root(false) jrose@1424: { NOT_PRODUCT(_print_nm = NULL); } jrose@1424: bool detected_scavenge_root() { return _detected_scavenge_root; } jrose@1424: virtual void do_oop(oop* p) { jrose@1424: if ((*p) != NULL && (*p)->is_scavengable()) { jrose@1424: NOT_PRODUCT(maybe_print(p)); jrose@1424: _detected_scavenge_root = true; jrose@1424: } jrose@1424: } jrose@1424: virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); } jrose@1424: jrose@1424: #ifndef PRODUCT jrose@1424: nmethod* _print_nm; jrose@1424: void maybe_print(oop* p) { jrose@1424: if (_print_nm == NULL) return; jrose@1424: if (!_detected_scavenge_root) _print_nm->print_on(tty, "new scavenge root"); jmasa@2909: tty->print_cr(""PTR_FORMAT"[offset=%d] detected scavengable oop "PTR_FORMAT" (found at "PTR_FORMAT")", jrose@1424: _print_nm, (int)((intptr_t)p - (intptr_t)_print_nm), hseigel@5784: (void *)(*p), (intptr_t)p); jrose@1424: (*p)->print(); jrose@1424: } jrose@1424: #endif //PRODUCT jrose@1424: }; jrose@1424: jrose@1424: bool nmethod::detect_scavenge_root_oops() { jrose@1424: DetectScavengeRoot detect_scavenge_root; jrose@1424: NOT_PRODUCT(if (TraceScavenge) detect_scavenge_root._print_nm = this); jrose@1424: oops_do(&detect_scavenge_root); jrose@1424: return detect_scavenge_root.detected_scavenge_root(); jrose@1424: } jrose@1424: duke@435: // Method that knows how to preserve outgoing arguments at call. This method must be duke@435: // called with a frame corresponding to a Java invoke duke@435: void nmethod::preserve_callee_argument_oops(frame fr, const RegisterMap *reg_map, OopClosure* f) { twisti@2047: #ifndef SHARK duke@435: if (!method()->is_native()) { duke@435: SimpleScopeDesc ssd(this, fr.pc()); never@2462: Bytecode_invoke call(ssd.method(), ssd.bci()); roland@5222: bool has_receiver = call.has_receiver(); roland@5222: bool has_appendix = call.has_appendix(); coleenp@2497: Symbol* signature = call.signature(); roland@5222: fr.oops_compiled_arguments_do(signature, has_receiver, has_appendix, reg_map, f); duke@435: } twisti@2047: #endif // !SHARK duke@435: } duke@435: duke@435: duke@435: oop nmethod::embeddedOop_at(u_char* p) { never@2631: RelocIterator iter(this, p, p + 1); duke@435: while (iter.next()) duke@435: if (iter.type() == relocInfo::oop_type) { duke@435: return iter.oop_reloc()->oop_value(); duke@435: } duke@435: return NULL; duke@435: } duke@435: duke@435: duke@435: inline bool includes(void* p, void* from, void* to) { duke@435: return from <= p && p < to; duke@435: } duke@435: duke@435: duke@435: void nmethod::copy_scopes_pcs(PcDesc* pcs, int count) { duke@435: assert(count >= 2, "must be sentinel values, at least"); duke@435: duke@435: #ifdef ASSERT duke@435: // must be sorted and unique; we do a binary search in find_pc_desc() duke@435: int prev_offset = pcs[0].pc_offset(); duke@435: assert(prev_offset == PcDesc::lower_offset_limit, duke@435: "must start with a sentinel"); duke@435: for (int i = 1; i < count; i++) { duke@435: int this_offset = pcs[i].pc_offset(); duke@435: assert(this_offset > prev_offset, "offsets must be sorted"); duke@435: prev_offset = this_offset; duke@435: } duke@435: assert(prev_offset == PcDesc::upper_offset_limit, duke@435: "must end with a sentinel"); duke@435: #endif //ASSERT duke@435: twisti@1570: // Search for MethodHandle invokes and tag the nmethod. twisti@1570: for (int i = 0; i < count; i++) { twisti@1570: if (pcs[i].is_method_handle_invoke()) { twisti@1570: set_has_method_handle_invokes(true); twisti@1570: break; twisti@1570: } twisti@1570: } twisti@2406: assert(has_method_handle_invokes() == (_deoptimize_mh_offset != -1), "must have deopt mh handler"); twisti@1570: duke@435: int size = count * sizeof(PcDesc); duke@435: assert(scopes_pcs_size() >= size, "oob"); duke@435: memcpy(scopes_pcs_begin(), pcs, size); duke@435: duke@435: // Adjust the final sentinel downward. duke@435: PcDesc* last_pc = &scopes_pcs_begin()[count-1]; duke@435: assert(last_pc->pc_offset() == PcDesc::upper_offset_limit, "sanity"); twisti@2103: last_pc->set_pc_offset(content_size() + 1); duke@435: for (; last_pc + 1 < scopes_pcs_end(); last_pc += 1) { duke@435: // Fill any rounding gaps with copies of the last record. duke@435: last_pc[1] = last_pc[0]; duke@435: } duke@435: // The following assert could fail if sizeof(PcDesc) is not duke@435: // an integral multiple of oopSize (the rounding term). duke@435: // If it fails, change the logic to always allocate a multiple duke@435: // of sizeof(PcDesc), and fill unused words with copies of *last_pc. duke@435: assert(last_pc + 1 == scopes_pcs_end(), "must match exactly"); duke@435: } duke@435: duke@435: void nmethod::copy_scopes_data(u_char* buffer, int size) { duke@435: assert(scopes_data_size() >= size, "oob"); duke@435: memcpy(scopes_data_begin(), buffer, size); duke@435: } duke@435: duke@435: duke@435: #ifdef ASSERT duke@435: static PcDesc* linear_search(nmethod* nm, int pc_offset, bool approximate) { duke@435: PcDesc* lower = nm->scopes_pcs_begin(); duke@435: PcDesc* upper = nm->scopes_pcs_end(); duke@435: lower += 1; // exclude initial sentinel duke@435: PcDesc* res = NULL; duke@435: for (PcDesc* p = lower; p < upper; p++) { duke@435: NOT_PRODUCT(--nmethod_stats.pc_desc_tests); // don't count this call to match_desc duke@435: if (match_desc(p, pc_offset, approximate)) { duke@435: if (res == NULL) duke@435: res = p; duke@435: else duke@435: res = (PcDesc*) badAddress; duke@435: } duke@435: } duke@435: return res; duke@435: } duke@435: #endif duke@435: duke@435: duke@435: // Finds a PcDesc with real-pc equal to "pc" duke@435: PcDesc* nmethod::find_pc_desc_internal(address pc, bool approximate) { twisti@2103: address base_address = code_begin(); duke@435: if ((pc < base_address) || duke@435: (pc - base_address) >= (ptrdiff_t) PcDesc::upper_offset_limit) { duke@435: return NULL; // PC is wildly out of range duke@435: } duke@435: int pc_offset = (int) (pc - base_address); duke@435: duke@435: // Check the PcDesc cache if it contains the desired PcDesc duke@435: // (This as an almost 100% hit rate.) duke@435: PcDesc* res = _pc_desc_cache.find_pc_desc(pc_offset, approximate); duke@435: if (res != NULL) { duke@435: assert(res == linear_search(this, pc_offset, approximate), "cache ok"); duke@435: return res; duke@435: } duke@435: duke@435: // Fallback algorithm: quasi-linear search for the PcDesc duke@435: // Find the last pc_offset less than the given offset. duke@435: // The successor must be the required match, if there is a match at all. duke@435: // (Use a fixed radix to avoid expensive affine pointer arithmetic.) duke@435: PcDesc* lower = scopes_pcs_begin(); duke@435: PcDesc* upper = scopes_pcs_end(); duke@435: upper -= 1; // exclude final sentinel duke@435: if (lower >= upper) return NULL; // native method; no PcDescs at all duke@435: duke@435: #define assert_LU_OK \ duke@435: /* invariant on lower..upper during the following search: */ \ duke@435: assert(lower->pc_offset() < pc_offset, "sanity"); \ duke@435: assert(upper->pc_offset() >= pc_offset, "sanity") duke@435: assert_LU_OK; duke@435: duke@435: // Use the last successful return as a split point. duke@435: PcDesc* mid = _pc_desc_cache.last_pc_desc(); duke@435: NOT_PRODUCT(++nmethod_stats.pc_desc_searches); duke@435: if (mid->pc_offset() < pc_offset) { duke@435: lower = mid; duke@435: } else { duke@435: upper = mid; duke@435: } duke@435: duke@435: // Take giant steps at first (4096, then 256, then 16, then 1) duke@435: const int LOG2_RADIX = 4 /*smaller steps in debug mode:*/ debug_only(-1); duke@435: const int RADIX = (1 << LOG2_RADIX); duke@435: for (int step = (1 << (LOG2_RADIX*3)); step > 1; step >>= LOG2_RADIX) { duke@435: while ((mid = lower + step) < upper) { duke@435: assert_LU_OK; duke@435: NOT_PRODUCT(++nmethod_stats.pc_desc_searches); duke@435: if (mid->pc_offset() < pc_offset) { duke@435: lower = mid; duke@435: } else { duke@435: upper = mid; duke@435: break; duke@435: } duke@435: } duke@435: assert_LU_OK; duke@435: } duke@435: duke@435: // Sneak up on the value with a linear search of length ~16. duke@435: while (true) { duke@435: assert_LU_OK; duke@435: mid = lower + 1; duke@435: NOT_PRODUCT(++nmethod_stats.pc_desc_searches); duke@435: if (mid->pc_offset() < pc_offset) { duke@435: lower = mid; duke@435: } else { duke@435: upper = mid; duke@435: break; duke@435: } duke@435: } duke@435: #undef assert_LU_OK duke@435: duke@435: if (match_desc(upper, pc_offset, approximate)) { duke@435: assert(upper == linear_search(this, pc_offset, approximate), "search ok"); duke@435: _pc_desc_cache.add_pc_desc(upper); duke@435: return upper; duke@435: } else { duke@435: assert(NULL == linear_search(this, pc_offset, approximate), "search ok"); duke@435: return NULL; duke@435: } duke@435: } duke@435: duke@435: duke@435: bool nmethod::check_all_dependencies() { duke@435: bool found_check = false; duke@435: // wholesale check of all dependencies duke@435: for (Dependencies::DepStream deps(this); deps.next(); ) { duke@435: if (deps.check_dependency() != NULL) { duke@435: found_check = true; duke@435: NOT_DEBUG(break); duke@435: } duke@435: } duke@435: return found_check; // tell caller if we found anything duke@435: } duke@435: duke@435: bool nmethod::check_dependency_on(DepChange& changes) { duke@435: // What has happened: duke@435: // 1) a new class dependee has been added duke@435: // 2) dependee and all its super classes have been marked duke@435: bool found_check = false; // set true if we are upset duke@435: for (Dependencies::DepStream deps(this); deps.next(); ) { duke@435: // Evaluate only relevant dependencies. duke@435: if (deps.spot_check_dependency_at(changes) != NULL) { duke@435: found_check = true; duke@435: NOT_DEBUG(break); duke@435: } duke@435: } duke@435: return found_check; duke@435: } duke@435: coleenp@4037: bool nmethod::is_evol_dependent_on(Klass* dependee) { coleenp@4037: InstanceKlass *dependee_ik = InstanceKlass::cast(dependee); coleenp@4037: Array* dependee_methods = dependee_ik->methods(); duke@435: for (Dependencies::DepStream deps(this); deps.next(); ) { duke@435: if (deps.type() == Dependencies::evol_method) { coleenp@4037: Method* method = deps.method_argument(0); duke@435: for (int j = 0; j < dependee_methods->length(); j++) { coleenp@4037: if (dependee_methods->at(j) == method) { duke@435: // RC_TRACE macro has an embedded ResourceMark duke@435: RC_TRACE(0x01000000, duke@435: ("Found evol dependency of nmethod %s.%s(%s) compile_id=%d on method %s.%s(%s)", coleenp@4037: _method->method_holder()->external_name(), duke@435: _method->name()->as_C_string(), duke@435: _method->signature()->as_C_string(), compile_id(), coleenp@4037: method->method_holder()->external_name(), duke@435: method->name()->as_C_string(), duke@435: method->signature()->as_C_string())); duke@435: if (TraceDependencies || LogCompilation) duke@435: deps.log_dependency(dependee); duke@435: return true; duke@435: } duke@435: } duke@435: } duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: // Called from mark_for_deoptimization, when dependee is invalidated. coleenp@4037: bool nmethod::is_dependent_on_method(Method* dependee) { duke@435: for (Dependencies::DepStream deps(this); deps.next(); ) { duke@435: if (deps.type() != Dependencies::evol_method) duke@435: continue; coleenp@4037: Method* method = deps.method_argument(0); duke@435: if (method == dependee) return true; duke@435: } duke@435: return false; duke@435: } duke@435: duke@435: duke@435: bool nmethod::is_patchable_at(address instr_addr) { twisti@2103: assert(insts_contains(instr_addr), "wrong nmethod used"); duke@435: if (is_zombie()) { duke@435: // a zombie may never be patched duke@435: return false; duke@435: } duke@435: return true; duke@435: } duke@435: duke@435: duke@435: address nmethod::continuation_for_implicit_exception(address pc) { duke@435: // Exception happened outside inline-cache check code => we are inside duke@435: // an active nmethod => use cpc to determine a return address twisti@2103: int exception_offset = pc - code_begin(); duke@435: int cont_offset = ImplicitExceptionTable(this).at( exception_offset ); duke@435: #ifdef ASSERT duke@435: if (cont_offset == 0) { duke@435: Thread* thread = ThreadLocalStorage::get_thread_slow(); duke@435: ResetNoHandleMark rnm; // Might be called from LEAF/QUICK ENTRY duke@435: HandleMark hm(thread); duke@435: ResourceMark rm(thread); duke@435: CodeBlob* cb = CodeCache::find_blob(pc); duke@435: assert(cb != NULL && cb == this, ""); duke@435: tty->print_cr("implicit exception happened at " INTPTR_FORMAT, pc); duke@435: print(); duke@435: method()->print_codes(); duke@435: print_code(); duke@435: print_pcs(); duke@435: } duke@435: #endif never@1685: if (cont_offset == 0) { never@1685: // Let the normal error handling report the exception never@1685: return NULL; never@1685: } twisti@2103: return code_begin() + cont_offset; duke@435: } duke@435: duke@435: duke@435: duke@435: void nmethod_init() { duke@435: // make sure you didn't forget to adjust the filler fields duke@435: assert(sizeof(nmethod) % oopSize == 0, "nmethod size must be multiple of a word"); duke@435: } duke@435: duke@435: duke@435: //------------------------------------------------------------------------------------------- duke@435: duke@435: duke@435: // QQQ might we make this work from a frame?? duke@435: nmethodLocker::nmethodLocker(address pc) { duke@435: CodeBlob* cb = CodeCache::find_blob(pc); duke@435: guarantee(cb != NULL && cb->is_nmethod(), "bad pc for a nmethod found"); duke@435: _nm = (nmethod*)cb; duke@435: lock_nmethod(_nm); duke@435: } duke@435: dcubed@2624: // Only JvmtiDeferredEvent::compiled_method_unload_event() dcubed@2624: // should pass zombie_ok == true. dcubed@2624: void nmethodLocker::lock_nmethod(nmethod* nm, bool zombie_ok) { duke@435: if (nm == NULL) return; duke@435: Atomic::inc(&nm->_lock_count); dcubed@2624: guarantee(zombie_ok || !nm->is_zombie(), "cannot lock a zombie method"); duke@435: } duke@435: duke@435: void nmethodLocker::unlock_nmethod(nmethod* nm) { duke@435: if (nm == NULL) return; duke@435: Atomic::dec(&nm->_lock_count); duke@435: guarantee(nm->_lock_count >= 0, "unmatched nmethod lock/unlock"); duke@435: } duke@435: twisti@1639: twisti@1639: // ----------------------------------------------------------------------------- twisti@1639: // nmethod::get_deopt_original_pc twisti@1639: // twisti@1639: // Return the original PC for the given PC if: twisti@1639: // (a) the given PC belongs to a nmethod and twisti@1639: // (b) it is a deopt PC twisti@1639: address nmethod::get_deopt_original_pc(const frame* fr) { twisti@1639: if (fr->cb() == NULL) return NULL; twisti@1639: twisti@1639: nmethod* nm = fr->cb()->as_nmethod_or_null(); twisti@1639: if (nm != NULL && nm->is_deopt_pc(fr->pc())) twisti@1639: return nm->get_original_pc(fr); twisti@1639: twisti@1639: return NULL; duke@435: } duke@435: duke@435: duke@435: // ----------------------------------------------------------------------------- twisti@1570: // MethodHandle twisti@1570: twisti@1570: bool nmethod::is_method_handle_return(address return_pc) { twisti@1570: if (!has_method_handle_invokes()) return false; twisti@1570: PcDesc* pd = pc_desc_at(return_pc); twisti@1570: if (pd == NULL) twisti@1570: return false; twisti@1570: return pd->is_method_handle_invoke(); twisti@1570: } twisti@1570: twisti@1570: twisti@1570: // ----------------------------------------------------------------------------- duke@435: // Verification duke@435: jrose@1424: class VerifyOopsClosure: public OopClosure { jrose@1424: nmethod* _nm; jrose@1424: bool _ok; jrose@1424: public: jrose@1424: VerifyOopsClosure(nmethod* nm) : _nm(nm), _ok(true) { } jrose@1424: bool ok() { return _ok; } jrose@1424: virtual void do_oop(oop* p) { jrose@1424: if ((*p) == NULL || (*p)->is_oop()) return; jrose@1424: if (_ok) { jrose@1424: _nm->print_nmethod(true); jrose@1424: _ok = false; jrose@1424: } jrose@1424: tty->print_cr("*** non-oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)", hseigel@5784: (void *)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm)); jrose@1424: } jrose@1424: virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); } jrose@1424: }; jrose@1424: duke@435: void nmethod::verify() { duke@435: duke@435: // Hmm. OSR methods can be deopted but not marked as zombie or not_entrant duke@435: // seems odd. duke@435: duke@435: if( is_zombie() || is_not_entrant() ) duke@435: return; duke@435: duke@435: // Make sure all the entry points are correctly aligned for patching. duke@435: NativeJump::check_verified_entry_alignment(entry_point(), verified_entry_point()); duke@435: coleenp@4037: // assert(method()->is_oop(), "must be valid"); duke@435: duke@435: ResourceMark rm; duke@435: duke@435: if (!CodeCache::contains(this)) { jcoomes@1845: fatal(err_msg("nmethod at " INTPTR_FORMAT " not in zone", this)); duke@435: } duke@435: duke@435: if(is_native_method() ) duke@435: return; duke@435: duke@435: nmethod* nm = CodeCache::find_nmethod(verified_entry_point()); duke@435: if (nm != this) { jcoomes@1845: fatal(err_msg("findNMethod did not find this nmethod (" INTPTR_FORMAT ")", jcoomes@1845: this)); duke@435: } duke@435: duke@435: for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) { duke@435: if (! p->verify(this)) { duke@435: tty->print_cr("\t\tin nmethod at " INTPTR_FORMAT " (pcs)", this); duke@435: } duke@435: } duke@435: jrose@1424: VerifyOopsClosure voc(this); jrose@1424: oops_do(&voc); jrose@1424: assert(voc.ok(), "embedded oops must be OK"); jrose@1424: verify_scavenge_root_oops(); jrose@1424: duke@435: verify_scopes(); duke@435: } duke@435: duke@435: duke@435: void nmethod::verify_interrupt_point(address call_site) { duke@435: // This code does not work in release mode since duke@435: // owns_lock only is available in debug mode. duke@435: CompiledIC* ic = NULL; duke@435: Thread *cur = Thread::current(); duke@435: if (CompiledIC_lock->owner() == cur || duke@435: ((cur->is_VM_thread() || cur->is_ConcurrentGC_thread()) && duke@435: SafepointSynchronize::is_at_safepoint())) { coleenp@4037: ic = CompiledIC_at(this, call_site); duke@435: CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops()); duke@435: } else { duke@435: MutexLocker ml_verify (CompiledIC_lock); coleenp@4037: ic = CompiledIC_at(this, call_site); duke@435: } duke@435: PcDesc* pd = pc_desc_at(ic->end_of_call()); duke@435: assert(pd != NULL, "PcDesc must exist"); duke@435: for (ScopeDesc* sd = new ScopeDesc(this, pd->scope_decode_offset(), kvn@1688: pd->obj_decode_offset(), pd->should_reexecute(), kvn@1688: pd->return_oop()); duke@435: !sd->is_top(); sd = sd->sender()) { duke@435: sd->verify(); duke@435: } duke@435: } duke@435: duke@435: void nmethod::verify_scopes() { duke@435: if( !method() ) return; // Runtime stubs have no scope duke@435: if (method()->is_native()) return; // Ignore stub methods. duke@435: // iterate through all interrupt point duke@435: // and verify the debug information is valid. duke@435: RelocIterator iter((nmethod*)this); duke@435: while (iter.next()) { duke@435: address stub = NULL; duke@435: switch (iter.type()) { duke@435: case relocInfo::virtual_call_type: duke@435: verify_interrupt_point(iter.addr()); duke@435: break; duke@435: case relocInfo::opt_virtual_call_type: duke@435: stub = iter.opt_virtual_call_reloc()->static_stub(); duke@435: verify_interrupt_point(iter.addr()); duke@435: break; duke@435: case relocInfo::static_call_type: duke@435: stub = iter.static_call_reloc()->static_stub(); duke@435: //verify_interrupt_point(iter.addr()); duke@435: break; duke@435: case relocInfo::runtime_call_type: duke@435: address destination = iter.reloc()->value(); duke@435: // Right now there is no way to find out which entries support duke@435: // an interrupt point. It would be nice if we had this duke@435: // information in a table. duke@435: break; duke@435: } duke@435: assert(stub == NULL || stub_contains(stub), "static call stub outside stub section"); duke@435: } duke@435: } duke@435: duke@435: duke@435: // ----------------------------------------------------------------------------- duke@435: // Non-product code duke@435: #ifndef PRODUCT duke@435: jrose@1424: class DebugScavengeRoot: public OopClosure { jrose@1424: nmethod* _nm; jrose@1424: bool _ok; jrose@1424: public: jrose@1424: DebugScavengeRoot(nmethod* nm) : _nm(nm), _ok(true) { } jrose@1424: bool ok() { return _ok; } jrose@1424: virtual void do_oop(oop* p) { jrose@1424: if ((*p) == NULL || !(*p)->is_scavengable()) return; jrose@1424: if (_ok) { jrose@1424: _nm->print_nmethod(true); jrose@1424: _ok = false; jrose@1424: } jmasa@2909: tty->print_cr("*** scavengable oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)", hseigel@5784: (void *)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm)); jrose@1424: (*p)->print(); jrose@1424: } jrose@1424: virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); } jrose@1424: }; duke@435: jrose@1424: void nmethod::verify_scavenge_root_oops() { jrose@1424: if (!on_scavenge_root_list()) { jrose@1424: // Actually look inside, to verify the claim that it's clean. jrose@1424: DebugScavengeRoot debug_scavenge_root(this); jrose@1424: oops_do(&debug_scavenge_root); jrose@1424: if (!debug_scavenge_root.ok()) jmasa@2909: fatal("found an unadvertised bad scavengable oop in the code cache"); duke@435: } jrose@1424: assert(scavenge_root_not_marked(), ""); duke@435: } duke@435: jrose@535: #endif // PRODUCT duke@435: duke@435: // Printing operations duke@435: duke@435: void nmethod::print() const { duke@435: ResourceMark rm; duke@435: ttyLocker ttyl; // keep the following output all in one block duke@435: twisti@2687: tty->print("Compiled method "); duke@435: duke@435: if (is_compiled_by_c1()) { duke@435: tty->print("(c1) "); duke@435: } else if (is_compiled_by_c2()) { duke@435: tty->print("(c2) "); twisti@2047: } else if (is_compiled_by_shark()) { twisti@2047: tty->print("(shark) "); duke@435: } else { duke@435: tty->print("(nm) "); duke@435: } duke@435: twisti@2687: print_on(tty, NULL); twisti@2687: duke@435: if (WizardMode) { duke@435: tty->print("((nmethod*) "INTPTR_FORMAT ") ", this); duke@435: tty->print(" for method " INTPTR_FORMAT , (address)method()); duke@435: tty->print(" { "); duke@435: if (is_in_use()) tty->print("in_use "); duke@435: if (is_not_entrant()) tty->print("not_entrant "); duke@435: if (is_zombie()) tty->print("zombie "); duke@435: if (is_unloaded()) tty->print("unloaded "); jrose@1424: if (on_scavenge_root_list()) tty->print("scavenge_root "); duke@435: tty->print_cr("}:"); duke@435: } duke@435: if (size () > 0) tty->print_cr(" total in heap [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", duke@435: (address)this, duke@435: (address)this + size(), duke@435: size()); duke@435: if (relocation_size () > 0) tty->print_cr(" relocation [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", duke@435: relocation_begin(), duke@435: relocation_end(), duke@435: relocation_size()); twisti@2117: if (consts_size () > 0) tty->print_cr(" constants [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", twisti@2117: consts_begin(), twisti@2117: consts_end(), twisti@2117: consts_size()); twisti@2103: if (insts_size () > 0) tty->print_cr(" main code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", twisti@2103: insts_begin(), twisti@2103: insts_end(), twisti@2103: insts_size()); duke@435: if (stub_size () > 0) tty->print_cr(" stub code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", duke@435: stub_begin(), duke@435: stub_end(), duke@435: stub_size()); twisti@1918: if (oops_size () > 0) tty->print_cr(" oops [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", twisti@1918: oops_begin(), twisti@1918: oops_end(), twisti@1918: oops_size()); coleenp@4037: if (metadata_size () > 0) tty->print_cr(" metadata [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", coleenp@4037: metadata_begin(), coleenp@4037: metadata_end(), coleenp@4037: metadata_size()); duke@435: if (scopes_data_size () > 0) tty->print_cr(" scopes data [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", duke@435: scopes_data_begin(), duke@435: scopes_data_end(), duke@435: scopes_data_size()); duke@435: if (scopes_pcs_size () > 0) tty->print_cr(" scopes pcs [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", duke@435: scopes_pcs_begin(), duke@435: scopes_pcs_end(), duke@435: scopes_pcs_size()); duke@435: if (dependencies_size () > 0) tty->print_cr(" dependencies [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", duke@435: dependencies_begin(), duke@435: dependencies_end(), duke@435: dependencies_size()); duke@435: if (handler_table_size() > 0) tty->print_cr(" handler table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", duke@435: handler_table_begin(), duke@435: handler_table_end(), duke@435: handler_table_size()); duke@435: if (nul_chk_table_size() > 0) tty->print_cr(" nul chk table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", duke@435: nul_chk_table_begin(), duke@435: nul_chk_table_end(), duke@435: nul_chk_table_size()); duke@435: } duke@435: jrose@535: void nmethod::print_code() { jrose@535: HandleMark hm; jrose@535: ResourceMark m; jrose@535: Disassembler::decode(this); jrose@535: } jrose@535: jrose@535: jrose@535: #ifndef PRODUCT duke@435: duke@435: void nmethod::print_scopes() { duke@435: // Find the first pc desc for all scopes in the code and print it. duke@435: ResourceMark rm; duke@435: for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) { duke@435: if (p->scope_decode_offset() == DebugInformationRecorder::serialized_null) duke@435: continue; duke@435: duke@435: ScopeDesc* sd = scope_desc_at(p->real_pc(this)); duke@435: sd->print_on(tty, p); duke@435: } duke@435: } duke@435: duke@435: void nmethod::print_dependencies() { duke@435: ResourceMark rm; duke@435: ttyLocker ttyl; // keep the following output all in one block duke@435: tty->print_cr("Dependencies:"); duke@435: for (Dependencies::DepStream deps(this); deps.next(); ) { duke@435: deps.print_dependency(); coleenp@4037: Klass* ctxk = deps.context_type(); duke@435: if (ctxk != NULL) { hseigel@4278: if (ctxk->oop_is_instance() && ((InstanceKlass*)ctxk)->is_dependent_nmethod(this)) { hseigel@4278: tty->print_cr(" [nmethod<=klass]%s", ctxk->external_name()); duke@435: } duke@435: } duke@435: deps.log_dependency(); // put it into the xml log also duke@435: } duke@435: } duke@435: duke@435: duke@435: void nmethod::print_relocations() { duke@435: ResourceMark m; // in case methods get printed via the debugger duke@435: tty->print_cr("relocations:"); duke@435: RelocIterator iter(this); duke@435: iter.print(); duke@435: if (UseRelocIndex) { duke@435: jint* index_end = (jint*)relocation_end() - 1; duke@435: jint index_size = *index_end; duke@435: jint* index_start = (jint*)( (address)index_end - index_size ); duke@435: tty->print_cr(" index @" INTPTR_FORMAT ": index_size=%d", index_start, index_size); duke@435: if (index_size > 0) { duke@435: jint* ip; duke@435: for (ip = index_start; ip+2 <= index_end; ip += 2) duke@435: tty->print_cr(" (%d %d) addr=" INTPTR_FORMAT " @" INTPTR_FORMAT, duke@435: ip[0], duke@435: ip[1], duke@435: header_end()+ip[0], duke@435: relocation_begin()-1+ip[1]); duke@435: for (; ip < index_end; ip++) duke@435: tty->print_cr(" (%d ?)", ip[0]); ccheung@5259: tty->print_cr(" @" INTPTR_FORMAT ": index_size=%d", ip, *ip); ccheung@5259: ip++; duke@435: tty->print_cr("reloc_end @" INTPTR_FORMAT ":", ip); duke@435: } duke@435: } duke@435: } duke@435: duke@435: duke@435: void nmethod::print_pcs() { duke@435: ResourceMark m; // in case methods get printed via debugger duke@435: tty->print_cr("pc-bytecode offsets:"); duke@435: for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) { duke@435: p->print(this); duke@435: } duke@435: } duke@435: jrose@535: #endif // PRODUCT duke@435: duke@435: const char* nmethod::reloc_string_for(u_char* begin, u_char* end) { duke@435: RelocIterator iter(this, begin, end); duke@435: bool have_one = false; duke@435: while (iter.next()) { duke@435: have_one = true; duke@435: switch (iter.type()) { duke@435: case relocInfo::none: return "no_reloc"; duke@435: case relocInfo::oop_type: { duke@435: stringStream st; duke@435: oop_Relocation* r = iter.oop_reloc(); duke@435: oop obj = r->oop_value(); duke@435: st.print("oop("); duke@435: if (obj == NULL) st.print("NULL"); duke@435: else obj->print_value_on(&st); duke@435: st.print(")"); duke@435: return st.as_string(); duke@435: } coleenp@4037: case relocInfo::metadata_type: { coleenp@4037: stringStream st; coleenp@4037: metadata_Relocation* r = iter.metadata_reloc(); coleenp@4037: Metadata* obj = r->metadata_value(); coleenp@4037: st.print("metadata("); coleenp@4037: if (obj == NULL) st.print("NULL"); coleenp@4037: else obj->print_value_on(&st); coleenp@4037: st.print(")"); coleenp@4037: return st.as_string(); coleenp@4037: } duke@435: case relocInfo::virtual_call_type: return "virtual_call"; duke@435: case relocInfo::opt_virtual_call_type: return "optimized virtual_call"; duke@435: case relocInfo::static_call_type: return "static_call"; duke@435: case relocInfo::static_stub_type: return "static_stub"; duke@435: case relocInfo::runtime_call_type: return "runtime_call"; duke@435: case relocInfo::external_word_type: return "external_word"; duke@435: case relocInfo::internal_word_type: return "internal_word"; duke@435: case relocInfo::section_word_type: return "section_word"; duke@435: case relocInfo::poll_type: return "poll"; duke@435: case relocInfo::poll_return_type: return "poll_return"; duke@435: case relocInfo::type_mask: return "type_bit_mask"; duke@435: } duke@435: } duke@435: return have_one ? "other" : NULL; duke@435: } duke@435: duke@435: // Return a the last scope in (begin..end] duke@435: ScopeDesc* nmethod::scope_desc_in(address begin, address end) { duke@435: PcDesc* p = pc_desc_near(begin+1); duke@435: if (p != NULL && p->real_pc(this) <= end) { duke@435: return new ScopeDesc(this, p->scope_decode_offset(), kvn@1688: p->obj_decode_offset(), p->should_reexecute(), kvn@1688: p->return_oop()); duke@435: } duke@435: return NULL; duke@435: } duke@435: kvn@4107: void nmethod::print_nmethod_labels(outputStream* stream, address block_begin) const { jrose@1590: if (block_begin == entry_point()) stream->print_cr("[Entry Point]"); jrose@1590: if (block_begin == verified_entry_point()) stream->print_cr("[Verified Entry Point]"); jrose@1590: if (block_begin == exception_begin()) stream->print_cr("[Exception Handler]"); jrose@1590: if (block_begin == stub_begin()) stream->print_cr("[Stub Code]"); twisti@1639: if (block_begin == deopt_handler_begin()) stream->print_cr("[Deopt Handler Code]"); twisti@2046: twisti@2046: if (has_method_handle_invokes()) twisti@2046: if (block_begin == deopt_mh_handler_begin()) stream->print_cr("[Deopt MH Handler Code]"); twisti@2046: jrose@1590: if (block_begin == consts_begin()) stream->print_cr("[Constants]"); twisti@2046: jrose@1590: if (block_begin == entry_point()) { jrose@1590: methodHandle m = method(); jrose@1590: if (m.not_null()) { jrose@1590: stream->print(" # "); jrose@1590: m->print_value_on(stream); jrose@1590: stream->cr(); jrose@1590: } jrose@1590: if (m.not_null() && !is_osr_method()) { jrose@1590: ResourceMark rm; jrose@1590: int sizeargs = m->size_of_parameters(); jrose@1590: BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, sizeargs); jrose@1590: VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, sizeargs); jrose@1590: { jrose@1590: int sig_index = 0; jrose@1590: if (!m->is_static()) jrose@1590: sig_bt[sig_index++] = T_OBJECT; // 'this' jrose@1590: for (SignatureStream ss(m->signature()); !ss.at_return_type(); ss.next()) { jrose@1590: BasicType t = ss.type(); jrose@1590: sig_bt[sig_index++] = t; jrose@1590: if (type2size[t] == 2) { jrose@1590: sig_bt[sig_index++] = T_VOID; jrose@1590: } else { jrose@1590: assert(type2size[t] == 1, "size is 1 or 2"); jrose@1590: } jrose@1590: } jrose@1590: assert(sig_index == sizeargs, ""); jrose@1590: } jrose@1590: const char* spname = "sp"; // make arch-specific? jrose@1590: intptr_t out_preserve = SharedRuntime::java_calling_convention(sig_bt, regs, sizeargs, false); jrose@1590: int stack_slot_offset = this->frame_size() * wordSize; jrose@1590: int tab1 = 14, tab2 = 24; jrose@1590: int sig_index = 0; jrose@1590: int arg_index = (m->is_static() ? 0 : -1); jrose@1590: bool did_old_sp = false; jrose@1590: for (SignatureStream ss(m->signature()); !ss.at_return_type(); ) { jrose@1590: bool at_this = (arg_index == -1); jrose@1590: bool at_old_sp = false; jrose@1590: BasicType t = (at_this ? T_OBJECT : ss.type()); jrose@1590: assert(t == sig_bt[sig_index], "sigs in sync"); jrose@1590: if (at_this) jrose@1590: stream->print(" # this: "); jrose@1590: else jrose@1590: stream->print(" # parm%d: ", arg_index); jrose@1590: stream->move_to(tab1); jrose@1590: VMReg fst = regs[sig_index].first(); jrose@1590: VMReg snd = regs[sig_index].second(); jrose@1590: if (fst->is_reg()) { jrose@1590: stream->print("%s", fst->name()); jrose@1590: if (snd->is_valid()) { jrose@1590: stream->print(":%s", snd->name()); jrose@1590: } jrose@1590: } else if (fst->is_stack()) { jrose@1590: int offset = fst->reg2stack() * VMRegImpl::stack_slot_size + stack_slot_offset; jrose@1590: if (offset == stack_slot_offset) at_old_sp = true; jrose@1590: stream->print("[%s+0x%x]", spname, offset); jrose@1590: } else { jrose@1590: stream->print("reg%d:%d??", (int)(intptr_t)fst, (int)(intptr_t)snd); jrose@1590: } jrose@1590: stream->print(" "); jrose@1590: stream->move_to(tab2); jrose@1590: stream->print("= "); jrose@1590: if (at_this) { jrose@1590: m->method_holder()->print_value_on(stream); jrose@1590: } else { jrose@1590: bool did_name = false; jrose@1590: if (!at_this && ss.is_object()) { coleenp@2497: Symbol* name = ss.as_symbol_or_null(); jrose@1590: if (name != NULL) { jrose@1590: name->print_value_on(stream); jrose@1590: did_name = true; jrose@1590: } jrose@1590: } jrose@1590: if (!did_name) jrose@1590: stream->print("%s", type2name(t)); jrose@1590: } jrose@1590: if (at_old_sp) { jrose@1590: stream->print(" (%s of caller)", spname); jrose@1590: did_old_sp = true; jrose@1590: } jrose@1590: stream->cr(); jrose@1590: sig_index += type2size[t]; jrose@1590: arg_index += 1; jrose@1590: if (!at_this) ss.next(); jrose@1590: } jrose@1590: if (!did_old_sp) { jrose@1590: stream->print(" # "); jrose@1590: stream->move_to(tab1); jrose@1590: stream->print("[%s+0x%x]", spname, stack_slot_offset); jrose@1590: stream->print(" (%s of caller)", spname); jrose@1590: stream->cr(); jrose@1590: } jrose@1590: } jrose@1590: } jrose@1590: } jrose@1590: duke@435: void nmethod::print_code_comment_on(outputStream* st, int column, u_char* begin, u_char* end) { duke@435: // First, find an oopmap in (begin, end]. duke@435: // We use the odd half-closed interval so that oop maps and scope descs duke@435: // which are tied to the byte after a call are printed with the call itself. twisti@2103: address base = code_begin(); duke@435: OopMapSet* oms = oop_maps(); duke@435: if (oms != NULL) { duke@435: for (int i = 0, imax = oms->size(); i < imax; i++) { duke@435: OopMap* om = oms->at(i); duke@435: address pc = base + om->offset(); duke@435: if (pc > begin) { duke@435: if (pc <= end) { jrose@535: st->move_to(column); jrose@535: st->print("; "); jrose@535: om->print_on(st); duke@435: } duke@435: break; duke@435: } duke@435: } duke@435: } jrose@535: jrose@535: // Print any debug info present at this pc. duke@435: ScopeDesc* sd = scope_desc_in(begin, end); duke@435: if (sd != NULL) { jrose@535: st->move_to(column); duke@435: if (sd->bci() == SynchronizationEntryBCI) { duke@435: st->print(";*synchronization entry"); duke@435: } else { coleenp@4037: if (sd->method() == NULL) { jrose@535: st->print("method is NULL"); duke@435: } else if (sd->method()->is_native()) { jrose@535: st->print("method is native"); duke@435: } else { never@2462: Bytecodes::Code bc = sd->method()->java_code_at(sd->bci()); duke@435: st->print(";*%s", Bytecodes::name(bc)); duke@435: switch (bc) { duke@435: case Bytecodes::_invokevirtual: duke@435: case Bytecodes::_invokespecial: duke@435: case Bytecodes::_invokestatic: duke@435: case Bytecodes::_invokeinterface: duke@435: { never@2462: Bytecode_invoke invoke(sd->method(), sd->bci()); duke@435: st->print(" "); never@2462: if (invoke.name() != NULL) never@2462: invoke.name()->print_symbol_on(st); duke@435: else duke@435: st->print(""); duke@435: break; duke@435: } duke@435: case Bytecodes::_getfield: duke@435: case Bytecodes::_putfield: duke@435: case Bytecodes::_getstatic: duke@435: case Bytecodes::_putstatic: duke@435: { never@2462: Bytecode_field field(sd->method(), sd->bci()); duke@435: st->print(" "); never@2462: if (field.name() != NULL) never@2462: field.name()->print_symbol_on(st); duke@435: else duke@435: st->print(""); duke@435: } duke@435: } duke@435: } duke@435: } jrose@535: duke@435: // Print all scopes duke@435: for (;sd != NULL; sd = sd->sender()) { jrose@535: st->move_to(column); duke@435: st->print("; -"); coleenp@4037: if (sd->method() == NULL) { jrose@535: st->print("method is NULL"); duke@435: } else { duke@435: sd->method()->print_short_name(st); duke@435: } duke@435: int lineno = sd->method()->line_number_from_bci(sd->bci()); duke@435: if (lineno != -1) { duke@435: st->print("@%d (line %d)", sd->bci(), lineno); duke@435: } else { duke@435: st->print("@%d", sd->bci()); duke@435: } duke@435: st->cr(); duke@435: } duke@435: } duke@435: duke@435: // Print relocation information duke@435: const char* str = reloc_string_for(begin, end); duke@435: if (str != NULL) { duke@435: if (sd != NULL) st->cr(); jrose@535: st->move_to(column); duke@435: st->print("; {%s}", str); duke@435: } twisti@2103: int cont_offset = ImplicitExceptionTable(this).at(begin - code_begin()); duke@435: if (cont_offset != 0) { jrose@535: st->move_to(column); twisti@2103: st->print("; implicit exception: dispatches to " INTPTR_FORMAT, code_begin() + cont_offset); duke@435: } duke@435: duke@435: } duke@435: jrose@535: #ifndef PRODUCT jrose@535: duke@435: void nmethod::print_value_on(outputStream* st) const { twisti@2687: st->print("nmethod"); twisti@2687: print_on(st, NULL); duke@435: } duke@435: duke@435: void nmethod::print_calls(outputStream* st) { duke@435: RelocIterator iter(this); duke@435: while (iter.next()) { duke@435: switch (iter.type()) { duke@435: case relocInfo::virtual_call_type: duke@435: case relocInfo::opt_virtual_call_type: { duke@435: VerifyMutexLocker mc(CompiledIC_lock); duke@435: CompiledIC_at(iter.reloc())->print(); duke@435: break; duke@435: } duke@435: case relocInfo::static_call_type: duke@435: st->print_cr("Static call at " INTPTR_FORMAT, iter.reloc()->addr()); duke@435: compiledStaticCall_at(iter.reloc())->print(); duke@435: break; duke@435: } duke@435: } duke@435: } duke@435: duke@435: void nmethod::print_handler_table() { duke@435: ExceptionHandlerTable(this).print(); duke@435: } duke@435: duke@435: void nmethod::print_nul_chk_table() { twisti@2103: ImplicitExceptionTable(this).print(code_begin()); duke@435: } duke@435: duke@435: void nmethod::print_statistics() { duke@435: ttyLocker ttyl; duke@435: if (xtty != NULL) xtty->head("statistics type='nmethod'"); duke@435: nmethod_stats.print_native_nmethod_stats(); duke@435: nmethod_stats.print_nmethod_stats(); duke@435: DebugInformationRecorder::print_statistics(); duke@435: nmethod_stats.print_pc_stats(); duke@435: Dependencies::print_statistics(); duke@435: if (xtty != NULL) xtty->tail("statistics"); duke@435: } duke@435: duke@435: #endif // PRODUCT