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