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