1 /*
   2  * Copyright 1997-2010 Sun Microsystems, Inc.  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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
  20  * CA 95054 USA or visit www.sun.com if you need additional information or
  21  * have any questions.
  22  *
  23  */
  24 
  25 # include "incls/_precompiled.incl"
  26 # include "incls/_frame_sparc.cpp.incl"
  27 
  28 void RegisterMap::pd_clear() {
  29   if (_thread->has_last_Java_frame()) {
  30     frame fr = _thread->last_frame();
  31     _window = fr.sp();
  32   } else {
  33     _window = NULL;
  34   }
  35   _younger_window = NULL;
  36 }
  37 
  38 
  39 // Unified register numbering scheme: each 32-bits counts as a register
  40 // number, so all the V9 registers take 2 slots.
  41 const static int R_L_nums[] = {0+040,2+040,4+040,6+040,8+040,10+040,12+040,14+040};
  42 const static int R_I_nums[] = {0+060,2+060,4+060,6+060,8+060,10+060,12+060,14+060};
  43 const static int R_O_nums[] = {0+020,2+020,4+020,6+020,8+020,10+020,12+020,14+020};
  44 const static int R_G_nums[] = {0+000,2+000,4+000,6+000,8+000,10+000,12+000,14+000};
  45 static RegisterMap::LocationValidType bad_mask = 0;
  46 static RegisterMap::LocationValidType R_LIO_mask = 0;
  47 static bool register_map_inited = false;
  48 
  49 static void register_map_init() {
  50   if (!register_map_inited) {
  51     register_map_inited = true;
  52     int i;
  53     for (i = 0; i < 8; i++) {
  54       assert(R_L_nums[i] < RegisterMap::location_valid_type_size, "in first chunk");
  55       assert(R_I_nums[i] < RegisterMap::location_valid_type_size, "in first chunk");
  56       assert(R_O_nums[i] < RegisterMap::location_valid_type_size, "in first chunk");
  57       assert(R_G_nums[i] < RegisterMap::location_valid_type_size, "in first chunk");
  58     }
  59 
  60     bad_mask |= (1LL << R_O_nums[6]); // SP
  61     bad_mask |= (1LL << R_O_nums[7]); // cPC
  62     bad_mask |= (1LL << R_I_nums[6]); // FP
  63     bad_mask |= (1LL << R_I_nums[7]); // rPC
  64     bad_mask |= (1LL << R_G_nums[2]); // TLS
  65     bad_mask |= (1LL << R_G_nums[7]); // reserved by libthread
  66 
  67     for (i = 0; i < 8; i++) {
  68       R_LIO_mask |= (1LL << R_L_nums[i]);
  69       R_LIO_mask |= (1LL << R_I_nums[i]);
  70       R_LIO_mask |= (1LL << R_O_nums[i]);
  71     }
  72   }
  73 }
  74 
  75 
  76 address RegisterMap::pd_location(VMReg regname) const {
  77   register_map_init();
  78 
  79   assert(regname->is_reg(), "sanity check");
  80   // Only the GPRs get handled this way
  81   if( !regname->is_Register())
  82     return NULL;
  83 
  84   // don't talk about bad registers
  85   if ((bad_mask & ((LocationValidType)1 << regname->value())) != 0) {
  86     return NULL;
  87   }
  88 
  89   // Convert to a GPR
  90   Register reg;
  91   int second_word = 0;
  92   // 32-bit registers for in, out and local
  93   if (!regname->is_concrete()) {
  94     // HMM ought to return NULL for any non-concrete (odd) vmreg
  95     // this all tied up in the fact we put out double oopMaps for
  96     // register locations. When that is fixed we'd will return NULL
  97     // (or assert here).
  98     reg = regname->prev()->as_Register();
  99 #ifdef _LP64
 100     second_word = sizeof(jint);
 101 #else
 102     return NULL;
 103 #endif // _LP64
 104   } else {
 105     reg = regname->as_Register();
 106   }
 107   if (reg->is_out()) {
 108     assert(_younger_window != NULL, "Younger window should be available");
 109     return second_word + (address)&_younger_window[reg->after_save()->sp_offset_in_saved_window()];
 110   }
 111   if (reg->is_local() || reg->is_in()) {
 112     assert(_window != NULL, "Window should be available");
 113     return second_word + (address)&_window[reg->sp_offset_in_saved_window()];
 114   }
 115   // Only the window'd GPRs get handled this way; not the globals.
 116   return NULL;
 117 }
 118 
 119 
 120 #ifdef ASSERT
 121 void RegisterMap::check_location_valid() {
 122   register_map_init();
 123   assert((_location_valid[0] & bad_mask) == 0, "cannot have special locations for SP,FP,TLS,etc.");
 124 }
 125 #endif
 126 
 127 // We are shifting windows.  That means we are moving all %i to %o,
 128 // getting rid of all current %l, and keeping all %g.  This is only
 129 // complicated if any of the location pointers for these are valid.
 130 // The normal case is that everything is in its standard register window
 131 // home, and _location_valid[0] is zero.  In that case, this routine
 132 // does exactly nothing.
 133 void RegisterMap::shift_individual_registers() {
 134   if (!update_map())  return;  // this only applies to maps with locations
 135   register_map_init();
 136   check_location_valid();
 137 
 138   LocationValidType lv = _location_valid[0];
 139   LocationValidType lv0 = lv;
 140 
 141   lv &= ~R_LIO_mask;  // clear %l, %o, %i regs
 142 
 143   // if we cleared some non-%g locations, we may have to do some shifting
 144   if (lv != lv0) {
 145     // copy %i0-%i5 to %o0-%o5, if they have special locations
 146     // This can happen in within stubs which spill argument registers
 147     // around a dynamic link operation, such as resolve_opt_virtual_call.
 148     for (int i = 0; i < 8; i++) {
 149       if (lv0 & (1LL << R_I_nums[i])) {
 150         _location[R_O_nums[i]] = _location[R_I_nums[i]];
 151         lv |=  (1LL << R_O_nums[i]);
 152       }
 153     }
 154   }
 155 
 156   _location_valid[0] = lv;
 157   check_location_valid();
 158 }
 159 
 160 bool frame::safe_for_sender(JavaThread *thread) {
 161 
 162   address _SP = (address) sp();
 163   address _FP = (address) fp();
 164   address _UNEXTENDED_SP = (address) unextended_sp();
 165   // sp must be within the stack
 166   bool sp_safe = (_SP <= thread->stack_base()) &&
 167                  (_SP >= thread->stack_base() - thread->stack_size());
 168 
 169   if (!sp_safe) {
 170     return false;
 171   }
 172 
 173   // unextended sp must be within the stack and above or equal sp
 174   bool unextended_sp_safe = (_UNEXTENDED_SP <= thread->stack_base()) &&
 175                             (_UNEXTENDED_SP >= _SP);
 176 
 177   if (!unextended_sp_safe) return false;
 178 
 179   // an fp must be within the stack and above (but not equal) sp
 180   bool fp_safe = (_FP <= thread->stack_base()) &&
 181                  (_FP > _SP);
 182 
 183   // We know sp/unextended_sp are safe only fp is questionable here
 184 
 185   // If the current frame is known to the code cache then we can attempt to
 186   // to construct the sender and do some validation of it. This goes a long way
 187   // toward eliminating issues when we get in frame construction code
 188 
 189   if (_cb != NULL ) {
 190 
 191     // First check if frame is complete and tester is reliable
 192     // Unfortunately we can only check frame complete for runtime stubs and nmethod
 193     // other generic buffer blobs are more problematic so we just assume they are
 194     // ok. adapter blobs never have a frame complete and are never ok.
 195 
 196     if (!_cb->is_frame_complete_at(_pc)) {
 197       if (_cb->is_nmethod() || _cb->is_adapter_blob() || _cb->is_runtime_stub()) {
 198         return false;
 199       }
 200     }
 201 
 202     // Entry frame checks
 203     if (is_entry_frame()) {
 204       // an entry frame must have a valid fp.
 205 
 206       if (!fp_safe) {
 207         return false;
 208       }
 209 
 210       // Validate the JavaCallWrapper an entry frame must have
 211 
 212       address jcw = (address)entry_frame_call_wrapper();
 213 
 214       bool jcw_safe = (jcw <= thread->stack_base()) && ( jcw > _FP);
 215 
 216       return jcw_safe;
 217 
 218     }
 219 
 220     intptr_t* younger_sp = sp();
 221     intptr_t* _SENDER_SP = sender_sp(); // sender is actually just _FP
 222     bool adjusted_stack = is_interpreted_frame();
 223 
 224     address   sender_pc = (address)younger_sp[I7->sp_offset_in_saved_window()] + pc_return_offset;
 225 
 226 
 227     // We must always be able to find a recognizable pc
 228     CodeBlob* sender_blob = CodeCache::find_blob_unsafe(sender_pc);
 229     if (sender_pc == NULL ||  sender_blob == NULL) {
 230       return false;
 231     }
 232 
 233     // It should be safe to construct the sender though it might not be valid
 234 
 235     frame sender(_SENDER_SP, younger_sp, adjusted_stack);
 236 
 237     // Do we have a valid fp?
 238     address sender_fp = (address) sender.fp();
 239 
 240     // an fp must be within the stack and above (but not equal) current frame's _FP
 241 
 242     bool sender_fp_safe = (sender_fp <= thread->stack_base()) &&
 243                    (sender_fp > _FP);
 244 
 245     if (!sender_fp_safe) {
 246       return false;
 247     }
 248 
 249 
 250     // If the potential sender is the interpreter then we can do some more checking
 251     if (Interpreter::contains(sender_pc)) {
 252       return sender.is_interpreted_frame_valid(thread);
 253     }
 254 
 255     // Could just be some random pointer within the codeBlob
 256     if (!sender.cb()->instructions_contains(sender_pc)) return false;
 257 
 258     // We should never be able to see an adapter if the current frame is something from code cache
 259 
 260     if ( sender_blob->is_adapter_blob()) {
 261       return false;
 262     }
 263 
 264     if( sender.is_entry_frame()) {
 265       // Validate the JavaCallWrapper an entry frame must have
 266 
 267       address jcw = (address)sender.entry_frame_call_wrapper();
 268 
 269       bool jcw_safe = (jcw <= thread->stack_base()) && ( jcw > sender_fp);
 270 
 271       return jcw_safe;
 272     }
 273 
 274     // If the frame size is 0 something is bad because every nmethod has a non-zero frame size
 275     // because you must allocate window space
 276 
 277     if (sender_blob->frame_size() == 0) {
 278       assert(!sender_blob->is_nmethod(), "should count return address at least");
 279       return false;
 280     }
 281 
 282     // The sender should positively be an nmethod or call_stub. On sparc we might in fact see something else.
 283     // The cause of this is because at a save instruction the O7 we get is a leftover from an earlier
 284     // window use. So if a runtime stub creates two frames (common in fastdebug/jvmg) then we see the
 285     // stale pc. So if the sender blob is not something we'd expect we have little choice but to declare
 286     // the stack unwalkable. pd_get_top_frame_for_signal_handler tries to recover from this by unwinding
 287     // that initial frame and retrying.
 288 
 289     if (!sender_blob->is_nmethod()) {
 290       return false;
 291     }
 292 
 293     // Could put some more validation for the potential non-interpreted sender
 294     // frame we'd create by calling sender if I could think of any. Wait for next crash in forte...
 295 
 296     // One idea is seeing if the sender_pc we have is one that we'd expect to call to current cb
 297 
 298     // We've validated the potential sender that would be created
 299 
 300     return true;
 301 
 302   }
 303 
 304   // Must be native-compiled frame. Since sender will try and use fp to find
 305   // linkages it must be safe
 306 
 307   if (!fp_safe) return false;
 308 
 309   // could try and do some more potential verification of native frame if we could think of some...
 310 
 311   return true;
 312 }
 313 
 314 // constructors
 315 
 316 // Construct an unpatchable, deficient frame
 317 frame::frame(intptr_t* sp, unpatchable_t, address pc, CodeBlob* cb) {
 318 #ifdef _LP64
 319   assert( (((intptr_t)sp & (wordSize-1)) == 0), "frame constructor passed an invalid sp");
 320 #endif
 321   _sp = sp;
 322   _younger_sp = NULL;
 323   _pc = pc;
 324   _cb = cb;
 325   _sp_adjustment_by_callee = 0;
 326   assert(pc == NULL && cb == NULL || pc != NULL, "can't have a cb and no pc!");
 327   if (_cb == NULL && _pc != NULL ) {
 328     _cb = CodeCache::find_blob(_pc);
 329   }
 330   _deopt_state = unknown;
 331 #ifdef ASSERT
 332   if ( _cb != NULL && _cb->is_nmethod()) {
 333     // Without a valid unextended_sp() we can't convert the pc to "original"
 334     assert(!((nmethod*)_cb)->is_deopt_pc(_pc), "invariant broken");
 335   }
 336 #endif // ASSERT
 337 }
 338 
 339 frame::frame(intptr_t* sp, intptr_t* younger_sp, bool younger_frame_adjusted_stack) {
 340   _sp = sp;
 341   _younger_sp = younger_sp;


 342   if (younger_sp == NULL) {
 343     // make a deficient frame which doesn't know where its PC is
 344     _pc = NULL;
 345     _cb = NULL;
 346   } else {
 347     _pc = (address)younger_sp[I7->sp_offset_in_saved_window()] + pc_return_offset;
 348     assert( (intptr_t*)younger_sp[FP->sp_offset_in_saved_window()] == (intptr_t*)((intptr_t)sp - STACK_BIAS), "younger_sp must be valid");
 349     // Any frame we ever build should always "safe" therefore we should not have to call
 350     // find_blob_unsafe
 351     // In case of native stubs, the pc retrieved here might be
 352     // wrong.  (the _last_native_pc will have the right value)
 353     // So do not put add any asserts on the _pc here.
 354   }
 355   if (younger_frame_adjusted_stack) {
 356     // compute adjustment to this frame's SP made by its interpreted callee
 357     _sp_adjustment_by_callee = (intptr_t*)((intptr_t)younger_sp[I5_savedSP->sp_offset_in_saved_window()] +
 358                                              STACK_BIAS) - sp;
 359   } else {
 360     _sp_adjustment_by_callee = 0;









 361   }
 362 
 363   _deopt_state = unknown;



 364 
 365   // It is important that frame be fully construct when we do this lookup
 366   // as get_original_pc() needs correct value for unextended_sp()

 367   if (_pc != NULL) {
 368     _cb = CodeCache::find_blob(_pc);
 369     address original_pc = nmethod::get_deopt_original_pc(this);
 370     if (original_pc != NULL) {
 371       _pc = original_pc;
 372       _deopt_state = is_deoptimized;
 373     } else {
 374       _deopt_state = not_deoptimized;
 375     }
 376   }
 377 }
 378 
 379 bool frame::is_interpreted_frame() const  {
 380   return Interpreter::contains(pc());
 381 }
 382 
 383 // sender_sp
 384 
 385 intptr_t* frame::interpreter_frame_sender_sp() const {
 386   assert(is_interpreted_frame(), "interpreted frame expected");
 387   return fp();
 388 }
 389 
 390 #ifndef CC_INTERP
 391 void frame::set_interpreter_frame_sender_sp(intptr_t* sender_sp) {
 392   assert(is_interpreted_frame(), "interpreted frame expected");
 393   Unimplemented();
 394 }
 395 #endif // CC_INTERP
 396 
 397 
 398 #ifdef ASSERT
 399 // Debugging aid
 400 static frame nth_sender(int n) {
 401   frame f = JavaThread::current()->last_frame();
 402 
 403   for(int i = 0; i < n; ++i)
 404     f = f.sender((RegisterMap*)NULL);
 405 
 406   printf("first frame %d\n",          f.is_first_frame()       ? 1 : 0);
 407   printf("interpreted frame %d\n",    f.is_interpreted_frame() ? 1 : 0);
 408   printf("java frame %d\n",           f.is_java_frame()        ? 1 : 0);
 409   printf("entry frame %d\n",          f.is_entry_frame()       ? 1 : 0);
 410   printf("native frame %d\n",         f.is_native_frame()      ? 1 : 0);
 411   if (f.is_compiled_frame()) {
 412     if (f.is_deoptimized_frame())
 413       printf("deoptimized frame 1\n");
 414     else
 415       printf("compiled frame 1\n");
 416   }
 417 
 418   return f;
 419 }
 420 #endif
 421 
 422 
 423 frame frame::sender_for_entry_frame(RegisterMap *map) const {
 424   assert(map != NULL, "map must be set");
 425   // Java frame called from C; skip all C frames and return top C
 426   // frame of that chunk as the sender
 427   JavaFrameAnchor* jfa = entry_frame_call_wrapper()->anchor();
 428   assert(!entry_frame_is_first(), "next Java fp must be non zero");
 429   assert(jfa->last_Java_sp() > _sp, "must be above this frame on stack");
 430   intptr_t* last_Java_sp = jfa->last_Java_sp();
 431   // Since we are walking the stack now this nested anchor is obviously walkable
 432   // even if it wasn't when it was stacked.
 433   if (!jfa->walkable()) {
 434     // Capture _last_Java_pc (if needed) and mark anchor walkable.
 435     jfa->capture_last_Java_pc(_sp);
 436   }
 437   assert(jfa->last_Java_pc() != NULL, "No captured pc!");
 438   map->clear();
 439   map->make_integer_regs_unsaved();
 440   map->shift_window(last_Java_sp, NULL);
 441   assert(map->include_argument_oops(), "should be set by clear");
 442   return frame(last_Java_sp, frame::unpatchable, jfa->last_Java_pc());
 443 }
 444 
 445 frame frame::sender_for_interpreter_frame(RegisterMap *map) const {
 446   ShouldNotCallThis();
 447   return sender(map);
 448 }
 449 
 450 frame frame::sender_for_compiled_frame(RegisterMap *map) const {
 451   ShouldNotCallThis();
 452   return sender(map);
 453 }
 454 
 455 frame frame::sender(RegisterMap* map) const {
 456   assert(map != NULL, "map must be set");
 457 
 458   assert(CodeCache::find_blob_unsafe(_pc) == _cb, "inconsistent");
 459 
 460   // Default is not to follow arguments; update it accordingly below
 461   map->set_include_argument_oops(false);
 462 
 463   if (is_entry_frame()) return sender_for_entry_frame(map);
 464 
 465   intptr_t* younger_sp     = sp();
 466   intptr_t* sp             = sender_sp();
 467   bool      adjusted_stack = false;
 468 
 469   // Note:  The version of this operation on any platform with callee-save
 470   //        registers must update the register map (if not null).
 471   //        In order to do this correctly, the various subtypes of
 472   //        of frame (interpreted, compiled, glue, native),
 473   //        must be distinguished.  There is no need on SPARC for
 474   //        such distinctions, because all callee-save registers are
 475   //        preserved for all frames via SPARC-specific mechanisms.
 476   //
 477   //        *** HOWEVER, *** if and when we make any floating-point
 478   //        registers callee-saved, then we will have to copy over
 479   //        the RegisterMap update logic from the Intel code.
 480 
 481   // The constructor of the sender must know whether this frame is interpreted so it can set the
 482   // sender's _sp_adjustment_by_callee field.  An osr adapter frame was originally
 483   // interpreted but its pc is in the code cache (for c1 -> osr_frame_return_id stub), so it must be
 484   // explicitly recognized.
 485 
 486   adjusted_stack = is_interpreted_frame();
 487   if (adjusted_stack) {
 488     map->make_integer_regs_unsaved();
 489     map->shift_window(sp, younger_sp);
 490   } else if (_cb != NULL) {
 491     // Update the locations of implicitly saved registers to be their
 492     // addresses in the register save area.
 493     // For %o registers, the addresses of %i registers in the next younger
 494     // frame are used.
 495     map->shift_window(sp, younger_sp);
 496     if (map->update_map()) {
 497       // Tell GC to use argument oopmaps for some runtime stubs that need it.
 498       // For C1, the runtime stub might not have oop maps, so set this flag
 499       // outside of update_register_map.
 500       map->set_include_argument_oops(_cb->caller_must_gc_arguments(map->thread()));
 501       if (_cb->oop_maps() != NULL) {
 502         OopMapSet::update_register_map(this, map);
 503       }
 504     }
 505   }
 506   return frame(sp, younger_sp, adjusted_stack);
 507 }
 508 
 509 
 510 void frame::patch_pc(Thread* thread, address pc) {
 511   if(thread == Thread::current()) {
 512    StubRoutines::Sparc::flush_callers_register_windows_func()();
 513   }
 514   if (TracePcPatching) {
 515     // QQQ this assert is invalid (or too strong anyway) sice _pc could
 516     // be original pc and frame could have the deopt pc.
 517     // assert(_pc == *O7_addr() + pc_return_offset, "frame has wrong pc");
 518     tty->print_cr("patch_pc at address  0x%x [0x%x -> 0x%x] ", O7_addr(), _pc, pc);
 519   }
 520   _cb = CodeCache::find_blob(pc);
 521   *O7_addr() = pc - pc_return_offset;
 522   _cb = CodeCache::find_blob(_pc);
 523   address original_pc = nmethod::get_deopt_original_pc(this);
 524   if (original_pc != NULL) {
 525     assert(original_pc == _pc, "expected original to be stored before patching");
 526     _deopt_state = is_deoptimized;
 527   } else {
 528     _deopt_state = not_deoptimized;
 529   }
 530 }
 531 
 532 
 533 static bool sp_is_valid(intptr_t* old_sp, intptr_t* young_sp, intptr_t* sp) {
 534   return (((intptr_t)sp & (2*wordSize-1)) == 0 &&
 535           sp <= old_sp &&
 536           sp >= young_sp);
 537 }
 538 
 539 
 540 /*
 541   Find the (biased) sp that is just younger than old_sp starting at sp.
 542   If not found return NULL. Register windows are assumed to be flushed.
 543 */
 544 intptr_t* frame::next_younger_sp_or_null(intptr_t* old_sp, intptr_t* sp) {
 545 
 546   intptr_t* previous_sp = NULL;
 547   intptr_t* orig_sp = sp;
 548 
 549   int max_frames = (old_sp - sp) / 16; // Minimum frame size is 16
 550   int max_frame2 = max_frames;
 551   while(sp != old_sp && sp_is_valid(old_sp, orig_sp, sp)) {
 552     if (max_frames-- <= 0)
 553       // too many frames have gone by; invalid parameters given to this function
 554       break;
 555     previous_sp = sp;
 556     sp = (intptr_t*)sp[FP->sp_offset_in_saved_window()];
 557     sp = (intptr_t*)((intptr_t)sp + STACK_BIAS);
 558   }
 559 
 560   return (sp == old_sp ? previous_sp : NULL);
 561 }
 562 
 563 /*
 564   Determine if "sp" is a valid stack pointer. "sp" is assumed to be younger than
 565   "valid_sp". So if "sp" is valid itself then it should be possible to walk frames
 566   from "sp" to "valid_sp". The assumption is that the registers windows for the
 567   thread stack in question are flushed.
 568 */
 569 bool frame::is_valid_stack_pointer(intptr_t* valid_sp, intptr_t* sp) {
 570   return next_younger_sp_or_null(valid_sp, sp) != NULL;
 571 }
 572 
 573 
 574 bool frame::interpreter_frame_equals_unpacked_fp(intptr_t* fp) {
 575   assert(is_interpreted_frame(), "must be interpreter frame");
 576   return this->fp() == fp;
 577 }
 578 
 579 
 580 void frame::pd_gc_epilog() {
 581   if (is_interpreted_frame()) {
 582     // set constant pool cache entry for interpreter
 583     methodOop m = interpreter_frame_method();
 584 
 585     *interpreter_frame_cpoolcache_addr() = m->constants()->cache();
 586   }
 587 }
 588 
 589 
 590 bool frame::is_interpreted_frame_valid(JavaThread* thread) const {
 591 #ifdef CC_INTERP
 592   // Is there anything to do?
 593 #else
 594   assert(is_interpreted_frame(), "Not an interpreted frame");
 595   // These are reasonable sanity checks
 596   if (fp() == 0 || (intptr_t(fp()) & (2*wordSize-1)) != 0) {
 597     return false;
 598   }
 599   if (sp() == 0 || (intptr_t(sp()) & (2*wordSize-1)) != 0) {
 600     return false;
 601   }
 602 
 603   const intptr_t interpreter_frame_initial_sp_offset = interpreter_frame_vm_local_words;
 604   if (fp() + interpreter_frame_initial_sp_offset < sp()) {
 605     return false;
 606   }
 607   // These are hacks to keep us out of trouble.
 608   // The problem with these is that they mask other problems
 609   if (fp() <= sp()) {        // this attempts to deal with unsigned comparison above
 610     return false;
 611   }
 612   // do some validation of frame elements
 613 
 614   // first the method
 615 
 616   methodOop m = *interpreter_frame_method_addr();
 617 
 618   // validate the method we'd find in this potential sender
 619   if (!Universe::heap()->is_valid_method(m)) return false;
 620 
 621   // stack frames shouldn't be much larger than max_stack elements
 622 
 623   if (fp() - sp() > 1024 + m->max_stack()*Interpreter::stackElementSize()) {
 624     return false;
 625   }
 626 
 627   // validate bci/bcx
 628 
 629   intptr_t  bcx    = interpreter_frame_bcx();
 630   if (m->validate_bci_from_bcx(bcx) < 0) {
 631     return false;
 632   }
 633 
 634   // validate constantPoolCacheOop
 635 
 636   constantPoolCacheOop cp = *interpreter_frame_cache_addr();
 637 
 638   if (cp == NULL ||
 639       !Space::is_aligned(cp) ||
 640       !Universe::heap()->is_permanent((void*)cp)) return false;
 641 
 642   // validate locals
 643 
 644   address locals =  (address) *interpreter_frame_locals_addr();
 645 
 646   if (locals > thread->stack_base() || locals < (address) fp()) return false;
 647 
 648   // We'd have to be pretty unlucky to be mislead at this point
 649 #endif /* CC_INTERP */
 650   return true;
 651 }
 652 
 653 
 654 // Windows have been flushed on entry (but not marked). Capture the pc that
 655 // is the return address to the frame that contains "sp" as its stack pointer.
 656 // This pc resides in the called of the frame corresponding to "sp".
 657 // As a side effect we mark this JavaFrameAnchor as having flushed the windows.
 658 // This side effect lets us mark stacked JavaFrameAnchors (stacked in the
 659 // call_helper) as flushed when we have flushed the windows for the most
 660 // recent (i.e. current) JavaFrameAnchor. This saves useless flushing calls
 661 // and lets us find the pc just once rather than multiple times as it did
 662 // in the bad old _post_Java_state days.
 663 //
 664 void JavaFrameAnchor::capture_last_Java_pc(intptr_t* sp) {
 665   if (last_Java_sp() != NULL && last_Java_pc() == NULL) {
 666     // try and find the sp just younger than _last_Java_sp
 667     intptr_t* _post_Java_sp = frame::next_younger_sp_or_null(last_Java_sp(), sp);
 668     // Really this should never fail otherwise VM call must have non-standard
 669     // frame linkage (bad) or stack is not properly flushed (worse).
 670     guarantee(_post_Java_sp != NULL, "bad stack!");
 671     _last_Java_pc = (address) _post_Java_sp[ I7->sp_offset_in_saved_window()] + frame::pc_return_offset;
 672 
 673   }
 674   set_window_flushed();
 675 }
 676 
 677 void JavaFrameAnchor::make_walkable(JavaThread* thread) {
 678   if (walkable()) return;
 679   // Eventually make an assert
 680   guarantee(Thread::current() == (Thread*)thread, "only current thread can flush its registers");
 681   // We always flush in case the profiler wants it but we won't mark
 682   // the windows as flushed unless we have a last_Java_frame
 683   intptr_t* sp = StubRoutines::Sparc::flush_callers_register_windows_func()();
 684   if (last_Java_sp() != NULL ) {
 685     capture_last_Java_pc(sp);
 686   }
 687 }
 688 
 689 intptr_t* frame::entry_frame_argument_at(int offset) const {
 690   // convert offset to index to deal with tsi
 691   int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize);
 692 
 693   intptr_t* LSP = (intptr_t*) sp()[Lentry_args->sp_offset_in_saved_window()];
 694   return &LSP[index+1];
 695 }
 696 
 697 
 698 BasicType frame::interpreter_frame_result(oop* oop_result, jvalue* value_result) {
 699   assert(is_interpreted_frame(), "interpreted frame expected");
 700   methodOop method = interpreter_frame_method();
 701   BasicType type = method->result_type();
 702 
 703   if (method->is_native()) {
 704     // Prior to notifying the runtime of the method_exit the possible result
 705     // value is saved to l_scratch and d_scratch.
 706 
 707 #ifdef CC_INTERP
 708     interpreterState istate = get_interpreterState();
 709     intptr_t* l_scratch = (intptr_t*) &istate->_native_lresult;
 710     intptr_t* d_scratch = (intptr_t*) &istate->_native_fresult;
 711 #else /* CC_INTERP */
 712     intptr_t* l_scratch = fp() + interpreter_frame_l_scratch_fp_offset;
 713     intptr_t* d_scratch = fp() + interpreter_frame_d_scratch_fp_offset;
 714 #endif /* CC_INTERP */
 715 
 716     address l_addr = (address)l_scratch;
 717 #ifdef _LP64
 718     // On 64-bit the result for 1/8/16/32-bit result types is in the other
 719     // word half
 720     l_addr += wordSize/2;
 721 #endif
 722 
 723     switch (type) {
 724       case T_OBJECT:
 725       case T_ARRAY: {
 726 #ifdef CC_INTERP
 727         *oop_result = istate->_oop_temp;
 728 #else
 729         oop obj = (oop) at(interpreter_frame_oop_temp_offset);
 730         assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check");
 731         *oop_result = obj;
 732 #endif // CC_INTERP
 733         break;
 734       }
 735 
 736       case T_BOOLEAN : { jint* p = (jint*)l_addr; value_result->z = (jboolean)((*p) & 0x1); break; }
 737       case T_BYTE    : { jint* p = (jint*)l_addr; value_result->b = (jbyte)((*p) & 0xff); break; }
 738       case T_CHAR    : { jint* p = (jint*)l_addr; value_result->c = (jchar)((*p) & 0xffff); break; }
 739       case T_SHORT   : { jint* p = (jint*)l_addr; value_result->s = (jshort)((*p) & 0xffff); break; }
 740       case T_INT     : value_result->i = *(jint*)l_addr; break;
 741       case T_LONG    : value_result->j = *(jlong*)l_scratch; break;
 742       case T_FLOAT   : value_result->f = *(jfloat*)d_scratch; break;
 743       case T_DOUBLE  : value_result->d = *(jdouble*)d_scratch; break;
 744       case T_VOID    : /* Nothing to do */ break;
 745       default        : ShouldNotReachHere();
 746     }
 747   } else {
 748     intptr_t* tos_addr = interpreter_frame_tos_address();
 749 
 750     switch(type) {
 751       case T_OBJECT:
 752       case T_ARRAY: {
 753         oop obj = (oop)*tos_addr;
 754         assert(obj == NULL || Universe::heap()->is_in(obj), "sanity check");
 755         *oop_result = obj;
 756         break;
 757       }
 758       case T_BOOLEAN : { jint* p = (jint*)tos_addr; value_result->z = (jboolean)((*p) & 0x1); break; }
 759       case T_BYTE    : { jint* p = (jint*)tos_addr; value_result->b = (jbyte)((*p) & 0xff); break; }
 760       case T_CHAR    : { jint* p = (jint*)tos_addr; value_result->c = (jchar)((*p) & 0xffff); break; }
 761       case T_SHORT   : { jint* p = (jint*)tos_addr; value_result->s = (jshort)((*p) & 0xffff); break; }
 762       case T_INT     : value_result->i = *(jint*)tos_addr; break;
 763       case T_LONG    : value_result->j = *(jlong*)tos_addr; break;
 764       case T_FLOAT   : value_result->f = *(jfloat*)tos_addr; break;
 765       case T_DOUBLE  : value_result->d = *(jdouble*)tos_addr; break;
 766       case T_VOID    : /* Nothing to do */ break;
 767       default        : ShouldNotReachHere();
 768     }
 769   };
 770 
 771   return type;
 772 }
 773 
 774 // Lesp pointer is one word lower than the top item on the stack.
 775 intptr_t* frame::interpreter_frame_tos_at(jint offset) const {
 776   int index = (Interpreter::expr_offset_in_bytes(offset)/wordSize) - 1;
 777   return &interpreter_frame_tos_address()[index];
 778 }
--- EOF ---