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