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