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