1 /*
   2  * Copyright (c) 1997, 2012, 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 "classfile/systemDictionary.hpp"
  27 #include "code/debugInfoRec.hpp"
  28 #include "code/nmethod.hpp"
  29 #include "code/pcDesc.hpp"
  30 #include "code/scopeDesc.hpp"
  31 #include "interpreter/bytecode.hpp"
  32 #include "interpreter/interpreter.hpp"
  33 #include "interpreter/oopMapCache.hpp"
  34 #include "memory/allocation.inline.hpp"
  35 #include "memory/oopFactory.hpp"
  36 #include "memory/resourceArea.hpp"
  37 #include "oops/method.hpp"
  38 #include "oops/oop.inline.hpp"
  39 #include "prims/jvmtiThreadState.hpp"
  40 #include "runtime/biasedLocking.hpp"
  41 #include "runtime/compilationPolicy.hpp"
  42 #include "runtime/deoptimization.hpp"
  43 #include "runtime/interfaceSupport.hpp"
  44 #include "runtime/sharedRuntime.hpp"
  45 #include "runtime/signature.hpp"
  46 #include "runtime/stubRoutines.hpp"
  47 #include "runtime/thread.hpp"
  48 #include "runtime/vframe.hpp"
  49 #include "runtime/vframeArray.hpp"
  50 #include "runtime/vframe_hp.hpp"
  51 #include "utilities/events.hpp"
  52 #include "utilities/xmlstream.hpp"
  53 #ifdef TARGET_ARCH_x86
  54 # include "vmreg_x86.inline.hpp"
  55 #endif
  56 #ifdef TARGET_ARCH_sparc
  57 # include "vmreg_sparc.inline.hpp"
  58 #endif
  59 #ifdef TARGET_ARCH_zero
  60 # include "vmreg_zero.inline.hpp"
  61 #endif
  62 #ifdef TARGET_ARCH_arm
  63 # include "vmreg_arm.inline.hpp"
  64 #endif
  65 #ifdef TARGET_ARCH_ppc
  66 # include "vmreg_ppc.inline.hpp"
  67 #endif
  68 #ifdef COMPILER2
  69 #ifdef TARGET_ARCH_MODEL_x86_32
  70 # include "adfiles/ad_x86_32.hpp"
  71 #endif
  72 #ifdef TARGET_ARCH_MODEL_x86_64
  73 # include "adfiles/ad_x86_64.hpp"
  74 #endif
  75 #ifdef TARGET_ARCH_MODEL_sparc
  76 # include "adfiles/ad_sparc.hpp"
  77 #endif
  78 #ifdef TARGET_ARCH_MODEL_zero
  79 # include "adfiles/ad_zero.hpp"
  80 #endif
  81 #ifdef TARGET_ARCH_MODEL_arm
  82 # include "adfiles/ad_arm.hpp"
  83 #endif
  84 #ifdef TARGET_ARCH_MODEL_ppc
  85 # include "adfiles/ad_ppc.hpp"
  86 #endif
  87 #endif
  88 
  89 bool DeoptimizationMarker::_is_active = false;
  90 
  91 Deoptimization::UnrollBlock::UnrollBlock(int  size_of_deoptimized_frame,
  92                                          int  caller_adjustment,
  93                                          int  caller_actual_parameters,
  94                                          int  number_of_frames,
  95                                          intptr_t* frame_sizes,
  96                                          address* frame_pcs,
  97                                          BasicType return_type) {
  98   _size_of_deoptimized_frame = size_of_deoptimized_frame;
  99   _caller_adjustment         = caller_adjustment;
 100   _caller_actual_parameters  = caller_actual_parameters;
 101   _number_of_frames          = number_of_frames;
 102   _frame_sizes               = frame_sizes;
 103   _frame_pcs                 = frame_pcs;
 104   _register_block            = NEW_C_HEAP_ARRAY(intptr_t, RegisterMap::reg_count * 2, mtCompiler);
 105   _return_type               = return_type;
 106   _initial_info              = 0;
 107   // PD (x86 only)
 108   _counter_temp              = 0;
 109   _unpack_kind               = 0;
 110   _sender_sp_temp            = 0;
 111 
 112   _total_frame_sizes         = size_of_frames();
 113 }
 114 
 115 
 116 Deoptimization::UnrollBlock::~UnrollBlock() {
 117   FREE_C_HEAP_ARRAY(intptr_t, _frame_sizes, mtCompiler);
 118   FREE_C_HEAP_ARRAY(intptr_t, _frame_pcs, mtCompiler);
 119   FREE_C_HEAP_ARRAY(intptr_t, _register_block, mtCompiler);
 120 }
 121 
 122 
 123 intptr_t* Deoptimization::UnrollBlock::value_addr_at(int register_number) const {
 124   assert(register_number < RegisterMap::reg_count, "checking register number");
 125   return &_register_block[register_number * 2];
 126 }
 127 
 128 
 129 
 130 int Deoptimization::UnrollBlock::size_of_frames() const {
 131   // Acount first for the adjustment of the initial frame
 132   int result = _caller_adjustment;
 133   for (int index = 0; index < number_of_frames(); index++) {
 134     result += frame_sizes()[index];
 135   }
 136   return result;
 137 }
 138 
 139 
 140 void Deoptimization::UnrollBlock::print() {
 141   ttyLocker ttyl;
 142   tty->print_cr("UnrollBlock");
 143   tty->print_cr("  size_of_deoptimized_frame = %d", _size_of_deoptimized_frame);
 144   tty->print(   "  frame_sizes: ");
 145   for (int index = 0; index < number_of_frames(); index++) {
 146     tty->print("%d ", frame_sizes()[index]);
 147   }
 148   tty->cr();
 149 }
 150 
 151 
 152 // In order to make fetch_unroll_info work properly with escape
 153 // analysis, The method was changed from JRT_LEAF to JRT_BLOCK_ENTRY and
 154 // ResetNoHandleMark and HandleMark were removed from it. The actual reallocation
 155 // of previously eliminated objects occurs in realloc_objects, which is
 156 // called from the method fetch_unroll_info_helper below.
 157 JRT_BLOCK_ENTRY(Deoptimization::UnrollBlock*, Deoptimization::fetch_unroll_info(JavaThread* thread))
 158   // It is actually ok to allocate handles in a leaf method. It causes no safepoints,
 159   // but makes the entry a little slower. There is however a little dance we have to
 160   // do in debug mode to get around the NoHandleMark code in the JRT_LEAF macro
 161 
 162   // fetch_unroll_info() is called at the beginning of the deoptimization
 163   // handler. Note this fact before we start generating temporary frames
 164   // that can confuse an asynchronous stack walker. This counter is
 165   // decremented at the end of unpack_frames().
 166   thread->inc_in_deopt_handler();
 167 
 168   return fetch_unroll_info_helper(thread);
 169 JRT_END
 170 
 171 
 172 // This is factored, since it is both called from a JRT_LEAF (deoptimization) and a JRT_ENTRY (uncommon_trap)
 173 Deoptimization::UnrollBlock* Deoptimization::fetch_unroll_info_helper(JavaThread* thread) {
 174 
 175   // Note: there is a safepoint safety issue here. No matter whether we enter
 176   // via vanilla deopt or uncommon trap we MUST NOT stop at a safepoint once
 177   // the vframeArray is created.
 178   //
 179 
 180   // Allocate our special deoptimization ResourceMark
 181   DeoptResourceMark* dmark = new DeoptResourceMark(thread);
 182   assert(thread->deopt_mark() == NULL, "Pending deopt!");
 183   thread->set_deopt_mark(dmark);
 184 
 185   frame stub_frame = thread->last_frame(); // Makes stack walkable as side effect
 186   RegisterMap map(thread, true);
 187   RegisterMap dummy_map(thread, false);
 188   // Now get the deoptee with a valid map
 189   frame deoptee = stub_frame.sender(&map);
 190   // Set the deoptee nmethod
 191   assert(thread->deopt_nmethod() == NULL, "Pending deopt!");
 192   thread->set_deopt_nmethod(deoptee.cb()->as_nmethod_or_null());
 193 
 194   if (VerifyStack) {
 195     thread->validate_frame_layout();
 196   }
 197 
 198   // Create a growable array of VFrames where each VFrame represents an inlined
 199   // Java frame.  This storage is allocated with the usual system arena.
 200   assert(deoptee.is_compiled_frame(), "Wrong frame type");
 201   GrowableArray<compiledVFrame*>* chunk = new GrowableArray<compiledVFrame*>(10);
 202   vframe* vf = vframe::new_vframe(&deoptee, &map, thread);
 203   while (!vf->is_top()) {
 204     assert(vf->is_compiled_frame(), "Wrong frame type");
 205     chunk->push(compiledVFrame::cast(vf));
 206     vf = vf->sender();
 207   }
 208   assert(vf->is_compiled_frame(), "Wrong frame type");
 209   chunk->push(compiledVFrame::cast(vf));
 210 
 211 #ifdef COMPILER2
 212   // Reallocate the non-escaping objects and restore their fields. Then
 213   // relock objects if synchronization on them was eliminated.
 214   if (DoEscapeAnalysis || EliminateNestedLocks) {
 215     if (EliminateAllocations) {
 216       assert (chunk->at(0)->scope() != NULL,"expect only compiled java frames");
 217       GrowableArray<ScopeValue*>* objects = chunk->at(0)->scope()->objects();
 218 
 219       // The flag return_oop() indicates call sites which return oop
 220       // in compiled code. Such sites include java method calls,
 221       // runtime calls (for example, used to allocate new objects/arrays
 222       // on slow code path) and any other calls generated in compiled code.
 223       // It is not guaranteed that we can get such information here only
 224       // by analyzing bytecode in deoptimized frames. This is why this flag
 225       // is set during method compilation (see Compile::Process_OopMap_Node()).
 226       bool save_oop_result = chunk->at(0)->scope()->return_oop();
 227       Handle return_value;
 228       if (save_oop_result) {
 229         // Reallocation may trigger GC. If deoptimization happened on return from
 230         // call which returns oop we need to save it since it is not in oopmap.
 231         oop result = deoptee.saved_oop_result(&map);
 232         assert(result == NULL || result->is_oop(), "must be oop");
 233         return_value = Handle(thread, result);
 234         assert(Universe::heap()->is_in_or_null(result), "must be heap pointer");
 235         if (TraceDeoptimization) {
 236           ttyLocker ttyl;
 237           tty->print_cr("SAVED OOP RESULT " INTPTR_FORMAT " in thread " INTPTR_FORMAT, result, thread);
 238         }
 239       }
 240       bool reallocated = false;
 241       if (objects != NULL) {
 242         JRT_BLOCK
 243           reallocated = realloc_objects(thread, &deoptee, objects, THREAD);
 244         JRT_END
 245       }
 246       if (reallocated) {
 247         reassign_fields(&deoptee, &map, objects);
 248 #ifndef PRODUCT
 249         if (TraceDeoptimization) {
 250           ttyLocker ttyl;
 251           tty->print_cr("REALLOC OBJECTS in thread " INTPTR_FORMAT, thread);
 252           print_objects(objects);
 253         }
 254 #endif
 255       }
 256       if (save_oop_result) {
 257         // Restore result.
 258         deoptee.set_saved_oop_result(&map, return_value());
 259       }
 260     }
 261     if (EliminateLocks) {
 262 #ifndef PRODUCT
 263       bool first = true;
 264 #endif
 265       for (int i = 0; i < chunk->length(); i++) {
 266         compiledVFrame* cvf = chunk->at(i);
 267         assert (cvf->scope() != NULL,"expect only compiled java frames");
 268         GrowableArray<MonitorInfo*>* monitors = cvf->monitors();
 269         if (monitors->is_nonempty()) {
 270           relock_objects(monitors, thread);
 271 #ifndef PRODUCT
 272           if (TraceDeoptimization) {
 273             ttyLocker ttyl;
 274             for (int j = 0; j < monitors->length(); j++) {
 275               MonitorInfo* mi = monitors->at(j);
 276               if (mi->eliminated()) {
 277                 if (first) {
 278                   first = false;
 279                   tty->print_cr("RELOCK OBJECTS in thread " INTPTR_FORMAT, thread);
 280                 }
 281                 tty->print_cr("     object <" INTPTR_FORMAT "> locked", mi->owner());
 282               }
 283             }
 284           }
 285 #endif
 286         }
 287       }
 288     }
 289   }
 290 #endif // COMPILER2
 291   // Ensure that no safepoint is taken after pointers have been stored
 292   // in fields of rematerialized objects.  If a safepoint occurs from here on
 293   // out the java state residing in the vframeArray will be missed.
 294   No_Safepoint_Verifier no_safepoint;
 295 
 296   vframeArray* array = create_vframeArray(thread, deoptee, &map, chunk);
 297 
 298   assert(thread->vframe_array_head() == NULL, "Pending deopt!");;
 299   thread->set_vframe_array_head(array);
 300 
 301   // Now that the vframeArray has been created if we have any deferred local writes
 302   // added by jvmti then we can free up that structure as the data is now in the
 303   // vframeArray
 304 
 305   if (thread->deferred_locals() != NULL) {
 306     GrowableArray<jvmtiDeferredLocalVariableSet*>* list = thread->deferred_locals();
 307     int i = 0;
 308     do {
 309       // Because of inlining we could have multiple vframes for a single frame
 310       // and several of the vframes could have deferred writes. Find them all.
 311       if (list->at(i)->id() == array->original().id()) {
 312         jvmtiDeferredLocalVariableSet* dlv = list->at(i);
 313         list->remove_at(i);
 314         // individual jvmtiDeferredLocalVariableSet are CHeapObj's
 315         delete dlv;
 316       } else {
 317         i++;
 318       }
 319     } while ( i < list->length() );
 320     if (list->length() == 0) {
 321       thread->set_deferred_locals(NULL);
 322       // free the list and elements back to C heap.
 323       delete list;
 324     }
 325 
 326   }
 327 
 328 #ifndef SHARK
 329   // Compute the caller frame based on the sender sp of stub_frame and stored frame sizes info.
 330   CodeBlob* cb = stub_frame.cb();
 331   // Verify we have the right vframeArray
 332   assert(cb->frame_size() >= 0, "Unexpected frame size");
 333   intptr_t* unpack_sp = stub_frame.sp() + cb->frame_size();
 334 
 335   // If the deopt call site is a MethodHandle invoke call site we have
 336   // to adjust the unpack_sp.
 337   nmethod* deoptee_nm = deoptee.cb()->as_nmethod_or_null();
 338   if (deoptee_nm != NULL && deoptee_nm->is_method_handle_return(deoptee.pc()))
 339     unpack_sp = deoptee.unextended_sp();
 340 
 341 #ifdef ASSERT
 342   assert(cb->is_deoptimization_stub() || cb->is_uncommon_trap_stub(), "just checking");
 343 #endif
 344 #else
 345   intptr_t* unpack_sp = stub_frame.sender(&dummy_map).unextended_sp();
 346 #endif // !SHARK
 347 
 348   // This is a guarantee instead of an assert because if vframe doesn't match
 349   // we will unpack the wrong deoptimized frame and wind up in strange places
 350   // where it will be very difficult to figure out what went wrong. Better
 351   // to die an early death here than some very obscure death later when the
 352   // trail is cold.
 353   // Note: on ia64 this guarantee can be fooled by frames with no memory stack
 354   // in that it will fail to detect a problem when there is one. This needs
 355   // more work in tiger timeframe.
 356   guarantee(array->unextended_sp() == unpack_sp, "vframe_array_head must contain the vframeArray to unpack");
 357 
 358   int number_of_frames = array->frames();
 359 
 360   // Compute the vframes' sizes.  Note that frame_sizes[] entries are ordered from outermost to innermost
 361   // virtual activation, which is the reverse of the elements in the vframes array.
 362   intptr_t* frame_sizes = NEW_C_HEAP_ARRAY(intptr_t, number_of_frames, mtCompiler);
 363   // +1 because we always have an interpreter return address for the final slot.
 364   address* frame_pcs = NEW_C_HEAP_ARRAY(address, number_of_frames + 1, mtCompiler);
 365   int popframe_extra_args = 0;
 366   // Create an interpreter return address for the stub to use as its return
 367   // address so the skeletal frames are perfectly walkable
 368   frame_pcs[number_of_frames] = Interpreter::deopt_entry(vtos, 0);
 369 
 370   // PopFrame requires that the preserved incoming arguments from the recently-popped topmost
 371   // activation be put back on the expression stack of the caller for reexecution
 372   if (JvmtiExport::can_pop_frame() && thread->popframe_forcing_deopt_reexecution()) {
 373     popframe_extra_args = in_words(thread->popframe_preserved_args_size_in_words());
 374   }
 375 
 376   // Find the current pc for sender of the deoptee. Since the sender may have been deoptimized
 377   // itself since the deoptee vframeArray was created we must get a fresh value of the pc rather
 378   // than simply use array->sender.pc(). This requires us to walk the current set of frames
 379   //
 380   frame deopt_sender = stub_frame.sender(&dummy_map); // First is the deoptee frame
 381   deopt_sender = deopt_sender.sender(&dummy_map);     // Now deoptee caller
 382 
 383   // It's possible that the number of paramters at the call site is
 384   // different than number of arguments in the callee when method
 385   // handles are used.  If the caller is interpreted get the real
 386   // value so that the proper amount of space can be added to it's
 387   // frame.
 388   bool caller_was_method_handle = false;
 389   if (deopt_sender.is_interpreted_frame()) {
 390     methodHandle method = deopt_sender.interpreter_frame_method();
 391     Bytecode_invoke cur = Bytecode_invoke_check(method, deopt_sender.interpreter_frame_bci());
 392     if (cur.is_invokedynamic() || cur.is_invokehandle()) {
 393       // Method handle invokes may involve fairly arbitrary chains of
 394       // calls so it's impossible to know how much actual space the
 395       // caller has for locals.
 396       caller_was_method_handle = true;
 397     }
 398   }
 399 
 400   //
 401   // frame_sizes/frame_pcs[0] oldest frame (int or c2i)
 402   // frame_sizes/frame_pcs[1] next oldest frame (int)
 403   // frame_sizes/frame_pcs[n] youngest frame (int)
 404   //
 405   // Now a pc in frame_pcs is actually the return address to the frame's caller (a frame
 406   // owns the space for the return address to it's caller).  Confusing ain't it.
 407   //
 408   // The vframe array can address vframes with indices running from
 409   // 0.._frames-1. Index  0 is the youngest frame and _frame - 1 is the oldest (root) frame.
 410   // When we create the skeletal frames we need the oldest frame to be in the zero slot
 411   // in the frame_sizes/frame_pcs so the assembly code can do a trivial walk.
 412   // so things look a little strange in this loop.
 413   //
 414   int callee_parameters = 0;
 415   int callee_locals = 0;
 416   for (int index = 0; index < array->frames(); index++ ) {
 417     // frame[number_of_frames - 1 ] = on_stack_size(youngest)
 418     // frame[number_of_frames - 2 ] = on_stack_size(sender(youngest))
 419     // frame[number_of_frames - 3 ] = on_stack_size(sender(sender(youngest)))
 420     int caller_parms = callee_parameters;
 421     if ((index == array->frames() - 1) && caller_was_method_handle) {
 422       caller_parms = 0;
 423     }
 424     frame_sizes[number_of_frames - 1 - index] = BytesPerWord * array->element(index)->on_stack_size(caller_parms,
 425                                                                                                     callee_parameters,
 426                                                                                                     callee_locals,
 427                                                                                                     index == 0,
 428                                                                                                     index == array->frames() - 1,
 429                                                                                                     popframe_extra_args);
 430     // This pc doesn't have to be perfect just good enough to identify the frame
 431     // as interpreted so the skeleton frame will be walkable
 432     // The correct pc will be set when the skeleton frame is completely filled out
 433     // The final pc we store in the loop is wrong and will be overwritten below
 434     frame_pcs[number_of_frames - 1 - index ] = Interpreter::deopt_entry(vtos, 0) - frame::pc_return_offset;
 435 
 436     callee_parameters = array->element(index)->method()->size_of_parameters();
 437     callee_locals = array->element(index)->method()->max_locals();
 438     popframe_extra_args = 0;
 439   }
 440 
 441   // Compute whether the root vframe returns a float or double value.
 442   BasicType return_type;
 443   {
 444     HandleMark hm;
 445     methodHandle method(thread, array->element(0)->method());
 446     Bytecode_invoke invoke = Bytecode_invoke_check(method, array->element(0)->bci());
 447     return_type = invoke.is_valid() ? invoke.result_type() : T_ILLEGAL;
 448   }
 449 
 450   // Compute information for handling adapters and adjusting the frame size of the caller.
 451   int caller_adjustment = 0;
 452 
 453   // Compute the amount the oldest interpreter frame will have to adjust
 454   // its caller's stack by. If the caller is a compiled frame then
 455   // we pretend that the callee has no parameters so that the
 456   // extension counts for the full amount of locals and not just
 457   // locals-parms. This is because without a c2i adapter the parm
 458   // area as created by the compiled frame will not be usable by
 459   // the interpreter. (Depending on the calling convention there
 460   // may not even be enough space).
 461 
 462   // QQQ I'd rather see this pushed down into last_frame_adjust
 463   // and have it take the sender (aka caller).
 464 
 465   if (deopt_sender.is_compiled_frame() || caller_was_method_handle) {
 466     caller_adjustment = last_frame_adjust(0, callee_locals);
 467   } else if (callee_locals > callee_parameters) {
 468     // The caller frame may need extending to accommodate
 469     // non-parameter locals of the first unpacked interpreted frame.
 470     // Compute that adjustment.
 471     caller_adjustment = last_frame_adjust(callee_parameters, callee_locals);
 472   }
 473 
 474   // If the sender is deoptimized the we must retrieve the address of the handler
 475   // since the frame will "magically" show the original pc before the deopt
 476   // and we'd undo the deopt.
 477 
 478   frame_pcs[0] = deopt_sender.raw_pc();
 479 
 480 #ifndef SHARK
 481   assert(CodeCache::find_blob_unsafe(frame_pcs[0]) != NULL, "bad pc");
 482 #endif // SHARK
 483 
 484   UnrollBlock* info = new UnrollBlock(array->frame_size() * BytesPerWord,
 485                                       caller_adjustment * BytesPerWord,
 486                                       caller_was_method_handle ? 0 : callee_parameters,
 487                                       number_of_frames,
 488                                       frame_sizes,
 489                                       frame_pcs,
 490                                       return_type);
 491   // On some platforms, we need a way to pass some platform dependent
 492   // information to the unpacking code so the skeletal frames come out
 493   // correct (initial fp value, unextended sp, ...)
 494   info->set_initial_info((intptr_t) array->sender().initial_deoptimization_info());
 495 
 496   if (array->frames() > 1) {
 497     if (VerifyStack && TraceDeoptimization) {
 498       ttyLocker ttyl;
 499       tty->print_cr("Deoptimizing method containing inlining");
 500     }
 501   }
 502 
 503   array->set_unroll_block(info);
 504   return info;
 505 }
 506 
 507 // Called to cleanup deoptimization data structures in normal case
 508 // after unpacking to stack and when stack overflow error occurs
 509 void Deoptimization::cleanup_deopt_info(JavaThread *thread,
 510                                         vframeArray *array) {
 511 
 512   // Get array if coming from exception
 513   if (array == NULL) {
 514     array = thread->vframe_array_head();
 515   }
 516   thread->set_vframe_array_head(NULL);
 517 
 518   // Free the previous UnrollBlock
 519   vframeArray* old_array = thread->vframe_array_last();
 520   thread->set_vframe_array_last(array);
 521 
 522   if (old_array != NULL) {
 523     UnrollBlock* old_info = old_array->unroll_block();
 524     old_array->set_unroll_block(NULL);
 525     delete old_info;
 526     delete old_array;
 527   }
 528 
 529   // Deallocate any resource creating in this routine and any ResourceObjs allocated
 530   // inside the vframeArray (StackValueCollections)
 531 
 532   delete thread->deopt_mark();
 533   thread->set_deopt_mark(NULL);
 534   thread->set_deopt_nmethod(NULL);
 535 
 536 
 537   if (JvmtiExport::can_pop_frame()) {
 538 #ifndef CC_INTERP
 539     // Regardless of whether we entered this routine with the pending
 540     // popframe condition bit set, we should always clear it now
 541     thread->clear_popframe_condition();
 542 #else
 543     // C++ interpeter will clear has_pending_popframe when it enters
 544     // with method_resume. For deopt_resume2 we clear it now.
 545     if (thread->popframe_forcing_deopt_reexecution())
 546         thread->clear_popframe_condition();
 547 #endif /* CC_INTERP */
 548   }
 549 
 550   // unpack_frames() is called at the end of the deoptimization handler
 551   // and (in C2) at the end of the uncommon trap handler. Note this fact
 552   // so that an asynchronous stack walker can work again. This counter is
 553   // incremented at the beginning of fetch_unroll_info() and (in C2) at
 554   // the beginning of uncommon_trap().
 555   thread->dec_in_deopt_handler();
 556 }
 557 
 558 
 559 // Return BasicType of value being returned
 560 JRT_LEAF(BasicType, Deoptimization::unpack_frames(JavaThread* thread, int exec_mode))
 561 
 562   // We are already active int he special DeoptResourceMark any ResourceObj's we
 563   // allocate will be freed at the end of the routine.
 564 
 565   // It is actually ok to allocate handles in a leaf method. It causes no safepoints,
 566   // but makes the entry a little slower. There is however a little dance we have to
 567   // do in debug mode to get around the NoHandleMark code in the JRT_LEAF macro
 568   ResetNoHandleMark rnhm; // No-op in release/product versions
 569   HandleMark hm;
 570 
 571   frame stub_frame = thread->last_frame();
 572 
 573   // Since the frame to unpack is the top frame of this thread, the vframe_array_head
 574   // must point to the vframeArray for the unpack frame.
 575   vframeArray* array = thread->vframe_array_head();
 576 
 577 #ifndef PRODUCT
 578   if (TraceDeoptimization) {
 579     ttyLocker ttyl;
 580     tty->print_cr("DEOPT UNPACKING thread " INTPTR_FORMAT " vframeArray " INTPTR_FORMAT " mode %d", thread, array, exec_mode);
 581   }
 582 #endif
 583   Events::log(thread, "DEOPT UNPACKING pc=" INTPTR_FORMAT " sp=" INTPTR_FORMAT " mode %d",
 584               stub_frame.pc(), stub_frame.sp(), exec_mode);
 585 
 586   UnrollBlock* info = array->unroll_block();
 587 
 588   // Unpack the interpreter frames and any adapter frame (c2 only) we might create.
 589   array->unpack_to_stack(stub_frame, exec_mode, info->caller_actual_parameters());
 590 
 591   BasicType bt = info->return_type();
 592 
 593   // If we have an exception pending, claim that the return type is an oop
 594   // so the deopt_blob does not overwrite the exception_oop.
 595 
 596   if (exec_mode == Unpack_exception)
 597     bt = T_OBJECT;
 598 
 599   // Cleanup thread deopt data
 600   cleanup_deopt_info(thread, array);
 601 
 602 #ifndef PRODUCT
 603   if (VerifyStack) {
 604     ResourceMark res_mark;
 605 
 606     thread->validate_frame_layout();
 607 
 608     // Verify that the just-unpacked frames match the interpreter's
 609     // notions of expression stack and locals
 610     vframeArray* cur_array = thread->vframe_array_last();
 611     RegisterMap rm(thread, false);
 612     rm.set_include_argument_oops(false);
 613     bool is_top_frame = true;
 614     int callee_size_of_parameters = 0;
 615     int callee_max_locals = 0;
 616     for (int i = 0; i < cur_array->frames(); i++) {
 617       vframeArrayElement* el = cur_array->element(i);
 618       frame* iframe = el->iframe();
 619       guarantee(iframe->is_interpreted_frame(), "Wrong frame type");
 620 
 621       // Get the oop map for this bci
 622       InterpreterOopMap mask;
 623       int cur_invoke_parameter_size = 0;
 624       bool try_next_mask = false;
 625       int next_mask_expression_stack_size = -1;
 626       int top_frame_expression_stack_adjustment = 0;
 627       methodHandle mh(thread, iframe->interpreter_frame_method());
 628       OopMapCache::compute_one_oop_map(mh, iframe->interpreter_frame_bci(), &mask);
 629       BytecodeStream str(mh);
 630       str.set_start(iframe->interpreter_frame_bci());
 631       int max_bci = mh->code_size();
 632       // Get to the next bytecode if possible
 633       assert(str.bci() < max_bci, "bci in interpreter frame out of bounds");
 634       // Check to see if we can grab the number of outgoing arguments
 635       // at an uncommon trap for an invoke (where the compiler
 636       // generates debug info before the invoke has executed)
 637       Bytecodes::Code cur_code = str.next();
 638       if (cur_code == Bytecodes::_invokevirtual   ||
 639           cur_code == Bytecodes::_invokespecial   ||
 640           cur_code == Bytecodes::_invokestatic    ||
 641           cur_code == Bytecodes::_invokeinterface ||
 642           cur_code == Bytecodes::_invokedynamic) {
 643         Bytecode_invoke invoke(mh, iframe->interpreter_frame_bci());
 644         Symbol* signature = invoke.signature();
 645         ArgumentSizeComputer asc(signature);
 646         cur_invoke_parameter_size = asc.size();
 647         if (cur_code != Bytecodes::_invokestatic && cur_code != Bytecodes::_invokedynamic) {
 648           // Add in receiver
 649           ++cur_invoke_parameter_size;
 650         }
 651         if (!invoke.is_invokedynamic() && MethodHandles::has_member_arg(invoke.klass(), invoke.name())) {
 652           callee_size_of_parameters++;
 653         }
 654       }
 655       if (str.bci() < max_bci) {
 656         Bytecodes::Code bc = str.next();
 657         if (bc >= 0) {
 658           // The interpreter oop map generator reports results before
 659           // the current bytecode has executed except in the case of
 660           // calls. It seems to be hard to tell whether the compiler
 661           // has emitted debug information matching the "state before"
 662           // a given bytecode or the state after, so we try both
 663           switch (cur_code) {
 664             case Bytecodes::_invokevirtual:
 665             case Bytecodes::_invokespecial:
 666             case Bytecodes::_invokestatic:
 667             case Bytecodes::_invokeinterface:
 668             case Bytecodes::_invokedynamic:
 669             case Bytecodes::_athrow:
 670               break;
 671             default: {
 672               InterpreterOopMap next_mask;
 673               OopMapCache::compute_one_oop_map(mh, str.bci(), &next_mask);
 674               next_mask_expression_stack_size = next_mask.expression_stack_size();
 675               // Need to subtract off the size of the result type of
 676               // the bytecode because this is not described in the
 677               // debug info but returned to the interpreter in the TOS
 678               // caching register
 679               BasicType bytecode_result_type = Bytecodes::result_type(cur_code);
 680               if (bytecode_result_type != T_ILLEGAL) {
 681                 top_frame_expression_stack_adjustment = type2size[bytecode_result_type];
 682               }
 683               assert(top_frame_expression_stack_adjustment >= 0, "");
 684               try_next_mask = true;
 685               break;
 686             }
 687           }
 688         }
 689       }
 690 
 691       // Verify stack depth and oops in frame
 692       // This assertion may be dependent on the platform we're running on and may need modification (tested on x86 and sparc)
 693       if (!(
 694             /* SPARC */
 695             (iframe->interpreter_frame_expression_stack_size() == mask.expression_stack_size() + callee_size_of_parameters) ||
 696             /* x86 */
 697             (iframe->interpreter_frame_expression_stack_size() == mask.expression_stack_size() + callee_max_locals) ||
 698             (try_next_mask &&
 699              (iframe->interpreter_frame_expression_stack_size() == (next_mask_expression_stack_size -
 700                                                                     top_frame_expression_stack_adjustment))) ||
 701             (is_top_frame && (exec_mode == Unpack_exception) && iframe->interpreter_frame_expression_stack_size() == 0) ||
 702             (is_top_frame && (exec_mode == Unpack_uncommon_trap || exec_mode == Unpack_reexecute) &&
 703              (iframe->interpreter_frame_expression_stack_size() == mask.expression_stack_size() + cur_invoke_parameter_size))
 704             )) {
 705         ttyLocker ttyl;
 706 
 707         // Print out some information that will help us debug the problem
 708         tty->print_cr("Wrong number of expression stack elements during deoptimization");
 709         tty->print_cr("  Error occurred while verifying frame %d (0..%d, 0 is topmost)", i, cur_array->frames() - 1);
 710         tty->print_cr("  Fabricated interpreter frame had %d expression stack elements",
 711                       iframe->interpreter_frame_expression_stack_size());
 712         tty->print_cr("  Interpreter oop map had %d expression stack elements", mask.expression_stack_size());
 713         tty->print_cr("  try_next_mask = %d", try_next_mask);
 714         tty->print_cr("  next_mask_expression_stack_size = %d", next_mask_expression_stack_size);
 715         tty->print_cr("  callee_size_of_parameters = %d", callee_size_of_parameters);
 716         tty->print_cr("  callee_max_locals = %d", callee_max_locals);
 717         tty->print_cr("  top_frame_expression_stack_adjustment = %d", top_frame_expression_stack_adjustment);
 718         tty->print_cr("  exec_mode = %d", exec_mode);
 719         tty->print_cr("  cur_invoke_parameter_size = %d", cur_invoke_parameter_size);
 720         tty->print_cr("  Thread = " INTPTR_FORMAT ", thread ID = " UINTX_FORMAT, thread, thread->osthread()->thread_id());
 721         tty->print_cr("  Interpreted frames:");
 722         for (int k = 0; k < cur_array->frames(); k++) {
 723           vframeArrayElement* el = cur_array->element(k);
 724           tty->print_cr("    %s (bci %d)", el->method()->name_and_sig_as_C_string(), el->bci());
 725         }
 726         cur_array->print_on_2(tty);
 727         guarantee(false, "wrong number of expression stack elements during deopt");
 728       }
 729       VerifyOopClosure verify;
 730       iframe->oops_interpreted_do(&verify, NULL, &rm, false);
 731       callee_size_of_parameters = mh->size_of_parameters();
 732       callee_max_locals = mh->max_locals();
 733       is_top_frame = false;
 734     }
 735   }
 736 #endif /* !PRODUCT */
 737 
 738 
 739   return bt;
 740 JRT_END
 741 
 742 
 743 int Deoptimization::deoptimize_dependents() {
 744   Threads::deoptimized_wrt_marked_nmethods();
 745   return 0;
 746 }
 747 
 748 
 749 #ifdef COMPILER2
 750 bool Deoptimization::realloc_objects(JavaThread* thread, frame* fr, GrowableArray<ScopeValue*>* objects, TRAPS) {
 751   Handle pending_exception(thread->pending_exception());
 752   const char* exception_file = thread->exception_file();
 753   int exception_line = thread->exception_line();
 754   thread->clear_pending_exception();
 755 
 756   for (int i = 0; i < objects->length(); i++) {
 757     assert(objects->at(i)->is_object(), "invalid debug information");
 758     ObjectValue* sv = (ObjectValue*) objects->at(i);
 759 
 760     KlassHandle k(java_lang_Class::as_Klass(sv->klass()->as_ConstantOopReadValue()->value()()));
 761     oop obj = NULL;
 762 
 763     if (k->oop_is_instance()) {
 764       InstanceKlass* ik = InstanceKlass::cast(k());
 765       obj = ik->allocate_instance(CHECK_(false));
 766     } else if (k->oop_is_typeArray()) {
 767       TypeArrayKlass* ak = TypeArrayKlass::cast(k());
 768       assert(sv->field_size() % type2size[ak->element_type()] == 0, "non-integral array length");
 769       int len = sv->field_size() / type2size[ak->element_type()];
 770       obj = ak->allocate(len, CHECK_(false));
 771     } else if (k->oop_is_objArray()) {
 772       ObjArrayKlass* ak = ObjArrayKlass::cast(k());
 773       obj = ak->allocate(sv->field_size(), CHECK_(false));
 774     }
 775 
 776     assert(obj != NULL, "allocation failed");
 777     assert(sv->value().is_null(), "redundant reallocation");
 778     sv->set_value(obj);
 779   }
 780 
 781   if (pending_exception.not_null()) {
 782     thread->set_pending_exception(pending_exception(), exception_file, exception_line);
 783   }
 784 
 785   return true;
 786 }
 787 
 788 // This assumes that the fields are stored in ObjectValue in the same order
 789 // they are yielded by do_nonstatic_fields.
 790 class FieldReassigner: public FieldClosure {
 791   frame* _fr;
 792   RegisterMap* _reg_map;
 793   ObjectValue* _sv;
 794   InstanceKlass* _ik;
 795   oop _obj;
 796 
 797   int _i;
 798 public:
 799   FieldReassigner(frame* fr, RegisterMap* reg_map, ObjectValue* sv, oop obj) :
 800     _fr(fr), _reg_map(reg_map), _sv(sv), _obj(obj), _i(0) {}
 801 
 802   int i() const { return _i; }
 803 
 804 
 805   void do_field(fieldDescriptor* fd) {
 806     intptr_t val;
 807     StackValue* value =
 808       StackValue::create_stack_value(_fr, _reg_map, _sv->field_at(i()));
 809     int offset = fd->offset();
 810     switch (fd->field_type()) {
 811     case T_OBJECT: case T_ARRAY:
 812       assert(value->type() == T_OBJECT, "Agreement.");
 813       _obj->obj_field_put(offset, value->get_obj()());
 814       break;
 815 
 816     case T_LONG: case T_DOUBLE: {
 817       assert(value->type() == T_INT, "Agreement.");
 818       StackValue* low =
 819         StackValue::create_stack_value(_fr, _reg_map, _sv->field_at(++_i));
 820 #ifdef _LP64
 821       jlong res = (jlong)low->get_int();
 822 #else
 823 #ifdef SPARC
 824       // For SPARC we have to swap high and low words.
 825       jlong res = jlong_from((jint)low->get_int(), (jint)value->get_int());
 826 #else
 827       jlong res = jlong_from((jint)value->get_int(), (jint)low->get_int());
 828 #endif //SPARC
 829 #endif
 830       _obj->long_field_put(offset, res);
 831       break;
 832     }
 833     // Have to cast to INT (32 bits) pointer to avoid little/big-endian problem.
 834     case T_INT: case T_FLOAT: // 4 bytes.
 835       assert(value->type() == T_INT, "Agreement.");
 836       val = value->get_int();
 837       _obj->int_field_put(offset, (jint)*((jint*)&val));
 838       break;
 839 
 840     case T_SHORT: case T_CHAR: // 2 bytes
 841       assert(value->type() == T_INT, "Agreement.");
 842       val = value->get_int();
 843       _obj->short_field_put(offset, (jshort)*((jint*)&val));
 844       break;
 845 
 846     case T_BOOLEAN: case T_BYTE: // 1 byte
 847       assert(value->type() == T_INT, "Agreement.");
 848       val = value->get_int();
 849       _obj->bool_field_put(offset, (jboolean)*((jint*)&val));
 850       break;
 851 
 852     default:
 853       ShouldNotReachHere();
 854     }
 855     _i++;
 856   }
 857 };
 858 
 859 // restore elements of an eliminated type array
 860 void Deoptimization::reassign_type_array_elements(frame* fr, RegisterMap* reg_map, ObjectValue* sv, typeArrayOop obj, BasicType type) {
 861   int index = 0;
 862   intptr_t val;
 863 
 864   for (int i = 0; i < sv->field_size(); i++) {
 865     StackValue* value = StackValue::create_stack_value(fr, reg_map, sv->field_at(i));
 866     switch(type) {
 867     case T_LONG: case T_DOUBLE: {
 868       assert(value->type() == T_INT, "Agreement.");
 869       StackValue* low =
 870         StackValue::create_stack_value(fr, reg_map, sv->field_at(++i));
 871 #ifdef _LP64
 872       jlong res = (jlong)low->get_int();
 873 #else
 874 #ifdef SPARC
 875       // For SPARC we have to swap high and low words.
 876       jlong res = jlong_from((jint)low->get_int(), (jint)value->get_int());
 877 #else
 878       jlong res = jlong_from((jint)value->get_int(), (jint)low->get_int());
 879 #endif //SPARC
 880 #endif
 881       obj->long_at_put(index, res);
 882       break;
 883     }
 884 
 885     // Have to cast to INT (32 bits) pointer to avoid little/big-endian problem.
 886     case T_INT: case T_FLOAT: // 4 bytes.
 887       assert(value->type() == T_INT, "Agreement.");
 888       val = value->get_int();
 889       obj->int_at_put(index, (jint)*((jint*)&val));
 890       break;
 891 
 892     case T_SHORT: case T_CHAR: // 2 bytes
 893       assert(value->type() == T_INT, "Agreement.");
 894       val = value->get_int();
 895       obj->short_at_put(index, (jshort)*((jint*)&val));
 896       break;
 897 
 898     case T_BOOLEAN: case T_BYTE: // 1 byte
 899       assert(value->type() == T_INT, "Agreement.");
 900       val = value->get_int();
 901       obj->bool_at_put(index, (jboolean)*((jint*)&val));
 902       break;
 903 
 904       default:
 905         ShouldNotReachHere();
 906     }
 907     index++;
 908   }
 909 }
 910 
 911 
 912 // restore fields of an eliminated object array
 913 void Deoptimization::reassign_object_array_elements(frame* fr, RegisterMap* reg_map, ObjectValue* sv, objArrayOop obj) {
 914   for (int i = 0; i < sv->field_size(); i++) {
 915     StackValue* value = StackValue::create_stack_value(fr, reg_map, sv->field_at(i));
 916     assert(value->type() == T_OBJECT, "object element expected");
 917     obj->obj_at_put(i, value->get_obj()());
 918   }
 919 }
 920 
 921 
 922 // restore fields of all eliminated objects and arrays
 923 void Deoptimization::reassign_fields(frame* fr, RegisterMap* reg_map, GrowableArray<ScopeValue*>* objects) {
 924   for (int i = 0; i < objects->length(); i++) {
 925     ObjectValue* sv = (ObjectValue*) objects->at(i);
 926     KlassHandle k(java_lang_Class::as_Klass(sv->klass()->as_ConstantOopReadValue()->value()()));
 927     Handle obj = sv->value();
 928     assert(obj.not_null(), "reallocation was missed");
 929 
 930     if (k->oop_is_instance()) {
 931       InstanceKlass* ik = InstanceKlass::cast(k());
 932       FieldReassigner reassign(fr, reg_map, sv, obj());
 933       ik->do_nonstatic_fields(&reassign);
 934     } else if (k->oop_is_typeArray()) {
 935       TypeArrayKlass* ak = TypeArrayKlass::cast(k());
 936       reassign_type_array_elements(fr, reg_map, sv, (typeArrayOop) obj(), ak->element_type());
 937     } else if (k->oop_is_objArray()) {
 938       reassign_object_array_elements(fr, reg_map, sv, (objArrayOop) obj());
 939     }
 940   }
 941 }
 942 
 943 
 944 // relock objects for which synchronization was eliminated
 945 void Deoptimization::relock_objects(GrowableArray<MonitorInfo*>* monitors, JavaThread* thread) {
 946   for (int i = 0; i < monitors->length(); i++) {
 947     MonitorInfo* mon_info = monitors->at(i);
 948     if (mon_info->eliminated()) {
 949       assert(mon_info->owner() != NULL, "reallocation was missed");
 950       Handle obj = Handle(mon_info->owner());
 951       markOop mark = obj->mark();
 952       if (UseBiasedLocking && mark->has_bias_pattern()) {
 953         // New allocated objects may have the mark set to anonymously biased.
 954         // Also the deoptimized method may called methods with synchronization
 955         // where the thread-local object is bias locked to the current thread.
 956         assert(mark->is_biased_anonymously() ||
 957                mark->biased_locker() == thread, "should be locked to current thread");
 958         // Reset mark word to unbiased prototype.
 959         markOop unbiased_prototype = markOopDesc::prototype()->set_age(mark->age());
 960         obj->set_mark(unbiased_prototype);
 961       }
 962       BasicLock* lock = mon_info->lock();
 963       ObjectSynchronizer::slow_enter(obj, lock, thread);
 964     }
 965     assert(mon_info->owner()->is_locked(), "object must be locked now");
 966   }
 967 }
 968 
 969 
 970 #ifndef PRODUCT
 971 // print information about reallocated objects
 972 void Deoptimization::print_objects(GrowableArray<ScopeValue*>* objects) {
 973   fieldDescriptor fd;
 974 
 975   for (int i = 0; i < objects->length(); i++) {
 976     ObjectValue* sv = (ObjectValue*) objects->at(i);
 977     KlassHandle k(java_lang_Class::as_Klass(sv->klass()->as_ConstantOopReadValue()->value()()));
 978     Handle obj = sv->value();
 979 
 980     tty->print("     object <" INTPTR_FORMAT "> of type ", sv->value()());
 981     k->print_value();
 982     tty->print(" allocated (%d bytes)", obj->size() * HeapWordSize);
 983     tty->cr();
 984 
 985     if (Verbose) {
 986       k->oop_print_on(obj(), tty);
 987     }
 988   }
 989 }
 990 #endif
 991 #endif // COMPILER2
 992 
 993 vframeArray* Deoptimization::create_vframeArray(JavaThread* thread, frame fr, RegisterMap *reg_map, GrowableArray<compiledVFrame*>* chunk) {
 994   Events::log(thread, "DEOPT PACKING pc=" INTPTR_FORMAT " sp=" INTPTR_FORMAT, fr.pc(), fr.sp());
 995 
 996 #ifndef PRODUCT
 997   if (TraceDeoptimization) {
 998     ttyLocker ttyl;
 999     tty->print("DEOPT PACKING thread " INTPTR_FORMAT " ", thread);
1000     fr.print_on(tty);
1001     tty->print_cr("     Virtual frames (innermost first):");
1002     for (int index = 0; index < chunk->length(); index++) {
1003       compiledVFrame* vf = chunk->at(index);
1004       tty->print("       %2d - ", index);
1005       vf->print_value();
1006       int bci = chunk->at(index)->raw_bci();
1007       const char* code_name;
1008       if (bci == SynchronizationEntryBCI) {
1009         code_name = "sync entry";
1010       } else {
1011         Bytecodes::Code code = vf->method()->code_at(bci);
1012         code_name = Bytecodes::name(code);
1013       }
1014       tty->print(" - %s", code_name);
1015       tty->print_cr(" @ bci %d ", bci);
1016       if (Verbose) {
1017         vf->print();
1018         tty->cr();
1019       }
1020     }
1021   }
1022 #endif
1023 
1024   // Register map for next frame (used for stack crawl).  We capture
1025   // the state of the deopt'ing frame's caller.  Thus if we need to
1026   // stuff a C2I adapter we can properly fill in the callee-save
1027   // register locations.
1028   frame caller = fr.sender(reg_map);
1029   int frame_size = caller.sp() - fr.sp();
1030 
1031   frame sender = caller;
1032 
1033   // Since the Java thread being deoptimized will eventually adjust it's own stack,
1034   // the vframeArray containing the unpacking information is allocated in the C heap.
1035   // For Compiler1, the caller of the deoptimized frame is saved for use by unpack_frames().
1036   vframeArray* array = vframeArray::allocate(thread, frame_size, chunk, reg_map, sender, caller, fr);
1037 
1038   // Compare the vframeArray to the collected vframes
1039   assert(array->structural_compare(thread, chunk), "just checking");
1040 
1041 #ifndef PRODUCT
1042   if (TraceDeoptimization) {
1043     ttyLocker ttyl;
1044     tty->print_cr("     Created vframeArray " INTPTR_FORMAT, array);
1045   }
1046 #endif // PRODUCT
1047 
1048   return array;
1049 }
1050 
1051 
1052 static void collect_monitors(compiledVFrame* cvf, GrowableArray<Handle>* objects_to_revoke) {
1053   GrowableArray<MonitorInfo*>* monitors = cvf->monitors();
1054   for (int i = 0; i < monitors->length(); i++) {
1055     MonitorInfo* mon_info = monitors->at(i);
1056     if (!mon_info->eliminated() && mon_info->owner() != NULL) {
1057       objects_to_revoke->append(Handle(mon_info->owner()));
1058     }
1059   }
1060 }
1061 
1062 
1063 void Deoptimization::revoke_biases_of_monitors(JavaThread* thread, frame fr, RegisterMap* map) {
1064   if (!UseBiasedLocking) {
1065     return;
1066   }
1067 
1068   GrowableArray<Handle>* objects_to_revoke = new GrowableArray<Handle>();
1069 
1070   // Unfortunately we don't have a RegisterMap available in most of
1071   // the places we want to call this routine so we need to walk the
1072   // stack again to update the register map.
1073   if (map == NULL || !map->update_map()) {
1074     StackFrameStream sfs(thread, true);
1075     bool found = false;
1076     while (!found && !sfs.is_done()) {
1077       frame* cur = sfs.current();
1078       sfs.next();
1079       found = cur->id() == fr.id();
1080     }
1081     assert(found, "frame to be deoptimized not found on target thread's stack");
1082     map = sfs.register_map();
1083   }
1084 
1085   vframe* vf = vframe::new_vframe(&fr, map, thread);
1086   compiledVFrame* cvf = compiledVFrame::cast(vf);
1087   // Revoke monitors' biases in all scopes
1088   while (!cvf->is_top()) {
1089     collect_monitors(cvf, objects_to_revoke);
1090     cvf = compiledVFrame::cast(cvf->sender());
1091   }
1092   collect_monitors(cvf, objects_to_revoke);
1093 
1094   if (SafepointSynchronize::is_at_safepoint()) {
1095     BiasedLocking::revoke_at_safepoint(objects_to_revoke);
1096   } else {
1097     BiasedLocking::revoke(objects_to_revoke);
1098   }
1099 }
1100 
1101 
1102 void Deoptimization::revoke_biases_of_monitors(CodeBlob* cb) {
1103   if (!UseBiasedLocking) {
1104     return;
1105   }
1106 
1107   assert(SafepointSynchronize::is_at_safepoint(), "must only be called from safepoint");
1108   GrowableArray<Handle>* objects_to_revoke = new GrowableArray<Handle>();
1109   for (JavaThread* jt = Threads::first(); jt != NULL ; jt = jt->next()) {
1110     if (jt->has_last_Java_frame()) {
1111       StackFrameStream sfs(jt, true);
1112       while (!sfs.is_done()) {
1113         frame* cur = sfs.current();
1114         if (cb->contains(cur->pc())) {
1115           vframe* vf = vframe::new_vframe(cur, sfs.register_map(), jt);
1116           compiledVFrame* cvf = compiledVFrame::cast(vf);
1117           // Revoke monitors' biases in all scopes
1118           while (!cvf->is_top()) {
1119             collect_monitors(cvf, objects_to_revoke);
1120             cvf = compiledVFrame::cast(cvf->sender());
1121           }
1122           collect_monitors(cvf, objects_to_revoke);
1123         }
1124         sfs.next();
1125       }
1126     }
1127   }
1128   BiasedLocking::revoke_at_safepoint(objects_to_revoke);
1129 }
1130 
1131 
1132 void Deoptimization::deoptimize_single_frame(JavaThread* thread, frame fr) {
1133   assert(fr.can_be_deoptimized(), "checking frame type");
1134 
1135   gather_statistics(Reason_constraint, Action_none, Bytecodes::_illegal);
1136 
1137   // Patch the nmethod so that when execution returns to it we will
1138   // deopt the execution state and return to the interpreter.
1139   fr.deoptimize(thread);
1140 }
1141 
1142 void Deoptimization::deoptimize(JavaThread* thread, frame fr, RegisterMap *map) {
1143   // Deoptimize only if the frame comes from compile code.
1144   // Do not deoptimize the frame which is already patched
1145   // during the execution of the loops below.
1146   if (!fr.is_compiled_frame() || fr.is_deoptimized_frame()) {
1147     return;
1148   }
1149   ResourceMark rm;
1150   DeoptimizationMarker dm;
1151   if (UseBiasedLocking) {
1152     revoke_biases_of_monitors(thread, fr, map);
1153   }
1154   deoptimize_single_frame(thread, fr);
1155 
1156 }
1157 
1158 
1159 void Deoptimization::deoptimize_frame_internal(JavaThread* thread, intptr_t* id) {
1160   assert(thread == Thread::current() || SafepointSynchronize::is_at_safepoint(),
1161          "can only deoptimize other thread at a safepoint");
1162   // Compute frame and register map based on thread and sp.
1163   RegisterMap reg_map(thread, UseBiasedLocking);
1164   frame fr = thread->last_frame();
1165   while (fr.id() != id) {
1166     fr = fr.sender(&reg_map);
1167   }
1168   deoptimize(thread, fr, &reg_map);
1169 }
1170 
1171 
1172 void Deoptimization::deoptimize_frame(JavaThread* thread, intptr_t* id) {
1173   if (thread == Thread::current()) {
1174     Deoptimization::deoptimize_frame_internal(thread, id);
1175   } else {
1176     VM_DeoptimizeFrame deopt(thread, id);
1177     VMThread::execute(&deopt);
1178   }
1179 }
1180 
1181 
1182 // JVMTI PopFrame support
1183 JRT_LEAF(void, Deoptimization::popframe_preserve_args(JavaThread* thread, int bytes_to_save, void* start_address))
1184 {
1185   thread->popframe_preserve_args(in_ByteSize(bytes_to_save), start_address);
1186 }
1187 JRT_END
1188 
1189 
1190 #if defined(COMPILER2) || defined(SHARK)
1191 void Deoptimization::load_class_by_index(constantPoolHandle constant_pool, int index, TRAPS) {
1192   // in case of an unresolved klass entry, load the class.
1193   if (constant_pool->tag_at(index).is_unresolved_klass()) {
1194     Klass* tk = constant_pool->klass_at(index, CHECK);
1195     return;
1196   }
1197 
1198   if (!constant_pool->tag_at(index).is_symbol()) return;
1199 
1200   Handle class_loader (THREAD, constant_pool->pool_holder()->class_loader());
1201   Symbol*  symbol  = constant_pool->symbol_at(index);
1202 
1203   // class name?
1204   if (symbol->byte_at(0) != '(') {
1205     Handle protection_domain (THREAD, constant_pool->pool_holder()->protection_domain());
1206     SystemDictionary::resolve_or_null(symbol, class_loader, protection_domain, CHECK);
1207     return;
1208   }
1209 
1210   // then it must be a signature!
1211   ResourceMark rm(THREAD);
1212   for (SignatureStream ss(symbol); !ss.is_done(); ss.next()) {
1213     if (ss.is_object()) {
1214       Symbol* class_name = ss.as_symbol(CHECK);
1215       Handle protection_domain (THREAD, constant_pool->pool_holder()->protection_domain());
1216       SystemDictionary::resolve_or_null(class_name, class_loader, protection_domain, CHECK);
1217     }
1218   }
1219 }
1220 
1221 
1222 void Deoptimization::load_class_by_index(constantPoolHandle constant_pool, int index) {
1223   EXCEPTION_MARK;
1224   load_class_by_index(constant_pool, index, THREAD);
1225   if (HAS_PENDING_EXCEPTION) {
1226     // Exception happened during classloading. We ignore the exception here, since it
1227     // is going to be rethrown since the current activation is going to be deoptimzied and
1228     // the interpreter will re-execute the bytecode.
1229     CLEAR_PENDING_EXCEPTION;
1230   }
1231 }
1232 
1233 JRT_ENTRY(void, Deoptimization::uncommon_trap_inner(JavaThread* thread, jint trap_request)) {
1234   HandleMark hm;
1235 
1236   // uncommon_trap() is called at the beginning of the uncommon trap
1237   // handler. Note this fact before we start generating temporary frames
1238   // that can confuse an asynchronous stack walker. This counter is
1239   // decremented at the end of unpack_frames().
1240   thread->inc_in_deopt_handler();
1241 
1242   // We need to update the map if we have biased locking.
1243   RegisterMap reg_map(thread, UseBiasedLocking);
1244   frame stub_frame = thread->last_frame();
1245   frame fr = stub_frame.sender(&reg_map);
1246   // Make sure the calling nmethod is not getting deoptimized and removed
1247   // before we are done with it.
1248   nmethodLocker nl(fr.pc());
1249 
1250   // Log a message
1251   Events::log(thread, "Uncommon trap: trap_request=" PTR32_FORMAT " fr.pc=" INTPTR_FORMAT,
1252               trap_request, fr.pc());
1253 
1254   {
1255     ResourceMark rm;
1256 
1257     // Revoke biases of any monitors in the frame to ensure we can migrate them
1258     revoke_biases_of_monitors(thread, fr, &reg_map);
1259 
1260     DeoptReason reason = trap_request_reason(trap_request);
1261     DeoptAction action = trap_request_action(trap_request);
1262     jint unloaded_class_index = trap_request_index(trap_request); // CP idx or -1
1263 
1264     vframe*  vf  = vframe::new_vframe(&fr, &reg_map, thread);
1265     compiledVFrame* cvf = compiledVFrame::cast(vf);
1266 
1267     nmethod* nm = cvf->code();
1268 
1269     ScopeDesc*      trap_scope  = cvf->scope();
1270     methodHandle    trap_method = trap_scope->method();
1271     int             trap_bci    = trap_scope->bci();
1272     Bytecodes::Code trap_bc     = trap_method->java_code_at(trap_bci);
1273 
1274     // Record this event in the histogram.
1275     gather_statistics(reason, action, trap_bc);
1276 
1277     // Ensure that we can record deopt. history:
1278     bool create_if_missing = ProfileTraps;
1279 
1280     MethodData* trap_mdo =
1281       get_method_data(thread, trap_method, create_if_missing);
1282 
1283     // Log a message
1284     Events::log_deopt_message(thread, "Uncommon trap: reason=%s action=%s pc=" INTPTR_FORMAT " method=%s @ %d",
1285                               trap_reason_name(reason), trap_action_name(action), fr.pc(),
1286                               trap_method->name_and_sig_as_C_string(), trap_bci);
1287 
1288     // Print a bunch of diagnostics, if requested.
1289     if (TraceDeoptimization || LogCompilation) {
1290       ResourceMark rm;
1291       ttyLocker ttyl;
1292       char buf[100];
1293       if (xtty != NULL) {
1294         xtty->begin_head("uncommon_trap thread='" UINTX_FORMAT"' %s",
1295                          os::current_thread_id(),
1296                          format_trap_request(buf, sizeof(buf), trap_request));
1297         nm->log_identity(xtty);
1298       }
1299       Symbol* class_name = NULL;
1300       bool unresolved = false;
1301       if (unloaded_class_index >= 0) {
1302         constantPoolHandle constants (THREAD, trap_method->constants());
1303         if (constants->tag_at(unloaded_class_index).is_unresolved_klass()) {
1304           class_name = constants->klass_name_at(unloaded_class_index);
1305           unresolved = true;
1306           if (xtty != NULL)
1307             xtty->print(" unresolved='1'");
1308         } else if (constants->tag_at(unloaded_class_index).is_symbol()) {
1309           class_name = constants->symbol_at(unloaded_class_index);
1310         }
1311         if (xtty != NULL)
1312           xtty->name(class_name);
1313       }
1314       if (xtty != NULL && trap_mdo != NULL) {
1315         // Dump the relevant MDO state.
1316         // This is the deopt count for the current reason, any previous
1317         // reasons or recompiles seen at this point.
1318         int dcnt = trap_mdo->trap_count(reason);
1319         if (dcnt != 0)
1320           xtty->print(" count='%d'", dcnt);
1321         ProfileData* pdata = trap_mdo->bci_to_data(trap_bci);
1322         int dos = (pdata == NULL)? 0: pdata->trap_state();
1323         if (dos != 0) {
1324           xtty->print(" state='%s'", format_trap_state(buf, sizeof(buf), dos));
1325           if (trap_state_is_recompiled(dos)) {
1326             int recnt2 = trap_mdo->overflow_recompile_count();
1327             if (recnt2 != 0)
1328               xtty->print(" recompiles2='%d'", recnt2);
1329           }
1330         }
1331       }
1332       if (xtty != NULL) {
1333         xtty->stamp();
1334         xtty->end_head();
1335       }
1336       if (TraceDeoptimization) {  // make noise on the tty
1337         tty->print("Uncommon trap occurred in");
1338         nm->method()->print_short_name(tty);
1339         tty->print(" (@" INTPTR_FORMAT ") thread=" UINTX_FORMAT " reason=%s action=%s unloaded_class_index=%d",
1340                    fr.pc(),
1341                    os::current_thread_id(),
1342                    trap_reason_name(reason),
1343                    trap_action_name(action),
1344                    unloaded_class_index);
1345         if (class_name != NULL) {
1346           tty->print(unresolved ? " unresolved class: " : " symbol: ");
1347           class_name->print_symbol_on(tty);
1348         }
1349         tty->cr();
1350       }
1351       if (xtty != NULL) {
1352         // Log the precise location of the trap.
1353         for (ScopeDesc* sd = trap_scope; ; sd = sd->sender()) {
1354           xtty->begin_elem("jvms bci='%d'", sd->bci());
1355           xtty->method(sd->method());
1356           xtty->end_elem();
1357           if (sd->is_top())  break;
1358         }
1359         xtty->tail("uncommon_trap");
1360       }
1361     }
1362     // (End diagnostic printout.)
1363 
1364     // Load class if necessary
1365     if (unloaded_class_index >= 0) {
1366       constantPoolHandle constants(THREAD, trap_method->constants());
1367       load_class_by_index(constants, unloaded_class_index);
1368     }
1369 
1370     // Flush the nmethod if necessary and desirable.
1371     //
1372     // We need to avoid situations where we are re-flushing the nmethod
1373     // because of a hot deoptimization site.  Repeated flushes at the same
1374     // point need to be detected by the compiler and avoided.  If the compiler
1375     // cannot avoid them (or has a bug and "refuses" to avoid them), this
1376     // module must take measures to avoid an infinite cycle of recompilation
1377     // and deoptimization.  There are several such measures:
1378     //
1379     //   1. If a recompilation is ordered a second time at some site X
1380     //   and for the same reason R, the action is adjusted to 'reinterpret',
1381     //   to give the interpreter time to exercise the method more thoroughly.
1382     //   If this happens, the method's overflow_recompile_count is incremented.
1383     //
1384     //   2. If the compiler fails to reduce the deoptimization rate, then
1385     //   the method's overflow_recompile_count will begin to exceed the set
1386     //   limit PerBytecodeRecompilationCutoff.  If this happens, the action
1387     //   is adjusted to 'make_not_compilable', and the method is abandoned
1388     //   to the interpreter.  This is a performance hit for hot methods,
1389     //   but is better than a disastrous infinite cycle of recompilations.
1390     //   (Actually, only the method containing the site X is abandoned.)
1391     //
1392     //   3. In parallel with the previous measures, if the total number of
1393     //   recompilations of a method exceeds the much larger set limit
1394     //   PerMethodRecompilationCutoff, the method is abandoned.
1395     //   This should only happen if the method is very large and has
1396     //   many "lukewarm" deoptimizations.  The code which enforces this
1397     //   limit is elsewhere (class nmethod, class Method).
1398     //
1399     // Note that the per-BCI 'is_recompiled' bit gives the compiler one chance
1400     // to recompile at each bytecode independently of the per-BCI cutoff.
1401     //
1402     // The decision to update code is up to the compiler, and is encoded
1403     // in the Action_xxx code.  If the compiler requests Action_none
1404     // no trap state is changed, no compiled code is changed, and the
1405     // computation suffers along in the interpreter.
1406     //
1407     // The other action codes specify various tactics for decompilation
1408     // and recompilation.  Action_maybe_recompile is the loosest, and
1409     // allows the compiled code to stay around until enough traps are seen,
1410     // and until the compiler gets around to recompiling the trapping method.
1411     //
1412     // The other actions cause immediate removal of the present code.
1413 
1414     bool update_trap_state = true;
1415     bool make_not_entrant = false;
1416     bool make_not_compilable = false;
1417     bool reprofile = false;
1418     switch (action) {
1419     case Action_none:
1420       // Keep the old code.
1421       update_trap_state = false;
1422       break;
1423     case Action_maybe_recompile:
1424       // Do not need to invalidate the present code, but we can
1425       // initiate another
1426       // Start compiler without (necessarily) invalidating the nmethod.
1427       // The system will tolerate the old code, but new code should be
1428       // generated when possible.
1429       break;
1430     case Action_reinterpret:
1431       // Go back into the interpreter for a while, and then consider
1432       // recompiling form scratch.
1433       make_not_entrant = true;
1434       // Reset invocation counter for outer most method.
1435       // This will allow the interpreter to exercise the bytecodes
1436       // for a while before recompiling.
1437       // By contrast, Action_make_not_entrant is immediate.
1438       //
1439       // Note that the compiler will track null_check, null_assert,
1440       // range_check, and class_check events and log them as if they
1441       // had been traps taken from compiled code.  This will update
1442       // the MDO trap history so that the next compilation will
1443       // properly detect hot trap sites.
1444       reprofile = true;
1445       break;
1446     case Action_make_not_entrant:
1447       // Request immediate recompilation, and get rid of the old code.
1448       // Make them not entrant, so next time they are called they get
1449       // recompiled.  Unloaded classes are loaded now so recompile before next
1450       // time they are called.  Same for uninitialized.  The interpreter will
1451       // link the missing class, if any.
1452       make_not_entrant = true;
1453       break;
1454     case Action_make_not_compilable:
1455       // Give up on compiling this method at all.
1456       make_not_entrant = true;
1457       make_not_compilable = true;
1458       break;
1459     default:
1460       ShouldNotReachHere();
1461     }
1462 
1463     // Setting +ProfileTraps fixes the following, on all platforms:
1464     // 4852688: ProfileInterpreter is off by default for ia64.  The result is
1465     // infinite heroic-opt-uncommon-trap/deopt/recompile cycles, since the
1466     // recompile relies on a MethodData* to record heroic opt failures.
1467 
1468     // Whether the interpreter is producing MDO data or not, we also need
1469     // to use the MDO to detect hot deoptimization points and control
1470     // aggressive optimization.
1471     bool inc_recompile_count = false;
1472     ProfileData* pdata = NULL;
1473     if (ProfileTraps && update_trap_state && trap_mdo != NULL) {
1474       assert(trap_mdo == get_method_data(thread, trap_method, false), "sanity");
1475       uint this_trap_count = 0;
1476       bool maybe_prior_trap = false;
1477       bool maybe_prior_recompile = false;
1478       pdata = query_update_method_data(trap_mdo, trap_bci, reason,
1479                                    //outputs:
1480                                    this_trap_count,
1481                                    maybe_prior_trap,
1482                                    maybe_prior_recompile);
1483       // Because the interpreter also counts null, div0, range, and class
1484       // checks, these traps from compiled code are double-counted.
1485       // This is harmless; it just means that the PerXTrapLimit values
1486       // are in effect a little smaller than they look.
1487 
1488       DeoptReason per_bc_reason = reason_recorded_per_bytecode_if_any(reason);
1489       if (per_bc_reason != Reason_none) {
1490         // Now take action based on the partially known per-BCI history.
1491         if (maybe_prior_trap
1492             && this_trap_count >= (uint)PerBytecodeTrapLimit) {
1493           // If there are too many traps at this BCI, force a recompile.
1494           // This will allow the compiler to see the limit overflow, and
1495           // take corrective action, if possible.  The compiler generally
1496           // does not use the exact PerBytecodeTrapLimit value, but instead
1497           // changes its tactics if it sees any traps at all.  This provides
1498           // a little hysteresis, delaying a recompile until a trap happens
1499           // several times.
1500           //
1501           // Actually, since there is only one bit of counter per BCI,
1502           // the possible per-BCI counts are {0,1,(per-method count)}.
1503           // This produces accurate results if in fact there is only
1504           // one hot trap site, but begins to get fuzzy if there are
1505           // many sites.  For example, if there are ten sites each
1506           // trapping two or more times, they each get the blame for
1507           // all of their traps.
1508           make_not_entrant = true;
1509         }
1510 
1511         // Detect repeated recompilation at the same BCI, and enforce a limit.
1512         if (make_not_entrant && maybe_prior_recompile) {
1513           // More than one recompile at this point.
1514           inc_recompile_count = maybe_prior_trap;
1515         }
1516       } else {
1517         // For reasons which are not recorded per-bytecode, we simply
1518         // force recompiles unconditionally.
1519         // (Note that PerMethodRecompilationCutoff is enforced elsewhere.)
1520         make_not_entrant = true;
1521       }
1522 
1523       // Go back to the compiler if there are too many traps in this method.
1524       if (this_trap_count >= (uint)PerMethodTrapLimit) {
1525         // If there are too many traps in this method, force a recompile.
1526         // This will allow the compiler to see the limit overflow, and
1527         // take corrective action, if possible.
1528         // (This condition is an unlikely backstop only, because the
1529         // PerBytecodeTrapLimit is more likely to take effect first,
1530         // if it is applicable.)
1531         make_not_entrant = true;
1532       }
1533 
1534       // Here's more hysteresis:  If there has been a recompile at
1535       // this trap point already, run the method in the interpreter
1536       // for a while to exercise it more thoroughly.
1537       if (make_not_entrant && maybe_prior_recompile && maybe_prior_trap) {
1538         reprofile = true;
1539       }
1540 
1541     }
1542 
1543     // Take requested actions on the method:
1544 
1545     // Recompile
1546     if (make_not_entrant) {
1547       if (!nm->make_not_entrant()) {
1548         return; // the call did not change nmethod's state
1549       }
1550 
1551       if (pdata != NULL) {
1552         // Record the recompilation event, if any.
1553         int tstate0 = pdata->trap_state();
1554         int tstate1 = trap_state_set_recompiled(tstate0, true);
1555         if (tstate1 != tstate0)
1556           pdata->set_trap_state(tstate1);
1557       }
1558     }
1559 
1560     if (inc_recompile_count) {
1561       trap_mdo->inc_overflow_recompile_count();
1562       if ((uint)trap_mdo->overflow_recompile_count() >
1563           (uint)PerBytecodeRecompilationCutoff) {
1564         // Give up on the method containing the bad BCI.
1565         if (trap_method() == nm->method()) {
1566           make_not_compilable = true;
1567         } else {
1568           trap_method->set_not_compilable(CompLevel_full_optimization, true, "overflow_recompile_count > PerBytecodeRecompilationCutoff");
1569           // But give grace to the enclosing nm->method().
1570         }
1571       }
1572     }
1573 
1574     // Reprofile
1575     if (reprofile) {
1576       CompilationPolicy::policy()->reprofile(trap_scope, nm->is_osr_method());
1577     }
1578 
1579     // Give up compiling
1580     if (make_not_compilable && !nm->method()->is_not_compilable(CompLevel_full_optimization)) {
1581       assert(make_not_entrant, "consistent");
1582       nm->method()->set_not_compilable(CompLevel_full_optimization);
1583     }
1584 
1585   } // Free marked resources
1586 
1587 }
1588 JRT_END
1589 
1590 MethodData*
1591 Deoptimization::get_method_data(JavaThread* thread, methodHandle m,
1592                                 bool create_if_missing) {
1593   Thread* THREAD = thread;
1594   MethodData* mdo = m()->method_data();
1595   if (mdo == NULL && create_if_missing && !HAS_PENDING_EXCEPTION) {
1596     // Build an MDO.  Ignore errors like OutOfMemory;
1597     // that simply means we won't have an MDO to update.
1598     Method::build_interpreter_method_data(m, THREAD);
1599     if (HAS_PENDING_EXCEPTION) {
1600       assert((PENDING_EXCEPTION->is_a(SystemDictionary::OutOfMemoryError_klass())), "we expect only an OOM error here");
1601       CLEAR_PENDING_EXCEPTION;
1602     }
1603     mdo = m()->method_data();
1604   }
1605   return mdo;
1606 }
1607 
1608 ProfileData*
1609 Deoptimization::query_update_method_data(MethodData* trap_mdo,
1610                                          int trap_bci,
1611                                          Deoptimization::DeoptReason reason,
1612                                          //outputs:
1613                                          uint& ret_this_trap_count,
1614                                          bool& ret_maybe_prior_trap,
1615                                          bool& ret_maybe_prior_recompile) {
1616   uint prior_trap_count = trap_mdo->trap_count(reason);
1617   uint this_trap_count  = trap_mdo->inc_trap_count(reason);
1618 
1619   // If the runtime cannot find a place to store trap history,
1620   // it is estimated based on the general condition of the method.
1621   // If the method has ever been recompiled, or has ever incurred
1622   // a trap with the present reason , then this BCI is assumed
1623   // (pessimistically) to be the culprit.
1624   bool maybe_prior_trap      = (prior_trap_count != 0);
1625   bool maybe_prior_recompile = (trap_mdo->decompile_count() != 0);
1626   ProfileData* pdata = NULL;
1627 
1628 
1629   // For reasons which are recorded per bytecode, we check per-BCI data.
1630   DeoptReason per_bc_reason = reason_recorded_per_bytecode_if_any(reason);
1631   if (per_bc_reason != Reason_none) {
1632     // Find the profile data for this BCI.  If there isn't one,
1633     // try to allocate one from the MDO's set of spares.
1634     // This will let us detect a repeated trap at this point.
1635     pdata = trap_mdo->allocate_bci_to_data(trap_bci);
1636 
1637     if (pdata != NULL) {
1638       // Query the trap state of this profile datum.
1639       int tstate0 = pdata->trap_state();
1640       if (!trap_state_has_reason(tstate0, per_bc_reason))
1641         maybe_prior_trap = false;
1642       if (!trap_state_is_recompiled(tstate0))
1643         maybe_prior_recompile = false;
1644 
1645       // Update the trap state of this profile datum.
1646       int tstate1 = tstate0;
1647       // Record the reason.
1648       tstate1 = trap_state_add_reason(tstate1, per_bc_reason);
1649       // Store the updated state on the MDO, for next time.
1650       if (tstate1 != tstate0)
1651         pdata->set_trap_state(tstate1);
1652     } else {
1653       if (LogCompilation && xtty != NULL) {
1654         ttyLocker ttyl;
1655         // Missing MDP?  Leave a small complaint in the log.
1656         xtty->elem("missing_mdp bci='%d'", trap_bci);
1657       }
1658     }
1659   }
1660 
1661   // Return results:
1662   ret_this_trap_count = this_trap_count;
1663   ret_maybe_prior_trap = maybe_prior_trap;
1664   ret_maybe_prior_recompile = maybe_prior_recompile;
1665   return pdata;
1666 }
1667 
1668 void
1669 Deoptimization::update_method_data_from_interpreter(MethodData* trap_mdo, int trap_bci, int reason) {
1670   ResourceMark rm;
1671   // Ignored outputs:
1672   uint ignore_this_trap_count;
1673   bool ignore_maybe_prior_trap;
1674   bool ignore_maybe_prior_recompile;
1675   query_update_method_data(trap_mdo, trap_bci,
1676                            (DeoptReason)reason,
1677                            ignore_this_trap_count,
1678                            ignore_maybe_prior_trap,
1679                            ignore_maybe_prior_recompile);
1680 }
1681 
1682 Deoptimization::UnrollBlock* Deoptimization::uncommon_trap(JavaThread* thread, jint trap_request) {
1683 
1684   // Still in Java no safepoints
1685   {
1686     // This enters VM and may safepoint
1687     uncommon_trap_inner(thread, trap_request);
1688   }
1689   return fetch_unroll_info_helper(thread);
1690 }
1691 
1692 // Local derived constants.
1693 // Further breakdown of DataLayout::trap_state, as promised by DataLayout.
1694 const int DS_REASON_MASK   = DataLayout::trap_mask >> 1;
1695 const int DS_RECOMPILE_BIT = DataLayout::trap_mask - DS_REASON_MASK;
1696 
1697 //---------------------------trap_state_reason---------------------------------
1698 Deoptimization::DeoptReason
1699 Deoptimization::trap_state_reason(int trap_state) {
1700   // This assert provides the link between the width of DataLayout::trap_bits
1701   // and the encoding of "recorded" reasons.  It ensures there are enough
1702   // bits to store all needed reasons in the per-BCI MDO profile.
1703   assert(DS_REASON_MASK >= Reason_RECORDED_LIMIT, "enough bits");
1704   int recompile_bit = (trap_state & DS_RECOMPILE_BIT);
1705   trap_state -= recompile_bit;
1706   if (trap_state == DS_REASON_MASK) {
1707     return Reason_many;
1708   } else {
1709     assert((int)Reason_none == 0, "state=0 => Reason_none");
1710     return (DeoptReason)trap_state;
1711   }
1712 }
1713 //-------------------------trap_state_has_reason-------------------------------
1714 int Deoptimization::trap_state_has_reason(int trap_state, int reason) {
1715   assert(reason_is_recorded_per_bytecode((DeoptReason)reason), "valid reason");
1716   assert(DS_REASON_MASK >= Reason_RECORDED_LIMIT, "enough bits");
1717   int recompile_bit = (trap_state & DS_RECOMPILE_BIT);
1718   trap_state -= recompile_bit;
1719   if (trap_state == DS_REASON_MASK) {
1720     return -1;  // true, unspecifically (bottom of state lattice)
1721   } else if (trap_state == reason) {
1722     return 1;   // true, definitely
1723   } else if (trap_state == 0) {
1724     return 0;   // false, definitely (top of state lattice)
1725   } else {
1726     return 0;   // false, definitely
1727   }
1728 }
1729 //-------------------------trap_state_add_reason-------------------------------
1730 int Deoptimization::trap_state_add_reason(int trap_state, int reason) {
1731   assert(reason_is_recorded_per_bytecode((DeoptReason)reason) || reason == Reason_many, "valid reason");
1732   int recompile_bit = (trap_state & DS_RECOMPILE_BIT);
1733   trap_state -= recompile_bit;
1734   if (trap_state == DS_REASON_MASK) {
1735     return trap_state + recompile_bit;     // already at state lattice bottom
1736   } else if (trap_state == reason) {
1737     return trap_state + recompile_bit;     // the condition is already true
1738   } else if (trap_state == 0) {
1739     return reason + recompile_bit;          // no condition has yet been true
1740   } else {
1741     return DS_REASON_MASK + recompile_bit;  // fall to state lattice bottom
1742   }
1743 }
1744 //-----------------------trap_state_is_recompiled------------------------------
1745 bool Deoptimization::trap_state_is_recompiled(int trap_state) {
1746   return (trap_state & DS_RECOMPILE_BIT) != 0;
1747 }
1748 //-----------------------trap_state_set_recompiled-----------------------------
1749 int Deoptimization::trap_state_set_recompiled(int trap_state, bool z) {
1750   if (z)  return trap_state |  DS_RECOMPILE_BIT;
1751   else    return trap_state & ~DS_RECOMPILE_BIT;
1752 }
1753 //---------------------------format_trap_state---------------------------------
1754 // This is used for debugging and diagnostics, including hotspot.log output.
1755 const char* Deoptimization::format_trap_state(char* buf, size_t buflen,
1756                                               int trap_state) {
1757   DeoptReason reason      = trap_state_reason(trap_state);
1758   bool        recomp_flag = trap_state_is_recompiled(trap_state);
1759   // Re-encode the state from its decoded components.
1760   int decoded_state = 0;
1761   if (reason_is_recorded_per_bytecode(reason) || reason == Reason_many)
1762     decoded_state = trap_state_add_reason(decoded_state, reason);
1763   if (recomp_flag)
1764     decoded_state = trap_state_set_recompiled(decoded_state, recomp_flag);
1765   // If the state re-encodes properly, format it symbolically.
1766   // Because this routine is used for debugging and diagnostics,
1767   // be robust even if the state is a strange value.
1768   size_t len;
1769   if (decoded_state != trap_state) {
1770     // Random buggy state that doesn't decode??
1771     len = jio_snprintf(buf, buflen, "#%d", trap_state);
1772   } else {
1773     len = jio_snprintf(buf, buflen, "%s%s",
1774                        trap_reason_name(reason),
1775                        recomp_flag ? " recompiled" : "");
1776   }
1777   if (len >= buflen)
1778     buf[buflen-1] = '\0';
1779   return buf;
1780 }
1781 
1782 
1783 //--------------------------------statics--------------------------------------
1784 Deoptimization::DeoptAction Deoptimization::_unloaded_action
1785   = Deoptimization::Action_reinterpret;
1786 const char* Deoptimization::_trap_reason_name[Reason_LIMIT] = {
1787   // Note:  Keep this in sync. with enum DeoptReason.
1788   "none",
1789   "null_check",
1790   "null_assert",
1791   "range_check",
1792   "class_check",
1793   "array_check",
1794   "intrinsic",
1795   "bimorphic",
1796   "unloaded",
1797   "uninitialized",
1798   "unreached",
1799   "unhandled",
1800   "constraint",
1801   "div0_check",
1802   "age",
1803   "predicate",
1804   "loop_limit_check"
1805 };
1806 const char* Deoptimization::_trap_action_name[Action_LIMIT] = {
1807   // Note:  Keep this in sync. with enum DeoptAction.
1808   "none",
1809   "maybe_recompile",
1810   "reinterpret",
1811   "make_not_entrant",
1812   "make_not_compilable"
1813 };
1814 
1815 const char* Deoptimization::trap_reason_name(int reason) {
1816   if (reason == Reason_many)  return "many";
1817   if ((uint)reason < Reason_LIMIT)
1818     return _trap_reason_name[reason];
1819   static char buf[20];
1820   sprintf(buf, "reason%d", reason);
1821   return buf;
1822 }
1823 const char* Deoptimization::trap_action_name(int action) {
1824   if ((uint)action < Action_LIMIT)
1825     return _trap_action_name[action];
1826   static char buf[20];
1827   sprintf(buf, "action%d", action);
1828   return buf;
1829 }
1830 
1831 // This is used for debugging and diagnostics, including hotspot.log output.
1832 const char* Deoptimization::format_trap_request(char* buf, size_t buflen,
1833                                                 int trap_request) {
1834   jint unloaded_class_index = trap_request_index(trap_request);
1835   const char* reason = trap_reason_name(trap_request_reason(trap_request));
1836   const char* action = trap_action_name(trap_request_action(trap_request));
1837   size_t len;
1838   if (unloaded_class_index < 0) {
1839     len = jio_snprintf(buf, buflen, "reason='%s' action='%s'",
1840                        reason, action);
1841   } else {
1842     len = jio_snprintf(buf, buflen, "reason='%s' action='%s' index='%d'",
1843                        reason, action, unloaded_class_index);
1844   }
1845   if (len >= buflen)
1846     buf[buflen-1] = '\0';
1847   return buf;
1848 }
1849 
1850 juint Deoptimization::_deoptimization_hist
1851         [Deoptimization::Reason_LIMIT]
1852     [1 + Deoptimization::Action_LIMIT]
1853         [Deoptimization::BC_CASE_LIMIT]
1854   = {0};
1855 
1856 enum {
1857   LSB_BITS = 8,
1858   LSB_MASK = right_n_bits(LSB_BITS)
1859 };
1860 
1861 void Deoptimization::gather_statistics(DeoptReason reason, DeoptAction action,
1862                                        Bytecodes::Code bc) {
1863   assert(reason >= 0 && reason < Reason_LIMIT, "oob");
1864   assert(action >= 0 && action < Action_LIMIT, "oob");
1865   _deoptimization_hist[Reason_none][0][0] += 1;  // total
1866   _deoptimization_hist[reason][0][0]      += 1;  // per-reason total
1867   juint* cases = _deoptimization_hist[reason][1+action];
1868   juint* bc_counter_addr = NULL;
1869   juint  bc_counter      = 0;
1870   // Look for an unused counter, or an exact match to this BC.
1871   if (bc != Bytecodes::_illegal) {
1872     for (int bc_case = 0; bc_case < BC_CASE_LIMIT; bc_case++) {
1873       juint* counter_addr = &cases[bc_case];
1874       juint  counter = *counter_addr;
1875       if ((counter == 0 && bc_counter_addr == NULL)
1876           || (Bytecodes::Code)(counter & LSB_MASK) == bc) {
1877         // this counter is either free or is already devoted to this BC
1878         bc_counter_addr = counter_addr;
1879         bc_counter = counter | bc;
1880       }
1881     }
1882   }
1883   if (bc_counter_addr == NULL) {
1884     // Overflow, or no given bytecode.
1885     bc_counter_addr = &cases[BC_CASE_LIMIT-1];
1886     bc_counter = (*bc_counter_addr & ~LSB_MASK);  // clear LSB
1887   }
1888   *bc_counter_addr = bc_counter + (1 << LSB_BITS);
1889 }
1890 
1891 jint Deoptimization::total_deoptimization_count() {
1892   return _deoptimization_hist[Reason_none][0][0];
1893 }
1894 
1895 jint Deoptimization::deoptimization_count(DeoptReason reason) {
1896   assert(reason >= 0 && reason < Reason_LIMIT, "oob");
1897   return _deoptimization_hist[reason][0][0];
1898 }
1899 
1900 void Deoptimization::print_statistics() {
1901   juint total = total_deoptimization_count();
1902   juint account = total;
1903   if (total != 0) {
1904     ttyLocker ttyl;
1905     if (xtty != NULL)  xtty->head("statistics type='deoptimization'");
1906     tty->print_cr("Deoptimization traps recorded:");
1907     #define PRINT_STAT_LINE(name, r) \
1908       tty->print_cr("  %4d (%4.1f%%) %s", (int)(r), ((r) * 100.0) / total, name);
1909     PRINT_STAT_LINE("total", total);
1910     // For each non-zero entry in the histogram, print the reason,
1911     // the action, and (if specifically known) the type of bytecode.
1912     for (int reason = 0; reason < Reason_LIMIT; reason++) {
1913       for (int action = 0; action < Action_LIMIT; action++) {
1914         juint* cases = _deoptimization_hist[reason][1+action];
1915         for (int bc_case = 0; bc_case < BC_CASE_LIMIT; bc_case++) {
1916           juint counter = cases[bc_case];
1917           if (counter != 0) {
1918             char name[1*K];
1919             Bytecodes::Code bc = (Bytecodes::Code)(counter & LSB_MASK);
1920             if (bc_case == BC_CASE_LIMIT && (int)bc == 0)
1921               bc = Bytecodes::_illegal;
1922             sprintf(name, "%s/%s/%s",
1923                     trap_reason_name(reason),
1924                     trap_action_name(action),
1925                     Bytecodes::is_defined(bc)? Bytecodes::name(bc): "other");
1926             juint r = counter >> LSB_BITS;
1927             tty->print_cr("  %40s: " UINT32_FORMAT " (%.1f%%)", name, r, (r * 100.0) / total);
1928             account -= r;
1929           }
1930         }
1931       }
1932     }
1933     if (account != 0) {
1934       PRINT_STAT_LINE("unaccounted", account);
1935     }
1936     #undef PRINT_STAT_LINE
1937     if (xtty != NULL)  xtty->tail("statistics");
1938   }
1939 }
1940 #else // COMPILER2 || SHARK
1941 
1942 
1943 // Stubs for C1 only system.
1944 bool Deoptimization::trap_state_is_recompiled(int trap_state) {
1945   return false;
1946 }
1947 
1948 const char* Deoptimization::trap_reason_name(int reason) {
1949   return "unknown";
1950 }
1951 
1952 void Deoptimization::print_statistics() {
1953   // no output
1954 }
1955 
1956 void
1957 Deoptimization::update_method_data_from_interpreter(MethodData* trap_mdo, int trap_bci, int reason) {
1958   // no udpate
1959 }
1960 
1961 int Deoptimization::trap_state_has_reason(int trap_state, int reason) {
1962   return 0;
1963 }
1964 
1965 void Deoptimization::gather_statistics(DeoptReason reason, DeoptAction action,
1966                                        Bytecodes::Code bc) {
1967   // no update
1968 }
1969 
1970 const char* Deoptimization::format_trap_state(char* buf, size_t buflen,
1971                                               int trap_state) {
1972   jio_snprintf(buf, buflen, "#%d", trap_state);
1973   return buf;
1974 }
1975 
1976 #endif // COMPILER2 || SHARK