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