Mon, 28 Mar 2011 03:58:07 -0700
7022998: JSR 292 recursive method handle calls inline themselves infinitely
Reviewed-by: never, kvn
duke@435 | 1 | /* |
never@2462 | 2 | * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "code/codeCache.hpp" |
stefank@2314 | 27 | #include "code/compiledIC.hpp" |
stefank@2314 | 28 | #include "code/nmethod.hpp" |
stefank@2314 | 29 | #include "code/scopeDesc.hpp" |
stefank@2314 | 30 | #include "compiler/abstractCompiler.hpp" |
twisti@2687 | 31 | #include "compiler/compileBroker.hpp" |
stefank@2314 | 32 | #include "compiler/compileLog.hpp" |
stefank@2314 | 33 | #include "compiler/compilerOracle.hpp" |
stefank@2314 | 34 | #include "compiler/disassembler.hpp" |
stefank@2314 | 35 | #include "interpreter/bytecode.hpp" |
stefank@2314 | 36 | #include "oops/methodDataOop.hpp" |
stefank@2314 | 37 | #include "prims/jvmtiRedefineClassesTrace.hpp" |
kamg@2511 | 38 | #include "prims/jvmtiImpl.hpp" |
stefank@2314 | 39 | #include "runtime/sharedRuntime.hpp" |
stefank@2314 | 40 | #include "runtime/sweeper.hpp" |
stefank@2314 | 41 | #include "utilities/dtrace.hpp" |
stefank@2314 | 42 | #include "utilities/events.hpp" |
stefank@2314 | 43 | #include "utilities/xmlstream.hpp" |
stefank@2314 | 44 | #ifdef SHARK |
stefank@2314 | 45 | #include "shark/sharkCompiler.hpp" |
stefank@2314 | 46 | #endif |
duke@435 | 47 | |
duke@435 | 48 | #ifdef DTRACE_ENABLED |
duke@435 | 49 | |
duke@435 | 50 | // Only bother with this argument setup if dtrace is available |
duke@435 | 51 | |
duke@435 | 52 | HS_DTRACE_PROBE_DECL8(hotspot, compiled__method__load, |
duke@435 | 53 | const char*, int, const char*, int, const char*, int, void*, size_t); |
duke@435 | 54 | |
duke@435 | 55 | HS_DTRACE_PROBE_DECL6(hotspot, compiled__method__unload, |
duke@435 | 56 | char*, int, char*, int, char*, int); |
duke@435 | 57 | |
duke@435 | 58 | #define DTRACE_METHOD_UNLOAD_PROBE(method) \ |
duke@435 | 59 | { \ |
duke@435 | 60 | methodOop m = (method); \ |
duke@435 | 61 | if (m != NULL) { \ |
coleenp@2497 | 62 | Symbol* klass_name = m->klass_name(); \ |
coleenp@2497 | 63 | Symbol* name = m->name(); \ |
coleenp@2497 | 64 | Symbol* signature = m->signature(); \ |
duke@435 | 65 | HS_DTRACE_PROBE6(hotspot, compiled__method__unload, \ |
duke@435 | 66 | klass_name->bytes(), klass_name->utf8_length(), \ |
duke@435 | 67 | name->bytes(), name->utf8_length(), \ |
duke@435 | 68 | signature->bytes(), signature->utf8_length()); \ |
duke@435 | 69 | } \ |
duke@435 | 70 | } |
duke@435 | 71 | |
duke@435 | 72 | #else // ndef DTRACE_ENABLED |
duke@435 | 73 | |
duke@435 | 74 | #define DTRACE_METHOD_UNLOAD_PROBE(method) |
duke@435 | 75 | |
duke@435 | 76 | #endif |
duke@435 | 77 | |
duke@435 | 78 | bool nmethod::is_compiled_by_c1() const { |
jrose@1590 | 79 | if (compiler() == NULL || method() == NULL) return false; // can happen during debug printing |
duke@435 | 80 | if (is_native_method()) return false; |
duke@435 | 81 | return compiler()->is_c1(); |
duke@435 | 82 | } |
duke@435 | 83 | bool nmethod::is_compiled_by_c2() const { |
jrose@1590 | 84 | if (compiler() == NULL || method() == NULL) return false; // can happen during debug printing |
duke@435 | 85 | if (is_native_method()) return false; |
duke@435 | 86 | return compiler()->is_c2(); |
duke@435 | 87 | } |
twisti@2047 | 88 | bool nmethod::is_compiled_by_shark() const { |
twisti@2047 | 89 | if (is_native_method()) return false; |
twisti@2047 | 90 | assert(compiler() != NULL, "must be"); |
twisti@2047 | 91 | return compiler()->is_shark(); |
twisti@2047 | 92 | } |
duke@435 | 93 | |
duke@435 | 94 | |
duke@435 | 95 | |
duke@435 | 96 | //--------------------------------------------------------------------------------- |
duke@435 | 97 | // NMethod statistics |
duke@435 | 98 | // They are printed under various flags, including: |
duke@435 | 99 | // PrintC1Statistics, PrintOptoStatistics, LogVMOutput, and LogCompilation. |
duke@435 | 100 | // (In the latter two cases, they like other stats are printed to the log only.) |
duke@435 | 101 | |
duke@435 | 102 | #ifndef PRODUCT |
duke@435 | 103 | // These variables are put into one block to reduce relocations |
duke@435 | 104 | // and make it simpler to print from the debugger. |
duke@435 | 105 | static |
duke@435 | 106 | struct nmethod_stats_struct { |
duke@435 | 107 | int nmethod_count; |
duke@435 | 108 | int total_size; |
duke@435 | 109 | int relocation_size; |
twisti@2117 | 110 | int consts_size; |
twisti@2103 | 111 | int insts_size; |
duke@435 | 112 | int stub_size; |
duke@435 | 113 | int scopes_data_size; |
duke@435 | 114 | int scopes_pcs_size; |
duke@435 | 115 | int dependencies_size; |
duke@435 | 116 | int handler_table_size; |
duke@435 | 117 | int nul_chk_table_size; |
duke@435 | 118 | int oops_size; |
duke@435 | 119 | |
duke@435 | 120 | void note_nmethod(nmethod* nm) { |
duke@435 | 121 | nmethod_count += 1; |
duke@435 | 122 | total_size += nm->size(); |
duke@435 | 123 | relocation_size += nm->relocation_size(); |
twisti@2117 | 124 | consts_size += nm->consts_size(); |
twisti@2103 | 125 | insts_size += nm->insts_size(); |
duke@435 | 126 | stub_size += nm->stub_size(); |
twisti@1918 | 127 | oops_size += nm->oops_size(); |
duke@435 | 128 | scopes_data_size += nm->scopes_data_size(); |
duke@435 | 129 | scopes_pcs_size += nm->scopes_pcs_size(); |
duke@435 | 130 | dependencies_size += nm->dependencies_size(); |
duke@435 | 131 | handler_table_size += nm->handler_table_size(); |
duke@435 | 132 | nul_chk_table_size += nm->nul_chk_table_size(); |
duke@435 | 133 | } |
duke@435 | 134 | void print_nmethod_stats() { |
duke@435 | 135 | if (nmethod_count == 0) return; |
duke@435 | 136 | tty->print_cr("Statistics for %d bytecoded nmethods:", nmethod_count); |
duke@435 | 137 | if (total_size != 0) tty->print_cr(" total in heap = %d", total_size); |
duke@435 | 138 | if (relocation_size != 0) tty->print_cr(" relocation = %d", relocation_size); |
twisti@2117 | 139 | if (consts_size != 0) tty->print_cr(" constants = %d", consts_size); |
twisti@2103 | 140 | if (insts_size != 0) tty->print_cr(" main code = %d", insts_size); |
duke@435 | 141 | if (stub_size != 0) tty->print_cr(" stub code = %d", stub_size); |
twisti@1918 | 142 | if (oops_size != 0) tty->print_cr(" oops = %d", oops_size); |
duke@435 | 143 | if (scopes_data_size != 0) tty->print_cr(" scopes data = %d", scopes_data_size); |
duke@435 | 144 | if (scopes_pcs_size != 0) tty->print_cr(" scopes pcs = %d", scopes_pcs_size); |
duke@435 | 145 | if (dependencies_size != 0) tty->print_cr(" dependencies = %d", dependencies_size); |
duke@435 | 146 | if (handler_table_size != 0) tty->print_cr(" handler table = %d", handler_table_size); |
duke@435 | 147 | if (nul_chk_table_size != 0) tty->print_cr(" nul chk table = %d", nul_chk_table_size); |
duke@435 | 148 | } |
duke@435 | 149 | |
duke@435 | 150 | int native_nmethod_count; |
duke@435 | 151 | int native_total_size; |
duke@435 | 152 | int native_relocation_size; |
twisti@2103 | 153 | int native_insts_size; |
duke@435 | 154 | int native_oops_size; |
duke@435 | 155 | void note_native_nmethod(nmethod* nm) { |
duke@435 | 156 | native_nmethod_count += 1; |
duke@435 | 157 | native_total_size += nm->size(); |
duke@435 | 158 | native_relocation_size += nm->relocation_size(); |
twisti@2103 | 159 | native_insts_size += nm->insts_size(); |
duke@435 | 160 | native_oops_size += nm->oops_size(); |
duke@435 | 161 | } |
duke@435 | 162 | void print_native_nmethod_stats() { |
duke@435 | 163 | if (native_nmethod_count == 0) return; |
duke@435 | 164 | tty->print_cr("Statistics for %d native nmethods:", native_nmethod_count); |
duke@435 | 165 | if (native_total_size != 0) tty->print_cr(" N. total size = %d", native_total_size); |
duke@435 | 166 | if (native_relocation_size != 0) tty->print_cr(" N. relocation = %d", native_relocation_size); |
twisti@2103 | 167 | if (native_insts_size != 0) tty->print_cr(" N. main code = %d", native_insts_size); |
duke@435 | 168 | if (native_oops_size != 0) tty->print_cr(" N. oops = %d", native_oops_size); |
duke@435 | 169 | } |
duke@435 | 170 | |
duke@435 | 171 | int pc_desc_resets; // number of resets (= number of caches) |
duke@435 | 172 | int pc_desc_queries; // queries to nmethod::find_pc_desc |
duke@435 | 173 | int pc_desc_approx; // number of those which have approximate true |
phh@2621 | 174 | int pc_desc_repeats; // number of _pc_descs[0] hits |
duke@435 | 175 | int pc_desc_hits; // number of LRU cache hits |
duke@435 | 176 | int pc_desc_tests; // total number of PcDesc examinations |
duke@435 | 177 | int pc_desc_searches; // total number of quasi-binary search steps |
duke@435 | 178 | int pc_desc_adds; // number of LUR cache insertions |
duke@435 | 179 | |
duke@435 | 180 | void print_pc_stats() { |
duke@435 | 181 | tty->print_cr("PcDesc Statistics: %d queries, %.2f comparisons per query", |
duke@435 | 182 | pc_desc_queries, |
duke@435 | 183 | (double)(pc_desc_tests + pc_desc_searches) |
duke@435 | 184 | / pc_desc_queries); |
duke@435 | 185 | tty->print_cr(" caches=%d queries=%d/%d, hits=%d+%d, tests=%d+%d, adds=%d", |
duke@435 | 186 | pc_desc_resets, |
duke@435 | 187 | pc_desc_queries, pc_desc_approx, |
duke@435 | 188 | pc_desc_repeats, pc_desc_hits, |
duke@435 | 189 | pc_desc_tests, pc_desc_searches, pc_desc_adds); |
duke@435 | 190 | } |
duke@435 | 191 | } nmethod_stats; |
duke@435 | 192 | #endif //PRODUCT |
duke@435 | 193 | |
twisti@2603 | 194 | |
duke@435 | 195 | //--------------------------------------------------------------------------------- |
duke@435 | 196 | |
duke@435 | 197 | |
duke@435 | 198 | ExceptionCache::ExceptionCache(Handle exception, address pc, address handler) { |
duke@435 | 199 | assert(pc != NULL, "Must be non null"); |
duke@435 | 200 | assert(exception.not_null(), "Must be non null"); |
duke@435 | 201 | assert(handler != NULL, "Must be non null"); |
duke@435 | 202 | |
duke@435 | 203 | _count = 0; |
duke@435 | 204 | _exception_type = exception->klass(); |
duke@435 | 205 | _next = NULL; |
duke@435 | 206 | |
duke@435 | 207 | add_address_and_handler(pc,handler); |
duke@435 | 208 | } |
duke@435 | 209 | |
duke@435 | 210 | |
duke@435 | 211 | address ExceptionCache::match(Handle exception, address pc) { |
duke@435 | 212 | assert(pc != NULL,"Must be non null"); |
duke@435 | 213 | assert(exception.not_null(),"Must be non null"); |
duke@435 | 214 | if (exception->klass() == exception_type()) { |
duke@435 | 215 | return (test_address(pc)); |
duke@435 | 216 | } |
duke@435 | 217 | |
duke@435 | 218 | return NULL; |
duke@435 | 219 | } |
duke@435 | 220 | |
duke@435 | 221 | |
duke@435 | 222 | bool ExceptionCache::match_exception_with_space(Handle exception) { |
duke@435 | 223 | assert(exception.not_null(),"Must be non null"); |
duke@435 | 224 | if (exception->klass() == exception_type() && count() < cache_size) { |
duke@435 | 225 | return true; |
duke@435 | 226 | } |
duke@435 | 227 | return false; |
duke@435 | 228 | } |
duke@435 | 229 | |
duke@435 | 230 | |
duke@435 | 231 | address ExceptionCache::test_address(address addr) { |
duke@435 | 232 | for (int i=0; i<count(); i++) { |
duke@435 | 233 | if (pc_at(i) == addr) { |
duke@435 | 234 | return handler_at(i); |
duke@435 | 235 | } |
duke@435 | 236 | } |
duke@435 | 237 | return NULL; |
duke@435 | 238 | } |
duke@435 | 239 | |
duke@435 | 240 | |
duke@435 | 241 | bool ExceptionCache::add_address_and_handler(address addr, address handler) { |
duke@435 | 242 | if (test_address(addr) == handler) return true; |
duke@435 | 243 | if (count() < cache_size) { |
duke@435 | 244 | set_pc_at(count(),addr); |
duke@435 | 245 | set_handler_at(count(), handler); |
duke@435 | 246 | increment_count(); |
duke@435 | 247 | return true; |
duke@435 | 248 | } |
duke@435 | 249 | return false; |
duke@435 | 250 | } |
duke@435 | 251 | |
duke@435 | 252 | |
duke@435 | 253 | // private method for handling exception cache |
duke@435 | 254 | // These methods are private, and used to manipulate the exception cache |
duke@435 | 255 | // directly. |
duke@435 | 256 | ExceptionCache* nmethod::exception_cache_entry_for_exception(Handle exception) { |
duke@435 | 257 | ExceptionCache* ec = exception_cache(); |
duke@435 | 258 | while (ec != NULL) { |
duke@435 | 259 | if (ec->match_exception_with_space(exception)) { |
duke@435 | 260 | return ec; |
duke@435 | 261 | } |
duke@435 | 262 | ec = ec->next(); |
duke@435 | 263 | } |
duke@435 | 264 | return NULL; |
duke@435 | 265 | } |
duke@435 | 266 | |
duke@435 | 267 | |
duke@435 | 268 | //----------------------------------------------------------------------------- |
duke@435 | 269 | |
duke@435 | 270 | |
duke@435 | 271 | // Helper used by both find_pc_desc methods. |
duke@435 | 272 | static inline bool match_desc(PcDesc* pc, int pc_offset, bool approximate) { |
duke@435 | 273 | NOT_PRODUCT(++nmethod_stats.pc_desc_tests); |
duke@435 | 274 | if (!approximate) |
duke@435 | 275 | return pc->pc_offset() == pc_offset; |
duke@435 | 276 | else |
duke@435 | 277 | return (pc-1)->pc_offset() < pc_offset && pc_offset <= pc->pc_offset(); |
duke@435 | 278 | } |
duke@435 | 279 | |
duke@435 | 280 | void PcDescCache::reset_to(PcDesc* initial_pc_desc) { |
duke@435 | 281 | if (initial_pc_desc == NULL) { |
phh@2621 | 282 | _pc_descs[0] = NULL; // native method; no PcDescs at all |
duke@435 | 283 | return; |
duke@435 | 284 | } |
duke@435 | 285 | NOT_PRODUCT(++nmethod_stats.pc_desc_resets); |
duke@435 | 286 | // reset the cache by filling it with benign (non-null) values |
duke@435 | 287 | assert(initial_pc_desc->pc_offset() < 0, "must be sentinel"); |
duke@435 | 288 | for (int i = 0; i < cache_size; i++) |
duke@435 | 289 | _pc_descs[i] = initial_pc_desc; |
duke@435 | 290 | } |
duke@435 | 291 | |
duke@435 | 292 | PcDesc* PcDescCache::find_pc_desc(int pc_offset, bool approximate) { |
duke@435 | 293 | NOT_PRODUCT(++nmethod_stats.pc_desc_queries); |
phh@2621 | 294 | NOT_PRODUCT(if (approximate) ++nmethod_stats.pc_desc_approx); |
phh@2621 | 295 | |
phh@2621 | 296 | // Note: one might think that caching the most recently |
phh@2621 | 297 | // read value separately would be a win, but one would be |
phh@2621 | 298 | // wrong. When many threads are updating it, the cache |
phh@2621 | 299 | // line it's in would bounce between caches, negating |
phh@2621 | 300 | // any benefit. |
duke@435 | 301 | |
duke@435 | 302 | // In order to prevent race conditions do not load cache elements |
duke@435 | 303 | // repeatedly, but use a local copy: |
duke@435 | 304 | PcDesc* res; |
duke@435 | 305 | |
phh@2621 | 306 | // Step one: Check the most recently added value. |
phh@2621 | 307 | res = _pc_descs[0]; |
phh@2621 | 308 | if (res == NULL) return NULL; // native method; no PcDescs at all |
duke@435 | 309 | if (match_desc(res, pc_offset, approximate)) { |
duke@435 | 310 | NOT_PRODUCT(++nmethod_stats.pc_desc_repeats); |
duke@435 | 311 | return res; |
duke@435 | 312 | } |
duke@435 | 313 | |
phh@2621 | 314 | // Step two: Check the rest of the LRU cache. |
phh@2621 | 315 | for (int i = 1; i < cache_size; ++i) { |
duke@435 | 316 | res = _pc_descs[i]; |
phh@2621 | 317 | if (res->pc_offset() < 0) break; // optimization: skip empty cache |
duke@435 | 318 | if (match_desc(res, pc_offset, approximate)) { |
duke@435 | 319 | NOT_PRODUCT(++nmethod_stats.pc_desc_hits); |
duke@435 | 320 | return res; |
duke@435 | 321 | } |
duke@435 | 322 | } |
duke@435 | 323 | |
duke@435 | 324 | // Report failure. |
duke@435 | 325 | return NULL; |
duke@435 | 326 | } |
duke@435 | 327 | |
duke@435 | 328 | void PcDescCache::add_pc_desc(PcDesc* pc_desc) { |
duke@435 | 329 | NOT_PRODUCT(++nmethod_stats.pc_desc_adds); |
phh@2621 | 330 | // Update the LRU cache by shifting pc_desc forward. |
duke@435 | 331 | for (int i = 0; i < cache_size; i++) { |
duke@435 | 332 | PcDesc* next = _pc_descs[i]; |
duke@435 | 333 | _pc_descs[i] = pc_desc; |
duke@435 | 334 | pc_desc = next; |
duke@435 | 335 | } |
duke@435 | 336 | } |
duke@435 | 337 | |
duke@435 | 338 | // adjust pcs_size so that it is a multiple of both oopSize and |
duke@435 | 339 | // sizeof(PcDesc) (assumes that if sizeof(PcDesc) is not a multiple |
duke@435 | 340 | // of oopSize, then 2*sizeof(PcDesc) is) |
phh@2621 | 341 | static int adjust_pcs_size(int pcs_size) { |
duke@435 | 342 | int nsize = round_to(pcs_size, oopSize); |
duke@435 | 343 | if ((nsize % sizeof(PcDesc)) != 0) { |
duke@435 | 344 | nsize = pcs_size + sizeof(PcDesc); |
duke@435 | 345 | } |
phh@2621 | 346 | assert((nsize % oopSize) == 0, "correct alignment"); |
duke@435 | 347 | return nsize; |
duke@435 | 348 | } |
duke@435 | 349 | |
duke@435 | 350 | //----------------------------------------------------------------------------- |
duke@435 | 351 | |
duke@435 | 352 | |
duke@435 | 353 | void nmethod::add_exception_cache_entry(ExceptionCache* new_entry) { |
duke@435 | 354 | assert(ExceptionCache_lock->owned_by_self(),"Must hold the ExceptionCache_lock"); |
duke@435 | 355 | assert(new_entry != NULL,"Must be non null"); |
duke@435 | 356 | assert(new_entry->next() == NULL, "Must be null"); |
duke@435 | 357 | |
duke@435 | 358 | if (exception_cache() != NULL) { |
duke@435 | 359 | new_entry->set_next(exception_cache()); |
duke@435 | 360 | } |
duke@435 | 361 | set_exception_cache(new_entry); |
duke@435 | 362 | } |
duke@435 | 363 | |
duke@435 | 364 | void nmethod::remove_from_exception_cache(ExceptionCache* ec) { |
duke@435 | 365 | ExceptionCache* prev = NULL; |
duke@435 | 366 | ExceptionCache* curr = exception_cache(); |
duke@435 | 367 | assert(curr != NULL, "nothing to remove"); |
duke@435 | 368 | // find the previous and next entry of ec |
duke@435 | 369 | while (curr != ec) { |
duke@435 | 370 | prev = curr; |
duke@435 | 371 | curr = curr->next(); |
duke@435 | 372 | assert(curr != NULL, "ExceptionCache not found"); |
duke@435 | 373 | } |
duke@435 | 374 | // now: curr == ec |
duke@435 | 375 | ExceptionCache* next = curr->next(); |
duke@435 | 376 | if (prev == NULL) { |
duke@435 | 377 | set_exception_cache(next); |
duke@435 | 378 | } else { |
duke@435 | 379 | prev->set_next(next); |
duke@435 | 380 | } |
duke@435 | 381 | delete curr; |
duke@435 | 382 | } |
duke@435 | 383 | |
duke@435 | 384 | |
duke@435 | 385 | // public method for accessing the exception cache |
duke@435 | 386 | // These are the public access methods. |
duke@435 | 387 | address nmethod::handler_for_exception_and_pc(Handle exception, address pc) { |
duke@435 | 388 | // We never grab a lock to read the exception cache, so we may |
duke@435 | 389 | // have false negatives. This is okay, as it can only happen during |
duke@435 | 390 | // the first few exception lookups for a given nmethod. |
duke@435 | 391 | ExceptionCache* ec = exception_cache(); |
duke@435 | 392 | while (ec != NULL) { |
duke@435 | 393 | address ret_val; |
duke@435 | 394 | if ((ret_val = ec->match(exception,pc)) != NULL) { |
duke@435 | 395 | return ret_val; |
duke@435 | 396 | } |
duke@435 | 397 | ec = ec->next(); |
duke@435 | 398 | } |
duke@435 | 399 | return NULL; |
duke@435 | 400 | } |
duke@435 | 401 | |
duke@435 | 402 | |
duke@435 | 403 | void nmethod::add_handler_for_exception_and_pc(Handle exception, address pc, address handler) { |
duke@435 | 404 | // There are potential race conditions during exception cache updates, so we |
duke@435 | 405 | // must own the ExceptionCache_lock before doing ANY modifications. Because |
twisti@1040 | 406 | // we don't lock during reads, it is possible to have several threads attempt |
duke@435 | 407 | // to update the cache with the same data. We need to check for already inserted |
duke@435 | 408 | // copies of the current data before adding it. |
duke@435 | 409 | |
duke@435 | 410 | MutexLocker ml(ExceptionCache_lock); |
duke@435 | 411 | ExceptionCache* target_entry = exception_cache_entry_for_exception(exception); |
duke@435 | 412 | |
duke@435 | 413 | if (target_entry == NULL || !target_entry->add_address_and_handler(pc,handler)) { |
duke@435 | 414 | target_entry = new ExceptionCache(exception,pc,handler); |
duke@435 | 415 | add_exception_cache_entry(target_entry); |
duke@435 | 416 | } |
duke@435 | 417 | } |
duke@435 | 418 | |
duke@435 | 419 | |
duke@435 | 420 | //-------------end of code for ExceptionCache-------------- |
duke@435 | 421 | |
duke@435 | 422 | |
duke@435 | 423 | int nmethod::total_size() const { |
duke@435 | 424 | return |
twisti@2117 | 425 | consts_size() + |
twisti@2103 | 426 | insts_size() + |
duke@435 | 427 | stub_size() + |
duke@435 | 428 | scopes_data_size() + |
duke@435 | 429 | scopes_pcs_size() + |
duke@435 | 430 | handler_table_size() + |
duke@435 | 431 | nul_chk_table_size(); |
duke@435 | 432 | } |
duke@435 | 433 | |
duke@435 | 434 | const char* nmethod::compile_kind() const { |
duke@435 | 435 | if (is_osr_method()) return "osr"; |
never@1544 | 436 | if (method() != NULL && is_native_method()) return "c2n"; |
duke@435 | 437 | return NULL; |
duke@435 | 438 | } |
duke@435 | 439 | |
never@1999 | 440 | // Fill in default values for various flag fields |
never@1999 | 441 | void nmethod::init_defaults() { |
never@1999 | 442 | _state = alive; |
never@1999 | 443 | _marked_for_reclamation = 0; |
never@1999 | 444 | _has_flushed_dependencies = 0; |
never@1999 | 445 | _speculatively_disconnected = 0; |
never@1999 | 446 | _has_unsafe_access = 0; |
never@1999 | 447 | _has_method_handle_invokes = 0; |
never@1999 | 448 | _marked_for_deoptimization = 0; |
never@1999 | 449 | _lock_count = 0; |
never@1999 | 450 | _stack_traversal_mark = 0; |
never@1999 | 451 | _unload_reported = false; // jvmti state |
never@1999 | 452 | |
never@1999 | 453 | NOT_PRODUCT(_has_debug_info = false); |
never@2081 | 454 | #ifdef ASSERT |
never@2081 | 455 | _oops_are_stale = false; |
never@2081 | 456 | #endif |
never@2081 | 457 | |
never@1999 | 458 | _oops_do_mark_link = NULL; |
never@1999 | 459 | _jmethod_id = NULL; |
never@1999 | 460 | _osr_link = NULL; |
never@1999 | 461 | _scavenge_root_link = NULL; |
never@1999 | 462 | _scavenge_root_state = 0; |
never@1999 | 463 | _saved_nmethod_link = NULL; |
never@1999 | 464 | _compiler = NULL; |
never@1999 | 465 | |
never@1999 | 466 | #ifdef HAVE_DTRACE_H |
never@1999 | 467 | _trap_offset = 0; |
never@1999 | 468 | #endif // def HAVE_DTRACE_H |
never@1999 | 469 | } |
duke@435 | 470 | |
duke@435 | 471 | |
duke@435 | 472 | nmethod* nmethod::new_native_nmethod(methodHandle method, |
twisti@2687 | 473 | int compile_id, |
duke@435 | 474 | CodeBuffer *code_buffer, |
duke@435 | 475 | int vep_offset, |
duke@435 | 476 | int frame_complete, |
duke@435 | 477 | int frame_size, |
duke@435 | 478 | ByteSize basic_lock_owner_sp_offset, |
duke@435 | 479 | ByteSize basic_lock_sp_offset, |
duke@435 | 480 | OopMapSet* oop_maps) { |
duke@435 | 481 | // create nmethod |
duke@435 | 482 | nmethod* nm = NULL; |
duke@435 | 483 | { |
duke@435 | 484 | MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); |
duke@435 | 485 | int native_nmethod_size = allocation_size(code_buffer, sizeof(nmethod)); |
duke@435 | 486 | CodeOffsets offsets; |
duke@435 | 487 | offsets.set_value(CodeOffsets::Verified_Entry, vep_offset); |
duke@435 | 488 | offsets.set_value(CodeOffsets::Frame_Complete, frame_complete); |
duke@435 | 489 | nm = new (native_nmethod_size) |
twisti@2687 | 490 | nmethod(method(), native_nmethod_size, compile_id, &offsets, |
duke@435 | 491 | code_buffer, frame_size, |
duke@435 | 492 | basic_lock_owner_sp_offset, basic_lock_sp_offset, |
duke@435 | 493 | oop_maps); |
duke@435 | 494 | NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_native_nmethod(nm)); |
duke@435 | 495 | if (PrintAssembly && nm != NULL) |
duke@435 | 496 | Disassembler::decode(nm); |
duke@435 | 497 | } |
duke@435 | 498 | // verify nmethod |
duke@435 | 499 | debug_only(if (nm) nm->verify();) // might block |
duke@435 | 500 | |
duke@435 | 501 | if (nm != NULL) { |
duke@435 | 502 | nm->log_new_nmethod(); |
duke@435 | 503 | } |
duke@435 | 504 | |
duke@435 | 505 | return nm; |
duke@435 | 506 | } |
duke@435 | 507 | |
kamg@551 | 508 | #ifdef HAVE_DTRACE_H |
kamg@551 | 509 | nmethod* nmethod::new_dtrace_nmethod(methodHandle method, |
kamg@551 | 510 | CodeBuffer *code_buffer, |
kamg@551 | 511 | int vep_offset, |
kamg@551 | 512 | int trap_offset, |
kamg@551 | 513 | int frame_complete, |
kamg@551 | 514 | int frame_size) { |
kamg@551 | 515 | // create nmethod |
kamg@551 | 516 | nmethod* nm = NULL; |
kamg@551 | 517 | { |
kamg@551 | 518 | MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); |
kamg@551 | 519 | int nmethod_size = allocation_size(code_buffer, sizeof(nmethod)); |
kamg@551 | 520 | CodeOffsets offsets; |
kamg@551 | 521 | offsets.set_value(CodeOffsets::Verified_Entry, vep_offset); |
kamg@551 | 522 | offsets.set_value(CodeOffsets::Dtrace_trap, trap_offset); |
kamg@551 | 523 | offsets.set_value(CodeOffsets::Frame_Complete, frame_complete); |
kamg@551 | 524 | |
kamg@551 | 525 | nm = new (nmethod_size) nmethod(method(), nmethod_size, &offsets, code_buffer, frame_size); |
kamg@551 | 526 | |
kamg@551 | 527 | NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_nmethod(nm)); |
kamg@551 | 528 | if (PrintAssembly && nm != NULL) |
kamg@551 | 529 | Disassembler::decode(nm); |
kamg@551 | 530 | } |
kamg@551 | 531 | // verify nmethod |
kamg@551 | 532 | debug_only(if (nm) nm->verify();) // might block |
kamg@551 | 533 | |
kamg@551 | 534 | if (nm != NULL) { |
kamg@551 | 535 | nm->log_new_nmethod(); |
kamg@551 | 536 | } |
kamg@551 | 537 | |
kamg@551 | 538 | return nm; |
kamg@551 | 539 | } |
kamg@551 | 540 | |
kamg@551 | 541 | #endif // def HAVE_DTRACE_H |
kamg@551 | 542 | |
duke@435 | 543 | nmethod* nmethod::new_nmethod(methodHandle method, |
duke@435 | 544 | int compile_id, |
duke@435 | 545 | int entry_bci, |
duke@435 | 546 | CodeOffsets* offsets, |
duke@435 | 547 | int orig_pc_offset, |
duke@435 | 548 | DebugInformationRecorder* debug_info, |
duke@435 | 549 | Dependencies* dependencies, |
duke@435 | 550 | CodeBuffer* code_buffer, int frame_size, |
duke@435 | 551 | OopMapSet* oop_maps, |
duke@435 | 552 | ExceptionHandlerTable* handler_table, |
duke@435 | 553 | ImplicitExceptionTable* nul_chk_table, |
duke@435 | 554 | AbstractCompiler* compiler, |
duke@435 | 555 | int comp_level |
duke@435 | 556 | ) |
duke@435 | 557 | { |
duke@435 | 558 | assert(debug_info->oop_recorder() == code_buffer->oop_recorder(), "shared OR"); |
duke@435 | 559 | // create nmethod |
duke@435 | 560 | nmethod* nm = NULL; |
duke@435 | 561 | { MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); |
duke@435 | 562 | int nmethod_size = |
duke@435 | 563 | allocation_size(code_buffer, sizeof(nmethod)) |
duke@435 | 564 | + adjust_pcs_size(debug_info->pcs_size()) |
duke@435 | 565 | + round_to(dependencies->size_in_bytes() , oopSize) |
duke@435 | 566 | + round_to(handler_table->size_in_bytes(), oopSize) |
duke@435 | 567 | + round_to(nul_chk_table->size_in_bytes(), oopSize) |
duke@435 | 568 | + round_to(debug_info->data_size() , oopSize); |
duke@435 | 569 | nm = new (nmethod_size) |
duke@435 | 570 | nmethod(method(), nmethod_size, compile_id, entry_bci, offsets, |
duke@435 | 571 | orig_pc_offset, debug_info, dependencies, code_buffer, frame_size, |
duke@435 | 572 | oop_maps, |
duke@435 | 573 | handler_table, |
duke@435 | 574 | nul_chk_table, |
duke@435 | 575 | compiler, |
duke@435 | 576 | comp_level); |
duke@435 | 577 | if (nm != NULL) { |
duke@435 | 578 | // To make dependency checking during class loading fast, record |
duke@435 | 579 | // the nmethod dependencies in the classes it is dependent on. |
duke@435 | 580 | // This allows the dependency checking code to simply walk the |
duke@435 | 581 | // class hierarchy above the loaded class, checking only nmethods |
duke@435 | 582 | // which are dependent on those classes. The slow way is to |
duke@435 | 583 | // check every nmethod for dependencies which makes it linear in |
duke@435 | 584 | // the number of methods compiled. For applications with a lot |
duke@435 | 585 | // classes the slow way is too slow. |
duke@435 | 586 | for (Dependencies::DepStream deps(nm); deps.next(); ) { |
duke@435 | 587 | klassOop klass = deps.context_type(); |
duke@435 | 588 | if (klass == NULL) continue; // ignore things like evol_method |
duke@435 | 589 | |
duke@435 | 590 | // record this nmethod as dependent on this klass |
duke@435 | 591 | instanceKlass::cast(klass)->add_dependent_nmethod(nm); |
duke@435 | 592 | } |
duke@435 | 593 | } |
duke@435 | 594 | NOT_PRODUCT(if (nm != NULL) nmethod_stats.note_nmethod(nm)); |
duke@435 | 595 | if (PrintAssembly && nm != NULL) |
duke@435 | 596 | Disassembler::decode(nm); |
duke@435 | 597 | } |
duke@435 | 598 | |
duke@435 | 599 | // verify nmethod |
duke@435 | 600 | debug_only(if (nm) nm->verify();) // might block |
duke@435 | 601 | |
duke@435 | 602 | if (nm != NULL) { |
duke@435 | 603 | nm->log_new_nmethod(); |
duke@435 | 604 | } |
duke@435 | 605 | |
duke@435 | 606 | // done |
duke@435 | 607 | return nm; |
duke@435 | 608 | } |
duke@435 | 609 | |
duke@435 | 610 | |
duke@435 | 611 | // For native wrappers |
duke@435 | 612 | nmethod::nmethod( |
duke@435 | 613 | methodOop method, |
duke@435 | 614 | int nmethod_size, |
twisti@2687 | 615 | int compile_id, |
duke@435 | 616 | CodeOffsets* offsets, |
duke@435 | 617 | CodeBuffer* code_buffer, |
duke@435 | 618 | int frame_size, |
duke@435 | 619 | ByteSize basic_lock_owner_sp_offset, |
duke@435 | 620 | ByteSize basic_lock_sp_offset, |
duke@435 | 621 | OopMapSet* oop_maps ) |
duke@435 | 622 | : CodeBlob("native nmethod", code_buffer, sizeof(nmethod), |
duke@435 | 623 | nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, oop_maps), |
kamg@2361 | 624 | _native_receiver_sp_offset(basic_lock_owner_sp_offset), |
kamg@2361 | 625 | _native_basic_lock_sp_offset(basic_lock_sp_offset) |
duke@435 | 626 | { |
duke@435 | 627 | { |
duke@435 | 628 | debug_only(No_Safepoint_Verifier nsv;) |
duke@435 | 629 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 630 | |
never@1999 | 631 | init_defaults(); |
duke@435 | 632 | _method = method; |
duke@435 | 633 | _entry_bci = InvocationEntryBci; |
duke@435 | 634 | // We have no exception handler or deopt handler make the |
duke@435 | 635 | // values something that will never match a pc like the nmethod vtable entry |
duke@435 | 636 | _exception_offset = 0; |
duke@435 | 637 | _deoptimize_offset = 0; |
twisti@1639 | 638 | _deoptimize_mh_offset = 0; |
duke@435 | 639 | _orig_pc_offset = 0; |
never@1999 | 640 | |
twisti@2103 | 641 | _consts_offset = data_offset(); |
duke@435 | 642 | _stub_offset = data_offset(); |
twisti@1918 | 643 | _oops_offset = data_offset(); |
twisti@1918 | 644 | _scopes_data_offset = _oops_offset + round_to(code_buffer->total_oop_size(), oopSize); |
duke@435 | 645 | _scopes_pcs_offset = _scopes_data_offset; |
duke@435 | 646 | _dependencies_offset = _scopes_pcs_offset; |
duke@435 | 647 | _handler_table_offset = _dependencies_offset; |
duke@435 | 648 | _nul_chk_table_offset = _handler_table_offset; |
duke@435 | 649 | _nmethod_end_offset = _nul_chk_table_offset; |
twisti@2687 | 650 | _compile_id = compile_id; |
duke@435 | 651 | _comp_level = CompLevel_none; |
twisti@2103 | 652 | _entry_point = code_begin() + offsets->value(CodeOffsets::Entry); |
twisti@2103 | 653 | _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry); |
duke@435 | 654 | _osr_entry_point = NULL; |
duke@435 | 655 | _exception_cache = NULL; |
duke@435 | 656 | _pc_desc_cache.reset_to(NULL); |
duke@435 | 657 | |
duke@435 | 658 | code_buffer->copy_oops_to(this); |
never@2658 | 659 | if (ScavengeRootsInCode && detect_scavenge_root_oops()) { |
never@2658 | 660 | CodeCache::add_scavenge_root_nmethod(this); |
never@2658 | 661 | } |
jrose@1424 | 662 | debug_only(verify_scavenge_root_oops()); |
duke@435 | 663 | CodeCache::commit(this); |
duke@435 | 664 | } |
duke@435 | 665 | |
duke@435 | 666 | if (PrintNativeNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) { |
duke@435 | 667 | ttyLocker ttyl; // keep the following output all in one block |
duke@435 | 668 | // This output goes directly to the tty, not the compiler log. |
duke@435 | 669 | // To enable tools to match it up with the compilation activity, |
duke@435 | 670 | // be sure to tag this tty output with the compile ID. |
duke@435 | 671 | if (xtty != NULL) { |
duke@435 | 672 | xtty->begin_head("print_native_nmethod"); |
duke@435 | 673 | xtty->method(_method); |
duke@435 | 674 | xtty->stamp(); |
duke@435 | 675 | xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this); |
duke@435 | 676 | } |
duke@435 | 677 | // print the header part first |
duke@435 | 678 | print(); |
duke@435 | 679 | // then print the requested information |
duke@435 | 680 | if (PrintNativeNMethods) { |
duke@435 | 681 | print_code(); |
duke@435 | 682 | oop_maps->print(); |
duke@435 | 683 | } |
duke@435 | 684 | if (PrintRelocations) { |
duke@435 | 685 | print_relocations(); |
duke@435 | 686 | } |
duke@435 | 687 | if (xtty != NULL) { |
duke@435 | 688 | xtty->tail("print_native_nmethod"); |
duke@435 | 689 | } |
duke@435 | 690 | } |
duke@435 | 691 | Events::log("Create nmethod " INTPTR_FORMAT, this); |
duke@435 | 692 | } |
duke@435 | 693 | |
kamg@551 | 694 | // For dtrace wrappers |
kamg@551 | 695 | #ifdef HAVE_DTRACE_H |
kamg@551 | 696 | nmethod::nmethod( |
kamg@551 | 697 | methodOop method, |
kamg@551 | 698 | int nmethod_size, |
kamg@551 | 699 | CodeOffsets* offsets, |
kamg@551 | 700 | CodeBuffer* code_buffer, |
kamg@551 | 701 | int frame_size) |
kamg@551 | 702 | : CodeBlob("dtrace nmethod", code_buffer, sizeof(nmethod), |
kamg@551 | 703 | nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, NULL), |
kamg@2361 | 704 | _native_receiver_sp_offset(in_ByteSize(-1)), |
kamg@2361 | 705 | _native_basic_lock_sp_offset(in_ByteSize(-1)) |
kamg@551 | 706 | { |
kamg@551 | 707 | { |
kamg@551 | 708 | debug_only(No_Safepoint_Verifier nsv;) |
kamg@551 | 709 | assert_locked_or_safepoint(CodeCache_lock); |
kamg@551 | 710 | |
never@1999 | 711 | init_defaults(); |
kamg@551 | 712 | _method = method; |
kamg@551 | 713 | _entry_bci = InvocationEntryBci; |
kamg@551 | 714 | // We have no exception handler or deopt handler make the |
kamg@551 | 715 | // values something that will never match a pc like the nmethod vtable entry |
kamg@551 | 716 | _exception_offset = 0; |
kamg@551 | 717 | _deoptimize_offset = 0; |
twisti@1639 | 718 | _deoptimize_mh_offset = 0; |
never@1813 | 719 | _unwind_handler_offset = -1; |
kamg@551 | 720 | _trap_offset = offsets->value(CodeOffsets::Dtrace_trap); |
kamg@551 | 721 | _orig_pc_offset = 0; |
twisti@2103 | 722 | _consts_offset = data_offset(); |
kamg@551 | 723 | _stub_offset = data_offset(); |
twisti@1918 | 724 | _oops_offset = data_offset(); |
twisti@1918 | 725 | _scopes_data_offset = _oops_offset + round_to(code_buffer->total_oop_size(), oopSize); |
kamg@551 | 726 | _scopes_pcs_offset = _scopes_data_offset; |
kamg@551 | 727 | _dependencies_offset = _scopes_pcs_offset; |
kamg@551 | 728 | _handler_table_offset = _dependencies_offset; |
kamg@551 | 729 | _nul_chk_table_offset = _handler_table_offset; |
kamg@551 | 730 | _nmethod_end_offset = _nul_chk_table_offset; |
kamg@551 | 731 | _compile_id = 0; // default |
kamg@551 | 732 | _comp_level = CompLevel_none; |
twisti@2103 | 733 | _entry_point = code_begin() + offsets->value(CodeOffsets::Entry); |
twisti@2103 | 734 | _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry); |
kamg@551 | 735 | _osr_entry_point = NULL; |
kamg@551 | 736 | _exception_cache = NULL; |
kamg@551 | 737 | _pc_desc_cache.reset_to(NULL); |
kamg@551 | 738 | |
kamg@551 | 739 | code_buffer->copy_oops_to(this); |
jrose@1424 | 740 | debug_only(verify_scavenge_root_oops()); |
kamg@551 | 741 | CodeCache::commit(this); |
kamg@551 | 742 | } |
kamg@551 | 743 | |
kamg@551 | 744 | if (PrintNMethods || PrintDebugInfo || PrintRelocations || PrintDependencies) { |
kamg@551 | 745 | ttyLocker ttyl; // keep the following output all in one block |
kamg@551 | 746 | // This output goes directly to the tty, not the compiler log. |
kamg@551 | 747 | // To enable tools to match it up with the compilation activity, |
kamg@551 | 748 | // be sure to tag this tty output with the compile ID. |
kamg@551 | 749 | if (xtty != NULL) { |
kamg@551 | 750 | xtty->begin_head("print_dtrace_nmethod"); |
kamg@551 | 751 | xtty->method(_method); |
kamg@551 | 752 | xtty->stamp(); |
kamg@551 | 753 | xtty->end_head(" address='" INTPTR_FORMAT "'", (intptr_t) this); |
kamg@551 | 754 | } |
kamg@551 | 755 | // print the header part first |
kamg@551 | 756 | print(); |
kamg@551 | 757 | // then print the requested information |
kamg@551 | 758 | if (PrintNMethods) { |
kamg@551 | 759 | print_code(); |
kamg@551 | 760 | } |
kamg@551 | 761 | if (PrintRelocations) { |
kamg@551 | 762 | print_relocations(); |
kamg@551 | 763 | } |
kamg@551 | 764 | if (xtty != NULL) { |
kamg@551 | 765 | xtty->tail("print_dtrace_nmethod"); |
kamg@551 | 766 | } |
kamg@551 | 767 | } |
kamg@551 | 768 | Events::log("Create nmethod " INTPTR_FORMAT, this); |
kamg@551 | 769 | } |
kamg@551 | 770 | #endif // def HAVE_DTRACE_H |
duke@435 | 771 | |
duke@435 | 772 | void* nmethod::operator new(size_t size, int nmethod_size) { |
duke@435 | 773 | // Always leave some room in the CodeCache for I2C/C2I adapters |
kvn@2635 | 774 | if (CodeCache::largest_free_block() < CodeCacheMinimumFreeSpace) return NULL; |
duke@435 | 775 | return CodeCache::allocate(nmethod_size); |
duke@435 | 776 | } |
duke@435 | 777 | |
duke@435 | 778 | |
duke@435 | 779 | nmethod::nmethod( |
duke@435 | 780 | methodOop method, |
duke@435 | 781 | int nmethod_size, |
duke@435 | 782 | int compile_id, |
duke@435 | 783 | int entry_bci, |
duke@435 | 784 | CodeOffsets* offsets, |
duke@435 | 785 | int orig_pc_offset, |
duke@435 | 786 | DebugInformationRecorder* debug_info, |
duke@435 | 787 | Dependencies* dependencies, |
duke@435 | 788 | CodeBuffer *code_buffer, |
duke@435 | 789 | int frame_size, |
duke@435 | 790 | OopMapSet* oop_maps, |
duke@435 | 791 | ExceptionHandlerTable* handler_table, |
duke@435 | 792 | ImplicitExceptionTable* nul_chk_table, |
duke@435 | 793 | AbstractCompiler* compiler, |
duke@435 | 794 | int comp_level |
duke@435 | 795 | ) |
duke@435 | 796 | : CodeBlob("nmethod", code_buffer, sizeof(nmethod), |
duke@435 | 797 | nmethod_size, offsets->value(CodeOffsets::Frame_Complete), frame_size, oop_maps), |
kamg@2361 | 798 | _native_receiver_sp_offset(in_ByteSize(-1)), |
kamg@2361 | 799 | _native_basic_lock_sp_offset(in_ByteSize(-1)) |
duke@435 | 800 | { |
duke@435 | 801 | assert(debug_info->oop_recorder() == code_buffer->oop_recorder(), "shared OR"); |
duke@435 | 802 | { |
duke@435 | 803 | debug_only(No_Safepoint_Verifier nsv;) |
duke@435 | 804 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 805 | |
never@1999 | 806 | init_defaults(); |
duke@435 | 807 | _method = method; |
never@1999 | 808 | _entry_bci = entry_bci; |
duke@435 | 809 | _compile_id = compile_id; |
duke@435 | 810 | _comp_level = comp_level; |
duke@435 | 811 | _compiler = compiler; |
duke@435 | 812 | _orig_pc_offset = orig_pc_offset; |
twisti@2103 | 813 | |
twisti@2103 | 814 | // Section offsets |
twisti@2117 | 815 | _consts_offset = content_offset() + code_buffer->total_offset_of(code_buffer->consts()); |
twisti@2117 | 816 | _stub_offset = content_offset() + code_buffer->total_offset_of(code_buffer->stubs()); |
duke@435 | 817 | |
duke@435 | 818 | // Exception handler and deopt handler are in the stub section |
twisti@2406 | 819 | assert(offsets->value(CodeOffsets::Exceptions) != -1, "must be set"); |
twisti@2406 | 820 | assert(offsets->value(CodeOffsets::Deopt ) != -1, "must be set"); |
twisti@2103 | 821 | _exception_offset = _stub_offset + offsets->value(CodeOffsets::Exceptions); |
twisti@2103 | 822 | _deoptimize_offset = _stub_offset + offsets->value(CodeOffsets::Deopt); |
twisti@2406 | 823 | if (offsets->value(CodeOffsets::DeoptMH) != -1) { |
twisti@2117 | 824 | _deoptimize_mh_offset = _stub_offset + offsets->value(CodeOffsets::DeoptMH); |
twisti@2117 | 825 | } else { |
twisti@2117 | 826 | _deoptimize_mh_offset = -1; |
twisti@2117 | 827 | } |
never@1813 | 828 | if (offsets->value(CodeOffsets::UnwindHandler) != -1) { |
twisti@2103 | 829 | _unwind_handler_offset = code_offset() + offsets->value(CodeOffsets::UnwindHandler); |
never@1813 | 830 | } else { |
twisti@2103 | 831 | _unwind_handler_offset = -1; |
never@1813 | 832 | } |
twisti@2103 | 833 | |
twisti@1918 | 834 | _oops_offset = data_offset(); |
twisti@1918 | 835 | _scopes_data_offset = _oops_offset + round_to(code_buffer->total_oop_size (), oopSize); |
twisti@1918 | 836 | _scopes_pcs_offset = _scopes_data_offset + round_to(debug_info->data_size (), oopSize); |
duke@435 | 837 | _dependencies_offset = _scopes_pcs_offset + adjust_pcs_size(debug_info->pcs_size()); |
duke@435 | 838 | _handler_table_offset = _dependencies_offset + round_to(dependencies->size_in_bytes (), oopSize); |
duke@435 | 839 | _nul_chk_table_offset = _handler_table_offset + round_to(handler_table->size_in_bytes(), oopSize); |
duke@435 | 840 | _nmethod_end_offset = _nul_chk_table_offset + round_to(nul_chk_table->size_in_bytes(), oopSize); |
duke@435 | 841 | |
twisti@2103 | 842 | _entry_point = code_begin() + offsets->value(CodeOffsets::Entry); |
twisti@2103 | 843 | _verified_entry_point = code_begin() + offsets->value(CodeOffsets::Verified_Entry); |
twisti@2103 | 844 | _osr_entry_point = code_begin() + offsets->value(CodeOffsets::OSR_Entry); |
duke@435 | 845 | _exception_cache = NULL; |
duke@435 | 846 | _pc_desc_cache.reset_to(scopes_pcs_begin()); |
duke@435 | 847 | |
duke@435 | 848 | // Copy contents of ScopeDescRecorder to nmethod |
duke@435 | 849 | code_buffer->copy_oops_to(this); |
duke@435 | 850 | debug_info->copy_to(this); |
duke@435 | 851 | dependencies->copy_to(this); |
jrose@1424 | 852 | if (ScavengeRootsInCode && detect_scavenge_root_oops()) { |
jrose@1424 | 853 | CodeCache::add_scavenge_root_nmethod(this); |
jrose@1424 | 854 | } |
jrose@1424 | 855 | debug_only(verify_scavenge_root_oops()); |
duke@435 | 856 | |
duke@435 | 857 | CodeCache::commit(this); |
duke@435 | 858 | |
duke@435 | 859 | // Copy contents of ExceptionHandlerTable to nmethod |
duke@435 | 860 | handler_table->copy_to(this); |
duke@435 | 861 | nul_chk_table->copy_to(this); |
duke@435 | 862 | |
duke@435 | 863 | // we use the information of entry points to find out if a method is |
duke@435 | 864 | // static or non static |
duke@435 | 865 | assert(compiler->is_c2() || |
duke@435 | 866 | _method->is_static() == (entry_point() == _verified_entry_point), |
duke@435 | 867 | " entry points must be same for static methods and vice versa"); |
duke@435 | 868 | } |
duke@435 | 869 | |
jrose@535 | 870 | bool printnmethods = PrintNMethods |
jrose@535 | 871 | || CompilerOracle::should_print(_method) |
jrose@535 | 872 | || CompilerOracle::has_option_string(_method, "PrintNMethods"); |
duke@435 | 873 | if (printnmethods || PrintDebugInfo || PrintRelocations || PrintDependencies || PrintExceptionHandlers) { |
duke@435 | 874 | print_nmethod(printnmethods); |
duke@435 | 875 | } |
duke@435 | 876 | |
duke@435 | 877 | // Note: Do not verify in here as the CodeCache_lock is |
duke@435 | 878 | // taken which would conflict with the CompiledIC_lock |
duke@435 | 879 | // which taken during the verification of call sites. |
duke@435 | 880 | // (was bug - gri 10/25/99) |
duke@435 | 881 | |
duke@435 | 882 | Events::log("Create nmethod " INTPTR_FORMAT, this); |
duke@435 | 883 | } |
duke@435 | 884 | |
duke@435 | 885 | |
duke@435 | 886 | // Print a short set of xml attributes to identify this nmethod. The |
duke@435 | 887 | // output should be embedded in some other element. |
duke@435 | 888 | void nmethod::log_identity(xmlStream* log) const { |
duke@435 | 889 | log->print(" compile_id='%d'", compile_id()); |
duke@435 | 890 | const char* nm_kind = compile_kind(); |
duke@435 | 891 | if (nm_kind != NULL) log->print(" compile_kind='%s'", nm_kind); |
duke@435 | 892 | if (compiler() != NULL) { |
duke@435 | 893 | log->print(" compiler='%s'", compiler()->name()); |
duke@435 | 894 | } |
iveresov@2138 | 895 | if (TieredCompilation) { |
iveresov@2138 | 896 | log->print(" level='%d'", comp_level()); |
iveresov@2138 | 897 | } |
duke@435 | 898 | } |
duke@435 | 899 | |
duke@435 | 900 | |
duke@435 | 901 | #define LOG_OFFSET(log, name) \ |
duke@435 | 902 | if ((intptr_t)name##_end() - (intptr_t)name##_begin()) \ |
duke@435 | 903 | log->print(" " XSTR(name) "_offset='%d'" , \ |
duke@435 | 904 | (intptr_t)name##_begin() - (intptr_t)this) |
duke@435 | 905 | |
duke@435 | 906 | |
duke@435 | 907 | void nmethod::log_new_nmethod() const { |
duke@435 | 908 | if (LogCompilation && xtty != NULL) { |
duke@435 | 909 | ttyLocker ttyl; |
duke@435 | 910 | HandleMark hm; |
duke@435 | 911 | xtty->begin_elem("nmethod"); |
duke@435 | 912 | log_identity(xtty); |
twisti@2103 | 913 | xtty->print(" entry='" INTPTR_FORMAT "' size='%d'", code_begin(), size()); |
duke@435 | 914 | xtty->print(" address='" INTPTR_FORMAT "'", (intptr_t) this); |
duke@435 | 915 | |
duke@435 | 916 | LOG_OFFSET(xtty, relocation); |
twisti@2117 | 917 | LOG_OFFSET(xtty, consts); |
twisti@2103 | 918 | LOG_OFFSET(xtty, insts); |
duke@435 | 919 | LOG_OFFSET(xtty, stub); |
duke@435 | 920 | LOG_OFFSET(xtty, scopes_data); |
duke@435 | 921 | LOG_OFFSET(xtty, scopes_pcs); |
duke@435 | 922 | LOG_OFFSET(xtty, dependencies); |
duke@435 | 923 | LOG_OFFSET(xtty, handler_table); |
duke@435 | 924 | LOG_OFFSET(xtty, nul_chk_table); |
duke@435 | 925 | LOG_OFFSET(xtty, oops); |
duke@435 | 926 | |
duke@435 | 927 | xtty->method(method()); |
duke@435 | 928 | xtty->stamp(); |
duke@435 | 929 | xtty->end_elem(); |
duke@435 | 930 | } |
duke@435 | 931 | } |
duke@435 | 932 | |
duke@435 | 933 | #undef LOG_OFFSET |
duke@435 | 934 | |
duke@435 | 935 | |
duke@435 | 936 | // Print out more verbose output usually for a newly created nmethod. |
twisti@2687 | 937 | void nmethod::print_on(outputStream* st, const char* msg) const { |
duke@435 | 938 | if (st != NULL) { |
duke@435 | 939 | ttyLocker ttyl; |
twisti@2687 | 940 | CompileTask::print_compilation(st, this, msg); |
duke@435 | 941 | if (WizardMode) st->print(" (" INTPTR_FORMAT ")", this); |
duke@435 | 942 | } |
duke@435 | 943 | } |
duke@435 | 944 | |
duke@435 | 945 | |
duke@435 | 946 | void nmethod::print_nmethod(bool printmethod) { |
duke@435 | 947 | ttyLocker ttyl; // keep the following output all in one block |
duke@435 | 948 | if (xtty != NULL) { |
duke@435 | 949 | xtty->begin_head("print_nmethod"); |
duke@435 | 950 | xtty->stamp(); |
duke@435 | 951 | xtty->end_head(); |
duke@435 | 952 | } |
duke@435 | 953 | // print the header part first |
duke@435 | 954 | print(); |
duke@435 | 955 | // then print the requested information |
duke@435 | 956 | if (printmethod) { |
duke@435 | 957 | print_code(); |
duke@435 | 958 | print_pcs(); |
duke@435 | 959 | oop_maps()->print(); |
duke@435 | 960 | } |
duke@435 | 961 | if (PrintDebugInfo) { |
duke@435 | 962 | print_scopes(); |
duke@435 | 963 | } |
duke@435 | 964 | if (PrintRelocations) { |
duke@435 | 965 | print_relocations(); |
duke@435 | 966 | } |
duke@435 | 967 | if (PrintDependencies) { |
duke@435 | 968 | print_dependencies(); |
duke@435 | 969 | } |
duke@435 | 970 | if (PrintExceptionHandlers) { |
duke@435 | 971 | print_handler_table(); |
duke@435 | 972 | print_nul_chk_table(); |
duke@435 | 973 | } |
duke@435 | 974 | if (xtty != NULL) { |
duke@435 | 975 | xtty->tail("print_nmethod"); |
duke@435 | 976 | } |
duke@435 | 977 | } |
duke@435 | 978 | |
duke@435 | 979 | |
twisti@1918 | 980 | // Promote one word from an assembly-time handle to a live embedded oop. |
twisti@1918 | 981 | inline void nmethod::initialize_immediate_oop(oop* dest, jobject handle) { |
twisti@1918 | 982 | if (handle == NULL || |
twisti@1918 | 983 | // As a special case, IC oops are initialized to 1 or -1. |
twisti@1918 | 984 | handle == (jobject) Universe::non_oop_word()) { |
twisti@1918 | 985 | (*dest) = (oop) handle; |
twisti@1918 | 986 | } else { |
twisti@1918 | 987 | (*dest) = JNIHandles::resolve_non_null(handle); |
twisti@1918 | 988 | } |
twisti@1918 | 989 | } |
twisti@1918 | 990 | |
twisti@1918 | 991 | |
twisti@1918 | 992 | void nmethod::copy_oops(GrowableArray<jobject>* array) { |
twisti@1918 | 993 | //assert(oops_size() == 0, "do this handshake just once, please"); |
twisti@1918 | 994 | int length = array->length(); |
twisti@1918 | 995 | assert((address)(oops_begin() + length) <= data_end(), "oops big enough"); |
twisti@1918 | 996 | oop* dest = oops_begin(); |
twisti@1918 | 997 | for (int index = 0 ; index < length; index++) { |
twisti@1918 | 998 | initialize_immediate_oop(&dest[index], array->at(index)); |
twisti@1918 | 999 | } |
twisti@1918 | 1000 | |
twisti@1918 | 1001 | // Now we can fix up all the oops in the code. We need to do this |
twisti@1918 | 1002 | // in the code because the assembler uses jobjects as placeholders. |
twisti@1918 | 1003 | // The code and relocations have already been initialized by the |
twisti@1918 | 1004 | // CodeBlob constructor, so it is valid even at this early point to |
twisti@1918 | 1005 | // iterate over relocations and patch the code. |
twisti@1918 | 1006 | fix_oop_relocations(NULL, NULL, /*initialize_immediates=*/ true); |
twisti@1918 | 1007 | } |
twisti@1918 | 1008 | |
twisti@1918 | 1009 | |
twisti@1918 | 1010 | bool nmethod::is_at_poll_return(address pc) { |
twisti@1918 | 1011 | RelocIterator iter(this, pc, pc+1); |
twisti@1918 | 1012 | while (iter.next()) { |
twisti@1918 | 1013 | if (iter.type() == relocInfo::poll_return_type) |
twisti@1918 | 1014 | return true; |
twisti@1918 | 1015 | } |
twisti@1918 | 1016 | return false; |
twisti@1918 | 1017 | } |
twisti@1918 | 1018 | |
twisti@1918 | 1019 | |
twisti@1918 | 1020 | bool nmethod::is_at_poll_or_poll_return(address pc) { |
twisti@1918 | 1021 | RelocIterator iter(this, pc, pc+1); |
twisti@1918 | 1022 | while (iter.next()) { |
twisti@1918 | 1023 | relocInfo::relocType t = iter.type(); |
twisti@1918 | 1024 | if (t == relocInfo::poll_return_type || t == relocInfo::poll_type) |
twisti@1918 | 1025 | return true; |
twisti@1918 | 1026 | } |
twisti@1918 | 1027 | return false; |
twisti@1918 | 1028 | } |
twisti@1918 | 1029 | |
twisti@1918 | 1030 | |
twisti@1918 | 1031 | void nmethod::fix_oop_relocations(address begin, address end, bool initialize_immediates) { |
twisti@1918 | 1032 | // re-patch all oop-bearing instructions, just in case some oops moved |
twisti@1918 | 1033 | RelocIterator iter(this, begin, end); |
twisti@1918 | 1034 | while (iter.next()) { |
twisti@1918 | 1035 | if (iter.type() == relocInfo::oop_type) { |
twisti@1918 | 1036 | oop_Relocation* reloc = iter.oop_reloc(); |
twisti@1918 | 1037 | if (initialize_immediates && reloc->oop_is_immediate()) { |
twisti@1918 | 1038 | oop* dest = reloc->oop_addr(); |
twisti@1918 | 1039 | initialize_immediate_oop(dest, (jobject) *dest); |
twisti@1918 | 1040 | } |
twisti@1918 | 1041 | // Refresh the oop-related bits of this instruction. |
twisti@1918 | 1042 | reloc->fix_oop_relocation(); |
twisti@1918 | 1043 | } |
twisti@1918 | 1044 | |
twisti@1918 | 1045 | // There must not be any interfering patches or breakpoints. |
twisti@1918 | 1046 | assert(!(iter.type() == relocInfo::breakpoint_type |
twisti@1918 | 1047 | && iter.breakpoint_reloc()->active()), |
twisti@1918 | 1048 | "no active breakpoint"); |
twisti@1918 | 1049 | } |
twisti@1918 | 1050 | } |
twisti@1918 | 1051 | |
twisti@1918 | 1052 | |
never@2657 | 1053 | void nmethod::verify_oop_relocations() { |
never@2657 | 1054 | // Ensure sure that the code matches the current oop values |
never@2657 | 1055 | RelocIterator iter(this, NULL, NULL); |
never@2657 | 1056 | while (iter.next()) { |
never@2657 | 1057 | if (iter.type() == relocInfo::oop_type) { |
never@2657 | 1058 | oop_Relocation* reloc = iter.oop_reloc(); |
never@2657 | 1059 | if (!reloc->oop_is_immediate()) { |
never@2657 | 1060 | reloc->verify_oop_relocation(); |
never@2657 | 1061 | } |
never@2657 | 1062 | } |
never@2657 | 1063 | } |
never@2657 | 1064 | } |
never@2657 | 1065 | |
never@2657 | 1066 | |
duke@435 | 1067 | ScopeDesc* nmethod::scope_desc_at(address pc) { |
duke@435 | 1068 | PcDesc* pd = pc_desc_at(pc); |
duke@435 | 1069 | guarantee(pd != NULL, "scope must be present"); |
duke@435 | 1070 | return new ScopeDesc(this, pd->scope_decode_offset(), |
kvn@1688 | 1071 | pd->obj_decode_offset(), pd->should_reexecute(), |
kvn@1688 | 1072 | pd->return_oop()); |
duke@435 | 1073 | } |
duke@435 | 1074 | |
duke@435 | 1075 | |
duke@435 | 1076 | void nmethod::clear_inline_caches() { |
duke@435 | 1077 | assert(SafepointSynchronize::is_at_safepoint(), "cleaning of IC's only allowed at safepoint"); |
duke@435 | 1078 | if (is_zombie()) { |
duke@435 | 1079 | return; |
duke@435 | 1080 | } |
duke@435 | 1081 | |
duke@435 | 1082 | RelocIterator iter(this); |
duke@435 | 1083 | while (iter.next()) { |
duke@435 | 1084 | iter.reloc()->clear_inline_cache(); |
duke@435 | 1085 | } |
duke@435 | 1086 | } |
duke@435 | 1087 | |
duke@435 | 1088 | |
duke@435 | 1089 | void nmethod::cleanup_inline_caches() { |
duke@435 | 1090 | |
never@1893 | 1091 | assert_locked_or_safepoint(CompiledIC_lock); |
duke@435 | 1092 | |
duke@435 | 1093 | // If the method is not entrant or zombie then a JMP is plastered over the |
duke@435 | 1094 | // first few bytes. If an oop in the old code was there, that oop |
duke@435 | 1095 | // should not get GC'd. Skip the first few bytes of oops on |
duke@435 | 1096 | // not-entrant methods. |
duke@435 | 1097 | address low_boundary = verified_entry_point(); |
duke@435 | 1098 | if (!is_in_use()) { |
duke@435 | 1099 | low_boundary += NativeJump::instruction_size; |
duke@435 | 1100 | // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump. |
duke@435 | 1101 | // This means that the low_boundary is going to be a little too high. |
duke@435 | 1102 | // This shouldn't matter, since oops of non-entrant methods are never used. |
duke@435 | 1103 | // In fact, why are we bothering to look at oops in a non-entrant method?? |
duke@435 | 1104 | } |
duke@435 | 1105 | |
duke@435 | 1106 | // Find all calls in an nmethod, and clear the ones that points to zombie methods |
duke@435 | 1107 | ResourceMark rm; |
duke@435 | 1108 | RelocIterator iter(this, low_boundary); |
duke@435 | 1109 | while(iter.next()) { |
duke@435 | 1110 | switch(iter.type()) { |
duke@435 | 1111 | case relocInfo::virtual_call_type: |
duke@435 | 1112 | case relocInfo::opt_virtual_call_type: { |
duke@435 | 1113 | CompiledIC *ic = CompiledIC_at(iter.reloc()); |
duke@435 | 1114 | // Ok, to lookup references to zombies here |
duke@435 | 1115 | CodeBlob *cb = CodeCache::find_blob_unsafe(ic->ic_destination()); |
duke@435 | 1116 | if( cb != NULL && cb->is_nmethod() ) { |
duke@435 | 1117 | nmethod* nm = (nmethod*)cb; |
duke@435 | 1118 | // Clean inline caches pointing to both zombie and not_entrant methods |
kvn@1637 | 1119 | if (!nm->is_in_use() || (nm->method()->code() != nm)) ic->set_to_clean(); |
duke@435 | 1120 | } |
duke@435 | 1121 | break; |
duke@435 | 1122 | } |
duke@435 | 1123 | case relocInfo::static_call_type: { |
duke@435 | 1124 | CompiledStaticCall *csc = compiledStaticCall_at(iter.reloc()); |
duke@435 | 1125 | CodeBlob *cb = CodeCache::find_blob_unsafe(csc->destination()); |
duke@435 | 1126 | if( cb != NULL && cb->is_nmethod() ) { |
duke@435 | 1127 | nmethod* nm = (nmethod*)cb; |
duke@435 | 1128 | // Clean inline caches pointing to both zombie and not_entrant methods |
kvn@1637 | 1129 | if (!nm->is_in_use() || (nm->method()->code() != nm)) csc->set_to_clean(); |
duke@435 | 1130 | } |
duke@435 | 1131 | break; |
duke@435 | 1132 | } |
duke@435 | 1133 | } |
duke@435 | 1134 | } |
duke@435 | 1135 | } |
duke@435 | 1136 | |
jrose@1424 | 1137 | // This is a private interface with the sweeper. |
duke@435 | 1138 | void nmethod::mark_as_seen_on_stack() { |
duke@435 | 1139 | assert(is_not_entrant(), "must be a non-entrant method"); |
never@1999 | 1140 | // Set the traversal mark to ensure that the sweeper does 2 |
never@1999 | 1141 | // cleaning passes before moving to zombie. |
duke@435 | 1142 | set_stack_traversal_mark(NMethodSweeper::traversal_count()); |
duke@435 | 1143 | } |
duke@435 | 1144 | |
dcubed@2624 | 1145 | // Tell if a non-entrant method can be converted to a zombie (i.e., |
dcubed@2624 | 1146 | // there are no activations on the stack, not in use by the VM, |
dcubed@2624 | 1147 | // and not in use by the ServiceThread) |
duke@435 | 1148 | bool nmethod::can_not_entrant_be_converted() { |
duke@435 | 1149 | assert(is_not_entrant(), "must be a non-entrant method"); |
duke@435 | 1150 | |
duke@435 | 1151 | // Since the nmethod sweeper only does partial sweep the sweeper's traversal |
duke@435 | 1152 | // count can be greater than the stack traversal count before it hits the |
duke@435 | 1153 | // nmethod for the second time. |
dcubed@2624 | 1154 | return stack_traversal_mark()+1 < NMethodSweeper::traversal_count() && |
dcubed@2624 | 1155 | !is_locked_by_vm(); |
duke@435 | 1156 | } |
duke@435 | 1157 | |
duke@435 | 1158 | void nmethod::inc_decompile_count() { |
iveresov@2138 | 1159 | if (!is_compiled_by_c2()) return; |
duke@435 | 1160 | // Could be gated by ProfileTraps, but do not bother... |
duke@435 | 1161 | methodOop m = method(); |
duke@435 | 1162 | if (m == NULL) return; |
duke@435 | 1163 | methodDataOop mdo = m->method_data(); |
duke@435 | 1164 | if (mdo == NULL) return; |
duke@435 | 1165 | // There is a benign race here. See comments in methodDataOop.hpp. |
duke@435 | 1166 | mdo->inc_decompile_count(); |
duke@435 | 1167 | } |
duke@435 | 1168 | |
duke@435 | 1169 | void nmethod::make_unloaded(BoolObjectClosure* is_alive, oop cause) { |
duke@435 | 1170 | |
duke@435 | 1171 | post_compiled_method_unload(); |
duke@435 | 1172 | |
duke@435 | 1173 | // Since this nmethod is being unloaded, make sure that dependencies |
duke@435 | 1174 | // recorded in instanceKlasses get flushed and pass non-NULL closure to |
duke@435 | 1175 | // indicate that this work is being done during a GC. |
duke@435 | 1176 | assert(Universe::heap()->is_gc_active(), "should only be called during gc"); |
duke@435 | 1177 | assert(is_alive != NULL, "Should be non-NULL"); |
duke@435 | 1178 | // A non-NULL is_alive closure indicates that this is being called during GC. |
duke@435 | 1179 | flush_dependencies(is_alive); |
duke@435 | 1180 | |
duke@435 | 1181 | // Break cycle between nmethod & method |
duke@435 | 1182 | if (TraceClassUnloading && WizardMode) { |
duke@435 | 1183 | tty->print_cr("[Class unloading: Making nmethod " INTPTR_FORMAT |
duke@435 | 1184 | " unloadable], methodOop(" INTPTR_FORMAT |
duke@435 | 1185 | "), cause(" INTPTR_FORMAT ")", |
duke@435 | 1186 | this, (address)_method, (address)cause); |
jrose@1424 | 1187 | if (!Universe::heap()->is_gc_active()) |
jrose@1424 | 1188 | cause->klass()->print(); |
duke@435 | 1189 | } |
ysr@1376 | 1190 | // Unlink the osr method, so we do not look this up again |
ysr@1376 | 1191 | if (is_osr_method()) { |
ysr@1376 | 1192 | invalidate_osr_method(); |
ysr@1376 | 1193 | } |
duke@435 | 1194 | // If _method is already NULL the methodOop is about to be unloaded, |
duke@435 | 1195 | // so we don't have to break the cycle. Note that it is possible to |
duke@435 | 1196 | // have the methodOop live here, in case we unload the nmethod because |
duke@435 | 1197 | // it is pointing to some oop (other than the methodOop) being unloaded. |
duke@435 | 1198 | if (_method != NULL) { |
duke@435 | 1199 | // OSR methods point to the methodOop, but the methodOop does not |
duke@435 | 1200 | // point back! |
duke@435 | 1201 | if (_method->code() == this) { |
duke@435 | 1202 | _method->clear_code(); // Break a cycle |
duke@435 | 1203 | } |
duke@435 | 1204 | _method = NULL; // Clear the method of this dead nmethod |
duke@435 | 1205 | } |
duke@435 | 1206 | // Make the class unloaded - i.e., change state and notify sweeper |
never@1893 | 1207 | assert(SafepointSynchronize::is_at_safepoint(), "must be at safepoint"); |
duke@435 | 1208 | if (is_in_use()) { |
duke@435 | 1209 | // Transitioning directly from live to unloaded -- so |
duke@435 | 1210 | // we need to force a cache clean-up; remember this |
duke@435 | 1211 | // for later on. |
duke@435 | 1212 | CodeCache::set_needs_cache_clean(true); |
duke@435 | 1213 | } |
never@1999 | 1214 | _state = unloaded; |
duke@435 | 1215 | |
never@1544 | 1216 | // Log the unloading. |
never@1544 | 1217 | log_state_change(); |
never@1544 | 1218 | |
duke@435 | 1219 | // The methodOop is gone at this point |
duke@435 | 1220 | assert(_method == NULL, "Tautology"); |
duke@435 | 1221 | |
jrose@1424 | 1222 | set_osr_link(NULL); |
jrose@1424 | 1223 | //set_scavenge_root_link(NULL); // done by prune_scavenge_root_nmethods |
duke@435 | 1224 | NMethodSweeper::notify(this); |
duke@435 | 1225 | } |
duke@435 | 1226 | |
duke@435 | 1227 | void nmethod::invalidate_osr_method() { |
duke@435 | 1228 | assert(_entry_bci != InvocationEntryBci, "wrong kind of nmethod"); |
duke@435 | 1229 | // Remove from list of active nmethods |
duke@435 | 1230 | if (method() != NULL) |
duke@435 | 1231 | instanceKlass::cast(method()->method_holder())->remove_osr_nmethod(this); |
duke@435 | 1232 | // Set entry as invalid |
duke@435 | 1233 | _entry_bci = InvalidOSREntryBci; |
duke@435 | 1234 | } |
duke@435 | 1235 | |
never@1544 | 1236 | void nmethod::log_state_change() const { |
duke@435 | 1237 | if (LogCompilation) { |
duke@435 | 1238 | if (xtty != NULL) { |
duke@435 | 1239 | ttyLocker ttyl; // keep the following output all in one block |
never@1999 | 1240 | if (_state == unloaded) { |
never@1544 | 1241 | xtty->begin_elem("make_unloaded thread='" UINTX_FORMAT "'", |
never@1544 | 1242 | os::current_thread_id()); |
never@1544 | 1243 | } else { |
never@1544 | 1244 | xtty->begin_elem("make_not_entrant thread='" UINTX_FORMAT "'%s", |
never@1544 | 1245 | os::current_thread_id(), |
never@1999 | 1246 | (_state == zombie ? " zombie='1'" : "")); |
never@1544 | 1247 | } |
duke@435 | 1248 | log_identity(xtty); |
duke@435 | 1249 | xtty->stamp(); |
duke@435 | 1250 | xtty->end_elem(); |
duke@435 | 1251 | } |
duke@435 | 1252 | } |
never@1999 | 1253 | if (PrintCompilation && _state != unloaded) { |
twisti@2687 | 1254 | print_on(tty, _state == zombie ? "made zombie" : "made not entrant"); |
duke@435 | 1255 | } |
duke@435 | 1256 | } |
duke@435 | 1257 | |
duke@435 | 1258 | // Common functionality for both make_not_entrant and make_zombie |
never@1576 | 1259 | bool nmethod::make_not_entrant_or_zombie(unsigned int state) { |
duke@435 | 1260 | assert(state == zombie || state == not_entrant, "must be zombie or not_entrant"); |
dcubed@2624 | 1261 | assert(!is_zombie(), "should not already be a zombie"); |
duke@435 | 1262 | |
never@1999 | 1263 | // Make sure neither the nmethod nor the method is flushed in case of a safepoint in code below. |
duke@435 | 1264 | nmethodLocker nml(this); |
never@1999 | 1265 | methodHandle the_method(method()); |
never@2081 | 1266 | No_Safepoint_Verifier nsv; |
duke@435 | 1267 | |
duke@435 | 1268 | { |
never@1544 | 1269 | // invalidate osr nmethod before acquiring the patching lock since |
never@1544 | 1270 | // they both acquire leaf locks and we don't want a deadlock. |
never@1544 | 1271 | // This logic is equivalent to the logic below for patching the |
never@1544 | 1272 | // verified entry point of regular methods. |
never@1544 | 1273 | if (is_osr_method()) { |
never@1544 | 1274 | // this effectively makes the osr nmethod not entrant |
never@1544 | 1275 | invalidate_osr_method(); |
never@1544 | 1276 | } |
never@1544 | 1277 | |
duke@435 | 1278 | // Enter critical section. Does not block for safepoint. |
duke@435 | 1279 | MutexLockerEx pl(Patching_lock, Mutex::_no_safepoint_check_flag); |
never@1544 | 1280 | |
never@1999 | 1281 | if (_state == state) { |
never@1544 | 1282 | // another thread already performed this transition so nothing |
never@1544 | 1283 | // to do, but return false to indicate this. |
never@1544 | 1284 | return false; |
never@1544 | 1285 | } |
never@1544 | 1286 | |
duke@435 | 1287 | // The caller can be calling the method statically or through an inline |
duke@435 | 1288 | // cache call. |
never@1544 | 1289 | if (!is_osr_method() && !is_not_entrant()) { |
duke@435 | 1290 | NativeJump::patch_verified_entry(entry_point(), verified_entry_point(), |
duke@435 | 1291 | SharedRuntime::get_handle_wrong_method_stub()); |
duke@435 | 1292 | } |
duke@435 | 1293 | |
never@1999 | 1294 | if (is_in_use()) { |
never@1999 | 1295 | // It's a true state change, so mark the method as decompiled. |
never@1999 | 1296 | // Do it only for transition from alive. |
never@1999 | 1297 | inc_decompile_count(); |
never@1999 | 1298 | } |
kvn@1641 | 1299 | |
duke@435 | 1300 | // Change state |
never@1999 | 1301 | _state = state; |
never@1544 | 1302 | |
never@1544 | 1303 | // Log the transition once |
never@1544 | 1304 | log_state_change(); |
never@1544 | 1305 | |
never@1999 | 1306 | // Remove nmethod from method. |
never@1999 | 1307 | // We need to check if both the _code and _from_compiled_code_entry_point |
never@1999 | 1308 | // refer to this nmethod because there is a race in setting these two fields |
never@1999 | 1309 | // in methodOop as seen in bugid 4947125. |
never@1999 | 1310 | // If the vep() points to the zombie nmethod, the memory for the nmethod |
never@1999 | 1311 | // could be flushed and the compiler and vtable stubs could still call |
never@1999 | 1312 | // through it. |
never@1999 | 1313 | if (method() != NULL && (method()->code() == this || |
never@1999 | 1314 | method()->from_compiled_entry() == verified_entry_point())) { |
never@1999 | 1315 | HandleMark hm; |
never@1999 | 1316 | method()->clear_code(); |
never@1999 | 1317 | } |
never@1999 | 1318 | |
never@1999 | 1319 | if (state == not_entrant) { |
never@1999 | 1320 | mark_as_seen_on_stack(); |
never@1999 | 1321 | } |
never@1999 | 1322 | |
duke@435 | 1323 | } // leave critical region under Patching_lock |
duke@435 | 1324 | |
never@1893 | 1325 | // When the nmethod becomes zombie it is no longer alive so the |
never@1893 | 1326 | // dependencies must be flushed. nmethods in the not_entrant |
never@1893 | 1327 | // state will be flushed later when the transition to zombie |
never@1893 | 1328 | // happens or they get unloaded. |
never@1893 | 1329 | if (state == zombie) { |
never@2081 | 1330 | { |
never@2081 | 1331 | // Flushing dependecies must be done before any possible |
never@2081 | 1332 | // safepoint can sneak in, otherwise the oops used by the |
never@2081 | 1333 | // dependency logic could have become stale. |
never@2081 | 1334 | MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); |
never@2081 | 1335 | flush_dependencies(NULL); |
never@2081 | 1336 | } |
never@1999 | 1337 | |
dcubed@2624 | 1338 | // zombie only - if a JVMTI agent has enabled the CompiledMethodUnload |
dcubed@2624 | 1339 | // event and it hasn't already been reported for this nmethod then |
dcubed@2624 | 1340 | // report it now. The event may have been reported earilier if the GC |
dcubed@2624 | 1341 | // marked it for unloading). JvmtiDeferredEventQueue support means |
dcubed@2624 | 1342 | // we no longer go to a safepoint here. |
dcubed@2624 | 1343 | post_compiled_method_unload(); |
never@2081 | 1344 | |
never@2081 | 1345 | #ifdef ASSERT |
never@2081 | 1346 | // It's no longer safe to access the oops section since zombie |
never@2081 | 1347 | // nmethods aren't scanned for GC. |
never@2081 | 1348 | _oops_are_stale = true; |
never@2081 | 1349 | #endif |
never@1893 | 1350 | } else { |
never@1893 | 1351 | assert(state == not_entrant, "other cases may need to be handled differently"); |
never@1893 | 1352 | } |
never@1893 | 1353 | |
duke@435 | 1354 | if (TraceCreateZombies) { |
duke@435 | 1355 | tty->print_cr("nmethod <" INTPTR_FORMAT "> code made %s", this, (state == not_entrant) ? "not entrant" : "zombie"); |
duke@435 | 1356 | } |
duke@435 | 1357 | |
duke@435 | 1358 | // Make sweeper aware that there is a zombie method that needs to be removed |
duke@435 | 1359 | NMethodSweeper::notify(this); |
duke@435 | 1360 | |
never@1544 | 1361 | return true; |
duke@435 | 1362 | } |
duke@435 | 1363 | |
duke@435 | 1364 | void nmethod::flush() { |
duke@435 | 1365 | // Note that there are no valid oops in the nmethod anymore. |
duke@435 | 1366 | assert(is_zombie() || (is_osr_method() && is_unloaded()), "must be a zombie method"); |
duke@435 | 1367 | assert(is_marked_for_reclamation() || (is_osr_method() && is_unloaded()), "must be marked for reclamation"); |
duke@435 | 1368 | |
duke@435 | 1369 | assert (!is_locked_by_vm(), "locked methods shouldn't be flushed"); |
never@1893 | 1370 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 1371 | |
duke@435 | 1372 | // completely deallocate this method |
duke@435 | 1373 | EventMark m("flushing nmethod " INTPTR_FORMAT " %s", this, ""); |
duke@435 | 1374 | if (PrintMethodFlushing) { |
kvn@1637 | 1375 | tty->print_cr("*flushing nmethod %3d/" INTPTR_FORMAT ". Live blobs:" UINT32_FORMAT "/Free CodeCache:" SIZE_FORMAT "Kb", |
kvn@1637 | 1376 | _compile_id, this, CodeCache::nof_blobs(), CodeCache::unallocated_capacity()/1024); |
duke@435 | 1377 | } |
duke@435 | 1378 | |
duke@435 | 1379 | // We need to deallocate any ExceptionCache data. |
duke@435 | 1380 | // Note that we do not need to grab the nmethod lock for this, it |
duke@435 | 1381 | // better be thread safe if we're disposing of it! |
duke@435 | 1382 | ExceptionCache* ec = exception_cache(); |
duke@435 | 1383 | set_exception_cache(NULL); |
duke@435 | 1384 | while(ec != NULL) { |
duke@435 | 1385 | ExceptionCache* next = ec->next(); |
duke@435 | 1386 | delete ec; |
duke@435 | 1387 | ec = next; |
duke@435 | 1388 | } |
duke@435 | 1389 | |
jrose@1424 | 1390 | if (on_scavenge_root_list()) { |
jrose@1424 | 1391 | CodeCache::drop_scavenge_root_nmethod(this); |
jrose@1424 | 1392 | } |
jrose@1424 | 1393 | |
kvn@1637 | 1394 | if (is_speculatively_disconnected()) { |
kvn@1637 | 1395 | CodeCache::remove_saved_code(this); |
kvn@1637 | 1396 | } |
kvn@1637 | 1397 | |
twisti@2047 | 1398 | #ifdef SHARK |
twisti@2200 | 1399 | ((SharkCompiler *) compiler())->free_compiled_method(insts_begin()); |
twisti@2047 | 1400 | #endif // SHARK |
twisti@2047 | 1401 | |
duke@435 | 1402 | ((CodeBlob*)(this))->flush(); |
duke@435 | 1403 | |
duke@435 | 1404 | CodeCache::free(this); |
duke@435 | 1405 | } |
duke@435 | 1406 | |
duke@435 | 1407 | |
duke@435 | 1408 | // |
duke@435 | 1409 | // Notify all classes this nmethod is dependent on that it is no |
duke@435 | 1410 | // longer dependent. This should only be called in two situations. |
duke@435 | 1411 | // First, when a nmethod transitions to a zombie all dependents need |
duke@435 | 1412 | // to be clear. Since zombification happens at a safepoint there's no |
duke@435 | 1413 | // synchronization issues. The second place is a little more tricky. |
duke@435 | 1414 | // During phase 1 of mark sweep class unloading may happen and as a |
duke@435 | 1415 | // result some nmethods may get unloaded. In this case the flushing |
duke@435 | 1416 | // of dependencies must happen during phase 1 since after GC any |
duke@435 | 1417 | // dependencies in the unloaded nmethod won't be updated, so |
duke@435 | 1418 | // traversing the dependency information in unsafe. In that case this |
duke@435 | 1419 | // function is called with a non-NULL argument and this function only |
duke@435 | 1420 | // notifies instanceKlasses that are reachable |
duke@435 | 1421 | |
duke@435 | 1422 | void nmethod::flush_dependencies(BoolObjectClosure* is_alive) { |
never@1893 | 1423 | assert_locked_or_safepoint(CodeCache_lock); |
duke@435 | 1424 | assert(Universe::heap()->is_gc_active() == (is_alive != NULL), |
duke@435 | 1425 | "is_alive is non-NULL if and only if we are called during GC"); |
duke@435 | 1426 | if (!has_flushed_dependencies()) { |
duke@435 | 1427 | set_has_flushed_dependencies(); |
duke@435 | 1428 | for (Dependencies::DepStream deps(this); deps.next(); ) { |
duke@435 | 1429 | klassOop klass = deps.context_type(); |
duke@435 | 1430 | if (klass == NULL) continue; // ignore things like evol_method |
duke@435 | 1431 | |
duke@435 | 1432 | // During GC the is_alive closure is non-NULL, and is used to |
duke@435 | 1433 | // determine liveness of dependees that need to be updated. |
duke@435 | 1434 | if (is_alive == NULL || is_alive->do_object_b(klass)) { |
duke@435 | 1435 | instanceKlass::cast(klass)->remove_dependent_nmethod(this); |
duke@435 | 1436 | } |
duke@435 | 1437 | } |
duke@435 | 1438 | } |
duke@435 | 1439 | } |
duke@435 | 1440 | |
duke@435 | 1441 | |
duke@435 | 1442 | // If this oop is not live, the nmethod can be unloaded. |
duke@435 | 1443 | bool nmethod::can_unload(BoolObjectClosure* is_alive, |
duke@435 | 1444 | OopClosure* keep_alive, |
duke@435 | 1445 | oop* root, bool unloading_occurred) { |
duke@435 | 1446 | assert(root != NULL, "just checking"); |
duke@435 | 1447 | oop obj = *root; |
duke@435 | 1448 | if (obj == NULL || is_alive->do_object_b(obj)) { |
duke@435 | 1449 | return false; |
duke@435 | 1450 | } |
duke@435 | 1451 | if (obj->is_compiledICHolder()) { |
duke@435 | 1452 | compiledICHolderOop cichk_oop = compiledICHolderOop(obj); |
duke@435 | 1453 | if (is_alive->do_object_b( |
duke@435 | 1454 | cichk_oop->holder_method()->method_holder()) && |
duke@435 | 1455 | is_alive->do_object_b(cichk_oop->holder_klass())) { |
duke@435 | 1456 | // The oop should be kept alive |
duke@435 | 1457 | keep_alive->do_oop(root); |
duke@435 | 1458 | return false; |
duke@435 | 1459 | } |
duke@435 | 1460 | } |
jrose@1424 | 1461 | // If ScavengeRootsInCode is true, an nmethod might be unloaded |
jrose@1424 | 1462 | // simply because one of its constant oops has gone dead. |
jrose@1424 | 1463 | // No actual classes need to be unloaded in order for this to occur. |
jrose@1424 | 1464 | assert(unloading_occurred || ScavengeRootsInCode, "Inconsistency in unloading"); |
duke@435 | 1465 | make_unloaded(is_alive, obj); |
duke@435 | 1466 | return true; |
duke@435 | 1467 | } |
duke@435 | 1468 | |
duke@435 | 1469 | // ------------------------------------------------------------------ |
duke@435 | 1470 | // post_compiled_method_load_event |
duke@435 | 1471 | // new method for install_code() path |
duke@435 | 1472 | // Transfer information from compilation to jvmti |
duke@435 | 1473 | void nmethod::post_compiled_method_load_event() { |
duke@435 | 1474 | |
duke@435 | 1475 | methodOop moop = method(); |
duke@435 | 1476 | HS_DTRACE_PROBE8(hotspot, compiled__method__load, |
duke@435 | 1477 | moop->klass_name()->bytes(), |
duke@435 | 1478 | moop->klass_name()->utf8_length(), |
duke@435 | 1479 | moop->name()->bytes(), |
duke@435 | 1480 | moop->name()->utf8_length(), |
duke@435 | 1481 | moop->signature()->bytes(), |
duke@435 | 1482 | moop->signature()->utf8_length(), |
twisti@2103 | 1483 | insts_begin(), insts_size()); |
duke@435 | 1484 | |
never@1971 | 1485 | if (JvmtiExport::should_post_compiled_method_load() || |
never@1971 | 1486 | JvmtiExport::should_post_compiled_method_unload()) { |
never@1971 | 1487 | get_and_cache_jmethod_id(); |
never@1971 | 1488 | } |
never@1971 | 1489 | |
duke@435 | 1490 | if (JvmtiExport::should_post_compiled_method_load()) { |
kamg@2511 | 1491 | // Let the Service thread (which is a real Java thread) post the event |
kamg@2511 | 1492 | MutexLockerEx ml(Service_lock, Mutex::_no_safepoint_check_flag); |
kamg@2511 | 1493 | JvmtiDeferredEventQueue::enqueue( |
kamg@2511 | 1494 | JvmtiDeferredEvent::compiled_method_load_event(this)); |
duke@435 | 1495 | } |
duke@435 | 1496 | } |
duke@435 | 1497 | |
never@1971 | 1498 | jmethodID nmethod::get_and_cache_jmethod_id() { |
never@1971 | 1499 | if (_jmethod_id == NULL) { |
never@1971 | 1500 | // Cache the jmethod_id since it can no longer be looked up once the |
never@1971 | 1501 | // method itself has been marked for unloading. |
never@1971 | 1502 | _jmethod_id = method()->jmethod_id(); |
never@1971 | 1503 | } |
never@1971 | 1504 | return _jmethod_id; |
never@1971 | 1505 | } |
never@1971 | 1506 | |
duke@435 | 1507 | void nmethod::post_compiled_method_unload() { |
never@1932 | 1508 | if (unload_reported()) { |
never@1932 | 1509 | // During unloading we transition to unloaded and then to zombie |
never@1932 | 1510 | // and the unloading is reported during the first transition. |
never@1932 | 1511 | return; |
never@1932 | 1512 | } |
never@1932 | 1513 | |
duke@435 | 1514 | assert(_method != NULL && !is_unloaded(), "just checking"); |
duke@435 | 1515 | DTRACE_METHOD_UNLOAD_PROBE(method()); |
duke@435 | 1516 | |
duke@435 | 1517 | // If a JVMTI agent has enabled the CompiledMethodUnload event then |
never@1971 | 1518 | // post the event. Sometime later this nmethod will be made a zombie |
never@1971 | 1519 | // by the sweeper but the methodOop will not be valid at that point. |
never@1971 | 1520 | // If the _jmethod_id is null then no load event was ever requested |
never@1971 | 1521 | // so don't bother posting the unload. The main reason for this is |
never@1971 | 1522 | // that the jmethodID is a weak reference to the methodOop so if |
never@1971 | 1523 | // it's being unloaded there's no way to look it up since the weak |
never@1971 | 1524 | // ref will have been cleared. |
never@1971 | 1525 | if (_jmethod_id != NULL && JvmtiExport::should_post_compiled_method_unload()) { |
duke@435 | 1526 | assert(!unload_reported(), "already unloaded"); |
kamg@2511 | 1527 | JvmtiDeferredEvent event = |
dcubed@2624 | 1528 | JvmtiDeferredEvent::compiled_method_unload_event(this, |
kamg@2511 | 1529 | _jmethod_id, insts_begin()); |
kamg@2511 | 1530 | if (SafepointSynchronize::is_at_safepoint()) { |
kamg@2511 | 1531 | // Don't want to take the queueing lock. Add it as pending and |
kamg@2511 | 1532 | // it will get enqueued later. |
kamg@2511 | 1533 | JvmtiDeferredEventQueue::add_pending_event(event); |
kamg@2511 | 1534 | } else { |
kamg@2511 | 1535 | MutexLockerEx ml(Service_lock, Mutex::_no_safepoint_check_flag); |
kamg@2511 | 1536 | JvmtiDeferredEventQueue::enqueue(event); |
kamg@2511 | 1537 | } |
duke@435 | 1538 | } |
duke@435 | 1539 | |
duke@435 | 1540 | // The JVMTI CompiledMethodUnload event can be enabled or disabled at |
duke@435 | 1541 | // any time. As the nmethod is being unloaded now we mark it has |
duke@435 | 1542 | // having the unload event reported - this will ensure that we don't |
duke@435 | 1543 | // attempt to report the event in the unlikely scenario where the |
duke@435 | 1544 | // event is enabled at the time the nmethod is made a zombie. |
duke@435 | 1545 | set_unload_reported(); |
duke@435 | 1546 | } |
duke@435 | 1547 | |
duke@435 | 1548 | // This is called at the end of the strong tracing/marking phase of a |
duke@435 | 1549 | // GC to unload an nmethod if it contains otherwise unreachable |
duke@435 | 1550 | // oops. |
duke@435 | 1551 | |
duke@435 | 1552 | void nmethod::do_unloading(BoolObjectClosure* is_alive, |
duke@435 | 1553 | OopClosure* keep_alive, bool unloading_occurred) { |
duke@435 | 1554 | // Make sure the oop's ready to receive visitors |
duke@435 | 1555 | assert(!is_zombie() && !is_unloaded(), |
duke@435 | 1556 | "should not call follow on zombie or unloaded nmethod"); |
duke@435 | 1557 | |
duke@435 | 1558 | // If the method is not entrant then a JMP is plastered over the |
duke@435 | 1559 | // first few bytes. If an oop in the old code was there, that oop |
duke@435 | 1560 | // should not get GC'd. Skip the first few bytes of oops on |
duke@435 | 1561 | // not-entrant methods. |
duke@435 | 1562 | address low_boundary = verified_entry_point(); |
duke@435 | 1563 | if (is_not_entrant()) { |
duke@435 | 1564 | low_boundary += NativeJump::instruction_size; |
duke@435 | 1565 | // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump. |
duke@435 | 1566 | // (See comment above.) |
duke@435 | 1567 | } |
duke@435 | 1568 | |
duke@435 | 1569 | // The RedefineClasses() API can cause the class unloading invariant |
duke@435 | 1570 | // to no longer be true. See jvmtiExport.hpp for details. |
duke@435 | 1571 | // Also, leave a debugging breadcrumb in local flag. |
duke@435 | 1572 | bool a_class_was_redefined = JvmtiExport::has_redefined_a_class(); |
duke@435 | 1573 | if (a_class_was_redefined) { |
duke@435 | 1574 | // This set of the unloading_occurred flag is done before the |
duke@435 | 1575 | // call to post_compiled_method_unload() so that the unloading |
duke@435 | 1576 | // of this nmethod is reported. |
duke@435 | 1577 | unloading_occurred = true; |
duke@435 | 1578 | } |
duke@435 | 1579 | |
duke@435 | 1580 | // Follow methodOop |
duke@435 | 1581 | if (can_unload(is_alive, keep_alive, (oop*)&_method, unloading_occurred)) { |
duke@435 | 1582 | return; |
duke@435 | 1583 | } |
duke@435 | 1584 | |
duke@435 | 1585 | // Exception cache |
duke@435 | 1586 | ExceptionCache* ec = exception_cache(); |
duke@435 | 1587 | while (ec != NULL) { |
duke@435 | 1588 | oop* ex_addr = (oop*)ec->exception_type_addr(); |
duke@435 | 1589 | oop ex = *ex_addr; |
duke@435 | 1590 | ExceptionCache* next_ec = ec->next(); |
duke@435 | 1591 | if (ex != NULL && !is_alive->do_object_b(ex)) { |
duke@435 | 1592 | assert(!ex->is_compiledICHolder(), "Possible error here"); |
duke@435 | 1593 | remove_from_exception_cache(ec); |
duke@435 | 1594 | } |
duke@435 | 1595 | ec = next_ec; |
duke@435 | 1596 | } |
duke@435 | 1597 | |
duke@435 | 1598 | // If class unloading occurred we first iterate over all inline caches and |
duke@435 | 1599 | // clear ICs where the cached oop is referring to an unloaded klass or method. |
duke@435 | 1600 | // The remaining live cached oops will be traversed in the relocInfo::oop_type |
duke@435 | 1601 | // iteration below. |
duke@435 | 1602 | if (unloading_occurred) { |
duke@435 | 1603 | RelocIterator iter(this, low_boundary); |
duke@435 | 1604 | while(iter.next()) { |
duke@435 | 1605 | if (iter.type() == relocInfo::virtual_call_type) { |
duke@435 | 1606 | CompiledIC *ic = CompiledIC_at(iter.reloc()); |
duke@435 | 1607 | oop ic_oop = ic->cached_oop(); |
duke@435 | 1608 | if (ic_oop != NULL && !is_alive->do_object_b(ic_oop)) { |
duke@435 | 1609 | // The only exception is compiledICHolder oops which may |
duke@435 | 1610 | // yet be marked below. (We check this further below). |
duke@435 | 1611 | if (ic_oop->is_compiledICHolder()) { |
duke@435 | 1612 | compiledICHolderOop cichk_oop = compiledICHolderOop(ic_oop); |
duke@435 | 1613 | if (is_alive->do_object_b( |
duke@435 | 1614 | cichk_oop->holder_method()->method_holder()) && |
duke@435 | 1615 | is_alive->do_object_b(cichk_oop->holder_klass())) { |
duke@435 | 1616 | continue; |
duke@435 | 1617 | } |
duke@435 | 1618 | } |
duke@435 | 1619 | ic->set_to_clean(); |
jcoomes@1844 | 1620 | assert(ic->cached_oop() == NULL, |
jcoomes@1844 | 1621 | "cached oop in IC should be cleared"); |
duke@435 | 1622 | } |
duke@435 | 1623 | } |
duke@435 | 1624 | } |
duke@435 | 1625 | } |
duke@435 | 1626 | |
duke@435 | 1627 | // Compiled code |
duke@435 | 1628 | RelocIterator iter(this, low_boundary); |
duke@435 | 1629 | while (iter.next()) { |
duke@435 | 1630 | if (iter.type() == relocInfo::oop_type) { |
duke@435 | 1631 | oop_Relocation* r = iter.oop_reloc(); |
duke@435 | 1632 | // In this loop, we must only traverse those oops directly embedded in |
duke@435 | 1633 | // the code. Other oops (oop_index>0) are seen as part of scopes_oops. |
duke@435 | 1634 | assert(1 == (r->oop_is_immediate()) + |
duke@435 | 1635 | (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()), |
duke@435 | 1636 | "oop must be found in exactly one place"); |
duke@435 | 1637 | if (r->oop_is_immediate() && r->oop_value() != NULL) { |
duke@435 | 1638 | if (can_unload(is_alive, keep_alive, r->oop_addr(), unloading_occurred)) { |
duke@435 | 1639 | return; |
duke@435 | 1640 | } |
duke@435 | 1641 | } |
duke@435 | 1642 | } |
duke@435 | 1643 | } |
duke@435 | 1644 | |
duke@435 | 1645 | |
duke@435 | 1646 | // Scopes |
duke@435 | 1647 | for (oop* p = oops_begin(); p < oops_end(); p++) { |
duke@435 | 1648 | if (*p == Universe::non_oop_word()) continue; // skip non-oops |
duke@435 | 1649 | if (can_unload(is_alive, keep_alive, p, unloading_occurred)) { |
duke@435 | 1650 | return; |
duke@435 | 1651 | } |
duke@435 | 1652 | } |
duke@435 | 1653 | |
duke@435 | 1654 | #ifndef PRODUCT |
duke@435 | 1655 | // This nmethod was not unloaded; check below that all CompiledICs |
duke@435 | 1656 | // refer to marked oops. |
duke@435 | 1657 | { |
duke@435 | 1658 | RelocIterator iter(this, low_boundary); |
duke@435 | 1659 | while (iter.next()) { |
duke@435 | 1660 | if (iter.type() == relocInfo::virtual_call_type) { |
duke@435 | 1661 | CompiledIC *ic = CompiledIC_at(iter.reloc()); |
duke@435 | 1662 | oop ic_oop = ic->cached_oop(); |
duke@435 | 1663 | assert(ic_oop == NULL || is_alive->do_object_b(ic_oop), |
duke@435 | 1664 | "Found unmarked ic_oop in reachable nmethod"); |
duke@435 | 1665 | } |
duke@435 | 1666 | } |
duke@435 | 1667 | } |
duke@435 | 1668 | #endif // !PRODUCT |
duke@435 | 1669 | } |
duke@435 | 1670 | |
ysr@1376 | 1671 | // This method is called twice during GC -- once while |
ysr@1376 | 1672 | // tracing the "active" nmethods on thread stacks during |
ysr@1376 | 1673 | // the (strong) marking phase, and then again when walking |
ysr@1376 | 1674 | // the code cache contents during the weak roots processing |
ysr@1376 | 1675 | // phase. The two uses are distinguished by means of the |
jrose@1429 | 1676 | // 'do_strong_roots_only' flag, which is true in the first |
ysr@1376 | 1677 | // case. We want to walk the weak roots in the nmethod |
ysr@1376 | 1678 | // only in the second case. The weak roots in the nmethod |
ysr@1376 | 1679 | // are the oops in the ExceptionCache and the InlineCache |
ysr@1376 | 1680 | // oops. |
jrose@1429 | 1681 | void nmethod::oops_do(OopClosure* f, bool do_strong_roots_only) { |
duke@435 | 1682 | // make sure the oops ready to receive visitors |
duke@435 | 1683 | assert(!is_zombie() && !is_unloaded(), |
duke@435 | 1684 | "should not call follow on zombie or unloaded nmethod"); |
duke@435 | 1685 | |
duke@435 | 1686 | // If the method is not entrant or zombie then a JMP is plastered over the |
duke@435 | 1687 | // first few bytes. If an oop in the old code was there, that oop |
duke@435 | 1688 | // should not get GC'd. Skip the first few bytes of oops on |
duke@435 | 1689 | // not-entrant methods. |
duke@435 | 1690 | address low_boundary = verified_entry_point(); |
duke@435 | 1691 | if (is_not_entrant()) { |
duke@435 | 1692 | low_boundary += NativeJump::instruction_size; |
duke@435 | 1693 | // %%% Note: On SPARC we patch only a 4-byte trap, not a full NativeJump. |
duke@435 | 1694 | // (See comment above.) |
duke@435 | 1695 | } |
duke@435 | 1696 | |
duke@435 | 1697 | // Compiled code |
duke@435 | 1698 | f->do_oop((oop*) &_method); |
jrose@1429 | 1699 | if (!do_strong_roots_only) { |
ysr@1376 | 1700 | // weak roots processing phase -- update ExceptionCache oops |
ysr@1376 | 1701 | ExceptionCache* ec = exception_cache(); |
ysr@1376 | 1702 | while(ec != NULL) { |
ysr@1376 | 1703 | f->do_oop((oop*)ec->exception_type_addr()); |
ysr@1376 | 1704 | ec = ec->next(); |
ysr@1376 | 1705 | } |
ysr@1376 | 1706 | } // Else strong roots phase -- skip oops in ExceptionCache |
duke@435 | 1707 | |
duke@435 | 1708 | RelocIterator iter(this, low_boundary); |
ysr@1376 | 1709 | |
duke@435 | 1710 | while (iter.next()) { |
duke@435 | 1711 | if (iter.type() == relocInfo::oop_type ) { |
duke@435 | 1712 | oop_Relocation* r = iter.oop_reloc(); |
duke@435 | 1713 | // In this loop, we must only follow those oops directly embedded in |
duke@435 | 1714 | // the code. Other oops (oop_index>0) are seen as part of scopes_oops. |
ysr@1376 | 1715 | assert(1 == (r->oop_is_immediate()) + |
ysr@1376 | 1716 | (r->oop_addr() >= oops_begin() && r->oop_addr() < oops_end()), |
ysr@1376 | 1717 | "oop must be found in exactly one place"); |
duke@435 | 1718 | if (r->oop_is_immediate() && r->oop_value() != NULL) { |
duke@435 | 1719 | f->do_oop(r->oop_addr()); |
duke@435 | 1720 | } |
duke@435 | 1721 | } |
duke@435 | 1722 | } |
duke@435 | 1723 | |
duke@435 | 1724 | // Scopes |
jrose@1424 | 1725 | // This includes oop constants not inlined in the code stream. |
duke@435 | 1726 | for (oop* p = oops_begin(); p < oops_end(); p++) { |
duke@435 | 1727 | if (*p == Universe::non_oop_word()) continue; // skip non-oops |
duke@435 | 1728 | f->do_oop(p); |
duke@435 | 1729 | } |
duke@435 | 1730 | } |
duke@435 | 1731 | |
jrose@1424 | 1732 | #define NMETHOD_SENTINEL ((nmethod*)badAddress) |
jrose@1424 | 1733 | |
jrose@1424 | 1734 | nmethod* volatile nmethod::_oops_do_mark_nmethods; |
jrose@1424 | 1735 | |
jrose@1424 | 1736 | // An nmethod is "marked" if its _mark_link is set non-null. |
jrose@1424 | 1737 | // Even if it is the end of the linked list, it will have a non-null link value, |
jrose@1424 | 1738 | // as long as it is on the list. |
jrose@1424 | 1739 | // This code must be MP safe, because it is used from parallel GC passes. |
jrose@1424 | 1740 | bool nmethod::test_set_oops_do_mark() { |
jrose@1424 | 1741 | assert(nmethod::oops_do_marking_is_active(), "oops_do_marking_prologue must be called"); |
jrose@1424 | 1742 | nmethod* observed_mark_link = _oops_do_mark_link; |
jrose@1424 | 1743 | if (observed_mark_link == NULL) { |
jrose@1424 | 1744 | // Claim this nmethod for this thread to mark. |
jrose@1424 | 1745 | observed_mark_link = (nmethod*) |
jrose@1424 | 1746 | Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_link, NULL); |
jrose@1424 | 1747 | if (observed_mark_link == NULL) { |
jrose@1424 | 1748 | |
jrose@1424 | 1749 | // Atomically append this nmethod (now claimed) to the head of the list: |
jrose@1424 | 1750 | nmethod* observed_mark_nmethods = _oops_do_mark_nmethods; |
jrose@1424 | 1751 | for (;;) { |
jrose@1424 | 1752 | nmethod* required_mark_nmethods = observed_mark_nmethods; |
jrose@1424 | 1753 | _oops_do_mark_link = required_mark_nmethods; |
jrose@1424 | 1754 | observed_mark_nmethods = (nmethod*) |
jrose@1424 | 1755 | Atomic::cmpxchg_ptr(this, &_oops_do_mark_nmethods, required_mark_nmethods); |
jrose@1424 | 1756 | if (observed_mark_nmethods == required_mark_nmethods) |
jrose@1424 | 1757 | break; |
jrose@1424 | 1758 | } |
jrose@1424 | 1759 | // Mark was clear when we first saw this guy. |
twisti@2687 | 1760 | NOT_PRODUCT(if (TraceScavenge) print_on(tty, "oops_do, mark")); |
jrose@1424 | 1761 | return false; |
jrose@1424 | 1762 | } |
jrose@1424 | 1763 | } |
jrose@1424 | 1764 | // On fall through, another racing thread marked this nmethod before we did. |
jrose@1424 | 1765 | return true; |
jrose@1424 | 1766 | } |
jrose@1424 | 1767 | |
jrose@1424 | 1768 | void nmethod::oops_do_marking_prologue() { |
jrose@1424 | 1769 | NOT_PRODUCT(if (TraceScavenge) tty->print_cr("[oops_do_marking_prologue")); |
jrose@1424 | 1770 | assert(_oops_do_mark_nmethods == NULL, "must not call oops_do_marking_prologue twice in a row"); |
jrose@1424 | 1771 | // We use cmpxchg_ptr instead of regular assignment here because the user |
jrose@1424 | 1772 | // may fork a bunch of threads, and we need them all to see the same state. |
jrose@1424 | 1773 | void* observed = Atomic::cmpxchg_ptr(NMETHOD_SENTINEL, &_oops_do_mark_nmethods, NULL); |
jrose@1424 | 1774 | guarantee(observed == NULL, "no races in this sequential code"); |
jrose@1424 | 1775 | } |
jrose@1424 | 1776 | |
jrose@1424 | 1777 | void nmethod::oops_do_marking_epilogue() { |
jrose@1424 | 1778 | assert(_oops_do_mark_nmethods != NULL, "must not call oops_do_marking_epilogue twice in a row"); |
jrose@1424 | 1779 | nmethod* cur = _oops_do_mark_nmethods; |
jrose@1424 | 1780 | while (cur != NMETHOD_SENTINEL) { |
jrose@1424 | 1781 | assert(cur != NULL, "not NULL-terminated"); |
jrose@1424 | 1782 | nmethod* next = cur->_oops_do_mark_link; |
jrose@1424 | 1783 | cur->_oops_do_mark_link = NULL; |
never@2657 | 1784 | cur->fix_oop_relocations(); |
twisti@2687 | 1785 | NOT_PRODUCT(if (TraceScavenge) cur->print_on(tty, "oops_do, unmark")); |
jrose@1424 | 1786 | cur = next; |
jrose@1424 | 1787 | } |
jrose@1424 | 1788 | void* required = _oops_do_mark_nmethods; |
jrose@1424 | 1789 | void* observed = Atomic::cmpxchg_ptr(NULL, &_oops_do_mark_nmethods, required); |
jrose@1424 | 1790 | guarantee(observed == required, "no races in this sequential code"); |
jrose@1424 | 1791 | NOT_PRODUCT(if (TraceScavenge) tty->print_cr("oops_do_marking_epilogue]")); |
jrose@1424 | 1792 | } |
jrose@1424 | 1793 | |
jrose@1424 | 1794 | class DetectScavengeRoot: public OopClosure { |
jrose@1424 | 1795 | bool _detected_scavenge_root; |
jrose@1424 | 1796 | public: |
jrose@1424 | 1797 | DetectScavengeRoot() : _detected_scavenge_root(false) |
jrose@1424 | 1798 | { NOT_PRODUCT(_print_nm = NULL); } |
jrose@1424 | 1799 | bool detected_scavenge_root() { return _detected_scavenge_root; } |
jrose@1424 | 1800 | virtual void do_oop(oop* p) { |
jrose@1424 | 1801 | if ((*p) != NULL && (*p)->is_scavengable()) { |
jrose@1424 | 1802 | NOT_PRODUCT(maybe_print(p)); |
jrose@1424 | 1803 | _detected_scavenge_root = true; |
jrose@1424 | 1804 | } |
jrose@1424 | 1805 | } |
jrose@1424 | 1806 | virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); } |
jrose@1424 | 1807 | |
jrose@1424 | 1808 | #ifndef PRODUCT |
jrose@1424 | 1809 | nmethod* _print_nm; |
jrose@1424 | 1810 | void maybe_print(oop* p) { |
jrose@1424 | 1811 | if (_print_nm == NULL) return; |
jrose@1424 | 1812 | if (!_detected_scavenge_root) _print_nm->print_on(tty, "new scavenge root"); |
jrose@1424 | 1813 | tty->print_cr(""PTR_FORMAT"[offset=%d] detected non-perm oop "PTR_FORMAT" (found at "PTR_FORMAT")", |
jrose@1424 | 1814 | _print_nm, (int)((intptr_t)p - (intptr_t)_print_nm), |
jrose@1424 | 1815 | (intptr_t)(*p), (intptr_t)p); |
jrose@1424 | 1816 | (*p)->print(); |
jrose@1424 | 1817 | } |
jrose@1424 | 1818 | #endif //PRODUCT |
jrose@1424 | 1819 | }; |
jrose@1424 | 1820 | |
jrose@1424 | 1821 | bool nmethod::detect_scavenge_root_oops() { |
jrose@1424 | 1822 | DetectScavengeRoot detect_scavenge_root; |
jrose@1424 | 1823 | NOT_PRODUCT(if (TraceScavenge) detect_scavenge_root._print_nm = this); |
jrose@1424 | 1824 | oops_do(&detect_scavenge_root); |
jrose@1424 | 1825 | return detect_scavenge_root.detected_scavenge_root(); |
jrose@1424 | 1826 | } |
jrose@1424 | 1827 | |
duke@435 | 1828 | // Method that knows how to preserve outgoing arguments at call. This method must be |
duke@435 | 1829 | // called with a frame corresponding to a Java invoke |
duke@435 | 1830 | void nmethod::preserve_callee_argument_oops(frame fr, const RegisterMap *reg_map, OopClosure* f) { |
twisti@2047 | 1831 | #ifndef SHARK |
duke@435 | 1832 | if (!method()->is_native()) { |
duke@435 | 1833 | SimpleScopeDesc ssd(this, fr.pc()); |
never@2462 | 1834 | Bytecode_invoke call(ssd.method(), ssd.bci()); |
never@2462 | 1835 | bool has_receiver = call.has_receiver(); |
coleenp@2497 | 1836 | Symbol* signature = call.signature(); |
twisti@1573 | 1837 | fr.oops_compiled_arguments_do(signature, has_receiver, reg_map, f); |
duke@435 | 1838 | } |
twisti@2047 | 1839 | #endif // !SHARK |
duke@435 | 1840 | } |
duke@435 | 1841 | |
duke@435 | 1842 | |
duke@435 | 1843 | oop nmethod::embeddedOop_at(u_char* p) { |
never@2631 | 1844 | RelocIterator iter(this, p, p + 1); |
duke@435 | 1845 | while (iter.next()) |
duke@435 | 1846 | if (iter.type() == relocInfo::oop_type) { |
duke@435 | 1847 | return iter.oop_reloc()->oop_value(); |
duke@435 | 1848 | } |
duke@435 | 1849 | return NULL; |
duke@435 | 1850 | } |
duke@435 | 1851 | |
duke@435 | 1852 | |
duke@435 | 1853 | inline bool includes(void* p, void* from, void* to) { |
duke@435 | 1854 | return from <= p && p < to; |
duke@435 | 1855 | } |
duke@435 | 1856 | |
duke@435 | 1857 | |
duke@435 | 1858 | void nmethod::copy_scopes_pcs(PcDesc* pcs, int count) { |
duke@435 | 1859 | assert(count >= 2, "must be sentinel values, at least"); |
duke@435 | 1860 | |
duke@435 | 1861 | #ifdef ASSERT |
duke@435 | 1862 | // must be sorted and unique; we do a binary search in find_pc_desc() |
duke@435 | 1863 | int prev_offset = pcs[0].pc_offset(); |
duke@435 | 1864 | assert(prev_offset == PcDesc::lower_offset_limit, |
duke@435 | 1865 | "must start with a sentinel"); |
duke@435 | 1866 | for (int i = 1; i < count; i++) { |
duke@435 | 1867 | int this_offset = pcs[i].pc_offset(); |
duke@435 | 1868 | assert(this_offset > prev_offset, "offsets must be sorted"); |
duke@435 | 1869 | prev_offset = this_offset; |
duke@435 | 1870 | } |
duke@435 | 1871 | assert(prev_offset == PcDesc::upper_offset_limit, |
duke@435 | 1872 | "must end with a sentinel"); |
duke@435 | 1873 | #endif //ASSERT |
duke@435 | 1874 | |
twisti@1570 | 1875 | // Search for MethodHandle invokes and tag the nmethod. |
twisti@1570 | 1876 | for (int i = 0; i < count; i++) { |
twisti@1570 | 1877 | if (pcs[i].is_method_handle_invoke()) { |
twisti@1570 | 1878 | set_has_method_handle_invokes(true); |
twisti@1570 | 1879 | break; |
twisti@1570 | 1880 | } |
twisti@1570 | 1881 | } |
twisti@2406 | 1882 | assert(has_method_handle_invokes() == (_deoptimize_mh_offset != -1), "must have deopt mh handler"); |
twisti@1570 | 1883 | |
duke@435 | 1884 | int size = count * sizeof(PcDesc); |
duke@435 | 1885 | assert(scopes_pcs_size() >= size, "oob"); |
duke@435 | 1886 | memcpy(scopes_pcs_begin(), pcs, size); |
duke@435 | 1887 | |
duke@435 | 1888 | // Adjust the final sentinel downward. |
duke@435 | 1889 | PcDesc* last_pc = &scopes_pcs_begin()[count-1]; |
duke@435 | 1890 | assert(last_pc->pc_offset() == PcDesc::upper_offset_limit, "sanity"); |
twisti@2103 | 1891 | last_pc->set_pc_offset(content_size() + 1); |
duke@435 | 1892 | for (; last_pc + 1 < scopes_pcs_end(); last_pc += 1) { |
duke@435 | 1893 | // Fill any rounding gaps with copies of the last record. |
duke@435 | 1894 | last_pc[1] = last_pc[0]; |
duke@435 | 1895 | } |
duke@435 | 1896 | // The following assert could fail if sizeof(PcDesc) is not |
duke@435 | 1897 | // an integral multiple of oopSize (the rounding term). |
duke@435 | 1898 | // If it fails, change the logic to always allocate a multiple |
duke@435 | 1899 | // of sizeof(PcDesc), and fill unused words with copies of *last_pc. |
duke@435 | 1900 | assert(last_pc + 1 == scopes_pcs_end(), "must match exactly"); |
duke@435 | 1901 | } |
duke@435 | 1902 | |
duke@435 | 1903 | void nmethod::copy_scopes_data(u_char* buffer, int size) { |
duke@435 | 1904 | assert(scopes_data_size() >= size, "oob"); |
duke@435 | 1905 | memcpy(scopes_data_begin(), buffer, size); |
duke@435 | 1906 | } |
duke@435 | 1907 | |
duke@435 | 1908 | |
duke@435 | 1909 | #ifdef ASSERT |
duke@435 | 1910 | static PcDesc* linear_search(nmethod* nm, int pc_offset, bool approximate) { |
duke@435 | 1911 | PcDesc* lower = nm->scopes_pcs_begin(); |
duke@435 | 1912 | PcDesc* upper = nm->scopes_pcs_end(); |
duke@435 | 1913 | lower += 1; // exclude initial sentinel |
duke@435 | 1914 | PcDesc* res = NULL; |
duke@435 | 1915 | for (PcDesc* p = lower; p < upper; p++) { |
duke@435 | 1916 | NOT_PRODUCT(--nmethod_stats.pc_desc_tests); // don't count this call to match_desc |
duke@435 | 1917 | if (match_desc(p, pc_offset, approximate)) { |
duke@435 | 1918 | if (res == NULL) |
duke@435 | 1919 | res = p; |
duke@435 | 1920 | else |
duke@435 | 1921 | res = (PcDesc*) badAddress; |
duke@435 | 1922 | } |
duke@435 | 1923 | } |
duke@435 | 1924 | return res; |
duke@435 | 1925 | } |
duke@435 | 1926 | #endif |
duke@435 | 1927 | |
duke@435 | 1928 | |
duke@435 | 1929 | // Finds a PcDesc with real-pc equal to "pc" |
duke@435 | 1930 | PcDesc* nmethod::find_pc_desc_internal(address pc, bool approximate) { |
twisti@2103 | 1931 | address base_address = code_begin(); |
duke@435 | 1932 | if ((pc < base_address) || |
duke@435 | 1933 | (pc - base_address) >= (ptrdiff_t) PcDesc::upper_offset_limit) { |
duke@435 | 1934 | return NULL; // PC is wildly out of range |
duke@435 | 1935 | } |
duke@435 | 1936 | int pc_offset = (int) (pc - base_address); |
duke@435 | 1937 | |
duke@435 | 1938 | // Check the PcDesc cache if it contains the desired PcDesc |
duke@435 | 1939 | // (This as an almost 100% hit rate.) |
duke@435 | 1940 | PcDesc* res = _pc_desc_cache.find_pc_desc(pc_offset, approximate); |
duke@435 | 1941 | if (res != NULL) { |
duke@435 | 1942 | assert(res == linear_search(this, pc_offset, approximate), "cache ok"); |
duke@435 | 1943 | return res; |
duke@435 | 1944 | } |
duke@435 | 1945 | |
duke@435 | 1946 | // Fallback algorithm: quasi-linear search for the PcDesc |
duke@435 | 1947 | // Find the last pc_offset less than the given offset. |
duke@435 | 1948 | // The successor must be the required match, if there is a match at all. |
duke@435 | 1949 | // (Use a fixed radix to avoid expensive affine pointer arithmetic.) |
duke@435 | 1950 | PcDesc* lower = scopes_pcs_begin(); |
duke@435 | 1951 | PcDesc* upper = scopes_pcs_end(); |
duke@435 | 1952 | upper -= 1; // exclude final sentinel |
duke@435 | 1953 | if (lower >= upper) return NULL; // native method; no PcDescs at all |
duke@435 | 1954 | |
duke@435 | 1955 | #define assert_LU_OK \ |
duke@435 | 1956 | /* invariant on lower..upper during the following search: */ \ |
duke@435 | 1957 | assert(lower->pc_offset() < pc_offset, "sanity"); \ |
duke@435 | 1958 | assert(upper->pc_offset() >= pc_offset, "sanity") |
duke@435 | 1959 | assert_LU_OK; |
duke@435 | 1960 | |
duke@435 | 1961 | // Use the last successful return as a split point. |
duke@435 | 1962 | PcDesc* mid = _pc_desc_cache.last_pc_desc(); |
duke@435 | 1963 | NOT_PRODUCT(++nmethod_stats.pc_desc_searches); |
duke@435 | 1964 | if (mid->pc_offset() < pc_offset) { |
duke@435 | 1965 | lower = mid; |
duke@435 | 1966 | } else { |
duke@435 | 1967 | upper = mid; |
duke@435 | 1968 | } |
duke@435 | 1969 | |
duke@435 | 1970 | // Take giant steps at first (4096, then 256, then 16, then 1) |
duke@435 | 1971 | const int LOG2_RADIX = 4 /*smaller steps in debug mode:*/ debug_only(-1); |
duke@435 | 1972 | const int RADIX = (1 << LOG2_RADIX); |
duke@435 | 1973 | for (int step = (1 << (LOG2_RADIX*3)); step > 1; step >>= LOG2_RADIX) { |
duke@435 | 1974 | while ((mid = lower + step) < upper) { |
duke@435 | 1975 | assert_LU_OK; |
duke@435 | 1976 | NOT_PRODUCT(++nmethod_stats.pc_desc_searches); |
duke@435 | 1977 | if (mid->pc_offset() < pc_offset) { |
duke@435 | 1978 | lower = mid; |
duke@435 | 1979 | } else { |
duke@435 | 1980 | upper = mid; |
duke@435 | 1981 | break; |
duke@435 | 1982 | } |
duke@435 | 1983 | } |
duke@435 | 1984 | assert_LU_OK; |
duke@435 | 1985 | } |
duke@435 | 1986 | |
duke@435 | 1987 | // Sneak up on the value with a linear search of length ~16. |
duke@435 | 1988 | while (true) { |
duke@435 | 1989 | assert_LU_OK; |
duke@435 | 1990 | mid = lower + 1; |
duke@435 | 1991 | NOT_PRODUCT(++nmethod_stats.pc_desc_searches); |
duke@435 | 1992 | if (mid->pc_offset() < pc_offset) { |
duke@435 | 1993 | lower = mid; |
duke@435 | 1994 | } else { |
duke@435 | 1995 | upper = mid; |
duke@435 | 1996 | break; |
duke@435 | 1997 | } |
duke@435 | 1998 | } |
duke@435 | 1999 | #undef assert_LU_OK |
duke@435 | 2000 | |
duke@435 | 2001 | if (match_desc(upper, pc_offset, approximate)) { |
duke@435 | 2002 | assert(upper == linear_search(this, pc_offset, approximate), "search ok"); |
duke@435 | 2003 | _pc_desc_cache.add_pc_desc(upper); |
duke@435 | 2004 | return upper; |
duke@435 | 2005 | } else { |
duke@435 | 2006 | assert(NULL == linear_search(this, pc_offset, approximate), "search ok"); |
duke@435 | 2007 | return NULL; |
duke@435 | 2008 | } |
duke@435 | 2009 | } |
duke@435 | 2010 | |
duke@435 | 2011 | |
duke@435 | 2012 | bool nmethod::check_all_dependencies() { |
duke@435 | 2013 | bool found_check = false; |
duke@435 | 2014 | // wholesale check of all dependencies |
duke@435 | 2015 | for (Dependencies::DepStream deps(this); deps.next(); ) { |
duke@435 | 2016 | if (deps.check_dependency() != NULL) { |
duke@435 | 2017 | found_check = true; |
duke@435 | 2018 | NOT_DEBUG(break); |
duke@435 | 2019 | } |
duke@435 | 2020 | } |
duke@435 | 2021 | return found_check; // tell caller if we found anything |
duke@435 | 2022 | } |
duke@435 | 2023 | |
duke@435 | 2024 | bool nmethod::check_dependency_on(DepChange& changes) { |
duke@435 | 2025 | // What has happened: |
duke@435 | 2026 | // 1) a new class dependee has been added |
duke@435 | 2027 | // 2) dependee and all its super classes have been marked |
duke@435 | 2028 | bool found_check = false; // set true if we are upset |
duke@435 | 2029 | for (Dependencies::DepStream deps(this); deps.next(); ) { |
duke@435 | 2030 | // Evaluate only relevant dependencies. |
duke@435 | 2031 | if (deps.spot_check_dependency_at(changes) != NULL) { |
duke@435 | 2032 | found_check = true; |
duke@435 | 2033 | NOT_DEBUG(break); |
duke@435 | 2034 | } |
duke@435 | 2035 | } |
duke@435 | 2036 | return found_check; |
duke@435 | 2037 | } |
duke@435 | 2038 | |
duke@435 | 2039 | bool nmethod::is_evol_dependent_on(klassOop dependee) { |
duke@435 | 2040 | instanceKlass *dependee_ik = instanceKlass::cast(dependee); |
duke@435 | 2041 | objArrayOop dependee_methods = dependee_ik->methods(); |
duke@435 | 2042 | for (Dependencies::DepStream deps(this); deps.next(); ) { |
duke@435 | 2043 | if (deps.type() == Dependencies::evol_method) { |
duke@435 | 2044 | methodOop method = deps.method_argument(0); |
duke@435 | 2045 | for (int j = 0; j < dependee_methods->length(); j++) { |
duke@435 | 2046 | if ((methodOop) dependee_methods->obj_at(j) == method) { |
duke@435 | 2047 | // RC_TRACE macro has an embedded ResourceMark |
duke@435 | 2048 | RC_TRACE(0x01000000, |
duke@435 | 2049 | ("Found evol dependency of nmethod %s.%s(%s) compile_id=%d on method %s.%s(%s)", |
duke@435 | 2050 | _method->method_holder()->klass_part()->external_name(), |
duke@435 | 2051 | _method->name()->as_C_string(), |
duke@435 | 2052 | _method->signature()->as_C_string(), compile_id(), |
duke@435 | 2053 | method->method_holder()->klass_part()->external_name(), |
duke@435 | 2054 | method->name()->as_C_string(), |
duke@435 | 2055 | method->signature()->as_C_string())); |
duke@435 | 2056 | if (TraceDependencies || LogCompilation) |
duke@435 | 2057 | deps.log_dependency(dependee); |
duke@435 | 2058 | return true; |
duke@435 | 2059 | } |
duke@435 | 2060 | } |
duke@435 | 2061 | } |
duke@435 | 2062 | } |
duke@435 | 2063 | return false; |
duke@435 | 2064 | } |
duke@435 | 2065 | |
duke@435 | 2066 | // Called from mark_for_deoptimization, when dependee is invalidated. |
duke@435 | 2067 | bool nmethod::is_dependent_on_method(methodOop dependee) { |
duke@435 | 2068 | for (Dependencies::DepStream deps(this); deps.next(); ) { |
duke@435 | 2069 | if (deps.type() != Dependencies::evol_method) |
duke@435 | 2070 | continue; |
duke@435 | 2071 | methodOop method = deps.method_argument(0); |
duke@435 | 2072 | if (method == dependee) return true; |
duke@435 | 2073 | } |
duke@435 | 2074 | return false; |
duke@435 | 2075 | } |
duke@435 | 2076 | |
duke@435 | 2077 | |
duke@435 | 2078 | bool nmethod::is_patchable_at(address instr_addr) { |
twisti@2103 | 2079 | assert(insts_contains(instr_addr), "wrong nmethod used"); |
duke@435 | 2080 | if (is_zombie()) { |
duke@435 | 2081 | // a zombie may never be patched |
duke@435 | 2082 | return false; |
duke@435 | 2083 | } |
duke@435 | 2084 | return true; |
duke@435 | 2085 | } |
duke@435 | 2086 | |
duke@435 | 2087 | |
duke@435 | 2088 | address nmethod::continuation_for_implicit_exception(address pc) { |
duke@435 | 2089 | // Exception happened outside inline-cache check code => we are inside |
duke@435 | 2090 | // an active nmethod => use cpc to determine a return address |
twisti@2103 | 2091 | int exception_offset = pc - code_begin(); |
duke@435 | 2092 | int cont_offset = ImplicitExceptionTable(this).at( exception_offset ); |
duke@435 | 2093 | #ifdef ASSERT |
duke@435 | 2094 | if (cont_offset == 0) { |
duke@435 | 2095 | Thread* thread = ThreadLocalStorage::get_thread_slow(); |
duke@435 | 2096 | ResetNoHandleMark rnm; // Might be called from LEAF/QUICK ENTRY |
duke@435 | 2097 | HandleMark hm(thread); |
duke@435 | 2098 | ResourceMark rm(thread); |
duke@435 | 2099 | CodeBlob* cb = CodeCache::find_blob(pc); |
duke@435 | 2100 | assert(cb != NULL && cb == this, ""); |
duke@435 | 2101 | tty->print_cr("implicit exception happened at " INTPTR_FORMAT, pc); |
duke@435 | 2102 | print(); |
duke@435 | 2103 | method()->print_codes(); |
duke@435 | 2104 | print_code(); |
duke@435 | 2105 | print_pcs(); |
duke@435 | 2106 | } |
duke@435 | 2107 | #endif |
never@1685 | 2108 | if (cont_offset == 0) { |
never@1685 | 2109 | // Let the normal error handling report the exception |
never@1685 | 2110 | return NULL; |
never@1685 | 2111 | } |
twisti@2103 | 2112 | return code_begin() + cont_offset; |
duke@435 | 2113 | } |
duke@435 | 2114 | |
duke@435 | 2115 | |
duke@435 | 2116 | |
duke@435 | 2117 | void nmethod_init() { |
duke@435 | 2118 | // make sure you didn't forget to adjust the filler fields |
duke@435 | 2119 | assert(sizeof(nmethod) % oopSize == 0, "nmethod size must be multiple of a word"); |
duke@435 | 2120 | } |
duke@435 | 2121 | |
duke@435 | 2122 | |
duke@435 | 2123 | //------------------------------------------------------------------------------------------- |
duke@435 | 2124 | |
duke@435 | 2125 | |
duke@435 | 2126 | // QQQ might we make this work from a frame?? |
duke@435 | 2127 | nmethodLocker::nmethodLocker(address pc) { |
duke@435 | 2128 | CodeBlob* cb = CodeCache::find_blob(pc); |
duke@435 | 2129 | guarantee(cb != NULL && cb->is_nmethod(), "bad pc for a nmethod found"); |
duke@435 | 2130 | _nm = (nmethod*)cb; |
duke@435 | 2131 | lock_nmethod(_nm); |
duke@435 | 2132 | } |
duke@435 | 2133 | |
dcubed@2624 | 2134 | // Only JvmtiDeferredEvent::compiled_method_unload_event() |
dcubed@2624 | 2135 | // should pass zombie_ok == true. |
dcubed@2624 | 2136 | void nmethodLocker::lock_nmethod(nmethod* nm, bool zombie_ok) { |
duke@435 | 2137 | if (nm == NULL) return; |
duke@435 | 2138 | Atomic::inc(&nm->_lock_count); |
dcubed@2624 | 2139 | guarantee(zombie_ok || !nm->is_zombie(), "cannot lock a zombie method"); |
duke@435 | 2140 | } |
duke@435 | 2141 | |
duke@435 | 2142 | void nmethodLocker::unlock_nmethod(nmethod* nm) { |
duke@435 | 2143 | if (nm == NULL) return; |
duke@435 | 2144 | Atomic::dec(&nm->_lock_count); |
duke@435 | 2145 | guarantee(nm->_lock_count >= 0, "unmatched nmethod lock/unlock"); |
duke@435 | 2146 | } |
duke@435 | 2147 | |
twisti@1639 | 2148 | |
twisti@1639 | 2149 | // ----------------------------------------------------------------------------- |
twisti@1639 | 2150 | // nmethod::get_deopt_original_pc |
twisti@1639 | 2151 | // |
twisti@1639 | 2152 | // Return the original PC for the given PC if: |
twisti@1639 | 2153 | // (a) the given PC belongs to a nmethod and |
twisti@1639 | 2154 | // (b) it is a deopt PC |
twisti@1639 | 2155 | address nmethod::get_deopt_original_pc(const frame* fr) { |
twisti@1639 | 2156 | if (fr->cb() == NULL) return NULL; |
twisti@1639 | 2157 | |
twisti@1639 | 2158 | nmethod* nm = fr->cb()->as_nmethod_or_null(); |
twisti@1639 | 2159 | if (nm != NULL && nm->is_deopt_pc(fr->pc())) |
twisti@1639 | 2160 | return nm->get_original_pc(fr); |
twisti@1639 | 2161 | |
twisti@1639 | 2162 | return NULL; |
duke@435 | 2163 | } |
duke@435 | 2164 | |
duke@435 | 2165 | |
duke@435 | 2166 | // ----------------------------------------------------------------------------- |
twisti@1570 | 2167 | // MethodHandle |
twisti@1570 | 2168 | |
twisti@1570 | 2169 | bool nmethod::is_method_handle_return(address return_pc) { |
twisti@1570 | 2170 | if (!has_method_handle_invokes()) return false; |
twisti@1570 | 2171 | PcDesc* pd = pc_desc_at(return_pc); |
twisti@1570 | 2172 | if (pd == NULL) |
twisti@1570 | 2173 | return false; |
twisti@1570 | 2174 | return pd->is_method_handle_invoke(); |
twisti@1570 | 2175 | } |
twisti@1570 | 2176 | |
twisti@1570 | 2177 | |
twisti@1570 | 2178 | // ----------------------------------------------------------------------------- |
duke@435 | 2179 | // Verification |
duke@435 | 2180 | |
jrose@1424 | 2181 | class VerifyOopsClosure: public OopClosure { |
jrose@1424 | 2182 | nmethod* _nm; |
jrose@1424 | 2183 | bool _ok; |
jrose@1424 | 2184 | public: |
jrose@1424 | 2185 | VerifyOopsClosure(nmethod* nm) : _nm(nm), _ok(true) { } |
jrose@1424 | 2186 | bool ok() { return _ok; } |
jrose@1424 | 2187 | virtual void do_oop(oop* p) { |
jrose@1424 | 2188 | if ((*p) == NULL || (*p)->is_oop()) return; |
jrose@1424 | 2189 | if (_ok) { |
jrose@1424 | 2190 | _nm->print_nmethod(true); |
jrose@1424 | 2191 | _ok = false; |
jrose@1424 | 2192 | } |
jrose@1424 | 2193 | tty->print_cr("*** non-oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)", |
jrose@1424 | 2194 | (intptr_t)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm)); |
jrose@1424 | 2195 | } |
jrose@1424 | 2196 | virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); } |
jrose@1424 | 2197 | }; |
jrose@1424 | 2198 | |
duke@435 | 2199 | void nmethod::verify() { |
duke@435 | 2200 | |
duke@435 | 2201 | // Hmm. OSR methods can be deopted but not marked as zombie or not_entrant |
duke@435 | 2202 | // seems odd. |
duke@435 | 2203 | |
duke@435 | 2204 | if( is_zombie() || is_not_entrant() ) |
duke@435 | 2205 | return; |
duke@435 | 2206 | |
duke@435 | 2207 | // Make sure all the entry points are correctly aligned for patching. |
duke@435 | 2208 | NativeJump::check_verified_entry_alignment(entry_point(), verified_entry_point()); |
duke@435 | 2209 | |
duke@435 | 2210 | assert(method()->is_oop(), "must be valid"); |
duke@435 | 2211 | |
duke@435 | 2212 | ResourceMark rm; |
duke@435 | 2213 | |
duke@435 | 2214 | if (!CodeCache::contains(this)) { |
jcoomes@1845 | 2215 | fatal(err_msg("nmethod at " INTPTR_FORMAT " not in zone", this)); |
duke@435 | 2216 | } |
duke@435 | 2217 | |
duke@435 | 2218 | if(is_native_method() ) |
duke@435 | 2219 | return; |
duke@435 | 2220 | |
duke@435 | 2221 | nmethod* nm = CodeCache::find_nmethod(verified_entry_point()); |
duke@435 | 2222 | if (nm != this) { |
jcoomes@1845 | 2223 | fatal(err_msg("findNMethod did not find this nmethod (" INTPTR_FORMAT ")", |
jcoomes@1845 | 2224 | this)); |
duke@435 | 2225 | } |
duke@435 | 2226 | |
duke@435 | 2227 | for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) { |
duke@435 | 2228 | if (! p->verify(this)) { |
duke@435 | 2229 | tty->print_cr("\t\tin nmethod at " INTPTR_FORMAT " (pcs)", this); |
duke@435 | 2230 | } |
duke@435 | 2231 | } |
duke@435 | 2232 | |
jrose@1424 | 2233 | VerifyOopsClosure voc(this); |
jrose@1424 | 2234 | oops_do(&voc); |
jrose@1424 | 2235 | assert(voc.ok(), "embedded oops must be OK"); |
jrose@1424 | 2236 | verify_scavenge_root_oops(); |
jrose@1424 | 2237 | |
duke@435 | 2238 | verify_scopes(); |
duke@435 | 2239 | } |
duke@435 | 2240 | |
duke@435 | 2241 | |
duke@435 | 2242 | void nmethod::verify_interrupt_point(address call_site) { |
duke@435 | 2243 | // This code does not work in release mode since |
duke@435 | 2244 | // owns_lock only is available in debug mode. |
duke@435 | 2245 | CompiledIC* ic = NULL; |
duke@435 | 2246 | Thread *cur = Thread::current(); |
duke@435 | 2247 | if (CompiledIC_lock->owner() == cur || |
duke@435 | 2248 | ((cur->is_VM_thread() || cur->is_ConcurrentGC_thread()) && |
duke@435 | 2249 | SafepointSynchronize::is_at_safepoint())) { |
duke@435 | 2250 | ic = CompiledIC_at(call_site); |
duke@435 | 2251 | CHECK_UNHANDLED_OOPS_ONLY(Thread::current()->clear_unhandled_oops()); |
duke@435 | 2252 | } else { |
duke@435 | 2253 | MutexLocker ml_verify (CompiledIC_lock); |
duke@435 | 2254 | ic = CompiledIC_at(call_site); |
duke@435 | 2255 | } |
duke@435 | 2256 | PcDesc* pd = pc_desc_at(ic->end_of_call()); |
duke@435 | 2257 | assert(pd != NULL, "PcDesc must exist"); |
duke@435 | 2258 | for (ScopeDesc* sd = new ScopeDesc(this, pd->scope_decode_offset(), |
kvn@1688 | 2259 | pd->obj_decode_offset(), pd->should_reexecute(), |
kvn@1688 | 2260 | pd->return_oop()); |
duke@435 | 2261 | !sd->is_top(); sd = sd->sender()) { |
duke@435 | 2262 | sd->verify(); |
duke@435 | 2263 | } |
duke@435 | 2264 | } |
duke@435 | 2265 | |
duke@435 | 2266 | void nmethod::verify_scopes() { |
duke@435 | 2267 | if( !method() ) return; // Runtime stubs have no scope |
duke@435 | 2268 | if (method()->is_native()) return; // Ignore stub methods. |
duke@435 | 2269 | // iterate through all interrupt point |
duke@435 | 2270 | // and verify the debug information is valid. |
duke@435 | 2271 | RelocIterator iter((nmethod*)this); |
duke@435 | 2272 | while (iter.next()) { |
duke@435 | 2273 | address stub = NULL; |
duke@435 | 2274 | switch (iter.type()) { |
duke@435 | 2275 | case relocInfo::virtual_call_type: |
duke@435 | 2276 | verify_interrupt_point(iter.addr()); |
duke@435 | 2277 | break; |
duke@435 | 2278 | case relocInfo::opt_virtual_call_type: |
duke@435 | 2279 | stub = iter.opt_virtual_call_reloc()->static_stub(); |
duke@435 | 2280 | verify_interrupt_point(iter.addr()); |
duke@435 | 2281 | break; |
duke@435 | 2282 | case relocInfo::static_call_type: |
duke@435 | 2283 | stub = iter.static_call_reloc()->static_stub(); |
duke@435 | 2284 | //verify_interrupt_point(iter.addr()); |
duke@435 | 2285 | break; |
duke@435 | 2286 | case relocInfo::runtime_call_type: |
duke@435 | 2287 | address destination = iter.reloc()->value(); |
duke@435 | 2288 | // Right now there is no way to find out which entries support |
duke@435 | 2289 | // an interrupt point. It would be nice if we had this |
duke@435 | 2290 | // information in a table. |
duke@435 | 2291 | break; |
duke@435 | 2292 | } |
duke@435 | 2293 | assert(stub == NULL || stub_contains(stub), "static call stub outside stub section"); |
duke@435 | 2294 | } |
duke@435 | 2295 | } |
duke@435 | 2296 | |
duke@435 | 2297 | |
duke@435 | 2298 | // ----------------------------------------------------------------------------- |
duke@435 | 2299 | // Non-product code |
duke@435 | 2300 | #ifndef PRODUCT |
duke@435 | 2301 | |
jrose@1424 | 2302 | class DebugScavengeRoot: public OopClosure { |
jrose@1424 | 2303 | nmethod* _nm; |
jrose@1424 | 2304 | bool _ok; |
jrose@1424 | 2305 | public: |
jrose@1424 | 2306 | DebugScavengeRoot(nmethod* nm) : _nm(nm), _ok(true) { } |
jrose@1424 | 2307 | bool ok() { return _ok; } |
jrose@1424 | 2308 | virtual void do_oop(oop* p) { |
jrose@1424 | 2309 | if ((*p) == NULL || !(*p)->is_scavengable()) return; |
jrose@1424 | 2310 | if (_ok) { |
jrose@1424 | 2311 | _nm->print_nmethod(true); |
jrose@1424 | 2312 | _ok = false; |
jrose@1424 | 2313 | } |
jrose@1424 | 2314 | tty->print_cr("*** non-perm oop "PTR_FORMAT" found at "PTR_FORMAT" (offset %d)", |
jrose@1424 | 2315 | (intptr_t)(*p), (intptr_t)p, (int)((intptr_t)p - (intptr_t)_nm)); |
jrose@1424 | 2316 | (*p)->print(); |
jrose@1424 | 2317 | } |
jrose@1424 | 2318 | virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); } |
jrose@1424 | 2319 | }; |
duke@435 | 2320 | |
jrose@1424 | 2321 | void nmethod::verify_scavenge_root_oops() { |
jrose@1424 | 2322 | if (!on_scavenge_root_list()) { |
jrose@1424 | 2323 | // Actually look inside, to verify the claim that it's clean. |
jrose@1424 | 2324 | DebugScavengeRoot debug_scavenge_root(this); |
jrose@1424 | 2325 | oops_do(&debug_scavenge_root); |
jrose@1424 | 2326 | if (!debug_scavenge_root.ok()) |
jrose@1424 | 2327 | fatal("found an unadvertised bad non-perm oop in the code cache"); |
duke@435 | 2328 | } |
jrose@1424 | 2329 | assert(scavenge_root_not_marked(), ""); |
duke@435 | 2330 | } |
duke@435 | 2331 | |
jrose@535 | 2332 | #endif // PRODUCT |
duke@435 | 2333 | |
duke@435 | 2334 | // Printing operations |
duke@435 | 2335 | |
duke@435 | 2336 | void nmethod::print() const { |
duke@435 | 2337 | ResourceMark rm; |
duke@435 | 2338 | ttyLocker ttyl; // keep the following output all in one block |
duke@435 | 2339 | |
twisti@2687 | 2340 | tty->print("Compiled method "); |
duke@435 | 2341 | |
duke@435 | 2342 | if (is_compiled_by_c1()) { |
duke@435 | 2343 | tty->print("(c1) "); |
duke@435 | 2344 | } else if (is_compiled_by_c2()) { |
duke@435 | 2345 | tty->print("(c2) "); |
twisti@2047 | 2346 | } else if (is_compiled_by_shark()) { |
twisti@2047 | 2347 | tty->print("(shark) "); |
duke@435 | 2348 | } else { |
duke@435 | 2349 | tty->print("(nm) "); |
duke@435 | 2350 | } |
duke@435 | 2351 | |
twisti@2687 | 2352 | print_on(tty, NULL); |
twisti@2687 | 2353 | |
duke@435 | 2354 | if (WizardMode) { |
duke@435 | 2355 | tty->print("((nmethod*) "INTPTR_FORMAT ") ", this); |
duke@435 | 2356 | tty->print(" for method " INTPTR_FORMAT , (address)method()); |
duke@435 | 2357 | tty->print(" { "); |
duke@435 | 2358 | if (is_in_use()) tty->print("in_use "); |
duke@435 | 2359 | if (is_not_entrant()) tty->print("not_entrant "); |
duke@435 | 2360 | if (is_zombie()) tty->print("zombie "); |
duke@435 | 2361 | if (is_unloaded()) tty->print("unloaded "); |
jrose@1424 | 2362 | if (on_scavenge_root_list()) tty->print("scavenge_root "); |
duke@435 | 2363 | tty->print_cr("}:"); |
duke@435 | 2364 | } |
duke@435 | 2365 | if (size () > 0) tty->print_cr(" total in heap [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", |
duke@435 | 2366 | (address)this, |
duke@435 | 2367 | (address)this + size(), |
duke@435 | 2368 | size()); |
duke@435 | 2369 | if (relocation_size () > 0) tty->print_cr(" relocation [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", |
duke@435 | 2370 | relocation_begin(), |
duke@435 | 2371 | relocation_end(), |
duke@435 | 2372 | relocation_size()); |
twisti@2117 | 2373 | if (consts_size () > 0) tty->print_cr(" constants [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", |
twisti@2117 | 2374 | consts_begin(), |
twisti@2117 | 2375 | consts_end(), |
twisti@2117 | 2376 | consts_size()); |
twisti@2103 | 2377 | if (insts_size () > 0) tty->print_cr(" main code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", |
twisti@2103 | 2378 | insts_begin(), |
twisti@2103 | 2379 | insts_end(), |
twisti@2103 | 2380 | insts_size()); |
duke@435 | 2381 | if (stub_size () > 0) tty->print_cr(" stub code [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", |
duke@435 | 2382 | stub_begin(), |
duke@435 | 2383 | stub_end(), |
duke@435 | 2384 | stub_size()); |
twisti@1918 | 2385 | if (oops_size () > 0) tty->print_cr(" oops [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", |
twisti@1918 | 2386 | oops_begin(), |
twisti@1918 | 2387 | oops_end(), |
twisti@1918 | 2388 | oops_size()); |
duke@435 | 2389 | if (scopes_data_size () > 0) tty->print_cr(" scopes data [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", |
duke@435 | 2390 | scopes_data_begin(), |
duke@435 | 2391 | scopes_data_end(), |
duke@435 | 2392 | scopes_data_size()); |
duke@435 | 2393 | if (scopes_pcs_size () > 0) tty->print_cr(" scopes pcs [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", |
duke@435 | 2394 | scopes_pcs_begin(), |
duke@435 | 2395 | scopes_pcs_end(), |
duke@435 | 2396 | scopes_pcs_size()); |
duke@435 | 2397 | if (dependencies_size () > 0) tty->print_cr(" dependencies [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", |
duke@435 | 2398 | dependencies_begin(), |
duke@435 | 2399 | dependencies_end(), |
duke@435 | 2400 | dependencies_size()); |
duke@435 | 2401 | if (handler_table_size() > 0) tty->print_cr(" handler table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", |
duke@435 | 2402 | handler_table_begin(), |
duke@435 | 2403 | handler_table_end(), |
duke@435 | 2404 | handler_table_size()); |
duke@435 | 2405 | if (nul_chk_table_size() > 0) tty->print_cr(" nul chk table [" INTPTR_FORMAT "," INTPTR_FORMAT "] = %d", |
duke@435 | 2406 | nul_chk_table_begin(), |
duke@435 | 2407 | nul_chk_table_end(), |
duke@435 | 2408 | nul_chk_table_size()); |
duke@435 | 2409 | } |
duke@435 | 2410 | |
jrose@535 | 2411 | void nmethod::print_code() { |
jrose@535 | 2412 | HandleMark hm; |
jrose@535 | 2413 | ResourceMark m; |
jrose@535 | 2414 | Disassembler::decode(this); |
jrose@535 | 2415 | } |
jrose@535 | 2416 | |
jrose@535 | 2417 | |
jrose@535 | 2418 | #ifndef PRODUCT |
duke@435 | 2419 | |
duke@435 | 2420 | void nmethod::print_scopes() { |
duke@435 | 2421 | // Find the first pc desc for all scopes in the code and print it. |
duke@435 | 2422 | ResourceMark rm; |
duke@435 | 2423 | for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) { |
duke@435 | 2424 | if (p->scope_decode_offset() == DebugInformationRecorder::serialized_null) |
duke@435 | 2425 | continue; |
duke@435 | 2426 | |
duke@435 | 2427 | ScopeDesc* sd = scope_desc_at(p->real_pc(this)); |
duke@435 | 2428 | sd->print_on(tty, p); |
duke@435 | 2429 | } |
duke@435 | 2430 | } |
duke@435 | 2431 | |
duke@435 | 2432 | void nmethod::print_dependencies() { |
duke@435 | 2433 | ResourceMark rm; |
duke@435 | 2434 | ttyLocker ttyl; // keep the following output all in one block |
duke@435 | 2435 | tty->print_cr("Dependencies:"); |
duke@435 | 2436 | for (Dependencies::DepStream deps(this); deps.next(); ) { |
duke@435 | 2437 | deps.print_dependency(); |
duke@435 | 2438 | klassOop ctxk = deps.context_type(); |
duke@435 | 2439 | if (ctxk != NULL) { |
duke@435 | 2440 | Klass* k = Klass::cast(ctxk); |
duke@435 | 2441 | if (k->oop_is_instance() && ((instanceKlass*)k)->is_dependent_nmethod(this)) { |
jrose@465 | 2442 | tty->print_cr(" [nmethod<=klass]%s", k->external_name()); |
duke@435 | 2443 | } |
duke@435 | 2444 | } |
duke@435 | 2445 | deps.log_dependency(); // put it into the xml log also |
duke@435 | 2446 | } |
duke@435 | 2447 | } |
duke@435 | 2448 | |
duke@435 | 2449 | |
duke@435 | 2450 | void nmethod::print_relocations() { |
duke@435 | 2451 | ResourceMark m; // in case methods get printed via the debugger |
duke@435 | 2452 | tty->print_cr("relocations:"); |
duke@435 | 2453 | RelocIterator iter(this); |
duke@435 | 2454 | iter.print(); |
duke@435 | 2455 | if (UseRelocIndex) { |
duke@435 | 2456 | jint* index_end = (jint*)relocation_end() - 1; |
duke@435 | 2457 | jint index_size = *index_end; |
duke@435 | 2458 | jint* index_start = (jint*)( (address)index_end - index_size ); |
duke@435 | 2459 | tty->print_cr(" index @" INTPTR_FORMAT ": index_size=%d", index_start, index_size); |
duke@435 | 2460 | if (index_size > 0) { |
duke@435 | 2461 | jint* ip; |
duke@435 | 2462 | for (ip = index_start; ip+2 <= index_end; ip += 2) |
duke@435 | 2463 | tty->print_cr(" (%d %d) addr=" INTPTR_FORMAT " @" INTPTR_FORMAT, |
duke@435 | 2464 | ip[0], |
duke@435 | 2465 | ip[1], |
duke@435 | 2466 | header_end()+ip[0], |
duke@435 | 2467 | relocation_begin()-1+ip[1]); |
duke@435 | 2468 | for (; ip < index_end; ip++) |
duke@435 | 2469 | tty->print_cr(" (%d ?)", ip[0]); |
duke@435 | 2470 | tty->print_cr(" @" INTPTR_FORMAT ": index_size=%d", ip, *ip++); |
duke@435 | 2471 | tty->print_cr("reloc_end @" INTPTR_FORMAT ":", ip); |
duke@435 | 2472 | } |
duke@435 | 2473 | } |
duke@435 | 2474 | } |
duke@435 | 2475 | |
duke@435 | 2476 | |
duke@435 | 2477 | void nmethod::print_pcs() { |
duke@435 | 2478 | ResourceMark m; // in case methods get printed via debugger |
duke@435 | 2479 | tty->print_cr("pc-bytecode offsets:"); |
duke@435 | 2480 | for (PcDesc* p = scopes_pcs_begin(); p < scopes_pcs_end(); p++) { |
duke@435 | 2481 | p->print(this); |
duke@435 | 2482 | } |
duke@435 | 2483 | } |
duke@435 | 2484 | |
jrose@535 | 2485 | #endif // PRODUCT |
duke@435 | 2486 | |
duke@435 | 2487 | const char* nmethod::reloc_string_for(u_char* begin, u_char* end) { |
duke@435 | 2488 | RelocIterator iter(this, begin, end); |
duke@435 | 2489 | bool have_one = false; |
duke@435 | 2490 | while (iter.next()) { |
duke@435 | 2491 | have_one = true; |
duke@435 | 2492 | switch (iter.type()) { |
duke@435 | 2493 | case relocInfo::none: return "no_reloc"; |
duke@435 | 2494 | case relocInfo::oop_type: { |
duke@435 | 2495 | stringStream st; |
duke@435 | 2496 | oop_Relocation* r = iter.oop_reloc(); |
duke@435 | 2497 | oop obj = r->oop_value(); |
duke@435 | 2498 | st.print("oop("); |
duke@435 | 2499 | if (obj == NULL) st.print("NULL"); |
duke@435 | 2500 | else obj->print_value_on(&st); |
duke@435 | 2501 | st.print(")"); |
duke@435 | 2502 | return st.as_string(); |
duke@435 | 2503 | } |
duke@435 | 2504 | case relocInfo::virtual_call_type: return "virtual_call"; |
duke@435 | 2505 | case relocInfo::opt_virtual_call_type: return "optimized virtual_call"; |
duke@435 | 2506 | case relocInfo::static_call_type: return "static_call"; |
duke@435 | 2507 | case relocInfo::static_stub_type: return "static_stub"; |
duke@435 | 2508 | case relocInfo::runtime_call_type: return "runtime_call"; |
duke@435 | 2509 | case relocInfo::external_word_type: return "external_word"; |
duke@435 | 2510 | case relocInfo::internal_word_type: return "internal_word"; |
duke@435 | 2511 | case relocInfo::section_word_type: return "section_word"; |
duke@435 | 2512 | case relocInfo::poll_type: return "poll"; |
duke@435 | 2513 | case relocInfo::poll_return_type: return "poll_return"; |
duke@435 | 2514 | case relocInfo::type_mask: return "type_bit_mask"; |
duke@435 | 2515 | } |
duke@435 | 2516 | } |
duke@435 | 2517 | return have_one ? "other" : NULL; |
duke@435 | 2518 | } |
duke@435 | 2519 | |
duke@435 | 2520 | // Return a the last scope in (begin..end] |
duke@435 | 2521 | ScopeDesc* nmethod::scope_desc_in(address begin, address end) { |
duke@435 | 2522 | PcDesc* p = pc_desc_near(begin+1); |
duke@435 | 2523 | if (p != NULL && p->real_pc(this) <= end) { |
duke@435 | 2524 | return new ScopeDesc(this, p->scope_decode_offset(), |
kvn@1688 | 2525 | p->obj_decode_offset(), p->should_reexecute(), |
kvn@1688 | 2526 | p->return_oop()); |
duke@435 | 2527 | } |
duke@435 | 2528 | return NULL; |
duke@435 | 2529 | } |
duke@435 | 2530 | |
jrose@1590 | 2531 | void nmethod::print_nmethod_labels(outputStream* stream, address block_begin) { |
jrose@1590 | 2532 | if (block_begin == entry_point()) stream->print_cr("[Entry Point]"); |
jrose@1590 | 2533 | if (block_begin == verified_entry_point()) stream->print_cr("[Verified Entry Point]"); |
jrose@1590 | 2534 | if (block_begin == exception_begin()) stream->print_cr("[Exception Handler]"); |
jrose@1590 | 2535 | if (block_begin == stub_begin()) stream->print_cr("[Stub Code]"); |
twisti@1639 | 2536 | if (block_begin == deopt_handler_begin()) stream->print_cr("[Deopt Handler Code]"); |
twisti@2046 | 2537 | |
twisti@2046 | 2538 | if (has_method_handle_invokes()) |
twisti@2046 | 2539 | if (block_begin == deopt_mh_handler_begin()) stream->print_cr("[Deopt MH Handler Code]"); |
twisti@2046 | 2540 | |
jrose@1590 | 2541 | if (block_begin == consts_begin()) stream->print_cr("[Constants]"); |
twisti@2046 | 2542 | |
jrose@1590 | 2543 | if (block_begin == entry_point()) { |
jrose@1590 | 2544 | methodHandle m = method(); |
jrose@1590 | 2545 | if (m.not_null()) { |
jrose@1590 | 2546 | stream->print(" # "); |
jrose@1590 | 2547 | m->print_value_on(stream); |
jrose@1590 | 2548 | stream->cr(); |
jrose@1590 | 2549 | } |
jrose@1590 | 2550 | if (m.not_null() && !is_osr_method()) { |
jrose@1590 | 2551 | ResourceMark rm; |
jrose@1590 | 2552 | int sizeargs = m->size_of_parameters(); |
jrose@1590 | 2553 | BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, sizeargs); |
jrose@1590 | 2554 | VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, sizeargs); |
jrose@1590 | 2555 | { |
jrose@1590 | 2556 | int sig_index = 0; |
jrose@1590 | 2557 | if (!m->is_static()) |
jrose@1590 | 2558 | sig_bt[sig_index++] = T_OBJECT; // 'this' |
jrose@1590 | 2559 | for (SignatureStream ss(m->signature()); !ss.at_return_type(); ss.next()) { |
jrose@1590 | 2560 | BasicType t = ss.type(); |
jrose@1590 | 2561 | sig_bt[sig_index++] = t; |
jrose@1590 | 2562 | if (type2size[t] == 2) { |
jrose@1590 | 2563 | sig_bt[sig_index++] = T_VOID; |
jrose@1590 | 2564 | } else { |
jrose@1590 | 2565 | assert(type2size[t] == 1, "size is 1 or 2"); |
jrose@1590 | 2566 | } |
jrose@1590 | 2567 | } |
jrose@1590 | 2568 | assert(sig_index == sizeargs, ""); |
jrose@1590 | 2569 | } |
jrose@1590 | 2570 | const char* spname = "sp"; // make arch-specific? |
jrose@1590 | 2571 | intptr_t out_preserve = SharedRuntime::java_calling_convention(sig_bt, regs, sizeargs, false); |
jrose@1590 | 2572 | int stack_slot_offset = this->frame_size() * wordSize; |
jrose@1590 | 2573 | int tab1 = 14, tab2 = 24; |
jrose@1590 | 2574 | int sig_index = 0; |
jrose@1590 | 2575 | int arg_index = (m->is_static() ? 0 : -1); |
jrose@1590 | 2576 | bool did_old_sp = false; |
jrose@1590 | 2577 | for (SignatureStream ss(m->signature()); !ss.at_return_type(); ) { |
jrose@1590 | 2578 | bool at_this = (arg_index == -1); |
jrose@1590 | 2579 | bool at_old_sp = false; |
jrose@1590 | 2580 | BasicType t = (at_this ? T_OBJECT : ss.type()); |
jrose@1590 | 2581 | assert(t == sig_bt[sig_index], "sigs in sync"); |
jrose@1590 | 2582 | if (at_this) |
jrose@1590 | 2583 | stream->print(" # this: "); |
jrose@1590 | 2584 | else |
jrose@1590 | 2585 | stream->print(" # parm%d: ", arg_index); |
jrose@1590 | 2586 | stream->move_to(tab1); |
jrose@1590 | 2587 | VMReg fst = regs[sig_index].first(); |
jrose@1590 | 2588 | VMReg snd = regs[sig_index].second(); |
jrose@1590 | 2589 | if (fst->is_reg()) { |
jrose@1590 | 2590 | stream->print("%s", fst->name()); |
jrose@1590 | 2591 | if (snd->is_valid()) { |
jrose@1590 | 2592 | stream->print(":%s", snd->name()); |
jrose@1590 | 2593 | } |
jrose@1590 | 2594 | } else if (fst->is_stack()) { |
jrose@1590 | 2595 | int offset = fst->reg2stack() * VMRegImpl::stack_slot_size + stack_slot_offset; |
jrose@1590 | 2596 | if (offset == stack_slot_offset) at_old_sp = true; |
jrose@1590 | 2597 | stream->print("[%s+0x%x]", spname, offset); |
jrose@1590 | 2598 | } else { |
jrose@1590 | 2599 | stream->print("reg%d:%d??", (int)(intptr_t)fst, (int)(intptr_t)snd); |
jrose@1590 | 2600 | } |
jrose@1590 | 2601 | stream->print(" "); |
jrose@1590 | 2602 | stream->move_to(tab2); |
jrose@1590 | 2603 | stream->print("= "); |
jrose@1590 | 2604 | if (at_this) { |
jrose@1590 | 2605 | m->method_holder()->print_value_on(stream); |
jrose@1590 | 2606 | } else { |
jrose@1590 | 2607 | bool did_name = false; |
jrose@1590 | 2608 | if (!at_this && ss.is_object()) { |
coleenp@2497 | 2609 | Symbol* name = ss.as_symbol_or_null(); |
jrose@1590 | 2610 | if (name != NULL) { |
jrose@1590 | 2611 | name->print_value_on(stream); |
jrose@1590 | 2612 | did_name = true; |
jrose@1590 | 2613 | } |
jrose@1590 | 2614 | } |
jrose@1590 | 2615 | if (!did_name) |
jrose@1590 | 2616 | stream->print("%s", type2name(t)); |
jrose@1590 | 2617 | } |
jrose@1590 | 2618 | if (at_old_sp) { |
jrose@1590 | 2619 | stream->print(" (%s of caller)", spname); |
jrose@1590 | 2620 | did_old_sp = true; |
jrose@1590 | 2621 | } |
jrose@1590 | 2622 | stream->cr(); |
jrose@1590 | 2623 | sig_index += type2size[t]; |
jrose@1590 | 2624 | arg_index += 1; |
jrose@1590 | 2625 | if (!at_this) ss.next(); |
jrose@1590 | 2626 | } |
jrose@1590 | 2627 | if (!did_old_sp) { |
jrose@1590 | 2628 | stream->print(" # "); |
jrose@1590 | 2629 | stream->move_to(tab1); |
jrose@1590 | 2630 | stream->print("[%s+0x%x]", spname, stack_slot_offset); |
jrose@1590 | 2631 | stream->print(" (%s of caller)", spname); |
jrose@1590 | 2632 | stream->cr(); |
jrose@1590 | 2633 | } |
jrose@1590 | 2634 | } |
jrose@1590 | 2635 | } |
jrose@1590 | 2636 | } |
jrose@1590 | 2637 | |
duke@435 | 2638 | void nmethod::print_code_comment_on(outputStream* st, int column, u_char* begin, u_char* end) { |
duke@435 | 2639 | // First, find an oopmap in (begin, end]. |
duke@435 | 2640 | // We use the odd half-closed interval so that oop maps and scope descs |
duke@435 | 2641 | // which are tied to the byte after a call are printed with the call itself. |
twisti@2103 | 2642 | address base = code_begin(); |
duke@435 | 2643 | OopMapSet* oms = oop_maps(); |
duke@435 | 2644 | if (oms != NULL) { |
duke@435 | 2645 | for (int i = 0, imax = oms->size(); i < imax; i++) { |
duke@435 | 2646 | OopMap* om = oms->at(i); |
duke@435 | 2647 | address pc = base + om->offset(); |
duke@435 | 2648 | if (pc > begin) { |
duke@435 | 2649 | if (pc <= end) { |
jrose@535 | 2650 | st->move_to(column); |
jrose@535 | 2651 | st->print("; "); |
jrose@535 | 2652 | om->print_on(st); |
duke@435 | 2653 | } |
duke@435 | 2654 | break; |
duke@435 | 2655 | } |
duke@435 | 2656 | } |
duke@435 | 2657 | } |
jrose@535 | 2658 | |
jrose@535 | 2659 | // Print any debug info present at this pc. |
duke@435 | 2660 | ScopeDesc* sd = scope_desc_in(begin, end); |
duke@435 | 2661 | if (sd != NULL) { |
jrose@535 | 2662 | st->move_to(column); |
duke@435 | 2663 | if (sd->bci() == SynchronizationEntryBCI) { |
duke@435 | 2664 | st->print(";*synchronization entry"); |
duke@435 | 2665 | } else { |
duke@435 | 2666 | if (sd->method().is_null()) { |
jrose@535 | 2667 | st->print("method is NULL"); |
duke@435 | 2668 | } else if (sd->method()->is_native()) { |
jrose@535 | 2669 | st->print("method is native"); |
duke@435 | 2670 | } else { |
never@2462 | 2671 | Bytecodes::Code bc = sd->method()->java_code_at(sd->bci()); |
duke@435 | 2672 | st->print(";*%s", Bytecodes::name(bc)); |
duke@435 | 2673 | switch (bc) { |
duke@435 | 2674 | case Bytecodes::_invokevirtual: |
duke@435 | 2675 | case Bytecodes::_invokespecial: |
duke@435 | 2676 | case Bytecodes::_invokestatic: |
duke@435 | 2677 | case Bytecodes::_invokeinterface: |
duke@435 | 2678 | { |
never@2462 | 2679 | Bytecode_invoke invoke(sd->method(), sd->bci()); |
duke@435 | 2680 | st->print(" "); |
never@2462 | 2681 | if (invoke.name() != NULL) |
never@2462 | 2682 | invoke.name()->print_symbol_on(st); |
duke@435 | 2683 | else |
duke@435 | 2684 | st->print("<UNKNOWN>"); |
duke@435 | 2685 | break; |
duke@435 | 2686 | } |
duke@435 | 2687 | case Bytecodes::_getfield: |
duke@435 | 2688 | case Bytecodes::_putfield: |
duke@435 | 2689 | case Bytecodes::_getstatic: |
duke@435 | 2690 | case Bytecodes::_putstatic: |
duke@435 | 2691 | { |
never@2462 | 2692 | Bytecode_field field(sd->method(), sd->bci()); |
duke@435 | 2693 | st->print(" "); |
never@2462 | 2694 | if (field.name() != NULL) |
never@2462 | 2695 | field.name()->print_symbol_on(st); |
duke@435 | 2696 | else |
duke@435 | 2697 | st->print("<UNKNOWN>"); |
duke@435 | 2698 | } |
duke@435 | 2699 | } |
duke@435 | 2700 | } |
duke@435 | 2701 | } |
jrose@535 | 2702 | |
duke@435 | 2703 | // Print all scopes |
duke@435 | 2704 | for (;sd != NULL; sd = sd->sender()) { |
jrose@535 | 2705 | st->move_to(column); |
duke@435 | 2706 | st->print("; -"); |
duke@435 | 2707 | if (sd->method().is_null()) { |
jrose@535 | 2708 | st->print("method is NULL"); |
duke@435 | 2709 | } else { |
duke@435 | 2710 | sd->method()->print_short_name(st); |
duke@435 | 2711 | } |
duke@435 | 2712 | int lineno = sd->method()->line_number_from_bci(sd->bci()); |
duke@435 | 2713 | if (lineno != -1) { |
duke@435 | 2714 | st->print("@%d (line %d)", sd->bci(), lineno); |
duke@435 | 2715 | } else { |
duke@435 | 2716 | st->print("@%d", sd->bci()); |
duke@435 | 2717 | } |
duke@435 | 2718 | st->cr(); |
duke@435 | 2719 | } |
duke@435 | 2720 | } |
duke@435 | 2721 | |
duke@435 | 2722 | // Print relocation information |
duke@435 | 2723 | const char* str = reloc_string_for(begin, end); |
duke@435 | 2724 | if (str != NULL) { |
duke@435 | 2725 | if (sd != NULL) st->cr(); |
jrose@535 | 2726 | st->move_to(column); |
duke@435 | 2727 | st->print("; {%s}", str); |
duke@435 | 2728 | } |
twisti@2103 | 2729 | int cont_offset = ImplicitExceptionTable(this).at(begin - code_begin()); |
duke@435 | 2730 | if (cont_offset != 0) { |
jrose@535 | 2731 | st->move_to(column); |
twisti@2103 | 2732 | st->print("; implicit exception: dispatches to " INTPTR_FORMAT, code_begin() + cont_offset); |
duke@435 | 2733 | } |
duke@435 | 2734 | |
duke@435 | 2735 | } |
duke@435 | 2736 | |
jrose@535 | 2737 | #ifndef PRODUCT |
jrose@535 | 2738 | |
duke@435 | 2739 | void nmethod::print_value_on(outputStream* st) const { |
twisti@2687 | 2740 | st->print("nmethod"); |
twisti@2687 | 2741 | print_on(st, NULL); |
duke@435 | 2742 | } |
duke@435 | 2743 | |
duke@435 | 2744 | void nmethod::print_calls(outputStream* st) { |
duke@435 | 2745 | RelocIterator iter(this); |
duke@435 | 2746 | while (iter.next()) { |
duke@435 | 2747 | switch (iter.type()) { |
duke@435 | 2748 | case relocInfo::virtual_call_type: |
duke@435 | 2749 | case relocInfo::opt_virtual_call_type: { |
duke@435 | 2750 | VerifyMutexLocker mc(CompiledIC_lock); |
duke@435 | 2751 | CompiledIC_at(iter.reloc())->print(); |
duke@435 | 2752 | break; |
duke@435 | 2753 | } |
duke@435 | 2754 | case relocInfo::static_call_type: |
duke@435 | 2755 | st->print_cr("Static call at " INTPTR_FORMAT, iter.reloc()->addr()); |
duke@435 | 2756 | compiledStaticCall_at(iter.reloc())->print(); |
duke@435 | 2757 | break; |
duke@435 | 2758 | } |
duke@435 | 2759 | } |
duke@435 | 2760 | } |
duke@435 | 2761 | |
duke@435 | 2762 | void nmethod::print_handler_table() { |
duke@435 | 2763 | ExceptionHandlerTable(this).print(); |
duke@435 | 2764 | } |
duke@435 | 2765 | |
duke@435 | 2766 | void nmethod::print_nul_chk_table() { |
twisti@2103 | 2767 | ImplicitExceptionTable(this).print(code_begin()); |
duke@435 | 2768 | } |
duke@435 | 2769 | |
duke@435 | 2770 | void nmethod::print_statistics() { |
duke@435 | 2771 | ttyLocker ttyl; |
duke@435 | 2772 | if (xtty != NULL) xtty->head("statistics type='nmethod'"); |
duke@435 | 2773 | nmethod_stats.print_native_nmethod_stats(); |
duke@435 | 2774 | nmethod_stats.print_nmethod_stats(); |
duke@435 | 2775 | DebugInformationRecorder::print_statistics(); |
duke@435 | 2776 | nmethod_stats.print_pc_stats(); |
duke@435 | 2777 | Dependencies::print_statistics(); |
duke@435 | 2778 | if (xtty != NULL) xtty->tail("statistics"); |
duke@435 | 2779 | } |
duke@435 | 2780 | |
duke@435 | 2781 | #endif // PRODUCT |