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