1 /*
   2  * Copyright (c) 1997, 2017, 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 "aot/aotLoader.hpp"
  27 #include "classfile/stringTable.hpp"
  28 #include "classfile/systemDictionary.hpp"
  29 #include "classfile/vmSymbols.hpp"
  30 #include "code/codeCache.hpp"
  31 #include "code/compiledIC.hpp"
  32 #include "code/scopeDesc.hpp"
  33 #include "code/vtableStubs.hpp"
  34 #include "compiler/abstractCompiler.hpp"
  35 #include "compiler/compileBroker.hpp"
  36 #include "compiler/disassembler.hpp"
  37 #include "gc/shared/gcLocker.inline.hpp"
  38 #include "interpreter/interpreter.hpp"
  39 #include "interpreter/interpreterRuntime.hpp"
  40 #include "logging/log.hpp"
  41 #include "memory/metaspaceShared.hpp"
  42 #include "memory/oopFactory.hpp"
  43 #include "memory/resourceArea.hpp"
  44 #include "memory/universe.inline.hpp"
  45 #include "oops/fieldStreams.hpp"
  46 #include "oops/klass.hpp"
  47 #include "oops/objArrayKlass.hpp"
  48 #include "oops/objArrayOop.inline.hpp"
  49 #include "oops/oop.inline.hpp"
  50 #include "oops/valueKlass.hpp"
  51 #include "prims/forte.hpp"
  52 #include "prims/jvmtiExport.hpp"
  53 #include "prims/methodHandles.hpp"
  54 #include "prims/nativeLookup.hpp"
  55 #include "runtime/arguments.hpp"
  56 #include "runtime/atomic.hpp"
  57 #include "runtime/biasedLocking.hpp"
  58 #include "runtime/compilationPolicy.hpp"
  59 #include "runtime/handles.inline.hpp"
  60 #include "runtime/init.hpp"
  61 #include "runtime/interfaceSupport.hpp"
  62 #include "runtime/java.hpp"
  63 #include "runtime/javaCalls.hpp"
  64 #include "runtime/sharedRuntime.hpp"
  65 #include "runtime/stubRoutines.hpp"
  66 #include "runtime/vframe.hpp"
  67 #include "runtime/vframeArray.hpp"
  68 #include "trace/tracing.hpp"
  69 #include "utilities/copy.hpp"
  70 #include "utilities/dtrace.hpp"
  71 #include "utilities/events.hpp"
  72 #include "utilities/hashtable.inline.hpp"
  73 #include "utilities/macros.hpp"
  74 #include "utilities/xmlstream.hpp"
  75 #ifdef COMPILER1
  76 #include "c1/c1_Runtime1.hpp"
  77 #endif
  78 
  79 // Shared stub locations
  80 RuntimeStub*        SharedRuntime::_wrong_method_blob;
  81 RuntimeStub*        SharedRuntime::_wrong_method_abstract_blob;
  82 RuntimeStub*        SharedRuntime::_ic_miss_blob;
  83 RuntimeStub*        SharedRuntime::_resolve_opt_virtual_call_blob;
  84 RuntimeStub*        SharedRuntime::_resolve_virtual_call_blob;
  85 RuntimeStub*        SharedRuntime::_resolve_static_call_blob;
  86 address             SharedRuntime::_resolve_static_call_entry;
  87 
  88 DeoptimizationBlob* SharedRuntime::_deopt_blob;
  89 SafepointBlob*      SharedRuntime::_polling_page_vectors_safepoint_handler_blob;
  90 SafepointBlob*      SharedRuntime::_polling_page_safepoint_handler_blob;
  91 SafepointBlob*      SharedRuntime::_polling_page_return_handler_blob;
  92 
  93 #ifdef COMPILER2
  94 UncommonTrapBlob*   SharedRuntime::_uncommon_trap_blob;
  95 #endif // COMPILER2
  96 
  97 
  98 //----------------------------generate_stubs-----------------------------------
  99 void SharedRuntime::generate_stubs() {
 100   _wrong_method_blob                   = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method),          "wrong_method_stub");
 101   _wrong_method_abstract_blob          = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method_abstract), "wrong_method_abstract_stub");
 102   _ic_miss_blob                        = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::handle_wrong_method_ic_miss),  "ic_miss_stub");
 103   _resolve_opt_virtual_call_blob       = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_opt_virtual_call_C),   "resolve_opt_virtual_call");
 104   _resolve_virtual_call_blob           = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_virtual_call_C),       "resolve_virtual_call");
 105   _resolve_static_call_blob            = generate_resolve_blob(CAST_FROM_FN_PTR(address, SharedRuntime::resolve_static_call_C),        "resolve_static_call");
 106   _resolve_static_call_entry           = _resolve_static_call_blob->entry_point();
 107 
 108 #if defined(COMPILER2) || INCLUDE_JVMCI
 109   // Vectors are generated only by C2 and JVMCI.
 110   bool support_wide = is_wide_vector(MaxVectorSize);
 111   if (support_wide) {
 112     _polling_page_vectors_safepoint_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_VECTOR_LOOP);
 113   }
 114 #endif // COMPILER2 || INCLUDE_JVMCI
 115   _polling_page_safepoint_handler_blob = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_LOOP);
 116   _polling_page_return_handler_blob    = generate_handler_blob(CAST_FROM_FN_PTR(address, SafepointSynchronize::handle_polling_page_exception), POLL_AT_RETURN);
 117 
 118   generate_deopt_blob();
 119 
 120 #ifdef COMPILER2
 121   generate_uncommon_trap_blob();
 122 #endif // COMPILER2
 123 }
 124 
 125 #include <math.h>
 126 
 127 // Implementation of SharedRuntime
 128 
 129 #ifndef PRODUCT
 130 // For statistics
 131 int SharedRuntime::_ic_miss_ctr = 0;
 132 int SharedRuntime::_wrong_method_ctr = 0;
 133 int SharedRuntime::_resolve_static_ctr = 0;
 134 int SharedRuntime::_resolve_virtual_ctr = 0;
 135 int SharedRuntime::_resolve_opt_virtual_ctr = 0;
 136 int SharedRuntime::_implicit_null_throws = 0;
 137 int SharedRuntime::_implicit_div0_throws = 0;
 138 int SharedRuntime::_throw_null_ctr = 0;
 139 
 140 int SharedRuntime::_nof_normal_calls = 0;
 141 int SharedRuntime::_nof_optimized_calls = 0;
 142 int SharedRuntime::_nof_inlined_calls = 0;
 143 int SharedRuntime::_nof_megamorphic_calls = 0;
 144 int SharedRuntime::_nof_static_calls = 0;
 145 int SharedRuntime::_nof_inlined_static_calls = 0;
 146 int SharedRuntime::_nof_interface_calls = 0;
 147 int SharedRuntime::_nof_optimized_interface_calls = 0;
 148 int SharedRuntime::_nof_inlined_interface_calls = 0;
 149 int SharedRuntime::_nof_megamorphic_interface_calls = 0;
 150 int SharedRuntime::_nof_removable_exceptions = 0;
 151 
 152 int SharedRuntime::_new_instance_ctr=0;
 153 int SharedRuntime::_new_array_ctr=0;
 154 int SharedRuntime::_multi1_ctr=0;
 155 int SharedRuntime::_multi2_ctr=0;
 156 int SharedRuntime::_multi3_ctr=0;
 157 int SharedRuntime::_multi4_ctr=0;
 158 int SharedRuntime::_multi5_ctr=0;
 159 int SharedRuntime::_mon_enter_stub_ctr=0;
 160 int SharedRuntime::_mon_exit_stub_ctr=0;
 161 int SharedRuntime::_mon_enter_ctr=0;
 162 int SharedRuntime::_mon_exit_ctr=0;
 163 int SharedRuntime::_partial_subtype_ctr=0;
 164 int SharedRuntime::_jbyte_array_copy_ctr=0;
 165 int SharedRuntime::_jshort_array_copy_ctr=0;
 166 int SharedRuntime::_jint_array_copy_ctr=0;
 167 int SharedRuntime::_jlong_array_copy_ctr=0;
 168 int SharedRuntime::_oop_array_copy_ctr=0;
 169 int SharedRuntime::_checkcast_array_copy_ctr=0;
 170 int SharedRuntime::_unsafe_array_copy_ctr=0;
 171 int SharedRuntime::_generic_array_copy_ctr=0;
 172 int SharedRuntime::_slow_array_copy_ctr=0;
 173 int SharedRuntime::_find_handler_ctr=0;
 174 int SharedRuntime::_rethrow_ctr=0;
 175 
 176 int     SharedRuntime::_ICmiss_index                    = 0;
 177 int     SharedRuntime::_ICmiss_count[SharedRuntime::maxICmiss_count];
 178 address SharedRuntime::_ICmiss_at[SharedRuntime::maxICmiss_count];
 179 
 180 
 181 void SharedRuntime::trace_ic_miss(address at) {
 182   for (int i = 0; i < _ICmiss_index; i++) {
 183     if (_ICmiss_at[i] == at) {
 184       _ICmiss_count[i]++;
 185       return;
 186     }
 187   }
 188   int index = _ICmiss_index++;
 189   if (_ICmiss_index >= maxICmiss_count) _ICmiss_index = maxICmiss_count - 1;
 190   _ICmiss_at[index] = at;
 191   _ICmiss_count[index] = 1;
 192 }
 193 
 194 void SharedRuntime::print_ic_miss_histogram() {
 195   if (ICMissHistogram) {
 196     tty->print_cr("IC Miss Histogram:");
 197     int tot_misses = 0;
 198     for (int i = 0; i < _ICmiss_index; i++) {
 199       tty->print_cr("  at: " INTPTR_FORMAT "  nof: %d", p2i(_ICmiss_at[i]), _ICmiss_count[i]);
 200       tot_misses += _ICmiss_count[i];
 201     }
 202     tty->print_cr("Total IC misses: %7d", tot_misses);
 203   }
 204 }
 205 #endif // PRODUCT
 206 
 207 #if INCLUDE_ALL_GCS
 208 
 209 // G1 write-barrier pre: executed before a pointer store.
 210 JRT_LEAF(void, SharedRuntime::g1_wb_pre(oopDesc* orig, JavaThread *thread))
 211   if (orig == NULL) {
 212     assert(false, "should be optimized out");
 213     return;
 214   }
 215   assert(orig->is_oop(true /* ignore mark word */), "Error");
 216   // store the original value that was in the field reference
 217   thread->satb_mark_queue().enqueue(orig);
 218 JRT_END
 219 
 220 // G1 write-barrier post: executed after a pointer store.
 221 JRT_LEAF(void, SharedRuntime::g1_wb_post(void* card_addr, JavaThread* thread))
 222   thread->dirty_card_queue().enqueue(card_addr);
 223 JRT_END
 224 
 225 #endif // INCLUDE_ALL_GCS
 226 
 227 
 228 JRT_LEAF(jlong, SharedRuntime::lmul(jlong y, jlong x))
 229   return x * y;
 230 JRT_END
 231 
 232 
 233 JRT_LEAF(jlong, SharedRuntime::ldiv(jlong y, jlong x))
 234   if (x == min_jlong && y == CONST64(-1)) {
 235     return x;
 236   } else {
 237     return x / y;
 238   }
 239 JRT_END
 240 
 241 
 242 JRT_LEAF(jlong, SharedRuntime::lrem(jlong y, jlong x))
 243   if (x == min_jlong && y == CONST64(-1)) {
 244     return 0;
 245   } else {
 246     return x % y;
 247   }
 248 JRT_END
 249 
 250 
 251 const juint  float_sign_mask  = 0x7FFFFFFF;
 252 const juint  float_infinity   = 0x7F800000;
 253 const julong double_sign_mask = CONST64(0x7FFFFFFFFFFFFFFF);
 254 const julong double_infinity  = CONST64(0x7FF0000000000000);
 255 
 256 JRT_LEAF(jfloat, SharedRuntime::frem(jfloat  x, jfloat  y))
 257 #ifdef _WIN64
 258   // 64-bit Windows on amd64 returns the wrong values for
 259   // infinity operands.
 260   union { jfloat f; juint i; } xbits, ybits;
 261   xbits.f = x;
 262   ybits.f = y;
 263   // x Mod Infinity == x unless x is infinity
 264   if (((xbits.i & float_sign_mask) != float_infinity) &&
 265        ((ybits.i & float_sign_mask) == float_infinity) ) {
 266     return x;
 267   }
 268   return ((jfloat)fmod_winx64((double)x, (double)y));
 269 #else
 270   return ((jfloat)fmod((double)x,(double)y));
 271 #endif
 272 JRT_END
 273 
 274 
 275 JRT_LEAF(jdouble, SharedRuntime::drem(jdouble x, jdouble y))
 276 #ifdef _WIN64
 277   union { jdouble d; julong l; } xbits, ybits;
 278   xbits.d = x;
 279   ybits.d = y;
 280   // x Mod Infinity == x unless x is infinity
 281   if (((xbits.l & double_sign_mask) != double_infinity) &&
 282        ((ybits.l & double_sign_mask) == double_infinity) ) {
 283     return x;
 284   }
 285   return ((jdouble)fmod_winx64((double)x, (double)y));
 286 #else
 287   return ((jdouble)fmod((double)x,(double)y));
 288 #endif
 289 JRT_END
 290 
 291 #ifdef __SOFTFP__
 292 JRT_LEAF(jfloat, SharedRuntime::fadd(jfloat x, jfloat y))
 293   return x + y;
 294 JRT_END
 295 
 296 JRT_LEAF(jfloat, SharedRuntime::fsub(jfloat x, jfloat y))
 297   return x - y;
 298 JRT_END
 299 
 300 JRT_LEAF(jfloat, SharedRuntime::fmul(jfloat x, jfloat y))
 301   return x * y;
 302 JRT_END
 303 
 304 JRT_LEAF(jfloat, SharedRuntime::fdiv(jfloat x, jfloat y))
 305   return x / y;
 306 JRT_END
 307 
 308 JRT_LEAF(jdouble, SharedRuntime::dadd(jdouble x, jdouble y))
 309   return x + y;
 310 JRT_END
 311 
 312 JRT_LEAF(jdouble, SharedRuntime::dsub(jdouble x, jdouble y))
 313   return x - y;
 314 JRT_END
 315 
 316 JRT_LEAF(jdouble, SharedRuntime::dmul(jdouble x, jdouble y))
 317   return x * y;
 318 JRT_END
 319 
 320 JRT_LEAF(jdouble, SharedRuntime::ddiv(jdouble x, jdouble y))
 321   return x / y;
 322 JRT_END
 323 
 324 JRT_LEAF(jfloat, SharedRuntime::i2f(jint x))
 325   return (jfloat)x;
 326 JRT_END
 327 
 328 JRT_LEAF(jdouble, SharedRuntime::i2d(jint x))
 329   return (jdouble)x;
 330 JRT_END
 331 
 332 JRT_LEAF(jdouble, SharedRuntime::f2d(jfloat x))
 333   return (jdouble)x;
 334 JRT_END
 335 
 336 JRT_LEAF(int,  SharedRuntime::fcmpl(float x, float y))
 337   return x>y ? 1 : (x==y ? 0 : -1);  /* x<y or is_nan*/
 338 JRT_END
 339 
 340 JRT_LEAF(int,  SharedRuntime::fcmpg(float x, float y))
 341   return x<y ? -1 : (x==y ? 0 : 1);  /* x>y or is_nan */
 342 JRT_END
 343 
 344 JRT_LEAF(int,  SharedRuntime::dcmpl(double x, double y))
 345   return x>y ? 1 : (x==y ? 0 : -1); /* x<y or is_nan */
 346 JRT_END
 347 
 348 JRT_LEAF(int,  SharedRuntime::dcmpg(double x, double y))
 349   return x<y ? -1 : (x==y ? 0 : 1);  /* x>y or is_nan */
 350 JRT_END
 351 
 352 // Functions to return the opposite of the aeabi functions for nan.
 353 JRT_LEAF(int, SharedRuntime::unordered_fcmplt(float x, float y))
 354   return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
 355 JRT_END
 356 
 357 JRT_LEAF(int, SharedRuntime::unordered_dcmplt(double x, double y))
 358   return (x < y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
 359 JRT_END
 360 
 361 JRT_LEAF(int, SharedRuntime::unordered_fcmple(float x, float y))
 362   return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
 363 JRT_END
 364 
 365 JRT_LEAF(int, SharedRuntime::unordered_dcmple(double x, double y))
 366   return (x <= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
 367 JRT_END
 368 
 369 JRT_LEAF(int, SharedRuntime::unordered_fcmpge(float x, float y))
 370   return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
 371 JRT_END
 372 
 373 JRT_LEAF(int, SharedRuntime::unordered_dcmpge(double x, double y))
 374   return (x >= y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
 375 JRT_END
 376 
 377 JRT_LEAF(int, SharedRuntime::unordered_fcmpgt(float x, float y))
 378   return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
 379 JRT_END
 380 
 381 JRT_LEAF(int, SharedRuntime::unordered_dcmpgt(double x, double y))
 382   return (x > y) ? 1 : ((g_isnan(x) || g_isnan(y)) ? 1 : 0);
 383 JRT_END
 384 
 385 // Intrinsics make gcc generate code for these.
 386 float  SharedRuntime::fneg(float f)   {
 387   return -f;
 388 }
 389 
 390 double SharedRuntime::dneg(double f)  {
 391   return -f;
 392 }
 393 
 394 #endif // __SOFTFP__
 395 
 396 #if defined(__SOFTFP__) || defined(E500V2)
 397 // Intrinsics make gcc generate code for these.
 398 double SharedRuntime::dabs(double f)  {
 399   return (f <= (double)0.0) ? (double)0.0 - f : f;
 400 }
 401 
 402 #endif
 403 
 404 #if defined(__SOFTFP__) || defined(PPC)
 405 double SharedRuntime::dsqrt(double f) {
 406   return sqrt(f);
 407 }
 408 #endif
 409 
 410 JRT_LEAF(jint, SharedRuntime::f2i(jfloat  x))
 411   if (g_isnan(x))
 412     return 0;
 413   if (x >= (jfloat) max_jint)
 414     return max_jint;
 415   if (x <= (jfloat) min_jint)
 416     return min_jint;
 417   return (jint) x;
 418 JRT_END
 419 
 420 
 421 JRT_LEAF(jlong, SharedRuntime::f2l(jfloat  x))
 422   if (g_isnan(x))
 423     return 0;
 424   if (x >= (jfloat) max_jlong)
 425     return max_jlong;
 426   if (x <= (jfloat) min_jlong)
 427     return min_jlong;
 428   return (jlong) x;
 429 JRT_END
 430 
 431 
 432 JRT_LEAF(jint, SharedRuntime::d2i(jdouble x))
 433   if (g_isnan(x))
 434     return 0;
 435   if (x >= (jdouble) max_jint)
 436     return max_jint;
 437   if (x <= (jdouble) min_jint)
 438     return min_jint;
 439   return (jint) x;
 440 JRT_END
 441 
 442 
 443 JRT_LEAF(jlong, SharedRuntime::d2l(jdouble x))
 444   if (g_isnan(x))
 445     return 0;
 446   if (x >= (jdouble) max_jlong)
 447     return max_jlong;
 448   if (x <= (jdouble) min_jlong)
 449     return min_jlong;
 450   return (jlong) x;
 451 JRT_END
 452 
 453 
 454 JRT_LEAF(jfloat, SharedRuntime::d2f(jdouble x))
 455   return (jfloat)x;
 456 JRT_END
 457 
 458 
 459 JRT_LEAF(jfloat, SharedRuntime::l2f(jlong x))
 460   return (jfloat)x;
 461 JRT_END
 462 
 463 
 464 JRT_LEAF(jdouble, SharedRuntime::l2d(jlong x))
 465   return (jdouble)x;
 466 JRT_END
 467 
 468 // Exception handling across interpreter/compiler boundaries
 469 //
 470 // exception_handler_for_return_address(...) returns the continuation address.
 471 // The continuation address is the entry point of the exception handler of the
 472 // previous frame depending on the return address.
 473 
 474 address SharedRuntime::raw_exception_handler_for_return_address(JavaThread* thread, address return_address) {
 475   assert(frame::verify_return_pc(return_address), "must be a return address: " INTPTR_FORMAT, p2i(return_address));
 476   assert(thread->frames_to_pop_failed_realloc() == 0 || Interpreter::contains(return_address), "missed frames to pop?");
 477 
 478   // Reset method handle flag.
 479   thread->set_is_method_handle_return(false);
 480 
 481 #if INCLUDE_JVMCI
 482   // JVMCI's ExceptionHandlerStub expects the thread local exception PC to be clear
 483   // and other exception handler continuations do not read it
 484   thread->set_exception_pc(NULL);
 485 #endif // INCLUDE_JVMCI
 486 
 487   // The fastest case first
 488   CodeBlob* blob = CodeCache::find_blob(return_address);
 489   CompiledMethod* nm = (blob != NULL) ? blob->as_compiled_method_or_null() : NULL;
 490   if (nm != NULL) {
 491     // Set flag if return address is a method handle call site.
 492     thread->set_is_method_handle_return(nm->is_method_handle_return(return_address));
 493     // native nmethods don't have exception handlers
 494     assert(!nm->is_native_method(), "no exception handler");
 495     assert(nm->header_begin() != nm->exception_begin(), "no exception handler");
 496     if (nm->is_deopt_pc(return_address)) {
 497       // If we come here because of a stack overflow, the stack may be
 498       // unguarded. Reguard the stack otherwise if we return to the
 499       // deopt blob and the stack bang causes a stack overflow we
 500       // crash.
 501       bool guard_pages_enabled = thread->stack_guards_enabled();
 502       if (!guard_pages_enabled) guard_pages_enabled = thread->reguard_stack();
 503       if (thread->reserved_stack_activation() != thread->stack_base()) {
 504         thread->set_reserved_stack_activation(thread->stack_base());
 505       }
 506       assert(guard_pages_enabled, "stack banging in deopt blob may cause crash");
 507       return SharedRuntime::deopt_blob()->unpack_with_exception();
 508     } else {
 509       return nm->exception_begin();
 510     }
 511   }
 512 
 513   // Entry code
 514   if (StubRoutines::returns_to_call_stub(return_address)) {
 515     return StubRoutines::catch_exception_entry();
 516   }
 517   // Interpreted code
 518   if (Interpreter::contains(return_address)) {
 519     return Interpreter::rethrow_exception_entry();
 520   }
 521 
 522   guarantee(blob == NULL || !blob->is_runtime_stub(), "caller should have skipped stub");
 523   guarantee(!VtableStubs::contains(return_address), "NULL exceptions in vtables should have been handled already!");
 524 
 525 #ifndef PRODUCT
 526   { ResourceMark rm;
 527     tty->print_cr("No exception handler found for exception at " INTPTR_FORMAT " - potential problems:", p2i(return_address));
 528     tty->print_cr("a) exception happened in (new?) code stubs/buffers that is not handled here");
 529     tty->print_cr("b) other problem");
 530   }
 531 #endif // PRODUCT
 532 
 533   ShouldNotReachHere();
 534   return NULL;
 535 }
 536 
 537 
 538 JRT_LEAF(address, SharedRuntime::exception_handler_for_return_address(JavaThread* thread, address return_address))
 539   return raw_exception_handler_for_return_address(thread, return_address);
 540 JRT_END
 541 
 542 
 543 address SharedRuntime::get_poll_stub(address pc) {
 544   address stub;
 545   // Look up the code blob
 546   CodeBlob *cb = CodeCache::find_blob(pc);
 547 
 548   // Should be an nmethod
 549   assert(cb && cb->is_compiled(), "safepoint polling: pc must refer to an nmethod");
 550 
 551   // Look up the relocation information
 552   assert(((CompiledMethod*)cb)->is_at_poll_or_poll_return(pc),
 553     "safepoint polling: type must be poll");
 554 
 555 #ifdef ASSERT
 556   if (!((NativeInstruction*)pc)->is_safepoint_poll()) {
 557     tty->print_cr("bad pc: " PTR_FORMAT, p2i(pc));
 558     Disassembler::decode(cb);
 559     fatal("Only polling locations are used for safepoint");
 560   }
 561 #endif
 562 
 563   bool at_poll_return = ((CompiledMethod*)cb)->is_at_poll_return(pc);
 564   bool has_wide_vectors = ((CompiledMethod*)cb)->has_wide_vectors();
 565   if (at_poll_return) {
 566     assert(SharedRuntime::polling_page_return_handler_blob() != NULL,
 567            "polling page return stub not created yet");
 568     stub = SharedRuntime::polling_page_return_handler_blob()->entry_point();
 569   } else if (has_wide_vectors) {
 570     assert(SharedRuntime::polling_page_vectors_safepoint_handler_blob() != NULL,
 571            "polling page vectors safepoint stub not created yet");
 572     stub = SharedRuntime::polling_page_vectors_safepoint_handler_blob()->entry_point();
 573   } else {
 574     assert(SharedRuntime::polling_page_safepoint_handler_blob() != NULL,
 575            "polling page safepoint stub not created yet");
 576     stub = SharedRuntime::polling_page_safepoint_handler_blob()->entry_point();
 577   }
 578   log_debug(safepoint)("... found polling page %s exception at pc = "
 579                        INTPTR_FORMAT ", stub =" INTPTR_FORMAT,
 580                        at_poll_return ? "return" : "loop",
 581                        (intptr_t)pc, (intptr_t)stub);
 582   return stub;
 583 }
 584 
 585 
 586 oop SharedRuntime::retrieve_receiver( Symbol* sig, frame caller ) {
 587   assert(caller.is_interpreted_frame(), "");
 588   int args_size = ArgumentSizeComputer(sig).size() + 1;
 589   assert(args_size <= caller.interpreter_frame_expression_stack_size(), "receiver must be on interpreter stack");
 590   oop result = cast_to_oop(*caller.interpreter_frame_tos_at(args_size - 1));
 591   assert(Universe::heap()->is_in(result) && result->is_oop(), "receiver must be an oop");
 592   return result;
 593 }
 594 
 595 
 596 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Handle h_exception) {
 597   if (JvmtiExport::can_post_on_exceptions()) {
 598     vframeStream vfst(thread, true);
 599     methodHandle method = methodHandle(thread, vfst.method());
 600     address bcp = method()->bcp_from(vfst.bci());
 601     JvmtiExport::post_exception_throw(thread, method(), bcp, h_exception());
 602   }
 603   Exceptions::_throw(thread, __FILE__, __LINE__, h_exception);
 604 }
 605 
 606 void SharedRuntime::throw_and_post_jvmti_exception(JavaThread *thread, Symbol* name, const char *message) {
 607   Handle h_exception = Exceptions::new_exception(thread, name, message);
 608   throw_and_post_jvmti_exception(thread, h_exception);
 609 }
 610 
 611 // The interpreter code to call this tracing function is only
 612 // called/generated when UL is on for redefine, class and has the right level
 613 // and tags. Since obsolete methods are never compiled, we don't have
 614 // to modify the compilers to generate calls to this function.
 615 //
 616 JRT_LEAF(int, SharedRuntime::rc_trace_method_entry(
 617     JavaThread* thread, Method* method))
 618   if (method->is_obsolete()) {
 619     // We are calling an obsolete method, but this is not necessarily
 620     // an error. Our method could have been redefined just after we
 621     // fetched the Method* from the constant pool.
 622     ResourceMark rm;
 623     log_trace(redefine, class, obsolete)("calling obsolete method '%s'", method->name_and_sig_as_C_string());
 624   }
 625   return 0;
 626 JRT_END
 627 
 628 // ret_pc points into caller; we are returning caller's exception handler
 629 // for given exception
 630 address SharedRuntime::compute_compiled_exc_handler(CompiledMethod* cm, address ret_pc, Handle& exception,
 631                                                     bool force_unwind, bool top_frame_only, bool& recursive_exception_occurred) {
 632   assert(cm != NULL, "must exist");
 633   ResourceMark rm;
 634 
 635 #if INCLUDE_JVMCI
 636   if (cm->is_compiled_by_jvmci()) {
 637     // lookup exception handler for this pc
 638     int catch_pco = ret_pc - cm->code_begin();
 639     ExceptionHandlerTable table(cm);
 640     HandlerTableEntry *t = table.entry_for(catch_pco, -1, 0);
 641     if (t != NULL) {
 642       return cm->code_begin() + t->pco();
 643     } else {
 644       // there is no exception handler for this pc => deoptimize
 645       cm->make_not_entrant();
 646 
 647       // Use Deoptimization::deoptimize for all of its side-effects:
 648       // revoking biases of monitors, gathering traps statistics, logging...
 649       // it also patches the return pc but we do not care about that
 650       // since we return a continuation to the deopt_blob below.
 651       JavaThread* thread = JavaThread::current();
 652       RegisterMap reg_map(thread, UseBiasedLocking);
 653       frame runtime_frame = thread->last_frame();
 654       frame caller_frame = runtime_frame.sender(&reg_map);
 655       Deoptimization::deoptimize(thread, caller_frame, &reg_map, Deoptimization::Reason_not_compiled_exception_handler);
 656 
 657       return SharedRuntime::deopt_blob()->unpack_with_exception_in_tls();
 658     }
 659   }
 660 #endif // INCLUDE_JVMCI
 661 
 662   nmethod* nm = cm->as_nmethod();
 663   ScopeDesc* sd = nm->scope_desc_at(ret_pc);
 664   // determine handler bci, if any
 665   EXCEPTION_MARK;
 666 
 667   int handler_bci = -1;
 668   int scope_depth = 0;
 669   if (!force_unwind) {
 670     int bci = sd->bci();
 671     bool recursive_exception = false;
 672     do {
 673       bool skip_scope_increment = false;
 674       // exception handler lookup
 675       Klass* ek = exception->klass();
 676       methodHandle mh(THREAD, sd->method());
 677       handler_bci = Method::fast_exception_handler_bci_for(mh, ek, bci, THREAD);
 678       if (HAS_PENDING_EXCEPTION) {
 679         recursive_exception = true;
 680         // We threw an exception while trying to find the exception handler.
 681         // Transfer the new exception to the exception handle which will
 682         // be set into thread local storage, and do another lookup for an
 683         // exception handler for this exception, this time starting at the
 684         // BCI of the exception handler which caused the exception to be
 685         // thrown (bugs 4307310 and 4546590). Set "exception" reference
 686         // argument to ensure that the correct exception is thrown (4870175).
 687         recursive_exception_occurred = true;
 688         exception = Handle(THREAD, PENDING_EXCEPTION);
 689         CLEAR_PENDING_EXCEPTION;
 690         if (handler_bci >= 0) {
 691           bci = handler_bci;
 692           handler_bci = -1;
 693           skip_scope_increment = true;
 694         }
 695       }
 696       else {
 697         recursive_exception = false;
 698       }
 699       if (!top_frame_only && handler_bci < 0 && !skip_scope_increment) {
 700         sd = sd->sender();
 701         if (sd != NULL) {
 702           bci = sd->bci();
 703         }
 704         ++scope_depth;
 705       }
 706     } while (recursive_exception || (!top_frame_only && handler_bci < 0 && sd != NULL));
 707   }
 708 
 709   // found handling method => lookup exception handler
 710   int catch_pco = ret_pc - nm->code_begin();
 711 
 712   ExceptionHandlerTable table(nm);
 713   HandlerTableEntry *t = table.entry_for(catch_pco, handler_bci, scope_depth);
 714   if (t == NULL && (nm->is_compiled_by_c1() || handler_bci != -1)) {
 715     // Allow abbreviated catch tables.  The idea is to allow a method
 716     // to materialize its exceptions without committing to the exact
 717     // routing of exceptions.  In particular this is needed for adding
 718     // a synthetic handler to unlock monitors when inlining
 719     // synchronized methods since the unlock path isn't represented in
 720     // the bytecodes.
 721     t = table.entry_for(catch_pco, -1, 0);
 722   }
 723 
 724 #ifdef COMPILER1
 725   if (t == NULL && nm->is_compiled_by_c1()) {
 726     assert(nm->unwind_handler_begin() != NULL, "");
 727     return nm->unwind_handler_begin();
 728   }
 729 #endif
 730 
 731   if (t == NULL) {
 732     ttyLocker ttyl;
 733     tty->print_cr("MISSING EXCEPTION HANDLER for pc " INTPTR_FORMAT " and handler bci %d", p2i(ret_pc), handler_bci);
 734     tty->print_cr("   Exception:");
 735     exception->print();
 736     tty->cr();
 737     tty->print_cr(" Compiled exception table :");
 738     table.print();
 739     nm->print_code();
 740     guarantee(false, "missing exception handler");
 741     return NULL;
 742   }
 743 
 744   return nm->code_begin() + t->pco();
 745 }
 746 
 747 JRT_ENTRY(void, SharedRuntime::throw_AbstractMethodError(JavaThread* thread))
 748   // These errors occur only at call sites
 749   throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_AbstractMethodError());
 750 JRT_END
 751 
 752 JRT_ENTRY(void, SharedRuntime::throw_IncompatibleClassChangeError(JavaThread* thread))
 753   // These errors occur only at call sites
 754   throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError(), "vtable stub");
 755 JRT_END
 756 
 757 JRT_ENTRY(void, SharedRuntime::throw_ArithmeticException(JavaThread* thread))
 758   throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero");
 759 JRT_END
 760 
 761 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException(JavaThread* thread))
 762   throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
 763 JRT_END
 764 
 765 JRT_ENTRY(void, SharedRuntime::throw_NullPointerException_at_call(JavaThread* thread))
 766   // This entry point is effectively only used for NullPointerExceptions which occur at inline
 767   // cache sites (when the callee activation is not yet set up) so we are at a call site
 768   throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException());
 769 JRT_END
 770 
 771 JRT_ENTRY(void, SharedRuntime::throw_StackOverflowError(JavaThread* thread))
 772   throw_StackOverflowError_common(thread, false);
 773 JRT_END
 774 
 775 JRT_ENTRY(void, SharedRuntime::throw_delayed_StackOverflowError(JavaThread* thread))
 776   throw_StackOverflowError_common(thread, true);
 777 JRT_END
 778 
 779 void SharedRuntime::throw_StackOverflowError_common(JavaThread* thread, bool delayed) {
 780   // We avoid using the normal exception construction in this case because
 781   // it performs an upcall to Java, and we're already out of stack space.
 782   Thread* THREAD = thread;
 783   Klass* k = SystemDictionary::StackOverflowError_klass();
 784   oop exception_oop = InstanceKlass::cast(k)->allocate_instance(CHECK);
 785   if (delayed) {
 786     java_lang_Throwable::set_message(exception_oop,
 787                                      Universe::delayed_stack_overflow_error_message());
 788   }
 789   Handle exception (thread, exception_oop);
 790   if (StackTraceInThrowable) {
 791     java_lang_Throwable::fill_in_stack_trace(exception);
 792   }
 793   // Increment counter for hs_err file reporting
 794   Atomic::inc(&Exceptions::_stack_overflow_errors);
 795   throw_and_post_jvmti_exception(thread, exception);
 796 }
 797 
 798 #if INCLUDE_JVMCI
 799 address SharedRuntime::deoptimize_for_implicit_exception(JavaThread* thread, address pc, CompiledMethod* nm, int deopt_reason) {
 800   assert(deopt_reason > Deoptimization::Reason_none && deopt_reason < Deoptimization::Reason_LIMIT, "invalid deopt reason");
 801   thread->set_jvmci_implicit_exception_pc(pc);
 802   thread->set_pending_deoptimization(Deoptimization::make_trap_request((Deoptimization::DeoptReason)deopt_reason, Deoptimization::Action_reinterpret));
 803   return (SharedRuntime::deopt_blob()->implicit_exception_uncommon_trap());
 804 }
 805 #endif // INCLUDE_JVMCI
 806 
 807 address SharedRuntime::continuation_for_implicit_exception(JavaThread* thread,
 808                                                            address pc,
 809                                                            SharedRuntime::ImplicitExceptionKind exception_kind)
 810 {
 811   address target_pc = NULL;
 812 
 813   if (Interpreter::contains(pc)) {
 814 #ifdef CC_INTERP
 815     // C++ interpreter doesn't throw implicit exceptions
 816     ShouldNotReachHere();
 817 #else
 818     switch (exception_kind) {
 819       case IMPLICIT_NULL:           return Interpreter::throw_NullPointerException_entry();
 820       case IMPLICIT_DIVIDE_BY_ZERO: return Interpreter::throw_ArithmeticException_entry();
 821       case STACK_OVERFLOW:          return Interpreter::throw_StackOverflowError_entry();
 822       default:                      ShouldNotReachHere();
 823     }
 824 #endif // !CC_INTERP
 825   } else {
 826     switch (exception_kind) {
 827       case STACK_OVERFLOW: {
 828         // Stack overflow only occurs upon frame setup; the callee is
 829         // going to be unwound. Dispatch to a shared runtime stub
 830         // which will cause the StackOverflowError to be fabricated
 831         // and processed.
 832         // Stack overflow should never occur during deoptimization:
 833         // the compiled method bangs the stack by as much as the
 834         // interpreter would need in case of a deoptimization. The
 835         // deoptimization blob and uncommon trap blob bang the stack
 836         // in a debug VM to verify the correctness of the compiled
 837         // method stack banging.
 838         assert(thread->deopt_mark() == NULL, "no stack overflow from deopt blob/uncommon trap");
 839         Events::log_exception(thread, "StackOverflowError at " INTPTR_FORMAT, p2i(pc));
 840         return StubRoutines::throw_StackOverflowError_entry();
 841       }
 842 
 843       case IMPLICIT_NULL: {
 844         if (VtableStubs::contains(pc)) {
 845           // We haven't yet entered the callee frame. Fabricate an
 846           // exception and begin dispatching it in the caller. Since
 847           // the caller was at a call site, it's safe to destroy all
 848           // caller-saved registers, as these entry points do.
 849           VtableStub* vt_stub = VtableStubs::stub_containing(pc);
 850 
 851           // If vt_stub is NULL, then return NULL to signal handler to report the SEGV error.
 852           if (vt_stub == NULL) return NULL;
 853 
 854           if (vt_stub->is_abstract_method_error(pc)) {
 855             assert(!vt_stub->is_vtable_stub(), "should never see AbstractMethodErrors from vtable-type VtableStubs");
 856             Events::log_exception(thread, "AbstractMethodError at " INTPTR_FORMAT, p2i(pc));
 857             return StubRoutines::throw_AbstractMethodError_entry();
 858           } else {
 859             Events::log_exception(thread, "NullPointerException at vtable entry " INTPTR_FORMAT, p2i(pc));
 860             return StubRoutines::throw_NullPointerException_at_call_entry();
 861           }
 862         } else {
 863           CodeBlob* cb = CodeCache::find_blob(pc);
 864 
 865           // If code blob is NULL, then return NULL to signal handler to report the SEGV error.
 866           if (cb == NULL) return NULL;
 867 
 868           // Exception happened in CodeCache. Must be either:
 869           // 1. Inline-cache check in C2I handler blob,
 870           // 2. Inline-cache check in nmethod, or
 871           // 3. Implicit null exception in nmethod
 872 
 873           if (!cb->is_compiled()) {
 874             bool is_in_blob = cb->is_adapter_blob() || cb->is_method_handles_adapter_blob();
 875             if (!is_in_blob) {
 876               // Allow normal crash reporting to handle this
 877               return NULL;
 878             }
 879             Events::log_exception(thread, "NullPointerException in code blob at " INTPTR_FORMAT, p2i(pc));
 880             // There is no handler here, so we will simply unwind.
 881             return StubRoutines::throw_NullPointerException_at_call_entry();
 882           }
 883 
 884           // Otherwise, it's a compiled method.  Consult its exception handlers.
 885           CompiledMethod* cm = (CompiledMethod*)cb;
 886           if (cm->inlinecache_check_contains(pc)) {
 887             // exception happened inside inline-cache check code
 888             // => the nmethod is not yet active (i.e., the frame
 889             // is not set up yet) => use return address pushed by
 890             // caller => don't push another return address
 891             Events::log_exception(thread, "NullPointerException in IC check " INTPTR_FORMAT, p2i(pc));
 892             return StubRoutines::throw_NullPointerException_at_call_entry();
 893           }
 894 
 895           if (cm->method()->is_method_handle_intrinsic()) {
 896             // exception happened inside MH dispatch code, similar to a vtable stub
 897             Events::log_exception(thread, "NullPointerException in MH adapter " INTPTR_FORMAT, p2i(pc));
 898             return StubRoutines::throw_NullPointerException_at_call_entry();
 899           }
 900 
 901 #ifndef PRODUCT
 902           _implicit_null_throws++;
 903 #endif
 904 #if INCLUDE_JVMCI
 905           if (cm->is_compiled_by_jvmci() && cm->pc_desc_at(pc) != NULL) {
 906             // If there's no PcDesc then we'll die way down inside of
 907             // deopt instead of just getting normal error reporting,
 908             // so only go there if it will succeed.
 909             return deoptimize_for_implicit_exception(thread, pc, cm, Deoptimization::Reason_null_check);
 910           } else {
 911 #endif // INCLUDE_JVMCI
 912           assert (cm->is_nmethod(), "Expect nmethod");
 913           target_pc = ((nmethod*)cm)->continuation_for_implicit_exception(pc);
 914 #if INCLUDE_JVMCI
 915           }
 916 #endif // INCLUDE_JVMCI
 917           // If there's an unexpected fault, target_pc might be NULL,
 918           // in which case we want to fall through into the normal
 919           // error handling code.
 920         }
 921 
 922         break; // fall through
 923       }
 924 
 925 
 926       case IMPLICIT_DIVIDE_BY_ZERO: {
 927         CompiledMethod* cm = CodeCache::find_compiled(pc);
 928         guarantee(cm != NULL, "must have containing compiled method for implicit division-by-zero exceptions");
 929 #ifndef PRODUCT
 930         _implicit_div0_throws++;
 931 #endif
 932 #if INCLUDE_JVMCI
 933         if (cm->is_compiled_by_jvmci() && cm->pc_desc_at(pc) != NULL) {
 934           return deoptimize_for_implicit_exception(thread, pc, cm, Deoptimization::Reason_div0_check);
 935         } else {
 936 #endif // INCLUDE_JVMCI
 937         target_pc = cm->continuation_for_implicit_exception(pc);
 938 #if INCLUDE_JVMCI
 939         }
 940 #endif // INCLUDE_JVMCI
 941         // If there's an unexpected fault, target_pc might be NULL,
 942         // in which case we want to fall through into the normal
 943         // error handling code.
 944         break; // fall through
 945       }
 946 
 947       default: ShouldNotReachHere();
 948     }
 949 
 950     assert(exception_kind == IMPLICIT_NULL || exception_kind == IMPLICIT_DIVIDE_BY_ZERO, "wrong implicit exception kind");
 951 
 952     if (exception_kind == IMPLICIT_NULL) {
 953 #ifndef PRODUCT
 954       // for AbortVMOnException flag
 955       Exceptions::debug_check_abort("java.lang.NullPointerException");
 956 #endif //PRODUCT
 957       Events::log_exception(thread, "Implicit null exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, p2i(pc), p2i(target_pc));
 958     } else {
 959 #ifndef PRODUCT
 960       // for AbortVMOnException flag
 961       Exceptions::debug_check_abort("java.lang.ArithmeticException");
 962 #endif //PRODUCT
 963       Events::log_exception(thread, "Implicit division by zero exception at " INTPTR_FORMAT " to " INTPTR_FORMAT, p2i(pc), p2i(target_pc));
 964     }
 965     return target_pc;
 966   }
 967 
 968   ShouldNotReachHere();
 969   return NULL;
 970 }
 971 
 972 
 973 /**
 974  * Throws an java/lang/UnsatisfiedLinkError.  The address of this method is
 975  * installed in the native function entry of all native Java methods before
 976  * they get linked to their actual native methods.
 977  *
 978  * \note
 979  * This method actually never gets called!  The reason is because
 980  * the interpreter's native entries call NativeLookup::lookup() which
 981  * throws the exception when the lookup fails.  The exception is then
 982  * caught and forwarded on the return from NativeLookup::lookup() call
 983  * before the call to the native function.  This might change in the future.
 984  */
 985 JNI_ENTRY(void*, throw_unsatisfied_link_error(JNIEnv* env, ...))
 986 {
 987   // We return a bad value here to make sure that the exception is
 988   // forwarded before we look at the return value.
 989   THROW_(vmSymbols::java_lang_UnsatisfiedLinkError(), (void*)badJNIHandle);
 990 }
 991 JNI_END
 992 
 993 address SharedRuntime::native_method_throw_unsatisfied_link_error_entry() {
 994   return CAST_FROM_FN_PTR(address, &throw_unsatisfied_link_error);
 995 }
 996 
 997 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::register_finalizer(JavaThread* thread, oopDesc* obj))
 998 #if INCLUDE_JVMCI
 999   if (!obj->klass()->has_finalizer()) {
1000     return;
1001   }
1002 #endif // INCLUDE_JVMCI
1003   assert(obj->is_oop(), "must be a valid oop");
1004   assert(obj->klass()->has_finalizer(), "shouldn't be here otherwise");
1005   InstanceKlass::register_finalizer(instanceOop(obj), CHECK);
1006 JRT_END
1007 
1008 
1009 jlong SharedRuntime::get_java_tid(Thread* thread) {
1010   if (thread != NULL) {
1011     if (thread->is_Java_thread()) {
1012       oop obj = ((JavaThread*)thread)->threadObj();
1013       return (obj == NULL) ? 0 : java_lang_Thread::thread_id(obj);
1014     }
1015   }
1016   return 0;
1017 }
1018 
1019 /**
1020  * This function ought to be a void function, but cannot be because
1021  * it gets turned into a tail-call on sparc, which runs into dtrace bug
1022  * 6254741.  Once that is fixed we can remove the dummy return value.
1023  */
1024 int SharedRuntime::dtrace_object_alloc(oopDesc* o, int size) {
1025   return dtrace_object_alloc_base(Thread::current(), o, size);
1026 }
1027 
1028 int SharedRuntime::dtrace_object_alloc_base(Thread* thread, oopDesc* o, int size) {
1029   assert(DTraceAllocProbes, "wrong call");
1030   Klass* klass = o->klass();
1031   Symbol* name = klass->name();
1032   HOTSPOT_OBJECT_ALLOC(
1033                    get_java_tid(thread),
1034                    (char *) name->bytes(), name->utf8_length(), size * HeapWordSize);
1035   return 0;
1036 }
1037 
1038 JRT_LEAF(int, SharedRuntime::dtrace_method_entry(
1039     JavaThread* thread, Method* method))
1040   assert(DTraceMethodProbes, "wrong call");
1041   Symbol* kname = method->klass_name();
1042   Symbol* name = method->name();
1043   Symbol* sig = method->signature();
1044   HOTSPOT_METHOD_ENTRY(
1045       get_java_tid(thread),
1046       (char *) kname->bytes(), kname->utf8_length(),
1047       (char *) name->bytes(), name->utf8_length(),
1048       (char *) sig->bytes(), sig->utf8_length());
1049   return 0;
1050 JRT_END
1051 
1052 JRT_LEAF(int, SharedRuntime::dtrace_method_exit(
1053     JavaThread* thread, Method* method))
1054   assert(DTraceMethodProbes, "wrong call");
1055   Symbol* kname = method->klass_name();
1056   Symbol* name = method->name();
1057   Symbol* sig = method->signature();
1058   HOTSPOT_METHOD_RETURN(
1059       get_java_tid(thread),
1060       (char *) kname->bytes(), kname->utf8_length(),
1061       (char *) name->bytes(), name->utf8_length(),
1062       (char *) sig->bytes(), sig->utf8_length());
1063   return 0;
1064 JRT_END
1065 
1066 
1067 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode)
1068 // for a call current in progress, i.e., arguments has been pushed on stack
1069 // put callee has not been invoked yet.  Used by: resolve virtual/static,
1070 // vtable updates, etc.  Caller frame must be compiled.
1071 Handle SharedRuntime::find_callee_info(JavaThread* thread, Bytecodes::Code& bc, CallInfo& callinfo, TRAPS) {
1072   ResourceMark rm(THREAD);
1073 
1074   // last java frame on stack (which includes native call frames)
1075   vframeStream vfst(thread, true);  // Do not skip and javaCalls
1076 
1077   return find_callee_info_helper(thread, vfst, bc, callinfo, THREAD);
1078 }
1079 
1080 methodHandle SharedRuntime::extract_attached_method(vframeStream& vfst) {
1081   CompiledMethod* caller = vfst.nm();
1082 
1083   nmethodLocker caller_lock(caller);
1084 
1085   address pc = vfst.frame_pc();
1086   { // Get call instruction under lock because another thread may be busy patching it.
1087     MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1088     return caller->attached_method_before_pc(pc);
1089   }
1090   return NULL;
1091 }
1092 
1093 // Finds receiver, CallInfo (i.e. receiver method), and calling bytecode
1094 // for a call current in progress, i.e., arguments has been pushed on stack
1095 // but callee has not been invoked yet.  Caller frame must be compiled.
1096 Handle SharedRuntime::find_callee_info_helper(JavaThread* thread,
1097                                               vframeStream& vfst,
1098                                               Bytecodes::Code& bc,
1099                                               CallInfo& callinfo, TRAPS) {
1100   Handle receiver;
1101   Handle nullHandle;  //create a handy null handle for exception returns
1102 
1103   assert(!vfst.at_end(), "Java frame must exist");
1104 
1105   // Find caller and bci from vframe
1106   methodHandle caller(THREAD, vfst.method());
1107   int          bci   = vfst.bci();
1108 
1109   Bytecode_invoke bytecode(caller, bci);
1110   int bytecode_index = bytecode.index();
1111 
1112   methodHandle attached_method = extract_attached_method(vfst);
1113   if (attached_method.not_null()) {
1114     methodHandle callee = bytecode.static_target(CHECK_NH);
1115     vmIntrinsics::ID id = callee->intrinsic_id();
1116     // When VM replaces MH.invokeBasic/linkTo* call with a direct/virtual call,
1117     // it attaches statically resolved method to the call site.
1118     if (MethodHandles::is_signature_polymorphic(id) &&
1119         MethodHandles::is_signature_polymorphic_intrinsic(id)) {
1120       bc = MethodHandles::signature_polymorphic_intrinsic_bytecode(id);
1121 
1122       // Adjust invocation mode according to the attached method.
1123       switch (bc) {
1124         case Bytecodes::_invokeinterface:
1125           if (!attached_method->method_holder()->is_interface()) {
1126             bc = Bytecodes::_invokevirtual;
1127           }
1128           break;
1129         case Bytecodes::_invokehandle:
1130           if (!MethodHandles::is_signature_polymorphic_method(attached_method())) {
1131             bc = attached_method->is_static() ? Bytecodes::_invokestatic
1132                                               : Bytecodes::_invokevirtual;
1133           }
1134           break;
1135       }
1136     }
1137   } else {
1138     bc = bytecode.invoke_code();
1139   }
1140 
1141   bool has_receiver = bc != Bytecodes::_invokestatic &&
1142                       bc != Bytecodes::_invokedynamic &&
1143                       bc != Bytecodes::_invokehandle;
1144 
1145   // Find receiver for non-static call
1146   if (has_receiver) {
1147     // This register map must be update since we need to find the receiver for
1148     // compiled frames. The receiver might be in a register.
1149     RegisterMap reg_map2(thread);
1150     frame stubFrame   = thread->last_frame();
1151     // Caller-frame is a compiled frame
1152     frame callerFrame = stubFrame.sender(&reg_map2);
1153 
1154     methodHandle callee = attached_method;
1155     if (callee.is_null()) {
1156       callee = bytecode.static_target(CHECK_NH);
1157       if (callee.is_null()) {
1158         THROW_(vmSymbols::java_lang_NoSuchMethodException(), nullHandle);
1159       }
1160     }
1161     if (ValueTypePassFieldsAsArgs && callee->method_holder()->is_value()) {
1162       // If the receiver is a value type that is passed as fields, no oop is available.
1163       // Resolve the call without receiver null checking.
1164       assert(bc == Bytecodes::_invokevirtual, "only allowed with invokevirtual");
1165       constantPoolHandle constants(THREAD, caller->constants());
1166       LinkInfo link_info(constants, bytecode_index, CHECK_NH);
1167       LinkResolver::resolve_virtual_call(callinfo, receiver, NULL, link_info, /*check_null_or_abstract*/ false, CHECK_NH);
1168       return receiver; // is null
1169     } else {
1170       // Retrieve from a compiled argument list
1171       receiver = Handle(THREAD, callerFrame.retrieve_receiver(&reg_map2));
1172 
1173       if (receiver.is_null()) {
1174         THROW_(vmSymbols::java_lang_NullPointerException(), nullHandle);
1175       }
1176     }
1177   }
1178 
1179   assert(receiver.is_null() || receiver->is_oop(), "wrong receiver");
1180 
1181   // Resolve method
1182   if (attached_method.not_null()) {
1183     // Parameterized by attached method.
1184     LinkResolver::resolve_invoke(callinfo, receiver, attached_method, bc, CHECK_NH);
1185   } else {
1186     // Parameterized by bytecode.
1187     constantPoolHandle constants(THREAD, caller->constants());
1188     LinkResolver::resolve_invoke(callinfo, receiver, constants, bytecode_index, bc, CHECK_NH);
1189   }
1190 
1191 #ifdef ASSERT
1192   // Check that the receiver klass is of the right subtype and that it is initialized for virtual calls
1193   if (has_receiver) {
1194     assert(receiver.not_null(), "should have thrown exception");
1195     Klass* receiver_klass = receiver->klass();
1196     Klass* rk = NULL;
1197     if (attached_method.not_null()) {
1198       // In case there's resolved method attached, use its holder during the check.
1199       rk = attached_method->method_holder();
1200     } else {
1201       // Klass is already loaded.
1202       constantPoolHandle constants(THREAD, caller->constants());
1203       rk = constants->klass_ref_at(bytecode_index, CHECK_NH);
1204     }
1205     Klass* static_receiver_klass = rk;
1206     methodHandle callee = callinfo.selected_method();
1207     assert(receiver_klass->is_subtype_of(static_receiver_klass),
1208            "actual receiver must be subclass of static receiver klass");
1209     if (receiver_klass->is_instance_klass()) {
1210       if (InstanceKlass::cast(receiver_klass)->is_not_initialized()) {
1211         tty->print_cr("ERROR: Klass not yet initialized!!");
1212         receiver_klass->print();
1213       }
1214       assert(!InstanceKlass::cast(receiver_klass)->is_not_initialized(), "receiver_klass must be initialized");
1215     }
1216   }
1217 #endif
1218 
1219   return receiver;
1220 }
1221 
1222 methodHandle SharedRuntime::find_callee_method(JavaThread* thread, TRAPS) {
1223   ResourceMark rm(THREAD);
1224   // We need first to check if any Java activations (compiled, interpreted)
1225   // exist on the stack since last JavaCall.  If not, we need
1226   // to get the target method from the JavaCall wrapper.
1227   vframeStream vfst(thread, true);  // Do not skip any javaCalls
1228   methodHandle callee_method;
1229   if (vfst.at_end()) {
1230     // No Java frames were found on stack since we did the JavaCall.
1231     // Hence the stack can only contain an entry_frame.  We need to
1232     // find the target method from the stub frame.
1233     RegisterMap reg_map(thread, false);
1234     frame fr = thread->last_frame();
1235     assert(fr.is_runtime_frame(), "must be a runtimeStub");
1236     fr = fr.sender(&reg_map);
1237     assert(fr.is_entry_frame(), "must be");
1238     // fr is now pointing to the entry frame.
1239     callee_method = methodHandle(THREAD, fr.entry_frame_call_wrapper()->callee_method());
1240   } else {
1241     Bytecodes::Code bc;
1242     CallInfo callinfo;
1243     find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(methodHandle()));
1244     callee_method = callinfo.selected_method();
1245   }
1246   assert(callee_method()->is_method(), "must be");
1247   return callee_method;
1248 }
1249 
1250 // Resolves a call.
1251 methodHandle SharedRuntime::resolve_helper(JavaThread *thread,
1252                                            bool is_virtual,
1253                                            bool is_optimized, TRAPS) {
1254   methodHandle callee_method;
1255   callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
1256   if (JvmtiExport::can_hotswap_or_post_breakpoint()) {
1257     int retry_count = 0;
1258     while (!HAS_PENDING_EXCEPTION && callee_method->is_old() &&
1259            callee_method->method_holder() != SystemDictionary::Object_klass()) {
1260       // If has a pending exception then there is no need to re-try to
1261       // resolve this method.
1262       // If the method has been redefined, we need to try again.
1263       // Hack: we have no way to update the vtables of arrays, so don't
1264       // require that java.lang.Object has been updated.
1265 
1266       // It is very unlikely that method is redefined more than 100 times
1267       // in the middle of resolve. If it is looping here more than 100 times
1268       // means then there could be a bug here.
1269       guarantee((retry_count++ < 100),
1270                 "Could not resolve to latest version of redefined method");
1271       // method is redefined in the middle of resolve so re-try.
1272       callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD);
1273     }
1274   }
1275   return callee_method;
1276 }
1277 
1278 // Resolves a call.  The compilers generate code for calls that go here
1279 // and are patched with the real destination of the call.
1280 methodHandle SharedRuntime::resolve_sub_helper(JavaThread *thread,
1281                                            bool is_virtual,
1282                                            bool is_optimized, TRAPS) {
1283 
1284   ResourceMark rm(thread);
1285   RegisterMap cbl_map(thread, false);
1286   frame caller_frame = thread->last_frame().sender(&cbl_map);
1287 
1288   CodeBlob* caller_cb = caller_frame.cb();
1289   guarantee(caller_cb != NULL && caller_cb->is_compiled(), "must be called from compiled method");
1290   CompiledMethod* caller_nm = caller_cb->as_compiled_method_or_null();
1291 
1292   // make sure caller is not getting deoptimized
1293   // and removed before we are done with it.
1294   // CLEANUP - with lazy deopt shouldn't need this lock
1295   nmethodLocker caller_lock(caller_nm);
1296 
1297   // determine call info & receiver
1298   // note: a) receiver is NULL for static calls
1299   //       b) an exception is thrown if receiver is NULL for non-static calls
1300   CallInfo call_info;
1301   Bytecodes::Code invoke_code = Bytecodes::_illegal;
1302   Handle receiver = find_callee_info(thread, invoke_code,
1303                                      call_info, CHECK_(methodHandle()));
1304   methodHandle callee_method = call_info.selected_method();
1305 
1306   assert((!is_virtual && invoke_code == Bytecodes::_invokestatic ) ||
1307          (!is_virtual && invoke_code == Bytecodes::_invokespecial) ||
1308          (!is_virtual && invoke_code == Bytecodes::_invokehandle ) ||
1309          (!is_virtual && invoke_code == Bytecodes::_invokedynamic) ||
1310          ( is_virtual && invoke_code != Bytecodes::_invokestatic ), "inconsistent bytecode");
1311 
1312   assert(caller_nm->is_alive(), "It should be alive");
1313 
1314 #ifndef PRODUCT
1315   // tracing/debugging/statistics
1316   int *addr = (is_optimized) ? (&_resolve_opt_virtual_ctr) :
1317                 (is_virtual) ? (&_resolve_virtual_ctr) :
1318                                (&_resolve_static_ctr);
1319   Atomic::inc(addr);
1320 
1321   if (TraceCallFixup) {
1322     ResourceMark rm(thread);
1323     tty->print("resolving %s%s (%s) call to",
1324       (is_optimized) ? "optimized " : "", (is_virtual) ? "virtual" : "static",
1325       Bytecodes::name(invoke_code));
1326     callee_method->print_short_name(tty);
1327     tty->print_cr(" at pc: " INTPTR_FORMAT " to code: " INTPTR_FORMAT,
1328                   p2i(caller_frame.pc()), p2i(callee_method->code()));
1329   }
1330 #endif
1331 
1332   // JSR 292 key invariant:
1333   // If the resolved method is a MethodHandle invoke target, the call
1334   // site must be a MethodHandle call site, because the lambda form might tail-call
1335   // leaving the stack in a state unknown to either caller or callee
1336   // TODO detune for now but we might need it again
1337 //  assert(!callee_method->is_compiled_lambda_form() ||
1338 //         caller_nm->is_method_handle_return(caller_frame.pc()), "must be MH call site");
1339 
1340   // Compute entry points. This might require generation of C2I converter
1341   // frames, so we cannot be holding any locks here. Furthermore, the
1342   // computation of the entry points is independent of patching the call.  We
1343   // always return the entry-point, but we only patch the stub if the call has
1344   // not been deoptimized.  Return values: For a virtual call this is an
1345   // (cached_oop, destination address) pair. For a static call/optimized
1346   // virtual this is just a destination address.
1347 
1348   StaticCallInfo static_call_info;
1349   CompiledICInfo virtual_call_info;
1350 
1351   // Make sure the callee nmethod does not get deoptimized and removed before
1352   // we are done patching the code.
1353   CompiledMethod* callee = callee_method->code();
1354 
1355   if (callee != NULL) {
1356     assert(callee->is_compiled(), "must be nmethod for patching");
1357   }
1358 
1359   if (callee != NULL && !callee->is_in_use()) {
1360     // Patch call site to C2I adapter if callee nmethod is deoptimized or unloaded.
1361     callee = NULL;
1362   }
1363   nmethodLocker nl_callee(callee);
1364 #ifdef ASSERT
1365   address dest_entry_point = callee == NULL ? 0 : callee->entry_point(); // used below
1366 #endif
1367 
1368   bool is_nmethod = caller_nm->is_nmethod();
1369 
1370   if (is_virtual) {
1371     Klass* receiver_klass = NULL;
1372     if (ValueTypePassFieldsAsArgs && callee_method->method_holder()->is_value()) {
1373       // If the receiver is a value type that is passed as fields, no oop is available
1374       receiver_klass = callee_method->method_holder();
1375     } else {
1376       assert(receiver.not_null() || invoke_code == Bytecodes::_invokehandle, "sanity check");
1377       receiver_klass = invoke_code == Bytecodes::_invokehandle ? NULL : receiver->klass();
1378     }
1379     bool static_bound = call_info.resolved_method()->can_be_statically_bound();
1380     CompiledIC::compute_monomorphic_entry(callee_method, receiver_klass,
1381                      is_optimized, static_bound, is_nmethod, virtual_call_info,
1382                      CHECK_(methodHandle()));
1383   } else {
1384     // static call
1385     CompiledStaticCall::compute_entry(callee_method, is_nmethod, static_call_info);
1386   }
1387 
1388   // grab lock, check for deoptimization and potentially patch caller
1389   {
1390     MutexLocker ml_patch(CompiledIC_lock);
1391 
1392     // Lock blocks for safepoint during which both nmethods can change state.
1393 
1394     // Now that we are ready to patch if the Method* was redefined then
1395     // don't update call site and let the caller retry.
1396     // Don't update call site if callee nmethod was unloaded or deoptimized.
1397     // Don't update call site if callee nmethod was replaced by an other nmethod
1398     // which may happen when multiply alive nmethod (tiered compilation)
1399     // will be supported.
1400     if (!callee_method->is_old() &&
1401         (callee == NULL || callee->is_in_use() && (callee_method->code() == callee))) {
1402 #ifdef ASSERT
1403       // We must not try to patch to jump to an already unloaded method.
1404       if (dest_entry_point != 0) {
1405         CodeBlob* cb = CodeCache::find_blob(dest_entry_point);
1406         assert((cb != NULL) && cb->is_compiled() && (((CompiledMethod*)cb) == callee),
1407                "should not call unloaded nmethod");
1408       }
1409 #endif
1410       if (is_virtual) {
1411         CompiledIC* inline_cache = CompiledIC_before(caller_nm, caller_frame.pc());
1412         if (inline_cache->is_clean()) {
1413           inline_cache->set_to_monomorphic(virtual_call_info);
1414         }
1415       } else {
1416         CompiledStaticCall* ssc = caller_nm->compiledStaticCall_before(caller_frame.pc());
1417         if (ssc->is_clean()) ssc->set(static_call_info);
1418       }
1419     }
1420 
1421   } // unlock CompiledIC_lock
1422 
1423   return callee_method;
1424 }
1425 
1426 
1427 // Inline caches exist only in compiled code
1428 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_ic_miss(JavaThread* thread))
1429 #ifdef ASSERT
1430   RegisterMap reg_map(thread, false);
1431   frame stub_frame = thread->last_frame();
1432   assert(stub_frame.is_runtime_frame(), "sanity check");
1433   frame caller_frame = stub_frame.sender(&reg_map);
1434   assert(!caller_frame.is_interpreted_frame() && !caller_frame.is_entry_frame(), "unexpected frame");
1435 #endif /* ASSERT */
1436 
1437   methodHandle callee_method;
1438   JRT_BLOCK
1439     callee_method = SharedRuntime::handle_ic_miss_helper(thread, CHECK_NULL);
1440     // Return Method* through TLS
1441     thread->set_vm_result_2(callee_method());
1442   JRT_BLOCK_END
1443   // return compiled code entry point after potential safepoints
1444   assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1445   return callee_method->verified_code_entry();
1446 JRT_END
1447 
1448 
1449 // Handle call site that has been made non-entrant
1450 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method(JavaThread* thread))
1451   // 6243940 We might end up in here if the callee is deoptimized
1452   // as we race to call it.  We don't want to take a safepoint if
1453   // the caller was interpreted because the caller frame will look
1454   // interpreted to the stack walkers and arguments are now
1455   // "compiled" so it is much better to make this transition
1456   // invisible to the stack walking code. The i2c path will
1457   // place the callee method in the callee_target. It is stashed
1458   // there because if we try and find the callee by normal means a
1459   // safepoint is possible and have trouble gc'ing the compiled args.
1460   RegisterMap reg_map(thread, false);
1461   frame stub_frame = thread->last_frame();
1462   assert(stub_frame.is_runtime_frame(), "sanity check");
1463   frame caller_frame = stub_frame.sender(&reg_map);
1464 
1465   if (caller_frame.is_interpreted_frame() ||
1466       caller_frame.is_entry_frame()) {
1467     Method* callee = thread->callee_target();
1468     guarantee(callee != NULL && callee->is_method(), "bad handshake");
1469     thread->set_vm_result_2(callee);
1470     thread->set_callee_target(NULL);
1471     return callee->get_c2i_entry();
1472   }
1473 
1474   // Must be compiled to compiled path which is safe to stackwalk
1475   methodHandle callee_method;
1476   JRT_BLOCK
1477     // Force resolving of caller (if we called from compiled frame)
1478     callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_NULL);
1479     thread->set_vm_result_2(callee_method());
1480   JRT_BLOCK_END
1481   // return compiled code entry point after potential safepoints
1482   assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1483   return callee_method->verified_code_entry();
1484 JRT_END
1485 
1486 // Handle abstract method call
1487 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_abstract(JavaThread* thread))
1488   return StubRoutines::throw_AbstractMethodError_entry();
1489 JRT_END
1490 
1491 
1492 // resolve a static call and patch code
1493 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_static_call_C(JavaThread *thread ))
1494   methodHandle callee_method;
1495   JRT_BLOCK
1496     callee_method = SharedRuntime::resolve_helper(thread, false, false, CHECK_NULL);
1497     thread->set_vm_result_2(callee_method());
1498   JRT_BLOCK_END
1499   // return compiled code entry point after potential safepoints
1500   assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1501   return callee_method->verified_code_entry();
1502 JRT_END
1503 
1504 
1505 // resolve virtual call and update inline cache to monomorphic
1506 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_virtual_call_C(JavaThread *thread ))
1507   methodHandle callee_method;
1508   JRT_BLOCK
1509     callee_method = SharedRuntime::resolve_helper(thread, true, false, CHECK_NULL);
1510     thread->set_vm_result_2(callee_method());
1511   JRT_BLOCK_END
1512   // return compiled code entry point after potential safepoints
1513   assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1514   return callee_method->verified_code_entry();
1515 JRT_END
1516 
1517 
1518 // Resolve a virtual call that can be statically bound (e.g., always
1519 // monomorphic, so it has no inline cache).  Patch code to resolved target.
1520 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_opt_virtual_call_C(JavaThread *thread))
1521   methodHandle callee_method;
1522   JRT_BLOCK
1523     callee_method = SharedRuntime::resolve_helper(thread, true, true, CHECK_NULL);
1524     thread->set_vm_result_2(callee_method());
1525   JRT_BLOCK_END
1526   // return compiled code entry point after potential safepoints
1527   assert(callee_method->verified_code_entry() != NULL, " Jump to zero!");
1528   return callee_method->verified_code_entry();
1529 JRT_END
1530 
1531 
1532 
1533 methodHandle SharedRuntime::handle_ic_miss_helper(JavaThread *thread, TRAPS) {
1534   ResourceMark rm(thread);
1535   CallInfo call_info;
1536   Bytecodes::Code bc;
1537 
1538   // receiver is NULL for static calls. An exception is thrown for NULL
1539   // receivers for non-static calls
1540   Handle receiver = find_callee_info(thread, bc, call_info,
1541                                      CHECK_(methodHandle()));
1542   // Compiler1 can produce virtual call sites that can actually be statically bound
1543   // If we fell thru to below we would think that the site was going megamorphic
1544   // when in fact the site can never miss. Worse because we'd think it was megamorphic
1545   // we'd try and do a vtable dispatch however methods that can be statically bound
1546   // don't have vtable entries (vtable_index < 0) and we'd blow up. So we force a
1547   // reresolution of the  call site (as if we did a handle_wrong_method and not an
1548   // plain ic_miss) and the site will be converted to an optimized virtual call site
1549   // never to miss again. I don't believe C2 will produce code like this but if it
1550   // did this would still be the correct thing to do for it too, hence no ifdef.
1551   //
1552   if (call_info.resolved_method()->can_be_statically_bound()) {
1553     methodHandle callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_(methodHandle()));
1554     if (TraceCallFixup) {
1555       RegisterMap reg_map(thread, false);
1556       frame caller_frame = thread->last_frame().sender(&reg_map);
1557       ResourceMark rm(thread);
1558       tty->print("converting IC miss to reresolve (%s) call to", Bytecodes::name(bc));
1559       callee_method->print_short_name(tty);
1560       tty->print_cr(" from pc: " INTPTR_FORMAT, p2i(caller_frame.pc()));
1561       tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1562     }
1563     return callee_method;
1564   }
1565 
1566   methodHandle callee_method = call_info.selected_method();
1567 
1568   bool should_be_mono = false;
1569 
1570 #ifndef PRODUCT
1571   Atomic::inc(&_ic_miss_ctr);
1572 
1573   // Statistics & Tracing
1574   if (TraceCallFixup) {
1575     ResourceMark rm(thread);
1576     tty->print("IC miss (%s) call to", Bytecodes::name(bc));
1577     callee_method->print_short_name(tty);
1578     tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1579   }
1580 
1581   if (ICMissHistogram) {
1582     MutexLocker m(VMStatistic_lock);
1583     RegisterMap reg_map(thread, false);
1584     frame f = thread->last_frame().real_sender(&reg_map);// skip runtime stub
1585     // produce statistics under the lock
1586     trace_ic_miss(f.pc());
1587   }
1588 #endif
1589 
1590   // install an event collector so that when a vtable stub is created the
1591   // profiler can be notified via a DYNAMIC_CODE_GENERATED event. The
1592   // event can't be posted when the stub is created as locks are held
1593   // - instead the event will be deferred until the event collector goes
1594   // out of scope.
1595   JvmtiDynamicCodeEventCollector event_collector;
1596 
1597   // Update inline cache to megamorphic. Skip update if we are called from interpreted.
1598   { MutexLocker ml_patch (CompiledIC_lock);
1599     RegisterMap reg_map(thread, false);
1600     frame caller_frame = thread->last_frame().sender(&reg_map);
1601     CodeBlob* cb = caller_frame.cb();
1602     CompiledMethod* caller_nm = cb->as_compiled_method_or_null();
1603     if (cb->is_compiled()) {
1604       CompiledIC* inline_cache = CompiledIC_before(((CompiledMethod*)cb), caller_frame.pc());
1605       bool should_be_mono = false;
1606       if (inline_cache->is_optimized()) {
1607         if (TraceCallFixup) {
1608           ResourceMark rm(thread);
1609           tty->print("OPTIMIZED IC miss (%s) call to", Bytecodes::name(bc));
1610           callee_method->print_short_name(tty);
1611           tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1612         }
1613         should_be_mono = true;
1614       } else if (inline_cache->is_icholder_call()) {
1615         CompiledICHolder* ic_oop = inline_cache->cached_icholder();
1616         if (ic_oop != NULL) {
1617 
1618           if (receiver()->klass() == ic_oop->holder_klass()) {
1619             // This isn't a real miss. We must have seen that compiled code
1620             // is now available and we want the call site converted to a
1621             // monomorphic compiled call site.
1622             // We can't assert for callee_method->code() != NULL because it
1623             // could have been deoptimized in the meantime
1624             if (TraceCallFixup) {
1625               ResourceMark rm(thread);
1626               tty->print("FALSE IC miss (%s) converting to compiled call to", Bytecodes::name(bc));
1627               callee_method->print_short_name(tty);
1628               tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1629             }
1630             should_be_mono = true;
1631           }
1632         }
1633       }
1634 
1635       if (should_be_mono) {
1636 
1637         // We have a path that was monomorphic but was going interpreted
1638         // and now we have (or had) a compiled entry. We correct the IC
1639         // by using a new icBuffer.
1640         CompiledICInfo info;
1641         Klass* receiver_klass = receiver()->klass();
1642         inline_cache->compute_monomorphic_entry(callee_method,
1643                                                 receiver_klass,
1644                                                 inline_cache->is_optimized(),
1645                                                 false, caller_nm->is_nmethod(),
1646                                                 info, CHECK_(methodHandle()));
1647         inline_cache->set_to_monomorphic(info);
1648       } else if (!inline_cache->is_megamorphic() && !inline_cache->is_clean()) {
1649         // Potential change to megamorphic
1650         bool successful = inline_cache->set_to_megamorphic(&call_info, bc, CHECK_(methodHandle()));
1651         if (!successful) {
1652           inline_cache->set_to_clean();
1653         }
1654       } else {
1655         // Either clean or megamorphic
1656       }
1657     } else {
1658       fatal("Unimplemented");
1659     }
1660   } // Release CompiledIC_lock
1661 
1662   return callee_method;
1663 }
1664 
1665 //
1666 // Resets a call-site in compiled code so it will get resolved again.
1667 // This routines handles both virtual call sites, optimized virtual call
1668 // sites, and static call sites. Typically used to change a call sites
1669 // destination from compiled to interpreted.
1670 //
1671 methodHandle SharedRuntime::reresolve_call_site(JavaThread *thread, TRAPS) {
1672   ResourceMark rm(thread);
1673   RegisterMap reg_map(thread, false);
1674   frame stub_frame = thread->last_frame();
1675   assert(stub_frame.is_runtime_frame(), "must be a runtimeStub");
1676   frame caller = stub_frame.sender(&reg_map);
1677 
1678   // Do nothing if the frame isn't a live compiled frame.
1679   // nmethod could be deoptimized by the time we get here
1680   // so no update to the caller is needed.
1681 
1682   if (caller.is_compiled_frame() && !caller.is_deoptimized_frame()) {
1683 
1684     address pc = caller.pc();
1685 
1686     // Check for static or virtual call
1687     bool is_static_call = false;
1688     CompiledMethod* caller_nm = CodeCache::find_compiled(pc);
1689 
1690     // Default call_addr is the location of the "basic" call.
1691     // Determine the address of the call we a reresolving. With
1692     // Inline Caches we will always find a recognizable call.
1693     // With Inline Caches disabled we may or may not find a
1694     // recognizable call. We will always find a call for static
1695     // calls and for optimized virtual calls. For vanilla virtual
1696     // calls it depends on the state of the UseInlineCaches switch.
1697     //
1698     // With Inline Caches disabled we can get here for a virtual call
1699     // for two reasons:
1700     //   1 - calling an abstract method. The vtable for abstract methods
1701     //       will run us thru handle_wrong_method and we will eventually
1702     //       end up in the interpreter to throw the ame.
1703     //   2 - a racing deoptimization. We could be doing a vanilla vtable
1704     //       call and between the time we fetch the entry address and
1705     //       we jump to it the target gets deoptimized. Similar to 1
1706     //       we will wind up in the interprter (thru a c2i with c2).
1707     //
1708     address call_addr = NULL;
1709     {
1710       // Get call instruction under lock because another thread may be
1711       // busy patching it.
1712       MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1713       // Location of call instruction
1714       call_addr = caller_nm->call_instruction_address(pc);
1715     }
1716     // Make sure nmethod doesn't get deoptimized and removed until
1717     // this is done with it.
1718     // CLEANUP - with lazy deopt shouldn't need this lock
1719     nmethodLocker nmlock(caller_nm);
1720 
1721     if (call_addr != NULL) {
1722       RelocIterator iter(caller_nm, call_addr, call_addr+1);
1723       int ret = iter.next(); // Get item
1724       if (ret) {
1725         assert(iter.addr() == call_addr, "must find call");
1726         if (iter.type() == relocInfo::static_call_type) {
1727           is_static_call = true;
1728         } else {
1729           assert(iter.type() == relocInfo::virtual_call_type ||
1730                  iter.type() == relocInfo::opt_virtual_call_type
1731                 , "unexpected relocInfo. type");
1732         }
1733       } else {
1734         assert(!UseInlineCaches, "relocation info. must exist for this address");
1735       }
1736 
1737       // Cleaning the inline cache will force a new resolve. This is more robust
1738       // than directly setting it to the new destination, since resolving of calls
1739       // is always done through the same code path. (experience shows that it
1740       // leads to very hard to track down bugs, if an inline cache gets updated
1741       // to a wrong method). It should not be performance critical, since the
1742       // resolve is only done once.
1743 
1744       bool is_nmethod = caller_nm->is_nmethod();
1745       MutexLocker ml(CompiledIC_lock);
1746       if (is_static_call) {
1747         CompiledStaticCall* ssc = caller_nm->compiledStaticCall_at(call_addr);
1748         ssc->set_to_clean();
1749       } else {
1750         // compiled, dispatched call (which used to call an interpreted method)
1751         CompiledIC* inline_cache = CompiledIC_at(caller_nm, call_addr);
1752         inline_cache->set_to_clean();
1753       }
1754     }
1755   }
1756 
1757   methodHandle callee_method = find_callee_method(thread, CHECK_(methodHandle()));
1758 
1759 
1760 #ifndef PRODUCT
1761   Atomic::inc(&_wrong_method_ctr);
1762 
1763   if (TraceCallFixup) {
1764     ResourceMark rm(thread);
1765     tty->print("handle_wrong_method reresolving call to");
1766     callee_method->print_short_name(tty);
1767     tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code()));
1768   }
1769 #endif
1770 
1771   return callee_method;
1772 }
1773 
1774 address SharedRuntime::handle_unsafe_access(JavaThread* thread, address next_pc) {
1775   // The faulting unsafe accesses should be changed to throw the error
1776   // synchronously instead. Meanwhile the faulting instruction will be
1777   // skipped over (effectively turning it into a no-op) and an
1778   // asynchronous exception will be raised which the thread will
1779   // handle at a later point. If the instruction is a load it will
1780   // return garbage.
1781 
1782   // Request an async exception.
1783   thread->set_pending_unsafe_access_error();
1784 
1785   // Return address of next instruction to execute.
1786   return next_pc;
1787 }
1788 
1789 #ifdef ASSERT
1790 void SharedRuntime::check_member_name_argument_is_last_argument(const methodHandle& method,
1791                                                                 const BasicType* sig_bt,
1792                                                                 const VMRegPair* regs) {
1793   ResourceMark rm;
1794   const int total_args_passed = method->size_of_parameters();
1795   const VMRegPair*    regs_with_member_name = regs;
1796         VMRegPair* regs_without_member_name = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed - 1);
1797 
1798   const int member_arg_pos = total_args_passed - 1;
1799   assert(member_arg_pos >= 0 && member_arg_pos < total_args_passed, "oob");
1800   assert(sig_bt[member_arg_pos] == T_OBJECT, "dispatch argument must be an object");
1801 
1802   const bool is_outgoing = method->is_method_handle_intrinsic();
1803   int comp_args_on_stack = java_calling_convention(sig_bt, regs_without_member_name, total_args_passed - 1, is_outgoing);
1804 
1805   for (int i = 0; i < member_arg_pos; i++) {
1806     VMReg a =    regs_with_member_name[i].first();
1807     VMReg b = regs_without_member_name[i].first();
1808     assert(a->value() == b->value(), "register allocation mismatch: a=" INTX_FORMAT ", b=" INTX_FORMAT, a->value(), b->value());
1809   }
1810   assert(regs_with_member_name[member_arg_pos].first()->is_valid(), "bad member arg");
1811 }
1812 #endif
1813 
1814 bool SharedRuntime::should_fixup_call_destination(address destination, address entry_point, address caller_pc, Method* moop, CodeBlob* cb) {
1815   if (destination != entry_point) {
1816     CodeBlob* callee = CodeCache::find_blob(destination);
1817     // callee == cb seems weird. It means calling interpreter thru stub.
1818     if (callee == cb || callee->is_adapter_blob()) {
1819       // static call or optimized virtual
1820       if (TraceCallFixup) {
1821         tty->print("fixup callsite           at " INTPTR_FORMAT " to compiled code for", p2i(caller_pc));
1822         moop->print_short_name(tty);
1823         tty->print_cr(" to " INTPTR_FORMAT, p2i(entry_point));
1824       }
1825       return true;
1826     } else {
1827       if (TraceCallFixup) {
1828         tty->print("failed to fixup callsite at " INTPTR_FORMAT " to compiled code for", p2i(caller_pc));
1829         moop->print_short_name(tty);
1830         tty->print_cr(" to " INTPTR_FORMAT, p2i(entry_point));
1831       }
1832       // assert is too strong could also be resolve destinations.
1833       // assert(InlineCacheBuffer::contains(destination) || VtableStubs::contains(destination), "must be");
1834     }
1835   } else {
1836     if (TraceCallFixup) {
1837       tty->print("already patched callsite at " INTPTR_FORMAT " to compiled code for", p2i(caller_pc));
1838       moop->print_short_name(tty);
1839       tty->print_cr(" to " INTPTR_FORMAT, p2i(entry_point));
1840     }
1841   }
1842   return false;
1843 }
1844 
1845 // ---------------------------------------------------------------------------
1846 // We are calling the interpreter via a c2i. Normally this would mean that
1847 // we were called by a compiled method. However we could have lost a race
1848 // where we went int -> i2c -> c2i and so the caller could in fact be
1849 // interpreted. If the caller is compiled we attempt to patch the caller
1850 // so he no longer calls into the interpreter.
1851 IRT_LEAF(void, SharedRuntime::fixup_callers_callsite(Method* method, address caller_pc))
1852   Method* moop(method);
1853 
1854   address entry_point = moop->from_compiled_entry_no_trampoline();
1855 
1856   // It's possible that deoptimization can occur at a call site which hasn't
1857   // been resolved yet, in which case this function will be called from
1858   // an nmethod that has been patched for deopt and we can ignore the
1859   // request for a fixup.
1860   // Also it is possible that we lost a race in that from_compiled_entry
1861   // is now back to the i2c in that case we don't need to patch and if
1862   // we did we'd leap into space because the callsite needs to use
1863   // "to interpreter" stub in order to load up the Method*. Don't
1864   // ask me how I know this...
1865 
1866   CodeBlob* cb = CodeCache::find_blob(caller_pc);
1867   if (!cb->is_compiled() || entry_point == moop->get_c2i_entry()) {
1868     return;
1869   }
1870 
1871   // The check above makes sure this is a nmethod.
1872   CompiledMethod* nm = cb->as_compiled_method_or_null();
1873   assert(nm, "must be");
1874 
1875   // Get the return PC for the passed caller PC.
1876   address return_pc = caller_pc + frame::pc_return_offset;
1877 
1878   // There is a benign race here. We could be attempting to patch to a compiled
1879   // entry point at the same time the callee is being deoptimized. If that is
1880   // the case then entry_point may in fact point to a c2i and we'd patch the
1881   // call site with the same old data. clear_code will set code() to NULL
1882   // at the end of it. If we happen to see that NULL then we can skip trying
1883   // to patch. If we hit the window where the callee has a c2i in the
1884   // from_compiled_entry and the NULL isn't present yet then we lose the race
1885   // and patch the code with the same old data. Asi es la vida.
1886 
1887   if (moop->code() == NULL) return;
1888 
1889   if (nm->is_in_use()) {
1890 
1891     // Expect to find a native call there (unless it was no-inline cache vtable dispatch)
1892     MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag);
1893     if (NativeCall::is_call_before(return_pc)) {
1894       ResourceMark mark;
1895       NativeCallWrapper* call = nm->call_wrapper_before(return_pc);
1896       //
1897       // bug 6281185. We might get here after resolving a call site to a vanilla
1898       // virtual call. Because the resolvee uses the verified entry it may then
1899       // see compiled code and attempt to patch the site by calling us. This would
1900       // then incorrectly convert the call site to optimized and its downhill from
1901       // there. If you're lucky you'll get the assert in the bugid, if not you've
1902       // just made a call site that could be megamorphic into a monomorphic site
1903       // for the rest of its life! Just another racing bug in the life of
1904       // fixup_callers_callsite ...
1905       //
1906       RelocIterator iter(nm, call->instruction_address(), call->next_instruction_address());
1907       iter.next();
1908       assert(iter.has_current(), "must have a reloc at java call site");
1909       relocInfo::relocType typ = iter.reloc()->type();
1910       if (typ != relocInfo::static_call_type &&
1911            typ != relocInfo::opt_virtual_call_type &&
1912            typ != relocInfo::static_stub_type) {
1913         return;
1914       }
1915       address destination = call->destination();
1916       if (should_fixup_call_destination(destination, entry_point, caller_pc, moop, cb)) {
1917         call->set_destination_mt_safe(entry_point);
1918       }
1919     }
1920   }
1921 IRT_END
1922 
1923 
1924 // same as JVM_Arraycopy, but called directly from compiled code
1925 JRT_ENTRY(void, SharedRuntime::slow_arraycopy_C(oopDesc* src,  jint src_pos,
1926                                                 oopDesc* dest, jint dest_pos,
1927                                                 jint length,
1928                                                 JavaThread* thread)) {
1929 #ifndef PRODUCT
1930   _slow_array_copy_ctr++;
1931 #endif
1932   // Check if we have null pointers
1933   if (src == NULL || dest == NULL) {
1934     THROW(vmSymbols::java_lang_NullPointerException());
1935   }
1936   // Do the copy.  The casts to arrayOop are necessary to the copy_array API,
1937   // even though the copy_array API also performs dynamic checks to ensure
1938   // that src and dest are truly arrays (and are conformable).
1939   // The copy_array mechanism is awkward and could be removed, but
1940   // the compilers don't call this function except as a last resort,
1941   // so it probably doesn't matter.
1942   src->klass()->copy_array((arrayOopDesc*)src, src_pos,
1943                                         (arrayOopDesc*)dest, dest_pos,
1944                                         length, thread);
1945 }
1946 JRT_END
1947 
1948 // The caller of generate_class_cast_message() (or one of its callers)
1949 // must use a ResourceMark in order to correctly free the result.
1950 char* SharedRuntime::generate_class_cast_message(
1951     JavaThread* thread, Klass* caster_klass) {
1952 
1953   // Get target class name from the checkcast instruction
1954   vframeStream vfst(thread, true);
1955   assert(!vfst.at_end(), "Java frame must exist");
1956   Bytecode_checkcast cc(vfst.method(), vfst.method()->bcp_from(vfst.bci()));
1957   Klass* target_klass = vfst.method()->constants()->klass_at(
1958     cc.index(), thread);
1959   return generate_class_cast_message(caster_klass, target_klass);
1960 }
1961 
1962 // The caller of class_loader_and_module_name() (or one of its callers)
1963 // must use a ResourceMark in order to correctly free the result.
1964 const char* class_loader_and_module_name(Klass* klass) {
1965   const char* delim = "/";
1966   size_t delim_len = strlen(delim);
1967 
1968   const char* fqn = klass->external_name();
1969   // Length of message to return; always include FQN
1970   size_t msglen = strlen(fqn) + 1;
1971 
1972   bool has_cl_name = false;
1973   bool has_mod_name = false;
1974   bool has_version = false;
1975 
1976   // Use class loader name, if exists and not builtin
1977   const char* class_loader_name = "";
1978   ClassLoaderData* cld = klass->class_loader_data();
1979   assert(cld != NULL, "class_loader_data should not be NULL");
1980   if (!cld->is_builtin_class_loader_data()) {
1981     // If not builtin, look for name
1982     oop loader = klass->class_loader();
1983     if (loader != NULL) {
1984       oop class_loader_name_oop = java_lang_ClassLoader::name(loader);
1985       if (class_loader_name_oop != NULL) {
1986         class_loader_name = java_lang_String::as_utf8_string(class_loader_name_oop);
1987         if (class_loader_name != NULL && class_loader_name[0] != '\0') {
1988           has_cl_name = true;
1989           msglen += strlen(class_loader_name) + delim_len;
1990         }
1991       }
1992     }
1993   }
1994 
1995   const char* module_name = "";
1996   const char* version = "";
1997   Klass* bottom_klass = klass->is_objArray_klass() ?
1998     ObjArrayKlass::cast(klass)->bottom_klass() : klass;
1999   if (bottom_klass->is_instance_klass()) {
2000     ModuleEntry* module = InstanceKlass::cast(bottom_klass)->module();
2001     // Use module name, if exists
2002     if (module->is_named()) {
2003       has_mod_name = true;
2004       module_name = module->name()->as_C_string();
2005       msglen += strlen(module_name);
2006       // Use version if exists and is not a jdk module
2007       if (module->is_non_jdk_module() && module->version() != NULL) {
2008         has_version = true;
2009         version = module->version()->as_C_string();
2010         msglen += strlen("@") + strlen(version);
2011       }
2012     }
2013   } else {
2014     // klass is an array of primitives, so its module is java.base
2015     module_name = JAVA_BASE_NAME;
2016   }
2017 
2018   if (has_cl_name || has_mod_name) {
2019     msglen += delim_len;
2020   }
2021 
2022   char* message = NEW_RESOURCE_ARRAY_RETURN_NULL(char, msglen);
2023 
2024   // Just return the FQN if error in allocating string
2025   if (message == NULL) {
2026     return fqn;
2027   }
2028 
2029   jio_snprintf(message, msglen, "%s%s%s%s%s%s%s",
2030                class_loader_name,
2031                (has_cl_name) ? delim : "",
2032                (has_mod_name) ? module_name : "",
2033                (has_version) ? "@" : "",
2034                (has_version) ? version : "",
2035                (has_cl_name || has_mod_name) ? delim : "",
2036                fqn);
2037   return message;
2038 }
2039 
2040 char* SharedRuntime::generate_class_cast_message(
2041     Klass* caster_klass, Klass* target_klass) {
2042 
2043   const char* caster_name = class_loader_and_module_name(caster_klass);
2044 
2045   const char* target_name = class_loader_and_module_name(target_klass);
2046 
2047   size_t msglen = strlen(caster_name) + strlen(" cannot be cast to ") + strlen(target_name) + 1;
2048 
2049   char* message = NEW_RESOURCE_ARRAY_RETURN_NULL(char, msglen);
2050   if (message == NULL) {
2051     // Shouldn't happen, but don't cause even more problems if it does
2052     message = const_cast<char*>(caster_klass->external_name());
2053   } else {
2054     jio_snprintf(message,
2055                  msglen,
2056                  "%s cannot be cast to %s",
2057                  caster_name,
2058                  target_name);
2059   }
2060   return message;
2061 }
2062 
2063 JRT_LEAF(void, SharedRuntime::reguard_yellow_pages())
2064   (void) JavaThread::current()->reguard_stack();
2065 JRT_END
2066 
2067 
2068 // Handles the uncommon case in locking, i.e., contention or an inflated lock.
2069 JRT_BLOCK_ENTRY(void, SharedRuntime::complete_monitor_locking_C(oopDesc* _obj, BasicLock* lock, JavaThread* thread))
2070   // Disable ObjectSynchronizer::quick_enter() in default config
2071   // on AARCH64 and ARM until JDK-8153107 is resolved.
2072   if (ARM_ONLY((SyncFlags & 256) != 0 &&)
2073       AARCH64_ONLY((SyncFlags & 256) != 0 &&)
2074       !SafepointSynchronize::is_synchronizing()) {
2075     // Only try quick_enter() if we're not trying to reach a safepoint
2076     // so that the calling thread reaches the safepoint more quickly.
2077     if (ObjectSynchronizer::quick_enter(_obj, thread, lock)) return;
2078   }
2079   // NO_ASYNC required because an async exception on the state transition destructor
2080   // would leave you with the lock held and it would never be released.
2081   // The normal monitorenter NullPointerException is thrown without acquiring a lock
2082   // and the model is that an exception implies the method failed.
2083   JRT_BLOCK_NO_ASYNC
2084   oop obj(_obj);
2085   if (PrintBiasedLockingStatistics) {
2086     Atomic::inc(BiasedLocking::slow_path_entry_count_addr());
2087   }
2088   Handle h_obj(THREAD, obj);
2089   if (UseBiasedLocking) {
2090     // Retry fast entry if bias is revoked to avoid unnecessary inflation
2091     ObjectSynchronizer::fast_enter(h_obj, lock, true, CHECK);
2092   } else {
2093     ObjectSynchronizer::slow_enter(h_obj, lock, CHECK);
2094   }
2095   assert(!HAS_PENDING_EXCEPTION, "Should have no exception here");
2096   JRT_BLOCK_END
2097 JRT_END
2098 
2099 // Handles the uncommon cases of monitor unlocking in compiled code
2100 JRT_LEAF(void, SharedRuntime::complete_monitor_unlocking_C(oopDesc* _obj, BasicLock* lock, JavaThread * THREAD))
2101    oop obj(_obj);
2102   assert(JavaThread::current() == THREAD, "invariant");
2103   // I'm not convinced we need the code contained by MIGHT_HAVE_PENDING anymore
2104   // testing was unable to ever fire the assert that guarded it so I have removed it.
2105   assert(!HAS_PENDING_EXCEPTION, "Do we need code below anymore?");
2106 #undef MIGHT_HAVE_PENDING
2107 #ifdef MIGHT_HAVE_PENDING
2108   // Save and restore any pending_exception around the exception mark.
2109   // While the slow_exit must not throw an exception, we could come into
2110   // this routine with one set.
2111   oop pending_excep = NULL;
2112   const char* pending_file;
2113   int pending_line;
2114   if (HAS_PENDING_EXCEPTION) {
2115     pending_excep = PENDING_EXCEPTION;
2116     pending_file  = THREAD->exception_file();
2117     pending_line  = THREAD->exception_line();
2118     CLEAR_PENDING_EXCEPTION;
2119   }
2120 #endif /* MIGHT_HAVE_PENDING */
2121 
2122   {
2123     // Exit must be non-blocking, and therefore no exceptions can be thrown.
2124     EXCEPTION_MARK;
2125     ObjectSynchronizer::slow_exit(obj, lock, THREAD);
2126   }
2127 
2128 #ifdef MIGHT_HAVE_PENDING
2129   if (pending_excep != NULL) {
2130     THREAD->set_pending_exception(pending_excep, pending_file, pending_line);
2131   }
2132 #endif /* MIGHT_HAVE_PENDING */
2133 JRT_END
2134 
2135 #ifndef PRODUCT
2136 
2137 void SharedRuntime::print_statistics() {
2138   ttyLocker ttyl;
2139   if (xtty != NULL)  xtty->head("statistics type='SharedRuntime'");
2140 
2141   if (_throw_null_ctr) tty->print_cr("%5d implicit null throw", _throw_null_ctr);
2142 
2143   SharedRuntime::print_ic_miss_histogram();
2144 
2145   if (CountRemovableExceptions) {
2146     if (_nof_removable_exceptions > 0) {
2147       Unimplemented(); // this counter is not yet incremented
2148       tty->print_cr("Removable exceptions: %d", _nof_removable_exceptions);
2149     }
2150   }
2151 
2152   // Dump the JRT_ENTRY counters
2153   if (_new_instance_ctr) tty->print_cr("%5d new instance requires GC", _new_instance_ctr);
2154   if (_new_array_ctr) tty->print_cr("%5d new array requires GC", _new_array_ctr);
2155   if (_multi1_ctr) tty->print_cr("%5d multianewarray 1 dim", _multi1_ctr);
2156   if (_multi2_ctr) tty->print_cr("%5d multianewarray 2 dim", _multi2_ctr);
2157   if (_multi3_ctr) tty->print_cr("%5d multianewarray 3 dim", _multi3_ctr);
2158   if (_multi4_ctr) tty->print_cr("%5d multianewarray 4 dim", _multi4_ctr);
2159   if (_multi5_ctr) tty->print_cr("%5d multianewarray 5 dim", _multi5_ctr);
2160 
2161   tty->print_cr("%5d inline cache miss in compiled", _ic_miss_ctr);
2162   tty->print_cr("%5d wrong method", _wrong_method_ctr);
2163   tty->print_cr("%5d unresolved static call site", _resolve_static_ctr);
2164   tty->print_cr("%5d unresolved virtual call site", _resolve_virtual_ctr);
2165   tty->print_cr("%5d unresolved opt virtual call site", _resolve_opt_virtual_ctr);
2166 
2167   if (_mon_enter_stub_ctr) tty->print_cr("%5d monitor enter stub", _mon_enter_stub_ctr);
2168   if (_mon_exit_stub_ctr) tty->print_cr("%5d monitor exit stub", _mon_exit_stub_ctr);
2169   if (_mon_enter_ctr) tty->print_cr("%5d monitor enter slow", _mon_enter_ctr);
2170   if (_mon_exit_ctr) tty->print_cr("%5d monitor exit slow", _mon_exit_ctr);
2171   if (_partial_subtype_ctr) tty->print_cr("%5d slow partial subtype", _partial_subtype_ctr);
2172   if (_jbyte_array_copy_ctr) tty->print_cr("%5d byte array copies", _jbyte_array_copy_ctr);
2173   if (_jshort_array_copy_ctr) tty->print_cr("%5d short array copies", _jshort_array_copy_ctr);
2174   if (_jint_array_copy_ctr) tty->print_cr("%5d int array copies", _jint_array_copy_ctr);
2175   if (_jlong_array_copy_ctr) tty->print_cr("%5d long array copies", _jlong_array_copy_ctr);
2176   if (_oop_array_copy_ctr) tty->print_cr("%5d oop array copies", _oop_array_copy_ctr);
2177   if (_checkcast_array_copy_ctr) tty->print_cr("%5d checkcast array copies", _checkcast_array_copy_ctr);
2178   if (_unsafe_array_copy_ctr) tty->print_cr("%5d unsafe array copies", _unsafe_array_copy_ctr);
2179   if (_generic_array_copy_ctr) tty->print_cr("%5d generic array copies", _generic_array_copy_ctr);
2180   if (_slow_array_copy_ctr) tty->print_cr("%5d slow array copies", _slow_array_copy_ctr);
2181   if (_find_handler_ctr) tty->print_cr("%5d find exception handler", _find_handler_ctr);
2182   if (_rethrow_ctr) tty->print_cr("%5d rethrow handler", _rethrow_ctr);
2183 
2184   AdapterHandlerLibrary::print_statistics();
2185 
2186   if (xtty != NULL)  xtty->tail("statistics");
2187 }
2188 
2189 inline double percent(int x, int y) {
2190   return 100.0 * x / MAX2(y, 1);
2191 }
2192 
2193 class MethodArityHistogram {
2194  public:
2195   enum { MAX_ARITY = 256 };
2196  private:
2197   static int _arity_histogram[MAX_ARITY];     // histogram of #args
2198   static int _size_histogram[MAX_ARITY];      // histogram of arg size in words
2199   static int _max_arity;                      // max. arity seen
2200   static int _max_size;                       // max. arg size seen
2201 
2202   static void add_method_to_histogram(nmethod* nm) {
2203     Method* m = nm->method();
2204     ArgumentCount args(m->signature());
2205     int arity   = args.size() + (m->is_static() ? 0 : 1);
2206     int argsize = m->size_of_parameters();
2207     arity   = MIN2(arity, MAX_ARITY-1);
2208     argsize = MIN2(argsize, MAX_ARITY-1);
2209     int count = nm->method()->compiled_invocation_count();
2210     _arity_histogram[arity]  += count;
2211     _size_histogram[argsize] += count;
2212     _max_arity = MAX2(_max_arity, arity);
2213     _max_size  = MAX2(_max_size, argsize);
2214   }
2215 
2216   void print_histogram_helper(int n, int* histo, const char* name) {
2217     const int N = MIN2(5, n);
2218     tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2219     double sum = 0;
2220     double weighted_sum = 0;
2221     int i;
2222     for (i = 0; i <= n; i++) { sum += histo[i]; weighted_sum += i*histo[i]; }
2223     double rest = sum;
2224     double percent = sum / 100;
2225     for (i = 0; i <= N; i++) {
2226       rest -= histo[i];
2227       tty->print_cr("%4d: %7d (%5.1f%%)", i, histo[i], histo[i] / percent);
2228     }
2229     tty->print_cr("rest: %7d (%5.1f%%))", (int)rest, rest / percent);
2230     tty->print_cr("(avg. %s = %3.1f, max = %d)", name, weighted_sum / sum, n);
2231   }
2232 
2233   void print_histogram() {
2234     tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):");
2235     print_histogram_helper(_max_arity, _arity_histogram, "arity");
2236     tty->print_cr("\nSame for parameter size (in words):");
2237     print_histogram_helper(_max_size, _size_histogram, "size");
2238     tty->cr();
2239   }
2240 
2241  public:
2242   MethodArityHistogram() {
2243     MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag);
2244     _max_arity = _max_size = 0;
2245     for (int i = 0; i < MAX_ARITY; i++) _arity_histogram[i] = _size_histogram[i] = 0;
2246     CodeCache::nmethods_do(add_method_to_histogram);
2247     print_histogram();
2248   }
2249 };
2250 
2251 int MethodArityHistogram::_arity_histogram[MethodArityHistogram::MAX_ARITY];
2252 int MethodArityHistogram::_size_histogram[MethodArityHistogram::MAX_ARITY];
2253 int MethodArityHistogram::_max_arity;
2254 int MethodArityHistogram::_max_size;
2255 
2256 void SharedRuntime::print_call_statistics(int comp_total) {
2257   tty->print_cr("Calls from compiled code:");
2258   int total  = _nof_normal_calls + _nof_interface_calls + _nof_static_calls;
2259   int mono_c = _nof_normal_calls - _nof_optimized_calls - _nof_megamorphic_calls;
2260   int mono_i = _nof_interface_calls - _nof_optimized_interface_calls - _nof_megamorphic_interface_calls;
2261   tty->print_cr("\t%9d   (%4.1f%%) total non-inlined   ", total, percent(total, total));
2262   tty->print_cr("\t%9d   (%4.1f%%) virtual calls       ", _nof_normal_calls, percent(_nof_normal_calls, total));
2263   tty->print_cr("\t  %9d  (%3.0f%%)   inlined          ", _nof_inlined_calls, percent(_nof_inlined_calls, _nof_normal_calls));
2264   tty->print_cr("\t  %9d  (%3.0f%%)   optimized        ", _nof_optimized_calls, percent(_nof_optimized_calls, _nof_normal_calls));
2265   tty->print_cr("\t  %9d  (%3.0f%%)   monomorphic      ", mono_c, percent(mono_c, _nof_normal_calls));
2266   tty->print_cr("\t  %9d  (%3.0f%%)   megamorphic      ", _nof_megamorphic_calls, percent(_nof_megamorphic_calls, _nof_normal_calls));
2267   tty->print_cr("\t%9d   (%4.1f%%) interface calls     ", _nof_interface_calls, percent(_nof_interface_calls, total));
2268   tty->print_cr("\t  %9d  (%3.0f%%)   inlined          ", _nof_inlined_interface_calls, percent(_nof_inlined_interface_calls, _nof_interface_calls));
2269   tty->print_cr("\t  %9d  (%3.0f%%)   optimized        ", _nof_optimized_interface_calls, percent(_nof_optimized_interface_calls, _nof_interface_calls));
2270   tty->print_cr("\t  %9d  (%3.0f%%)   monomorphic      ", mono_i, percent(mono_i, _nof_interface_calls));
2271   tty->print_cr("\t  %9d  (%3.0f%%)   megamorphic      ", _nof_megamorphic_interface_calls, percent(_nof_megamorphic_interface_calls, _nof_interface_calls));
2272   tty->print_cr("\t%9d   (%4.1f%%) static/special calls", _nof_static_calls, percent(_nof_static_calls, total));
2273   tty->print_cr("\t  %9d  (%3.0f%%)   inlined          ", _nof_inlined_static_calls, percent(_nof_inlined_static_calls, _nof_static_calls));
2274   tty->cr();
2275   tty->print_cr("Note 1: counter updates are not MT-safe.");
2276   tty->print_cr("Note 2: %% in major categories are relative to total non-inlined calls;");
2277   tty->print_cr("        %% in nested categories are relative to their category");
2278   tty->print_cr("        (and thus add up to more than 100%% with inlining)");
2279   tty->cr();
2280 
2281   MethodArityHistogram h;
2282 }
2283 #endif
2284 
2285 
2286 // A simple wrapper class around the calling convention information
2287 // that allows sharing of adapters for the same calling convention.
2288 class AdapterFingerPrint : public CHeapObj<mtCode> {
2289  private:
2290   enum {
2291     _basic_type_bits = 4,
2292     _basic_type_mask = right_n_bits(_basic_type_bits),
2293     _basic_types_per_int = BitsPerInt / _basic_type_bits,
2294     _compact_int_count = 3
2295   };
2296   // TO DO:  Consider integrating this with a more global scheme for compressing signatures.
2297   // For now, 4 bits per components (plus T_VOID gaps after double/long) is not excessive.
2298 
2299   union {
2300     int  _compact[_compact_int_count];
2301     int* _fingerprint;
2302   } _value;
2303   int _length; // A negative length indicates the fingerprint is in the compact form,
2304                // Otherwise _value._fingerprint is the array.
2305 
2306   // Remap BasicTypes that are handled equivalently by the adapters.
2307   // These are correct for the current system but someday it might be
2308   // necessary to make this mapping platform dependent.
2309   static int adapter_encoding(BasicType in) {
2310     switch (in) {
2311       case T_BOOLEAN:
2312       case T_BYTE:
2313       case T_SHORT:
2314       case T_CHAR:
2315         // There are all promoted to T_INT in the calling convention
2316         return T_INT;
2317 
2318       case T_OBJECT:
2319       case T_ARRAY:
2320       case T_VALUETYPE:
2321         // In other words, we assume that any register good enough for
2322         // an int or long is good enough for a managed pointer.
2323 #ifdef _LP64
2324         return T_LONG;
2325 #else
2326         return T_INT;
2327 #endif
2328 
2329       case T_INT:
2330       case T_LONG:
2331       case T_FLOAT:
2332       case T_DOUBLE:
2333       case T_VOID:
2334         return in;
2335 
2336       default:
2337         ShouldNotReachHere();
2338         return T_CONFLICT;
2339     }
2340   }
2341 
2342  public:
2343   AdapterFingerPrint(int total_args_passed, BasicType* sig_bt) {
2344     // The fingerprint is based on the BasicType signature encoded
2345     // into an array of ints with eight entries per int.
2346     int* ptr;
2347     int len = (total_args_passed + (_basic_types_per_int-1)) / _basic_types_per_int;
2348     if (len <= _compact_int_count) {
2349       assert(_compact_int_count == 3, "else change next line");
2350       _value._compact[0] = _value._compact[1] = _value._compact[2] = 0;
2351       // Storing the signature encoded as signed chars hits about 98%
2352       // of the time.
2353       _length = -len;
2354       ptr = _value._compact;
2355     } else {
2356       _length = len;
2357       _value._fingerprint = NEW_C_HEAP_ARRAY(int, _length, mtCode);
2358       ptr = _value._fingerprint;
2359     }
2360 
2361     // Now pack the BasicTypes with 8 per int
2362     int sig_index = 0;
2363     for (int index = 0; index < len; index++) {
2364       int value = 0;
2365       for (int byte = 0; byte < _basic_types_per_int; byte++) {
2366         int bt = ((sig_index < total_args_passed)
2367                   ? adapter_encoding(sig_bt[sig_index++])
2368                   : 0);
2369         assert((bt & _basic_type_mask) == bt, "must fit in 4 bits");
2370         value = (value << _basic_type_bits) | bt;
2371       }
2372       ptr[index] = value;
2373     }
2374   }
2375 
2376   ~AdapterFingerPrint() {
2377     if (_length > 0) {
2378       FREE_C_HEAP_ARRAY(int, _value._fingerprint);
2379     }
2380   }
2381 
2382   int value(int index) {
2383     if (_length < 0) {
2384       return _value._compact[index];
2385     }
2386     return _value._fingerprint[index];
2387   }
2388   int length() {
2389     if (_length < 0) return -_length;
2390     return _length;
2391   }
2392 
2393   bool is_compact() {
2394     return _length <= 0;
2395   }
2396 
2397   unsigned int compute_hash() {
2398     int hash = 0;
2399     for (int i = 0; i < length(); i++) {
2400       int v = value(i);
2401       hash = (hash << 8) ^ v ^ (hash >> 5);
2402     }
2403     return (unsigned int)hash;
2404   }
2405 
2406   const char* as_string() {
2407     stringStream st;
2408     st.print("0x");
2409     for (int i = 0; i < length(); i++) {
2410       st.print("%08x", value(i));
2411     }
2412     return st.as_string();
2413   }
2414 
2415   bool equals(AdapterFingerPrint* other) {
2416     if (other->_length != _length) {
2417       return false;
2418     }
2419     if (_length < 0) {
2420       assert(_compact_int_count == 3, "else change next line");
2421       return _value._compact[0] == other->_value._compact[0] &&
2422              _value._compact[1] == other->_value._compact[1] &&
2423              _value._compact[2] == other->_value._compact[2];
2424     } else {
2425       for (int i = 0; i < _length; i++) {
2426         if (_value._fingerprint[i] != other->_value._fingerprint[i]) {
2427           return false;
2428         }
2429       }
2430     }
2431     return true;
2432   }
2433 };
2434 
2435 
2436 // A hashtable mapping from AdapterFingerPrints to AdapterHandlerEntries
2437 class AdapterHandlerTable : public BasicHashtable<mtCode> {
2438   friend class AdapterHandlerTableIterator;
2439 
2440  private:
2441 
2442 #ifndef PRODUCT
2443   static int _lookups; // number of calls to lookup
2444   static int _buckets; // number of buckets checked
2445   static int _equals;  // number of buckets checked with matching hash
2446   static int _hits;    // number of successful lookups
2447   static int _compact; // number of equals calls with compact signature
2448 #endif
2449 
2450   AdapterHandlerEntry* bucket(int i) {
2451     return (AdapterHandlerEntry*)BasicHashtable<mtCode>::bucket(i);
2452   }
2453 
2454  public:
2455   AdapterHandlerTable()
2456     : BasicHashtable<mtCode>(293, (DumpSharedSpaces ? sizeof(CDSAdapterHandlerEntry) : sizeof(AdapterHandlerEntry))) { }
2457 
2458   // Create a new entry suitable for insertion in the table
2459   AdapterHandlerEntry* new_entry(AdapterFingerPrint* fingerprint, address i2c_entry, address c2i_entry, address c2i_unverified_entry) {
2460     AdapterHandlerEntry* entry = (AdapterHandlerEntry*)BasicHashtable<mtCode>::new_entry(fingerprint->compute_hash());
2461     entry->init(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
2462     if (DumpSharedSpaces) {
2463       ((CDSAdapterHandlerEntry*)entry)->init();
2464     }
2465     return entry;
2466   }
2467 
2468   // Insert an entry into the table
2469   void add(AdapterHandlerEntry* entry) {
2470     int index = hash_to_index(entry->hash());
2471     add_entry(index, entry);
2472   }
2473 
2474   void free_entry(AdapterHandlerEntry* entry) {
2475     entry->deallocate();
2476     BasicHashtable<mtCode>::free_entry(entry);
2477   }
2478 
2479   // Find a entry with the same fingerprint if it exists
2480   AdapterHandlerEntry* lookup(int total_args_passed, BasicType* sig_bt) {
2481     NOT_PRODUCT(_lookups++);
2482     AdapterFingerPrint fp(total_args_passed, sig_bt);
2483     unsigned int hash = fp.compute_hash();
2484     int index = hash_to_index(hash);
2485     for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2486       NOT_PRODUCT(_buckets++);
2487       if (e->hash() == hash) {
2488         NOT_PRODUCT(_equals++);
2489         if (fp.equals(e->fingerprint())) {
2490 #ifndef PRODUCT
2491           if (fp.is_compact()) _compact++;
2492           _hits++;
2493 #endif
2494           return e;
2495         }
2496       }
2497     }
2498     return NULL;
2499   }
2500 
2501 #ifndef PRODUCT
2502   void print_statistics() {
2503     ResourceMark rm;
2504     int longest = 0;
2505     int empty = 0;
2506     int total = 0;
2507     int nonempty = 0;
2508     for (int index = 0; index < table_size(); index++) {
2509       int count = 0;
2510       for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) {
2511         count++;
2512       }
2513       if (count != 0) nonempty++;
2514       if (count == 0) empty++;
2515       if (count > longest) longest = count;
2516       total += count;
2517     }
2518     tty->print_cr("AdapterHandlerTable: empty %d longest %d total %d average %f",
2519                   empty, longest, total, total / (double)nonempty);
2520     tty->print_cr("AdapterHandlerTable: lookups %d buckets %d equals %d hits %d compact %d",
2521                   _lookups, _buckets, _equals, _hits, _compact);
2522   }
2523 #endif
2524 };
2525 
2526 
2527 #ifndef PRODUCT
2528 
2529 int AdapterHandlerTable::_lookups;
2530 int AdapterHandlerTable::_buckets;
2531 int AdapterHandlerTable::_equals;
2532 int AdapterHandlerTable::_hits;
2533 int AdapterHandlerTable::_compact;
2534 
2535 #endif
2536 
2537 class AdapterHandlerTableIterator : public StackObj {
2538  private:
2539   AdapterHandlerTable* _table;
2540   int _index;
2541   AdapterHandlerEntry* _current;
2542 
2543   void scan() {
2544     while (_index < _table->table_size()) {
2545       AdapterHandlerEntry* a = _table->bucket(_index);
2546       _index++;
2547       if (a != NULL) {
2548         _current = a;
2549         return;
2550       }
2551     }
2552   }
2553 
2554  public:
2555   AdapterHandlerTableIterator(AdapterHandlerTable* table): _table(table), _index(0), _current(NULL) {
2556     scan();
2557   }
2558   bool has_next() {
2559     return _current != NULL;
2560   }
2561   AdapterHandlerEntry* next() {
2562     if (_current != NULL) {
2563       AdapterHandlerEntry* result = _current;
2564       _current = _current->next();
2565       if (_current == NULL) scan();
2566       return result;
2567     } else {
2568       return NULL;
2569     }
2570   }
2571 };
2572 
2573 
2574 // ---------------------------------------------------------------------------
2575 // Implementation of AdapterHandlerLibrary
2576 AdapterHandlerTable* AdapterHandlerLibrary::_adapters = NULL;
2577 AdapterHandlerEntry* AdapterHandlerLibrary::_abstract_method_handler = NULL;
2578 const int AdapterHandlerLibrary_size = 16*K;
2579 BufferBlob* AdapterHandlerLibrary::_buffer = NULL;
2580 
2581 BufferBlob* AdapterHandlerLibrary::buffer_blob() {
2582   // Should be called only when AdapterHandlerLibrary_lock is active.
2583   if (_buffer == NULL) // Initialize lazily
2584       _buffer = BufferBlob::create("adapters", AdapterHandlerLibrary_size);
2585   return _buffer;
2586 }
2587 
2588 extern "C" void unexpected_adapter_call() {
2589   ShouldNotCallThis();
2590 }
2591 
2592 void AdapterHandlerLibrary::initialize() {
2593   if (_adapters != NULL) return;
2594   _adapters = new AdapterHandlerTable();
2595 
2596   // Create a special handler for abstract methods.  Abstract methods
2597   // are never compiled so an i2c entry is somewhat meaningless, but
2598   // throw AbstractMethodError just in case.
2599   // Pass wrong_method_abstract for the c2i transitions to return
2600   // AbstractMethodError for invalid invocations.
2601   address wrong_method_abstract = SharedRuntime::get_handle_wrong_method_abstract_stub();
2602   _abstract_method_handler = AdapterHandlerLibrary::new_entry(new AdapterFingerPrint(0, NULL),
2603                                                               StubRoutines::throw_AbstractMethodError_entry(),
2604                                                               wrong_method_abstract, wrong_method_abstract);
2605 }
2606 
2607 AdapterHandlerEntry* AdapterHandlerLibrary::new_entry(AdapterFingerPrint* fingerprint,
2608                                                       address i2c_entry,
2609                                                       address c2i_entry,
2610                                                       address c2i_unverified_entry) {
2611   return _adapters->new_entry(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry);
2612 }
2613 
2614 // Value type arguments are not passed by reference, instead each
2615 // field of the value type is passed as an argument. This helper
2616 // function collects the fields of the value types (including embedded
2617 // value type's fields) in a list. Included with the field's type is
2618 // the offset of each field in the value type: i2c and c2i adapters
2619 // need that to load or store fields. Finally, the list of fields is
2620 // sorted in order of increasing offsets: the adapters and the
2621 // compiled code need and agreed upon order of fields.
2622 //
2623 // The list of basic type that is returned starts with a T_VALUETYPE
2624 // and ends with an extra T_VOID. T_VALUETYPE/T_VOID are used as
2625 // delimiters. Every entry between the two is a field of the value
2626 // type. If there's an embedded value type in the list, it also starts
2627 // with a T_VALUETYPE and ends with a T_VOID. This is so we can
2628 // generate a unique fingerprint for the method's adapters and we can
2629 // generate the list of basic types from the interpreter point of view
2630 // (value types passed as reference: iterate on the list until a
2631 // T_VALUETYPE, drop everything until and including the closing
2632 // T_VOID) or the compiler point of view (each field of the value
2633 // types is an argument: drop all T_VALUETYPE/T_VOID from the list).
2634 static GrowableArray<SigEntry> collect_fields(ValueKlass* vk, int base_off = 0) {
2635   GrowableArray<SigEntry> sig_extended;
2636   sig_extended.push(SigEntry(T_VALUETYPE, base_off));
2637   for (JavaFieldStream fs(vk); !fs.done(); fs.next()) {
2638     if (fs.access_flags().is_static())  continue;
2639     fieldDescriptor& fd = fs.field_descriptor();
2640     BasicType bt = fd.field_type();
2641     int offset = base_off + fd.offset() - (base_off > 0 ? vk->first_field_offset() : 0);
2642     if (bt == T_VALUETYPE) {
2643       Symbol* signature = fd.signature();
2644       JavaThread* THREAD = JavaThread::current();
2645       oop loader = vk->class_loader();
2646       oop protection_domain = vk->protection_domain();
2647       Klass* klass = SystemDictionary::resolve_or_null(signature,
2648                                                        Handle(THREAD, loader), Handle(THREAD, protection_domain),
2649                                                        THREAD);
2650       assert(klass != NULL && !HAS_PENDING_EXCEPTION, "lookup shouldn't fail");
2651       const GrowableArray<SigEntry>& embedded = collect_fields(ValueKlass::cast(klass), offset);
2652       sig_extended.appendAll(&embedded);
2653     } else {
2654       sig_extended.push(SigEntry(bt, offset));
2655       if (bt == T_LONG || bt == T_DOUBLE) {
2656         sig_extended.push(SigEntry(T_VOID, offset));
2657       }
2658     }
2659   }
2660   int offset = base_off + vk->size_helper()*HeapWordSize - (base_off > 0 ? vk->first_field_offset() : 0);
2661   sig_extended.push(SigEntry(T_VOID, offset)); // hack: use T_VOID to mark end of value type fields
2662   if (base_off == 0) {
2663     sig_extended.sort(SigEntry::compare);
2664   }
2665   assert(sig_extended.at(0)._bt == T_VALUETYPE && sig_extended.at(sig_extended.length()-1)._bt == T_VOID, "broken structure");
2666   return sig_extended;
2667 }
2668 
2669 AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter(const methodHandle& method) {
2670   AdapterHandlerEntry* entry = get_adapter0(method);
2671   if (method->is_shared()) {
2672     // See comments around Method::link_method()
2673     MutexLocker mu(AdapterHandlerLibrary_lock);
2674     if (method->adapter() == NULL) {
2675       method->update_adapter_trampoline(entry);
2676     }
2677     address trampoline = method->from_compiled_entry();
2678     if (*(int*)trampoline == 0) {
2679       CodeBuffer buffer(trampoline, (int)SharedRuntime::trampoline_size());
2680       MacroAssembler _masm(&buffer);
2681       SharedRuntime::generate_trampoline(&_masm, entry->get_c2i_entry());
2682       assert(*(int*)trampoline != 0, "Instruction(s) for trampoline must not be encoded as zeros.");
2683 
2684       if (PrintInterpreter) {
2685         Disassembler::decode(buffer.insts_begin(), buffer.insts_end());
2686       }
2687     }
2688   }
2689 
2690   return entry;
2691 }
2692 
2693 AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter0(const methodHandle& method) {
2694   // Use customized signature handler.  Need to lock around updates to
2695   // the AdapterHandlerTable (it is not safe for concurrent readers
2696   // and a single writer: this could be fixed if it becomes a
2697   // problem).
2698 
2699   ResourceMark rm;
2700 
2701   NOT_PRODUCT(int insts_size = 0);
2702   AdapterBlob* new_adapter = NULL;
2703   AdapterHandlerEntry* entry = NULL;
2704   AdapterFingerPrint* fingerprint = NULL;
2705   {
2706     MutexLocker mu(AdapterHandlerLibrary_lock);
2707     // make sure data structure is initialized
2708     initialize();
2709 
2710     if (method->is_abstract()) {
2711       return _abstract_method_handler;
2712     }
2713 
2714     // Fill in the signature array, for the calling-convention call.
2715     GrowableArray<SigEntry> sig_extended;
2716     {
2717       MutexUnlocker mul(AdapterHandlerLibrary_lock);
2718       Thread* THREAD = Thread::current();
2719       Klass* holder = method->method_holder();
2720       GrowableArray<BasicType> sig_bt_tmp;
2721 
2722       int i = 0;
2723       if (!method->is_static()) {  // Pass in receiver first
2724         if (ValueTypePassFieldsAsArgs && holder->is_value()) {
2725           ValueKlass* vk = ValueKlass::cast(holder);
2726           if (vk == SystemDictionary::___Value_klass()) {
2727             // If the holder of the method is __Value, we must pass a
2728             // reference. FIXME: this shouldn't be T_OBJECT as a value
2729             // type reference is not necessarily an oop. Ideally we
2730             // would use T_VALUETYPE but we can't because T_VALUETYPE
2731             // is used here as a marker right before the list of
2732             // fields for the value type.
2733             sig_extended.push(SigEntry(T_OBJECT));
2734           } else {
2735             const GrowableArray<SigEntry>& sig_vk = collect_fields(vk);
2736             sig_extended.appendAll(&sig_vk);
2737           }
2738         } else {
2739           sig_extended.push(SigEntry(T_OBJECT));
2740         }
2741       }
2742       for (SignatureStream ss(method->signature()); !ss.at_return_type(); ss.next()) {
2743         if (ValueTypePassFieldsAsArgs && ss.type() == T_VALUETYPE) {
2744           Klass* k = ss.as_klass(Handle(THREAD, holder->class_loader()),
2745                                  Handle(THREAD, holder->protection_domain()),
2746                                  SignatureStream::ReturnNull, THREAD);
2747           assert(k != NULL && !HAS_PENDING_EXCEPTION, "can resolve klass?");
2748           assert(k != SystemDictionary::___Value_klass(), "unsupported");
2749           ValueKlass* vk = ValueKlass::cast(k);
2750           const GrowableArray<SigEntry>& sig_vk = collect_fields(vk);
2751           sig_extended.appendAll(&sig_vk);
2752         } else {
2753           sig_extended.push(SigEntry(ss.type()));
2754           if (ss.type() == T_LONG || ss.type() == T_DOUBLE) {
2755             sig_extended.push(SigEntry(T_VOID));
2756           }
2757         }
2758       }
2759     }
2760 
2761     int values = 0;
2762     if (ValueTypePassFieldsAsArgs) {
2763       for (int i = 0; i < sig_extended.length(); i++) {
2764         if (sig_extended.at(i)._bt == T_VALUETYPE) {
2765           values++;
2766         }
2767       }
2768     }
2769     int total_args_passed_cc = sig_extended.length() - 2 * values;
2770     BasicType* sig_bt_cc = NEW_RESOURCE_ARRAY(BasicType, total_args_passed_cc);
2771 
2772     int j = 0;
2773     for (int i = 0; i < sig_extended.length(); i++) {
2774       if (!ValueTypePassFieldsAsArgs) {
2775         sig_bt_cc[j++] = sig_extended.at(i)._bt;
2776       } else if (sig_extended.at(i)._bt != T_VALUETYPE &&
2777                  (sig_extended.at(i)._bt != T_VOID ||
2778                   sig_extended.at(i-1)._bt == T_LONG ||
2779                   sig_extended.at(i-1)._bt == T_DOUBLE)) {
2780         sig_bt_cc[j++] = sig_extended.at(i)._bt;
2781       }
2782     }
2783     assert(j == total_args_passed_cc, "bad number of arguments");
2784 
2785     int total_args_passed_fp = sig_extended.length();
2786     BasicType* sig_bt_fp = NEW_RESOURCE_ARRAY(BasicType, total_args_passed_fp);
2787     for (int i = 0; i < sig_extended.length(); i++) {
2788       sig_bt_fp[i] = sig_extended.at(i)._bt;
2789     }
2790 
2791     VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed_cc);
2792 
2793     // Lookup method signature's fingerprint
2794     entry = _adapters->lookup(total_args_passed_fp, sig_bt_fp);
2795 
2796 #ifdef ASSERT
2797     AdapterHandlerEntry* shared_entry = NULL;
2798     // Start adapter sharing verification only after the VM is booted.
2799     if (VerifyAdapterSharing && (entry != NULL)) {
2800       shared_entry = entry;
2801       entry = NULL;
2802     }
2803 #endif
2804 
2805     if (entry != NULL) {
2806       return entry;
2807     }
2808 
2809     // Get a description of the compiled java calling convention and the largest used (VMReg) stack slot usage
2810     int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt_cc, regs, total_args_passed_cc, false);
2811 
2812     // Make a C heap allocated version of the fingerprint to store in the adapter
2813     fingerprint = new AdapterFingerPrint(total_args_passed_fp, sig_bt_fp);
2814 
2815     // StubRoutines::code2() is initialized after this function can be called. As a result,
2816     // VerifyAdapterCalls and VerifyAdapterSharing can fail if we re-use code that generated
2817     // prior to StubRoutines::code2() being set. Checks refer to checks generated in an I2C
2818     // stub that ensure that an I2C stub is called from an interpreter frame.
2819     bool contains_all_checks = StubRoutines::code2() != NULL;
2820 
2821     // Create I2C & C2I handlers
2822     BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache
2823     if (buf != NULL) {
2824       CodeBuffer buffer(buf);
2825       short buffer_locs[20];
2826       buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs,
2827                                              sizeof(buffer_locs)/sizeof(relocInfo));
2828 
2829       MacroAssembler _masm(&buffer);
2830       entry = SharedRuntime::generate_i2c2i_adapters(&_masm,
2831                                                      comp_args_on_stack,
2832                                                      sig_extended,
2833                                                      regs,
2834                                                      fingerprint,
2835                                                      new_adapter);
2836 #ifdef ASSERT
2837       if (VerifyAdapterSharing) {
2838         if (shared_entry != NULL) {
2839           assert(shared_entry->compare_code(buf->code_begin(), buffer.insts_size()), "code must match");
2840           // Release the one just created and return the original
2841           _adapters->free_entry(entry);
2842           return shared_entry;
2843         } else  {
2844           entry->save_code(buf->code_begin(), buffer.insts_size());
2845         }
2846       }
2847 #endif
2848 
2849       NOT_PRODUCT(insts_size = buffer.insts_size());
2850     }
2851     if (new_adapter == NULL) {
2852       // CodeCache is full, disable compilation
2853       // Ought to log this but compile log is only per compile thread
2854       // and we're some non descript Java thread.
2855       return NULL; // Out of CodeCache space
2856     }
2857     entry->relocate(new_adapter->content_begin());
2858 #ifndef PRODUCT
2859     // debugging suppport
2860     if (PrintAdapterHandlers || PrintStubCode) {
2861       ttyLocker ttyl;
2862       entry->print_adapter_on(tty);
2863       tty->print_cr("i2c argument handler #%d for: %s %s %s (%d bytes generated)",
2864                     _adapters->number_of_entries(), (method->is_static() ? "static" : "receiver"),
2865                     method->signature()->as_C_string(), fingerprint->as_string(), insts_size);
2866       tty->print_cr("c2i argument handler starts at %p", entry->get_c2i_entry());
2867       if (Verbose || PrintStubCode) {
2868         address first_pc = entry->base_address();
2869         if (first_pc != NULL) {
2870           Disassembler::decode(first_pc, first_pc + insts_size);
2871           tty->cr();
2872         }
2873       }
2874     }
2875 #endif
2876     // Add the entry only if the entry contains all required checks (see sharedRuntime_xxx.cpp)
2877     // The checks are inserted only if -XX:+VerifyAdapterCalls is specified.
2878     if (contains_all_checks || !VerifyAdapterCalls) {
2879       _adapters->add(entry);
2880     }
2881   }
2882   // Outside of the lock
2883   if (new_adapter != NULL) {
2884     char blob_id[256];
2885     jio_snprintf(blob_id,
2886                  sizeof(blob_id),
2887                  "%s(%s)@" PTR_FORMAT,
2888                  new_adapter->name(),
2889                  fingerprint->as_string(),
2890                  new_adapter->content_begin());
2891     Forte::register_stub(blob_id, new_adapter->content_begin(), new_adapter->content_end());
2892 
2893     if (JvmtiExport::should_post_dynamic_code_generated()) {
2894       JvmtiExport::post_dynamic_code_generated(blob_id, new_adapter->content_begin(), new_adapter->content_end());
2895     }
2896   }
2897   return entry;
2898 }
2899 
2900 address AdapterHandlerEntry::base_address() {
2901   address base = _i2c_entry;
2902   if (base == NULL)  base = _c2i_entry;
2903   assert(base <= _c2i_entry || _c2i_entry == NULL, "");
2904   assert(base <= _c2i_unverified_entry || _c2i_unverified_entry == NULL, "");
2905   return base;
2906 }
2907 
2908 void AdapterHandlerEntry::relocate(address new_base) {
2909   address old_base = base_address();
2910   assert(old_base != NULL, "");
2911   ptrdiff_t delta = new_base - old_base;
2912   if (_i2c_entry != NULL)
2913     _i2c_entry += delta;
2914   if (_c2i_entry != NULL)
2915     _c2i_entry += delta;
2916   if (_c2i_unverified_entry != NULL)
2917     _c2i_unverified_entry += delta;
2918   assert(base_address() == new_base, "");
2919 }
2920 
2921 
2922 void AdapterHandlerEntry::deallocate() {
2923   delete _fingerprint;
2924 #ifdef ASSERT
2925   if (_saved_code) FREE_C_HEAP_ARRAY(unsigned char, _saved_code);
2926 #endif
2927 }
2928 
2929 
2930 #ifdef ASSERT
2931 // Capture the code before relocation so that it can be compared
2932 // against other versions.  If the code is captured after relocation
2933 // then relative instructions won't be equivalent.
2934 void AdapterHandlerEntry::save_code(unsigned char* buffer, int length) {
2935   _saved_code = NEW_C_HEAP_ARRAY(unsigned char, length, mtCode);
2936   _saved_code_length = length;
2937   memcpy(_saved_code, buffer, length);
2938 }
2939 
2940 
2941 bool AdapterHandlerEntry::compare_code(unsigned char* buffer, int length) {
2942   if (length != _saved_code_length) {
2943     return false;
2944   }
2945 
2946   return (memcmp(buffer, _saved_code, length) == 0) ? true : false;
2947 }
2948 #endif
2949 
2950 
2951 /**
2952  * Create a native wrapper for this native method.  The wrapper converts the
2953  * Java-compiled calling convention to the native convention, handles
2954  * arguments, and transitions to native.  On return from the native we transition
2955  * back to java blocking if a safepoint is in progress.
2956  */
2957 void AdapterHandlerLibrary::create_native_wrapper(const methodHandle& method) {
2958   ResourceMark rm;
2959   nmethod* nm = NULL;
2960 
2961   assert(method->is_native(), "must be native");
2962   assert(method->is_method_handle_intrinsic() ||
2963          method->has_native_function(), "must have something valid to call!");
2964 
2965   {
2966     // Perform the work while holding the lock, but perform any printing outside the lock
2967     MutexLocker mu(AdapterHandlerLibrary_lock);
2968     // See if somebody beat us to it
2969     if (method->code() != NULL) {
2970       return;
2971     }
2972 
2973     const int compile_id = CompileBroker::assign_compile_id(method, CompileBroker::standard_entry_bci);
2974     assert(compile_id > 0, "Must generate native wrapper");
2975 
2976 
2977     ResourceMark rm;
2978     BufferBlob*  buf = buffer_blob(); // the temporary code buffer in CodeCache
2979     if (buf != NULL) {
2980       CodeBuffer buffer(buf);
2981       double locs_buf[20];
2982       buffer.insts()->initialize_shared_locs((relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo));
2983       MacroAssembler _masm(&buffer);
2984 
2985       // Fill in the signature array, for the calling-convention call.
2986       const int total_args_passed = method->size_of_parameters();
2987 
2988       BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed);
2989       VMRegPair*   regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed);
2990       int i=0;
2991       if (!method->is_static())  // Pass in receiver first
2992         sig_bt[i++] = T_OBJECT;
2993       SignatureStream ss(method->signature());
2994       for (; !ss.at_return_type(); ss.next()) {
2995         sig_bt[i++] = ss.type();  // Collect remaining bits of signature
2996         if (ss.type() == T_LONG || ss.type() == T_DOUBLE)
2997           sig_bt[i++] = T_VOID;   // Longs & doubles take 2 Java slots
2998       }
2999       assert(i == total_args_passed, "");
3000       BasicType ret_type = ss.type();
3001 
3002       // Now get the compiled-Java layout as input (or output) arguments.
3003       // NOTE: Stubs for compiled entry points of method handle intrinsics
3004       // are just trampolines so the argument registers must be outgoing ones.
3005       const bool is_outgoing = method->is_method_handle_intrinsic();
3006       int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, is_outgoing);
3007 
3008       // Generate the compiled-to-native wrapper code
3009       nm = SharedRuntime::generate_native_wrapper(&_masm, method, compile_id, sig_bt, regs, ret_type);
3010 
3011       if (nm != NULL) {
3012         method->set_code(method, nm);
3013 
3014         DirectiveSet* directive = DirectivesStack::getDefaultDirective(CompileBroker::compiler(CompLevel_simple));
3015         if (directive->PrintAssemblyOption) {
3016           nm->print_code();
3017         }
3018         DirectivesStack::release(directive);
3019       }
3020     }
3021   } // Unlock AdapterHandlerLibrary_lock
3022 
3023 
3024   // Install the generated code.
3025   if (nm != NULL) {
3026     const char *msg = method->is_static() ? "(static)" : "";
3027     CompileTask::print_ul(nm, msg);
3028     if (PrintCompilation) {
3029       ttyLocker ttyl;
3030       CompileTask::print(tty, nm, msg);
3031     }
3032     nm->post_compiled_method_load_event();
3033   }
3034 }
3035 
3036 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::block_for_jni_critical(JavaThread* thread))
3037   assert(thread == JavaThread::current(), "must be");
3038   // The code is about to enter a JNI lazy critical native method and
3039   // _needs_gc is true, so if this thread is already in a critical
3040   // section then just return, otherwise this thread should block
3041   // until needs_gc has been cleared.
3042   if (thread->in_critical()) {
3043     return;
3044   }
3045   // Lock and unlock a critical section to give the system a chance to block
3046   GCLocker::lock_critical(thread);
3047   GCLocker::unlock_critical(thread);
3048 JRT_END
3049 
3050 // -------------------------------------------------------------------------
3051 // Java-Java calling convention
3052 // (what you use when Java calls Java)
3053 
3054 //------------------------------name_for_receiver----------------------------------
3055 // For a given signature, return the VMReg for parameter 0.
3056 VMReg SharedRuntime::name_for_receiver() {
3057   VMRegPair regs;
3058   BasicType sig_bt = T_OBJECT;
3059   (void) java_calling_convention(&sig_bt, &regs, 1, true);
3060   // Return argument 0 register.  In the LP64 build pointers
3061   // take 2 registers, but the VM wants only the 'main' name.
3062   return regs.first();
3063 }
3064 
3065 VMRegPair *SharedRuntime::find_callee_arguments(Symbol* sig, bool has_receiver, bool has_appendix, int* arg_size) {
3066   // This method is returning a data structure allocating as a
3067   // ResourceObject, so do not put any ResourceMarks in here.
3068   char *s = sig->as_C_string();
3069   int len = (int)strlen(s);
3070   s++; len--;                   // Skip opening paren
3071 
3072   BasicType *sig_bt = NEW_RESOURCE_ARRAY(BasicType, 256);
3073   VMRegPair *regs = NEW_RESOURCE_ARRAY(VMRegPair, 256);
3074   int cnt = 0;
3075   if (has_receiver) {
3076     sig_bt[cnt++] = T_OBJECT; // Receiver is argument 0; not in signature
3077   }
3078 
3079   while (*s != ')') {          // Find closing right paren
3080     switch (*s++) {            // Switch on signature character
3081     case 'B': sig_bt[cnt++] = T_BYTE;    break;
3082     case 'C': sig_bt[cnt++] = T_CHAR;    break;
3083     case 'D': sig_bt[cnt++] = T_DOUBLE;  sig_bt[cnt++] = T_VOID; break;
3084     case 'F': sig_bt[cnt++] = T_FLOAT;   break;
3085     case 'I': sig_bt[cnt++] = T_INT;     break;
3086     case 'J': sig_bt[cnt++] = T_LONG;    sig_bt[cnt++] = T_VOID; break;
3087     case 'S': sig_bt[cnt++] = T_SHORT;   break;
3088     case 'Z': sig_bt[cnt++] = T_BOOLEAN; break;
3089     case 'V': sig_bt[cnt++] = T_VOID;    break;
3090     case 'L':                   // Oop
3091       while (*s++ != ';');   // Skip signature
3092       sig_bt[cnt++] = T_OBJECT;
3093       break;
3094     case '[': {                 // Array
3095       do {                      // Skip optional size
3096         while (*s >= '0' && *s <= '9') s++;
3097       } while (*s++ == '[');   // Nested arrays?
3098       // Skip element type
3099       if (s[-1] == 'L')
3100         while (*s++ != ';'); // Skip signature
3101       sig_bt[cnt++] = T_ARRAY;
3102       break;
3103     }
3104     default : ShouldNotReachHere();
3105     }
3106   }
3107 
3108   if (has_appendix) {
3109     sig_bt[cnt++] = T_OBJECT;
3110   }
3111 
3112   assert(cnt < 256, "grow table size");
3113 
3114   int comp_args_on_stack;
3115   comp_args_on_stack = java_calling_convention(sig_bt, regs, cnt, true);
3116 
3117   // the calling convention doesn't count out_preserve_stack_slots so
3118   // we must add that in to get "true" stack offsets.
3119 
3120   if (comp_args_on_stack) {
3121     for (int i = 0; i < cnt; i++) {
3122       VMReg reg1 = regs[i].first();
3123       if (reg1->is_stack()) {
3124         // Yuck
3125         reg1 = reg1->bias(out_preserve_stack_slots());
3126       }
3127       VMReg reg2 = regs[i].second();
3128       if (reg2->is_stack()) {
3129         // Yuck
3130         reg2 = reg2->bias(out_preserve_stack_slots());
3131       }
3132       regs[i].set_pair(reg2, reg1);
3133     }
3134   }
3135 
3136   // results
3137   *arg_size = cnt;
3138   return regs;
3139 }
3140 
3141 // OSR Migration Code
3142 //
3143 // This code is used convert interpreter frames into compiled frames.  It is
3144 // called from very start of a compiled OSR nmethod.  A temp array is
3145 // allocated to hold the interesting bits of the interpreter frame.  All
3146 // active locks are inflated to allow them to move.  The displaced headers and
3147 // active interpreter locals are copied into the temp buffer.  Then we return
3148 // back to the compiled code.  The compiled code then pops the current
3149 // interpreter frame off the stack and pushes a new compiled frame.  Then it
3150 // copies the interpreter locals and displaced headers where it wants.
3151 // Finally it calls back to free the temp buffer.
3152 //
3153 // All of this is done NOT at any Safepoint, nor is any safepoint or GC allowed.
3154 
3155 JRT_LEAF(intptr_t*, SharedRuntime::OSR_migration_begin( JavaThread *thread) )
3156 
3157   //
3158   // This code is dependent on the memory layout of the interpreter local
3159   // array and the monitors. On all of our platforms the layout is identical
3160   // so this code is shared. If some platform lays the their arrays out
3161   // differently then this code could move to platform specific code or
3162   // the code here could be modified to copy items one at a time using
3163   // frame accessor methods and be platform independent.
3164 
3165   frame fr = thread->last_frame();
3166   assert(fr.is_interpreted_frame(), "");
3167   assert(fr.interpreter_frame_expression_stack_size()==0, "only handle empty stacks");
3168 
3169   // Figure out how many monitors are active.
3170   int active_monitor_count = 0;
3171   for (BasicObjectLock *kptr = fr.interpreter_frame_monitor_end();
3172        kptr < fr.interpreter_frame_monitor_begin();
3173        kptr = fr.next_monitor_in_interpreter_frame(kptr) ) {
3174     if (kptr->obj() != NULL) active_monitor_count++;
3175   }
3176 
3177   // QQQ we could place number of active monitors in the array so that compiled code
3178   // could double check it.
3179 
3180   Method* moop = fr.interpreter_frame_method();
3181   int max_locals = moop->max_locals();
3182   // Allocate temp buffer, 1 word per local & 2 per active monitor
3183   int buf_size_words = max_locals + active_monitor_count * BasicObjectLock::size();
3184   intptr_t *buf = NEW_C_HEAP_ARRAY(intptr_t,buf_size_words, mtCode);
3185 
3186   // Copy the locals.  Order is preserved so that loading of longs works.
3187   // Since there's no GC I can copy the oops blindly.
3188   assert(sizeof(HeapWord)==sizeof(intptr_t), "fix this code");
3189   Copy::disjoint_words((HeapWord*)fr.interpreter_frame_local_at(max_locals-1),
3190                        (HeapWord*)&buf[0],
3191                        max_locals);
3192 
3193   // Inflate locks.  Copy the displaced headers.  Be careful, there can be holes.
3194   int i = max_locals;
3195   for (BasicObjectLock *kptr2 = fr.interpreter_frame_monitor_end();
3196        kptr2 < fr.interpreter_frame_monitor_begin();
3197        kptr2 = fr.next_monitor_in_interpreter_frame(kptr2) ) {
3198     if (kptr2->obj() != NULL) {         // Avoid 'holes' in the monitor array
3199       BasicLock *lock = kptr2->lock();
3200       // Inflate so the displaced header becomes position-independent
3201       if (lock->displaced_header()->is_unlocked())
3202         ObjectSynchronizer::inflate_helper(kptr2->obj());
3203       // Now the displaced header is free to move
3204       buf[i++] = (intptr_t)lock->displaced_header();
3205       buf[i++] = cast_from_oop<intptr_t>(kptr2->obj());
3206     }
3207   }
3208   assert(i - max_locals == active_monitor_count*2, "found the expected number of monitors");
3209 
3210   return buf;
3211 JRT_END
3212 
3213 JRT_LEAF(void, SharedRuntime::OSR_migration_end( intptr_t* buf) )
3214   FREE_C_HEAP_ARRAY(intptr_t, buf);
3215 JRT_END
3216 
3217 bool AdapterHandlerLibrary::contains(const CodeBlob* b) {
3218   AdapterHandlerTableIterator iter(_adapters);
3219   while (iter.has_next()) {
3220     AdapterHandlerEntry* a = iter.next();
3221     if (b == CodeCache::find_blob(a->get_i2c_entry())) return true;
3222   }
3223   return false;
3224 }
3225 
3226 void AdapterHandlerLibrary::print_handler_on(outputStream* st, const CodeBlob* b) {
3227   AdapterHandlerTableIterator iter(_adapters);
3228   while (iter.has_next()) {
3229     AdapterHandlerEntry* a = iter.next();
3230     if (b == CodeCache::find_blob(a->get_i2c_entry())) {
3231       st->print("Adapter for signature: ");
3232       a->print_adapter_on(tty);
3233       return;
3234     }
3235   }
3236   assert(false, "Should have found handler");
3237 }
3238 
3239 void AdapterHandlerEntry::print_adapter_on(outputStream* st) const {
3240   st->print_cr("AHE@" INTPTR_FORMAT ": %s i2c: " INTPTR_FORMAT " c2i: " INTPTR_FORMAT " c2iUV: " INTPTR_FORMAT,
3241                p2i(this), fingerprint()->as_string(),
3242                p2i(get_i2c_entry()), p2i(get_c2i_entry()), p2i(get_c2i_unverified_entry()));
3243 
3244 }
3245 
3246 #if INCLUDE_CDS
3247 
3248 void CDSAdapterHandlerEntry::init() {
3249   assert(DumpSharedSpaces, "used during dump time only");
3250   _c2i_entry_trampoline = (address)MetaspaceShared::misc_data_space_alloc(SharedRuntime::trampoline_size());
3251   _adapter_trampoline = (AdapterHandlerEntry**)MetaspaceShared::misc_data_space_alloc(sizeof(AdapterHandlerEntry*));
3252 };
3253 
3254 #endif // INCLUDE_CDS
3255 
3256 
3257 #ifndef PRODUCT
3258 
3259 void AdapterHandlerLibrary::print_statistics() {
3260   _adapters->print_statistics();
3261 }
3262 
3263 #endif /* PRODUCT */
3264 
3265 JRT_LEAF(void, SharedRuntime::enable_stack_reserved_zone(JavaThread* thread))
3266   assert(thread->is_Java_thread(), "Only Java threads have a stack reserved zone");
3267   thread->enable_stack_reserved_zone();
3268   thread->set_reserved_stack_activation(thread->stack_base());
3269 JRT_END
3270 
3271 frame SharedRuntime::look_for_reserved_stack_annotated_method(JavaThread* thread, frame fr) {
3272   frame activation;
3273   CompiledMethod* nm = NULL;
3274   int count = 1;
3275 
3276   assert(fr.is_java_frame(), "Must start on Java frame");
3277 
3278   while (true) {
3279     Method* method = NULL;
3280     if (fr.is_interpreted_frame()) {
3281       method = fr.interpreter_frame_method();
3282     } else {
3283       CodeBlob* cb = fr.cb();
3284       if (cb != NULL && cb->is_compiled()) {
3285         nm = cb->as_compiled_method();
3286         method = nm->method();
3287       }
3288     }
3289     if ((method != NULL) && method->has_reserved_stack_access()) {
3290       ResourceMark rm(thread);
3291       activation = fr;
3292       warning("Potentially dangerous stack overflow in "
3293               "ReservedStackAccess annotated method %s [%d]",
3294               method->name_and_sig_as_C_string(), count++);
3295       EventReservedStackActivation event;
3296       if (event.should_commit()) {
3297         event.set_method(method);
3298         event.commit();
3299       }
3300     }
3301     if (fr.is_first_java_frame()) {
3302       break;
3303     } else {
3304       fr = fr.java_sender();
3305     }
3306   }
3307   return activation;
3308 }
3309 
3310 // We are at a compiled code to interpreter call. We need backing
3311 // buffers for all value type arguments. Allocate an object array to
3312 // hold them (convenient because once we're done with it we don't have
3313 // to worry about freeing it).
3314 JRT_ENTRY(void, SharedRuntime::allocate_value_types(JavaThread* thread, Method* callee_method))
3315 {
3316   assert(ValueTypePassFieldsAsArgs, "no reason to call this");
3317   ResourceMark rm;
3318   JavaThread* THREAD = thread;
3319   methodHandle callee(callee_method);
3320 
3321   int nb_slots = 0;
3322   bool has_value_receiver = !callee->is_static() && callee->method_holder()->is_value();
3323   if (has_value_receiver) {
3324     nb_slots++;
3325   }
3326   Handle class_loader(THREAD, callee->method_holder()->class_loader());
3327   Handle protection_domain(THREAD, callee->method_holder()->protection_domain());
3328   for (SignatureStream ss(callee->signature()); !ss.at_return_type(); ss.next()) {
3329     if (ss.type() == T_VALUETYPE) {
3330       nb_slots++;
3331     }
3332   }
3333   objArrayOop array_oop = oopFactory::new_objectArray(nb_slots, CHECK);
3334   objArrayHandle array(THREAD, array_oop);
3335   int i = 0;
3336   if (has_value_receiver) {
3337     ValueKlass* vk = ValueKlass::cast(callee->method_holder());
3338     oop res = vk->allocate_instance(CHECK);
3339     array->obj_at_put(i, res);
3340     i++;
3341   }
3342   for (SignatureStream ss(callee->signature()); !ss.at_return_type(); ss.next()) {
3343     if (ss.type() == T_VALUETYPE) {
3344       Klass* k = ss.as_klass(class_loader, protection_domain, SignatureStream::ReturnNull, THREAD);
3345       assert(k != NULL && !HAS_PENDING_EXCEPTION, "can't resolve klass");
3346       ValueKlass* vk = ValueKlass::cast(k);
3347       oop res = vk->allocate_instance(CHECK);
3348       array->obj_at_put(i, res);
3349       i++;
3350     }
3351   }
3352   thread->set_vm_result(array());
3353   thread->set_vm_result_2(callee()); // TODO: required to keep callee live?
3354 }
3355 JRT_END