1 /* 2 * Copyright (c) 1997, 2016, Oracle and/or its affiliates. All rights reserved. 3 * Copyright (c) 2014, Red Hat Inc. All rights reserved. 4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 5 * 6 * This code is free software; you can redistribute it and/or modify it 7 * under the terms of the GNU General Public License version 2 only, as 8 * published by the Free Software Foundation. 9 * 10 * This code is distributed in the hope that it will be useful, but WITHOUT 11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 13 * version 2 for more details (a copy is included in the LICENSE file that 14 * accompanied this code). 15 * 16 * You should have received a copy of the GNU General Public License version 17 * 2 along with this work; if not, write to the Free Software Foundation, 18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 19 * 20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 21 * or visit www.oracle.com if you need additional information or have any 22 * questions. 23 * 24 */ 25 26 #include "precompiled.hpp" 27 #include "interpreter/interpreter.hpp" 28 #include "memory/resourceArea.hpp" 29 #include "oops/markOop.hpp" 30 #include "oops/method.hpp" 31 #include "oops/oop.inline.hpp" 32 #include "prims/methodHandles.hpp" 33 #include "runtime/frame.inline.hpp" 34 #include "runtime/handles.inline.hpp" 35 #include "runtime/javaCalls.hpp" 36 #include "runtime/monitorChunk.hpp" 37 #include "runtime/os.hpp" 38 #include "runtime/signature.hpp" 39 #include "runtime/stubCodeGenerator.hpp" 40 #include "runtime/stubRoutines.hpp" 41 #include "vmreg_aarch64.inline.hpp" 42 #ifdef COMPILER1 43 #include "c1/c1_Runtime1.hpp" 44 #include "runtime/vframeArray.hpp" 45 #endif 46 47 #ifdef ASSERT 48 void RegisterMap::check_location_valid() { 49 } 50 #endif 51 52 53 // Profiling/safepoint support 54 55 bool frame::safe_for_sender(JavaThread *thread) { 56 address sp = (address)_sp; 57 address fp = (address)_fp; 58 address unextended_sp = (address)_unextended_sp; 59 60 // consider stack guards when trying to determine "safe" stack pointers 61 static size_t stack_guard_size = os::uses_stack_guard_pages() ? 62 (JavaThread::stack_red_zone_size() + JavaThread::stack_yellow_zone_size()) : 0; 63 size_t usable_stack_size = thread->stack_size() - stack_guard_size; 64 65 // sp must be within the usable part of the stack (not in guards) 66 bool sp_safe = (sp < thread->stack_base()) && 67 (sp >= thread->stack_base() - usable_stack_size); 68 69 70 if (!sp_safe) { 71 return false; 72 } 73 74 // unextended sp must be within the stack and above or equal sp 75 bool unextended_sp_safe = (unextended_sp < thread->stack_base()) && 76 (unextended_sp >= sp); 77 78 if (!unextended_sp_safe) { 79 return false; 80 } 81 82 // an fp must be within the stack and above (but not equal) sp 83 // second evaluation on fp+ is added to handle situation where fp is -1 84 bool fp_safe = (fp < thread->stack_base() && (fp > sp) && (((fp + (return_addr_offset * sizeof(void*))) < thread->stack_base()))); 85 86 // We know sp/unextended_sp are safe only fp is questionable here 87 88 // If the current frame is known to the code cache then we can attempt to 89 // to construct the sender and do some validation of it. This goes a long way 90 // toward eliminating issues when we get in frame construction code 91 92 if (_cb != NULL ) { 93 94 // First check if frame is complete and tester is reliable 95 // Unfortunately we can only check frame complete for runtime stubs and nmethod 96 // other generic buffer blobs are more problematic so we just assume they are 97 // ok. adapter blobs never have a frame complete and are never ok. 98 99 if (!_cb->is_frame_complete_at(_pc)) { 100 if (_cb->is_nmethod() || _cb->is_adapter_blob() || _cb->is_runtime_stub()) { 101 return false; 102 } 103 } 104 105 // Could just be some random pointer within the codeBlob 106 if (!_cb->code_contains(_pc)) { 107 return false; 108 } 109 110 // Entry frame checks 111 if (is_entry_frame()) { 112 // an entry frame must have a valid fp. 113 114 if (!fp_safe) return false; 115 116 // Validate the JavaCallWrapper an entry frame must have 117 118 address jcw = (address)entry_frame_call_wrapper(); 119 120 bool jcw_safe = (jcw < thread->stack_base()) && ( jcw > fp); 121 122 return jcw_safe; 123 124 } 125 126 intptr_t* sender_sp = NULL; 127 intptr_t* sender_unextended_sp = NULL; 128 address sender_pc = NULL; 129 intptr_t* saved_fp = NULL; 130 131 if (is_interpreted_frame()) { 132 // fp must be safe 133 if (!fp_safe) { 134 return false; 135 } 136 137 sender_pc = (address) this->fp()[return_addr_offset]; 138 // for interpreted frames, the value below is the sender "raw" sp, 139 // which can be different from the sender unextended sp (the sp seen 140 // by the sender) because of current frame local variables 141 sender_sp = (intptr_t*) addr_at(sender_sp_offset); 142 sender_unextended_sp = (intptr_t*) this->fp()[interpreter_frame_sender_sp_offset]; 143 saved_fp = (intptr_t*) this->fp()[link_offset]; 144 145 } else { 146 // must be some sort of compiled/runtime frame 147 // fp does not have to be safe (although it could be check for c1?) 148 149 // check for a valid frame_size, otherwise we are unlikely to get a valid sender_pc 150 if (_cb->frame_size() <= 0) { 151 return false; 152 } 153 154 sender_sp = _unextended_sp + _cb->frame_size(); 155 sender_unextended_sp = sender_sp; 156 sender_pc = (address) *(sender_sp-1); 157 // Note: frame::sender_sp_offset is only valid for compiled frame 158 saved_fp = (intptr_t*) *(sender_sp - frame::sender_sp_offset); 159 } 160 161 162 // If the potential sender is the interpreter then we can do some more checking 163 if (Interpreter::contains(sender_pc)) { 164 165 // fp is always saved in a recognizable place in any code we generate. However 166 // only if the sender is interpreted/call_stub (c1 too?) are we certain that the saved fp 167 // is really a frame pointer. 168 169 bool saved_fp_safe = ((address)saved_fp < thread->stack_base()) && (saved_fp > sender_sp); 170 171 if (!saved_fp_safe) { 172 return false; 173 } 174 175 // construct the potential sender 176 177 frame sender(sender_sp, sender_unextended_sp, saved_fp, sender_pc); 178 179 return sender.is_interpreted_frame_valid(thread); 180 181 } 182 183 // We must always be able to find a recognizable pc 184 CodeBlob* sender_blob = CodeCache::find_blob_unsafe(sender_pc); 185 if (sender_pc == NULL || sender_blob == NULL) { 186 return false; 187 } 188 189 // Could be a zombie method 190 if (sender_blob->is_zombie() || sender_blob->is_unloaded()) { 191 return false; 192 } 193 194 // Could just be some random pointer within the codeBlob 195 if (!sender_blob->code_contains(sender_pc)) { 196 return false; 197 } 198 199 // We should never be able to see an adapter if the current frame is something from code cache 200 if (sender_blob->is_adapter_blob()) { 201 return false; 202 } 203 204 // Could be the call_stub 205 if (StubRoutines::returns_to_call_stub(sender_pc)) { 206 bool saved_fp_safe = ((address)saved_fp < thread->stack_base()) && (saved_fp > sender_sp); 207 208 if (!saved_fp_safe) { 209 return false; 210 } 211 212 // construct the potential sender 213 214 frame sender(sender_sp, sender_unextended_sp, saved_fp, sender_pc); 215 216 // Validate the JavaCallWrapper an entry frame must have 217 address jcw = (address)sender.entry_frame_call_wrapper(); 218 219 bool jcw_safe = (jcw < thread->stack_base()) && ( jcw > (address)sender.fp()); 220 221 return jcw_safe; 222 } 223 224 CompiledMethod* nm = sender_blob->as_compiled_method_or_null(); 225 if (nm != NULL) { 226 if (nm->is_deopt_mh_entry(sender_pc) || nm->is_deopt_entry(sender_pc) || 227 nm->method()->is_method_handle_intrinsic()) { 228 return false; 229 } 230 } 231 232 // If the frame size is 0 something (or less) is bad because every nmethod has a non-zero frame size 233 // because the return address counts against the callee's frame. 234 235 if (sender_blob->frame_size() <= 0) { 236 assert(!sender_blob->is_compiled(), "should count return address at least"); 237 return false; 238 } 239 240 // We should never be able to see anything here except an nmethod. If something in the 241 // code cache (current frame) is called by an entity within the code cache that entity 242 // should not be anything but the call stub (already covered), the interpreter (already covered) 243 // or an nmethod. 244 245 if (!sender_blob->is_compiled()) { 246 return false; 247 } 248 249 // Could put some more validation for the potential non-interpreted sender 250 // frame we'd create by calling sender if I could think of any. Wait for next crash in forte... 251 252 // One idea is seeing if the sender_pc we have is one that we'd expect to call to current cb 253 254 // We've validated the potential sender that would be created 255 return true; 256 } 257 258 // Must be native-compiled frame. Since sender will try and use fp to find 259 // linkages it must be safe 260 261 if (!fp_safe) { 262 return false; 263 } 264 265 // Will the pc we fetch be non-zero (which we'll find at the oldest frame) 266 267 if ( (address) this->fp()[return_addr_offset] == NULL) return false; 268 269 270 // could try and do some more potential verification of native frame if we could think of some... 271 272 return true; 273 274 } 275 276 void frame::patch_pc(Thread* thread, address pc) { 277 address* pc_addr = &(((address*) sp())[-1]); 278 if (TracePcPatching) { 279 tty->print_cr("patch_pc at address " INTPTR_FORMAT " [" INTPTR_FORMAT " -> " INTPTR_FORMAT "]", 280 p2i(pc_addr), p2i(*pc_addr), p2i(pc)); 281 } 282 // Either the return address is the original one or we are going to 283 // patch in the same address that's already there. 284 assert(_pc == *pc_addr || pc == *pc_addr, "must be"); 285 *pc_addr = pc; 286 _cb = CodeCache::find_blob(pc); 287 address original_pc = CompiledMethod::get_deopt_original_pc(this); 288 if (original_pc != NULL) { 289 assert(original_pc == _pc, "expected original PC to be stored before patching"); 290 _deopt_state = is_deoptimized; 291 // leave _pc as is 292 } else { 293 _deopt_state = not_deoptimized; 294 _pc = pc; 295 } 296 } 297 298 bool frame::is_interpreted_frame() const { 299 return Interpreter::contains(pc()); 300 } 301 302 int frame::frame_size(RegisterMap* map) const { 303 frame sender = this->sender(map); 304 return sender.sp() - sp(); 305 } 306 307 intptr_t* frame::entry_frame_argument_at(int offset) const { 308 // convert offset to index to deal with tsi 309 int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize); 310 // Entry frame's arguments are always in relation to unextended_sp() 311 return &unextended_sp()[index]; 312 } 313 314 // sender_sp 315 intptr_t* frame::interpreter_frame_sender_sp() const { 316 assert(is_interpreted_frame(), "interpreted frame expected"); 317 return (intptr_t*) at(interpreter_frame_sender_sp_offset); 318 } 319 320 void frame::set_interpreter_frame_sender_sp(intptr_t* sender_sp) { 321 assert(is_interpreted_frame(), "interpreted frame expected"); 322 ptr_at_put(interpreter_frame_sender_sp_offset, (intptr_t) sender_sp); 323 } 324 325 326 // monitor elements 327 328 BasicObjectLock* frame::interpreter_frame_monitor_begin() const { 329 return (BasicObjectLock*) addr_at(interpreter_frame_monitor_block_bottom_offset); 330 } 331 332 BasicObjectLock* frame::interpreter_frame_monitor_end() const { 333 BasicObjectLock* result = (BasicObjectLock*) *addr_at(interpreter_frame_monitor_block_top_offset); 334 // make sure the pointer points inside the frame 335 assert(sp() <= (intptr_t*) result, "monitor end should be above the stack pointer"); 336 assert((intptr_t*) result < fp(), "monitor end should be strictly below the frame pointer"); 337 return result; 338 } 339 340 void frame::interpreter_frame_set_monitor_end(BasicObjectLock* value) { 341 *((BasicObjectLock**)addr_at(interpreter_frame_monitor_block_top_offset)) = value; 342 } 343 344 // Used by template based interpreter deoptimization 345 void frame::interpreter_frame_set_last_sp(intptr_t* sp) { 346 *((intptr_t**)addr_at(interpreter_frame_last_sp_offset)) = sp; 347 } 348 349 frame frame::sender_for_entry_frame(RegisterMap* map) const { 350 assert(map != NULL, "map must be set"); 351 // Java frame called from C; skip all C frames and return top C 352 // frame of that chunk as the sender 353 JavaFrameAnchor* jfa = entry_frame_call_wrapper()->anchor(); 354 assert(!entry_frame_is_first(), "next Java fp must be non zero"); 355 assert(jfa->last_Java_sp() > sp(), "must be above this frame on stack"); 356 map->clear(); 357 assert(map->include_argument_oops(), "should be set by clear"); 358 if (jfa->last_Java_pc() != NULL ) { 359 frame fr(jfa->last_Java_sp(), jfa->last_Java_fp(), jfa->last_Java_pc()); 360 return fr; 361 } 362 frame fr(jfa->last_Java_sp(), jfa->last_Java_fp()); 363 return fr; 364 } 365 366 //------------------------------------------------------------------------------ 367 // frame::verify_deopt_original_pc 368 // 369 // Verifies the calculated original PC of a deoptimization PC for the 370 // given unextended SP. 371 #ifdef ASSERT 372 void frame::verify_deopt_original_pc(CompiledMethod* nm, intptr_t* unextended_sp) { 373 frame fr; 374 375 // This is ugly but it's better than to change {get,set}_original_pc 376 // to take an SP value as argument. And it's only a debugging 377 // method anyway. 378 fr._unextended_sp = unextended_sp; 379 380 address original_pc = nm->get_original_pc(&fr); 381 assert(nm->insts_contains(original_pc), "original PC must be in nmethod"); 382 } 383 #endif 384 385 //------------------------------------------------------------------------------ 386 // frame::adjust_unextended_sp 387 void frame::adjust_unextended_sp() { 388 // On aarch64, sites calling method handle intrinsics and lambda forms are treated 389 // as any other call site. Therefore, no special action is needed when we are 390 // returning to any of these call sites. 391 392 if (_cb != NULL) { 393 CompiledMethod* sender_cm = _cb->as_compiled_method_or_null(); 394 if (sender_cm != NULL) { 395 // If the sender PC is a deoptimization point, get the original PC. 396 if (sender_cm->is_deopt_entry(_pc) || 397 sender_cm->is_deopt_mh_entry(_pc)) { 398 DEBUG_ONLY(verify_deopt_original_pc(sender_cm, _unextended_sp)); 399 } 400 } 401 } 402 } 403 404 //------------------------------------------------------------------------------ 405 // frame::update_map_with_saved_link 406 void frame::update_map_with_saved_link(RegisterMap* map, intptr_t** link_addr) { 407 // The interpreter and compiler(s) always save fp in a known 408 // location on entry. We must record where that location is 409 // so that if fp was live on callout from c2 we can find 410 // the saved copy no matter what it called. 411 412 // Since the interpreter always saves fp if we record where it is then 413 // we don't have to always save fp on entry and exit to c2 compiled 414 // code, on entry will be enough. 415 map->set_location(rfp->as_VMReg(), (address) link_addr); 416 // this is weird "H" ought to be at a higher address however the 417 // oopMaps seems to have the "H" regs at the same address and the 418 // vanilla register. 419 // XXXX make this go away 420 if (true) { 421 map->set_location(rfp->as_VMReg()->next(), (address) link_addr); 422 } 423 } 424 425 426 //------------------------------------------------------------------------------ 427 // frame::sender_for_interpreter_frame 428 frame frame::sender_for_interpreter_frame(RegisterMap* map) const { 429 // SP is the raw SP from the sender after adapter or interpreter 430 // extension. 431 intptr_t* sender_sp = this->sender_sp(); 432 433 // This is the sp before any possible extension (adapter/locals). 434 intptr_t* unextended_sp = interpreter_frame_sender_sp(); 435 436 #if defined(COMPILER2) || INCLUDE_JVMCI 437 if (map->update_map()) { 438 update_map_with_saved_link(map, (intptr_t**) addr_at(link_offset)); 439 } 440 #endif // COMPILER2 || INCLUDE_JVMCI 441 442 return frame(sender_sp, unextended_sp, link(), sender_pc()); 443 } 444 445 446 //------------------------------------------------------------------------------ 447 // frame::sender_for_compiled_frame 448 frame frame::sender_for_compiled_frame(RegisterMap* map) const { 449 // we cannot rely upon the last fp having been saved to the thread 450 // in C2 code but it will have been pushed onto the stack. so we 451 // have to find it relative to the unextended sp 452 453 assert(_cb->frame_size() >= 0, "must have non-zero frame size"); 454 intptr_t* l_sender_sp = unextended_sp() + _cb->frame_size(); 455 intptr_t* unextended_sp = l_sender_sp; 456 457 // the return_address is always the word on the stack 458 address sender_pc = (address) *(l_sender_sp-1); 459 460 intptr_t** saved_fp_addr = (intptr_t**) (l_sender_sp - frame::sender_sp_offset); 461 462 // assert (sender_sp() == l_sender_sp, "should be"); 463 // assert (*saved_fp_addr == link(), "should be"); 464 465 if (map->update_map()) { 466 // Tell GC to use argument oopmaps for some runtime stubs that need it. 467 // For C1, the runtime stub might not have oop maps, so set this flag 468 // outside of update_register_map. 469 map->set_include_argument_oops(_cb->caller_must_gc_arguments(map->thread())); 470 if (_cb->oop_maps() != NULL) { 471 OopMapSet::update_register_map(this, map); 472 } 473 474 // Since the prolog does the save and restore of FP there is no 475 // oopmap for it so we must fill in its location as if there was 476 // an oopmap entry since if our caller was compiled code there 477 // could be live jvm state in it. 478 update_map_with_saved_link(map, saved_fp_addr); 479 } 480 481 return frame(l_sender_sp, unextended_sp, *saved_fp_addr, sender_pc); 482 } 483 484 //------------------------------------------------------------------------------ 485 // frame::sender 486 frame frame::sender(RegisterMap* map) const { 487 // Default is we done have to follow them. The sender_for_xxx will 488 // update it accordingly 489 map->set_include_argument_oops(false); 490 491 if (is_entry_frame()) 492 return sender_for_entry_frame(map); 493 if (is_interpreted_frame()) 494 return sender_for_interpreter_frame(map); 495 assert(_cb == CodeCache::find_blob(pc()),"Must be the same"); 496 497 // This test looks odd: why is it not is_compiled_frame() ? That's 498 // because stubs also have OOP maps. 499 if (_cb != NULL) { 500 return sender_for_compiled_frame(map); 501 } 502 503 // Must be native-compiled frame, i.e. the marshaling code for native 504 // methods that exists in the core system. 505 return frame(sender_sp(), link(), sender_pc()); 506 } 507 508 bool frame::is_interpreted_frame_valid(JavaThread* thread) const { 509 assert(is_interpreted_frame(), "Not an interpreted frame"); 510 // These are reasonable sanity checks 511 if (fp() == 0 || (intptr_t(fp()) & (wordSize-1)) != 0) { 512 return false; 513 } 514 if (sp() == 0 || (intptr_t(sp()) & (wordSize-1)) != 0) { 515 return false; 516 } 517 if (fp() + interpreter_frame_initial_sp_offset < sp()) { 518 return false; 519 } 520 // These are hacks to keep us out of trouble. 521 // The problem with these is that they mask other problems 522 if (fp() <= sp()) { // this attempts to deal with unsigned comparison above 523 return false; 524 } 525 526 // do some validation of frame elements 527 528 // first the method 529 530 Method* m = *interpreter_frame_method_addr(); 531 532 // validate the method we'd find in this potential sender 533 if (!m->is_valid_method()) return false; 534 535 // stack frames shouldn't be much larger than max_stack elements 536 // this test requires the use of unextended_sp which is the sp as seen by 537 // the current frame, and not sp which is the "raw" pc which could point 538 // further because of local variables of the callee method inserted after 539 // method arguments 540 if (fp() - unextended_sp() > 1024 + m->max_stack()*Interpreter::stackElementSize) { 541 return false; 542 } 543 544 // validate bci/bcx 545 546 address bcp = interpreter_frame_bcp(); 547 if (m->validate_bci_from_bcp(bcp) < 0) { 548 return false; 549 } 550 551 // validate constantPoolCache* 552 ConstantPoolCache* cp = *interpreter_frame_cache_addr(); 553 if (cp == NULL || !cp->is_metaspace_object()) return false; 554 555 // validate locals 556 557 address locals = (address) *interpreter_frame_locals_addr(); 558 559 if (locals > thread->stack_base() || locals < (address) fp()) return false; 560 561 // We'd have to be pretty unlucky to be mislead at this point 562 return true; 563 } 564 565 BasicType frame::interpreter_frame_result(oop* oop_result, jvalue* value_result) { 566 assert(is_interpreted_frame(), "interpreted frame expected"); 567 Method* method = interpreter_frame_method(); 568 BasicType type = method->result_type(); 569 570 intptr_t* tos_addr; 571 if (method->is_native()) { 572 // TODO : ensure AARCH64 does the same as Intel here i.e. push v0 then r0 573 // Prior to calling into the runtime to report the method_exit the possible 574 // return value is pushed to the native stack. If the result is a jfloat/jdouble 575 // then ST0 is saved before EAX/EDX. See the note in generate_native_result 576 tos_addr = (intptr_t*)sp(); 577 if (type == T_FLOAT || type == T_DOUBLE) { 578 // This is times two because we do a push(ltos) after pushing XMM0 579 // and that takes two interpreter stack slots. 580 tos_addr += 2 * Interpreter::stackElementWords; 581 } 582 } else { 583 tos_addr = (intptr_t*)interpreter_frame_tos_address(); 584 } 585 586 switch (type) { 587 case T_OBJECT : 588 case T_ARRAY : { 589 oop obj; 590 if (method->is_native()) { 591 obj = cast_to_oop(at(interpreter_frame_oop_temp_offset)); 592 } else { 593 oop* obj_p = (oop*)tos_addr; 594 obj = (obj_p == NULL) ? (oop)NULL : *obj_p; 595 } 596 assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check"); 597 *oop_result = obj; 598 break; 599 } 600 case T_BOOLEAN : value_result->z = *(jboolean*)tos_addr; break; 601 case T_BYTE : value_result->b = *(jbyte*)tos_addr; break; 602 case T_CHAR : value_result->c = *(jchar*)tos_addr; break; 603 case T_SHORT : value_result->s = *(jshort*)tos_addr; break; 604 case T_INT : value_result->i = *(jint*)tos_addr; break; 605 case T_LONG : value_result->j = *(jlong*)tos_addr; break; 606 case T_FLOAT : { 607 value_result->f = *(jfloat*)tos_addr; 608 break; 609 } 610 case T_DOUBLE : value_result->d = *(jdouble*)tos_addr; break; 611 case T_VOID : /* Nothing to do */ break; 612 default : ShouldNotReachHere(); 613 } 614 615 return type; 616 } 617 618 619 intptr_t* frame::interpreter_frame_tos_at(jint offset) const { 620 int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize); 621 return &interpreter_frame_tos_address()[index]; 622 } 623 624 #ifndef PRODUCT 625 626 #define DESCRIBE_FP_OFFSET(name) \ 627 values.describe(frame_no, fp() + frame::name##_offset, #name) 628 629 void frame::describe_pd(FrameValues& values, int frame_no) { 630 if (is_interpreted_frame()) { 631 DESCRIBE_FP_OFFSET(interpreter_frame_sender_sp); 632 DESCRIBE_FP_OFFSET(interpreter_frame_last_sp); 633 DESCRIBE_FP_OFFSET(interpreter_frame_method); 634 DESCRIBE_FP_OFFSET(interpreter_frame_mdp); 635 DESCRIBE_FP_OFFSET(interpreter_frame_cache); 636 DESCRIBE_FP_OFFSET(interpreter_frame_locals); 637 DESCRIBE_FP_OFFSET(interpreter_frame_bcp); 638 DESCRIBE_FP_OFFSET(interpreter_frame_initial_sp); 639 } 640 } 641 #endif 642 643 intptr_t *frame::initial_deoptimization_info() { 644 // Not used on aarch64, but we must return something. 645 return NULL; 646 } 647 648 intptr_t* frame::real_fp() const { 649 if (_cb != NULL) { 650 // use the frame size if valid 651 int size = _cb->frame_size(); 652 if (size > 0) { 653 return unextended_sp() + size; 654 } 655 } 656 // else rely on fp() 657 assert(! is_compiled_frame(), "unknown compiled frame size"); 658 return fp(); 659 } 660 661 #undef DESCRIBE_FP_OFFSET 662 663 #define DESCRIBE_FP_OFFSET(name) \ 664 { \ 665 unsigned long *p = (unsigned long *)fp; \ 666 printf("0x%016lx 0x%016lx %s\n", (unsigned long)(p + frame::name##_offset), \ 667 p[frame::name##_offset], #name); \ 668 } 669 670 static __thread unsigned long nextfp; 671 static __thread unsigned long nextpc; 672 static __thread unsigned long nextsp; 673 static __thread RegisterMap *reg_map; 674 675 static void printbc(Method *m, intptr_t bcx) { 676 const char *name; 677 char buf[16]; 678 if (m->validate_bci_from_bcp((address)bcx) < 0 679 || !m->contains((address)bcx)) { 680 name = "???"; 681 snprintf(buf, sizeof buf, "(bad)"); 682 } else { 683 int bci = m->bci_from((address)bcx); 684 snprintf(buf, sizeof buf, "%d", bci); 685 name = Bytecodes::name(m->code_at(bci)); 686 } 687 ResourceMark rm; 688 printf("%s : %s ==> %s\n", m->name_and_sig_as_C_string(), buf, name); 689 } 690 691 void internal_pf(unsigned long sp, unsigned long fp, unsigned long pc, unsigned long bcx) { 692 if (! fp) 693 return; 694 695 DESCRIBE_FP_OFFSET(return_addr); 696 DESCRIBE_FP_OFFSET(link); 697 DESCRIBE_FP_OFFSET(interpreter_frame_sender_sp); 698 DESCRIBE_FP_OFFSET(interpreter_frame_last_sp); 699 DESCRIBE_FP_OFFSET(interpreter_frame_method); 700 DESCRIBE_FP_OFFSET(interpreter_frame_mdp); 701 DESCRIBE_FP_OFFSET(interpreter_frame_cache); 702 DESCRIBE_FP_OFFSET(interpreter_frame_locals); 703 DESCRIBE_FP_OFFSET(interpreter_frame_bcp); 704 DESCRIBE_FP_OFFSET(interpreter_frame_initial_sp); 705 unsigned long *p = (unsigned long *)fp; 706 707 // We want to see all frames, native and Java. For compiled and 708 // interpreted frames we have special information that allows us to 709 // unwind them; for everything else we assume that the native frame 710 // pointer chain is intact. 711 frame this_frame((intptr_t*)sp, (intptr_t*)fp, (address)pc); 712 if (this_frame.is_compiled_frame() || 713 this_frame.is_interpreted_frame()) { 714 frame sender = this_frame.sender(reg_map); 715 nextfp = (unsigned long)sender.fp(); 716 nextpc = (unsigned long)sender.pc(); 717 nextsp = (unsigned long)sender.unextended_sp(); 718 } else { 719 nextfp = p[frame::link_offset]; 720 nextpc = p[frame::return_addr_offset]; 721 nextsp = (unsigned long)&p[frame::sender_sp_offset]; 722 } 723 724 if (bcx == -1ul) 725 bcx = p[frame::interpreter_frame_bcp_offset]; 726 727 if (Interpreter::contains((address)pc)) { 728 Method* m = (Method*)p[frame::interpreter_frame_method_offset]; 729 if(m && m->is_method()) { 730 printbc(m, bcx); 731 } else 732 printf("not a Method\n"); 733 } else { 734 CodeBlob *cb = CodeCache::find_blob((address)pc); 735 if (cb != NULL) { 736 if (cb->is_nmethod()) { 737 ResourceMark rm; 738 nmethod* nm = (nmethod*)cb; 739 printf("nmethod %s\n", nm->method()->name_and_sig_as_C_string()); 740 } else if (cb->name()) { 741 printf("CodeBlob %s\n", cb->name()); 742 } 743 } 744 } 745 } 746 747 extern "C" void npf() { 748 CodeBlob *cb = CodeCache::find_blob((address)nextpc); 749 // C2 does not always chain the frame pointers when it can, instead 750 // preferring to use fixed offsets from SP, so a simple leave() does 751 // not work. Instead, it adds the frame size to SP then pops FP and 752 // LR. We have to do the same thing to get a good call chain. 753 if (cb && cb->frame_size()) 754 nextfp = nextsp + wordSize * (cb->frame_size() - 2); 755 internal_pf (nextsp, nextfp, nextpc, -1); 756 } 757 758 extern "C" void pf(unsigned long sp, unsigned long fp, unsigned long pc, 759 unsigned long bcx, unsigned long thread) { 760 RegisterMap map((JavaThread*)thread, false); 761 if (!reg_map) { 762 reg_map = (RegisterMap*)os::malloc(sizeof map, mtNone); 763 } 764 memcpy(reg_map, &map, sizeof map); 765 { 766 CodeBlob *cb = CodeCache::find_blob((address)pc); 767 if (cb && cb->frame_size()) 768 fp = sp + wordSize * (cb->frame_size() - 2); 769 } 770 internal_pf(sp, fp, pc, bcx); 771 } 772 773 // support for printing out where we are in a Java method 774 // needs to be passed current fp and bcp register values 775 // prints method name, bc index and bytecode name 776 extern "C" void pm(unsigned long fp, unsigned long bcx) { 777 DESCRIBE_FP_OFFSET(interpreter_frame_method); 778 unsigned long *p = (unsigned long *)fp; 779 Method* m = (Method*)p[frame::interpreter_frame_method_offset]; 780 printbc(m, bcx); 781 } 782 783 #ifndef PRODUCT 784 // This is a generic constructor which is only used by pns() in debug.cpp. 785 frame::frame(void* sp, void* fp, void* pc) { 786 init((intptr_t*)sp, (intptr_t*)fp, (address)pc); 787 } 788 #endif