1 /* 2 * Copyright (c) 1997, 2016, 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 "code/codeCache.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/signature.hpp" 38 #include "runtime/stubCodeGenerator.hpp" 39 #include "runtime/stubRoutines.hpp" 40 #include "vmreg_sparc.inline.hpp" 41 #ifdef COMPILER1 42 #include "c1/c1_Runtime1.hpp" 43 #include "runtime/vframeArray.hpp" 44 #endif 45 46 void RegisterMap::pd_clear() { 47 if (_thread->has_last_Java_frame()) { 48 frame fr = _thread->last_frame(); 49 _window = fr.sp(); 50 } else { 51 _window = NULL; 52 } 53 _younger_window = NULL; 54 } 55 56 57 // Unified register numbering scheme: each 32-bits counts as a register 58 // number, so all the V9 registers take 2 slots. 59 const static int R_L_nums[] = {0+040,2+040,4+040,6+040,8+040,10+040,12+040,14+040}; 60 const static int R_I_nums[] = {0+060,2+060,4+060,6+060,8+060,10+060,12+060,14+060}; 61 const static int R_O_nums[] = {0+020,2+020,4+020,6+020,8+020,10+020,12+020,14+020}; 62 const static int R_G_nums[] = {0+000,2+000,4+000,6+000,8+000,10+000,12+000,14+000}; 63 static RegisterMap::LocationValidType bad_mask = 0; 64 static RegisterMap::LocationValidType R_LIO_mask = 0; 65 static bool register_map_inited = false; 66 67 static void register_map_init() { 68 if (!register_map_inited) { 69 register_map_inited = true; 70 int i; 71 for (i = 0; i < 8; i++) { 72 assert(R_L_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); 73 assert(R_I_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); 74 assert(R_O_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); 75 assert(R_G_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); 76 } 77 78 bad_mask |= (1LL << R_O_nums[6]); // SP 79 bad_mask |= (1LL << R_O_nums[7]); // cPC 80 bad_mask |= (1LL << R_I_nums[6]); // FP 81 bad_mask |= (1LL << R_I_nums[7]); // rPC 82 bad_mask |= (1LL << R_G_nums[2]); // TLS 83 bad_mask |= (1LL << R_G_nums[7]); // reserved by libthread 84 85 for (i = 0; i < 8; i++) { 86 R_LIO_mask |= (1LL << R_L_nums[i]); 87 R_LIO_mask |= (1LL << R_I_nums[i]); 88 R_LIO_mask |= (1LL << R_O_nums[i]); 89 } 90 } 91 } 92 93 94 address RegisterMap::pd_location(VMReg regname) const { 95 register_map_init(); 96 97 assert(regname->is_reg(), "sanity check"); 98 // Only the GPRs get handled this way 99 if( !regname->is_Register()) 100 return NULL; 101 102 // don't talk about bad registers 103 if ((bad_mask & ((LocationValidType)1 << regname->value())) != 0) { 104 return NULL; 105 } 106 107 // Convert to a GPR 108 Register reg; 109 int second_word = 0; 110 // 32-bit registers for in, out and local 111 if (!regname->is_concrete()) { 112 // HMM ought to return NULL for any non-concrete (odd) vmreg 113 // this all tied up in the fact we put out double oopMaps for 114 // register locations. When that is fixed we'd will return NULL 115 // (or assert here). 116 reg = regname->prev()->as_Register(); 117 second_word = sizeof(jint); 118 } else { 119 reg = regname->as_Register(); 120 } 121 if (reg->is_out()) { 122 assert(_younger_window != NULL, "Younger window should be available"); 123 return second_word + (address)&_younger_window[reg->after_save()->sp_offset_in_saved_window()]; 124 } 125 if (reg->is_local() || reg->is_in()) { 126 assert(_window != NULL, "Window should be available"); 127 return second_word + (address)&_window[reg->sp_offset_in_saved_window()]; 128 } 129 // Only the window'd GPRs get handled this way; not the globals. 130 return NULL; 131 } 132 133 134 #ifdef ASSERT 135 void RegisterMap::check_location_valid() { 136 register_map_init(); 137 assert((_location_valid[0] & bad_mask) == 0, "cannot have special locations for SP,FP,TLS,etc."); 138 } 139 #endif 140 141 // We are shifting windows. That means we are moving all %i to %o, 142 // getting rid of all current %l, and keeping all %g. This is only 143 // complicated if any of the location pointers for these are valid. 144 // The normal case is that everything is in its standard register window 145 // home, and _location_valid[0] is zero. In that case, this routine 146 // does exactly nothing. 147 void RegisterMap::shift_individual_registers() { 148 if (!update_map()) return; // this only applies to maps with locations 149 register_map_init(); 150 check_location_valid(); 151 152 LocationValidType lv = _location_valid[0]; 153 LocationValidType lv0 = lv; 154 155 lv &= ~R_LIO_mask; // clear %l, %o, %i regs 156 157 // if we cleared some non-%g locations, we may have to do some shifting 158 if (lv != lv0) { 159 // copy %i0-%i5 to %o0-%o5, if they have special locations 160 // This can happen in within stubs which spill argument registers 161 // around a dynamic link operation, such as resolve_opt_virtual_call. 162 for (int i = 0; i < 8; i++) { 163 if (lv0 & (1LL << R_I_nums[i])) { 164 _location[R_O_nums[i]] = _location[R_I_nums[i]]; 165 lv |= (1LL << R_O_nums[i]); 166 } 167 } 168 } 169 170 _location_valid[0] = lv; 171 check_location_valid(); 172 } 173 174 bool frame::safe_for_sender(JavaThread *thread) { 175 176 address _SP = (address) sp(); 177 address _FP = (address) fp(); 178 address _UNEXTENDED_SP = (address) unextended_sp(); 179 // sp must be within the stack 180 bool sp_safe = (_SP <= thread->stack_base()) && 181 (_SP >= thread->stack_base() - thread->stack_size()); 182 183 if (!sp_safe) { 184 return false; 185 } 186 187 // unextended sp must be within the stack and above or equal sp 188 bool unextended_sp_safe = (_UNEXTENDED_SP <= thread->stack_base()) && 189 (_UNEXTENDED_SP >= _SP); 190 191 if (!unextended_sp_safe) return false; 192 193 // an fp must be within the stack and above (but not equal) sp 194 bool fp_safe = (_FP <= thread->stack_base()) && 195 (_FP > _SP); 196 197 // We know sp/unextended_sp are safe only fp is questionable here 198 199 // If the current frame is known to the code cache then we can attempt to 200 // to construct the sender and do some validation of it. This goes a long way 201 // toward eliminating issues when we get in frame construction code 202 203 if (_cb != NULL ) { 204 205 // First check if frame is complete and tester is reliable 206 // Unfortunately we can only check frame complete for runtime stubs and nmethod 207 // other generic buffer blobs are more problematic so we just assume they are 208 // ok. adapter blobs never have a frame complete and are never ok. 209 210 if (!_cb->is_frame_complete_at(_pc)) { 211 if (_cb->is_compiled() || _cb->is_adapter_blob() || _cb->is_runtime_stub()) { 212 return false; 213 } 214 } 215 216 // Could just be some random pointer within the codeBlob 217 if (!_cb->code_contains(_pc)) { 218 return false; 219 } 220 221 // Entry frame checks 222 if (is_entry_frame()) { 223 // an entry frame must have a valid fp. 224 return fp_safe && is_entry_frame_valid(thread); 225 } 226 227 intptr_t* younger_sp = sp(); 228 intptr_t* _SENDER_SP = sender_sp(); // sender is actually just _FP 229 bool adjusted_stack = is_interpreted_frame(); 230 231 address sender_pc = (address)younger_sp[I7->sp_offset_in_saved_window()] + pc_return_offset; 232 233 234 // We must always be able to find a recognizable pc 235 CodeBlob* sender_blob = CodeCache::find_blob_unsafe(sender_pc); 236 if (sender_pc == NULL || sender_blob == NULL) { 237 return false; 238 } 239 240 // Could be a zombie method 241 if (sender_blob->is_zombie() || sender_blob->is_unloaded()) { 242 return false; 243 } 244 245 // It should be safe to construct the sender though it might not be valid 246 247 frame sender(_SENDER_SP, younger_sp, adjusted_stack); 248 249 // Do we have a valid fp? 250 address sender_fp = (address) sender.fp(); 251 252 // an fp must be within the stack and above (but not equal) current frame's _FP 253 254 bool sender_fp_safe = (sender_fp <= thread->stack_base()) && 255 (sender_fp > _FP); 256 257 if (!sender_fp_safe) { 258 return false; 259 } 260 261 262 // If the potential sender is the interpreter then we can do some more checking 263 if (Interpreter::contains(sender_pc)) { 264 return sender.is_interpreted_frame_valid(thread); 265 } 266 267 // Could just be some random pointer within the codeBlob 268 if (!sender.cb()->code_contains(sender_pc)) { 269 return false; 270 } 271 272 // We should never be able to see an adapter if the current frame is something from code cache 273 if (sender_blob->is_adapter_blob()) { 274 return false; 275 } 276 277 if (sender.is_entry_frame()) { 278 // Validate the JavaCallWrapper an entry frame must have 279 280 address jcw = (address)sender.entry_frame_call_wrapper(); 281 282 bool jcw_safe = (jcw <= thread->stack_base()) && (jcw > sender_fp); 283 284 return jcw_safe; 285 } 286 287 // If the frame size is 0 something (or less) is bad because every nmethod has a non-zero frame size 288 // because you must allocate window space 289 290 if (sender_blob->frame_size() <= 0) { 291 assert(!sender_blob->is_compiled(), "should count return address at least"); 292 return false; 293 } 294 295 // The sender should positively be an nmethod or call_stub. On sparc we might in fact see something else. 296 // The cause of this is because at a save instruction the O7 we get is a leftover from an earlier 297 // window use. So if a runtime stub creates two frames (common in fastdebug/debug) then we see the 298 // stale pc. So if the sender blob is not something we'd expect we have little choice but to declare 299 // the stack unwalkable. pd_get_top_frame_for_signal_handler tries to recover from this by unwinding 300 // that initial frame and retrying. 301 302 if (!sender_blob->is_compiled()) { 303 return false; 304 } 305 306 // Could put some more validation for the potential non-interpreted sender 307 // frame we'd create by calling sender if I could think of any. Wait for next crash in forte... 308 309 // One idea is seeing if the sender_pc we have is one that we'd expect to call to current cb 310 311 // We've validated the potential sender that would be created 312 313 return true; 314 315 } 316 317 // Must be native-compiled frame. Since sender will try and use fp to find 318 // linkages it must be safe 319 320 if (!fp_safe) return false; 321 322 // could try and do some more potential verification of native frame if we could think of some... 323 324 return true; 325 } 326 327 // constructors 328 329 // Construct an unpatchable, deficient frame 330 void frame::init(intptr_t* sp, address pc, CodeBlob* cb) { 331 assert( (((intptr_t)sp & (wordSize-1)) == 0), "frame constructor passed an invalid sp"); 332 _sp = sp; 333 _younger_sp = NULL; 334 _pc = pc; 335 _cb = cb; 336 _sp_adjustment_by_callee = 0; 337 assert(pc == NULL && cb == NULL || pc != NULL, "can't have a cb and no pc!"); 338 if (_cb == NULL && _pc != NULL ) { 339 _cb = CodeCache::find_blob(_pc); 340 } 341 _deopt_state = unknown; 342 } 343 344 frame::frame(intptr_t* sp, unpatchable_t, address pc, CodeBlob* cb) { 345 init(sp, pc, cb); 346 } 347 348 frame::frame(intptr_t* sp, intptr_t* younger_sp, bool younger_frame_is_interpreted) : 349 _sp(sp), 350 _younger_sp(younger_sp), 351 _deopt_state(unknown), 352 _sp_adjustment_by_callee(0) { 353 if (younger_sp == NULL) { 354 // make a deficient frame which doesn't know where its PC is 355 _pc = NULL; 356 _cb = NULL; 357 } else { 358 _pc = (address)younger_sp[I7->sp_offset_in_saved_window()] + pc_return_offset; 359 assert( (intptr_t*)younger_sp[FP->sp_offset_in_saved_window()] == (intptr_t*)((intptr_t)sp - STACK_BIAS), "younger_sp must be valid"); 360 // Any frame we ever build should always "safe" therefore we should not have to call 361 // find_blob_unsafe 362 // In case of native stubs, the pc retrieved here might be 363 // wrong. (the _last_native_pc will have the right value) 364 // So do not put add any asserts on the _pc here. 365 } 366 367 if (_pc != NULL) 368 _cb = CodeCache::find_blob(_pc); 369 370 // Check for MethodHandle call sites. 371 if (_cb != NULL) { 372 CompiledMethod* nm = _cb->as_compiled_method_or_null(); 373 if (nm != NULL) { 374 if (nm->is_deopt_mh_entry(_pc) || nm->is_method_handle_return(_pc)) { 375 _sp_adjustment_by_callee = (intptr_t*) ((intptr_t) sp[L7_mh_SP_save->sp_offset_in_saved_window()] + STACK_BIAS) - sp; 376 // The SP is already adjusted by this MH call site, don't 377 // overwrite this value with the wrong interpreter value. 378 younger_frame_is_interpreted = false; 379 } 380 } 381 } 382 383 if (younger_frame_is_interpreted) { 384 // compute adjustment to this frame's SP made by its interpreted callee 385 _sp_adjustment_by_callee = (intptr_t*) ((intptr_t) younger_sp[I5_savedSP->sp_offset_in_saved_window()] + STACK_BIAS) - sp; 386 } 387 388 // It is important that the frame is fully constructed when we do 389 // this lookup as get_deopt_original_pc() needs a correct value for 390 // unextended_sp() which uses _sp_adjustment_by_callee. 391 if (_pc != NULL) { 392 address original_pc = CompiledMethod::get_deopt_original_pc(this); 393 if (original_pc != NULL) { 394 _pc = original_pc; 395 _deopt_state = is_deoptimized; 396 } else { 397 _deopt_state = not_deoptimized; 398 } 399 } 400 } 401 402 #ifndef PRODUCT 403 // This is a generic constructor which is only used by pns() in debug.cpp. 404 frame::frame(void* sp, void* fp, void* pc) { 405 init((intptr_t*)sp, (address)pc, NULL); 406 } 407 #endif 408 409 bool frame::is_interpreted_frame() const { 410 return Interpreter::contains(pc()); 411 } 412 413 // sender_sp 414 415 intptr_t* frame::interpreter_frame_sender_sp() const { 416 assert(is_interpreted_frame(), "interpreted frame expected"); 417 return fp(); 418 } 419 420 void frame::set_interpreter_frame_sender_sp(intptr_t* sender_sp) { 421 assert(is_interpreted_frame(), "interpreted frame expected"); 422 Unimplemented(); 423 } 424 425 frame frame::sender_for_entry_frame(RegisterMap *map) const { 426 assert(map != NULL, "map must be set"); 427 // Java frame called from C; skip all C frames and return top C 428 // frame of that chunk as the sender 429 JavaFrameAnchor* jfa = entry_frame_call_wrapper()->anchor(); 430 assert(!entry_frame_is_first(), "next Java fp must be non zero"); 431 assert(jfa->last_Java_sp() > _sp, "must be above this frame on stack"); 432 intptr_t* last_Java_sp = jfa->last_Java_sp(); 433 // Since we are walking the stack now this nested anchor is obviously walkable 434 // even if it wasn't when it was stacked. 435 if (!jfa->walkable()) { 436 // Capture _last_Java_pc (if needed) and mark anchor walkable. 437 jfa->capture_last_Java_pc(_sp); 438 } 439 assert(jfa->last_Java_pc() != NULL, "No captured pc!"); 440 map->clear(); 441 map->make_integer_regs_unsaved(); 442 map->shift_window(last_Java_sp, NULL); 443 assert(map->include_argument_oops(), "should be set by clear"); 444 return frame(last_Java_sp, frame::unpatchable, jfa->last_Java_pc()); 445 } 446 447 frame frame::sender_for_interpreter_frame(RegisterMap *map) const { 448 ShouldNotCallThis(); 449 return sender(map); 450 } 451 452 frame frame::sender_for_compiled_frame(RegisterMap *map) const { 453 ShouldNotCallThis(); 454 return sender(map); 455 } 456 457 frame frame::sender(RegisterMap* map) const { 458 assert(map != NULL, "map must be set"); 459 460 assert(CodeCache::find_blob_unsafe(_pc) == _cb, "inconsistent"); 461 462 // Default is not to follow arguments; update it accordingly below 463 map->set_include_argument_oops(false); 464 465 if (is_entry_frame()) return sender_for_entry_frame(map); 466 467 intptr_t* younger_sp = sp(); 468 intptr_t* sp = sender_sp(); 469 470 // Note: The version of this operation on any platform with callee-save 471 // registers must update the register map (if not null). 472 // In order to do this correctly, the various subtypes of 473 // of frame (interpreted, compiled, glue, native), 474 // must be distinguished. There is no need on SPARC for 475 // such distinctions, because all callee-save registers are 476 // preserved for all frames via SPARC-specific mechanisms. 477 // 478 // *** HOWEVER, *** if and when we make any floating-point 479 // registers callee-saved, then we will have to copy over 480 // the RegisterMap update logic from the Intel code. 481 482 // The constructor of the sender must know whether this frame is interpreted so it can set the 483 // sender's _sp_adjustment_by_callee field. An osr adapter frame was originally 484 // interpreted but its pc is in the code cache (for c1 -> osr_frame_return_id stub), so it must be 485 // explicitly recognized. 486 487 488 bool frame_is_interpreted = is_interpreted_frame(); 489 if (frame_is_interpreted) { 490 map->make_integer_regs_unsaved(); 491 map->shift_window(sp, younger_sp); 492 } else if (_cb != NULL) { 493 // Update the locations of implicitly saved registers to be their 494 // addresses in the register save area. 495 // For %o registers, the addresses of %i registers in the next younger 496 // frame are used. 497 map->shift_window(sp, younger_sp); 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 } 508 return frame(sp, younger_sp, frame_is_interpreted); 509 } 510 511 512 void frame::patch_pc(Thread* thread, address pc) { 513 vmassert(_deopt_state != unknown, "frame is unpatchable"); 514 if(thread == Thread::current()) { 515 StubRoutines::Sparc::flush_callers_register_windows_func()(); 516 } 517 if (TracePcPatching) { 518 // QQQ this assert is invalid (or too strong anyway) sice _pc could 519 // be original pc and frame could have the deopt pc. 520 // assert(_pc == *O7_addr() + pc_return_offset, "frame has wrong pc"); 521 tty->print_cr("patch_pc at address " INTPTR_FORMAT " [" INTPTR_FORMAT " -> " INTPTR_FORMAT "]", 522 p2i(O7_addr()), p2i(_pc), p2i(pc)); 523 } 524 _cb = CodeCache::find_blob(pc); 525 *O7_addr() = pc - pc_return_offset; 526 _cb = CodeCache::find_blob(_pc); 527 address original_pc = CompiledMethod::get_deopt_original_pc(this); 528 if (original_pc != NULL) { 529 assert(original_pc == _pc, "expected original to be stored before patching"); 530 _deopt_state = is_deoptimized; 531 } else { 532 _deopt_state = not_deoptimized; 533 } 534 } 535 536 537 static bool sp_is_valid(intptr_t* old_sp, intptr_t* young_sp, intptr_t* sp) { 538 return (((intptr_t)sp & (2*wordSize-1)) == 0 && 539 sp <= old_sp && 540 sp >= young_sp); 541 } 542 543 544 /* 545 Find the (biased) sp that is just younger than old_sp starting at sp. 546 If not found return NULL. Register windows are assumed to be flushed. 547 */ 548 intptr_t* frame::next_younger_sp_or_null(intptr_t* old_sp, intptr_t* sp) { 549 550 intptr_t* previous_sp = NULL; 551 intptr_t* orig_sp = sp; 552 553 int max_frames = (old_sp - sp) / 16; // Minimum frame size is 16 554 int max_frame2 = max_frames; 555 while(sp != old_sp && sp_is_valid(old_sp, orig_sp, sp)) { 556 if (max_frames-- <= 0) 557 // too many frames have gone by; invalid parameters given to this function 558 break; 559 previous_sp = sp; 560 sp = (intptr_t*)sp[FP->sp_offset_in_saved_window()]; 561 sp = (intptr_t*)((intptr_t)sp + STACK_BIAS); 562 } 563 564 return (sp == old_sp ? previous_sp : NULL); 565 } 566 567 /* 568 Determine if "sp" is a valid stack pointer. "sp" is assumed to be younger than 569 "valid_sp". So if "sp" is valid itself then it should be possible to walk frames 570 from "sp" to "valid_sp". The assumption is that the registers windows for the 571 thread stack in question are flushed. 572 */ 573 bool frame::is_valid_stack_pointer(intptr_t* valid_sp, intptr_t* sp) { 574 return next_younger_sp_or_null(valid_sp, sp) != NULL; 575 } 576 577 bool frame::is_interpreted_frame_valid(JavaThread* thread) const { 578 assert(is_interpreted_frame(), "Not an interpreted frame"); 579 // These are reasonable sanity checks 580 if (fp() == 0 || (intptr_t(fp()) & (2*wordSize-1)) != 0) { 581 return false; 582 } 583 if (sp() == 0 || (intptr_t(sp()) & (2*wordSize-1)) != 0) { 584 return false; 585 } 586 587 const intptr_t interpreter_frame_initial_sp_offset = interpreter_frame_vm_local_words; 588 if (fp() + interpreter_frame_initial_sp_offset < sp()) { 589 return false; 590 } 591 // These are hacks to keep us out of trouble. 592 // The problem with these is that they mask other problems 593 if (fp() <= sp()) { // this attempts to deal with unsigned comparison above 594 return false; 595 } 596 // do some validation of frame elements 597 598 // first the method 599 600 Method* m = *interpreter_frame_method_addr(); 601 602 // validate the method we'd find in this potential sender 603 if (!m->is_valid_method()) return false; 604 605 // stack frames shouldn't be much larger than max_stack elements 606 607 if (fp() - unextended_sp() > 1024 + m->max_stack()*Interpreter::stackElementSize) { 608 return false; 609 } 610 611 // validate bci/bcp 612 613 address bcp = interpreter_frame_bcp(); 614 if (m->validate_bci_from_bcp(bcp) < 0) { 615 return false; 616 } 617 618 // validate ConstantPoolCache* 619 ConstantPoolCache* cp = *interpreter_frame_cache_addr(); 620 if (cp == NULL || !cp->is_metaspace_object()) return false; 621 622 // validate locals 623 624 address locals = (address) *interpreter_frame_locals_addr(); 625 626 if (locals > thread->stack_base() || locals < (address) fp()) return false; 627 628 // We'd have to be pretty unlucky to be mislead at this point 629 return true; 630 } 631 632 633 // Windows have been flushed on entry (but not marked). Capture the pc that 634 // is the return address to the frame that contains "sp" as its stack pointer. 635 // This pc resides in the called of the frame corresponding to "sp". 636 // As a side effect we mark this JavaFrameAnchor as having flushed the windows. 637 // This side effect lets us mark stacked JavaFrameAnchors (stacked in the 638 // call_helper) as flushed when we have flushed the windows for the most 639 // recent (i.e. current) JavaFrameAnchor. This saves useless flushing calls 640 // and lets us find the pc just once rather than multiple times as it did 641 // in the bad old _post_Java_state days. 642 // 643 void JavaFrameAnchor::capture_last_Java_pc(intptr_t* sp) { 644 if (last_Java_sp() != NULL && last_Java_pc() == NULL) { 645 // try and find the sp just younger than _last_Java_sp 646 intptr_t* _post_Java_sp = frame::next_younger_sp_or_null(last_Java_sp(), sp); 647 // Really this should never fail otherwise VM call must have non-standard 648 // frame linkage (bad) or stack is not properly flushed (worse). 649 guarantee(_post_Java_sp != NULL, "bad stack!"); 650 _last_Java_pc = (address) _post_Java_sp[ I7->sp_offset_in_saved_window()] + frame::pc_return_offset; 651 652 } 653 set_window_flushed(); 654 } 655 656 void JavaFrameAnchor::make_walkable(JavaThread* thread) { 657 if (walkable()) return; 658 // Eventually make an assert 659 guarantee(Thread::current() == (Thread*)thread, "only current thread can flush its registers"); 660 // We always flush in case the profiler wants it but we won't mark 661 // the windows as flushed unless we have a last_Java_frame 662 intptr_t* sp = StubRoutines::Sparc::flush_callers_register_windows_func()(); 663 if (last_Java_sp() != NULL ) { 664 capture_last_Java_pc(sp); 665 } 666 } 667 668 intptr_t* frame::entry_frame_argument_at(int offset) const { 669 // convert offset to index to deal with tsi 670 int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize); 671 672 intptr_t* LSP = (intptr_t*) sp()[Lentry_args->sp_offset_in_saved_window()]; 673 return &LSP[index+1]; 674 } 675 676 677 BasicType frame::interpreter_frame_result(oop* oop_result, jvalue* value_result) { 678 assert(is_interpreted_frame(), "interpreted frame expected"); 679 Method* method = interpreter_frame_method(); 680 BasicType type = method->result_type(); 681 682 if (method->is_native()) { 683 // Prior to notifying the runtime of the method_exit the possible result 684 // value is saved to l_scratch and d_scratch. 685 686 intptr_t* l_scratch = fp() + interpreter_frame_l_scratch_fp_offset; 687 intptr_t* d_scratch = fp() + interpreter_frame_d_scratch_fp_offset; 688 689 address l_addr = (address)l_scratch; 690 // On 64-bit the result for 1/8/16/32-bit result types is in the other 691 // word half 692 l_addr += wordSize/2; 693 694 switch (type) { 695 case T_OBJECT: 696 case T_ARRAY: { 697 oop obj = cast_to_oop(at(interpreter_frame_oop_temp_offset)); 698 assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check"); 699 *oop_result = obj; 700 break; 701 } 702 703 case T_BOOLEAN : { jint* p = (jint*)l_addr; value_result->z = (jboolean)((*p) & 0x1); break; } 704 case T_BYTE : { jint* p = (jint*)l_addr; value_result->b = (jbyte)((*p) & 0xff); break; } 705 case T_CHAR : { jint* p = (jint*)l_addr; value_result->c = (jchar)((*p) & 0xffff); break; } 706 case T_SHORT : { jint* p = (jint*)l_addr; value_result->s = (jshort)((*p) & 0xffff); break; } 707 case T_INT : value_result->i = *(jint*)l_addr; break; 708 case T_LONG : value_result->j = *(jlong*)l_scratch; break; 709 case T_FLOAT : value_result->f = *(jfloat*)d_scratch; break; 710 case T_DOUBLE : value_result->d = *(jdouble*)d_scratch; break; 711 case T_VOID : /* Nothing to do */ break; 712 default : ShouldNotReachHere(); 713 } 714 } else { 715 intptr_t* tos_addr = interpreter_frame_tos_address(); 716 717 switch(type) { 718 case T_OBJECT: 719 case T_ARRAY: { 720 oop obj = cast_to_oop(*tos_addr); 721 assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check"); 722 *oop_result = obj; 723 break; 724 } 725 case T_BOOLEAN : { jint* p = (jint*)tos_addr; value_result->z = (jboolean)((*p) & 0x1); break; } 726 case T_BYTE : { jint* p = (jint*)tos_addr; value_result->b = (jbyte)((*p) & 0xff); break; } 727 case T_CHAR : { jint* p = (jint*)tos_addr; value_result->c = (jchar)((*p) & 0xffff); break; } 728 case T_SHORT : { jint* p = (jint*)tos_addr; value_result->s = (jshort)((*p) & 0xffff); break; } 729 case T_INT : value_result->i = *(jint*)tos_addr; break; 730 case T_LONG : value_result->j = *(jlong*)tos_addr; break; 731 case T_FLOAT : value_result->f = *(jfloat*)tos_addr; break; 732 case T_DOUBLE : value_result->d = *(jdouble*)tos_addr; break; 733 case T_VOID : /* Nothing to do */ break; 734 default : ShouldNotReachHere(); 735 } 736 }; 737 738 return type; 739 } 740 741 // Lesp pointer is one word lower than the top item on the stack. 742 intptr_t* frame::interpreter_frame_tos_at(jint offset) const { 743 int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize) - 1; 744 return &interpreter_frame_tos_address()[index]; 745 } 746 747 748 #ifndef PRODUCT 749 750 #define DESCRIBE_FP_OFFSET(name) \ 751 values.describe(frame_no, fp() + frame::name##_offset, #name) 752 753 void frame::describe_pd(FrameValues& values, int frame_no) { 754 for (int w = 0; w < frame::register_save_words; w++) { 755 values.describe(frame_no, sp() + w, err_msg("register save area word %d", w), 1); 756 } 757 758 if (is_interpreted_frame()) { 759 DESCRIBE_FP_OFFSET(interpreter_frame_d_scratch_fp); 760 DESCRIBE_FP_OFFSET(interpreter_frame_l_scratch_fp); 761 DESCRIBE_FP_OFFSET(interpreter_frame_mirror); 762 DESCRIBE_FP_OFFSET(interpreter_frame_oop_temp); 763 764 // esp, according to Lesp (e.g. not depending on bci), if seems valid 765 intptr_t* esp = *interpreter_frame_esp_addr(); 766 if ((esp >= sp()) && (esp < fp())) { 767 values.describe(-1, esp, "*Lesp"); 768 } 769 } 770 771 if (!is_compiled_frame()) { 772 if (frame::callee_aggregate_return_pointer_words != 0) { 773 values.describe(frame_no, sp() + frame::callee_aggregate_return_pointer_sp_offset, "callee_aggregate_return_pointer_word"); 774 } 775 for (int w = 0; w < frame::callee_register_argument_save_area_words; w++) { 776 values.describe(frame_no, sp() + frame::callee_register_argument_save_area_sp_offset + w, 777 err_msg("callee_register_argument_save_area_words %d", w)); 778 } 779 } 780 } 781 782 #endif 783 784 intptr_t *frame::initial_deoptimization_info() { 785 // unused... but returns fp() to minimize changes introduced by 7087445 786 return fp(); 787 }