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