duke@435: /* drchase@4942: * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #include "precompiled.hpp" stefank@2314: #include "interpreter/interpreter.hpp" stefank@2314: #include "memory/resourceArea.hpp" stefank@2314: #include "oops/markOop.hpp" coleenp@4037: #include "oops/method.hpp" stefank@2314: #include "oops/oop.inline.hpp" iveresov@3495: #include "prims/methodHandles.hpp" stefank@2314: #include "runtime/frame.inline.hpp" stefank@2314: #include "runtime/handles.inline.hpp" stefank@2314: #include "runtime/javaCalls.hpp" stefank@2314: #include "runtime/monitorChunk.hpp" stefank@2314: #include "runtime/signature.hpp" stefank@2314: #include "runtime/stubCodeGenerator.hpp" stefank@2314: #include "runtime/stubRoutines.hpp" stefank@2314: #include "vmreg_sparc.inline.hpp" stefank@2314: #ifdef COMPILER1 stefank@2314: #include "c1/c1_Runtime1.hpp" stefank@2314: #include "runtime/vframeArray.hpp" stefank@2314: #endif duke@435: duke@435: void RegisterMap::pd_clear() { duke@435: if (_thread->has_last_Java_frame()) { duke@435: frame fr = _thread->last_frame(); duke@435: _window = fr.sp(); duke@435: } else { duke@435: _window = NULL; duke@435: } duke@435: _younger_window = NULL; duke@435: } duke@435: duke@435: duke@435: // Unified register numbering scheme: each 32-bits counts as a register duke@435: // number, so all the V9 registers take 2 slots. duke@435: const static int R_L_nums[] = {0+040,2+040,4+040,6+040,8+040,10+040,12+040,14+040}; duke@435: const static int R_I_nums[] = {0+060,2+060,4+060,6+060,8+060,10+060,12+060,14+060}; duke@435: const static int R_O_nums[] = {0+020,2+020,4+020,6+020,8+020,10+020,12+020,14+020}; duke@435: const static int R_G_nums[] = {0+000,2+000,4+000,6+000,8+000,10+000,12+000,14+000}; duke@435: static RegisterMap::LocationValidType bad_mask = 0; duke@435: static RegisterMap::LocationValidType R_LIO_mask = 0; duke@435: static bool register_map_inited = false; duke@435: duke@435: static void register_map_init() { duke@435: if (!register_map_inited) { duke@435: register_map_inited = true; duke@435: int i; duke@435: for (i = 0; i < 8; i++) { duke@435: assert(R_L_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); duke@435: assert(R_I_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); duke@435: assert(R_O_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); duke@435: assert(R_G_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); duke@435: } duke@435: duke@435: bad_mask |= (1LL << R_O_nums[6]); // SP duke@435: bad_mask |= (1LL << R_O_nums[7]); // cPC duke@435: bad_mask |= (1LL << R_I_nums[6]); // FP duke@435: bad_mask |= (1LL << R_I_nums[7]); // rPC duke@435: bad_mask |= (1LL << R_G_nums[2]); // TLS duke@435: bad_mask |= (1LL << R_G_nums[7]); // reserved by libthread duke@435: duke@435: for (i = 0; i < 8; i++) { duke@435: R_LIO_mask |= (1LL << R_L_nums[i]); duke@435: R_LIO_mask |= (1LL << R_I_nums[i]); duke@435: R_LIO_mask |= (1LL << R_O_nums[i]); duke@435: } duke@435: } duke@435: } duke@435: duke@435: duke@435: address RegisterMap::pd_location(VMReg regname) const { duke@435: register_map_init(); duke@435: duke@435: assert(regname->is_reg(), "sanity check"); duke@435: // Only the GPRs get handled this way duke@435: if( !regname->is_Register()) duke@435: return NULL; duke@435: duke@435: // don't talk about bad registers duke@435: if ((bad_mask & ((LocationValidType)1 << regname->value())) != 0) { duke@435: return NULL; duke@435: } duke@435: duke@435: // Convert to a GPR duke@435: Register reg; duke@435: int second_word = 0; duke@435: // 32-bit registers for in, out and local duke@435: if (!regname->is_concrete()) { duke@435: // HMM ought to return NULL for any non-concrete (odd) vmreg duke@435: // this all tied up in the fact we put out double oopMaps for duke@435: // register locations. When that is fixed we'd will return NULL duke@435: // (or assert here). duke@435: reg = regname->prev()->as_Register(); duke@435: #ifdef _LP64 duke@435: second_word = sizeof(jint); duke@435: #else duke@435: return NULL; duke@435: #endif // _LP64 duke@435: } else { duke@435: reg = regname->as_Register(); duke@435: } duke@435: if (reg->is_out()) { duke@435: assert(_younger_window != NULL, "Younger window should be available"); duke@435: return second_word + (address)&_younger_window[reg->after_save()->sp_offset_in_saved_window()]; duke@435: } duke@435: if (reg->is_local() || reg->is_in()) { duke@435: assert(_window != NULL, "Window should be available"); duke@435: return second_word + (address)&_window[reg->sp_offset_in_saved_window()]; duke@435: } duke@435: // Only the window'd GPRs get handled this way; not the globals. duke@435: return NULL; duke@435: } duke@435: duke@435: duke@435: #ifdef ASSERT duke@435: void RegisterMap::check_location_valid() { duke@435: register_map_init(); duke@435: assert((_location_valid[0] & bad_mask) == 0, "cannot have special locations for SP,FP,TLS,etc."); duke@435: } duke@435: #endif duke@435: duke@435: // We are shifting windows. That means we are moving all %i to %o, duke@435: // getting rid of all current %l, and keeping all %g. This is only duke@435: // complicated if any of the location pointers for these are valid. duke@435: // The normal case is that everything is in its standard register window duke@435: // home, and _location_valid[0] is zero. In that case, this routine duke@435: // does exactly nothing. duke@435: void RegisterMap::shift_individual_registers() { duke@435: if (!update_map()) return; // this only applies to maps with locations duke@435: register_map_init(); duke@435: check_location_valid(); duke@435: duke@435: LocationValidType lv = _location_valid[0]; duke@435: LocationValidType lv0 = lv; duke@435: duke@435: lv &= ~R_LIO_mask; // clear %l, %o, %i regs duke@435: duke@435: // if we cleared some non-%g locations, we may have to do some shifting duke@435: if (lv != lv0) { duke@435: // copy %i0-%i5 to %o0-%o5, if they have special locations duke@435: // This can happen in within stubs which spill argument registers duke@435: // around a dynamic link operation, such as resolve_opt_virtual_call. duke@435: for (int i = 0; i < 8; i++) { duke@435: if (lv0 & (1LL << R_I_nums[i])) { duke@435: _location[R_O_nums[i]] = _location[R_I_nums[i]]; duke@435: lv |= (1LL << R_O_nums[i]); duke@435: } duke@435: } duke@435: } duke@435: duke@435: _location_valid[0] = lv; duke@435: check_location_valid(); duke@435: } duke@435: sgoldman@542: bool frame::safe_for_sender(JavaThread *thread) { duke@435: sgoldman@542: address _SP = (address) sp(); sgoldman@542: address _FP = (address) fp(); sgoldman@542: address _UNEXTENDED_SP = (address) unextended_sp(); sgoldman@542: // sp must be within the stack sgoldman@542: bool sp_safe = (_SP <= thread->stack_base()) && sgoldman@542: (_SP >= thread->stack_base() - thread->stack_size()); sgoldman@542: sgoldman@542: if (!sp_safe) { sgoldman@542: return false; sgoldman@542: } sgoldman@542: sgoldman@542: // unextended sp must be within the stack and above or equal sp sgoldman@542: bool unextended_sp_safe = (_UNEXTENDED_SP <= thread->stack_base()) && sgoldman@542: (_UNEXTENDED_SP >= _SP); sgoldman@542: sgoldman@542: if (!unextended_sp_safe) return false; sgoldman@542: sgoldman@542: // an fp must be within the stack and above (but not equal) sp sgoldman@542: bool fp_safe = (_FP <= thread->stack_base()) && sgoldman@542: (_FP > _SP); sgoldman@542: sgoldman@542: // We know sp/unextended_sp are safe only fp is questionable here sgoldman@542: sgoldman@542: // If the current frame is known to the code cache then we can attempt to sgoldman@542: // to construct the sender and do some validation of it. This goes a long way sgoldman@542: // toward eliminating issues when we get in frame construction code sgoldman@542: sgoldman@542: if (_cb != NULL ) { sgoldman@542: sgoldman@542: // First check if frame is complete and tester is reliable sgoldman@542: // Unfortunately we can only check frame complete for runtime stubs and nmethod sgoldman@542: // other generic buffer blobs are more problematic so we just assume they are sgoldman@542: // ok. adapter blobs never have a frame complete and are never ok. sgoldman@542: sgoldman@542: if (!_cb->is_frame_complete_at(_pc)) { sgoldman@542: if (_cb->is_nmethod() || _cb->is_adapter_blob() || _cb->is_runtime_stub()) { sgoldman@542: return false; duke@435: } sgoldman@542: } sgoldman@542: rbackman@4645: // Could just be some random pointer within the codeBlob rbackman@4645: if (!_cb->code_contains(_pc)) { rbackman@4645: return false; rbackman@4645: } rbackman@4645: sgoldman@542: // Entry frame checks sgoldman@542: if (is_entry_frame()) { sgoldman@542: // an entry frame must have a valid fp. sgoldman@542: sgoldman@542: if (!fp_safe) { sgoldman@542: return false; sgoldman@542: } sgoldman@542: sgoldman@542: // Validate the JavaCallWrapper an entry frame must have sgoldman@542: sgoldman@542: address jcw = (address)entry_frame_call_wrapper(); sgoldman@542: sgoldman@542: bool jcw_safe = (jcw <= thread->stack_base()) && ( jcw > _FP); sgoldman@542: sgoldman@542: return jcw_safe; sgoldman@542: sgoldman@542: } sgoldman@542: sgoldman@542: intptr_t* younger_sp = sp(); sgoldman@542: intptr_t* _SENDER_SP = sender_sp(); // sender is actually just _FP sgoldman@542: bool adjusted_stack = is_interpreted_frame(); sgoldman@542: sgoldman@542: address sender_pc = (address)younger_sp[I7->sp_offset_in_saved_window()] + pc_return_offset; sgoldman@542: sgoldman@542: sgoldman@542: // We must always be able to find a recognizable pc sgoldman@542: CodeBlob* sender_blob = CodeCache::find_blob_unsafe(sender_pc); sgoldman@542: if (sender_pc == NULL || sender_blob == NULL) { sgoldman@542: return false; sgoldman@542: } sgoldman@542: sla@5237: // Could be a zombie method sla@5237: if (sender_blob->is_zombie() || sender_blob->is_unloaded()) { sla@5237: return false; sla@5237: } sla@5237: sgoldman@542: // It should be safe to construct the sender though it might not be valid sgoldman@542: sgoldman@542: frame sender(_SENDER_SP, younger_sp, adjusted_stack); sgoldman@542: sgoldman@542: // Do we have a valid fp? sgoldman@542: address sender_fp = (address) sender.fp(); sgoldman@542: sgoldman@542: // an fp must be within the stack and above (but not equal) current frame's _FP sgoldman@542: sgoldman@542: bool sender_fp_safe = (sender_fp <= thread->stack_base()) && sgoldman@542: (sender_fp > _FP); sgoldman@542: sgoldman@542: if (!sender_fp_safe) { sgoldman@542: return false; sgoldman@542: } sgoldman@542: sgoldman@542: sgoldman@542: // If the potential sender is the interpreter then we can do some more checking sgoldman@542: if (Interpreter::contains(sender_pc)) { sgoldman@542: return sender.is_interpreted_frame_valid(thread); sgoldman@542: } sgoldman@542: sgoldman@542: // Could just be some random pointer within the codeBlob twisti@2103: if (!sender.cb()->code_contains(sender_pc)) { twisti@2103: return false; twisti@2103: } sgoldman@542: sgoldman@542: // We should never be able to see an adapter if the current frame is something from code cache twisti@2103: if (sender_blob->is_adapter_blob()) { sgoldman@542: return false; sgoldman@542: } sgoldman@542: sgoldman@542: if( sender.is_entry_frame()) { sgoldman@542: // Validate the JavaCallWrapper an entry frame must have sgoldman@542: sgoldman@542: address jcw = (address)sender.entry_frame_call_wrapper(); sgoldman@542: sgoldman@542: bool jcw_safe = (jcw <= thread->stack_base()) && ( jcw > sender_fp); sgoldman@542: sgoldman@542: return jcw_safe; sgoldman@542: } sgoldman@542: sla@5237: // If the frame size is 0 something (or less) is bad because every nmethod has a non-zero frame size sgoldman@542: // because you must allocate window space sgoldman@542: sla@5237: if (sender_blob->frame_size() <= 0) { sgoldman@542: assert(!sender_blob->is_nmethod(), "should count return address at least"); sgoldman@542: return false; sgoldman@542: } sgoldman@542: sgoldman@542: // The sender should positively be an nmethod or call_stub. On sparc we might in fact see something else. sgoldman@542: // The cause of this is because at a save instruction the O7 we get is a leftover from an earlier drchase@4942: // window use. So if a runtime stub creates two frames (common in fastdebug/debug) then we see the sgoldman@542: // stale pc. So if the sender blob is not something we'd expect we have little choice but to declare sgoldman@542: // the stack unwalkable. pd_get_top_frame_for_signal_handler tries to recover from this by unwinding sgoldman@542: // that initial frame and retrying. sgoldman@542: sgoldman@542: if (!sender_blob->is_nmethod()) { sgoldman@542: return false; sgoldman@542: } sgoldman@542: sgoldman@542: // Could put some more validation for the potential non-interpreted sender sgoldman@542: // frame we'd create by calling sender if I could think of any. Wait for next crash in forte... sgoldman@542: sgoldman@542: // One idea is seeing if the sender_pc we have is one that we'd expect to call to current cb sgoldman@542: sgoldman@542: // We've validated the potential sender that would be created sgoldman@542: sgoldman@542: return true; sgoldman@542: duke@435: } sgoldman@542: sgoldman@542: // Must be native-compiled frame. Since sender will try and use fp to find sgoldman@542: // linkages it must be safe sgoldman@542: sgoldman@542: if (!fp_safe) return false; sgoldman@542: sgoldman@542: // could try and do some more potential verification of native frame if we could think of some... sgoldman@542: sgoldman@542: return true; duke@435: } duke@435: duke@435: // constructors duke@435: duke@435: // Construct an unpatchable, deficient frame duke@435: frame::frame(intptr_t* sp, unpatchable_t, address pc, CodeBlob* cb) { duke@435: #ifdef _LP64 duke@435: assert( (((intptr_t)sp & (wordSize-1)) == 0), "frame constructor passed an invalid sp"); duke@435: #endif duke@435: _sp = sp; duke@435: _younger_sp = NULL; duke@435: _pc = pc; duke@435: _cb = cb; duke@435: _sp_adjustment_by_callee = 0; duke@435: assert(pc == NULL && cb == NULL || pc != NULL, "can't have a cb and no pc!"); duke@435: if (_cb == NULL && _pc != NULL ) { duke@435: _cb = CodeCache::find_blob(_pc); duke@435: } duke@435: _deopt_state = unknown; duke@435: #ifdef ASSERT duke@435: if ( _cb != NULL && _cb->is_nmethod()) { duke@435: // Without a valid unextended_sp() we can't convert the pc to "original" duke@435: assert(!((nmethod*)_cb)->is_deopt_pc(_pc), "invariant broken"); duke@435: } duke@435: #endif // ASSERT duke@435: } duke@435: twisti@1919: frame::frame(intptr_t* sp, intptr_t* younger_sp, bool younger_frame_is_interpreted) : twisti@1919: _sp(sp), twisti@1919: _younger_sp(younger_sp), twisti@1919: _deopt_state(unknown), twisti@1919: _sp_adjustment_by_callee(0) { duke@435: if (younger_sp == NULL) { duke@435: // make a deficient frame which doesn't know where its PC is duke@435: _pc = NULL; duke@435: _cb = NULL; duke@435: } else { duke@435: _pc = (address)younger_sp[I7->sp_offset_in_saved_window()] + pc_return_offset; duke@435: assert( (intptr_t*)younger_sp[FP->sp_offset_in_saved_window()] == (intptr_t*)((intptr_t)sp - STACK_BIAS), "younger_sp must be valid"); duke@435: // Any frame we ever build should always "safe" therefore we should not have to call duke@435: // find_blob_unsafe duke@435: // In case of native stubs, the pc retrieved here might be duke@435: // wrong. (the _last_native_pc will have the right value) duke@435: // So do not put add any asserts on the _pc here. duke@435: } twisti@1919: twisti@1919: if (_pc != NULL) twisti@1919: _cb = CodeCache::find_blob(_pc); twisti@1919: twisti@1919: // Check for MethodHandle call sites. twisti@1919: if (_cb != NULL) { twisti@1919: nmethod* nm = _cb->as_nmethod_or_null(); twisti@1919: if (nm != NULL) { twisti@1919: if (nm->is_deopt_mh_entry(_pc) || nm->is_method_handle_return(_pc)) { twisti@1919: _sp_adjustment_by_callee = (intptr_t*) ((intptr_t) sp[L7_mh_SP_save->sp_offset_in_saved_window()] + STACK_BIAS) - sp; twisti@1919: // The SP is already adjusted by this MH call site, don't twisti@1919: // overwrite this value with the wrong interpreter value. twisti@1919: younger_frame_is_interpreted = false; twisti@1919: } twisti@1919: } duke@435: } duke@435: twisti@1919: if (younger_frame_is_interpreted) { twisti@1919: // compute adjustment to this frame's SP made by its interpreted callee twisti@1919: _sp_adjustment_by_callee = (intptr_t*) ((intptr_t) younger_sp[I5_savedSP->sp_offset_in_saved_window()] + STACK_BIAS) - sp; twisti@1919: } duke@435: twisti@1919: // It is important that the frame is fully constructed when we do twisti@1919: // this lookup as get_deopt_original_pc() needs a correct value for twisti@1919: // unextended_sp() which uses _sp_adjustment_by_callee. duke@435: if (_pc != NULL) { twisti@1639: address original_pc = nmethod::get_deopt_original_pc(this); twisti@1639: if (original_pc != NULL) { twisti@1639: _pc = original_pc; duke@435: _deopt_state = is_deoptimized; duke@435: } else { duke@435: _deopt_state = not_deoptimized; duke@435: } duke@435: } duke@435: } duke@435: duke@435: bool frame::is_interpreted_frame() const { duke@435: return Interpreter::contains(pc()); duke@435: } duke@435: duke@435: // sender_sp duke@435: duke@435: intptr_t* frame::interpreter_frame_sender_sp() const { duke@435: assert(is_interpreted_frame(), "interpreted frame expected"); duke@435: return fp(); duke@435: } duke@435: duke@435: #ifndef CC_INTERP duke@435: void frame::set_interpreter_frame_sender_sp(intptr_t* sender_sp) { duke@435: assert(is_interpreted_frame(), "interpreted frame expected"); duke@435: Unimplemented(); duke@435: } duke@435: #endif // CC_INTERP duke@435: duke@435: duke@435: #ifdef ASSERT duke@435: // Debugging aid duke@435: static frame nth_sender(int n) { duke@435: frame f = JavaThread::current()->last_frame(); duke@435: duke@435: for(int i = 0; i < n; ++i) duke@435: f = f.sender((RegisterMap*)NULL); duke@435: duke@435: printf("first frame %d\n", f.is_first_frame() ? 1 : 0); duke@435: printf("interpreted frame %d\n", f.is_interpreted_frame() ? 1 : 0); duke@435: printf("java frame %d\n", f.is_java_frame() ? 1 : 0); duke@435: printf("entry frame %d\n", f.is_entry_frame() ? 1 : 0); duke@435: printf("native frame %d\n", f.is_native_frame() ? 1 : 0); duke@435: if (f.is_compiled_frame()) { duke@435: if (f.is_deoptimized_frame()) duke@435: printf("deoptimized frame 1\n"); duke@435: else duke@435: printf("compiled frame 1\n"); duke@435: } duke@435: duke@435: return f; duke@435: } duke@435: #endif duke@435: duke@435: duke@435: frame frame::sender_for_entry_frame(RegisterMap *map) const { duke@435: assert(map != NULL, "map must be set"); duke@435: // Java frame called from C; skip all C frames and return top C duke@435: // frame of that chunk as the sender duke@435: JavaFrameAnchor* jfa = entry_frame_call_wrapper()->anchor(); duke@435: assert(!entry_frame_is_first(), "next Java fp must be non zero"); duke@435: assert(jfa->last_Java_sp() > _sp, "must be above this frame on stack"); duke@435: intptr_t* last_Java_sp = jfa->last_Java_sp(); duke@435: // Since we are walking the stack now this nested anchor is obviously walkable duke@435: // even if it wasn't when it was stacked. duke@435: if (!jfa->walkable()) { duke@435: // Capture _last_Java_pc (if needed) and mark anchor walkable. duke@435: jfa->capture_last_Java_pc(_sp); duke@435: } duke@435: assert(jfa->last_Java_pc() != NULL, "No captured pc!"); duke@435: map->clear(); duke@435: map->make_integer_regs_unsaved(); duke@435: map->shift_window(last_Java_sp, NULL); duke@435: assert(map->include_argument_oops(), "should be set by clear"); duke@435: return frame(last_Java_sp, frame::unpatchable, jfa->last_Java_pc()); duke@435: } duke@435: duke@435: frame frame::sender_for_interpreter_frame(RegisterMap *map) const { duke@435: ShouldNotCallThis(); duke@435: return sender(map); duke@435: } duke@435: duke@435: frame frame::sender_for_compiled_frame(RegisterMap *map) const { duke@435: ShouldNotCallThis(); duke@435: return sender(map); duke@435: } duke@435: duke@435: frame frame::sender(RegisterMap* map) const { duke@435: assert(map != NULL, "map must be set"); duke@435: duke@435: assert(CodeCache::find_blob_unsafe(_pc) == _cb, "inconsistent"); duke@435: duke@435: // Default is not to follow arguments; update it accordingly below duke@435: map->set_include_argument_oops(false); duke@435: duke@435: if (is_entry_frame()) return sender_for_entry_frame(map); duke@435: twisti@1919: intptr_t* younger_sp = sp(); twisti@1919: intptr_t* sp = sender_sp(); duke@435: duke@435: // Note: The version of this operation on any platform with callee-save duke@435: // registers must update the register map (if not null). duke@435: // In order to do this correctly, the various subtypes of duke@435: // of frame (interpreted, compiled, glue, native), duke@435: // must be distinguished. There is no need on SPARC for duke@435: // such distinctions, because all callee-save registers are duke@435: // preserved for all frames via SPARC-specific mechanisms. duke@435: // duke@435: // *** HOWEVER, *** if and when we make any floating-point duke@435: // registers callee-saved, then we will have to copy over duke@435: // the RegisterMap update logic from the Intel code. duke@435: duke@435: // The constructor of the sender must know whether this frame is interpreted so it can set the duke@435: // sender's _sp_adjustment_by_callee field. An osr adapter frame was originally duke@435: // interpreted but its pc is in the code cache (for c1 -> osr_frame_return_id stub), so it must be duke@435: // explicitly recognized. duke@435: never@2950: twisti@1919: bool frame_is_interpreted = is_interpreted_frame(); twisti@1919: if (frame_is_interpreted) { duke@435: map->make_integer_regs_unsaved(); duke@435: map->shift_window(sp, younger_sp); duke@435: } else if (_cb != NULL) { duke@435: // Update the locations of implicitly saved registers to be their duke@435: // addresses in the register save area. duke@435: // For %o registers, the addresses of %i registers in the next younger duke@435: // frame are used. duke@435: map->shift_window(sp, younger_sp); duke@435: if (map->update_map()) { duke@435: // Tell GC to use argument oopmaps for some runtime stubs that need it. duke@435: // For C1, the runtime stub might not have oop maps, so set this flag duke@435: // outside of update_register_map. duke@435: map->set_include_argument_oops(_cb->caller_must_gc_arguments(map->thread())); duke@435: if (_cb->oop_maps() != NULL) { duke@435: OopMapSet::update_register_map(this, map); duke@435: } duke@435: } duke@435: } twisti@1919: return frame(sp, younger_sp, frame_is_interpreted); duke@435: } duke@435: duke@435: duke@435: void frame::patch_pc(Thread* thread, address pc) { duke@435: if(thread == Thread::current()) { duke@435: StubRoutines::Sparc::flush_callers_register_windows_func()(); duke@435: } duke@435: if (TracePcPatching) { duke@435: // QQQ this assert is invalid (or too strong anyway) sice _pc could duke@435: // be original pc and frame could have the deopt pc. duke@435: // assert(_pc == *O7_addr() + pc_return_offset, "frame has wrong pc"); duke@435: tty->print_cr("patch_pc at address 0x%x [0x%x -> 0x%x] ", O7_addr(), _pc, pc); duke@435: } duke@435: _cb = CodeCache::find_blob(pc); duke@435: *O7_addr() = pc - pc_return_offset; duke@435: _cb = CodeCache::find_blob(_pc); twisti@1639: address original_pc = nmethod::get_deopt_original_pc(this); twisti@1639: if (original_pc != NULL) { twisti@1639: assert(original_pc == _pc, "expected original to be stored before patching"); duke@435: _deopt_state = is_deoptimized; duke@435: } else { duke@435: _deopt_state = not_deoptimized; duke@435: } duke@435: } duke@435: duke@435: duke@435: static bool sp_is_valid(intptr_t* old_sp, intptr_t* young_sp, intptr_t* sp) { duke@435: return (((intptr_t)sp & (2*wordSize-1)) == 0 && duke@435: sp <= old_sp && duke@435: sp >= young_sp); duke@435: } duke@435: duke@435: duke@435: /* duke@435: Find the (biased) sp that is just younger than old_sp starting at sp. duke@435: If not found return NULL. Register windows are assumed to be flushed. duke@435: */ duke@435: intptr_t* frame::next_younger_sp_or_null(intptr_t* old_sp, intptr_t* sp) { duke@435: duke@435: intptr_t* previous_sp = NULL; duke@435: intptr_t* orig_sp = sp; duke@435: duke@435: int max_frames = (old_sp - sp) / 16; // Minimum frame size is 16 duke@435: int max_frame2 = max_frames; duke@435: while(sp != old_sp && sp_is_valid(old_sp, orig_sp, sp)) { duke@435: if (max_frames-- <= 0) duke@435: // too many frames have gone by; invalid parameters given to this function duke@435: break; duke@435: previous_sp = sp; duke@435: sp = (intptr_t*)sp[FP->sp_offset_in_saved_window()]; duke@435: sp = (intptr_t*)((intptr_t)sp + STACK_BIAS); duke@435: } duke@435: duke@435: return (sp == old_sp ? previous_sp : NULL); duke@435: } duke@435: duke@435: /* duke@435: Determine if "sp" is a valid stack pointer. "sp" is assumed to be younger than duke@435: "valid_sp". So if "sp" is valid itself then it should be possible to walk frames duke@435: from "sp" to "valid_sp". The assumption is that the registers windows for the duke@435: thread stack in question are flushed. duke@435: */ duke@435: bool frame::is_valid_stack_pointer(intptr_t* valid_sp, intptr_t* sp) { duke@435: return next_younger_sp_or_null(valid_sp, sp) != NULL; duke@435: } duke@435: duke@435: duke@435: bool frame::interpreter_frame_equals_unpacked_fp(intptr_t* fp) { duke@435: assert(is_interpreted_frame(), "must be interpreter frame"); duke@435: return this->fp() == fp; duke@435: } duke@435: duke@435: duke@435: void frame::pd_gc_epilog() { duke@435: if (is_interpreted_frame()) { duke@435: // set constant pool cache entry for interpreter coleenp@4037: Method* m = interpreter_frame_method(); duke@435: duke@435: *interpreter_frame_cpoolcache_addr() = m->constants()->cache(); duke@435: } duke@435: } duke@435: duke@435: sgoldman@542: bool frame::is_interpreted_frame_valid(JavaThread* thread) const { duke@435: #ifdef CC_INTERP duke@435: // Is there anything to do? duke@435: #else duke@435: assert(is_interpreted_frame(), "Not an interpreted frame"); duke@435: // These are reasonable sanity checks duke@435: if (fp() == 0 || (intptr_t(fp()) & (2*wordSize-1)) != 0) { duke@435: return false; duke@435: } duke@435: if (sp() == 0 || (intptr_t(sp()) & (2*wordSize-1)) != 0) { duke@435: return false; duke@435: } sgoldman@542: duke@435: const intptr_t interpreter_frame_initial_sp_offset = interpreter_frame_vm_local_words; duke@435: if (fp() + interpreter_frame_initial_sp_offset < sp()) { duke@435: return false; duke@435: } duke@435: // These are hacks to keep us out of trouble. duke@435: // The problem with these is that they mask other problems duke@435: if (fp() <= sp()) { // this attempts to deal with unsigned comparison above duke@435: return false; duke@435: } sgoldman@542: // do some validation of frame elements sgoldman@542: sgoldman@542: // first the method sgoldman@542: coleenp@4037: Method* m = *interpreter_frame_method_addr(); sgoldman@542: sgoldman@542: // validate the method we'd find in this potential sender coleenp@4295: if (!m->is_valid_method()) return false; sgoldman@542: sgoldman@542: // stack frames shouldn't be much larger than max_stack elements sgoldman@542: twisti@1861: if (fp() - sp() > 1024 + m->max_stack()*Interpreter::stackElementSize) { duke@435: return false; duke@435: } sgoldman@542: sgoldman@542: // validate bci/bcx sgoldman@542: sgoldman@542: intptr_t bcx = interpreter_frame_bcx(); sgoldman@542: if (m->validate_bci_from_bcx(bcx) < 0) { sgoldman@542: return false; sgoldman@542: } sgoldman@542: coleenp@4037: // validate ConstantPoolCache* coleenp@4037: ConstantPoolCache* cp = *interpreter_frame_cache_addr(); coleenp@5307: if (cp == NULL || !cp->is_metaspace_object()) return false; sgoldman@542: sgoldman@542: // validate locals sgoldman@542: sgoldman@542: address locals = (address) *interpreter_frame_locals_addr(); sgoldman@542: sgoldman@542: if (locals > thread->stack_base() || locals < (address) fp()) return false; sgoldman@542: sgoldman@542: // We'd have to be pretty unlucky to be mislead at this point duke@435: #endif /* CC_INTERP */ duke@435: return true; duke@435: } duke@435: duke@435: duke@435: // Windows have been flushed on entry (but not marked). Capture the pc that duke@435: // is the return address to the frame that contains "sp" as its stack pointer. duke@435: // This pc resides in the called of the frame corresponding to "sp". duke@435: // As a side effect we mark this JavaFrameAnchor as having flushed the windows. duke@435: // This side effect lets us mark stacked JavaFrameAnchors (stacked in the duke@435: // call_helper) as flushed when we have flushed the windows for the most duke@435: // recent (i.e. current) JavaFrameAnchor. This saves useless flushing calls duke@435: // and lets us find the pc just once rather than multiple times as it did duke@435: // in the bad old _post_Java_state days. duke@435: // duke@435: void JavaFrameAnchor::capture_last_Java_pc(intptr_t* sp) { duke@435: if (last_Java_sp() != NULL && last_Java_pc() == NULL) { duke@435: // try and find the sp just younger than _last_Java_sp duke@435: intptr_t* _post_Java_sp = frame::next_younger_sp_or_null(last_Java_sp(), sp); duke@435: // Really this should never fail otherwise VM call must have non-standard duke@435: // frame linkage (bad) or stack is not properly flushed (worse). duke@435: guarantee(_post_Java_sp != NULL, "bad stack!"); duke@435: _last_Java_pc = (address) _post_Java_sp[ I7->sp_offset_in_saved_window()] + frame::pc_return_offset; duke@435: duke@435: } duke@435: set_window_flushed(); duke@435: } duke@435: duke@435: void JavaFrameAnchor::make_walkable(JavaThread* thread) { duke@435: if (walkable()) return; duke@435: // Eventually make an assert duke@435: guarantee(Thread::current() == (Thread*)thread, "only current thread can flush its registers"); duke@435: // We always flush in case the profiler wants it but we won't mark duke@435: // the windows as flushed unless we have a last_Java_frame duke@435: intptr_t* sp = StubRoutines::Sparc::flush_callers_register_windows_func()(); duke@435: if (last_Java_sp() != NULL ) { duke@435: capture_last_Java_pc(sp); duke@435: } duke@435: } duke@435: duke@435: intptr_t* frame::entry_frame_argument_at(int offset) const { duke@435: // convert offset to index to deal with tsi duke@435: int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize); duke@435: duke@435: intptr_t* LSP = (intptr_t*) sp()[Lentry_args->sp_offset_in_saved_window()]; duke@435: return &LSP[index+1]; duke@435: } duke@435: duke@435: duke@435: BasicType frame::interpreter_frame_result(oop* oop_result, jvalue* value_result) { duke@435: assert(is_interpreted_frame(), "interpreted frame expected"); coleenp@4037: Method* method = interpreter_frame_method(); duke@435: BasicType type = method->result_type(); duke@435: duke@435: if (method->is_native()) { duke@435: // Prior to notifying the runtime of the method_exit the possible result duke@435: // value is saved to l_scratch and d_scratch. duke@435: duke@435: #ifdef CC_INTERP duke@435: interpreterState istate = get_interpreterState(); duke@435: intptr_t* l_scratch = (intptr_t*) &istate->_native_lresult; duke@435: intptr_t* d_scratch = (intptr_t*) &istate->_native_fresult; duke@435: #else /* CC_INTERP */ duke@435: intptr_t* l_scratch = fp() + interpreter_frame_l_scratch_fp_offset; duke@435: intptr_t* d_scratch = fp() + interpreter_frame_d_scratch_fp_offset; duke@435: #endif /* CC_INTERP */ duke@435: duke@435: address l_addr = (address)l_scratch; duke@435: #ifdef _LP64 duke@435: // On 64-bit the result for 1/8/16/32-bit result types is in the other duke@435: // word half duke@435: l_addr += wordSize/2; duke@435: #endif duke@435: duke@435: switch (type) { duke@435: case T_OBJECT: duke@435: case T_ARRAY: { duke@435: #ifdef CC_INTERP duke@435: *oop_result = istate->_oop_temp; duke@435: #else hseigel@5784: oop obj = cast_to_oop(at(interpreter_frame_oop_temp_offset)); duke@435: assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check"); duke@435: *oop_result = obj; duke@435: #endif // CC_INTERP duke@435: break; duke@435: } duke@435: duke@435: case T_BOOLEAN : { jint* p = (jint*)l_addr; value_result->z = (jboolean)((*p) & 0x1); break; } duke@435: case T_BYTE : { jint* p = (jint*)l_addr; value_result->b = (jbyte)((*p) & 0xff); break; } duke@435: case T_CHAR : { jint* p = (jint*)l_addr; value_result->c = (jchar)((*p) & 0xffff); break; } duke@435: case T_SHORT : { jint* p = (jint*)l_addr; value_result->s = (jshort)((*p) & 0xffff); break; } duke@435: case T_INT : value_result->i = *(jint*)l_addr; break; duke@435: case T_LONG : value_result->j = *(jlong*)l_scratch; break; duke@435: case T_FLOAT : value_result->f = *(jfloat*)d_scratch; break; duke@435: case T_DOUBLE : value_result->d = *(jdouble*)d_scratch; break; duke@435: case T_VOID : /* Nothing to do */ break; duke@435: default : ShouldNotReachHere(); duke@435: } duke@435: } else { duke@435: intptr_t* tos_addr = interpreter_frame_tos_address(); duke@435: duke@435: switch(type) { duke@435: case T_OBJECT: duke@435: case T_ARRAY: { hseigel@5784: oop obj = cast_to_oop(*tos_addr); duke@435: assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check"); duke@435: *oop_result = obj; duke@435: break; duke@435: } duke@435: case T_BOOLEAN : { jint* p = (jint*)tos_addr; value_result->z = (jboolean)((*p) & 0x1); break; } duke@435: case T_BYTE : { jint* p = (jint*)tos_addr; value_result->b = (jbyte)((*p) & 0xff); break; } duke@435: case T_CHAR : { jint* p = (jint*)tos_addr; value_result->c = (jchar)((*p) & 0xffff); break; } duke@435: case T_SHORT : { jint* p = (jint*)tos_addr; value_result->s = (jshort)((*p) & 0xffff); break; } duke@435: case T_INT : value_result->i = *(jint*)tos_addr; break; duke@435: case T_LONG : value_result->j = *(jlong*)tos_addr; break; duke@435: case T_FLOAT : value_result->f = *(jfloat*)tos_addr; break; duke@435: case T_DOUBLE : value_result->d = *(jdouble*)tos_addr; break; duke@435: case T_VOID : /* Nothing to do */ break; duke@435: default : ShouldNotReachHere(); duke@435: } duke@435: }; duke@435: duke@435: return type; duke@435: } duke@435: duke@435: // Lesp pointer is one word lower than the top item on the stack. duke@435: intptr_t* frame::interpreter_frame_tos_at(jint offset) const { duke@435: int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize) - 1; duke@435: return &interpreter_frame_tos_address()[index]; duke@435: } never@2868: never@2868: bdelsart@3451: #ifndef PRODUCT never@2868: never@2868: #define DESCRIBE_FP_OFFSET(name) \ never@2897: values.describe(frame_no, fp() + frame::name##_offset, #name) never@2868: never@2868: void frame::describe_pd(FrameValues& values, int frame_no) { never@2868: for (int w = 0; w < frame::register_save_words; w++) { never@2868: values.describe(frame_no, sp() + w, err_msg("register save area word %d", w), 1); never@2868: } never@2868: twisti@3969: if (is_interpreted_frame()) { never@2868: DESCRIBE_FP_OFFSET(interpreter_frame_d_scratch_fp); never@2868: DESCRIBE_FP_OFFSET(interpreter_frame_l_scratch_fp); never@2868: DESCRIBE_FP_OFFSET(interpreter_frame_padding); never@2868: DESCRIBE_FP_OFFSET(interpreter_frame_oop_temp); bdelsart@3445: bdelsart@3445: // esp, according to Lesp (e.g. not depending on bci), if seems valid bdelsart@3445: intptr_t* esp = *interpreter_frame_esp_addr(); bdelsart@3445: if ((esp >= sp()) && (esp < fp())) { bdelsart@3445: values.describe(-1, esp, "*Lesp"); bdelsart@3445: } never@2868: } never@2868: never@2868: if (!is_compiled_frame()) { never@2868: if (frame::callee_aggregate_return_pointer_words != 0) { never@2868: values.describe(frame_no, sp() + frame::callee_aggregate_return_pointer_sp_offset, "callee_aggregate_return_pointer_word"); never@2868: } never@2868: for (int w = 0; w < frame::callee_register_argument_save_area_words; w++) { never@2868: values.describe(frame_no, sp() + frame::callee_register_argument_save_area_sp_offset + w, never@2868: err_msg("callee_register_argument_save_area_words %d", w)); never@2868: } never@2868: } never@2868: } never@2868: never@2868: #endif bdelsart@3130: bdelsart@3130: intptr_t *frame::initial_deoptimization_info() { bdelsart@3130: // unused... but returns fp() to minimize changes introduced by 7087445 bdelsart@3130: return fp(); bdelsart@3130: }