annotate src/share/vm/code/nmethod.cpp @ 5664:78da3894b86f

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