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 "interpreter/interpreter.hpp" 27 #include "memory/resourceArea.hpp" 28 #include "oops/markOop.hpp" 29 #include "oops/method.hpp" 30 #include "oops/oop.inline.hpp" 31 #include "prims/methodHandles.hpp" 32 #include "runtime/frame.inline.hpp" 33 #include "runtime/handles.inline.hpp" 34 #include "runtime/javaCalls.hpp" 35 #include "runtime/monitorChunk.hpp" 36 #include "runtime/os.inline.hpp" 37 #include "runtime/signature.hpp" 38 #include "runtime/stubCodeGenerator.hpp" 39 #include "runtime/stubRoutines.hpp" 40 #include "vmreg_x86.inline.hpp" 41 #ifdef COMPILER1 42 #include "c1/c1_Runtime1.hpp" 43 #include "runtime/vframeArray.hpp" 44 #endif 45 46 #ifdef ASSERT 47 void RegisterMap::check_location_valid() { 48 } 49 #endif 50 51 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC 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() ? (StackYellowPages + StackRedPages) * os::vm_page_size() : 0; 62 size_t usable_stack_size = thread->stack_size() - stack_guard_size; 63 64 // sp must be within the usable part of the stack (not in guards) 65 bool sp_safe = (sp < thread->stack_base()) && 66 (sp >= thread->stack_base() - usable_stack_size); 67 68 69 if (!sp_safe) { 70 return false; 71 } 72 73 // unextended sp must be within the stack and above or equal sp 74 bool unextended_sp_safe = (unextended_sp < thread->stack_base()) && 75 (unextended_sp >= sp); 76 77 if (!unextended_sp_safe) { 78 return false; 79 } 80 81 // an fp must be within the stack and above (but not equal) sp 82 // second evaluation on fp+ is added to handle situation where fp is -1 83 bool fp_safe = (fp < thread->stack_base() && (fp > sp) && (((fp + (return_addr_offset * sizeof(void*))) < thread->stack_base()))); 84 85 // We know sp/unextended_sp are safe only fp is questionable here 86 87 // If the current frame is known to the code cache then we can attempt to 88 // to construct the sender and do some validation of it. This goes a long way 89 // toward eliminating issues when we get in frame construction code 90 91 if (_cb != NULL ) { 92 93 // First check if frame is complete and tester is reliable 94 // Unfortunately we can only check frame complete for runtime stubs and nmethod 95 // other generic buffer blobs are more problematic so we just assume they are 96 // ok. adapter blobs never have a frame complete and are never ok. 97 98 if (!_cb->is_frame_complete_at(_pc)) { 99 if (_cb->is_nmethod() || _cb->is_adapter_blob() || _cb->is_runtime_stub()) { 100 return false; 101 } 102 } 103 104 // Could just be some random pointer within the codeBlob 105 if (!_cb->code_contains(_pc)) { 106 return false; 107 } 108 109 // Entry frame checks 110 if (is_entry_frame()) { 111 // an entry frame must have a valid fp. 112 113 if (!fp_safe) return false; 114 115 // Validate the JavaCallWrapper an entry frame must have 116 117 address jcw = (address)entry_frame_call_wrapper(); 118 119 bool jcw_safe = (jcw < thread->stack_base()) && ( jcw > fp); 120 121 return jcw_safe; 122 123 } 124 125 intptr_t* sender_sp = NULL; 126 intptr_t* sender_unextended_sp = NULL; 127 address sender_pc = NULL; 128 intptr_t* saved_fp = NULL; 129 130 if (is_interpreted_frame()) { 131 // fp must be safe 132 if (!fp_safe) { 133 return false; 134 } 135 136 sender_pc = (address) this->fp()[return_addr_offset]; 137 // for interpreted frames, the value below is the sender "raw" sp, 138 // which can be different from the sender unextended sp (the sp seen 139 // by the sender) because of current frame local variables 140 sender_sp = (intptr_t*) addr_at(sender_sp_offset); 141 sender_unextended_sp = (intptr_t*) this->fp()[interpreter_frame_sender_sp_offset]; 142 saved_fp = (intptr_t*) this->fp()[link_offset]; 143 144 } else { 145 // must be some sort of compiled/runtime frame 146 // fp does not have to be safe (although it could be check for c1?) 147 148 // check for a valid frame_size, otherwise we are unlikely to get a valid sender_pc 149 if (_cb->frame_size() <= 0) { 150 return false; 151 } 152 153 sender_sp = _unextended_sp + _cb->frame_size(); 154 sender_unextended_sp = sender_sp; 155 // On Intel the return_address is always the word on the stack 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 // ebp 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 ebp 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 if (sender_blob->is_nmethod()) { 225 nmethod* nm = sender_blob->as_nmethod_or_null(); 226 if (nm != NULL) { 227 if (nm->is_deopt_mh_entry(sender_pc) || nm->is_deopt_entry(sender_pc)) { 228 return false; 229 } 230 } 231 } 232 233 // If the frame size is 0 something (or less) is bad because every nmethod has a non-zero frame size 234 // because the return address counts against the callee's frame. 235 236 if (sender_blob->frame_size() <= 0) { 237 assert(!sender_blob->is_nmethod(), "should count return address at least"); 238 return false; 239 } 240 241 // We should never be able to see anything here except an nmethod. If something in the 242 // code cache (current frame) is called by an entity within the code cache that entity 243 // should not be anything but the call stub (already covered), the interpreter (already covered) 244 // or an nmethod. 245 246 if (!sender_blob->is_nmethod()) { 247 return false; 248 } 249 250 // Could put some more validation for the potential non-interpreted sender 251 // frame we'd create by calling sender if I could think of any. Wait for next crash in forte... 252 253 // One idea is seeing if the sender_pc we have is one that we'd expect to call to current cb 254 255 // We've validated the potential sender that would be created 256 return true; 257 } 258 259 // Must be native-compiled frame. Since sender will try and use fp to find 260 // linkages it must be safe 261 262 if (!fp_safe) { 263 return false; 264 } 265 266 // Will the pc we fetch be non-zero (which we'll find at the oldest frame) 267 268 if ( (address) this->fp()[return_addr_offset] == NULL) return false; 269 270 271 // could try and do some more potential verification of native frame if we could think of some... 272 273 return true; 274 275 } 276 277 278 void frame::patch_pc(Thread* thread, address pc) { 279 address* pc_addr = &(((address*) sp())[-1]); 280 if (TracePcPatching) { 281 tty->print_cr("patch_pc at address " INTPTR_FORMAT " [" INTPTR_FORMAT " -> " INTPTR_FORMAT "]", 282 pc_addr, *pc_addr, pc); 283 } 284 // Either the return address is the original one or we are going to 285 // patch in the same address that's already there. 286 assert(_pc == *pc_addr || pc == *pc_addr, "must be"); 287 *pc_addr = pc; 288 _cb = CodeCache::find_blob(pc); 289 address original_pc = nmethod::get_deopt_original_pc(this); 290 if (original_pc != NULL) { 291 assert(original_pc == _pc, "expected original PC to be stored before patching"); 292 _deopt_state = is_deoptimized; 293 // leave _pc as is 294 } else { 295 _deopt_state = not_deoptimized; 296 _pc = pc; 297 } 298 } 299 300 bool frame::is_interpreted_frame() const { 301 return Interpreter::contains(pc()); 302 } 303 304 int frame::frame_size(RegisterMap* map) const { 305 frame sender = this->sender(map); 306 return sender.sp() - sp(); 307 } 308 309 intptr_t* frame::entry_frame_argument_at(int offset) const { 310 // convert offset to index to deal with tsi 311 int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize); 312 // Entry frame's arguments are always in relation to unextended_sp() 313 return &unextended_sp()[index]; 314 } 315 316 // sender_sp 317 #ifdef CC_INTERP 318 intptr_t* frame::interpreter_frame_sender_sp() const { 319 assert(is_interpreted_frame(), "interpreted frame expected"); 320 // QQQ why does this specialize method exist if frame::sender_sp() does same thing? 321 // seems odd and if we always know interpreted vs. non then sender_sp() is really 322 // doing too much work. 323 return get_interpreterState()->sender_sp(); 324 } 325 326 // monitor elements 327 328 BasicObjectLock* frame::interpreter_frame_monitor_begin() const { 329 return get_interpreterState()->monitor_base(); 330 } 331 332 BasicObjectLock* frame::interpreter_frame_monitor_end() const { 333 return (BasicObjectLock*) get_interpreterState()->stack_base(); 334 } 335 336 #else // CC_INTERP 337 338 intptr_t* frame::interpreter_frame_sender_sp() const { 339 assert(is_interpreted_frame(), "interpreted frame expected"); 340 return (intptr_t*) at(interpreter_frame_sender_sp_offset); 341 } 342 343 void frame::set_interpreter_frame_sender_sp(intptr_t* sender_sp) { 344 assert(is_interpreted_frame(), "interpreted frame expected"); 345 ptr_at_put(interpreter_frame_sender_sp_offset, (intptr_t) sender_sp); 346 } 347 348 349 // monitor elements 350 351 BasicObjectLock* frame::interpreter_frame_monitor_begin() const { 352 return (BasicObjectLock*) addr_at(interpreter_frame_monitor_block_bottom_offset); 353 } 354 355 BasicObjectLock* frame::interpreter_frame_monitor_end() const { 356 BasicObjectLock* result = (BasicObjectLock*) *addr_at(interpreter_frame_monitor_block_top_offset); 357 // make sure the pointer points inside the frame 358 assert(sp() <= (intptr_t*) result, "monitor end should be above the stack pointer"); 359 assert((intptr_t*) result < fp(), "monitor end should be strictly below the frame pointer"); 360 return result; 361 } 362 363 void frame::interpreter_frame_set_monitor_end(BasicObjectLock* value) { 364 *((BasicObjectLock**)addr_at(interpreter_frame_monitor_block_top_offset)) = value; 365 } 366 367 // Used by template based interpreter deoptimization 368 void frame::interpreter_frame_set_last_sp(intptr_t* sp) { 369 *((intptr_t**)addr_at(interpreter_frame_last_sp_offset)) = sp; 370 } 371 #endif // CC_INTERP 372 373 frame frame::sender_for_entry_frame(RegisterMap* map) const { 374 assert(map != NULL, "map must be set"); 375 // Java frame called from C; skip all C frames and return top C 376 // frame of that chunk as the sender 377 JavaFrameAnchor* jfa = entry_frame_call_wrapper()->anchor(); 378 assert(!entry_frame_is_first(), "next Java fp must be non zero"); 379 assert(jfa->last_Java_sp() > sp(), "must be above this frame on stack"); 380 map->clear(); 381 assert(map->include_argument_oops(), "should be set by clear"); 382 if (jfa->last_Java_pc() != NULL ) { 383 frame fr(jfa->last_Java_sp(), jfa->last_Java_fp(), jfa->last_Java_pc()); 384 return fr; 385 } 386 frame fr(jfa->last_Java_sp(), jfa->last_Java_fp()); 387 return fr; 388 } 389 390 //------------------------------------------------------------------------------ 391 // frame::verify_deopt_original_pc 392 // 393 // Verifies the calculated original PC of a deoptimization PC for the 394 // given unextended SP. The unextended SP might also be the saved SP 395 // for MethodHandle call sites. 396 #ifdef ASSERT 397 void frame::verify_deopt_original_pc(nmethod* nm, intptr_t* unextended_sp, bool is_method_handle_return) { 398 frame fr; 399 400 // This is ugly but it's better than to change {get,set}_original_pc 401 // to take an SP value as argument. And it's only a debugging 402 // method anyway. 403 fr._unextended_sp = unextended_sp; 404 405 address original_pc = nm->get_original_pc(&fr); 406 assert(nm->insts_contains(original_pc), "original PC must be in nmethod"); 407 assert(nm->is_method_handle_return(original_pc) == is_method_handle_return, "must be"); 408 } 409 #endif 410 411 //------------------------------------------------------------------------------ 412 // frame::adjust_unextended_sp 413 void frame::adjust_unextended_sp() { 414 // If we are returning to a compiled MethodHandle call site, the 415 // saved_fp will in fact be a saved value of the unextended SP. The 416 // simplest way to tell whether we are returning to such a call site 417 // is as follows: 418 419 nmethod* sender_nm = (_cb == NULL) ? NULL : _cb->as_nmethod_or_null(); 420 if (sender_nm != NULL) { 421 // If the sender PC is a deoptimization point, get the original 422 // PC. For MethodHandle call site the unextended_sp is stored in 423 // saved_fp. 424 if (sender_nm->is_deopt_mh_entry(_pc)) { 425 DEBUG_ONLY(verify_deopt_mh_original_pc(sender_nm, _fp)); 426 _unextended_sp = _fp; 427 } 428 else if (sender_nm->is_deopt_entry(_pc)) { 429 DEBUG_ONLY(verify_deopt_original_pc(sender_nm, _unextended_sp)); 430 } 431 else if (sender_nm->is_method_handle_return(_pc)) { 432 _unextended_sp = _fp; 433 } 434 } 435 } 436 437 //------------------------------------------------------------------------------ 438 // frame::update_map_with_saved_link 439 void frame::update_map_with_saved_link(RegisterMap* map, intptr_t** link_addr) { 440 // The interpreter and compiler(s) always save EBP/RBP in a known 441 // location on entry. We must record where that location is 442 // so this if EBP/RBP was live on callout from c2 we can find 443 // the saved copy no matter what it called. 444 445 // Since the interpreter always saves EBP/RBP if we record where it is then 446 // we don't have to always save EBP/RBP on entry and exit to c2 compiled 447 // code, on entry will be enough. 448 map->set_location(rbp->as_VMReg(), (address) link_addr); 449 #ifdef AMD64 450 // this is weird "H" ought to be at a higher address however the 451 // oopMaps seems to have the "H" regs at the same address and the 452 // vanilla register. 453 // XXXX make this go away 454 if (true) { 455 map->set_location(rbp->as_VMReg()->next(), (address) link_addr); 456 } 457 #endif // AMD64 458 } 459 460 461 //------------------------------------------------------------------------------ 462 // frame::sender_for_interpreter_frame 463 frame frame::sender_for_interpreter_frame(RegisterMap* map) const { 464 // SP is the raw SP from the sender after adapter or interpreter 465 // extension. 466 intptr_t* sender_sp = this->sender_sp(); 467 468 // This is the sp before any possible extension (adapter/locals). 469 intptr_t* unextended_sp = interpreter_frame_sender_sp(); 470 471 #ifdef COMPILER2 472 if (map->update_map()) { 473 update_map_with_saved_link(map, (intptr_t**) addr_at(link_offset)); 474 } 475 #endif // COMPILER2 476 477 return frame(sender_sp, unextended_sp, link(), sender_pc()); 478 } 479 480 481 //------------------------------------------------------------------------------ 482 // frame::sender_for_compiled_frame 483 frame frame::sender_for_compiled_frame(RegisterMap* map) const { 484 assert(map != NULL, "map must be set"); 485 486 // frame owned by optimizing compiler 487 assert(_cb->frame_size() >= 0, "must have non-zero frame size"); 488 intptr_t* sender_sp = unextended_sp() + _cb->frame_size(); 489 intptr_t* unextended_sp = sender_sp; 490 491 // On Intel the return_address is always the word on the stack 492 address sender_pc = (address) *(sender_sp-1); 493 494 // This is the saved value of EBP which may or may not really be an FP. 495 // It is only an FP if the sender is an interpreter frame (or C1?). 496 intptr_t** saved_fp_addr = (intptr_t**) (sender_sp - frame::sender_sp_offset); 497 498 if (map->update_map()) { 499 // Tell GC to use argument oopmaps for some runtime stubs that need it. 500 // For C1, the runtime stub might not have oop maps, so set this flag 501 // outside of update_register_map. 502 map->set_include_argument_oops(_cb->caller_must_gc_arguments(map->thread())); 503 if (_cb->oop_maps() != NULL) { 504 OopMapSet::update_register_map(this, map); 505 } 506 507 // Since the prolog does the save and restore of EBP there is no oopmap 508 // for it so we must fill in its location as if there was an oopmap entry 509 // since if our caller was compiled code there could be live jvm state in it. 510 update_map_with_saved_link(map, saved_fp_addr); 511 } 512 513 assert(sender_sp != sp(), "must have changed"); 514 return frame(sender_sp, unextended_sp, *saved_fp_addr, sender_pc); 515 } 516 517 518 //------------------------------------------------------------------------------ 519 // frame::sender 520 frame frame::sender(RegisterMap* map) const { 521 // Default is we done have to follow them. The sender_for_xxx will 522 // update it accordingly 523 map->set_include_argument_oops(false); 524 525 if (is_entry_frame()) return sender_for_entry_frame(map); 526 if (is_interpreted_frame()) return sender_for_interpreter_frame(map); 527 assert(_cb == CodeCache::find_blob(pc()),"Must be the same"); 528 529 if (_cb != NULL) { 530 return sender_for_compiled_frame(map); 531 } 532 // Must be native-compiled frame, i.e. the marshaling code for native 533 // methods that exists in the core system. 534 return frame(sender_sp(), link(), sender_pc()); 535 } 536 537 538 bool frame::interpreter_frame_equals_unpacked_fp(intptr_t* fp) { 539 assert(is_interpreted_frame(), "must be interpreter frame"); 540 Method* method = interpreter_frame_method(); 541 // When unpacking an optimized frame the frame pointer is 542 // adjusted with: 543 int diff = (method->max_locals() - method->size_of_parameters()) * 544 Interpreter::stackElementWords; 545 return _fp == (fp - diff); 546 } 547 548 bool frame::is_interpreted_frame_valid(JavaThread* thread) const { 549 // QQQ 550 #ifdef CC_INTERP 551 #else 552 assert(is_interpreted_frame(), "Not an interpreted frame"); 553 // These are reasonable sanity checks 554 if (fp() == 0 || (intptr_t(fp()) & (wordSize-1)) != 0) { 555 return false; 556 } 557 if (sp() == 0 || (intptr_t(sp()) & (wordSize-1)) != 0) { 558 return false; 559 } 560 if (fp() + interpreter_frame_initial_sp_offset < sp()) { 561 return false; 562 } 563 // These are hacks to keep us out of trouble. 564 // The problem with these is that they mask other problems 565 if (fp() <= sp()) { // this attempts to deal with unsigned comparison above 566 return false; 567 } 568 569 // do some validation of frame elements 570 571 // first the method 572 573 Method* m = *interpreter_frame_method_addr(); 574 575 // validate the method we'd find in this potential sender 576 if (!m->is_valid_method()) return false; 577 578 // stack frames shouldn't be much larger than max_stack elements 579 // this test requires to use the unextended_sp which is the sp as seen by 580 // the current frame, and not sp which is the "raw" pc which could point 581 // further because of local variables of the callee method inserted after 582 // method arguments 583 if (fp() - unextended_sp() > 1024 + m->max_stack()*Interpreter::stackElementSize) { 584 return false; 585 } 586 587 // validate bci/bcp 588 589 address bcp = interpreter_frame_bcp(); 590 if (m->validate_bci_from_bcp(bcp) < 0) { 591 return false; 592 } 593 594 // validate ConstantPoolCache* 595 ConstantPoolCache* cp = *interpreter_frame_cache_addr(); 596 if (cp == NULL || !cp->is_metaspace_object()) return false; 597 598 // validate locals 599 600 address locals = (address) *interpreter_frame_locals_addr(); 601 602 if (locals > thread->stack_base() || locals < (address) fp()) return false; 603 604 // We'd have to be pretty unlucky to be mislead at this point 605 606 #endif // CC_INTERP 607 return true; 608 } 609 610 BasicType frame::interpreter_frame_result(oop* oop_result, jvalue* value_result) { 611 #ifdef CC_INTERP 612 // Needed for JVMTI. The result should always be in the 613 // interpreterState object 614 interpreterState istate = get_interpreterState(); 615 #endif // CC_INTERP 616 assert(is_interpreted_frame(), "interpreted frame expected"); 617 Method* method = interpreter_frame_method(); 618 BasicType type = method->result_type(); 619 620 intptr_t* tos_addr; 621 if (method->is_native()) { 622 // Prior to calling into the runtime to report the method_exit the possible 623 // return value is pushed to the native stack. If the result is a jfloat/jdouble 624 // then ST0 is saved before EAX/EDX. See the note in generate_native_result 625 tos_addr = (intptr_t*)sp(); 626 if (type == T_FLOAT || type == T_DOUBLE) { 627 // QQQ seems like this code is equivalent on the two platforms 628 #ifdef AMD64 629 // This is times two because we do a push(ltos) after pushing XMM0 630 // and that takes two interpreter stack slots. 631 tos_addr += 2 * Interpreter::stackElementWords; 632 #else 633 tos_addr += 2; 634 #endif // AMD64 635 } 636 } else { 637 tos_addr = (intptr_t*)interpreter_frame_tos_address(); 638 } 639 640 switch (type) { 641 case T_OBJECT : 642 case T_ARRAY : { 643 oop obj; 644 if (method->is_native()) { 645 #ifdef CC_INTERP 646 obj = istate->_oop_temp; 647 #else 648 obj = cast_to_oop(at(interpreter_frame_oop_temp_offset)); 649 #endif // CC_INTERP 650 } else { 651 oop* obj_p = (oop*)tos_addr; 652 obj = (obj_p == NULL) ? (oop)NULL : *obj_p; 653 } 654 assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check"); 655 *oop_result = obj; 656 break; 657 } 658 case T_BOOLEAN : value_result->z = *(jboolean*)tos_addr; break; 659 case T_BYTE : value_result->b = *(jbyte*)tos_addr; break; 660 case T_CHAR : value_result->c = *(jchar*)tos_addr; break; 661 case T_SHORT : value_result->s = *(jshort*)tos_addr; break; 662 case T_INT : value_result->i = *(jint*)tos_addr; break; 663 case T_LONG : value_result->j = *(jlong*)tos_addr; break; 664 case T_FLOAT : { 665 #ifdef AMD64 666 value_result->f = *(jfloat*)tos_addr; 667 #else 668 if (method->is_native()) { 669 jdouble d = *(jdouble*)tos_addr; // Result was in ST0 so need to convert to jfloat 670 value_result->f = (jfloat)d; 671 } else { 672 value_result->f = *(jfloat*)tos_addr; 673 } 674 #endif // AMD64 675 break; 676 } 677 case T_DOUBLE : value_result->d = *(jdouble*)tos_addr; break; 678 case T_VOID : /* Nothing to do */ break; 679 default : ShouldNotReachHere(); 680 } 681 682 return type; 683 } 684 685 686 intptr_t* frame::interpreter_frame_tos_at(jint offset) const { 687 int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize); 688 return &interpreter_frame_tos_address()[index]; 689 } 690 691 #ifndef PRODUCT 692 693 #define DESCRIBE_FP_OFFSET(name) \ 694 values.describe(frame_no, fp() + frame::name##_offset, #name) 695 696 void frame::describe_pd(FrameValues& values, int frame_no) { 697 if (is_interpreted_frame()) { 698 #ifndef CC_INTERP 699 DESCRIBE_FP_OFFSET(interpreter_frame_sender_sp); 700 DESCRIBE_FP_OFFSET(interpreter_frame_last_sp); 701 DESCRIBE_FP_OFFSET(interpreter_frame_method); 702 DESCRIBE_FP_OFFSET(interpreter_frame_mdp); 703 DESCRIBE_FP_OFFSET(interpreter_frame_cache); 704 DESCRIBE_FP_OFFSET(interpreter_frame_locals); 705 DESCRIBE_FP_OFFSET(interpreter_frame_bcp); 706 DESCRIBE_FP_OFFSET(interpreter_frame_initial_sp); 707 #endif 708 } 709 } 710 #endif 711 712 intptr_t *frame::initial_deoptimization_info() { 713 // used to reset the saved FP 714 return fp(); 715 } 716 717 intptr_t* frame::real_fp() const { 718 if (_cb != NULL) { 719 // use the frame size if valid 720 int size = _cb->frame_size(); 721 if (size > 0) { 722 return unextended_sp() + size; 723 } 724 } 725 // else rely on fp() 726 assert(! is_compiled_frame(), "unknown compiled frame size"); 727 return fp(); 728 } 729 730 #ifndef PRODUCT 731 // This is a generic constructor which is only used by pns() in debug.cpp. 732 frame::frame(void* sp, void* fp, void* pc) { 733 init((intptr_t*)sp, (intptr_t*)fp, (address)pc); 734 } 735 #endif