src/share/vm/code/nmethod.cpp

Wed, 01 Feb 2012 07:59:01 -0800

author
never
date
Wed, 01 Feb 2012 07:59:01 -0800
changeset 3499
aa3d708d67c4
parent 3202
436b4a3231bf
child 3500
0382d2b469b2
permissions
-rw-r--r--

7141200: log some interesting information in ring buffers for crashes
Reviewed-by: kvn, jrose, kevinw, brutisso, twisti, jmasa

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

mercurial