frame.cpp revision 6760:22b98ab2a69f
1/* 2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25#include "precompiled.hpp" 26#include "code/codeCache.hpp" 27#include "code/vmreg.inline.hpp" 28#include "compiler/abstractCompiler.hpp" 29#include "compiler/disassembler.hpp" 30#include "gc_interface/collectedHeap.inline.hpp" 31#include "interpreter/interpreter.hpp" 32#include "interpreter/oopMapCache.hpp" 33#include "memory/resourceArea.hpp" 34#include "memory/universe.inline.hpp" 35#include "oops/markOop.hpp" 36#include "oops/methodData.hpp" 37#include "oops/method.hpp" 38#include "oops/oop.inline.hpp" 39#include "oops/oop.inline2.hpp" 40#include "prims/methodHandles.hpp" 41#include "runtime/frame.inline.hpp" 42#include "runtime/handles.inline.hpp" 43#include "runtime/javaCalls.hpp" 44#include "runtime/monitorChunk.hpp" 45#include "runtime/os.hpp" 46#include "runtime/sharedRuntime.hpp" 47#include "runtime/signature.hpp" 48#include "runtime/stubCodeGenerator.hpp" 49#include "runtime/stubRoutines.hpp" 50#include "runtime/thread.inline.hpp" 51#include "utilities/decoder.hpp" 52 53 54PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC 55 56RegisterMap::RegisterMap(JavaThread *thread, bool update_map) { 57 _thread = thread; 58 _update_map = update_map; 59 clear(); 60 debug_only(_update_for_id = NULL;) 61#ifndef PRODUCT 62 for (int i = 0; i < reg_count ; i++ ) _location[i] = NULL; 63#endif /* PRODUCT */ 64} 65 66RegisterMap::RegisterMap(const RegisterMap* map) { 67 assert(map != this, "bad initialization parameter"); 68 assert(map != NULL, "RegisterMap must be present"); 69 _thread = map->thread(); 70 _update_map = map->update_map(); 71 _include_argument_oops = map->include_argument_oops(); 72 debug_only(_update_for_id = map->_update_for_id;) 73 pd_initialize_from(map); 74 if (update_map()) { 75 for(int i = 0; i < location_valid_size; i++) { 76 LocationValidType bits = !update_map() ? 0 : map->_location_valid[i]; 77 _location_valid[i] = bits; 78 // for whichever bits are set, pull in the corresponding map->_location 79 int j = i*location_valid_type_size; 80 while (bits != 0) { 81 if ((bits & 1) != 0) { 82 assert(0 <= j && j < reg_count, "range check"); 83 _location[j] = map->_location[j]; 84 } 85 bits >>= 1; 86 j += 1; 87 } 88 } 89 } 90} 91 92void RegisterMap::clear() { 93 set_include_argument_oops(true); 94 if (_update_map) { 95 for(int i = 0; i < location_valid_size; i++) { 96 _location_valid[i] = 0; 97 } 98 pd_clear(); 99 } else { 100 pd_initialize(); 101 } 102} 103 104#ifndef PRODUCT 105 106void RegisterMap::print_on(outputStream* st) const { 107 st->print_cr("Register map"); 108 for(int i = 0; i < reg_count; i++) { 109 110 VMReg r = VMRegImpl::as_VMReg(i); 111 intptr_t* src = (intptr_t*) location(r); 112 if (src != NULL) { 113 114 r->print_on(st); 115 st->print(" [" INTPTR_FORMAT "] = ", src); 116 if (((uintptr_t)src & (sizeof(*src)-1)) != 0) { 117 st->print_cr("<misaligned>"); 118 } else { 119 st->print_cr(INTPTR_FORMAT, *src); 120 } 121 } 122 } 123} 124 125void RegisterMap::print() const { 126 print_on(tty); 127} 128 129#endif 130// This returns the pc that if you were in the debugger you'd see. Not 131// the idealized value in the frame object. This undoes the magic conversion 132// that happens for deoptimized frames. In addition it makes the value the 133// hardware would want to see in the native frame. The only user (at this point) 134// is deoptimization. It likely no one else should ever use it. 135 136address frame::raw_pc() const { 137 if (is_deoptimized_frame()) { 138 nmethod* nm = cb()->as_nmethod_or_null(); 139 if (nm->is_method_handle_return(pc())) 140 return nm->deopt_mh_handler_begin() - pc_return_offset; 141 else 142 return nm->deopt_handler_begin() - pc_return_offset; 143 } else { 144 return (pc() - pc_return_offset); 145 } 146} 147 148// Change the pc in a frame object. This does not change the actual pc in 149// actual frame. To do that use patch_pc. 150// 151void frame::set_pc(address newpc ) { 152#ifdef ASSERT 153 if (_cb != NULL && _cb->is_nmethod()) { 154 assert(!((nmethod*)_cb)->is_deopt_pc(_pc), "invariant violation"); 155 } 156#endif // ASSERT 157 158 // Unsafe to use the is_deoptimzed tester after changing pc 159 _deopt_state = unknown; 160 _pc = newpc; 161 _cb = CodeCache::find_blob_unsafe(_pc); 162 163} 164 165// type testers 166bool frame::is_ignored_frame() const { 167 return false; // FIXME: some LambdaForm frames should be ignored 168} 169bool frame::is_deoptimized_frame() const { 170 assert(_deopt_state != unknown, "not answerable"); 171 return _deopt_state == is_deoptimized; 172} 173 174bool frame::is_native_frame() const { 175 return (_cb != NULL && 176 _cb->is_nmethod() && 177 ((nmethod*)_cb)->is_native_method()); 178} 179 180bool frame::is_java_frame() const { 181 if (is_interpreted_frame()) return true; 182 if (is_compiled_frame()) return true; 183 return false; 184} 185 186 187bool frame::is_compiled_frame() const { 188 if (_cb != NULL && 189 _cb->is_nmethod() && 190 ((nmethod*)_cb)->is_java_method()) { 191 return true; 192 } 193 return false; 194} 195 196 197bool frame::is_runtime_frame() const { 198 return (_cb != NULL && _cb->is_runtime_stub()); 199} 200 201bool frame::is_safepoint_blob_frame() const { 202 return (_cb != NULL && _cb->is_safepoint_stub()); 203} 204 205// testers 206 207bool frame::is_first_java_frame() const { 208 RegisterMap map(JavaThread::current(), false); // No update 209 frame s; 210 for (s = sender(&map); !(s.is_java_frame() || s.is_first_frame()); s = s.sender(&map)); 211 return s.is_first_frame(); 212} 213 214 215bool frame::entry_frame_is_first() const { 216 return entry_frame_call_wrapper()->is_first_frame(); 217} 218 219JavaCallWrapper* frame::entry_frame_call_wrapper_if_safe(JavaThread* thread) const { 220 JavaCallWrapper** jcw = entry_frame_call_wrapper_addr(); 221 address addr = (address) jcw; 222 223 // addr must be within the usable part of the stack 224 if (thread->is_in_usable_stack(addr)) { 225 return *jcw; 226 } 227 228 return NULL; 229} 230 231bool frame::should_be_deoptimized() const { 232 if (_deopt_state == is_deoptimized || 233 !is_compiled_frame() ) return false; 234 assert(_cb != NULL && _cb->is_nmethod(), "must be an nmethod"); 235 nmethod* nm = (nmethod *)_cb; 236 if (TraceDependencies) { 237 tty->print("checking (%s) ", nm->is_marked_for_deoptimization() ? "true" : "false"); 238 nm->print_value_on(tty); 239 tty->cr(); 240 } 241 242 if( !nm->is_marked_for_deoptimization() ) 243 return false; 244 245 // If at the return point, then the frame has already been popped, and 246 // only the return needs to be executed. Don't deoptimize here. 247 return !nm->is_at_poll_return(pc()); 248} 249 250bool frame::can_be_deoptimized() const { 251 if (!is_compiled_frame()) return false; 252 nmethod* nm = (nmethod*)_cb; 253 254 if( !nm->can_be_deoptimized() ) 255 return false; 256 257 return !nm->is_at_poll_return(pc()); 258} 259 260void frame::deoptimize(JavaThread* thread) { 261 // Schedule deoptimization of an nmethod activation with this frame. 262 assert(_cb != NULL && _cb->is_nmethod(), "must be"); 263 nmethod* nm = (nmethod*)_cb; 264 265 // This is a fix for register window patching race 266 if (NeedsDeoptSuspend && Thread::current() != thread) { 267 assert(SafepointSynchronize::is_at_safepoint(), 268 "patching other threads for deopt may only occur at a safepoint"); 269 270 // It is possible especially with DeoptimizeALot/DeoptimizeRandom that 271 // we could see the frame again and ask for it to be deoptimized since 272 // it might move for a long time. That is harmless and we just ignore it. 273 if (id() == thread->must_deopt_id()) { 274 assert(thread->is_deopt_suspend(), "lost suspension"); 275 return; 276 } 277 278 // We are at a safepoint so the target thread can only be 279 // in 4 states: 280 // blocked - no problem 281 // blocked_trans - no problem (i.e. could have woken up from blocked 282 // during a safepoint). 283 // native - register window pc patching race 284 // native_trans - momentary state 285 // 286 // We could just wait out a thread in native_trans to block. 287 // Then we'd have all the issues that the safepoint code has as to 288 // whether to spin or block. It isn't worth it. Just treat it like 289 // native and be done with it. 290 // 291 // Examine the state of the thread at the start of safepoint since 292 // threads that were in native at the start of the safepoint could 293 // come to a halt during the safepoint, changing the current value 294 // of the safepoint_state. 295 JavaThreadState state = thread->safepoint_state()->orig_thread_state(); 296 if (state == _thread_in_native || state == _thread_in_native_trans) { 297 // Since we are at a safepoint the target thread will stop itself 298 // before it can return to java as long as we remain at the safepoint. 299 // Therefore we can put an additional request for the thread to stop 300 // no matter what no (like a suspend). This will cause the thread 301 // to notice it needs to do the deopt on its own once it leaves native. 302 // 303 // The only reason we must do this is because on machine with register 304 // windows we have a race with patching the return address and the 305 // window coming live as the thread returns to the Java code (but still 306 // in native mode) and then blocks. It is only this top most frame 307 // that is at risk. So in truth we could add an additional check to 308 // see if this frame is one that is at risk. 309 RegisterMap map(thread, false); 310 frame at_risk = thread->last_frame().sender(&map); 311 if (id() == at_risk.id()) { 312 thread->set_must_deopt_id(id()); 313 thread->set_deopt_suspend(); 314 return; 315 } 316 } 317 } // NeedsDeoptSuspend 318 319 320 // If the call site is a MethodHandle call site use the MH deopt 321 // handler. 322 address deopt = nm->is_method_handle_return(pc()) ? 323 nm->deopt_mh_handler_begin() : 324 nm->deopt_handler_begin(); 325 326 // Save the original pc before we patch in the new one 327 nm->set_original_pc(this, pc()); 328 patch_pc(thread, deopt); 329 330#ifdef ASSERT 331 { 332 RegisterMap map(thread, false); 333 frame check = thread->last_frame(); 334 while (id() != check.id()) { 335 check = check.sender(&map); 336 } 337 assert(check.is_deoptimized_frame(), "missed deopt"); 338 } 339#endif // ASSERT 340} 341 342frame frame::java_sender() const { 343 RegisterMap map(JavaThread::current(), false); 344 frame s; 345 for (s = sender(&map); !(s.is_java_frame() || s.is_first_frame()); s = s.sender(&map)) ; 346 guarantee(s.is_java_frame(), "tried to get caller of first java frame"); 347 return s; 348} 349 350frame frame::real_sender(RegisterMap* map) const { 351 frame result = sender(map); 352 while (result.is_runtime_frame() || 353 result.is_ignored_frame()) { 354 result = result.sender(map); 355 } 356 return result; 357} 358 359// Note: called by profiler - NOT for current thread 360frame frame::profile_find_Java_sender_frame(JavaThread *thread) { 361// If we don't recognize this frame, walk back up the stack until we do 362 RegisterMap map(thread, false); 363 frame first_java_frame = frame(); 364 365 // Find the first Java frame on the stack starting with input frame 366 if (is_java_frame()) { 367 // top frame is compiled frame or deoptimized frame 368 first_java_frame = *this; 369 } else if (safe_for_sender(thread)) { 370 for (frame sender_frame = sender(&map); 371 sender_frame.safe_for_sender(thread) && !sender_frame.is_first_frame(); 372 sender_frame = sender_frame.sender(&map)) { 373 if (sender_frame.is_java_frame()) { 374 first_java_frame = sender_frame; 375 break; 376 } 377 } 378 } 379 return first_java_frame; 380} 381 382// Interpreter frames 383 384 385void frame::interpreter_frame_set_locals(intptr_t* locs) { 386 assert(is_interpreted_frame(), "Not an interpreted frame"); 387 *interpreter_frame_locals_addr() = locs; 388} 389 390Method* frame::interpreter_frame_method() const { 391 assert(is_interpreted_frame(), "interpreted frame expected"); 392 Method* m = *interpreter_frame_method_addr(); 393 assert(m->is_method(), "not a Method*"); 394 return m; 395} 396 397void frame::interpreter_frame_set_method(Method* method) { 398 assert(is_interpreted_frame(), "interpreted frame expected"); 399 *interpreter_frame_method_addr() = method; 400} 401 402void frame::interpreter_frame_set_bcx(intptr_t bcx) { 403 assert(is_interpreted_frame(), "Not an interpreted frame"); 404 if (ProfileInterpreter) { 405 bool formerly_bci = is_bci(interpreter_frame_bcx()); 406 bool is_now_bci = is_bci(bcx); 407 *interpreter_frame_bcx_addr() = bcx; 408 409 intptr_t mdx = interpreter_frame_mdx(); 410 411 if (mdx != 0) { 412 if (formerly_bci) { 413 if (!is_now_bci) { 414 // The bcx was just converted from bci to bcp. 415 // Convert the mdx in parallel. 416 MethodData* mdo = interpreter_frame_method()->method_data(); 417 assert(mdo != NULL, ""); 418 int mdi = mdx - 1; // We distinguish valid mdi from zero by adding one. 419 address mdp = mdo->di_to_dp(mdi); 420 interpreter_frame_set_mdx((intptr_t)mdp); 421 } 422 } else { 423 if (is_now_bci) { 424 // The bcx was just converted from bcp to bci. 425 // Convert the mdx in parallel. 426 MethodData* mdo = interpreter_frame_method()->method_data(); 427 assert(mdo != NULL, ""); 428 int mdi = mdo->dp_to_di((address)mdx); 429 interpreter_frame_set_mdx((intptr_t)mdi + 1); // distinguish valid from 0. 430 } 431 } 432 } 433 } else { 434 *interpreter_frame_bcx_addr() = bcx; 435 } 436} 437 438jint frame::interpreter_frame_bci() const { 439 assert(is_interpreted_frame(), "interpreted frame expected"); 440 intptr_t bcx = interpreter_frame_bcx(); 441 return is_bci(bcx) ? bcx : interpreter_frame_method()->bci_from((address)bcx); 442} 443 444void frame::interpreter_frame_set_bci(jint bci) { 445 assert(is_interpreted_frame(), "interpreted frame expected"); 446 assert(!is_bci(interpreter_frame_bcx()), "should not set bci during GC"); 447 interpreter_frame_set_bcx((intptr_t)interpreter_frame_method()->bcp_from(bci)); 448} 449 450address frame::interpreter_frame_bcp() const { 451 assert(is_interpreted_frame(), "interpreted frame expected"); 452 intptr_t bcx = interpreter_frame_bcx(); 453 return is_bci(bcx) ? interpreter_frame_method()->bcp_from(bcx) : (address)bcx; 454} 455 456void frame::interpreter_frame_set_bcp(address bcp) { 457 assert(is_interpreted_frame(), "interpreted frame expected"); 458 assert(!is_bci(interpreter_frame_bcx()), "should not set bcp during GC"); 459 interpreter_frame_set_bcx((intptr_t)bcp); 460} 461 462void frame::interpreter_frame_set_mdx(intptr_t mdx) { 463 assert(is_interpreted_frame(), "Not an interpreted frame"); 464 assert(ProfileInterpreter, "must be profiling interpreter"); 465 *interpreter_frame_mdx_addr() = mdx; 466} 467 468address frame::interpreter_frame_mdp() const { 469 assert(ProfileInterpreter, "must be profiling interpreter"); 470 assert(is_interpreted_frame(), "interpreted frame expected"); 471 intptr_t bcx = interpreter_frame_bcx(); 472 intptr_t mdx = interpreter_frame_mdx(); 473 474 assert(!is_bci(bcx), "should not access mdp during GC"); 475 return (address)mdx; 476} 477 478void frame::interpreter_frame_set_mdp(address mdp) { 479 assert(is_interpreted_frame(), "interpreted frame expected"); 480 if (mdp == NULL) { 481 // Always allow the mdp to be cleared. 482 interpreter_frame_set_mdx((intptr_t)mdp); 483 } 484 intptr_t bcx = interpreter_frame_bcx(); 485 assert(!is_bci(bcx), "should not set mdp during GC"); 486 interpreter_frame_set_mdx((intptr_t)mdp); 487} 488 489BasicObjectLock* frame::next_monitor_in_interpreter_frame(BasicObjectLock* current) const { 490 assert(is_interpreted_frame(), "Not an interpreted frame"); 491#ifdef ASSERT 492 interpreter_frame_verify_monitor(current); 493#endif 494 BasicObjectLock* next = (BasicObjectLock*) (((intptr_t*) current) + interpreter_frame_monitor_size()); 495 return next; 496} 497 498BasicObjectLock* frame::previous_monitor_in_interpreter_frame(BasicObjectLock* current) const { 499 assert(is_interpreted_frame(), "Not an interpreted frame"); 500#ifdef ASSERT 501// // This verification needs to be checked before being enabled 502// interpreter_frame_verify_monitor(current); 503#endif 504 BasicObjectLock* previous = (BasicObjectLock*) (((intptr_t*) current) - interpreter_frame_monitor_size()); 505 return previous; 506} 507 508// Interpreter locals and expression stack locations. 509 510intptr_t* frame::interpreter_frame_local_at(int index) const { 511 const int n = Interpreter::local_offset_in_bytes(index)/wordSize; 512 return &((*interpreter_frame_locals_addr())[n]); 513} 514 515intptr_t* frame::interpreter_frame_expression_stack_at(jint offset) const { 516 const int i = offset * interpreter_frame_expression_stack_direction(); 517 const int n = i * Interpreter::stackElementWords; 518 return &(interpreter_frame_expression_stack()[n]); 519} 520 521jint frame::interpreter_frame_expression_stack_size() const { 522 // Number of elements on the interpreter expression stack 523 // Callers should span by stackElementWords 524 int element_size = Interpreter::stackElementWords; 525 size_t stack_size = 0; 526 if (frame::interpreter_frame_expression_stack_direction() < 0) { 527 stack_size = (interpreter_frame_expression_stack() - 528 interpreter_frame_tos_address() + 1)/element_size; 529 } else { 530 stack_size = (interpreter_frame_tos_address() - 531 interpreter_frame_expression_stack() + 1)/element_size; 532 } 533 assert( stack_size <= (size_t)max_jint, "stack size too big"); 534 return ((jint)stack_size); 535} 536 537 538// (frame::interpreter_frame_sender_sp accessor is in frame_<arch>.cpp) 539 540const char* frame::print_name() const { 541 if (is_native_frame()) return "Native"; 542 if (is_interpreted_frame()) return "Interpreted"; 543 if (is_compiled_frame()) { 544 if (is_deoptimized_frame()) return "Deoptimized"; 545 return "Compiled"; 546 } 547 if (sp() == NULL) return "Empty"; 548 return "C"; 549} 550 551void frame::print_value_on(outputStream* st, JavaThread *thread) const { 552 NOT_PRODUCT(address begin = pc()-40;) 553 NOT_PRODUCT(address end = NULL;) 554 555 st->print("%s frame (sp=" INTPTR_FORMAT " unextended sp=" INTPTR_FORMAT, print_name(), sp(), unextended_sp()); 556 if (sp() != NULL) 557 st->print(", fp=" INTPTR_FORMAT ", real_fp=" INTPTR_FORMAT ", pc=" INTPTR_FORMAT, fp(), real_fp(), pc()); 558 559 if (StubRoutines::contains(pc())) { 560 st->print_cr(")"); 561 st->print("("); 562 StubCodeDesc* desc = StubCodeDesc::desc_for(pc()); 563 st->print("~Stub::%s", desc->name()); 564 NOT_PRODUCT(begin = desc->begin(); end = desc->end();) 565 } else if (Interpreter::contains(pc())) { 566 st->print_cr(")"); 567 st->print("("); 568 InterpreterCodelet* desc = Interpreter::codelet_containing(pc()); 569 if (desc != NULL) { 570 st->print("~"); 571 desc->print_on(st); 572 NOT_PRODUCT(begin = desc->code_begin(); end = desc->code_end();) 573 } else { 574 st->print("~interpreter"); 575 } 576 } 577 st->print_cr(")"); 578 579 if (_cb != NULL) { 580 st->print(" "); 581 _cb->print_value_on(st); 582 st->cr(); 583#ifndef PRODUCT 584 if (end == NULL) { 585 begin = _cb->code_begin(); 586 end = _cb->code_end(); 587 } 588#endif 589 } 590 NOT_PRODUCT(if (WizardMode && Verbose) Disassembler::decode(begin, end);) 591} 592 593 594void frame::print_on(outputStream* st) const { 595 print_value_on(st,NULL); 596 if (is_interpreted_frame()) { 597 interpreter_frame_print_on(st); 598 } 599} 600 601 602void frame::interpreter_frame_print_on(outputStream* st) const { 603#ifndef PRODUCT 604 assert(is_interpreted_frame(), "Not an interpreted frame"); 605 jint i; 606 for (i = 0; i < interpreter_frame_method()->max_locals(); i++ ) { 607 intptr_t x = *interpreter_frame_local_at(i); 608 st->print(" - local [" INTPTR_FORMAT "]", x); 609 st->fill_to(23); 610 st->print_cr("; #%d", i); 611 } 612 for (i = interpreter_frame_expression_stack_size() - 1; i >= 0; --i ) { 613 intptr_t x = *interpreter_frame_expression_stack_at(i); 614 st->print(" - stack [" INTPTR_FORMAT "]", x); 615 st->fill_to(23); 616 st->print_cr("; #%d", i); 617 } 618 // locks for synchronization 619 for (BasicObjectLock* current = interpreter_frame_monitor_end(); 620 current < interpreter_frame_monitor_begin(); 621 current = next_monitor_in_interpreter_frame(current)) { 622 st->print(" - obj ["); 623 current->obj()->print_value_on(st); 624 st->print_cr("]"); 625 st->print(" - lock ["); 626 current->lock()->print_on(st); 627 st->print_cr("]"); 628 } 629 // monitor 630 st->print_cr(" - monitor[" INTPTR_FORMAT "]", interpreter_frame_monitor_begin()); 631 // bcp 632 st->print(" - bcp [" INTPTR_FORMAT "]", interpreter_frame_bcp()); 633 st->fill_to(23); 634 st->print_cr("; @%d", interpreter_frame_bci()); 635 // locals 636 st->print_cr(" - locals [" INTPTR_FORMAT "]", interpreter_frame_local_at(0)); 637 // method 638 st->print(" - method [" INTPTR_FORMAT "]", (address)interpreter_frame_method()); 639 st->fill_to(23); 640 st->print("; "); 641 interpreter_frame_method()->print_name(st); 642 st->cr(); 643#endif 644} 645 646// Print whether the frame is in the VM or OS indicating a HotSpot problem. 647// Otherwise, it's likely a bug in the native library that the Java code calls, 648// hopefully indicating where to submit bugs. 649void frame::print_C_frame(outputStream* st, char* buf, int buflen, address pc) { 650 // C/C++ frame 651 bool in_vm = os::address_is_in_vm(pc); 652 st->print(in_vm ? "V" : "C"); 653 654 int offset; 655 bool found; 656 657 // libname 658 found = os::dll_address_to_library_name(pc, buf, buflen, &offset); 659 if (found) { 660 // skip directory names 661 const char *p1, *p2; 662 p1 = buf; 663 int len = (int)strlen(os::file_separator()); 664 while ((p2 = strstr(p1, os::file_separator())) != NULL) p1 = p2 + len; 665 st->print(" [%s+0x%x]", p1, offset); 666 } else { 667 st->print(" " PTR_FORMAT, pc); 668 } 669 670 // function name - os::dll_address_to_function_name() may return confusing 671 // names if pc is within jvm.dll or libjvm.so, because JVM only has 672 // JVM_xxxx and a few other symbols in the dynamic symbol table. Do this 673 // only for native libraries. 674 if (!in_vm || Decoder::can_decode_C_frame_in_vm()) { 675 found = os::dll_address_to_function_name(pc, buf, buflen, &offset); 676 677 if (found) { 678 st->print(" %s+0x%x", buf, offset); 679 } 680 } 681} 682 683// frame::print_on_error() is called by fatal error handler. Notice that we may 684// crash inside this function if stack frame is corrupted. The fatal error 685// handler can catch and handle the crash. Here we assume the frame is valid. 686// 687// First letter indicates type of the frame: 688// J: Java frame (compiled) 689// j: Java frame (interpreted) 690// V: VM frame (C/C++) 691// v: Other frames running VM generated code (e.g. stubs, adapters, etc.) 692// C: C/C++ frame 693// 694// We don't need detailed frame type as that in frame::print_name(). "C" 695// suggests the problem is in user lib; everything else is likely a VM bug. 696 697void frame::print_on_error(outputStream* st, char* buf, int buflen, bool verbose) const { 698 if (_cb != NULL) { 699 if (Interpreter::contains(pc())) { 700 Method* m = this->interpreter_frame_method(); 701 if (m != NULL) { 702 m->name_and_sig_as_C_string(buf, buflen); 703 st->print("j %s", buf); 704 st->print("+%d", this->interpreter_frame_bci()); 705 } else { 706 st->print("j " PTR_FORMAT, pc()); 707 } 708 } else if (StubRoutines::contains(pc())) { 709 StubCodeDesc* desc = StubCodeDesc::desc_for(pc()); 710 if (desc != NULL) { 711 st->print("v ~StubRoutines::%s", desc->name()); 712 } else { 713 st->print("v ~StubRoutines::" PTR_FORMAT, pc()); 714 } 715 } else if (_cb->is_buffer_blob()) { 716 st->print("v ~BufferBlob::%s", ((BufferBlob *)_cb)->name()); 717 } else if (_cb->is_nmethod()) { 718 nmethod* nm = (nmethod*)_cb; 719 Method* m = nm->method(); 720 if (m != NULL) { 721 m->name_and_sig_as_C_string(buf, buflen); 722 st->print("J %d%s %s %s (%d bytes) @ " PTR_FORMAT " [" PTR_FORMAT "+0x%x]", 723 nm->compile_id(), (nm->is_osr_method() ? "%" : ""), 724 ((nm->compiler() != NULL) ? nm->compiler()->name() : ""), 725 buf, m->code_size(), _pc, _cb->code_begin(), _pc - _cb->code_begin()); 726 } else { 727 st->print("J " PTR_FORMAT, pc()); 728 } 729 } else if (_cb->is_runtime_stub()) { 730 st->print("v ~RuntimeStub::%s", ((RuntimeStub *)_cb)->name()); 731 } else if (_cb->is_deoptimization_stub()) { 732 st->print("v ~DeoptimizationBlob"); 733 } else if (_cb->is_exception_stub()) { 734 st->print("v ~ExceptionBlob"); 735 } else if (_cb->is_safepoint_stub()) { 736 st->print("v ~SafepointBlob"); 737 } else { 738 st->print("v blob " PTR_FORMAT, pc()); 739 } 740 } else { 741 print_C_frame(st, buf, buflen, pc()); 742 } 743} 744 745 746/* 747 The interpreter_frame_expression_stack_at method in the case of SPARC needs the 748 max_stack value of the method in order to compute the expression stack address. 749 It uses the Method* in order to get the max_stack value but during GC this 750 Method* value saved on the frame is changed by reverse_and_push and hence cannot 751 be used. So we save the max_stack value in the FrameClosure object and pass it 752 down to the interpreter_frame_expression_stack_at method 753*/ 754class InterpreterFrameClosure : public OffsetClosure { 755 private: 756 frame* _fr; 757 OopClosure* _f; 758 int _max_locals; 759 int _max_stack; 760 761 public: 762 InterpreterFrameClosure(frame* fr, int max_locals, int max_stack, 763 OopClosure* f) { 764 _fr = fr; 765 _max_locals = max_locals; 766 _max_stack = max_stack; 767 _f = f; 768 } 769 770 void offset_do(int offset) { 771 oop* addr; 772 if (offset < _max_locals) { 773 addr = (oop*) _fr->interpreter_frame_local_at(offset); 774 assert((intptr_t*)addr >= _fr->sp(), "must be inside the frame"); 775 _f->do_oop(addr); 776 } else { 777 addr = (oop*) _fr->interpreter_frame_expression_stack_at((offset - _max_locals)); 778 // In case of exceptions, the expression stack is invalid and the esp will be reset to express 779 // this condition. Therefore, we call f only if addr is 'inside' the stack (i.e., addr >= esp for Intel). 780 bool in_stack; 781 if (frame::interpreter_frame_expression_stack_direction() > 0) { 782 in_stack = (intptr_t*)addr <= _fr->interpreter_frame_tos_address(); 783 } else { 784 in_stack = (intptr_t*)addr >= _fr->interpreter_frame_tos_address(); 785 } 786 if (in_stack) { 787 _f->do_oop(addr); 788 } 789 } 790 } 791 792 int max_locals() { return _max_locals; } 793 frame* fr() { return _fr; } 794}; 795 796 797class InterpretedArgumentOopFinder: public SignatureInfo { 798 private: 799 OopClosure* _f; // Closure to invoke 800 int _offset; // TOS-relative offset, decremented with each argument 801 bool _has_receiver; // true if the callee has a receiver 802 frame* _fr; 803 804 void set(int size, BasicType type) { 805 _offset -= size; 806 if (type == T_OBJECT || type == T_ARRAY) oop_offset_do(); 807 } 808 809 void oop_offset_do() { 810 oop* addr; 811 addr = (oop*)_fr->interpreter_frame_tos_at(_offset); 812 _f->do_oop(addr); 813 } 814 815 public: 816 InterpretedArgumentOopFinder(Symbol* signature, bool has_receiver, frame* fr, OopClosure* f) : SignatureInfo(signature), _has_receiver(has_receiver) { 817 // compute size of arguments 818 int args_size = ArgumentSizeComputer(signature).size() + (has_receiver ? 1 : 0); 819 assert(!fr->is_interpreted_frame() || 820 args_size <= fr->interpreter_frame_expression_stack_size(), 821 "args cannot be on stack anymore"); 822 // initialize InterpretedArgumentOopFinder 823 _f = f; 824 _fr = fr; 825 _offset = args_size; 826 } 827 828 void oops_do() { 829 if (_has_receiver) { 830 --_offset; 831 oop_offset_do(); 832 } 833 iterate_parameters(); 834 } 835}; 836 837 838// Entry frame has following form (n arguments) 839// +-----------+ 840// sp -> | last arg | 841// +-----------+ 842// : ::: : 843// +-----------+ 844// (sp+n)->| first arg| 845// +-----------+ 846 847 848 849// visits and GC's all the arguments in entry frame 850class EntryFrameOopFinder: public SignatureInfo { 851 private: 852 bool _is_static; 853 int _offset; 854 frame* _fr; 855 OopClosure* _f; 856 857 void set(int size, BasicType type) { 858 assert (_offset >= 0, "illegal offset"); 859 if (type == T_OBJECT || type == T_ARRAY) oop_at_offset_do(_offset); 860 _offset -= size; 861 } 862 863 void oop_at_offset_do(int offset) { 864 assert (offset >= 0, "illegal offset"); 865 oop* addr = (oop*) _fr->entry_frame_argument_at(offset); 866 _f->do_oop(addr); 867 } 868 869 public: 870 EntryFrameOopFinder(frame* frame, Symbol* signature, bool is_static) : SignatureInfo(signature) { 871 _f = NULL; // will be set later 872 _fr = frame; 873 _is_static = is_static; 874 _offset = ArgumentSizeComputer(signature).size() - 1; // last parameter is at index 0 875 } 876 877 void arguments_do(OopClosure* f) { 878 _f = f; 879 if (!_is_static) oop_at_offset_do(_offset+1); // do the receiver 880 iterate_parameters(); 881 } 882 883}; 884 885oop* frame::interpreter_callee_receiver_addr(Symbol* signature) { 886 ArgumentSizeComputer asc(signature); 887 int size = asc.size(); 888 return (oop *)interpreter_frame_tos_at(size); 889} 890 891 892void frame::oops_interpreted_do(OopClosure* f, CLDClosure* cld_f, 893 const RegisterMap* map, bool query_oop_map_cache) { 894 assert(is_interpreted_frame(), "Not an interpreted frame"); 895 assert(map != NULL, "map must be set"); 896 Thread *thread = Thread::current(); 897 methodHandle m (thread, interpreter_frame_method()); 898 jint bci = interpreter_frame_bci(); 899 900 assert(!Universe::heap()->is_in(m()), 901 "must be valid oop"); 902 assert(m->is_method(), "checking frame value"); 903 assert((m->is_native() && bci == 0) || 904 (!m->is_native() && bci >= 0 && bci < m->code_size()), 905 "invalid bci value"); 906 907 // Handle the monitor elements in the activation 908 for ( 909 BasicObjectLock* current = interpreter_frame_monitor_end(); 910 current < interpreter_frame_monitor_begin(); 911 current = next_monitor_in_interpreter_frame(current) 912 ) { 913#ifdef ASSERT 914 interpreter_frame_verify_monitor(current); 915#endif 916 current->oops_do(f); 917 } 918 919 // process fixed part 920 if (cld_f != NULL) { 921 // The method pointer in the frame might be the only path to the method's 922 // klass, and the klass needs to be kept alive while executing. The GCs 923 // don't trace through method pointers, so typically in similar situations 924 // the mirror or the class loader of the klass are installed as a GC root. 925 // To minimize the overhead of doing that here, we ask the GC to pass down a 926 // closure that knows how to keep klasses alive given a ClassLoaderData. 927 cld_f->do_cld(m->method_holder()->class_loader_data()); 928 } 929 930 if (m->is_native() PPC32_ONLY(&& m->is_static())) { 931 f->do_oop(interpreter_frame_temp_oop_addr()); 932 } 933 934 int max_locals = m->is_native() ? m->size_of_parameters() : m->max_locals(); 935 936 Symbol* signature = NULL; 937 bool has_receiver = false; 938 939 // Process a callee's arguments if we are at a call site 940 // (i.e., if we are at an invoke bytecode) 941 // This is used sometimes for calling into the VM, not for another 942 // interpreted or compiled frame. 943 if (!m->is_native()) { 944 Bytecode_invoke call = Bytecode_invoke_check(m, bci); 945 if (call.is_valid()) { 946 signature = call.signature(); 947 has_receiver = call.has_receiver(); 948 if (map->include_argument_oops() && 949 interpreter_frame_expression_stack_size() > 0) { 950 ResourceMark rm(thread); // is this right ??? 951 // we are at a call site & the expression stack is not empty 952 // => process callee's arguments 953 // 954 // Note: The expression stack can be empty if an exception 955 // occurred during method resolution/execution. In all 956 // cases we empty the expression stack completely be- 957 // fore handling the exception (the exception handling 958 // code in the interpreter calls a blocking runtime 959 // routine which can cause this code to be executed). 960 // (was bug gri 7/27/98) 961 oops_interpreted_arguments_do(signature, has_receiver, f); 962 } 963 } 964 } 965 966 InterpreterFrameClosure blk(this, max_locals, m->max_stack(), f); 967 968 // process locals & expression stack 969 InterpreterOopMap mask; 970 if (query_oop_map_cache) { 971 m->mask_for(bci, &mask); 972 } else { 973 OopMapCache::compute_one_oop_map(m, bci, &mask); 974 } 975 mask.iterate_oop(&blk); 976} 977 978 979void frame::oops_interpreted_arguments_do(Symbol* signature, bool has_receiver, OopClosure* f) { 980 InterpretedArgumentOopFinder finder(signature, has_receiver, this, f); 981 finder.oops_do(); 982} 983 984void frame::oops_code_blob_do(OopClosure* f, CodeBlobClosure* cf, const RegisterMap* reg_map) { 985 assert(_cb != NULL, "sanity check"); 986 if (_cb->oop_maps() != NULL) { 987 OopMapSet::oops_do(this, reg_map, f); 988 989 // Preserve potential arguments for a callee. We handle this by dispatching 990 // on the codeblob. For c2i, we do 991 if (reg_map->include_argument_oops()) { 992 _cb->preserve_callee_argument_oops(*this, reg_map, f); 993 } 994 } 995 // In cases where perm gen is collected, GC will want to mark 996 // oops referenced from nmethods active on thread stacks so as to 997 // prevent them from being collected. However, this visit should be 998 // restricted to certain phases of the collection only. The 999 // closure decides how it wants nmethods to be traced. 1000 if (cf != NULL) 1001 cf->do_code_blob(_cb); 1002} 1003 1004class CompiledArgumentOopFinder: public SignatureInfo { 1005 protected: 1006 OopClosure* _f; 1007 int _offset; // the current offset, incremented with each argument 1008 bool _has_receiver; // true if the callee has a receiver 1009 bool _has_appendix; // true if the call has an appendix 1010 frame _fr; 1011 RegisterMap* _reg_map; 1012 int _arg_size; 1013 VMRegPair* _regs; // VMReg list of arguments 1014 1015 void set(int size, BasicType type) { 1016 if (type == T_OBJECT || type == T_ARRAY) handle_oop_offset(); 1017 _offset += size; 1018 } 1019 1020 virtual void handle_oop_offset() { 1021 // Extract low order register number from register array. 1022 // In LP64-land, the high-order bits are valid but unhelpful. 1023 VMReg reg = _regs[_offset].first(); 1024 oop *loc = _fr.oopmapreg_to_location(reg, _reg_map); 1025 _f->do_oop(loc); 1026 } 1027 1028 public: 1029 CompiledArgumentOopFinder(Symbol* signature, bool has_receiver, bool has_appendix, OopClosure* f, frame fr, const RegisterMap* reg_map) 1030 : SignatureInfo(signature) { 1031 1032 // initialize CompiledArgumentOopFinder 1033 _f = f; 1034 _offset = 0; 1035 _has_receiver = has_receiver; 1036 _has_appendix = has_appendix; 1037 _fr = fr; 1038 _reg_map = (RegisterMap*)reg_map; 1039 _arg_size = ArgumentSizeComputer(signature).size() + (has_receiver ? 1 : 0) + (has_appendix ? 1 : 0); 1040 1041 int arg_size; 1042 _regs = SharedRuntime::find_callee_arguments(signature, has_receiver, has_appendix, &arg_size); 1043 assert(arg_size == _arg_size, "wrong arg size"); 1044 } 1045 1046 void oops_do() { 1047 if (_has_receiver) { 1048 handle_oop_offset(); 1049 _offset++; 1050 } 1051 iterate_parameters(); 1052 if (_has_appendix) { 1053 handle_oop_offset(); 1054 _offset++; 1055 } 1056 } 1057}; 1058 1059void frame::oops_compiled_arguments_do(Symbol* signature, bool has_receiver, bool has_appendix, const RegisterMap* reg_map, OopClosure* f) { 1060 ResourceMark rm; 1061 CompiledArgumentOopFinder finder(signature, has_receiver, has_appendix, f, *this, reg_map); 1062 finder.oops_do(); 1063} 1064 1065 1066// Get receiver out of callers frame, i.e. find parameter 0 in callers 1067// frame. Consult ADLC for where parameter 0 is to be found. Then 1068// check local reg_map for it being a callee-save register or argument 1069// register, both of which are saved in the local frame. If not found 1070// there, it must be an in-stack argument of the caller. 1071// Note: caller.sp() points to callee-arguments 1072oop frame::retrieve_receiver(RegisterMap* reg_map) { 1073 frame caller = *this; 1074 1075 // First consult the ADLC on where it puts parameter 0 for this signature. 1076 VMReg reg = SharedRuntime::name_for_receiver(); 1077 oop* oop_adr = caller.oopmapreg_to_location(reg, reg_map); 1078 if (oop_adr == NULL) { 1079 guarantee(oop_adr != NULL, "bad register save location"); 1080 return NULL; 1081 } 1082 oop r = *oop_adr; 1083 assert(Universe::heap()->is_in_or_null(r), err_msg("bad receiver: " INTPTR_FORMAT " (" INTX_FORMAT ")", (void *) r, (void *) r)); 1084 return r; 1085} 1086 1087 1088oop* frame::oopmapreg_to_location(VMReg reg, const RegisterMap* reg_map) const { 1089 if(reg->is_reg()) { 1090 // If it is passed in a register, it got spilled in the stub frame. 1091 return (oop *)reg_map->location(reg); 1092 } else { 1093 int sp_offset_in_bytes = reg->reg2stack() * VMRegImpl::stack_slot_size; 1094 return (oop*)(((address)unextended_sp()) + sp_offset_in_bytes); 1095 } 1096} 1097 1098BasicLock* frame::get_native_monitor() { 1099 nmethod* nm = (nmethod*)_cb; 1100 assert(_cb != NULL && _cb->is_nmethod() && nm->method()->is_native(), 1101 "Should not call this unless it's a native nmethod"); 1102 int byte_offset = in_bytes(nm->native_basic_lock_sp_offset()); 1103 assert(byte_offset >= 0, "should not see invalid offset"); 1104 return (BasicLock*) &sp()[byte_offset / wordSize]; 1105} 1106 1107oop frame::get_native_receiver() { 1108 nmethod* nm = (nmethod*)_cb; 1109 assert(_cb != NULL && _cb->is_nmethod() && nm->method()->is_native(), 1110 "Should not call this unless it's a native nmethod"); 1111 int byte_offset = in_bytes(nm->native_receiver_sp_offset()); 1112 assert(byte_offset >= 0, "should not see invalid offset"); 1113 oop owner = ((oop*) sp())[byte_offset / wordSize]; 1114 assert( Universe::heap()->is_in(owner), "bad receiver" ); 1115 return owner; 1116} 1117 1118void frame::oops_entry_do(OopClosure* f, const RegisterMap* map) { 1119 assert(map != NULL, "map must be set"); 1120 if (map->include_argument_oops()) { 1121 // must collect argument oops, as nobody else is doing it 1122 Thread *thread = Thread::current(); 1123 methodHandle m (thread, entry_frame_call_wrapper()->callee_method()); 1124 EntryFrameOopFinder finder(this, m->signature(), m->is_static()); 1125 finder.arguments_do(f); 1126 } 1127 // Traverse the Handle Block saved in the entry frame 1128 entry_frame_call_wrapper()->oops_do(f); 1129} 1130 1131 1132void frame::oops_do_internal(OopClosure* f, CLDClosure* cld_f, CodeBlobClosure* cf, RegisterMap* map, bool use_interpreter_oop_map_cache) { 1133#ifndef PRODUCT 1134 // simulate GC crash here to dump java thread in error report 1135 if (CrashGCForDumpingJavaThread) { 1136 char *t = NULL; 1137 *t = 'c'; 1138 } 1139#endif 1140 if (is_interpreted_frame()) { 1141 oops_interpreted_do(f, cld_f, map, use_interpreter_oop_map_cache); 1142 } else if (is_entry_frame()) { 1143 oops_entry_do(f, map); 1144 } else if (CodeCache::contains(pc())) { 1145 oops_code_blob_do(f, cf, map); 1146#ifdef SHARK 1147 } else if (is_fake_stub_frame()) { 1148 // nothing to do 1149#endif // SHARK 1150 } else { 1151 ShouldNotReachHere(); 1152 } 1153} 1154 1155void frame::nmethods_do(CodeBlobClosure* cf) { 1156 if (_cb != NULL && _cb->is_nmethod()) { 1157 cf->do_code_blob(_cb); 1158 } 1159} 1160 1161 1162// call f() on the interpreted Method*s in the stack. 1163// Have to walk the entire code cache for the compiled frames Yuck. 1164void frame::metadata_do(void f(Metadata*)) { 1165 if (_cb != NULL && Interpreter::contains(pc())) { 1166 Method* m = this->interpreter_frame_method(); 1167 assert(m != NULL, "huh?"); 1168 f(m); 1169 } 1170} 1171 1172void frame::gc_prologue() { 1173 if (is_interpreted_frame()) { 1174 // set bcx to bci to become Method* position independent during GC 1175 interpreter_frame_set_bcx(interpreter_frame_bci()); 1176 } 1177} 1178 1179 1180void frame::gc_epilogue() { 1181 if (is_interpreted_frame()) { 1182 // set bcx back to bcp for interpreter 1183 interpreter_frame_set_bcx((intptr_t)interpreter_frame_bcp()); 1184 } 1185 // call processor specific epilog function 1186 pd_gc_epilog(); 1187} 1188 1189 1190# ifdef ENABLE_ZAP_DEAD_LOCALS 1191 1192void frame::CheckValueClosure::do_oop(oop* p) { 1193 if (CheckOopishValues && Universe::heap()->is_in_reserved(*p)) { 1194 warning("value @ " INTPTR_FORMAT " looks oopish (" INTPTR_FORMAT ") (thread = " INTPTR_FORMAT ")", p, (address)*p, Thread::current()); 1195 } 1196} 1197frame::CheckValueClosure frame::_check_value; 1198 1199 1200void frame::CheckOopClosure::do_oop(oop* p) { 1201 if (*p != NULL && !(*p)->is_oop()) { 1202 warning("value @ " INTPTR_FORMAT " should be an oop (" INTPTR_FORMAT ") (thread = " INTPTR_FORMAT ")", p, (address)*p, Thread::current()); 1203 } 1204} 1205frame::CheckOopClosure frame::_check_oop; 1206 1207void frame::check_derived_oop(oop* base, oop* derived) { 1208 _check_oop.do_oop(base); 1209} 1210 1211 1212void frame::ZapDeadClosure::do_oop(oop* p) { 1213 if (TraceZapDeadLocals) tty->print_cr("zapping @ " INTPTR_FORMAT " containing " INTPTR_FORMAT, p, (address)*p); 1214 *p = cast_to_oop<intptr_t>(0xbabebabe); 1215} 1216frame::ZapDeadClosure frame::_zap_dead; 1217 1218void frame::zap_dead_locals(JavaThread* thread, const RegisterMap* map) { 1219 assert(thread == Thread::current(), "need to synchronize to do this to another thread"); 1220 // Tracing - part 1 1221 if (TraceZapDeadLocals) { 1222 ResourceMark rm(thread); 1223 tty->print_cr("--------------------------------------------------------------------------------"); 1224 tty->print("Zapping dead locals in "); 1225 print_on(tty); 1226 tty->cr(); 1227 } 1228 // Zapping 1229 if (is_entry_frame ()) zap_dead_entry_locals (thread, map); 1230 else if (is_interpreted_frame()) zap_dead_interpreted_locals(thread, map); 1231 else if (is_compiled_frame()) zap_dead_compiled_locals (thread, map); 1232 1233 else 1234 // could be is_runtime_frame 1235 // so remove error: ShouldNotReachHere(); 1236 ; 1237 // Tracing - part 2 1238 if (TraceZapDeadLocals) { 1239 tty->cr(); 1240 } 1241} 1242 1243 1244void frame::zap_dead_interpreted_locals(JavaThread *thread, const RegisterMap* map) { 1245 // get current interpreter 'pc' 1246 assert(is_interpreted_frame(), "Not an interpreted frame"); 1247 Method* m = interpreter_frame_method(); 1248 int bci = interpreter_frame_bci(); 1249 1250 int max_locals = m->is_native() ? m->size_of_parameters() : m->max_locals(); 1251 1252 // process dynamic part 1253 InterpreterFrameClosure value_blk(this, max_locals, m->max_stack(), 1254 &_check_value); 1255 InterpreterFrameClosure oop_blk(this, max_locals, m->max_stack(), 1256 &_check_oop ); 1257 InterpreterFrameClosure dead_blk(this, max_locals, m->max_stack(), 1258 &_zap_dead ); 1259 1260 // get frame map 1261 InterpreterOopMap mask; 1262 m->mask_for(bci, &mask); 1263 mask.iterate_all( &oop_blk, &value_blk, &dead_blk); 1264} 1265 1266 1267void frame::zap_dead_compiled_locals(JavaThread* thread, const RegisterMap* reg_map) { 1268 1269 ResourceMark rm(thread); 1270 assert(_cb != NULL, "sanity check"); 1271 if (_cb->oop_maps() != NULL) { 1272 OopMapSet::all_do(this, reg_map, &_check_oop, check_derived_oop, &_check_value); 1273 } 1274} 1275 1276 1277void frame::zap_dead_entry_locals(JavaThread*, const RegisterMap*) { 1278 if (TraceZapDeadLocals) warning("frame::zap_dead_entry_locals unimplemented"); 1279} 1280 1281 1282void frame::zap_dead_deoptimized_locals(JavaThread*, const RegisterMap*) { 1283 if (TraceZapDeadLocals) warning("frame::zap_dead_deoptimized_locals unimplemented"); 1284} 1285 1286# endif // ENABLE_ZAP_DEAD_LOCALS 1287 1288void frame::verify(const RegisterMap* map) { 1289 // for now make sure receiver type is correct 1290 if (is_interpreted_frame()) { 1291 Method* method = interpreter_frame_method(); 1292 guarantee(method->is_method(), "method is wrong in frame::verify"); 1293 if (!method->is_static()) { 1294 // fetch the receiver 1295 oop* p = (oop*) interpreter_frame_local_at(0); 1296 // make sure we have the right receiver type 1297 } 1298 } 1299 COMPILER2_PRESENT(assert(DerivedPointerTable::is_empty(), "must be empty before verify");) 1300 oops_do_internal(&VerifyOopClosure::verify_oop, NULL, NULL, (RegisterMap*)map, false); 1301} 1302 1303 1304#ifdef ASSERT 1305bool frame::verify_return_pc(address x) { 1306 if (StubRoutines::returns_to_call_stub(x)) { 1307 return true; 1308 } 1309 if (CodeCache::contains(x)) { 1310 return true; 1311 } 1312 if (Interpreter::contains(x)) { 1313 return true; 1314 } 1315 return false; 1316} 1317#endif 1318 1319#ifdef ASSERT 1320void frame::interpreter_frame_verify_monitor(BasicObjectLock* value) const { 1321 assert(is_interpreted_frame(), "Not an interpreted frame"); 1322 // verify that the value is in the right part of the frame 1323 address low_mark = (address) interpreter_frame_monitor_end(); 1324 address high_mark = (address) interpreter_frame_monitor_begin(); 1325 address current = (address) value; 1326 1327 const int monitor_size = frame::interpreter_frame_monitor_size(); 1328 guarantee((high_mark - current) % monitor_size == 0 , "Misaligned top of BasicObjectLock*"); 1329 guarantee( high_mark > current , "Current BasicObjectLock* higher than high_mark"); 1330 1331 guarantee((current - low_mark) % monitor_size == 0 , "Misaligned bottom of BasicObjectLock*"); 1332 guarantee( current >= low_mark , "Current BasicObjectLock* below than low_mark"); 1333} 1334#endif 1335 1336#ifndef PRODUCT 1337void frame::describe(FrameValues& values, int frame_no) { 1338 // boundaries: sp and the 'real' frame pointer 1339 values.describe(-1, sp(), err_msg("sp for #%d", frame_no), 1); 1340 intptr_t* frame_pointer = real_fp(); // Note: may differ from fp() 1341 1342 // print frame info at the highest boundary 1343 intptr_t* info_address = MAX2(sp(), frame_pointer); 1344 1345 if (info_address != frame_pointer) { 1346 // print frame_pointer explicitly if not marked by the frame info 1347 values.describe(-1, frame_pointer, err_msg("frame pointer for #%d", frame_no), 1); 1348 } 1349 1350 if (is_entry_frame() || is_compiled_frame() || is_interpreted_frame() || is_native_frame()) { 1351 // Label values common to most frames 1352 values.describe(-1, unextended_sp(), err_msg("unextended_sp for #%d", frame_no)); 1353 } 1354 1355 if (is_interpreted_frame()) { 1356 Method* m = interpreter_frame_method(); 1357 int bci = interpreter_frame_bci(); 1358 1359 // Label the method and current bci 1360 values.describe(-1, info_address, 1361 FormatBuffer<1024>("#%d method %s @ %d", frame_no, m->name_and_sig_as_C_string(), bci), 2); 1362 values.describe(-1, info_address, 1363 err_msg("- %d locals %d max stack", m->max_locals(), m->max_stack()), 1); 1364 if (m->max_locals() > 0) { 1365 intptr_t* l0 = interpreter_frame_local_at(0); 1366 intptr_t* ln = interpreter_frame_local_at(m->max_locals() - 1); 1367 values.describe(-1, MAX2(l0, ln), err_msg("locals for #%d", frame_no), 1); 1368 // Report each local and mark as owned by this frame 1369 for (int l = 0; l < m->max_locals(); l++) { 1370 intptr_t* l0 = interpreter_frame_local_at(l); 1371 values.describe(frame_no, l0, err_msg("local %d", l)); 1372 } 1373 } 1374 1375 // Compute the actual expression stack size 1376 InterpreterOopMap mask; 1377 OopMapCache::compute_one_oop_map(m, bci, &mask); 1378 intptr_t* tos = NULL; 1379 // Report each stack element and mark as owned by this frame 1380 for (int e = 0; e < mask.expression_stack_size(); e++) { 1381 tos = MAX2(tos, interpreter_frame_expression_stack_at(e)); 1382 values.describe(frame_no, interpreter_frame_expression_stack_at(e), 1383 err_msg("stack %d", e)); 1384 } 1385 if (tos != NULL) { 1386 values.describe(-1, tos, err_msg("expression stack for #%d", frame_no), 1); 1387 } 1388 if (interpreter_frame_monitor_begin() != interpreter_frame_monitor_end()) { 1389 values.describe(frame_no, (intptr_t*)interpreter_frame_monitor_begin(), "monitors begin"); 1390 values.describe(frame_no, (intptr_t*)interpreter_frame_monitor_end(), "monitors end"); 1391 } 1392 } else if (is_entry_frame()) { 1393 // For now just label the frame 1394 values.describe(-1, info_address, err_msg("#%d entry frame", frame_no), 2); 1395 } else if (is_compiled_frame()) { 1396 // For now just label the frame 1397 nmethod* nm = cb()->as_nmethod_or_null(); 1398 values.describe(-1, info_address, 1399 FormatBuffer<1024>("#%d nmethod " INTPTR_FORMAT " for method %s%s", frame_no, 1400 nm, nm->method()->name_and_sig_as_C_string(), 1401 (_deopt_state == is_deoptimized) ? 1402 " (deoptimized)" : 1403 ((_deopt_state == unknown) ? " (state unknown)" : "")), 1404 2); 1405 } else if (is_native_frame()) { 1406 // For now just label the frame 1407 nmethod* nm = cb()->as_nmethod_or_null(); 1408 values.describe(-1, info_address, 1409 FormatBuffer<1024>("#%d nmethod " INTPTR_FORMAT " for native method %s", frame_no, 1410 nm, nm->method()->name_and_sig_as_C_string()), 2); 1411 } else { 1412 // provide default info if not handled before 1413 char *info = (char *) "special frame"; 1414 if ((_cb != NULL) && 1415 (_cb->name() != NULL)) { 1416 info = (char *)_cb->name(); 1417 } 1418 values.describe(-1, info_address, err_msg("#%d <%s>", frame_no, info), 2); 1419 } 1420 1421 // platform dependent additional data 1422 describe_pd(values, frame_no); 1423} 1424 1425#endif 1426 1427 1428//----------------------------------------------------------------------------------- 1429// StackFrameStream implementation 1430 1431StackFrameStream::StackFrameStream(JavaThread *thread, bool update) : _reg_map(thread, update) { 1432 assert(thread->has_last_Java_frame(), "sanity check"); 1433 _fr = thread->last_frame(); 1434 _is_done = false; 1435} 1436 1437 1438#ifndef PRODUCT 1439 1440void FrameValues::describe(int owner, intptr_t* location, const char* description, int priority) { 1441 FrameValue fv; 1442 fv.location = location; 1443 fv.owner = owner; 1444 fv.priority = priority; 1445 fv.description = NEW_RESOURCE_ARRAY(char, strlen(description) + 1); 1446 strcpy(fv.description, description); 1447 _values.append(fv); 1448} 1449 1450 1451#ifdef ASSERT 1452void FrameValues::validate() { 1453 _values.sort(compare); 1454 bool error = false; 1455 FrameValue prev; 1456 prev.owner = -1; 1457 for (int i = _values.length() - 1; i >= 0; i--) { 1458 FrameValue fv = _values.at(i); 1459 if (fv.owner == -1) continue; 1460 if (prev.owner == -1) { 1461 prev = fv; 1462 continue; 1463 } 1464 if (prev.location == fv.location) { 1465 if (fv.owner != prev.owner) { 1466 tty->print_cr("overlapping storage"); 1467 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", prev.location, *prev.location, prev.description); 1468 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", fv.location, *fv.location, fv.description); 1469 error = true; 1470 } 1471 } else { 1472 prev = fv; 1473 } 1474 } 1475 assert(!error, "invalid layout"); 1476} 1477#endif // ASSERT 1478 1479void FrameValues::print(JavaThread* thread) { 1480 _values.sort(compare); 1481 1482 // Sometimes values like the fp can be invalid values if the 1483 // register map wasn't updated during the walk. Trim out values 1484 // that aren't actually in the stack of the thread. 1485 int min_index = 0; 1486 int max_index = _values.length() - 1; 1487 intptr_t* v0 = _values.at(min_index).location; 1488 intptr_t* v1 = _values.at(max_index).location; 1489 1490 if (thread == Thread::current()) { 1491 while (!thread->is_in_stack((address)v0)) { 1492 v0 = _values.at(++min_index).location; 1493 } 1494 while (!thread->is_in_stack((address)v1)) { 1495 v1 = _values.at(--max_index).location; 1496 } 1497 } else { 1498 while (!thread->on_local_stack((address)v0)) { 1499 v0 = _values.at(++min_index).location; 1500 } 1501 while (!thread->on_local_stack((address)v1)) { 1502 v1 = _values.at(--max_index).location; 1503 } 1504 } 1505 intptr_t* min = MIN2(v0, v1); 1506 intptr_t* max = MAX2(v0, v1); 1507 intptr_t* cur = max; 1508 intptr_t* last = NULL; 1509 for (int i = max_index; i >= min_index; i--) { 1510 FrameValue fv = _values.at(i); 1511 while (cur > fv.location) { 1512 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT, cur, *cur); 1513 cur--; 1514 } 1515 if (last == fv.location) { 1516 const char* spacer = " " LP64_ONLY(" "); 1517 tty->print_cr(" %s %s %s", spacer, spacer, fv.description); 1518 } else { 1519 tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", fv.location, *fv.location, fv.description); 1520 last = fv.location; 1521 cur--; 1522 } 1523 } 1524} 1525 1526#endif // ndef PRODUCT 1527