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