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