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