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