1 /*
   2  * Copyright (c) 1999, 2019, 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 "asm/codeBuffer.hpp"
  27 #include "c1/c1_CodeStubs.hpp"
  28 #include "c1/c1_Defs.hpp"
  29 #include "c1/c1_FrameMap.hpp"
  30 #include "c1/c1_LIRAssembler.hpp"
  31 #include "c1/c1_MacroAssembler.hpp"
  32 #include "c1/c1_Runtime1.hpp"
  33 #include "classfile/systemDictionary.hpp"
  34 #include "classfile/vmSymbols.hpp"
  35 #include "code/codeBlob.hpp"
  36 #include "code/compiledIC.hpp"
  37 #include "code/pcDesc.hpp"
  38 #include "code/scopeDesc.hpp"
  39 #include "code/vtableStubs.hpp"
  40 #include "compiler/disassembler.hpp"
  41 #include "gc/shared/barrierSet.hpp"
  42 #include "gc/shared/c1/barrierSetC1.hpp"
  43 #include "gc/shared/collectedHeap.hpp"
  44 #include "interpreter/bytecode.hpp"
  45 #include "interpreter/interpreter.hpp"
  46 #include "jfr/support/jfrIntrinsics.hpp"
  47 #include "logging/log.hpp"
  48 #include "memory/allocation.inline.hpp"
  49 #include "memory/oopFactory.hpp"
  50 #include "memory/resourceArea.hpp"
  51 #include "memory/universe.hpp"
  52 #include "oops/access.inline.hpp"
  53 #include "oops/objArrayOop.inline.hpp"
  54 #include "oops/objArrayKlass.hpp"
  55 #include "oops/oop.inline.hpp"
  56 #include "runtime/atomic.hpp"
  57 #include "runtime/biasedLocking.hpp"
  58 #include "runtime/compilationPolicy.hpp"
  59 #include "runtime/continuation.hpp"
  60 #include "runtime/fieldDescriptor.inline.hpp"
  61 #include "runtime/frame.inline.hpp"
  62 #include "runtime/handles.inline.hpp"
  63 #include "runtime/interfaceSupport.inline.hpp"
  64 #include "runtime/javaCalls.hpp"
  65 #include "runtime/sharedRuntime.hpp"
  66 #include "runtime/threadCritical.hpp"
  67 #include "runtime/vframe.inline.hpp"
  68 #include "runtime/vframeArray.hpp"
  69 #include "runtime/vm_version.hpp"
  70 #include "utilities/copy.hpp"
  71 #include "utilities/events.hpp"
  72 
  73 
  74 // Implementation of StubAssembler
  75 
  76 StubAssembler::StubAssembler(CodeBuffer* code, const char * name, int stub_id) : C1_MacroAssembler(code) {
  77   _name = name;
  78   _must_gc_arguments = false;
  79   _frame_size = no_frame_size;
  80   _num_rt_args = 0;
  81   _stub_id = stub_id;
  82 }
  83 
  84 
  85 void StubAssembler::set_info(const char* name, bool must_gc_arguments) {
  86   _name = name;
  87   _must_gc_arguments = must_gc_arguments;
  88 }
  89 
  90 
  91 void StubAssembler::set_frame_size(int size) {
  92   if (_frame_size == no_frame_size) {
  93     _frame_size = size;
  94   }
  95   assert(_frame_size == size, "can't change the frame size");
  96 }
  97 
  98 
  99 void StubAssembler::set_num_rt_args(int args) {
 100   if (_num_rt_args == 0) {
 101     _num_rt_args = args;
 102   }
 103   assert(_num_rt_args == args, "can't change the number of args");
 104 }
 105 
 106 // Implementation of Runtime1
 107 
 108 CodeBlob* Runtime1::_blobs[Runtime1::number_of_ids];
 109 const char *Runtime1::_blob_names[] = {
 110   RUNTIME1_STUBS(STUB_NAME, LAST_STUB_NAME)
 111 };
 112 
 113 #ifndef PRODUCT
 114 // statistics
 115 int Runtime1::_generic_arraycopy_cnt = 0;
 116 int Runtime1::_generic_arraycopystub_cnt = 0;
 117 int Runtime1::_arraycopy_slowcase_cnt = 0;
 118 int Runtime1::_arraycopy_checkcast_cnt = 0;
 119 int Runtime1::_arraycopy_checkcast_attempt_cnt = 0;
 120 int Runtime1::_new_type_array_slowcase_cnt = 0;
 121 int Runtime1::_new_object_array_slowcase_cnt = 0;
 122 int Runtime1::_new_instance_slowcase_cnt = 0;
 123 int Runtime1::_new_multi_array_slowcase_cnt = 0;
 124 int Runtime1::_monitorenter_slowcase_cnt = 0;
 125 int Runtime1::_monitorexit_slowcase_cnt = 0;
 126 int Runtime1::_patch_code_slowcase_cnt = 0;
 127 int Runtime1::_throw_range_check_exception_count = 0;
 128 int Runtime1::_throw_index_exception_count = 0;
 129 int Runtime1::_throw_div0_exception_count = 0;
 130 int Runtime1::_throw_null_pointer_exception_count = 0;
 131 int Runtime1::_throw_class_cast_exception_count = 0;
 132 int Runtime1::_throw_incompatible_class_change_error_count = 0;
 133 int Runtime1::_throw_array_store_exception_count = 0;
 134 int Runtime1::_throw_count = 0;
 135 
 136 static int _byte_arraycopy_stub_cnt = 0;
 137 static int _short_arraycopy_stub_cnt = 0;
 138 static int _int_arraycopy_stub_cnt = 0;
 139 static int _long_arraycopy_stub_cnt = 0;
 140 static int _oop_arraycopy_stub_cnt = 0;
 141 
 142 address Runtime1::arraycopy_count_address(BasicType type) {
 143   switch (type) {
 144   case T_BOOLEAN:
 145   case T_BYTE:   return (address)&_byte_arraycopy_stub_cnt;
 146   case T_CHAR:
 147   case T_SHORT:  return (address)&_short_arraycopy_stub_cnt;
 148   case T_FLOAT:
 149   case T_INT:    return (address)&_int_arraycopy_stub_cnt;
 150   case T_DOUBLE:
 151   case T_LONG:   return (address)&_long_arraycopy_stub_cnt;
 152   case T_ARRAY:
 153   case T_OBJECT: return (address)&_oop_arraycopy_stub_cnt;
 154   default:
 155     ShouldNotReachHere();
 156     return NULL;
 157   }
 158 }
 159 
 160 
 161 #endif
 162 
 163 // Simple helper to see if the caller of a runtime stub which
 164 // entered the VM has been deoptimized
 165 
 166 static bool caller_is_deopted() {
 167   JavaThread* thread = JavaThread::current();
 168   RegisterMap reg_map(thread, false);
 169   frame runtime_frame = thread->last_frame();
 170   frame caller_frame = runtime_frame.sender(&reg_map);
 171   assert(caller_frame.is_compiled_frame(), "must be compiled");
 172   return caller_frame.is_deoptimized_frame();
 173 }
 174 
 175 // Stress deoptimization
 176 static void deopt_caller() {
 177   if ( !caller_is_deopted()) {
 178     JavaThread* thread = JavaThread::current();
 179     RegisterMap reg_map(thread, false);
 180     frame runtime_frame = thread->last_frame();
 181     frame caller_frame = runtime_frame.sender(&reg_map);
 182     Deoptimization::deoptimize_frame(thread, caller_frame.id());
 183     assert(caller_is_deopted(), "Must be deoptimized");
 184   }
 185 }
 186 
 187 class StubIDStubAssemblerCodeGenClosure: public StubAssemblerCodeGenClosure {
 188  private:
 189   Runtime1::StubID _id;
 190  public:
 191   StubIDStubAssemblerCodeGenClosure(Runtime1::StubID id) : _id(id) {}
 192   virtual OopMapSet* generate_code(StubAssembler* sasm) {
 193     return Runtime1::generate_code_for(_id, sasm);
 194   }
 195 };
 196 
 197 CodeBlob* Runtime1::generate_blob(BufferBlob* buffer_blob, int stub_id, const char* name, bool expect_oop_map, StubAssemblerCodeGenClosure* cl) {
 198   ResourceMark rm;
 199   // create code buffer for code storage
 200   CodeBuffer code(buffer_blob);
 201 
 202   OopMapSet* oop_maps;
 203   int frame_size;
 204   bool must_gc_arguments;
 205 
 206   Compilation::setup_code_buffer(&code, 0);
 207 
 208   // create assembler for code generation
 209   StubAssembler* sasm = new StubAssembler(&code, name, stub_id);
 210   // generate code for runtime stub
 211   oop_maps = cl->generate_code(sasm);
 212   assert(oop_maps == NULL || sasm->frame_size() != no_frame_size,
 213          "if stub has an oop map it must have a valid frame size");
 214   assert(!expect_oop_map || oop_maps != NULL, "must have an oopmap");
 215 
 216   // align so printing shows nop's instead of random code at the end (SimpleStubs are aligned)
 217   sasm->align(BytesPerWord);
 218   // make sure all code is in code buffer
 219   sasm->flush();
 220 
 221   frame_size = sasm->frame_size();
 222   must_gc_arguments = sasm->must_gc_arguments();
 223   // create blob - distinguish a few special cases
 224   CodeBlob* blob = RuntimeStub::new_runtime_stub(name,
 225                                                  &code,
 226                                                  CodeOffsets::frame_never_safe,
 227                                                  frame_size,
 228                                                  oop_maps,
 229                                                  must_gc_arguments);
 230   assert(blob != NULL, "blob must exist");
 231   return blob;
 232 }
 233 
 234 void Runtime1::generate_blob_for(BufferBlob* buffer_blob, StubID id) {
 235   assert(0 <= id && id < number_of_ids, "illegal stub id");
 236   bool expect_oop_map = true;
 237 #ifdef ASSERT
 238   // Make sure that stubs that need oopmaps have them
 239   switch (id) {
 240     // These stubs don't need to have an oopmap
 241   case dtrace_object_alloc_id:
 242   case slow_subtype_check_id:
 243   case fpu2long_stub_id:
 244   case unwind_exception_id:
 245   case counter_overflow_id:
 246 #if defined(SPARC) || defined(PPC32)
 247   case handle_exception_nofpu_id:  // Unused on sparc
 248 #endif
 249     expect_oop_map = false;
 250     break;
 251   default:
 252     break;
 253   }
 254 #endif
 255   StubIDStubAssemblerCodeGenClosure cl(id);
 256   CodeBlob* blob = generate_blob(buffer_blob, id, name_for(id), expect_oop_map, &cl);
 257   // install blob
 258   _blobs[id] = blob;
 259 }
 260 
 261 void Runtime1::initialize(BufferBlob* blob) {
 262   // platform-dependent initialization
 263   initialize_pd();
 264   // generate stubs
 265   for (int id = 0; id < number_of_ids; id++) generate_blob_for(blob, (StubID)id);
 266   // printing
 267 #ifndef PRODUCT
 268   if (PrintSimpleStubs) {
 269     ResourceMark rm;
 270     for (int id = 0; id < number_of_ids; id++) {
 271       _blobs[id]->print();
 272       if (_blobs[id]->oop_maps() != NULL) {
 273         _blobs[id]->oop_maps()->print();
 274       }
 275     }
 276   }
 277 #endif
 278   BarrierSetC1* bs = BarrierSet::barrier_set()->barrier_set_c1();
 279   bs->generate_c1_runtime_stubs(blob);
 280 }
 281 
 282 CodeBlob* Runtime1::blob_for(StubID id) {
 283   assert(0 <= id && id < number_of_ids, "illegal stub id");
 284   return _blobs[id];
 285 }
 286 
 287 
 288 const char* Runtime1::name_for(StubID id) {
 289   assert(0 <= id && id < number_of_ids, "illegal stub id");
 290   return _blob_names[id];
 291 }
 292 
 293 const char* Runtime1::name_for_address(address entry) {
 294   for (int id = 0; id < number_of_ids; id++) {
 295     if (entry == entry_for((StubID)id)) return name_for((StubID)id);
 296   }
 297 
 298   BarrierSetC1* bsc1 = BarrierSet::barrier_set()->barrier_set_c1();
 299   const char* name = bsc1->rtcall_name_for_address(entry);
 300   if (name != NULL) {
 301     return name;
 302   }
 303 
 304 #define FUNCTION_CASE(a, f) \
 305   if ((intptr_t)a == CAST_FROM_FN_PTR(intptr_t, f))  return #f
 306 
 307   FUNCTION_CASE(entry, os::javaTimeMillis);
 308   FUNCTION_CASE(entry, os::javaTimeNanos);
 309   FUNCTION_CASE(entry, SharedRuntime::OSR_migration_end);
 310   FUNCTION_CASE(entry, SharedRuntime::d2f);
 311   FUNCTION_CASE(entry, SharedRuntime::d2i);
 312   FUNCTION_CASE(entry, SharedRuntime::d2l);
 313   FUNCTION_CASE(entry, SharedRuntime::dcos);
 314   FUNCTION_CASE(entry, SharedRuntime::dexp);
 315   FUNCTION_CASE(entry, SharedRuntime::dlog);
 316   FUNCTION_CASE(entry, SharedRuntime::dlog10);
 317   FUNCTION_CASE(entry, SharedRuntime::dpow);
 318   FUNCTION_CASE(entry, SharedRuntime::drem);
 319   FUNCTION_CASE(entry, SharedRuntime::dsin);
 320   FUNCTION_CASE(entry, SharedRuntime::dtan);
 321   FUNCTION_CASE(entry, SharedRuntime::f2i);
 322   FUNCTION_CASE(entry, SharedRuntime::f2l);
 323   FUNCTION_CASE(entry, SharedRuntime::frem);
 324   FUNCTION_CASE(entry, SharedRuntime::l2d);
 325   FUNCTION_CASE(entry, SharedRuntime::l2f);
 326   FUNCTION_CASE(entry, SharedRuntime::ldiv);
 327   FUNCTION_CASE(entry, SharedRuntime::lmul);
 328   FUNCTION_CASE(entry, SharedRuntime::lrem);
 329   FUNCTION_CASE(entry, SharedRuntime::lrem);
 330   FUNCTION_CASE(entry, SharedRuntime::dtrace_method_entry);
 331   FUNCTION_CASE(entry, SharedRuntime::dtrace_method_exit);
 332   FUNCTION_CASE(entry, is_instance_of);
 333   FUNCTION_CASE(entry, trace_block_entry);
 334 #ifdef JFR_HAVE_INTRINSICS
 335   FUNCTION_CASE(entry, JFR_TIME_FUNCTION);
 336 #endif
 337   FUNCTION_CASE(entry, StubRoutines::updateBytesCRC32());
 338   FUNCTION_CASE(entry, StubRoutines::updateBytesCRC32C());
 339   FUNCTION_CASE(entry, StubRoutines::vectorizedMismatch());
 340   FUNCTION_CASE(entry, StubRoutines::dexp());
 341   FUNCTION_CASE(entry, StubRoutines::dlog());
 342   FUNCTION_CASE(entry, StubRoutines::dlog10());
 343   FUNCTION_CASE(entry, StubRoutines::dpow());
 344   FUNCTION_CASE(entry, StubRoutines::dsin());
 345   FUNCTION_CASE(entry, StubRoutines::dcos());
 346   FUNCTION_CASE(entry, StubRoutines::dtan());
 347   FUNCTION_CASE(entry, StubRoutines::cont_getPC());
 348   FUNCTION_CASE(entry, StubRoutines::cont_thaw());
 349   FUNCTION_CASE(entry, StubRoutines::cont_doYield());
 350   FUNCTION_CASE(entry, StubRoutines::cont_jump());
 351 
 352 #undef FUNCTION_CASE
 353 
 354   // Soft float adds more runtime names.
 355   return pd_name_for_address(entry);
 356 }
 357 
 358 
 359 JRT_ENTRY(void, Runtime1::new_instance(JavaThread* thread, Klass* klass))
 360   NOT_PRODUCT(_new_instance_slowcase_cnt++;)
 361 
 362   assert(klass->is_klass(), "not a class");
 363   Handle holder(THREAD, klass->klass_holder()); // keep the klass alive
 364   InstanceKlass* h = InstanceKlass::cast(klass);
 365   h->check_valid_for_instantiation(true, CHECK);
 366   // make sure klass is initialized
 367   h->initialize(CHECK);
 368   // allocate instance and return via TLS
 369   oop obj = h->allocate_instance(CHECK);
 370   thread->set_vm_result(obj);
 371 JRT_END
 372 
 373 
 374 JRT_ENTRY(void, Runtime1::new_type_array(JavaThread* thread, Klass* klass, jint length))
 375   NOT_PRODUCT(_new_type_array_slowcase_cnt++;)
 376   // Note: no handle for klass needed since they are not used
 377   //       anymore after new_typeArray() and no GC can happen before.
 378   //       (This may have to change if this code changes!)
 379   assert(klass->is_klass(), "not a class");
 380   BasicType elt_type = TypeArrayKlass::cast(klass)->element_type();
 381   oop obj = oopFactory::new_typeArray(elt_type, length, CHECK);
 382   thread->set_vm_result(obj);
 383   // This is pretty rare but this runtime patch is stressful to deoptimization
 384   // if we deoptimize here so force a deopt to stress the path.
 385   if (DeoptimizeALot) {
 386     deopt_caller();
 387   }
 388 
 389 JRT_END
 390 
 391 
 392 JRT_ENTRY(void, Runtime1::new_object_array(JavaThread* thread, Klass* array_klass, jint length))
 393   NOT_PRODUCT(_new_object_array_slowcase_cnt++;)
 394 
 395   // Note: no handle for klass needed since they are not used
 396   //       anymore after new_objArray() and no GC can happen before.
 397   //       (This may have to change if this code changes!)
 398   assert(array_klass->is_klass(), "not a class");
 399   Handle holder(THREAD, array_klass->klass_holder()); // keep the klass alive
 400   Klass* elem_klass = ObjArrayKlass::cast(array_klass)->element_klass();
 401   objArrayOop obj = oopFactory::new_objArray(elem_klass, length, CHECK);
 402   thread->set_vm_result(obj);
 403   // This is pretty rare but this runtime patch is stressful to deoptimization
 404   // if we deoptimize here so force a deopt to stress the path.
 405   if (DeoptimizeALot) {
 406     deopt_caller();
 407   }
 408 JRT_END
 409 
 410 
 411 JRT_ENTRY(void, Runtime1::new_multi_array(JavaThread* thread, Klass* klass, int rank, jint* dims))
 412   NOT_PRODUCT(_new_multi_array_slowcase_cnt++;)
 413 
 414   assert(klass->is_klass(), "not a class");
 415   assert(rank >= 1, "rank must be nonzero");
 416   Handle holder(THREAD, klass->klass_holder()); // keep the klass alive
 417   oop obj = ArrayKlass::cast(klass)->multi_allocate(rank, dims, CHECK);
 418   thread->set_vm_result(obj);
 419 JRT_END
 420 
 421 
 422 JRT_ENTRY(void, Runtime1::unimplemented_entry(JavaThread* thread, StubID id))
 423   tty->print_cr("Runtime1::entry_for(%d) returned unimplemented entry point", id);
 424 JRT_END
 425 
 426 
 427 JRT_ENTRY(void, Runtime1::throw_array_store_exception(JavaThread* thread, oopDesc* obj))
 428   ResourceMark rm(thread);
 429   const char* klass_name = obj->klass()->external_name();
 430   SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArrayStoreException(), klass_name);
 431 JRT_END
 432 
 433 
 434 // counter_overflow() is called from within C1-compiled methods. The enclosing method is the method
 435 // associated with the top activation record. The inlinee (that is possibly included in the enclosing
 436 // method) method oop is passed as an argument. In order to do that it is embedded in the code as
 437 // a constant.
 438 static nmethod* counter_overflow_helper(JavaThread* THREAD, int branch_bci, Method* m) {
 439   nmethod* osr_nm = NULL;
 440   methodHandle method(THREAD, m);
 441 
 442   RegisterMap map(THREAD, false);
 443   frame fr =  THREAD->last_frame().sender(&map);
 444   nmethod* nm = (nmethod*) fr.cb();
 445   assert(nm!= NULL && nm->is_nmethod(), "Sanity check");
 446   methodHandle enclosing_method(THREAD, nm->method());
 447 
 448   CompLevel level = (CompLevel)nm->comp_level();
 449   int bci = InvocationEntryBci;
 450   if (branch_bci != InvocationEntryBci) {
 451     // Compute destination bci
 452     address pc = method()->code_base() + branch_bci;
 453     Bytecodes::Code branch = Bytecodes::code_at(method(), pc);
 454     int offset = 0;
 455     switch (branch) {
 456       case Bytecodes::_if_icmplt: case Bytecodes::_iflt:
 457       case Bytecodes::_if_icmpgt: case Bytecodes::_ifgt:
 458       case Bytecodes::_if_icmple: case Bytecodes::_ifle:
 459       case Bytecodes::_if_icmpge: case Bytecodes::_ifge:
 460       case Bytecodes::_if_icmpeq: case Bytecodes::_if_acmpeq: case Bytecodes::_ifeq:
 461       case Bytecodes::_if_icmpne: case Bytecodes::_if_acmpne: case Bytecodes::_ifne:
 462       case Bytecodes::_ifnull: case Bytecodes::_ifnonnull: case Bytecodes::_goto:
 463         offset = (int16_t)Bytes::get_Java_u2(pc + 1);
 464         break;
 465       case Bytecodes::_goto_w:
 466         offset = Bytes::get_Java_u4(pc + 1);
 467         break;
 468       default: ;
 469     }
 470     bci = branch_bci + offset;
 471   }
 472   assert(!HAS_PENDING_EXCEPTION, "Should not have any exceptions pending");
 473   osr_nm = CompilationPolicy::policy()->event(enclosing_method, method, branch_bci, bci, level, nm, THREAD);
 474   assert(!HAS_PENDING_EXCEPTION, "Event handler should not throw any exceptions");
 475   return osr_nm;
 476 }
 477 
 478 JRT_BLOCK_ENTRY(address, Runtime1::counter_overflow(JavaThread* thread, int bci, Method* method))
 479   nmethod* osr_nm;
 480   JRT_BLOCK
 481     osr_nm = counter_overflow_helper(thread, bci, method);
 482     if (osr_nm != NULL) {
 483       RegisterMap map(thread, false);
 484       frame fr =  thread->last_frame().sender(&map);
 485       Deoptimization::deoptimize_frame(thread, fr.id());
 486     }
 487   JRT_BLOCK_END
 488   return NULL;
 489 JRT_END
 490 
 491 extern void vm_exit(int code);
 492 
 493 // Enter this method from compiled code handler below. This is where we transition
 494 // to VM mode. This is done as a helper routine so that the method called directly
 495 // from compiled code does not have to transition to VM. This allows the entry
 496 // method to see if the nmethod that we have just looked up a handler for has
 497 // been deoptimized while we were in the vm. This simplifies the assembly code
 498 // cpu directories.
 499 //
 500 // We are entering here from exception stub (via the entry method below)
 501 // If there is a compiled exception handler in this method, we will continue there;
 502 // otherwise we will unwind the stack and continue at the caller of top frame method
 503 // Note: we enter in Java using a special JRT wrapper. This wrapper allows us to
 504 // control the area where we can allow a safepoint. After we exit the safepoint area we can
 505 // check to see if the handler we are going to return is now in a nmethod that has
 506 // been deoptimized. If that is the case we return the deopt blob
 507 // unpack_with_exception entry instead. This makes life for the exception blob easier
 508 // because making that same check and diverting is painful from assembly language.
 509 JRT_ENTRY_NO_ASYNC(static address, exception_handler_for_pc_helper(JavaThread* thread, oopDesc* ex, address pc, nmethod*& nm))
 510   // Reset method handle flag.
 511   thread->set_is_method_handle_return(false);
 512 
 513   Handle exception(thread, ex);
 514   nm = CodeCache::find_nmethod(pc);
 515   assert(nm != NULL, "this is not an nmethod");
 516   // Adjust the pc as needed/
 517   if (nm->is_deopt_pc(pc)) {
 518     RegisterMap map(thread, false);
 519     frame exception_frame = thread->last_frame().sender(&map);
 520     // if the frame isn't deopted then pc must not correspond to the caller of last_frame
 521     assert(exception_frame.is_deoptimized_frame(), "must be deopted");
 522     pc = exception_frame.pc();
 523   }
 524 #ifdef ASSERT
 525   assert(exception.not_null(), "NULL exceptions should be handled by throw_exception");
 526   // Check that exception is a subclass of Throwable, otherwise we have a VerifyError
 527   if (!(exception->is_a(SystemDictionary::Throwable_klass()))) {
 528     if (ExitVMOnVerifyError) vm_exit(-1);
 529     ShouldNotReachHere();
 530   }
 531 #endif
 532 
 533   // Check the stack guard pages and reenable them if necessary and there is
 534   // enough space on the stack to do so.  Use fast exceptions only if the guard
 535   // pages are enabled.
 536   bool guard_pages_enabled = thread->stack_guards_enabled();
 537   if (!guard_pages_enabled) guard_pages_enabled = thread->reguard_stack();
 538 
 539   if (JvmtiExport::can_post_on_exceptions()) {
 540     // To ensure correct notification of exception catches and throws
 541     // we have to deoptimize here.  If we attempted to notify the
 542     // catches and throws during this exception lookup it's possible
 543     // we could deoptimize on the way out of the VM and end back in
 544     // the interpreter at the throw site.  This would result in double
 545     // notifications since the interpreter would also notify about
 546     // these same catches and throws as it unwound the frame.
 547 
 548     RegisterMap reg_map(thread);
 549     frame stub_frame = thread->last_frame();
 550     frame caller_frame = stub_frame.sender(&reg_map);
 551 
 552     // We don't really want to deoptimize the nmethod itself since we
 553     // can actually continue in the exception handler ourselves but I
 554     // don't see an easy way to have the desired effect.
 555     Deoptimization::deoptimize_frame(thread, caller_frame.id());
 556     assert(caller_is_deopted(), "Must be deoptimized");
 557 
 558     return SharedRuntime::deopt_blob()->unpack_with_exception_in_tls();
 559   }
 560 
 561   // ExceptionCache is used only for exceptions at call sites and not for implicit exceptions
 562   if (guard_pages_enabled) {
 563     address fast_continuation = nm->handler_for_exception_and_pc(exception, pc);
 564     if (fast_continuation != NULL) {
 565       // Set flag if return address is a method handle call site.
 566       thread->set_is_method_handle_return(nm->is_method_handle_return(pc));
 567       return fast_continuation;
 568     }
 569   }
 570 
 571   // If the stack guard pages are enabled, check whether there is a handler in
 572   // the current method.  Otherwise (guard pages disabled), force an unwind and
 573   // skip the exception cache update (i.e., just leave continuation==NULL).
 574   address continuation = NULL;
 575   if (guard_pages_enabled) {
 576 
 577     // New exception handling mechanism can support inlined methods
 578     // with exception handlers since the mappings are from PC to PC
 579 
 580     // debugging support
 581     // tracing
 582     if (log_is_enabled(Info, exceptions)) {
 583       ResourceMark rm;
 584       stringStream tempst;
 585       assert(nm->method() != NULL, "Unexpected NULL method()");
 586       tempst.print("compiled method <%s>\n"
 587                    " at PC" INTPTR_FORMAT " for thread " INTPTR_FORMAT,
 588                    nm->method()->print_value_string(), p2i(pc), p2i(thread));
 589       Exceptions::log_exception(exception, tempst.as_string());
 590     }
 591     // for AbortVMOnException flag
 592     Exceptions::debug_check_abort(exception);
 593 
 594     // Clear out the exception oop and pc since looking up an
 595     // exception handler can cause class loading, which might throw an
 596     // exception and those fields are expected to be clear during
 597     // normal bytecode execution.
 598     thread->clear_exception_oop_and_pc();
 599 
 600     bool recursive_exception = false;
 601     continuation = SharedRuntime::compute_compiled_exc_handler(nm, pc, exception, false, false, recursive_exception);
 602     // If an exception was thrown during exception dispatch, the exception oop may have changed
 603     thread->set_exception_oop(exception());
 604     thread->set_exception_pc(pc);
 605 
 606     // the exception cache is used only by non-implicit exceptions
 607     // Update the exception cache only when there didn't happen
 608     // another exception during the computation of the compiled
 609     // exception handler. Checking for exception oop equality is not
 610     // sufficient because some exceptions are pre-allocated and reused.
 611     if (continuation != NULL && !recursive_exception) {
 612       nm->add_handler_for_exception_and_pc(exception, pc, continuation);
 613     }
 614   }
 615 
 616   thread->set_vm_result(exception());
 617   // Set flag if return address is a method handle call site.
 618   thread->set_is_method_handle_return(nm->is_method_handle_return(pc));
 619 
 620   if (log_is_enabled(Info, exceptions)) {
 621     ResourceMark rm;
 622     log_info(exceptions)("Thread " PTR_FORMAT " continuing at PC " PTR_FORMAT
 623                          " for exception thrown at PC " PTR_FORMAT,
 624                          p2i(thread), p2i(continuation), p2i(pc));
 625   }
 626 
 627   return continuation;
 628 JRT_END
 629 
 630 // Enter this method from compiled code only if there is a Java exception handler
 631 // in the method handling the exception.
 632 // We are entering here from exception stub. We don't do a normal VM transition here.
 633 // We do it in a helper. This is so we can check to see if the nmethod we have just
 634 // searched for an exception handler has been deoptimized in the meantime.
 635 address Runtime1::exception_handler_for_pc(JavaThread* thread) {
 636   oop exception = thread->exception_oop();
 637   address pc = thread->exception_pc();
 638   // Still in Java mode
 639   DEBUG_ONLY(ResetNoHandleMark rnhm);
 640   nmethod* nm = NULL;
 641   address continuation = NULL;
 642   {
 643     // Enter VM mode by calling the helper
 644     ResetNoHandleMark rnhm;
 645     continuation = exception_handler_for_pc_helper(thread, exception, pc, nm);
 646   }
 647   // Back in JAVA, use no oops DON'T safepoint
 648 
 649   // Now check to see if the nmethod we were called from is now deoptimized.
 650   // If so we must return to the deopt blob and deoptimize the nmethod
 651   if (nm != NULL && caller_is_deopted()) {
 652     continuation = SharedRuntime::deopt_blob()->unpack_with_exception_in_tls();
 653   }
 654 
 655   assert(continuation != NULL, "no handler found");
 656   return continuation;
 657 }
 658 
 659 
 660 JRT_ENTRY(void, Runtime1::throw_range_check_exception(JavaThread* thread, int index, arrayOopDesc* a))
 661   NOT_PRODUCT(_throw_range_check_exception_count++;)
 662   const int len = 35;
 663   assert(len < strlen("Index %d out of bounds for length %d"), "Must allocate more space for message.");
 664   char message[2 * jintAsStringSize + len];
 665   sprintf(message, "Index %d out of bounds for length %d", index, a->length());
 666   SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), message);
 667 JRT_END
 668 
 669 
 670 JRT_ENTRY(void, Runtime1::throw_index_exception(JavaThread* thread, int index))
 671   NOT_PRODUCT(_throw_index_exception_count++;)
 672   char message[16];
 673   sprintf(message, "%d", index);
 674   SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IndexOutOfBoundsException(), message);
 675 JRT_END
 676 
 677 
 678 JRT_ENTRY(void, Runtime1::throw_div0_exception(JavaThread* thread))
 679   NOT_PRODUCT(_throw_div0_exception_count++;)
 680   SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero");
 681 JRT_END
 682 
 683 
 684 JRT_ENTRY(void, Runtime1::throw_null_pointer_exception(JavaThread* thread))
 685   NOT_PRODUCT(_throw_null_pointer_exception_count++;)
 686   SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
 687 JRT_END
 688 
 689 
 690 JRT_ENTRY(void, Runtime1::throw_class_cast_exception(JavaThread* thread, oopDesc* object))
 691   NOT_PRODUCT(_throw_class_cast_exception_count++;)
 692   ResourceMark rm(thread);
 693   char* message = SharedRuntime::generate_class_cast_message(
 694     thread, object->klass());
 695   SharedRuntime::throw_and_post_jvmti_exception(
 696     thread, vmSymbols::java_lang_ClassCastException(), message);
 697 JRT_END
 698 
 699 
 700 JRT_ENTRY(void, Runtime1::throw_incompatible_class_change_error(JavaThread* thread))
 701   NOT_PRODUCT(_throw_incompatible_class_change_error_count++;)
 702   ResourceMark rm(thread);
 703   SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError());
 704 JRT_END
 705 
 706 
 707 JRT_ENTRY_NO_ASYNC(void, Runtime1::monitorenter(JavaThread* thread, oopDesc* obj, BasicObjectLock* lock))
 708   NOT_PRODUCT(_monitorenter_slowcase_cnt++;)
 709   if (PrintBiasedLockingStatistics) {
 710     Atomic::inc(BiasedLocking::slow_path_entry_count_addr());
 711   }
 712   Handle h_obj(thread, obj);
 713   if (UseBiasedLocking) {
 714     // Retry fast entry if bias is revoked to avoid unnecessary inflation
 715     ObjectSynchronizer::fast_enter(h_obj, lock->lock(), true, CHECK);
 716   } else {
 717     if (UseFastLocking) {
 718       // When using fast locking, the compiled code has already tried the fast case
 719       assert(obj == lock->obj(), "must match");
 720       ObjectSynchronizer::slow_enter(h_obj, lock->lock(), THREAD);
 721     } else {
 722       lock->set_obj(obj);
 723       ObjectSynchronizer::fast_enter(h_obj, lock->lock(), false, THREAD);
 724     }
 725   }
 726 JRT_END
 727 
 728 
 729 JRT_LEAF(void, Runtime1::monitorexit(JavaThread* thread, BasicObjectLock* lock))
 730   NOT_PRODUCT(_monitorexit_slowcase_cnt++;)
 731   assert(thread == JavaThread::current(), "threads must correspond");
 732   assert(thread->last_Java_sp(), "last_Java_sp must be set");
 733   // monitorexit is non-blocking (leaf routine) => no exceptions can be thrown
 734   EXCEPTION_MARK;
 735 
 736   oop obj = lock->obj();
 737   assert(oopDesc::is_oop(obj), "must be NULL or an object");
 738   if (UseFastLocking) {
 739     // When using fast locking, the compiled code has already tried the fast case
 740     ObjectSynchronizer::slow_exit(obj, lock->lock(), THREAD);
 741   } else {
 742     ObjectSynchronizer::fast_exit(obj, lock->lock(), THREAD);
 743   }
 744 JRT_END
 745 
 746 // Cf. OptoRuntime::deoptimize_caller_frame
 747 JRT_ENTRY(void, Runtime1::deoptimize(JavaThread* thread, jint trap_request))
 748   // Called from within the owner thread, so no need for safepoint
 749   RegisterMap reg_map(thread, false);
 750   frame stub_frame = thread->last_frame();
 751   assert(stub_frame.is_runtime_frame(), "Sanity check");
 752   frame caller_frame = stub_frame.sender(&reg_map);
 753   nmethod* nm = caller_frame.cb()->as_nmethod_or_null();
 754   assert(nm != NULL, "Sanity check");
 755   methodHandle method(thread, nm->method());
 756   assert(nm == CodeCache::find_nmethod(caller_frame.pc()), "Should be the same");
 757   Deoptimization::DeoptAction action = Deoptimization::trap_request_action(trap_request);
 758   Deoptimization::DeoptReason reason = Deoptimization::trap_request_reason(trap_request);
 759 
 760   if (action == Deoptimization::Action_make_not_entrant) {
 761     if (nm->make_not_entrant()) {
 762       if (reason == Deoptimization::Reason_tenured) {
 763         MethodData* trap_mdo = Deoptimization::get_method_data(thread, method, true /*create_if_missing*/);
 764         if (trap_mdo != NULL) {
 765           trap_mdo->inc_tenure_traps();
 766         }
 767       }
 768     }
 769   }
 770 
 771   // Deoptimize the caller frame.
 772   Deoptimization::deoptimize_frame(thread, caller_frame.id());
 773   // Return to the now deoptimized frame.
 774 JRT_END
 775 
 776 
 777 #ifndef DEOPTIMIZE_WHEN_PATCHING
 778 
 779 static Klass* resolve_field_return_klass(const methodHandle& caller, int bci, TRAPS) {
 780   Bytecode_field field_access(caller, bci);
 781   // This can be static or non-static field access
 782   Bytecodes::Code code       = field_access.code();
 783 
 784   // We must load class, initialize class and resolve the field
 785   fieldDescriptor result; // initialize class if needed
 786   constantPoolHandle constants(THREAD, caller->constants());
 787   LinkResolver::resolve_field_access(result, constants, field_access.index(), caller, Bytecodes::java_code(code), CHECK_NULL);
 788   return result.field_holder();
 789 }
 790 
 791 
 792 //
 793 // This routine patches sites where a class wasn't loaded or
 794 // initialized at the time the code was generated.  It handles
 795 // references to classes, fields and forcing of initialization.  Most
 796 // of the cases are straightforward and involving simply forcing
 797 // resolution of a class, rewriting the instruction stream with the
 798 // needed constant and replacing the call in this function with the
 799 // patched code.  The case for static field is more complicated since
 800 // the thread which is in the process of initializing a class can
 801 // access it's static fields but other threads can't so the code
 802 // either has to deoptimize when this case is detected or execute a
 803 // check that the current thread is the initializing thread.  The
 804 // current
 805 //
 806 // Patches basically look like this:
 807 //
 808 //
 809 // patch_site: jmp patch stub     ;; will be patched
 810 // continue:   ...
 811 //             ...
 812 //             ...
 813 //             ...
 814 //
 815 // They have a stub which looks like this:
 816 //
 817 //             ;; patch body
 818 //             movl <const>, reg           (for class constants)
 819 //        <or> movl [reg1 + <const>], reg  (for field offsets)
 820 //        <or> movl reg, [reg1 + <const>]  (for field offsets)
 821 //             <being_init offset> <bytes to copy> <bytes to skip>
 822 // patch_stub: call Runtime1::patch_code (through a runtime stub)
 823 //             jmp patch_site
 824 //
 825 //
 826 // A normal patch is done by rewriting the patch body, usually a move,
 827 // and then copying it into place over top of the jmp instruction
 828 // being careful to flush caches and doing it in an MP-safe way.  The
 829 // constants following the patch body are used to find various pieces
 830 // of the patch relative to the call site for Runtime1::patch_code.
 831 // The case for getstatic and putstatic is more complicated because
 832 // getstatic and putstatic have special semantics when executing while
 833 // the class is being initialized.  getstatic/putstatic on a class
 834 // which is being_initialized may be executed by the initializing
 835 // thread but other threads have to block when they execute it.  This
 836 // is accomplished in compiled code by executing a test of the current
 837 // thread against the initializing thread of the class.  It's emitted
 838 // as boilerplate in their stub which allows the patched code to be
 839 // executed before it's copied back into the main body of the nmethod.
 840 //
 841 // being_init: get_thread(<tmp reg>
 842 //             cmpl [reg1 + <init_thread_offset>], <tmp reg>
 843 //             jne patch_stub
 844 //             movl [reg1 + <const>], reg  (for field offsets)  <or>
 845 //             movl reg, [reg1 + <const>]  (for field offsets)
 846 //             jmp continue
 847 //             <being_init offset> <bytes to copy> <bytes to skip>
 848 // patch_stub: jmp Runtim1::patch_code (through a runtime stub)
 849 //             jmp patch_site
 850 //
 851 // If the class is being initialized the patch body is rewritten and
 852 // the patch site is rewritten to jump to being_init, instead of
 853 // patch_stub.  Whenever this code is executed it checks the current
 854 // thread against the intializing thread so other threads will enter
 855 // the runtime and end up blocked waiting the class to finish
 856 // initializing inside the calls to resolve_field below.  The
 857 // initializing class will continue on it's way.  Once the class is
 858 // fully_initialized, the intializing_thread of the class becomes
 859 // NULL, so the next thread to execute this code will fail the test,
 860 // call into patch_code and complete the patching process by copying
 861 // the patch body back into the main part of the nmethod and resume
 862 // executing.
 863 
 864 // NB:
 865 //
 866 // Patchable instruction sequences inherently exhibit race conditions,
 867 // where thread A is patching an instruction at the same time thread B
 868 // is executing it.  The algorithms we use ensure that any observation
 869 // that B can make on any intermediate states during A's patching will
 870 // always end up with a correct outcome.  This is easiest if there are
 871 // few or no intermediate states.  (Some inline caches have two
 872 // related instructions that must be patched in tandem.  For those,
 873 // intermediate states seem to be unavoidable, but we will get the
 874 // right answer from all possible observation orders.)
 875 //
 876 // When patching the entry instruction at the head of a method, or a
 877 // linkable call instruction inside of a method, we try very hard to
 878 // use a patch sequence which executes as a single memory transaction.
 879 // This means, in practice, that when thread A patches an instruction,
 880 // it should patch a 32-bit or 64-bit word that somehow overlaps the
 881 // instruction or is contained in it.  We believe that memory hardware
 882 // will never break up such a word write, if it is naturally aligned
 883 // for the word being written.  We also know that some CPUs work very
 884 // hard to create atomic updates even of naturally unaligned words,
 885 // but we don't want to bet the farm on this always working.
 886 //
 887 // Therefore, if there is any chance of a race condition, we try to
 888 // patch only naturally aligned words, as single, full-word writes.
 889 
 890 JRT_ENTRY(void, Runtime1::patch_code(JavaThread* thread, Runtime1::StubID stub_id ))
 891   NOT_PRODUCT(_patch_code_slowcase_cnt++;)
 892 
 893   ResourceMark rm(thread);
 894   RegisterMap reg_map(thread, false);
 895   frame runtime_frame = thread->last_frame();
 896   frame caller_frame = runtime_frame.sender(&reg_map);
 897 
 898   // last java frame on stack
 899   vframeStream vfst(thread, true);
 900   assert(!vfst.at_end(), "Java frame must exist");
 901 
 902   methodHandle caller_method(THREAD, vfst.method());
 903   // Note that caller_method->code() may not be same as caller_code because of OSR's
 904   // Note also that in the presence of inlining it is not guaranteed
 905   // that caller_method() == caller_code->method()
 906 
 907   int bci = vfst.bci();
 908   Bytecodes::Code code = caller_method()->java_code_at(bci);
 909 
 910   // this is used by assertions in the access_field_patching_id
 911   BasicType patch_field_type = T_ILLEGAL;
 912   bool deoptimize_for_volatile = false;
 913   bool deoptimize_for_atomic = false;
 914   int patch_field_offset = -1;
 915   Klass* init_klass = NULL; // klass needed by load_klass_patching code
 916   Klass* load_klass = NULL; // klass needed by load_klass_patching code
 917   Handle mirror(THREAD, NULL);                    // oop needed by load_mirror_patching code
 918   Handle appendix(THREAD, NULL);                  // oop needed by appendix_patching code
 919   bool load_klass_or_mirror_patch_id =
 920     (stub_id == Runtime1::load_klass_patching_id || stub_id == Runtime1::load_mirror_patching_id);
 921 
 922   if (stub_id == Runtime1::access_field_patching_id) {
 923 
 924     Bytecode_field field_access(caller_method, bci);
 925     fieldDescriptor result; // initialize class if needed
 926     Bytecodes::Code code = field_access.code();
 927     constantPoolHandle constants(THREAD, caller_method->constants());
 928     LinkResolver::resolve_field_access(result, constants, field_access.index(), caller_method, Bytecodes::java_code(code), CHECK);
 929     patch_field_offset = result.offset();
 930 
 931     // If we're patching a field which is volatile then at compile it
 932     // must not have been know to be volatile, so the generated code
 933     // isn't correct for a volatile reference.  The nmethod has to be
 934     // deoptimized so that the code can be regenerated correctly.
 935     // This check is only needed for access_field_patching since this
 936     // is the path for patching field offsets.  load_klass is only
 937     // used for patching references to oops which don't need special
 938     // handling in the volatile case.
 939 
 940     deoptimize_for_volatile = result.access_flags().is_volatile();
 941 
 942     // If we are patching a field which should be atomic, then
 943     // the generated code is not correct either, force deoptimizing.
 944     // We need to only cover T_LONG and T_DOUBLE fields, as we can
 945     // break access atomicity only for them.
 946 
 947     // Strictly speaking, the deoptimization on 64-bit platforms
 948     // is unnecessary, and T_LONG stores on 32-bit platforms need
 949     // to be handled by special patching code when AlwaysAtomicAccesses
 950     // becomes product feature. At this point, we are still going
 951     // for the deoptimization for consistency against volatile
 952     // accesses.
 953 
 954     patch_field_type = result.field_type();
 955     deoptimize_for_atomic = (AlwaysAtomicAccesses && (patch_field_type == T_DOUBLE || patch_field_type == T_LONG));
 956 
 957   } else if (load_klass_or_mirror_patch_id) {
 958     Klass* k = NULL;
 959     switch (code) {
 960       case Bytecodes::_putstatic:
 961       case Bytecodes::_getstatic:
 962         { Klass* klass = resolve_field_return_klass(caller_method, bci, CHECK);
 963           init_klass = klass;
 964           mirror = Handle(THREAD, klass->java_mirror());
 965         }
 966         break;
 967       case Bytecodes::_new:
 968         { Bytecode_new bnew(caller_method(), caller_method->bcp_from(bci));
 969           k = caller_method->constants()->klass_at(bnew.index(), CHECK);
 970         }
 971         break;
 972       case Bytecodes::_multianewarray:
 973         { Bytecode_multianewarray mna(caller_method(), caller_method->bcp_from(bci));
 974           k = caller_method->constants()->klass_at(mna.index(), CHECK);
 975         }
 976         break;
 977       case Bytecodes::_instanceof:
 978         { Bytecode_instanceof io(caller_method(), caller_method->bcp_from(bci));
 979           k = caller_method->constants()->klass_at(io.index(), CHECK);
 980         }
 981         break;
 982       case Bytecodes::_checkcast:
 983         { Bytecode_checkcast cc(caller_method(), caller_method->bcp_from(bci));
 984           k = caller_method->constants()->klass_at(cc.index(), CHECK);
 985         }
 986         break;
 987       case Bytecodes::_anewarray:
 988         { Bytecode_anewarray anew(caller_method(), caller_method->bcp_from(bci));
 989           Klass* ek = caller_method->constants()->klass_at(anew.index(), CHECK);
 990           k = ek->array_klass(CHECK);
 991         }
 992         break;
 993       case Bytecodes::_ldc:
 994       case Bytecodes::_ldc_w:
 995         {
 996           Bytecode_loadconstant cc(caller_method, bci);
 997           oop m = cc.resolve_constant(CHECK);
 998           mirror = Handle(THREAD, m);
 999         }
1000         break;
1001       default: fatal("unexpected bytecode for load_klass_or_mirror_patch_id");
1002     }
1003     load_klass = k;
1004   } else if (stub_id == load_appendix_patching_id) {
1005     Bytecode_invoke bytecode(caller_method, bci);
1006     Bytecodes::Code bc = bytecode.invoke_code();
1007 
1008     CallInfo info;
1009     constantPoolHandle pool(thread, caller_method->constants());
1010     int index = bytecode.index();
1011     LinkResolver::resolve_invoke(info, Handle(), pool, index, bc, CHECK);
1012     switch (bc) {
1013       case Bytecodes::_invokehandle: {
1014         int cache_index = ConstantPool::decode_cpcache_index(index, true);
1015         assert(cache_index >= 0 && cache_index < pool->cache()->length(), "unexpected cache index");
1016         ConstantPoolCacheEntry* cpce = pool->cache()->entry_at(cache_index);
1017         cpce->set_method_handle(pool, info);
1018         appendix = Handle(THREAD, cpce->appendix_if_resolved(pool)); // just in case somebody already resolved the entry
1019         break;
1020       }
1021       case Bytecodes::_invokedynamic: {
1022         ConstantPoolCacheEntry* cpce = pool->invokedynamic_cp_cache_entry_at(index);
1023         cpce->set_dynamic_call(pool, info);
1024         appendix = Handle(THREAD, cpce->appendix_if_resolved(pool)); // just in case somebody already resolved the entry
1025         break;
1026       }
1027       default: fatal("unexpected bytecode for load_appendix_patching_id");
1028     }
1029   } else {
1030     ShouldNotReachHere();
1031   }
1032 
1033   if (deoptimize_for_volatile || deoptimize_for_atomic) {
1034     // At compile time we assumed the field wasn't volatile/atomic but after
1035     // loading it turns out it was volatile/atomic so we have to throw the
1036     // compiled code out and let it be regenerated.
1037     if (TracePatching) {
1038       if (deoptimize_for_volatile) {
1039         tty->print_cr("Deoptimizing for patching volatile field reference");
1040       }
1041       if (deoptimize_for_atomic) {
1042         tty->print_cr("Deoptimizing for patching atomic field reference");
1043       }
1044     }
1045 
1046     // It's possible the nmethod was invalidated in the last
1047     // safepoint, but if it's still alive then make it not_entrant.
1048     nmethod* nm = CodeCache::find_nmethod(caller_frame.pc());
1049     if (nm != NULL) {
1050       nm->make_not_entrant();
1051     }
1052 
1053     Deoptimization::deoptimize_frame(thread, caller_frame.id());
1054 
1055     // Return to the now deoptimized frame.
1056   }
1057 
1058   // Now copy code back
1059 
1060   {
1061     MutexLocker ml_patch (Patching_lock, Mutex::_no_safepoint_check_flag);
1062     //
1063     // Deoptimization may have happened while we waited for the lock.
1064     // In that case we don't bother to do any patching we just return
1065     // and let the deopt happen
1066     if (!caller_is_deopted()) {
1067       NativeGeneralJump* jump = nativeGeneralJump_at(caller_frame.pc());
1068       address instr_pc = jump->jump_destination();
1069       NativeInstruction* ni = nativeInstruction_at(instr_pc);
1070       if (ni->is_jump() ) {
1071         // the jump has not been patched yet
1072         // The jump destination is slow case and therefore not part of the stubs
1073         // (stubs are only for StaticCalls)
1074 
1075         // format of buffer
1076         //    ....
1077         //    instr byte 0     <-- copy_buff
1078         //    instr byte 1
1079         //    ..
1080         //    instr byte n-1
1081         //      n
1082         //    ....             <-- call destination
1083 
1084         address stub_location = caller_frame.pc() + PatchingStub::patch_info_offset();
1085         unsigned char* byte_count = (unsigned char*) (stub_location - 1);
1086         unsigned char* byte_skip = (unsigned char*) (stub_location - 2);
1087         unsigned char* being_initialized_entry_offset = (unsigned char*) (stub_location - 3);
1088         address copy_buff = stub_location - *byte_skip - *byte_count;
1089         address being_initialized_entry = stub_location - *being_initialized_entry_offset;
1090         if (TracePatching) {
1091           ttyLocker ttyl;
1092           tty->print_cr(" Patching %s at bci %d at address " INTPTR_FORMAT "  (%s)", Bytecodes::name(code), bci,
1093                         p2i(instr_pc), (stub_id == Runtime1::access_field_patching_id) ? "field" : "klass");
1094           nmethod* caller_code = CodeCache::find_nmethod(caller_frame.pc());
1095           assert(caller_code != NULL, "nmethod not found");
1096 
1097           // NOTE we use pc() not original_pc() because we already know they are
1098           // identical otherwise we'd have never entered this block of code
1099 
1100           const ImmutableOopMap* map = caller_code->oop_map_for_return_address(caller_frame.pc());
1101           assert(map != NULL, "null check");
1102           map->print();
1103           tty->cr();
1104 
1105           Disassembler::decode(copy_buff, copy_buff + *byte_count, tty);
1106         }
1107         // depending on the code below, do_patch says whether to copy the patch body back into the nmethod
1108         bool do_patch = true;
1109         if (stub_id == Runtime1::access_field_patching_id) {
1110           // The offset may not be correct if the class was not loaded at code generation time.
1111           // Set it now.
1112           NativeMovRegMem* n_move = nativeMovRegMem_at(copy_buff);
1113           assert(n_move->offset() == 0 || (n_move->offset() == 4 && (patch_field_type == T_DOUBLE || patch_field_type == T_LONG)), "illegal offset for type");
1114           assert(patch_field_offset >= 0, "illegal offset");
1115           n_move->add_offset_in_bytes(patch_field_offset);
1116         } else if (load_klass_or_mirror_patch_id) {
1117           // If a getstatic or putstatic is referencing a klass which
1118           // isn't fully initialized, the patch body isn't copied into
1119           // place until initialization is complete.  In this case the
1120           // patch site is setup so that any threads besides the
1121           // initializing thread are forced to come into the VM and
1122           // block.
1123           do_patch = (code != Bytecodes::_getstatic && code != Bytecodes::_putstatic) ||
1124                      InstanceKlass::cast(init_klass)->is_initialized();
1125           NativeGeneralJump* jump = nativeGeneralJump_at(instr_pc);
1126           if (jump->jump_destination() == being_initialized_entry) {
1127             assert(do_patch == true, "initialization must be complete at this point");
1128           } else {
1129             // patch the instruction <move reg, klass>
1130             NativeMovConstReg* n_copy = nativeMovConstReg_at(copy_buff);
1131 
1132             assert(n_copy->data() == 0 ||
1133                    n_copy->data() == (intptr_t)Universe::non_oop_word(),
1134                    "illegal init value");
1135             if (stub_id == Runtime1::load_klass_patching_id) {
1136               assert(load_klass != NULL, "klass not set");
1137               n_copy->set_data((intx) (load_klass));
1138             } else {
1139               assert(mirror() != NULL, "klass not set");
1140               // Don't need a G1 pre-barrier here since we assert above that data isn't an oop.
1141               n_copy->set_data(cast_from_oop<intx>(mirror()));
1142             }
1143 
1144             if (TracePatching) {
1145               Disassembler::decode(copy_buff, copy_buff + *byte_count, tty);
1146             }
1147           }
1148         } else if (stub_id == Runtime1::load_appendix_patching_id) {
1149           NativeMovConstReg* n_copy = nativeMovConstReg_at(copy_buff);
1150           assert(n_copy->data() == 0 ||
1151                  n_copy->data() == (intptr_t)Universe::non_oop_word(),
1152                  "illegal init value");
1153           n_copy->set_data(cast_from_oop<intx>(appendix()));
1154 
1155           if (TracePatching) {
1156             Disassembler::decode(copy_buff, copy_buff + *byte_count, tty);
1157           }
1158         } else {
1159           ShouldNotReachHere();
1160         }
1161 
1162 #if defined(SPARC) || defined(PPC32)
1163         if (load_klass_or_mirror_patch_id ||
1164             stub_id == Runtime1::load_appendix_patching_id) {
1165           // Update the location in the nmethod with the proper
1166           // metadata.  When the code was generated, a NULL was stuffed
1167           // in the metadata table and that table needs to be update to
1168           // have the right value.  On intel the value is kept
1169           // directly in the instruction instead of in the metadata
1170           // table, so set_data above effectively updated the value.
1171           nmethod* nm = CodeCache::find_nmethod(instr_pc);
1172           assert(nm != NULL, "invalid nmethod_pc");
1173           RelocIterator mds(nm, copy_buff, copy_buff + 1);
1174           bool found = false;
1175           while (mds.next() && !found) {
1176             if (mds.type() == relocInfo::oop_type) {
1177               assert(stub_id == Runtime1::load_mirror_patching_id ||
1178                      stub_id == Runtime1::load_appendix_patching_id, "wrong stub id");
1179               oop_Relocation* r = mds.oop_reloc();
1180               oop* oop_adr = r->oop_addr();
1181               *oop_adr = stub_id == Runtime1::load_mirror_patching_id ? mirror() : appendix();
1182               r->fix_oop_relocation();
1183               found = true;
1184             } else if (mds.type() == relocInfo::metadata_type) {
1185               assert(stub_id == Runtime1::load_klass_patching_id, "wrong stub id");
1186               metadata_Relocation* r = mds.metadata_reloc();
1187               Metadata** metadata_adr = r->metadata_addr();
1188               *metadata_adr = load_klass;
1189               r->fix_metadata_relocation();
1190               found = true;
1191             }
1192           }
1193           assert(found, "the metadata must exist!");
1194         }
1195 #endif
1196         if (do_patch) {
1197           // replace instructions
1198           // first replace the tail, then the call
1199 #ifdef ARM
1200           if((load_klass_or_mirror_patch_id ||
1201               stub_id == Runtime1::load_appendix_patching_id) &&
1202               nativeMovConstReg_at(copy_buff)->is_pc_relative()) {
1203             nmethod* nm = CodeCache::find_nmethod(instr_pc);
1204             address addr = NULL;
1205             assert(nm != NULL, "invalid nmethod_pc");
1206             RelocIterator mds(nm, copy_buff, copy_buff + 1);
1207             while (mds.next()) {
1208               if (mds.type() == relocInfo::oop_type) {
1209                 assert(stub_id == Runtime1::load_mirror_patching_id ||
1210                        stub_id == Runtime1::load_appendix_patching_id, "wrong stub id");
1211                 oop_Relocation* r = mds.oop_reloc();
1212                 addr = (address)r->oop_addr();
1213                 break;
1214               } else if (mds.type() == relocInfo::metadata_type) {
1215                 assert(stub_id == Runtime1::load_klass_patching_id, "wrong stub id");
1216                 metadata_Relocation* r = mds.metadata_reloc();
1217                 addr = (address)r->metadata_addr();
1218                 break;
1219               }
1220             }
1221             assert(addr != NULL, "metadata relocation must exist");
1222             copy_buff -= *byte_count;
1223             NativeMovConstReg* n_copy2 = nativeMovConstReg_at(copy_buff);
1224             n_copy2->set_pc_relative_offset(addr, instr_pc);
1225           }
1226 #endif
1227 
1228           for (int i = NativeGeneralJump::instruction_size; i < *byte_count; i++) {
1229             address ptr = copy_buff + i;
1230             int a_byte = (*ptr) & 0xFF;
1231             address dst = instr_pc + i;
1232             *(unsigned char*)dst = (unsigned char) a_byte;
1233           }
1234           ICache::invalidate_range(instr_pc, *byte_count);
1235           NativeGeneralJump::replace_mt_safe(instr_pc, copy_buff);
1236 
1237           if (load_klass_or_mirror_patch_id ||
1238               stub_id == Runtime1::load_appendix_patching_id) {
1239             relocInfo::relocType rtype =
1240               (stub_id == Runtime1::load_klass_patching_id) ?
1241                                    relocInfo::metadata_type :
1242                                    relocInfo::oop_type;
1243             // update relocInfo to metadata
1244             nmethod* nm = CodeCache::find_nmethod(instr_pc);
1245             assert(nm != NULL, "invalid nmethod_pc");
1246 
1247             // The old patch site is now a move instruction so update
1248             // the reloc info so that it will get updated during
1249             // future GCs.
1250             RelocIterator iter(nm, (address)instr_pc, (address)(instr_pc + 1));
1251             relocInfo::change_reloc_info_for_address(&iter, (address) instr_pc,
1252                                                      relocInfo::none, rtype);
1253 #ifdef SPARC
1254             // Sparc takes two relocations for an metadata so update the second one.
1255             address instr_pc2 = instr_pc + NativeMovConstReg::add_offset;
1256             RelocIterator iter2(nm, instr_pc2, instr_pc2 + 1);
1257             relocInfo::change_reloc_info_for_address(&iter2, (address) instr_pc2,
1258                                                      relocInfo::none, rtype);
1259 #endif
1260 #ifdef PPC32
1261           { address instr_pc2 = instr_pc + NativeMovConstReg::lo_offset;
1262             RelocIterator iter2(nm, instr_pc2, instr_pc2 + 1);
1263             relocInfo::change_reloc_info_for_address(&iter2, (address) instr_pc2,
1264                                                      relocInfo::none, rtype);
1265           }
1266 #endif
1267           }
1268 
1269         } else {
1270           ICache::invalidate_range(copy_buff, *byte_count);
1271           NativeGeneralJump::insert_unconditional(instr_pc, being_initialized_entry);
1272         }
1273       }
1274     }
1275   }
1276 
1277   // If we are patching in a non-perm oop, make sure the nmethod
1278   // is on the right list.
1279   {
1280     MutexLocker ml_code (CodeCache_lock, Mutex::_no_safepoint_check_flag);
1281     nmethod* nm = CodeCache::find_nmethod(caller_frame.pc());
1282     guarantee(nm != NULL, "only nmethods can contain non-perm oops");
1283 
1284     // Since we've patched some oops in the nmethod,
1285     // (re)register it with the heap.
1286     Continuation::nmethod_patched(nm);
1287     Universe::heap()->register_nmethod(nm);
1288   }
1289 JRT_END
1290 
1291 #else // DEOPTIMIZE_WHEN_PATCHING
1292 
1293 JRT_ENTRY(void, Runtime1::patch_code(JavaThread* thread, Runtime1::StubID stub_id ))
1294   RegisterMap reg_map(thread, false);
1295 
1296   NOT_PRODUCT(_patch_code_slowcase_cnt++;)
1297   if (TracePatching) {
1298     tty->print_cr("Deoptimizing because patch is needed");
1299   }
1300 
1301   frame runtime_frame = thread->last_frame();
1302   frame caller_frame = runtime_frame.sender(&reg_map);
1303 
1304   // It's possible the nmethod was invalidated in the last
1305   // safepoint, but if it's still alive then make it not_entrant.
1306   nmethod* nm = CodeCache::find_nmethod(caller_frame.pc());
1307   if (nm != NULL) {
1308     nm->make_not_entrant();
1309   }
1310 
1311   Deoptimization::deoptimize_frame(thread, caller_frame.id());
1312 
1313   // Return to the now deoptimized frame.
1314 JRT_END
1315 
1316 #endif // DEOPTIMIZE_WHEN_PATCHING
1317 
1318 //
1319 // Entry point for compiled code. We want to patch a nmethod.
1320 // We don't do a normal VM transition here because we want to
1321 // know after the patching is complete and any safepoint(s) are taken
1322 // if the calling nmethod was deoptimized. We do this by calling a
1323 // helper method which does the normal VM transition and when it
1324 // completes we can check for deoptimization. This simplifies the
1325 // assembly code in the cpu directories.
1326 //
1327 int Runtime1::move_klass_patching(JavaThread* thread) {
1328 //
1329 // NOTE: we are still in Java
1330 //
1331   Thread* THREAD = thread;
1332   debug_only(NoHandleMark nhm;)
1333   {
1334     // Enter VM mode
1335 
1336     ResetNoHandleMark rnhm;
1337     patch_code(thread, load_klass_patching_id);
1338   }
1339   // Back in JAVA, use no oops DON'T safepoint
1340 
1341   // Return true if calling code is deoptimized
1342 
1343   return caller_is_deopted();
1344 }
1345 
1346 int Runtime1::move_mirror_patching(JavaThread* thread) {
1347 //
1348 // NOTE: we are still in Java
1349 //
1350   Thread* THREAD = thread;
1351   debug_only(NoHandleMark nhm;)
1352   {
1353     // Enter VM mode
1354 
1355     ResetNoHandleMark rnhm;
1356     patch_code(thread, load_mirror_patching_id);
1357   }
1358   // Back in JAVA, use no oops DON'T safepoint
1359 
1360   // Return true if calling code is deoptimized
1361 
1362   return caller_is_deopted();
1363 }
1364 
1365 int Runtime1::move_appendix_patching(JavaThread* thread) {
1366 //
1367 // NOTE: we are still in Java
1368 //
1369   Thread* THREAD = thread;
1370   debug_only(NoHandleMark nhm;)
1371   {
1372     // Enter VM mode
1373 
1374     ResetNoHandleMark rnhm;
1375     patch_code(thread, load_appendix_patching_id);
1376   }
1377   // Back in JAVA, use no oops DON'T safepoint
1378 
1379   // Return true if calling code is deoptimized
1380 
1381   return caller_is_deopted();
1382 }
1383 //
1384 // Entry point for compiled code. We want to patch a nmethod.
1385 // We don't do a normal VM transition here because we want to
1386 // know after the patching is complete and any safepoint(s) are taken
1387 // if the calling nmethod was deoptimized. We do this by calling a
1388 // helper method which does the normal VM transition and when it
1389 // completes we can check for deoptimization. This simplifies the
1390 // assembly code in the cpu directories.
1391 //
1392 
1393 int Runtime1::access_field_patching(JavaThread* thread) {
1394 //
1395 // NOTE: we are still in Java
1396 //
1397   Thread* THREAD = thread;
1398   debug_only(NoHandleMark nhm;)
1399   {
1400     // Enter VM mode
1401 
1402     ResetNoHandleMark rnhm;
1403     patch_code(thread, access_field_patching_id);
1404   }
1405   // Back in JAVA, use no oops DON'T safepoint
1406 
1407   // Return true if calling code is deoptimized
1408 
1409   return caller_is_deopted();
1410 JRT_END
1411 
1412 
1413 JRT_LEAF(void, Runtime1::trace_block_entry(jint block_id))
1414   // for now we just print out the block id
1415   tty->print("%d ", block_id);
1416 JRT_END
1417 
1418 
1419 JRT_LEAF(int, Runtime1::is_instance_of(oopDesc* mirror, oopDesc* obj))
1420   // had to return int instead of bool, otherwise there may be a mismatch
1421   // between the C calling convention and the Java one.
1422   // e.g., on x86, GCC may clear only %al when returning a bool false, but
1423   // JVM takes the whole %eax as the return value, which may misinterpret
1424   // the return value as a boolean true.
1425 
1426   assert(mirror != NULL, "should null-check on mirror before calling");
1427   Klass* k = java_lang_Class::as_Klass(mirror);
1428   return (k != NULL && obj != NULL && obj->is_a(k)) ? 1 : 0;
1429 JRT_END
1430 
1431 JRT_ENTRY(void, Runtime1::predicate_failed_trap(JavaThread* thread))
1432   ResourceMark rm;
1433 
1434   assert(!TieredCompilation, "incompatible with tiered compilation");
1435 
1436   RegisterMap reg_map(thread, false);
1437   frame runtime_frame = thread->last_frame();
1438   frame caller_frame = runtime_frame.sender(&reg_map);
1439 
1440   nmethod* nm = CodeCache::find_nmethod(caller_frame.pc());
1441   assert (nm != NULL, "no more nmethod?");
1442   nm->make_not_entrant();
1443 
1444   methodHandle m(nm->method());
1445   MethodData* mdo = m->method_data();
1446 
1447   if (mdo == NULL && !HAS_PENDING_EXCEPTION) {
1448     // Build an MDO.  Ignore errors like OutOfMemory;
1449     // that simply means we won't have an MDO to update.
1450     Method::build_interpreter_method_data(m, THREAD);
1451     if (HAS_PENDING_EXCEPTION) {
1452       assert((PENDING_EXCEPTION->is_a(SystemDictionary::OutOfMemoryError_klass())), "we expect only an OOM error here");
1453       CLEAR_PENDING_EXCEPTION;
1454     }
1455     mdo = m->method_data();
1456   }
1457 
1458   if (mdo != NULL) {
1459     mdo->inc_trap_count(Deoptimization::Reason_none);
1460   }
1461 
1462   if (TracePredicateFailedTraps) {
1463     stringStream ss1, ss2;
1464     vframeStream vfst(thread);
1465     methodHandle inlinee = methodHandle(vfst.method());
1466     inlinee->print_short_name(&ss1);
1467     m->print_short_name(&ss2);
1468     tty->print_cr("Predicate failed trap in method %s at bci %d inlined in %s at pc " INTPTR_FORMAT, ss1.as_string(), vfst.bci(), ss2.as_string(), p2i(caller_frame.pc()));
1469   }
1470 
1471 
1472   Deoptimization::deoptimize_frame(thread, caller_frame.id());
1473 
1474 JRT_END
1475 
1476 #ifndef PRODUCT
1477 void Runtime1::print_statistics() {
1478   tty->print_cr("C1 Runtime statistics:");
1479   tty->print_cr(" _resolve_invoke_virtual_cnt:     %d", SharedRuntime::_resolve_virtual_ctr);
1480   tty->print_cr(" _resolve_invoke_opt_virtual_cnt: %d", SharedRuntime::_resolve_opt_virtual_ctr);
1481   tty->print_cr(" _resolve_invoke_static_cnt:      %d", SharedRuntime::_resolve_static_ctr);
1482   tty->print_cr(" _handle_wrong_method_cnt:        %d", SharedRuntime::_wrong_method_ctr);
1483   tty->print_cr(" _ic_miss_cnt:                    %d", SharedRuntime::_ic_miss_ctr);
1484   tty->print_cr(" _generic_arraycopy_cnt:          %d", _generic_arraycopy_cnt);
1485   tty->print_cr(" _generic_arraycopystub_cnt:      %d", _generic_arraycopystub_cnt);
1486   tty->print_cr(" _byte_arraycopy_cnt:             %d", _byte_arraycopy_stub_cnt);
1487   tty->print_cr(" _short_arraycopy_cnt:            %d", _short_arraycopy_stub_cnt);
1488   tty->print_cr(" _int_arraycopy_cnt:              %d", _int_arraycopy_stub_cnt);
1489   tty->print_cr(" _long_arraycopy_cnt:             %d", _long_arraycopy_stub_cnt);
1490   tty->print_cr(" _oop_arraycopy_cnt:              %d", _oop_arraycopy_stub_cnt);
1491   tty->print_cr(" _arraycopy_slowcase_cnt:         %d", _arraycopy_slowcase_cnt);
1492   tty->print_cr(" _arraycopy_checkcast_cnt:        %d", _arraycopy_checkcast_cnt);
1493   tty->print_cr(" _arraycopy_checkcast_attempt_cnt:%d", _arraycopy_checkcast_attempt_cnt);
1494 
1495   tty->print_cr(" _new_type_array_slowcase_cnt:    %d", _new_type_array_slowcase_cnt);
1496   tty->print_cr(" _new_object_array_slowcase_cnt:  %d", _new_object_array_slowcase_cnt);
1497   tty->print_cr(" _new_instance_slowcase_cnt:      %d", _new_instance_slowcase_cnt);
1498   tty->print_cr(" _new_multi_array_slowcase_cnt:   %d", _new_multi_array_slowcase_cnt);
1499   tty->print_cr(" _monitorenter_slowcase_cnt:      %d", _monitorenter_slowcase_cnt);
1500   tty->print_cr(" _monitorexit_slowcase_cnt:       %d", _monitorexit_slowcase_cnt);
1501   tty->print_cr(" _patch_code_slowcase_cnt:        %d", _patch_code_slowcase_cnt);
1502 
1503   tty->print_cr(" _throw_range_check_exception_count:            %d:", _throw_range_check_exception_count);
1504   tty->print_cr(" _throw_index_exception_count:                  %d:", _throw_index_exception_count);
1505   tty->print_cr(" _throw_div0_exception_count:                   %d:", _throw_div0_exception_count);
1506   tty->print_cr(" _throw_null_pointer_exception_count:           %d:", _throw_null_pointer_exception_count);
1507   tty->print_cr(" _throw_class_cast_exception_count:             %d:", _throw_class_cast_exception_count);
1508   tty->print_cr(" _throw_incompatible_class_change_error_count:  %d:", _throw_incompatible_class_change_error_count);
1509   tty->print_cr(" _throw_array_store_exception_count:            %d:", _throw_array_store_exception_count);
1510   tty->print_cr(" _throw_count:                                  %d:", _throw_count);
1511 
1512   SharedRuntime::print_ic_miss_histogram();
1513   tty->cr();
1514 }
1515 #endif // PRODUCT