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