Sat, 01 Dec 2007 00:00:00 +0000
Initial load
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | # include "incls/_precompiled.incl" |
duke@435 | 26 | # include "incls/_frame_sparc.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | void RegisterMap::pd_clear() { |
duke@435 | 29 | if (_thread->has_last_Java_frame()) { |
duke@435 | 30 | frame fr = _thread->last_frame(); |
duke@435 | 31 | _window = fr.sp(); |
duke@435 | 32 | } else { |
duke@435 | 33 | _window = NULL; |
duke@435 | 34 | } |
duke@435 | 35 | _younger_window = NULL; |
duke@435 | 36 | } |
duke@435 | 37 | |
duke@435 | 38 | |
duke@435 | 39 | // Unified register numbering scheme: each 32-bits counts as a register |
duke@435 | 40 | // number, so all the V9 registers take 2 slots. |
duke@435 | 41 | const static int R_L_nums[] = {0+040,2+040,4+040,6+040,8+040,10+040,12+040,14+040}; |
duke@435 | 42 | const static int R_I_nums[] = {0+060,2+060,4+060,6+060,8+060,10+060,12+060,14+060}; |
duke@435 | 43 | const static int R_O_nums[] = {0+020,2+020,4+020,6+020,8+020,10+020,12+020,14+020}; |
duke@435 | 44 | const static int R_G_nums[] = {0+000,2+000,4+000,6+000,8+000,10+000,12+000,14+000}; |
duke@435 | 45 | static RegisterMap::LocationValidType bad_mask = 0; |
duke@435 | 46 | static RegisterMap::LocationValidType R_LIO_mask = 0; |
duke@435 | 47 | static bool register_map_inited = false; |
duke@435 | 48 | |
duke@435 | 49 | static void register_map_init() { |
duke@435 | 50 | if (!register_map_inited) { |
duke@435 | 51 | register_map_inited = true; |
duke@435 | 52 | int i; |
duke@435 | 53 | for (i = 0; i < 8; i++) { |
duke@435 | 54 | assert(R_L_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); |
duke@435 | 55 | assert(R_I_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); |
duke@435 | 56 | assert(R_O_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); |
duke@435 | 57 | assert(R_G_nums[i] < RegisterMap::location_valid_type_size, "in first chunk"); |
duke@435 | 58 | } |
duke@435 | 59 | |
duke@435 | 60 | bad_mask |= (1LL << R_O_nums[6]); // SP |
duke@435 | 61 | bad_mask |= (1LL << R_O_nums[7]); // cPC |
duke@435 | 62 | bad_mask |= (1LL << R_I_nums[6]); // FP |
duke@435 | 63 | bad_mask |= (1LL << R_I_nums[7]); // rPC |
duke@435 | 64 | bad_mask |= (1LL << R_G_nums[2]); // TLS |
duke@435 | 65 | bad_mask |= (1LL << R_G_nums[7]); // reserved by libthread |
duke@435 | 66 | |
duke@435 | 67 | for (i = 0; i < 8; i++) { |
duke@435 | 68 | R_LIO_mask |= (1LL << R_L_nums[i]); |
duke@435 | 69 | R_LIO_mask |= (1LL << R_I_nums[i]); |
duke@435 | 70 | R_LIO_mask |= (1LL << R_O_nums[i]); |
duke@435 | 71 | } |
duke@435 | 72 | } |
duke@435 | 73 | } |
duke@435 | 74 | |
duke@435 | 75 | |
duke@435 | 76 | address RegisterMap::pd_location(VMReg regname) const { |
duke@435 | 77 | register_map_init(); |
duke@435 | 78 | |
duke@435 | 79 | assert(regname->is_reg(), "sanity check"); |
duke@435 | 80 | // Only the GPRs get handled this way |
duke@435 | 81 | if( !regname->is_Register()) |
duke@435 | 82 | return NULL; |
duke@435 | 83 | |
duke@435 | 84 | // don't talk about bad registers |
duke@435 | 85 | if ((bad_mask & ((LocationValidType)1 << regname->value())) != 0) { |
duke@435 | 86 | return NULL; |
duke@435 | 87 | } |
duke@435 | 88 | |
duke@435 | 89 | // Convert to a GPR |
duke@435 | 90 | Register reg; |
duke@435 | 91 | int second_word = 0; |
duke@435 | 92 | // 32-bit registers for in, out and local |
duke@435 | 93 | if (!regname->is_concrete()) { |
duke@435 | 94 | // HMM ought to return NULL for any non-concrete (odd) vmreg |
duke@435 | 95 | // this all tied up in the fact we put out double oopMaps for |
duke@435 | 96 | // register locations. When that is fixed we'd will return NULL |
duke@435 | 97 | // (or assert here). |
duke@435 | 98 | reg = regname->prev()->as_Register(); |
duke@435 | 99 | #ifdef _LP64 |
duke@435 | 100 | second_word = sizeof(jint); |
duke@435 | 101 | #else |
duke@435 | 102 | return NULL; |
duke@435 | 103 | #endif // _LP64 |
duke@435 | 104 | } else { |
duke@435 | 105 | reg = regname->as_Register(); |
duke@435 | 106 | } |
duke@435 | 107 | if (reg->is_out()) { |
duke@435 | 108 | assert(_younger_window != NULL, "Younger window should be available"); |
duke@435 | 109 | return second_word + (address)&_younger_window[reg->after_save()->sp_offset_in_saved_window()]; |
duke@435 | 110 | } |
duke@435 | 111 | if (reg->is_local() || reg->is_in()) { |
duke@435 | 112 | assert(_window != NULL, "Window should be available"); |
duke@435 | 113 | return second_word + (address)&_window[reg->sp_offset_in_saved_window()]; |
duke@435 | 114 | } |
duke@435 | 115 | // Only the window'd GPRs get handled this way; not the globals. |
duke@435 | 116 | return NULL; |
duke@435 | 117 | } |
duke@435 | 118 | |
duke@435 | 119 | |
duke@435 | 120 | #ifdef ASSERT |
duke@435 | 121 | void RegisterMap::check_location_valid() { |
duke@435 | 122 | register_map_init(); |
duke@435 | 123 | assert((_location_valid[0] & bad_mask) == 0, "cannot have special locations for SP,FP,TLS,etc."); |
duke@435 | 124 | } |
duke@435 | 125 | #endif |
duke@435 | 126 | |
duke@435 | 127 | // We are shifting windows. That means we are moving all %i to %o, |
duke@435 | 128 | // getting rid of all current %l, and keeping all %g. This is only |
duke@435 | 129 | // complicated if any of the location pointers for these are valid. |
duke@435 | 130 | // The normal case is that everything is in its standard register window |
duke@435 | 131 | // home, and _location_valid[0] is zero. In that case, this routine |
duke@435 | 132 | // does exactly nothing. |
duke@435 | 133 | void RegisterMap::shift_individual_registers() { |
duke@435 | 134 | if (!update_map()) return; // this only applies to maps with locations |
duke@435 | 135 | register_map_init(); |
duke@435 | 136 | check_location_valid(); |
duke@435 | 137 | |
duke@435 | 138 | LocationValidType lv = _location_valid[0]; |
duke@435 | 139 | LocationValidType lv0 = lv; |
duke@435 | 140 | |
duke@435 | 141 | lv &= ~R_LIO_mask; // clear %l, %o, %i regs |
duke@435 | 142 | |
duke@435 | 143 | // if we cleared some non-%g locations, we may have to do some shifting |
duke@435 | 144 | if (lv != lv0) { |
duke@435 | 145 | // copy %i0-%i5 to %o0-%o5, if they have special locations |
duke@435 | 146 | // This can happen in within stubs which spill argument registers |
duke@435 | 147 | // around a dynamic link operation, such as resolve_opt_virtual_call. |
duke@435 | 148 | for (int i = 0; i < 8; i++) { |
duke@435 | 149 | if (lv0 & (1LL << R_I_nums[i])) { |
duke@435 | 150 | _location[R_O_nums[i]] = _location[R_I_nums[i]]; |
duke@435 | 151 | lv |= (1LL << R_O_nums[i]); |
duke@435 | 152 | } |
duke@435 | 153 | } |
duke@435 | 154 | } |
duke@435 | 155 | |
duke@435 | 156 | _location_valid[0] = lv; |
duke@435 | 157 | check_location_valid(); |
duke@435 | 158 | } |
duke@435 | 159 | |
duke@435 | 160 | |
duke@435 | 161 | bool frame::safe_for_sender(JavaThread *thread) { |
duke@435 | 162 | address sp = (address)_sp; |
duke@435 | 163 | if (sp != NULL && |
duke@435 | 164 | (sp <= thread->stack_base() && sp >= thread->stack_base() - thread->stack_size())) { |
duke@435 | 165 | // Unfortunately we can only check frame complete for runtime stubs and nmethod |
duke@435 | 166 | // other generic buffer blobs are more problematic so we just assume they are |
duke@435 | 167 | // ok. adapter blobs never have a frame complete and are never ok. |
duke@435 | 168 | if (_cb != NULL && !_cb->is_frame_complete_at(_pc)) { |
duke@435 | 169 | if (_cb->is_nmethod() || _cb->is_adapter_blob() || _cb->is_runtime_stub()) { |
duke@435 | 170 | return false; |
duke@435 | 171 | } |
duke@435 | 172 | } |
duke@435 | 173 | return true; |
duke@435 | 174 | } |
duke@435 | 175 | return false; |
duke@435 | 176 | } |
duke@435 | 177 | |
duke@435 | 178 | // constructors |
duke@435 | 179 | |
duke@435 | 180 | // Construct an unpatchable, deficient frame |
duke@435 | 181 | frame::frame(intptr_t* sp, unpatchable_t, address pc, CodeBlob* cb) { |
duke@435 | 182 | #ifdef _LP64 |
duke@435 | 183 | assert( (((intptr_t)sp & (wordSize-1)) == 0), "frame constructor passed an invalid sp"); |
duke@435 | 184 | #endif |
duke@435 | 185 | _sp = sp; |
duke@435 | 186 | _younger_sp = NULL; |
duke@435 | 187 | _pc = pc; |
duke@435 | 188 | _cb = cb; |
duke@435 | 189 | _sp_adjustment_by_callee = 0; |
duke@435 | 190 | assert(pc == NULL && cb == NULL || pc != NULL, "can't have a cb and no pc!"); |
duke@435 | 191 | if (_cb == NULL && _pc != NULL ) { |
duke@435 | 192 | _cb = CodeCache::find_blob(_pc); |
duke@435 | 193 | } |
duke@435 | 194 | _deopt_state = unknown; |
duke@435 | 195 | #ifdef ASSERT |
duke@435 | 196 | if ( _cb != NULL && _cb->is_nmethod()) { |
duke@435 | 197 | // Without a valid unextended_sp() we can't convert the pc to "original" |
duke@435 | 198 | assert(!((nmethod*)_cb)->is_deopt_pc(_pc), "invariant broken"); |
duke@435 | 199 | } |
duke@435 | 200 | #endif // ASSERT |
duke@435 | 201 | } |
duke@435 | 202 | |
duke@435 | 203 | frame::frame(intptr_t* sp, intptr_t* younger_sp, bool younger_frame_adjusted_stack) { |
duke@435 | 204 | _sp = sp; |
duke@435 | 205 | _younger_sp = younger_sp; |
duke@435 | 206 | if (younger_sp == NULL) { |
duke@435 | 207 | // make a deficient frame which doesn't know where its PC is |
duke@435 | 208 | _pc = NULL; |
duke@435 | 209 | _cb = NULL; |
duke@435 | 210 | } else { |
duke@435 | 211 | _pc = (address)younger_sp[I7->sp_offset_in_saved_window()] + pc_return_offset; |
duke@435 | 212 | 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 | 213 | // Any frame we ever build should always "safe" therefore we should not have to call |
duke@435 | 214 | // find_blob_unsafe |
duke@435 | 215 | // In case of native stubs, the pc retrieved here might be |
duke@435 | 216 | // wrong. (the _last_native_pc will have the right value) |
duke@435 | 217 | // So do not put add any asserts on the _pc here. |
duke@435 | 218 | } |
duke@435 | 219 | if (younger_frame_adjusted_stack) { |
duke@435 | 220 | // compute adjustment to this frame's SP made by its interpreted callee |
duke@435 | 221 | _sp_adjustment_by_callee = (intptr_t*)((intptr_t)younger_sp[I5_savedSP->sp_offset_in_saved_window()] + |
duke@435 | 222 | STACK_BIAS) - sp; |
duke@435 | 223 | } else { |
duke@435 | 224 | _sp_adjustment_by_callee = 0; |
duke@435 | 225 | } |
duke@435 | 226 | |
duke@435 | 227 | _deopt_state = unknown; |
duke@435 | 228 | |
duke@435 | 229 | // It is important that frame be fully construct when we do this lookup |
duke@435 | 230 | // as get_original_pc() needs correct value for unextended_sp() |
duke@435 | 231 | if (_pc != NULL) { |
duke@435 | 232 | _cb = CodeCache::find_blob(_pc); |
duke@435 | 233 | if (_cb != NULL && _cb->is_nmethod() && ((nmethod*)_cb)->is_deopt_pc(_pc)) { |
duke@435 | 234 | _pc = ((nmethod*)_cb)->get_original_pc(this); |
duke@435 | 235 | _deopt_state = is_deoptimized; |
duke@435 | 236 | } else { |
duke@435 | 237 | _deopt_state = not_deoptimized; |
duke@435 | 238 | } |
duke@435 | 239 | } |
duke@435 | 240 | } |
duke@435 | 241 | |
duke@435 | 242 | bool frame::is_interpreted_frame() const { |
duke@435 | 243 | return Interpreter::contains(pc()); |
duke@435 | 244 | } |
duke@435 | 245 | |
duke@435 | 246 | // sender_sp |
duke@435 | 247 | |
duke@435 | 248 | intptr_t* frame::interpreter_frame_sender_sp() const { |
duke@435 | 249 | assert(is_interpreted_frame(), "interpreted frame expected"); |
duke@435 | 250 | return fp(); |
duke@435 | 251 | } |
duke@435 | 252 | |
duke@435 | 253 | #ifndef CC_INTERP |
duke@435 | 254 | void frame::set_interpreter_frame_sender_sp(intptr_t* sender_sp) { |
duke@435 | 255 | assert(is_interpreted_frame(), "interpreted frame expected"); |
duke@435 | 256 | Unimplemented(); |
duke@435 | 257 | } |
duke@435 | 258 | #endif // CC_INTERP |
duke@435 | 259 | |
duke@435 | 260 | |
duke@435 | 261 | #ifdef ASSERT |
duke@435 | 262 | // Debugging aid |
duke@435 | 263 | static frame nth_sender(int n) { |
duke@435 | 264 | frame f = JavaThread::current()->last_frame(); |
duke@435 | 265 | |
duke@435 | 266 | for(int i = 0; i < n; ++i) |
duke@435 | 267 | f = f.sender((RegisterMap*)NULL); |
duke@435 | 268 | |
duke@435 | 269 | printf("first frame %d\n", f.is_first_frame() ? 1 : 0); |
duke@435 | 270 | printf("interpreted frame %d\n", f.is_interpreted_frame() ? 1 : 0); |
duke@435 | 271 | printf("java frame %d\n", f.is_java_frame() ? 1 : 0); |
duke@435 | 272 | printf("entry frame %d\n", f.is_entry_frame() ? 1 : 0); |
duke@435 | 273 | printf("native frame %d\n", f.is_native_frame() ? 1 : 0); |
duke@435 | 274 | if (f.is_compiled_frame()) { |
duke@435 | 275 | if (f.is_deoptimized_frame()) |
duke@435 | 276 | printf("deoptimized frame 1\n"); |
duke@435 | 277 | else |
duke@435 | 278 | printf("compiled frame 1\n"); |
duke@435 | 279 | } |
duke@435 | 280 | |
duke@435 | 281 | return f; |
duke@435 | 282 | } |
duke@435 | 283 | #endif |
duke@435 | 284 | |
duke@435 | 285 | |
duke@435 | 286 | frame frame::sender_for_entry_frame(RegisterMap *map) const { |
duke@435 | 287 | assert(map != NULL, "map must be set"); |
duke@435 | 288 | // Java frame called from C; skip all C frames and return top C |
duke@435 | 289 | // frame of that chunk as the sender |
duke@435 | 290 | JavaFrameAnchor* jfa = entry_frame_call_wrapper()->anchor(); |
duke@435 | 291 | assert(!entry_frame_is_first(), "next Java fp must be non zero"); |
duke@435 | 292 | assert(jfa->last_Java_sp() > _sp, "must be above this frame on stack"); |
duke@435 | 293 | intptr_t* last_Java_sp = jfa->last_Java_sp(); |
duke@435 | 294 | // Since we are walking the stack now this nested anchor is obviously walkable |
duke@435 | 295 | // even if it wasn't when it was stacked. |
duke@435 | 296 | if (!jfa->walkable()) { |
duke@435 | 297 | // Capture _last_Java_pc (if needed) and mark anchor walkable. |
duke@435 | 298 | jfa->capture_last_Java_pc(_sp); |
duke@435 | 299 | } |
duke@435 | 300 | assert(jfa->last_Java_pc() != NULL, "No captured pc!"); |
duke@435 | 301 | map->clear(); |
duke@435 | 302 | map->make_integer_regs_unsaved(); |
duke@435 | 303 | map->shift_window(last_Java_sp, NULL); |
duke@435 | 304 | assert(map->include_argument_oops(), "should be set by clear"); |
duke@435 | 305 | return frame(last_Java_sp, frame::unpatchable, jfa->last_Java_pc()); |
duke@435 | 306 | } |
duke@435 | 307 | |
duke@435 | 308 | frame frame::sender_for_interpreter_frame(RegisterMap *map) const { |
duke@435 | 309 | ShouldNotCallThis(); |
duke@435 | 310 | return sender(map); |
duke@435 | 311 | } |
duke@435 | 312 | |
duke@435 | 313 | frame frame::sender_for_compiled_frame(RegisterMap *map) const { |
duke@435 | 314 | ShouldNotCallThis(); |
duke@435 | 315 | return sender(map); |
duke@435 | 316 | } |
duke@435 | 317 | |
duke@435 | 318 | frame frame::sender(RegisterMap* map) const { |
duke@435 | 319 | assert(map != NULL, "map must be set"); |
duke@435 | 320 | |
duke@435 | 321 | assert(CodeCache::find_blob_unsafe(_pc) == _cb, "inconsistent"); |
duke@435 | 322 | |
duke@435 | 323 | // Default is not to follow arguments; update it accordingly below |
duke@435 | 324 | map->set_include_argument_oops(false); |
duke@435 | 325 | |
duke@435 | 326 | if (is_entry_frame()) return sender_for_entry_frame(map); |
duke@435 | 327 | |
duke@435 | 328 | intptr_t* younger_sp = sp(); |
duke@435 | 329 | intptr_t* sp = sender_sp(); |
duke@435 | 330 | bool adjusted_stack = false; |
duke@435 | 331 | |
duke@435 | 332 | // Note: The version of this operation on any platform with callee-save |
duke@435 | 333 | // registers must update the register map (if not null). |
duke@435 | 334 | // In order to do this correctly, the various subtypes of |
duke@435 | 335 | // of frame (interpreted, compiled, glue, native), |
duke@435 | 336 | // must be distinguished. There is no need on SPARC for |
duke@435 | 337 | // such distinctions, because all callee-save registers are |
duke@435 | 338 | // preserved for all frames via SPARC-specific mechanisms. |
duke@435 | 339 | // |
duke@435 | 340 | // *** HOWEVER, *** if and when we make any floating-point |
duke@435 | 341 | // registers callee-saved, then we will have to copy over |
duke@435 | 342 | // the RegisterMap update logic from the Intel code. |
duke@435 | 343 | |
duke@435 | 344 | // The constructor of the sender must know whether this frame is interpreted so it can set the |
duke@435 | 345 | // sender's _sp_adjustment_by_callee field. An osr adapter frame was originally |
duke@435 | 346 | // interpreted but its pc is in the code cache (for c1 -> osr_frame_return_id stub), so it must be |
duke@435 | 347 | // explicitly recognized. |
duke@435 | 348 | |
duke@435 | 349 | adjusted_stack = is_interpreted_frame(); |
duke@435 | 350 | if (adjusted_stack) { |
duke@435 | 351 | map->make_integer_regs_unsaved(); |
duke@435 | 352 | map->shift_window(sp, younger_sp); |
duke@435 | 353 | } else if (_cb != NULL) { |
duke@435 | 354 | // Update the locations of implicitly saved registers to be their |
duke@435 | 355 | // addresses in the register save area. |
duke@435 | 356 | // For %o registers, the addresses of %i registers in the next younger |
duke@435 | 357 | // frame are used. |
duke@435 | 358 | map->shift_window(sp, younger_sp); |
duke@435 | 359 | if (map->update_map()) { |
duke@435 | 360 | // Tell GC to use argument oopmaps for some runtime stubs that need it. |
duke@435 | 361 | // For C1, the runtime stub might not have oop maps, so set this flag |
duke@435 | 362 | // outside of update_register_map. |
duke@435 | 363 | map->set_include_argument_oops(_cb->caller_must_gc_arguments(map->thread())); |
duke@435 | 364 | if (_cb->oop_maps() != NULL) { |
duke@435 | 365 | OopMapSet::update_register_map(this, map); |
duke@435 | 366 | } |
duke@435 | 367 | } |
duke@435 | 368 | } |
duke@435 | 369 | return frame(sp, younger_sp, adjusted_stack); |
duke@435 | 370 | } |
duke@435 | 371 | |
duke@435 | 372 | |
duke@435 | 373 | void frame::patch_pc(Thread* thread, address pc) { |
duke@435 | 374 | if(thread == Thread::current()) { |
duke@435 | 375 | StubRoutines::Sparc::flush_callers_register_windows_func()(); |
duke@435 | 376 | } |
duke@435 | 377 | if (TracePcPatching) { |
duke@435 | 378 | // QQQ this assert is invalid (or too strong anyway) sice _pc could |
duke@435 | 379 | // be original pc and frame could have the deopt pc. |
duke@435 | 380 | // assert(_pc == *O7_addr() + pc_return_offset, "frame has wrong pc"); |
duke@435 | 381 | tty->print_cr("patch_pc at address 0x%x [0x%x -> 0x%x] ", O7_addr(), _pc, pc); |
duke@435 | 382 | } |
duke@435 | 383 | _cb = CodeCache::find_blob(pc); |
duke@435 | 384 | *O7_addr() = pc - pc_return_offset; |
duke@435 | 385 | _cb = CodeCache::find_blob(_pc); |
duke@435 | 386 | if (_cb != NULL && _cb->is_nmethod() && ((nmethod*)_cb)->is_deopt_pc(_pc)) { |
duke@435 | 387 | address orig = ((nmethod*)_cb)->get_original_pc(this); |
duke@435 | 388 | assert(orig == _pc, "expected original to be stored before patching"); |
duke@435 | 389 | _deopt_state = is_deoptimized; |
duke@435 | 390 | } else { |
duke@435 | 391 | _deopt_state = not_deoptimized; |
duke@435 | 392 | } |
duke@435 | 393 | } |
duke@435 | 394 | |
duke@435 | 395 | |
duke@435 | 396 | static bool sp_is_valid(intptr_t* old_sp, intptr_t* young_sp, intptr_t* sp) { |
duke@435 | 397 | return (((intptr_t)sp & (2*wordSize-1)) == 0 && |
duke@435 | 398 | sp <= old_sp && |
duke@435 | 399 | sp >= young_sp); |
duke@435 | 400 | } |
duke@435 | 401 | |
duke@435 | 402 | |
duke@435 | 403 | /* |
duke@435 | 404 | Find the (biased) sp that is just younger than old_sp starting at sp. |
duke@435 | 405 | If not found return NULL. Register windows are assumed to be flushed. |
duke@435 | 406 | */ |
duke@435 | 407 | intptr_t* frame::next_younger_sp_or_null(intptr_t* old_sp, intptr_t* sp) { |
duke@435 | 408 | |
duke@435 | 409 | intptr_t* previous_sp = NULL; |
duke@435 | 410 | intptr_t* orig_sp = sp; |
duke@435 | 411 | |
duke@435 | 412 | int max_frames = (old_sp - sp) / 16; // Minimum frame size is 16 |
duke@435 | 413 | int max_frame2 = max_frames; |
duke@435 | 414 | while(sp != old_sp && sp_is_valid(old_sp, orig_sp, sp)) { |
duke@435 | 415 | if (max_frames-- <= 0) |
duke@435 | 416 | // too many frames have gone by; invalid parameters given to this function |
duke@435 | 417 | break; |
duke@435 | 418 | previous_sp = sp; |
duke@435 | 419 | sp = (intptr_t*)sp[FP->sp_offset_in_saved_window()]; |
duke@435 | 420 | sp = (intptr_t*)((intptr_t)sp + STACK_BIAS); |
duke@435 | 421 | } |
duke@435 | 422 | |
duke@435 | 423 | return (sp == old_sp ? previous_sp : NULL); |
duke@435 | 424 | } |
duke@435 | 425 | |
duke@435 | 426 | /* |
duke@435 | 427 | Determine if "sp" is a valid stack pointer. "sp" is assumed to be younger than |
duke@435 | 428 | "valid_sp". So if "sp" is valid itself then it should be possible to walk frames |
duke@435 | 429 | from "sp" to "valid_sp". The assumption is that the registers windows for the |
duke@435 | 430 | thread stack in question are flushed. |
duke@435 | 431 | */ |
duke@435 | 432 | bool frame::is_valid_stack_pointer(intptr_t* valid_sp, intptr_t* sp) { |
duke@435 | 433 | return next_younger_sp_or_null(valid_sp, sp) != NULL; |
duke@435 | 434 | } |
duke@435 | 435 | |
duke@435 | 436 | |
duke@435 | 437 | bool frame::interpreter_frame_equals_unpacked_fp(intptr_t* fp) { |
duke@435 | 438 | assert(is_interpreted_frame(), "must be interpreter frame"); |
duke@435 | 439 | return this->fp() == fp; |
duke@435 | 440 | } |
duke@435 | 441 | |
duke@435 | 442 | |
duke@435 | 443 | void frame::pd_gc_epilog() { |
duke@435 | 444 | if (is_interpreted_frame()) { |
duke@435 | 445 | // set constant pool cache entry for interpreter |
duke@435 | 446 | methodOop m = interpreter_frame_method(); |
duke@435 | 447 | |
duke@435 | 448 | *interpreter_frame_cpoolcache_addr() = m->constants()->cache(); |
duke@435 | 449 | } |
duke@435 | 450 | } |
duke@435 | 451 | |
duke@435 | 452 | |
duke@435 | 453 | bool frame::is_interpreted_frame_valid() const { |
duke@435 | 454 | #ifdef CC_INTERP |
duke@435 | 455 | // Is there anything to do? |
duke@435 | 456 | #else |
duke@435 | 457 | assert(is_interpreted_frame(), "Not an interpreted frame"); |
duke@435 | 458 | // These are reasonable sanity checks |
duke@435 | 459 | if (fp() == 0 || (intptr_t(fp()) & (2*wordSize-1)) != 0) { |
duke@435 | 460 | return false; |
duke@435 | 461 | } |
duke@435 | 462 | if (sp() == 0 || (intptr_t(sp()) & (2*wordSize-1)) != 0) { |
duke@435 | 463 | return false; |
duke@435 | 464 | } |
duke@435 | 465 | const intptr_t interpreter_frame_initial_sp_offset = interpreter_frame_vm_local_words; |
duke@435 | 466 | if (fp() + interpreter_frame_initial_sp_offset < sp()) { |
duke@435 | 467 | return false; |
duke@435 | 468 | } |
duke@435 | 469 | // These are hacks to keep us out of trouble. |
duke@435 | 470 | // The problem with these is that they mask other problems |
duke@435 | 471 | if (fp() <= sp()) { // this attempts to deal with unsigned comparison above |
duke@435 | 472 | return false; |
duke@435 | 473 | } |
duke@435 | 474 | if (fp() - sp() > 4096) { // stack frames shouldn't be large. |
duke@435 | 475 | return false; |
duke@435 | 476 | } |
duke@435 | 477 | #endif /* CC_INTERP */ |
duke@435 | 478 | return true; |
duke@435 | 479 | } |
duke@435 | 480 | |
duke@435 | 481 | |
duke@435 | 482 | // Windows have been flushed on entry (but not marked). Capture the pc that |
duke@435 | 483 | // is the return address to the frame that contains "sp" as its stack pointer. |
duke@435 | 484 | // This pc resides in the called of the frame corresponding to "sp". |
duke@435 | 485 | // As a side effect we mark this JavaFrameAnchor as having flushed the windows. |
duke@435 | 486 | // This side effect lets us mark stacked JavaFrameAnchors (stacked in the |
duke@435 | 487 | // call_helper) as flushed when we have flushed the windows for the most |
duke@435 | 488 | // recent (i.e. current) JavaFrameAnchor. This saves useless flushing calls |
duke@435 | 489 | // and lets us find the pc just once rather than multiple times as it did |
duke@435 | 490 | // in the bad old _post_Java_state days. |
duke@435 | 491 | // |
duke@435 | 492 | void JavaFrameAnchor::capture_last_Java_pc(intptr_t* sp) { |
duke@435 | 493 | if (last_Java_sp() != NULL && last_Java_pc() == NULL) { |
duke@435 | 494 | // try and find the sp just younger than _last_Java_sp |
duke@435 | 495 | intptr_t* _post_Java_sp = frame::next_younger_sp_or_null(last_Java_sp(), sp); |
duke@435 | 496 | // Really this should never fail otherwise VM call must have non-standard |
duke@435 | 497 | // frame linkage (bad) or stack is not properly flushed (worse). |
duke@435 | 498 | guarantee(_post_Java_sp != NULL, "bad stack!"); |
duke@435 | 499 | _last_Java_pc = (address) _post_Java_sp[ I7->sp_offset_in_saved_window()] + frame::pc_return_offset; |
duke@435 | 500 | |
duke@435 | 501 | } |
duke@435 | 502 | set_window_flushed(); |
duke@435 | 503 | } |
duke@435 | 504 | |
duke@435 | 505 | void JavaFrameAnchor::make_walkable(JavaThread* thread) { |
duke@435 | 506 | if (walkable()) return; |
duke@435 | 507 | // Eventually make an assert |
duke@435 | 508 | guarantee(Thread::current() == (Thread*)thread, "only current thread can flush its registers"); |
duke@435 | 509 | // We always flush in case the profiler wants it but we won't mark |
duke@435 | 510 | // the windows as flushed unless we have a last_Java_frame |
duke@435 | 511 | intptr_t* sp = StubRoutines::Sparc::flush_callers_register_windows_func()(); |
duke@435 | 512 | if (last_Java_sp() != NULL ) { |
duke@435 | 513 | capture_last_Java_pc(sp); |
duke@435 | 514 | } |
duke@435 | 515 | } |
duke@435 | 516 | |
duke@435 | 517 | intptr_t* frame::entry_frame_argument_at(int offset) const { |
duke@435 | 518 | // convert offset to index to deal with tsi |
duke@435 | 519 | int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize); |
duke@435 | 520 | |
duke@435 | 521 | intptr_t* LSP = (intptr_t*) sp()[Lentry_args->sp_offset_in_saved_window()]; |
duke@435 | 522 | return &LSP[index+1]; |
duke@435 | 523 | } |
duke@435 | 524 | |
duke@435 | 525 | |
duke@435 | 526 | BasicType frame::interpreter_frame_result(oop* oop_result, jvalue* value_result) { |
duke@435 | 527 | assert(is_interpreted_frame(), "interpreted frame expected"); |
duke@435 | 528 | methodOop method = interpreter_frame_method(); |
duke@435 | 529 | BasicType type = method->result_type(); |
duke@435 | 530 | |
duke@435 | 531 | if (method->is_native()) { |
duke@435 | 532 | // Prior to notifying the runtime of the method_exit the possible result |
duke@435 | 533 | // value is saved to l_scratch and d_scratch. |
duke@435 | 534 | |
duke@435 | 535 | #ifdef CC_INTERP |
duke@435 | 536 | interpreterState istate = get_interpreterState(); |
duke@435 | 537 | intptr_t* l_scratch = (intptr_t*) &istate->_native_lresult; |
duke@435 | 538 | intptr_t* d_scratch = (intptr_t*) &istate->_native_fresult; |
duke@435 | 539 | #else /* CC_INTERP */ |
duke@435 | 540 | intptr_t* l_scratch = fp() + interpreter_frame_l_scratch_fp_offset; |
duke@435 | 541 | intptr_t* d_scratch = fp() + interpreter_frame_d_scratch_fp_offset; |
duke@435 | 542 | #endif /* CC_INTERP */ |
duke@435 | 543 | |
duke@435 | 544 | address l_addr = (address)l_scratch; |
duke@435 | 545 | #ifdef _LP64 |
duke@435 | 546 | // On 64-bit the result for 1/8/16/32-bit result types is in the other |
duke@435 | 547 | // word half |
duke@435 | 548 | l_addr += wordSize/2; |
duke@435 | 549 | #endif |
duke@435 | 550 | |
duke@435 | 551 | switch (type) { |
duke@435 | 552 | case T_OBJECT: |
duke@435 | 553 | case T_ARRAY: { |
duke@435 | 554 | #ifdef CC_INTERP |
duke@435 | 555 | *oop_result = istate->_oop_temp; |
duke@435 | 556 | #else |
duke@435 | 557 | oop obj = (oop) at(interpreter_frame_oop_temp_offset); |
duke@435 | 558 | assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check"); |
duke@435 | 559 | *oop_result = obj; |
duke@435 | 560 | #endif // CC_INTERP |
duke@435 | 561 | break; |
duke@435 | 562 | } |
duke@435 | 563 | |
duke@435 | 564 | case T_BOOLEAN : { jint* p = (jint*)l_addr; value_result->z = (jboolean)((*p) & 0x1); break; } |
duke@435 | 565 | case T_BYTE : { jint* p = (jint*)l_addr; value_result->b = (jbyte)((*p) & 0xff); break; } |
duke@435 | 566 | case T_CHAR : { jint* p = (jint*)l_addr; value_result->c = (jchar)((*p) & 0xffff); break; } |
duke@435 | 567 | case T_SHORT : { jint* p = (jint*)l_addr; value_result->s = (jshort)((*p) & 0xffff); break; } |
duke@435 | 568 | case T_INT : value_result->i = *(jint*)l_addr; break; |
duke@435 | 569 | case T_LONG : value_result->j = *(jlong*)l_scratch; break; |
duke@435 | 570 | case T_FLOAT : value_result->f = *(jfloat*)d_scratch; break; |
duke@435 | 571 | case T_DOUBLE : value_result->d = *(jdouble*)d_scratch; break; |
duke@435 | 572 | case T_VOID : /* Nothing to do */ break; |
duke@435 | 573 | default : ShouldNotReachHere(); |
duke@435 | 574 | } |
duke@435 | 575 | } else { |
duke@435 | 576 | intptr_t* tos_addr = interpreter_frame_tos_address(); |
duke@435 | 577 | |
duke@435 | 578 | switch(type) { |
duke@435 | 579 | case T_OBJECT: |
duke@435 | 580 | case T_ARRAY: { |
duke@435 | 581 | oop obj = (oop)*tos_addr; |
duke@435 | 582 | assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check"); |
duke@435 | 583 | *oop_result = obj; |
duke@435 | 584 | break; |
duke@435 | 585 | } |
duke@435 | 586 | case T_BOOLEAN : { jint* p = (jint*)tos_addr; value_result->z = (jboolean)((*p) & 0x1); break; } |
duke@435 | 587 | case T_BYTE : { jint* p = (jint*)tos_addr; value_result->b = (jbyte)((*p) & 0xff); break; } |
duke@435 | 588 | case T_CHAR : { jint* p = (jint*)tos_addr; value_result->c = (jchar)((*p) & 0xffff); break; } |
duke@435 | 589 | case T_SHORT : { jint* p = (jint*)tos_addr; value_result->s = (jshort)((*p) & 0xffff); break; } |
duke@435 | 590 | case T_INT : value_result->i = *(jint*)tos_addr; break; |
duke@435 | 591 | case T_LONG : value_result->j = *(jlong*)tos_addr; break; |
duke@435 | 592 | case T_FLOAT : value_result->f = *(jfloat*)tos_addr; break; |
duke@435 | 593 | case T_DOUBLE : value_result->d = *(jdouble*)tos_addr; break; |
duke@435 | 594 | case T_VOID : /* Nothing to do */ break; |
duke@435 | 595 | default : ShouldNotReachHere(); |
duke@435 | 596 | } |
duke@435 | 597 | }; |
duke@435 | 598 | |
duke@435 | 599 | return type; |
duke@435 | 600 | } |
duke@435 | 601 | |
duke@435 | 602 | // Lesp pointer is one word lower than the top item on the stack. |
duke@435 | 603 | intptr_t* frame::interpreter_frame_tos_at(jint offset) const { |
duke@435 | 604 | int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize) - 1; |
duke@435 | 605 | return &interpreter_frame_tos_address()[index]; |
duke@435 | 606 | } |