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