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