1 /*
   2  * Copyright (c) 1997, 2015, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "code/codeCache.hpp"
  27 #include "code/vmreg.inline.hpp"
  28 #include "compiler/abstractCompiler.hpp"
  29 #include "compiler/disassembler.hpp"
  30 #include "gc/shared/collectedHeap.inline.hpp"
  31 #include "interpreter/interpreter.hpp"
  32 #include "interpreter/oopMapCache.hpp"
  33 #include "memory/resourceArea.hpp"
  34 #include "memory/universe.inline.hpp"
  35 #include "oops/markOop.hpp"
  36 #include "oops/method.hpp"
  37 #include "oops/methodData.hpp"
  38 #include "oops/oop.inline.hpp"
  39 #include "oops/verifyOopClosure.hpp"
  40 #include "prims/methodHandles.hpp"
  41 #include "runtime/frame.inline.hpp"
  42 #include "runtime/handles.inline.hpp"
  43 #include "runtime/javaCalls.hpp"
  44 #include "runtime/monitorChunk.hpp"
  45 #include "runtime/os.hpp"
  46 #include "runtime/sharedRuntime.hpp"
  47 #include "runtime/signature.hpp"
  48 #include "runtime/stubCodeGenerator.hpp"
  49 #include "runtime/stubRoutines.hpp"
  50 #include "runtime/thread.inline.hpp"
  51 #include "utilities/decoder.hpp"
  52 
  53 RegisterMap::RegisterMap(JavaThread *thread, bool update_map) {
  54   _thread         = thread;
  55   _update_map     = update_map;
  56   clear();
  57   debug_only(_update_for_id = NULL;)
  58 #ifndef PRODUCT
  59   for (int i = 0; i < reg_count ; i++ ) _location[i] = NULL;
  60 #endif /* PRODUCT */
  61 }
  62 
  63 RegisterMap::RegisterMap(const RegisterMap* map) {
  64   assert(map != this, "bad initialization parameter");
  65   assert(map != NULL, "RegisterMap must be present");
  66   _thread                = map->thread();
  67   _update_map            = map->update_map();
  68   _include_argument_oops = map->include_argument_oops();
  69   debug_only(_update_for_id = map->_update_for_id;)
  70   pd_initialize_from(map);
  71   if (update_map()) {
  72     for(int i = 0; i < location_valid_size; i++) {
  73       LocationValidType bits = !update_map() ? 0 : map->_location_valid[i];
  74       _location_valid[i] = bits;
  75       // for whichever bits are set, pull in the corresponding map->_location
  76       int j = i*location_valid_type_size;
  77       while (bits != 0) {
  78         if ((bits & 1) != 0) {
  79           assert(0 <= j && j < reg_count, "range check");
  80           _location[j] = map->_location[j];
  81         }
  82         bits >>= 1;
  83         j += 1;
  84       }
  85     }
  86   }
  87 }
  88 
  89 void RegisterMap::clear() {
  90   set_include_argument_oops(true);
  91   if (_update_map) {
  92     for(int i = 0; i < location_valid_size; i++) {
  93       _location_valid[i] = 0;
  94     }
  95     pd_clear();
  96   } else {
  97     pd_initialize();
  98   }
  99 }
 100 
 101 #ifndef PRODUCT
 102 
 103 void RegisterMap::print_on(outputStream* st) const {
 104   st->print_cr("Register map");
 105   for(int i = 0; i < reg_count; i++) {
 106 
 107     VMReg r = VMRegImpl::as_VMReg(i);
 108     intptr_t* src = (intptr_t*) location(r);
 109     if (src != NULL) {
 110 
 111       r->print_on(st);
 112       st->print(" [" INTPTR_FORMAT "] = ", p2i(src));
 113       if (((uintptr_t)src & (sizeof(*src)-1)) != 0) {
 114         st->print_cr("<misaligned>");
 115       } else {
 116         st->print_cr(INTPTR_FORMAT, *src);
 117       }
 118     }
 119   }
 120 }
 121 
 122 void RegisterMap::print() const {
 123   print_on(tty);
 124 }
 125 
 126 #endif
 127 // This returns the pc that if you were in the debugger you'd see. Not
 128 // the idealized value in the frame object. This undoes the magic conversion
 129 // that happens for deoptimized frames. In addition it makes the value the
 130 // hardware would want to see in the native frame. The only user (at this point)
 131 // is deoptimization. It likely no one else should ever use it.
 132 
 133 address frame::raw_pc() const {
 134   if (is_deoptimized_frame()) {
 135     nmethod* nm = cb()->as_nmethod_or_null();
 136     if (nm->is_method_handle_return(pc()))
 137       return nm->deopt_mh_handler_begin() - pc_return_offset;
 138     else
 139       return nm->deopt_handler_begin() - pc_return_offset;
 140   } else {
 141     return (pc() - pc_return_offset);
 142   }
 143 }
 144 
 145 // Change the pc in a frame object. This does not change the actual pc in
 146 // actual frame. To do that use patch_pc.
 147 //
 148 void frame::set_pc(address   newpc ) {
 149 #ifdef ASSERT
 150   if (_cb != NULL && _cb->is_nmethod()) {
 151     assert(!((nmethod*)_cb)->is_deopt_pc(_pc), "invariant violation");
 152   }
 153 #endif // ASSERT
 154 
 155   // Unsafe to use the is_deoptimzed tester after changing pc
 156   _deopt_state = unknown;
 157   _pc = newpc;
 158   _cb = CodeCache::find_blob_unsafe(_pc);
 159 
 160 }
 161 
 162 // type testers
 163 bool frame::is_ignored_frame() const {
 164   return false;  // FIXME: some LambdaForm frames should be ignored
 165 }
 166 bool frame::is_deoptimized_frame() const {
 167   assert(_deopt_state != unknown, "not answerable");
 168   return _deopt_state == is_deoptimized;
 169 }
 170 
 171 bool frame::is_native_frame() const {
 172   return (_cb != NULL &&
 173           _cb->is_nmethod() &&
 174           ((nmethod*)_cb)->is_native_method());
 175 }
 176 
 177 bool frame::is_java_frame() const {
 178   if (is_interpreted_frame()) return true;
 179   if (is_compiled_frame())    return true;
 180   return false;
 181 }
 182 
 183 
 184 bool frame::is_compiled_frame() const {
 185   if (_cb != NULL &&
 186       _cb->is_nmethod() &&
 187       ((nmethod*)_cb)->is_java_method()) {
 188     return true;
 189   }
 190   return false;
 191 }
 192 
 193 
 194 bool frame::is_runtime_frame() const {
 195   return (_cb != NULL && _cb->is_runtime_stub());
 196 }
 197 
 198 bool frame::is_safepoint_blob_frame() const {
 199   return (_cb != NULL && _cb->is_safepoint_stub());
 200 }
 201 
 202 // testers
 203 
 204 bool frame::is_first_java_frame() const {
 205   RegisterMap map(JavaThread::current(), false); // No update
 206   frame s;
 207   for (s = sender(&map); !(s.is_java_frame() || s.is_first_frame()); s = s.sender(&map));
 208   return s.is_first_frame();
 209 }
 210 
 211 
 212 bool frame::entry_frame_is_first() const {
 213   return entry_frame_call_wrapper()->is_first_frame();
 214 }
 215 
 216 JavaCallWrapper* frame::entry_frame_call_wrapper_if_safe(JavaThread* thread) const {
 217   JavaCallWrapper** jcw = entry_frame_call_wrapper_addr();
 218   address addr = (address) jcw;
 219 
 220   // addr must be within the usable part of the stack
 221   if (thread->is_in_usable_stack(addr)) {
 222     return *jcw;
 223   }
 224 
 225   return NULL;
 226 }
 227 
 228 bool frame::should_be_deoptimized() const {
 229   if (_deopt_state == is_deoptimized ||
 230       !is_compiled_frame() ) return false;
 231   assert(_cb != NULL && _cb->is_nmethod(), "must be an nmethod");
 232   nmethod* nm = (nmethod *)_cb;
 233   if (TraceDependencies) {
 234     tty->print("checking (%s) ", nm->is_marked_for_deoptimization() ? "true" : "false");
 235     nm->print_value_on(tty);
 236     tty->cr();
 237   }
 238 
 239   if( !nm->is_marked_for_deoptimization() )
 240     return false;
 241 
 242   // If at the return point, then the frame has already been popped, and
 243   // only the return needs to be executed. Don't deoptimize here.
 244   return !nm->is_at_poll_return(pc());
 245 }
 246 
 247 bool frame::can_be_deoptimized() const {
 248   if (!is_compiled_frame()) return false;
 249   nmethod* nm = (nmethod*)_cb;
 250 
 251   if( !nm->can_be_deoptimized() )
 252     return false;
 253 
 254   return !nm->is_at_poll_return(pc());
 255 }
 256 
 257 void frame::deoptimize(JavaThread* thread) {
 258   // Schedule deoptimization of an nmethod activation with this frame.
 259   assert(_cb != NULL && _cb->is_nmethod(), "must be");
 260   nmethod* nm = (nmethod*)_cb;
 261 
 262   // This is a fix for register window patching race
 263   if (NeedsDeoptSuspend && Thread::current() != thread) {
 264     assert(SafepointSynchronize::is_at_safepoint(),
 265            "patching other threads for deopt may only occur at a safepoint");
 266 
 267     // It is possible especially with DeoptimizeALot/DeoptimizeRandom that
 268     // we could see the frame again and ask for it to be deoptimized since
 269     // it might move for a long time. That is harmless and we just ignore it.
 270     if (id() == thread->must_deopt_id()) {
 271       assert(thread->is_deopt_suspend(), "lost suspension");
 272       return;
 273     }
 274 
 275     // We are at a safepoint so the target thread can only be
 276     // in 4 states:
 277     //     blocked - no problem
 278     //     blocked_trans - no problem (i.e. could have woken up from blocked
 279     //                                 during a safepoint).
 280     //     native - register window pc patching race
 281     //     native_trans - momentary state
 282     //
 283     // We could just wait out a thread in native_trans to block.
 284     // Then we'd have all the issues that the safepoint code has as to
 285     // whether to spin or block. It isn't worth it. Just treat it like
 286     // native and be done with it.
 287     //
 288     // Examine the state of the thread at the start of safepoint since
 289     // threads that were in native at the start of the safepoint could
 290     // come to a halt during the safepoint, changing the current value
 291     // of the safepoint_state.
 292     JavaThreadState state = thread->safepoint_state()->orig_thread_state();
 293     if (state == _thread_in_native || state == _thread_in_native_trans) {
 294       // Since we are at a safepoint the target thread will stop itself
 295       // before it can return to java as long as we remain at the safepoint.
 296       // Therefore we can put an additional request for the thread to stop
 297       // no matter what no (like a suspend). This will cause the thread
 298       // to notice it needs to do the deopt on its own once it leaves native.
 299       //
 300       // The only reason we must do this is because on machine with register
 301       // windows we have a race with patching the return address and the
 302       // window coming live as the thread returns to the Java code (but still
 303       // in native mode) and then blocks. It is only this top most frame
 304       // that is at risk. So in truth we could add an additional check to
 305       // see if this frame is one that is at risk.
 306       RegisterMap map(thread, false);
 307       frame at_risk =  thread->last_frame().sender(&map);
 308       if (id() == at_risk.id()) {
 309         thread->set_must_deopt_id(id());
 310         thread->set_deopt_suspend();
 311         return;
 312       }
 313     }
 314   } // NeedsDeoptSuspend
 315 
 316 
 317   // If the call site is a MethodHandle call site use the MH deopt
 318   // handler.
 319   address deopt = nm->is_method_handle_return(pc()) ?
 320     nm->deopt_mh_handler_begin() :
 321     nm->deopt_handler_begin();
 322 
 323   // Save the original pc before we patch in the new one
 324   nm->set_original_pc(this, pc());
 325   patch_pc(thread, deopt);
 326 
 327 #ifdef ASSERT
 328   {
 329     RegisterMap map(thread, false);
 330     frame check = thread->last_frame();
 331     while (id() != check.id()) {
 332       check = check.sender(&map);
 333     }
 334     assert(check.is_deoptimized_frame(), "missed deopt");
 335   }
 336 #endif // ASSERT
 337 }
 338 
 339 frame frame::java_sender() const {
 340   RegisterMap map(JavaThread::current(), false);
 341   frame s;
 342   for (s = sender(&map); !(s.is_java_frame() || s.is_first_frame()); s = s.sender(&map)) ;
 343   guarantee(s.is_java_frame(), "tried to get caller of first java frame");
 344   return s;
 345 }
 346 
 347 frame frame::real_sender(RegisterMap* map) const {
 348   frame result = sender(map);
 349   while (result.is_runtime_frame() ||
 350          result.is_ignored_frame()) {
 351     result = result.sender(map);
 352   }
 353   return result;
 354 }
 355 
 356 // Note: called by profiler - NOT for current thread
 357 frame frame::profile_find_Java_sender_frame(JavaThread *thread) {
 358 // If we don't recognize this frame, walk back up the stack until we do
 359   RegisterMap map(thread, false);
 360   frame first_java_frame = frame();
 361 
 362   // Find the first Java frame on the stack starting with input frame
 363   if (is_java_frame()) {
 364     // top frame is compiled frame or deoptimized frame
 365     first_java_frame = *this;
 366   } else if (safe_for_sender(thread)) {
 367     for (frame sender_frame = sender(&map);
 368       sender_frame.safe_for_sender(thread) && !sender_frame.is_first_frame();
 369       sender_frame = sender_frame.sender(&map)) {
 370       if (sender_frame.is_java_frame()) {
 371         first_java_frame = sender_frame;
 372         break;
 373       }
 374     }
 375   }
 376   return first_java_frame;
 377 }
 378 
 379 // Interpreter frames
 380 
 381 
 382 void frame::interpreter_frame_set_locals(intptr_t* locs)  {
 383   assert(is_interpreted_frame(), "Not an interpreted frame");
 384   *interpreter_frame_locals_addr() = locs;
 385 }
 386 
 387 Method* frame::interpreter_frame_method() const {
 388   assert(is_interpreted_frame(), "interpreted frame expected");
 389   Method* m = *interpreter_frame_method_addr();
 390   assert(m->is_method(), "not a Method*");
 391   return m;
 392 }
 393 
 394 void frame::interpreter_frame_set_method(Method* method) {
 395   assert(is_interpreted_frame(), "interpreted frame expected");
 396   *interpreter_frame_method_addr() = method;
 397 }
 398 
 399 jint frame::interpreter_frame_bci() const {
 400   assert(is_interpreted_frame(), "interpreted frame expected");
 401   address bcp = interpreter_frame_bcp();
 402   return interpreter_frame_method()->bci_from(bcp);
 403 }
 404 
 405 address frame::interpreter_frame_bcp() const {
 406   assert(is_interpreted_frame(), "interpreted frame expected");
 407   address bcp = (address)*interpreter_frame_bcp_addr();
 408   return interpreter_frame_method()->bcp_from(bcp);
 409 }
 410 
 411 void frame::interpreter_frame_set_bcp(address bcp) {
 412   assert(is_interpreted_frame(), "interpreted frame expected");
 413   *interpreter_frame_bcp_addr() = (intptr_t)bcp;
 414 }
 415 
 416 address frame::interpreter_frame_mdp() const {
 417   assert(ProfileInterpreter, "must be profiling interpreter");
 418   assert(is_interpreted_frame(), "interpreted frame expected");
 419   return (address)*interpreter_frame_mdp_addr();
 420 }
 421 
 422 void frame::interpreter_frame_set_mdp(address mdp) {
 423   assert(is_interpreted_frame(), "interpreted frame expected");
 424   assert(ProfileInterpreter, "must be profiling interpreter");
 425   *interpreter_frame_mdp_addr() = (intptr_t)mdp;
 426 }
 427 
 428 BasicObjectLock* frame::next_monitor_in_interpreter_frame(BasicObjectLock* current) const {
 429   assert(is_interpreted_frame(), "Not an interpreted frame");
 430 #ifdef ASSERT
 431   interpreter_frame_verify_monitor(current);
 432 #endif
 433   BasicObjectLock* next = (BasicObjectLock*) (((intptr_t*) current) + interpreter_frame_monitor_size());
 434   return next;
 435 }
 436 
 437 BasicObjectLock* frame::previous_monitor_in_interpreter_frame(BasicObjectLock* current) const {
 438   assert(is_interpreted_frame(), "Not an interpreted frame");
 439 #ifdef ASSERT
 440 //   // This verification needs to be checked before being enabled
 441 //   interpreter_frame_verify_monitor(current);
 442 #endif
 443   BasicObjectLock* previous = (BasicObjectLock*) (((intptr_t*) current) - interpreter_frame_monitor_size());
 444   return previous;
 445 }
 446 
 447 // Interpreter locals and expression stack locations.
 448 
 449 intptr_t* frame::interpreter_frame_local_at(int index) const {
 450   const int n = Interpreter::local_offset_in_bytes(index)/wordSize;
 451   return &((*interpreter_frame_locals_addr())[n]);
 452 }
 453 
 454 intptr_t* frame::interpreter_frame_expression_stack_at(jint offset) const {
 455   const int i = offset * interpreter_frame_expression_stack_direction();
 456   const int n = i * Interpreter::stackElementWords;
 457   return &(interpreter_frame_expression_stack()[n]);
 458 }
 459 
 460 jint frame::interpreter_frame_expression_stack_size() const {
 461   // Number of elements on the interpreter expression stack
 462   // Callers should span by stackElementWords
 463   int element_size = Interpreter::stackElementWords;
 464   size_t stack_size = 0;
 465   if (frame::interpreter_frame_expression_stack_direction() < 0) {
 466     stack_size = (interpreter_frame_expression_stack() -
 467                   interpreter_frame_tos_address() + 1)/element_size;
 468   } else {
 469     stack_size = (interpreter_frame_tos_address() -
 470                   interpreter_frame_expression_stack() + 1)/element_size;
 471   }
 472   assert( stack_size <= (size_t)max_jint, "stack size too big");
 473   return ((jint)stack_size);
 474 }
 475 
 476 
 477 // (frame::interpreter_frame_sender_sp accessor is in frame_<arch>.cpp)
 478 
 479 const char* frame::print_name() const {
 480   if (is_native_frame())      return "Native";
 481   if (is_interpreted_frame()) return "Interpreted";
 482   if (is_compiled_frame()) {
 483     if (is_deoptimized_frame()) return "Deoptimized";
 484     return "Compiled";
 485   }
 486   if (sp() == NULL)            return "Empty";
 487   return "C";
 488 }
 489 
 490 void frame::print_value_on(outputStream* st, JavaThread *thread) const {
 491   NOT_PRODUCT(address begin = pc()-40;)
 492   NOT_PRODUCT(address end   = NULL;)
 493 
 494   st->print("%s frame (sp=" INTPTR_FORMAT " unextended sp=" INTPTR_FORMAT, print_name(), p2i(sp()), p2i(unextended_sp()));
 495   if (sp() != NULL)
 496     st->print(", fp=" INTPTR_FORMAT ", real_fp=" INTPTR_FORMAT ", pc=" INTPTR_FORMAT,
 497               p2i(fp()), p2i(real_fp()), p2i(pc()));
 498 
 499   if (StubRoutines::contains(pc())) {
 500     st->print_cr(")");
 501     st->print("(");
 502     StubCodeDesc* desc = StubCodeDesc::desc_for(pc());
 503     st->print("~Stub::%s", desc->name());
 504     NOT_PRODUCT(begin = desc->begin(); end = desc->end();)
 505   } else if (Interpreter::contains(pc())) {
 506     st->print_cr(")");
 507     st->print("(");
 508     InterpreterCodelet* desc = Interpreter::codelet_containing(pc());
 509     if (desc != NULL) {
 510       st->print("~");
 511       desc->print_on(st);
 512       NOT_PRODUCT(begin = desc->code_begin(); end = desc->code_end();)
 513     } else {
 514       st->print("~interpreter");
 515     }
 516   }
 517   st->print_cr(")");
 518 
 519   if (_cb != NULL) {
 520     st->print("     ");
 521     _cb->print_value_on(st);
 522     st->cr();
 523 #ifndef PRODUCT
 524     if (end == NULL) {
 525       begin = _cb->code_begin();
 526       end   = _cb->code_end();
 527     }
 528 #endif
 529   }
 530   NOT_PRODUCT(if (WizardMode && Verbose) Disassembler::decode(begin, end);)
 531 }
 532 
 533 
 534 void frame::print_on(outputStream* st) const {
 535   print_value_on(st,NULL);
 536   if (is_interpreted_frame()) {
 537     interpreter_frame_print_on(st);
 538   }
 539 }
 540 
 541 
 542 void frame::interpreter_frame_print_on(outputStream* st) const {
 543 #ifndef PRODUCT
 544   assert(is_interpreted_frame(), "Not an interpreted frame");
 545   jint i;
 546   for (i = 0; i < interpreter_frame_method()->max_locals(); i++ ) {
 547     intptr_t x = *interpreter_frame_local_at(i);
 548     st->print(" - local  [" INTPTR_FORMAT "]", x);
 549     st->fill_to(23);
 550     st->print_cr("; #%d", i);
 551   }
 552   for (i = interpreter_frame_expression_stack_size() - 1; i >= 0; --i ) {
 553     intptr_t x = *interpreter_frame_expression_stack_at(i);
 554     st->print(" - stack  [" INTPTR_FORMAT "]", x);
 555     st->fill_to(23);
 556     st->print_cr("; #%d", i);
 557   }
 558   // locks for synchronization
 559   for (BasicObjectLock* current = interpreter_frame_monitor_end();
 560        current < interpreter_frame_monitor_begin();
 561        current = next_monitor_in_interpreter_frame(current)) {
 562     st->print(" - obj    [");
 563     current->obj()->print_value_on(st);
 564     st->print_cr("]");
 565     st->print(" - lock   [");
 566     current->lock()->print_on(st);
 567     st->print_cr("]");
 568   }
 569   // monitor
 570   st->print_cr(" - monitor[" INTPTR_FORMAT "]", p2i(interpreter_frame_monitor_begin()));
 571   // bcp
 572   st->print(" - bcp    [" INTPTR_FORMAT "]", p2i(interpreter_frame_bcp()));
 573   st->fill_to(23);
 574   st->print_cr("; @%d", interpreter_frame_bci());
 575   // locals
 576   st->print_cr(" - locals [" INTPTR_FORMAT "]", p2i(interpreter_frame_local_at(0)));
 577   // method
 578   st->print(" - method [" INTPTR_FORMAT "]", p2i(interpreter_frame_method()));
 579   st->fill_to(23);
 580   st->print("; ");
 581   interpreter_frame_method()->print_name(st);
 582   st->cr();
 583 #endif
 584 }
 585 
 586 // Print whether the frame is in the VM or OS indicating a HotSpot problem.
 587 // Otherwise, it's likely a bug in the native library that the Java code calls,
 588 // hopefully indicating where to submit bugs.
 589 void frame::print_C_frame(outputStream* st, char* buf, int buflen, address pc) {
 590   // C/C++ frame
 591   bool in_vm = os::address_is_in_vm(pc);
 592   st->print(in_vm ? "V" : "C");
 593 
 594   int offset;
 595   bool found;
 596 
 597   // libname
 598   found = os::dll_address_to_library_name(pc, buf, buflen, &offset);
 599   if (found) {
 600     // skip directory names
 601     const char *p1, *p2;
 602     p1 = buf;
 603     int len = (int)strlen(os::file_separator());
 604     while ((p2 = strstr(p1, os::file_separator())) != NULL) p1 = p2 + len;
 605     st->print("  [%s+0x%x]", p1, offset);
 606   } else {
 607     st->print("  " PTR_FORMAT, p2i(pc));
 608   }
 609 
 610   // function name - os::dll_address_to_function_name() may return confusing
 611   // names if pc is within jvm.dll or libjvm.so, because JVM only has
 612   // JVM_xxxx and a few other symbols in the dynamic symbol table. Do this
 613   // only for native libraries.
 614   if (!in_vm || Decoder::can_decode_C_frame_in_vm()) {
 615     found = os::dll_address_to_function_name(pc, buf, buflen, &offset);
 616 
 617     if (found) {
 618       st->print("  %s+0x%x", buf, offset);
 619     }
 620   }
 621 }
 622 
 623 // frame::print_on_error() is called by fatal error handler. Notice that we may
 624 // crash inside this function if stack frame is corrupted. The fatal error
 625 // handler can catch and handle the crash. Here we assume the frame is valid.
 626 //
 627 // First letter indicates type of the frame:
 628 //    J: Java frame (compiled)
 629 //    j: Java frame (interpreted)
 630 //    V: VM frame (C/C++)
 631 //    v: Other frames running VM generated code (e.g. stubs, adapters, etc.)
 632 //    C: C/C++ frame
 633 //
 634 // We don't need detailed frame type as that in frame::print_name(). "C"
 635 // suggests the problem is in user lib; everything else is likely a VM bug.
 636 
 637 void frame::print_on_error(outputStream* st, char* buf, int buflen, bool verbose) const {
 638   if (_cb != NULL) {
 639     if (Interpreter::contains(pc())) {
 640       Method* m = this->interpreter_frame_method();
 641       if (m != NULL) {
 642         m->name_and_sig_as_C_string(buf, buflen);
 643         st->print("j  %s", buf);
 644         st->print("+%d", this->interpreter_frame_bci());
 645       } else {
 646         st->print("j  " PTR_FORMAT, p2i(pc()));
 647       }
 648     } else if (StubRoutines::contains(pc())) {
 649       StubCodeDesc* desc = StubCodeDesc::desc_for(pc());
 650       if (desc != NULL) {
 651         st->print("v  ~StubRoutines::%s", desc->name());
 652       } else {
 653         st->print("v  ~StubRoutines::" PTR_FORMAT, p2i(pc()));
 654       }
 655     } else if (_cb->is_buffer_blob()) {
 656       st->print("v  ~BufferBlob::%s", ((BufferBlob *)_cb)->name());
 657     } else if (_cb->is_nmethod()) {
 658       nmethod* nm = (nmethod*)_cb;
 659       Method* m = nm->method();
 660       if (m != NULL) {
 661         m->name_and_sig_as_C_string(buf, buflen);
 662         st->print("J %d%s %s ",
 663                   nm->compile_id(), (nm->is_osr_method() ? "%" : ""),
 664                   ((nm->compiler() != NULL) ? nm->compiler()->name() : ""));
 665         st->print("%s (%d bytes) @ " PTR_FORMAT " [" PTR_FORMAT "+" INTPTR_FORMAT "]",
 666                   buf, m->code_size(), p2i(_pc), p2i(_cb->code_begin()), _pc - _cb->code_begin());
 667 #if INCLUDE_JVMCI
 668         char* jvmciName = nm->jvmci_installed_code_name(buf, buflen);
 669         if (jvmciName != NULL) {
 670           st->print(" (%s)", jvmciName);
 671         }
 672 #endif
 673       } else {
 674         st->print("J  " PTR_FORMAT, p2i(pc()));
 675       }
 676     } else if (_cb->is_runtime_stub()) {
 677       st->print("v  ~RuntimeStub::%s", ((RuntimeStub *)_cb)->name());
 678     } else if (_cb->is_deoptimization_stub()) {
 679       st->print("v  ~DeoptimizationBlob");
 680     } else if (_cb->is_exception_stub()) {
 681       st->print("v  ~ExceptionBlob");
 682     } else if (_cb->is_safepoint_stub()) {
 683       st->print("v  ~SafepointBlob");
 684     } else {
 685       st->print("v  blob " PTR_FORMAT, p2i(pc()));
 686     }
 687   } else {
 688     print_C_frame(st, buf, buflen, pc());
 689   }
 690 }
 691 
 692 
 693 /*
 694   The interpreter_frame_expression_stack_at method in the case of SPARC needs the
 695   max_stack value of the method in order to compute the expression stack address.
 696   It uses the Method* in order to get the max_stack value but during GC this
 697   Method* value saved on the frame is changed by reverse_and_push and hence cannot
 698   be used. So we save the max_stack value in the FrameClosure object and pass it
 699   down to the interpreter_frame_expression_stack_at method
 700 */
 701 class InterpreterFrameClosure : public OffsetClosure {
 702  private:
 703   frame* _fr;
 704   OopClosure* _f;
 705   int    _max_locals;
 706   int    _max_stack;
 707 
 708  public:
 709   InterpreterFrameClosure(frame* fr, int max_locals, int max_stack,
 710                           OopClosure* f) {
 711     _fr         = fr;
 712     _max_locals = max_locals;
 713     _max_stack  = max_stack;
 714     _f          = f;
 715   }
 716 
 717   void offset_do(int offset) {
 718     oop* addr;
 719     if (offset < _max_locals) {
 720       addr = (oop*) _fr->interpreter_frame_local_at(offset);
 721       assert((intptr_t*)addr >= _fr->sp(), "must be inside the frame");
 722       _f->do_oop(addr);
 723     } else {
 724       addr = (oop*) _fr->interpreter_frame_expression_stack_at((offset - _max_locals));
 725       // In case of exceptions, the expression stack is invalid and the esp will be reset to express
 726       // this condition. Therefore, we call f only if addr is 'inside' the stack (i.e., addr >= esp for Intel).
 727       bool in_stack;
 728       if (frame::interpreter_frame_expression_stack_direction() > 0) {
 729         in_stack = (intptr_t*)addr <= _fr->interpreter_frame_tos_address();
 730       } else {
 731         in_stack = (intptr_t*)addr >= _fr->interpreter_frame_tos_address();
 732       }
 733       if (in_stack) {
 734         _f->do_oop(addr);
 735       }
 736     }
 737   }
 738 
 739   int max_locals()  { return _max_locals; }
 740   frame* fr()       { return _fr; }
 741 };
 742 
 743 
 744 class InterpretedArgumentOopFinder: public SignatureInfo {
 745  private:
 746   OopClosure* _f;        // Closure to invoke
 747   int    _offset;        // TOS-relative offset, decremented with each argument
 748   bool   _has_receiver;  // true if the callee has a receiver
 749   frame* _fr;
 750 
 751   void set(int size, BasicType type) {
 752     _offset -= size;
 753     if (type == T_OBJECT || type == T_ARRAY || type == T_VALUETYPE) oop_offset_do();
 754   }
 755 
 756   void oop_offset_do() {
 757     oop* addr;
 758     addr = (oop*)_fr->interpreter_frame_tos_at(_offset);
 759     _f->do_oop(addr);
 760   }
 761 
 762  public:
 763   InterpretedArgumentOopFinder(Symbol* signature, bool has_receiver, frame* fr, OopClosure* f) : SignatureInfo(signature), _has_receiver(has_receiver) {
 764     // compute size of arguments
 765     int args_size = ArgumentSizeComputer(signature).size() + (has_receiver ? 1 : 0);
 766     assert(!fr->is_interpreted_frame() ||
 767            args_size <= fr->interpreter_frame_expression_stack_size(),
 768             "args cannot be on stack anymore");
 769     // initialize InterpretedArgumentOopFinder
 770     _f         = f;
 771     _fr        = fr;
 772     _offset    = args_size;
 773   }
 774 
 775   void oops_do() {
 776     if (_has_receiver) {
 777       --_offset;
 778       oop_offset_do();
 779     }
 780     iterate_parameters();
 781   }
 782 };
 783 
 784 
 785 // Entry frame has following form (n arguments)
 786 //         +-----------+
 787 //   sp -> |  last arg |
 788 //         +-----------+
 789 //         :    :::    :
 790 //         +-----------+
 791 // (sp+n)->|  first arg|
 792 //         +-----------+
 793 
 794 
 795 
 796 // visits and GC's all the arguments in entry frame
 797 class EntryFrameOopFinder: public SignatureInfo {
 798  private:
 799   bool   _is_static;
 800   int    _offset;
 801   frame* _fr;
 802   OopClosure* _f;
 803 
 804   void set(int size, BasicType type) {
 805     assert (_offset >= 0, "illegal offset");
 806     if (type == T_OBJECT || type == T_ARRAY || type == T_VALUETYPE) oop_at_offset_do(_offset);
 807     _offset -= size;
 808   }
 809 
 810   void oop_at_offset_do(int offset) {
 811     assert (offset >= 0, "illegal offset");
 812     oop* addr = (oop*) _fr->entry_frame_argument_at(offset);
 813     _f->do_oop(addr);
 814   }
 815 
 816  public:
 817    EntryFrameOopFinder(frame* frame, Symbol* signature, bool is_static) : SignatureInfo(signature) {
 818      _f = NULL; // will be set later
 819      _fr = frame;
 820      _is_static = is_static;
 821      _offset = ArgumentSizeComputer(signature).size() - 1; // last parameter is at index 0
 822    }
 823 
 824   void arguments_do(OopClosure* f) {
 825     _f = f;
 826     if (!_is_static) oop_at_offset_do(_offset+1); // do the receiver
 827     iterate_parameters();
 828   }
 829 
 830 };
 831 
 832 oop* frame::interpreter_callee_receiver_addr(Symbol* signature) {
 833   ArgumentSizeComputer asc(signature);
 834   int size = asc.size();
 835   return (oop *)interpreter_frame_tos_at(size);
 836 }
 837 
 838 
 839 void frame::oops_interpreted_do(OopClosure* f, CLDClosure* cld_f,
 840     const RegisterMap* map, bool query_oop_map_cache) {
 841   assert(is_interpreted_frame(), "Not an interpreted frame");
 842   assert(map != NULL, "map must be set");
 843   Thread *thread = Thread::current();
 844   methodHandle m (thread, interpreter_frame_method());
 845   jint      bci = interpreter_frame_bci();
 846 
 847   assert(!Universe::heap()->is_in(m()),
 848           "must be valid oop");
 849   assert(m->is_method(), "checking frame value");
 850   assert((m->is_native() && bci == 0)  ||
 851          (!m->is_native() && bci >= 0 && bci < m->code_size()),
 852          "invalid bci value");
 853 
 854   // Handle the monitor elements in the activation
 855   for (
 856     BasicObjectLock* current = interpreter_frame_monitor_end();
 857     current < interpreter_frame_monitor_begin();
 858     current = next_monitor_in_interpreter_frame(current)
 859   ) {
 860 #ifdef ASSERT
 861     interpreter_frame_verify_monitor(current);
 862 #endif
 863     current->oops_do(f);
 864   }
 865 
 866   // process fixed part
 867   if (cld_f != NULL) {
 868     // The method pointer in the frame might be the only path to the method's
 869     // klass, and the klass needs to be kept alive while executing. The GCs
 870     // don't trace through method pointers, so typically in similar situations
 871     // the mirror or the class loader of the klass are installed as a GC root.
 872     // To minimize the overhead of doing that here, we ask the GC to pass down a
 873     // closure that knows how to keep klasses alive given a ClassLoaderData.
 874     cld_f->do_cld(m->method_holder()->class_loader_data());
 875   }
 876 
 877   if (m->is_native() PPC32_ONLY(&& m->is_static())) {
 878     f->do_oop(interpreter_frame_temp_oop_addr());
 879   }
 880 
 881   int max_locals = m->is_native() ? m->size_of_parameters() : m->max_locals();
 882 
 883   Symbol* signature = NULL;
 884   bool has_receiver = false;
 885 
 886   // Process a callee's arguments if we are at a call site
 887   // (i.e., if we are at an invoke bytecode)
 888   // This is used sometimes for calling into the VM, not for another
 889   // interpreted or compiled frame.
 890   if (!m->is_native()) {
 891     Bytecode_invoke call = Bytecode_invoke_check(m, bci);
 892     if (call.is_valid()) {
 893       signature = call.signature();
 894       has_receiver = call.has_receiver();
 895       if (map->include_argument_oops() &&
 896           interpreter_frame_expression_stack_size() > 0) {
 897         ResourceMark rm(thread);  // is this right ???
 898         // we are at a call site & the expression stack is not empty
 899         // => process callee's arguments
 900         //
 901         // Note: The expression stack can be empty if an exception
 902         //       occurred during method resolution/execution. In all
 903         //       cases we empty the expression stack completely be-
 904         //       fore handling the exception (the exception handling
 905         //       code in the interpreter calls a blocking runtime
 906         //       routine which can cause this code to be executed).
 907         //       (was bug gri 7/27/98)
 908         oops_interpreted_arguments_do(signature, has_receiver, f);
 909       }
 910     }
 911   }
 912 
 913   InterpreterFrameClosure blk(this, max_locals, m->max_stack(), f);
 914 
 915   // process locals & expression stack
 916   InterpreterOopMap mask;
 917   if (query_oop_map_cache) {
 918     m->mask_for(bci, &mask);
 919   } else {
 920     OopMapCache::compute_one_oop_map(m, bci, &mask);
 921   }
 922   mask.iterate_oop(&blk);
 923 }
 924 
 925 
 926 void frame::oops_interpreted_arguments_do(Symbol* signature, bool has_receiver, OopClosure* f) {
 927   InterpretedArgumentOopFinder finder(signature, has_receiver, this, f);
 928   finder.oops_do();
 929 }
 930 
 931 void frame::oops_code_blob_do(OopClosure* f, CodeBlobClosure* cf, const RegisterMap* reg_map) {
 932   assert(_cb != NULL, "sanity check");
 933   if (_cb->oop_maps() != NULL) {
 934     OopMapSet::oops_do(this, reg_map, f);
 935 
 936     // Preserve potential arguments for a callee. We handle this by dispatching
 937     // on the codeblob. For c2i, we do
 938     if (reg_map->include_argument_oops()) {
 939       _cb->preserve_callee_argument_oops(*this, reg_map, f);
 940     }
 941   }
 942   // In cases where perm gen is collected, GC will want to mark
 943   // oops referenced from nmethods active on thread stacks so as to
 944   // prevent them from being collected. However, this visit should be
 945   // restricted to certain phases of the collection only. The
 946   // closure decides how it wants nmethods to be traced.
 947   if (cf != NULL)
 948     cf->do_code_blob(_cb);
 949 }
 950 
 951 class CompiledArgumentOopFinder: public SignatureInfo {
 952  protected:
 953   OopClosure*     _f;
 954   int             _offset;        // the current offset, incremented with each argument
 955   bool            _has_receiver;  // true if the callee has a receiver
 956   bool            _has_appendix;  // true if the call has an appendix
 957   frame           _fr;
 958   RegisterMap*    _reg_map;
 959   int             _arg_size;
 960   VMRegPair*      _regs;        // VMReg list of arguments
 961 
 962   void set(int size, BasicType type) {
 963     if (type == T_OBJECT || type == T_ARRAY || type == T_VALUETYPE) handle_oop_offset();
 964     _offset += size;
 965   }
 966 
 967   virtual void handle_oop_offset() {
 968     // Extract low order register number from register array.
 969     // In LP64-land, the high-order bits are valid but unhelpful.
 970     VMReg reg = _regs[_offset].first();
 971     oop *loc = _fr.oopmapreg_to_location(reg, _reg_map);
 972     _f->do_oop(loc);
 973   }
 974 
 975  public:
 976   CompiledArgumentOopFinder(Symbol* signature, bool has_receiver, bool has_appendix, OopClosure* f, frame fr,  const RegisterMap* reg_map)
 977     : SignatureInfo(signature) {
 978 
 979     // initialize CompiledArgumentOopFinder
 980     _f         = f;
 981     _offset    = 0;
 982     _has_receiver = has_receiver;
 983     _has_appendix = has_appendix;
 984     _fr        = fr;
 985     _reg_map   = (RegisterMap*)reg_map;
 986     _arg_size  = ArgumentSizeComputer(signature).size() + (has_receiver ? 1 : 0) + (has_appendix ? 1 : 0);
 987 
 988     int arg_size;
 989     _regs = SharedRuntime::find_callee_arguments(signature, has_receiver, has_appendix, &arg_size);
 990     assert(arg_size == _arg_size, "wrong arg size");
 991   }
 992 
 993   void oops_do() {
 994     if (_has_receiver) {
 995       handle_oop_offset();
 996       _offset++;
 997     }
 998     iterate_parameters();
 999     if (_has_appendix) {
1000       handle_oop_offset();
1001       _offset++;
1002     }
1003   }
1004 };
1005 
1006 void frame::oops_compiled_arguments_do(Symbol* signature, bool has_receiver, bool has_appendix,
1007                                        const RegisterMap* reg_map, OopClosure* f) {
1008   ResourceMark rm;
1009   CompiledArgumentOopFinder finder(signature, has_receiver, has_appendix, f, *this, reg_map);
1010   finder.oops_do();
1011 }
1012 
1013 
1014 // Get receiver out of callers frame, i.e. find parameter 0 in callers
1015 // frame.  Consult ADLC for where parameter 0 is to be found.  Then
1016 // check local reg_map for it being a callee-save register or argument
1017 // register, both of which are saved in the local frame.  If not found
1018 // there, it must be an in-stack argument of the caller.
1019 // Note: caller.sp() points to callee-arguments
1020 oop frame::retrieve_receiver(RegisterMap* reg_map) {
1021   frame caller = *this;
1022 
1023   // First consult the ADLC on where it puts parameter 0 for this signature.
1024   VMReg reg = SharedRuntime::name_for_receiver();
1025   oop* oop_adr = caller.oopmapreg_to_location(reg, reg_map);
1026   if (oop_adr == NULL) {
1027     guarantee(oop_adr != NULL, "bad register save location");
1028     return NULL;
1029   }
1030   oop r = *oop_adr;
1031   assert(Universe::heap()->is_in_or_null(r), "bad receiver: " INTPTR_FORMAT " (" INTX_FORMAT ")", p2i(r), p2i(r));
1032   return r;
1033 }
1034 
1035 
1036 oop* frame::oopmapreg_to_location(VMReg reg, const RegisterMap* reg_map) const {
1037   if(reg->is_reg()) {
1038     // If it is passed in a register, it got spilled in the stub frame.
1039     return (oop *)reg_map->location(reg);
1040   } else {
1041     int sp_offset_in_bytes = reg->reg2stack() * VMRegImpl::stack_slot_size;
1042     return (oop*)(((address)unextended_sp()) + sp_offset_in_bytes);
1043   }
1044 }
1045 
1046 BasicLock* frame::get_native_monitor() {
1047   nmethod* nm = (nmethod*)_cb;
1048   assert(_cb != NULL && _cb->is_nmethod() && nm->method()->is_native(),
1049          "Should not call this unless it's a native nmethod");
1050   int byte_offset = in_bytes(nm->native_basic_lock_sp_offset());
1051   assert(byte_offset >= 0, "should not see invalid offset");
1052   return (BasicLock*) &sp()[byte_offset / wordSize];
1053 }
1054 
1055 oop frame::get_native_receiver() {
1056   nmethod* nm = (nmethod*)_cb;
1057   assert(_cb != NULL && _cb->is_nmethod() && nm->method()->is_native(),
1058          "Should not call this unless it's a native nmethod");
1059   int byte_offset = in_bytes(nm->native_receiver_sp_offset());
1060   assert(byte_offset >= 0, "should not see invalid offset");
1061   oop owner = ((oop*) sp())[byte_offset / wordSize];
1062   assert( Universe::heap()->is_in(owner), "bad receiver" );
1063   return owner;
1064 }
1065 
1066 void frame::oops_entry_do(OopClosure* f, const RegisterMap* map) {
1067   assert(map != NULL, "map must be set");
1068   if (map->include_argument_oops()) {
1069     // must collect argument oops, as nobody else is doing it
1070     Thread *thread = Thread::current();
1071     methodHandle m (thread, entry_frame_call_wrapper()->callee_method());
1072     EntryFrameOopFinder finder(this, m->signature(), m->is_static());
1073     finder.arguments_do(f);
1074   }
1075   // Traverse the Handle Block saved in the entry frame
1076   entry_frame_call_wrapper()->oops_do(f);
1077 }
1078 
1079 
1080 void frame::oops_do_internal(OopClosure* f, CLDClosure* cld_f, CodeBlobClosure* cf, RegisterMap* map, bool use_interpreter_oop_map_cache) {
1081 #ifndef PRODUCT
1082   // simulate GC crash here to dump java thread in error report
1083   if (CrashGCForDumpingJavaThread) {
1084     char *t = NULL;
1085     *t = 'c';
1086   }
1087 #endif
1088   if (is_interpreted_frame()) {
1089     oops_interpreted_do(f, cld_f, map, use_interpreter_oop_map_cache);
1090   } else if (is_entry_frame()) {
1091     oops_entry_do(f, map);
1092   } else if (CodeCache::contains(pc())) {
1093     oops_code_blob_do(f, cf, map);
1094 #ifdef SHARK
1095   } else if (is_fake_stub_frame()) {
1096     // nothing to do
1097 #endif // SHARK
1098   } else {
1099     ShouldNotReachHere();
1100   }
1101 }
1102 
1103 void frame::nmethods_do(CodeBlobClosure* cf) {
1104   if (_cb != NULL && _cb->is_nmethod()) {
1105     cf->do_code_blob(_cb);
1106   }
1107 }
1108 
1109 
1110 // call f() on the interpreted Method*s in the stack.
1111 // Have to walk the entire code cache for the compiled frames Yuck.
1112 void frame::metadata_do(void f(Metadata*)) {
1113   if (is_interpreted_frame()) {
1114     Method* m = this->interpreter_frame_method();
1115     assert(m != NULL, "expecting a method in this frame");
1116     f(m);
1117   }
1118 }
1119 
1120 void frame::verify(const RegisterMap* map) {
1121   // for now make sure receiver type is correct
1122   if (is_interpreted_frame()) {
1123     Method* method = interpreter_frame_method();
1124     guarantee(method->is_method(), "method is wrong in frame::verify");
1125     if (!method->is_static()) {
1126       // fetch the receiver
1127       oop* p = (oop*) interpreter_frame_local_at(0);
1128       // make sure we have the right receiver type
1129     }
1130   }
1131 #if defined(COMPILER2) || INCLUDE_JVMCI
1132   assert(DerivedPointerTable::is_empty(), "must be empty before verify");
1133 #endif
1134   oops_do_internal(&VerifyOopClosure::verify_oop, NULL, NULL, (RegisterMap*)map, false);
1135 }
1136 
1137 
1138 #ifdef ASSERT
1139 bool frame::verify_return_pc(address x) {
1140   if (StubRoutines::returns_to_call_stub(x)) {
1141     return true;
1142   }
1143   if (CodeCache::contains(x)) {
1144     return true;
1145   }
1146   if (Interpreter::contains(x)) {
1147     return true;
1148   }
1149   return false;
1150 }
1151 #endif
1152 
1153 #ifdef ASSERT
1154 void frame::interpreter_frame_verify_monitor(BasicObjectLock* value) const {
1155   assert(is_interpreted_frame(), "Not an interpreted frame");
1156   // verify that the value is in the right part of the frame
1157   address low_mark  = (address) interpreter_frame_monitor_end();
1158   address high_mark = (address) interpreter_frame_monitor_begin();
1159   address current   = (address) value;
1160 
1161   const int monitor_size = frame::interpreter_frame_monitor_size();
1162   guarantee((high_mark - current) % monitor_size  ==  0         , "Misaligned top of BasicObjectLock*");
1163   guarantee( high_mark > current                                , "Current BasicObjectLock* higher than high_mark");
1164 
1165   guarantee((current - low_mark) % monitor_size  ==  0         , "Misaligned bottom of BasicObjectLock*");
1166   guarantee( current >= low_mark                               , "Current BasicObjectLock* below than low_mark");
1167 }
1168 #endif
1169 
1170 #ifndef PRODUCT
1171 void frame::describe(FrameValues& values, int frame_no) {
1172   // boundaries: sp and the 'real' frame pointer
1173   values.describe(-1, sp(), err_msg("sp for #%d", frame_no), 1);
1174   intptr_t* frame_pointer = real_fp(); // Note: may differ from fp()
1175 
1176   // print frame info at the highest boundary
1177   intptr_t* info_address = MAX2(sp(), frame_pointer);
1178 
1179   if (info_address != frame_pointer) {
1180     // print frame_pointer explicitly if not marked by the frame info
1181     values.describe(-1, frame_pointer, err_msg("frame pointer for #%d", frame_no), 1);
1182   }
1183 
1184   if (is_entry_frame() || is_compiled_frame() || is_interpreted_frame() || is_native_frame()) {
1185     // Label values common to most frames
1186     values.describe(-1, unextended_sp(), err_msg("unextended_sp for #%d", frame_no));
1187   }
1188 
1189   if (is_interpreted_frame()) {
1190     Method* m = interpreter_frame_method();
1191     int bci = interpreter_frame_bci();
1192 
1193     // Label the method and current bci
1194     values.describe(-1, info_address,
1195                     FormatBuffer<1024>("#%d method %s @ %d", frame_no, m->name_and_sig_as_C_string(), bci), 2);
1196     values.describe(-1, info_address,
1197                     err_msg("- %d locals %d max stack", m->max_locals(), m->max_stack()), 1);
1198     if (m->max_locals() > 0) {
1199       intptr_t* l0 = interpreter_frame_local_at(0);
1200       intptr_t* ln = interpreter_frame_local_at(m->max_locals() - 1);
1201       values.describe(-1, MAX2(l0, ln), err_msg("locals for #%d", frame_no), 1);
1202       // Report each local and mark as owned by this frame
1203       for (int l = 0; l < m->max_locals(); l++) {
1204         intptr_t* l0 = interpreter_frame_local_at(l);
1205         values.describe(frame_no, l0, err_msg("local %d", l));
1206       }
1207     }
1208 
1209     // Compute the actual expression stack size
1210     InterpreterOopMap mask;
1211     OopMapCache::compute_one_oop_map(m, bci, &mask);
1212     intptr_t* tos = NULL;
1213     // Report each stack element and mark as owned by this frame
1214     for (int e = 0; e < mask.expression_stack_size(); e++) {
1215       tos = MAX2(tos, interpreter_frame_expression_stack_at(e));
1216       values.describe(frame_no, interpreter_frame_expression_stack_at(e),
1217                       err_msg("stack %d", e));
1218     }
1219     if (tos != NULL) {
1220       values.describe(-1, tos, err_msg("expression stack for #%d", frame_no), 1);
1221     }
1222     if (interpreter_frame_monitor_begin() != interpreter_frame_monitor_end()) {
1223       values.describe(frame_no, (intptr_t*)interpreter_frame_monitor_begin(), "monitors begin");
1224       values.describe(frame_no, (intptr_t*)interpreter_frame_monitor_end(), "monitors end");
1225     }
1226   } else if (is_entry_frame()) {
1227     // For now just label the frame
1228     values.describe(-1, info_address, err_msg("#%d entry frame", frame_no), 2);
1229   } else if (is_compiled_frame()) {
1230     // For now just label the frame
1231     nmethod* nm = cb()->as_nmethod_or_null();
1232     values.describe(-1, info_address,
1233                     FormatBuffer<1024>("#%d nmethod " INTPTR_FORMAT " for method %s%s", frame_no,
1234                                        p2i(nm), nm->method()->name_and_sig_as_C_string(),
1235                                        (_deopt_state == is_deoptimized) ?
1236                                        " (deoptimized)" :
1237                                        ((_deopt_state == unknown) ? " (state unknown)" : "")),
1238                     2);
1239   } else if (is_native_frame()) {
1240     // For now just label the frame
1241     nmethod* nm = cb()->as_nmethod_or_null();
1242     values.describe(-1, info_address,
1243                     FormatBuffer<1024>("#%d nmethod " INTPTR_FORMAT " for native method %s", frame_no,
1244                                        p2i(nm), nm->method()->name_and_sig_as_C_string()), 2);
1245   } else {
1246     // provide default info if not handled before
1247     char *info = (char *) "special frame";
1248     if ((_cb != NULL) &&
1249         (_cb->name() != NULL)) {
1250       info = (char *)_cb->name();
1251     }
1252     values.describe(-1, info_address, err_msg("#%d <%s>", frame_no, info), 2);
1253   }
1254 
1255   // platform dependent additional data
1256   describe_pd(values, frame_no);
1257 }
1258 
1259 #endif
1260 
1261 
1262 //-----------------------------------------------------------------------------------
1263 // StackFrameStream implementation
1264 
1265 StackFrameStream::StackFrameStream(JavaThread *thread, bool update) : _reg_map(thread, update) {
1266   assert(thread->has_last_Java_frame(), "sanity check");
1267   _fr = thread->last_frame();
1268   _is_done = false;
1269 }
1270 
1271 
1272 #ifndef PRODUCT
1273 
1274 void FrameValues::describe(int owner, intptr_t* location, const char* description, int priority) {
1275   FrameValue fv;
1276   fv.location = location;
1277   fv.owner = owner;
1278   fv.priority = priority;
1279   fv.description = NEW_RESOURCE_ARRAY(char, strlen(description) + 1);
1280   strcpy(fv.description, description);
1281   _values.append(fv);
1282 }
1283 
1284 
1285 #ifdef ASSERT
1286 void FrameValues::validate() {
1287   _values.sort(compare);
1288   bool error = false;
1289   FrameValue prev;
1290   prev.owner = -1;
1291   for (int i = _values.length() - 1; i >= 0; i--) {
1292     FrameValue fv = _values.at(i);
1293     if (fv.owner == -1) continue;
1294     if (prev.owner == -1) {
1295       prev = fv;
1296       continue;
1297     }
1298     if (prev.location == fv.location) {
1299       if (fv.owner != prev.owner) {
1300         tty->print_cr("overlapping storage");
1301         tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", p2i(prev.location), *prev.location, prev.description);
1302         tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", p2i(fv.location), *fv.location, fv.description);
1303         error = true;
1304       }
1305     } else {
1306       prev = fv;
1307     }
1308   }
1309   assert(!error, "invalid layout");
1310 }
1311 #endif // ASSERT
1312 
1313 void FrameValues::print(JavaThread* thread) {
1314   _values.sort(compare);
1315 
1316   // Sometimes values like the fp can be invalid values if the
1317   // register map wasn't updated during the walk.  Trim out values
1318   // that aren't actually in the stack of the thread.
1319   int min_index = 0;
1320   int max_index = _values.length() - 1;
1321   intptr_t* v0 = _values.at(min_index).location;
1322   intptr_t* v1 = _values.at(max_index).location;
1323 
1324   if (thread == Thread::current()) {
1325     while (!thread->is_in_stack((address)v0)) {
1326       v0 = _values.at(++min_index).location;
1327     }
1328     while (!thread->is_in_stack((address)v1)) {
1329       v1 = _values.at(--max_index).location;
1330     }
1331   } else {
1332     while (!thread->on_local_stack((address)v0)) {
1333       v0 = _values.at(++min_index).location;
1334     }
1335     while (!thread->on_local_stack((address)v1)) {
1336       v1 = _values.at(--max_index).location;
1337     }
1338   }
1339   intptr_t* min = MIN2(v0, v1);
1340   intptr_t* max = MAX2(v0, v1);
1341   intptr_t* cur = max;
1342   intptr_t* last = NULL;
1343   for (int i = max_index; i >= min_index; i--) {
1344     FrameValue fv = _values.at(i);
1345     while (cur > fv.location) {
1346       tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT, p2i(cur), *cur);
1347       cur--;
1348     }
1349     if (last == fv.location) {
1350       const char* spacer = "          " LP64_ONLY("        ");
1351       tty->print_cr(" %s  %s %s", spacer, spacer, fv.description);
1352     } else {
1353       tty->print_cr(" " INTPTR_FORMAT ": " INTPTR_FORMAT " %s", p2i(fv.location), *fv.location, fv.description);
1354       last = fv.location;
1355       cur--;
1356     }
1357   }
1358 }
1359 
1360 #endif // ndef PRODUCT