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 // Adjust invocation mode according to the attached method. 1138 switch (bc) { 1139 case Bytecodes::_invokeinterface: 1140 if (!attached_method->method_holder()->is_interface()) { 1141 bc = Bytecodes::_invokevirtual; 1142 } 1143 break; 1144 case Bytecodes::_invokehandle: 1145 if (!MethodHandles::is_signature_polymorphic_method(attached_method())) { 1146 bc = attached_method->is_static() ? Bytecodes::_invokestatic 1147 : Bytecodes::_invokevirtual; 1148 } 1149 break; 1150 } 1151 } 1152 } else { 1153 bc = bytecode.invoke_code(); 1154 } 1155 1156 bool has_receiver = bc != Bytecodes::_invokestatic && 1157 bc != Bytecodes::_invokedynamic && 1158 bc != Bytecodes::_invokehandle; 1159 1160 // Find receiver for non-static call 1161 if (has_receiver) { 1162 // This register map must be update since we need to find the receiver for 1163 // compiled frames. The receiver might be in a register. 1164 RegisterMap reg_map2(thread); 1165 frame stubFrame = thread->last_frame(); 1166 // Caller-frame is a compiled frame 1167 frame callerFrame = stubFrame.sender(®_map2); 1168 1169 if (attached_method.is_null()) { 1170 methodHandle callee = bytecode.static_target(CHECK_NH); 1171 if (callee.is_null()) { 1172 THROW_(vmSymbols::java_lang_NoSuchMethodException(), nullHandle); 1173 } 1174 } 1175 1176 // Retrieve from a compiled argument list 1177 receiver = Handle(THREAD, callerFrame.retrieve_receiver(®_map2)); 1178 1179 if (receiver.is_null()) { 1180 THROW_(vmSymbols::java_lang_NullPointerException(), nullHandle); 1181 } 1182 } 1183 1184 assert(receiver.is_null() || receiver->is_oop(), "wrong receiver"); 1185 1186 // Resolve method 1187 if (attached_method.not_null()) { 1188 // Parameterized by attached method. 1189 LinkResolver::resolve_invoke(callinfo, receiver, attached_method, bc, CHECK_NH); 1190 } else { 1191 // Parameterized by bytecode. 1192 constantPoolHandle constants(THREAD, caller->constants()); 1193 LinkResolver::resolve_invoke(callinfo, receiver, constants, bytecode_index, bc, CHECK_NH); 1194 } 1195 1196 #ifdef ASSERT 1197 // Check that the receiver klass is of the right subtype and that it is initialized for virtual calls 1198 if (has_receiver) { 1199 assert(receiver.not_null(), "should have thrown exception"); 1200 KlassHandle receiver_klass(THREAD, receiver->klass()); 1201 Klass* rk = NULL; 1202 if (attached_method.not_null()) { 1203 // In case there's resolved method attached, use its holder during the check. 1204 rk = attached_method->method_holder(); 1205 } else { 1206 // Klass is already loaded. 1207 constantPoolHandle constants(THREAD, caller->constants()); 1208 rk = constants->klass_ref_at(bytecode_index, CHECK_NH); 1209 } 1210 KlassHandle static_receiver_klass(THREAD, rk); 1211 methodHandle callee = callinfo.selected_method(); 1212 assert(receiver_klass->is_subtype_of(static_receiver_klass()), 1213 "actual receiver must be subclass of static receiver klass"); 1214 if (receiver_klass->is_instance_klass()) { 1215 if (InstanceKlass::cast(receiver_klass())->is_not_initialized()) { 1216 tty->print_cr("ERROR: Klass not yet initialized!!"); 1217 receiver_klass()->print(); 1218 } 1219 assert(!InstanceKlass::cast(receiver_klass())->is_not_initialized(), "receiver_klass must be initialized"); 1220 } 1221 } 1222 #endif 1223 1224 return receiver; 1225 } 1226 1227 methodHandle SharedRuntime::find_callee_method(JavaThread* thread, TRAPS) { 1228 ResourceMark rm(THREAD); 1229 // We need first to check if any Java activations (compiled, interpreted) 1230 // exist on the stack since last JavaCall. If not, we need 1231 // to get the target method from the JavaCall wrapper. 1232 vframeStream vfst(thread, true); // Do not skip any javaCalls 1233 methodHandle callee_method; 1234 if (vfst.at_end()) { 1235 // No Java frames were found on stack since we did the JavaCall. 1236 // Hence the stack can only contain an entry_frame. We need to 1237 // find the target method from the stub frame. 1238 RegisterMap reg_map(thread, false); 1239 frame fr = thread->last_frame(); 1240 assert(fr.is_runtime_frame(), "must be a runtimeStub"); 1241 fr = fr.sender(®_map); 1242 assert(fr.is_entry_frame(), "must be"); 1243 // fr is now pointing to the entry frame. 1244 callee_method = methodHandle(THREAD, fr.entry_frame_call_wrapper()->callee_method()); 1245 assert(fr.entry_frame_call_wrapper()->receiver() == NULL || !callee_method->is_static(), "non-null receiver for static call??"); 1246 } else { 1247 Bytecodes::Code bc; 1248 CallInfo callinfo; 1249 find_callee_info_helper(thread, vfst, bc, callinfo, CHECK_(methodHandle())); 1250 callee_method = callinfo.selected_method(); 1251 } 1252 assert(callee_method()->is_method(), "must be"); 1253 return callee_method; 1254 } 1255 1256 // Resolves a call. 1257 methodHandle SharedRuntime::resolve_helper(JavaThread *thread, 1258 bool is_virtual, 1259 bool is_optimized, TRAPS) { 1260 methodHandle callee_method; 1261 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD); 1262 if (JvmtiExport::can_hotswap_or_post_breakpoint()) { 1263 int retry_count = 0; 1264 while (!HAS_PENDING_EXCEPTION && callee_method->is_old() && 1265 callee_method->method_holder() != SystemDictionary::Object_klass()) { 1266 // If has a pending exception then there is no need to re-try to 1267 // resolve this method. 1268 // If the method has been redefined, we need to try again. 1269 // Hack: we have no way to update the vtables of arrays, so don't 1270 // require that java.lang.Object has been updated. 1271 1272 // It is very unlikely that method is redefined more than 100 times 1273 // in the middle of resolve. If it is looping here more than 100 times 1274 // means then there could be a bug here. 1275 guarantee((retry_count++ < 100), 1276 "Could not resolve to latest version of redefined method"); 1277 // method is redefined in the middle of resolve so re-try. 1278 callee_method = resolve_sub_helper(thread, is_virtual, is_optimized, THREAD); 1279 } 1280 } 1281 return callee_method; 1282 } 1283 1284 // Resolves a call. The compilers generate code for calls that go here 1285 // and are patched with the real destination of the call. 1286 methodHandle SharedRuntime::resolve_sub_helper(JavaThread *thread, 1287 bool is_virtual, 1288 bool is_optimized, TRAPS) { 1289 1290 ResourceMark rm(thread); 1291 RegisterMap cbl_map(thread, false); 1292 frame caller_frame = thread->last_frame().sender(&cbl_map); 1293 1294 CodeBlob* caller_cb = caller_frame.cb(); 1295 guarantee(caller_cb != NULL && caller_cb->is_nmethod(), "must be called from nmethod"); 1296 nmethod* caller_nm = caller_cb->as_nmethod_or_null(); 1297 1298 // make sure caller is not getting deoptimized 1299 // and removed before we are done with it. 1300 // CLEANUP - with lazy deopt shouldn't need this lock 1301 nmethodLocker caller_lock(caller_nm); 1302 1303 // determine call info & receiver 1304 // note: a) receiver is NULL for static calls 1305 // b) an exception is thrown if receiver is NULL for non-static calls 1306 CallInfo call_info; 1307 Bytecodes::Code invoke_code = Bytecodes::_illegal; 1308 Handle receiver = find_callee_info(thread, invoke_code, 1309 call_info, CHECK_(methodHandle())); 1310 methodHandle callee_method = call_info.selected_method(); 1311 1312 assert((!is_virtual && invoke_code == Bytecodes::_invokestatic ) || 1313 (!is_virtual && invoke_code == Bytecodes::_invokespecial) || 1314 (!is_virtual && invoke_code == Bytecodes::_invokehandle ) || 1315 (!is_virtual && invoke_code == Bytecodes::_invokedynamic) || 1316 ( is_virtual && invoke_code != Bytecodes::_invokestatic ), "inconsistent bytecode"); 1317 1318 assert(caller_nm->is_alive(), "It should be alive"); 1319 1320 #ifndef PRODUCT 1321 // tracing/debugging/statistics 1322 int *addr = (is_optimized) ? (&_resolve_opt_virtual_ctr) : 1323 (is_virtual) ? (&_resolve_virtual_ctr) : 1324 (&_resolve_static_ctr); 1325 Atomic::inc(addr); 1326 1327 if (TraceCallFixup) { 1328 ResourceMark rm(thread); 1329 tty->print("resolving %s%s (%s) call to", 1330 (is_optimized) ? "optimized " : "", (is_virtual) ? "virtual" : "static", 1331 Bytecodes::name(invoke_code)); 1332 callee_method->print_short_name(tty); 1333 tty->print_cr(" at pc: " INTPTR_FORMAT " to code: " INTPTR_FORMAT, 1334 p2i(caller_frame.pc()), p2i(callee_method->code())); 1335 } 1336 #endif 1337 1338 // JSR 292 key invariant: 1339 // If the resolved method is a MethodHandle invoke target, the call 1340 // site must be a MethodHandle call site, because the lambda form might tail-call 1341 // leaving the stack in a state unknown to either caller or callee 1342 // TODO detune for now but we might need it again 1343 // assert(!callee_method->is_compiled_lambda_form() || 1344 // caller_nm->is_method_handle_return(caller_frame.pc()), "must be MH call site"); 1345 1346 // Compute entry points. This might require generation of C2I converter 1347 // frames, so we cannot be holding any locks here. Furthermore, the 1348 // computation of the entry points is independent of patching the call. We 1349 // always return the entry-point, but we only patch the stub if the call has 1350 // not been deoptimized. Return values: For a virtual call this is an 1351 // (cached_oop, destination address) pair. For a static call/optimized 1352 // virtual this is just a destination address. 1353 1354 StaticCallInfo static_call_info; 1355 CompiledICInfo virtual_call_info; 1356 1357 // Make sure the callee nmethod does not get deoptimized and removed before 1358 // we are done patching the code. 1359 nmethod* callee_nm = callee_method->code(); 1360 if (callee_nm != NULL && !callee_nm->is_in_use()) { 1361 // Patch call site to C2I adapter if callee nmethod is deoptimized or unloaded. 1362 callee_nm = NULL; 1363 } 1364 nmethodLocker nl_callee(callee_nm); 1365 #ifdef ASSERT 1366 address dest_entry_point = callee_nm == NULL ? 0 : callee_nm->entry_point(); // used below 1367 #endif 1368 1369 if (is_virtual) { 1370 assert(receiver.not_null() || invoke_code == Bytecodes::_invokehandle, "sanity check"); 1371 bool static_bound = call_info.resolved_method()->can_be_statically_bound(); 1372 KlassHandle h_klass(THREAD, invoke_code == Bytecodes::_invokehandle ? NULL : receiver->klass()); 1373 CompiledIC::compute_monomorphic_entry(callee_method, h_klass, 1374 is_optimized, static_bound, virtual_call_info, 1375 CHECK_(methodHandle())); 1376 } else { 1377 // static call 1378 CompiledStaticCall::compute_entry(callee_method, static_call_info); 1379 } 1380 1381 // grab lock, check for deoptimization and potentially patch caller 1382 { 1383 MutexLocker ml_patch(CompiledIC_lock); 1384 1385 // Lock blocks for safepoint during which both nmethods can change state. 1386 1387 // Now that we are ready to patch if the Method* was redefined then 1388 // don't update call site and let the caller retry. 1389 // Don't update call site if callee nmethod was unloaded or deoptimized. 1390 // Don't update call site if callee nmethod was replaced by an other nmethod 1391 // which may happen when multiply alive nmethod (tiered compilation) 1392 // will be supported. 1393 if (!callee_method->is_old() && 1394 (callee_nm == NULL || callee_nm->is_in_use() && (callee_method->code() == callee_nm))) { 1395 #ifdef ASSERT 1396 // We must not try to patch to jump to an already unloaded method. 1397 if (dest_entry_point != 0) { 1398 CodeBlob* cb = CodeCache::find_blob(dest_entry_point); 1399 assert((cb != NULL) && cb->is_nmethod() && (((nmethod*)cb) == callee_nm), 1400 "should not call unloaded nmethod"); 1401 } 1402 #endif 1403 if (is_virtual) { 1404 CompiledIC* inline_cache = CompiledIC_before(caller_nm, caller_frame.pc()); 1405 if (inline_cache->is_clean()) { 1406 inline_cache->set_to_monomorphic(virtual_call_info); 1407 } 1408 } else { 1409 CompiledStaticCall* ssc = compiledStaticCall_before(caller_frame.pc()); 1410 if (ssc->is_clean()) ssc->set(static_call_info); 1411 } 1412 } 1413 1414 } // unlock CompiledIC_lock 1415 1416 return callee_method; 1417 } 1418 1419 1420 // Inline caches exist only in compiled code 1421 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_ic_miss(JavaThread* thread)) 1422 #ifdef ASSERT 1423 RegisterMap reg_map(thread, false); 1424 frame stub_frame = thread->last_frame(); 1425 assert(stub_frame.is_runtime_frame(), "sanity check"); 1426 frame caller_frame = stub_frame.sender(®_map); 1427 assert(!caller_frame.is_interpreted_frame() && !caller_frame.is_entry_frame(), "unexpected frame"); 1428 #endif /* ASSERT */ 1429 1430 methodHandle callee_method; 1431 JRT_BLOCK 1432 callee_method = SharedRuntime::handle_ic_miss_helper(thread, CHECK_NULL); 1433 // Return Method* through TLS 1434 thread->set_vm_result_2(callee_method()); 1435 JRT_BLOCK_END 1436 // return compiled code entry point after potential safepoints 1437 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!"); 1438 return callee_method->verified_code_entry(); 1439 JRT_END 1440 1441 1442 // Handle call site that has been made non-entrant 1443 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method(JavaThread* thread)) 1444 // 6243940 We might end up in here if the callee is deoptimized 1445 // as we race to call it. We don't want to take a safepoint if 1446 // the caller was interpreted because the caller frame will look 1447 // interpreted to the stack walkers and arguments are now 1448 // "compiled" so it is much better to make this transition 1449 // invisible to the stack walking code. The i2c path will 1450 // place the callee method in the callee_target. It is stashed 1451 // there because if we try and find the callee by normal means a 1452 // safepoint is possible and have trouble gc'ing the compiled args. 1453 RegisterMap reg_map(thread, false); 1454 frame stub_frame = thread->last_frame(); 1455 assert(stub_frame.is_runtime_frame(), "sanity check"); 1456 frame caller_frame = stub_frame.sender(®_map); 1457 1458 if (caller_frame.is_interpreted_frame() || 1459 caller_frame.is_entry_frame()) { 1460 Method* callee = thread->callee_target(); 1461 guarantee(callee != NULL && callee->is_method(), "bad handshake"); 1462 thread->set_vm_result_2(callee); 1463 thread->set_callee_target(NULL); 1464 return callee->get_c2i_entry(); 1465 } 1466 1467 // Must be compiled to compiled path which is safe to stackwalk 1468 methodHandle callee_method; 1469 JRT_BLOCK 1470 // Force resolving of caller (if we called from compiled frame) 1471 callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_NULL); 1472 thread->set_vm_result_2(callee_method()); 1473 JRT_BLOCK_END 1474 // return compiled code entry point after potential safepoints 1475 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!"); 1476 return callee_method->verified_code_entry(); 1477 JRT_END 1478 1479 // Handle abstract method call 1480 JRT_BLOCK_ENTRY(address, SharedRuntime::handle_wrong_method_abstract(JavaThread* thread)) 1481 return StubRoutines::throw_AbstractMethodError_entry(); 1482 JRT_END 1483 1484 1485 // resolve a static call and patch code 1486 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_static_call_C(JavaThread *thread )) 1487 methodHandle callee_method; 1488 JRT_BLOCK 1489 callee_method = SharedRuntime::resolve_helper(thread, false, false, CHECK_NULL); 1490 thread->set_vm_result_2(callee_method()); 1491 JRT_BLOCK_END 1492 // return compiled code entry point after potential safepoints 1493 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!"); 1494 return callee_method->verified_code_entry(); 1495 JRT_END 1496 1497 1498 // resolve virtual call and update inline cache to monomorphic 1499 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_virtual_call_C(JavaThread *thread )) 1500 methodHandle callee_method; 1501 JRT_BLOCK 1502 callee_method = SharedRuntime::resolve_helper(thread, true, false, CHECK_NULL); 1503 thread->set_vm_result_2(callee_method()); 1504 JRT_BLOCK_END 1505 // return compiled code entry point after potential safepoints 1506 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!"); 1507 return callee_method->verified_code_entry(); 1508 JRT_END 1509 1510 1511 // Resolve a virtual call that can be statically bound (e.g., always 1512 // monomorphic, so it has no inline cache). Patch code to resolved target. 1513 JRT_BLOCK_ENTRY(address, SharedRuntime::resolve_opt_virtual_call_C(JavaThread *thread)) 1514 methodHandle callee_method; 1515 JRT_BLOCK 1516 callee_method = SharedRuntime::resolve_helper(thread, true, true, CHECK_NULL); 1517 thread->set_vm_result_2(callee_method()); 1518 JRT_BLOCK_END 1519 // return compiled code entry point after potential safepoints 1520 assert(callee_method->verified_code_entry() != NULL, " Jump to zero!"); 1521 return callee_method->verified_code_entry(); 1522 JRT_END 1523 1524 1525 methodHandle SharedRuntime::handle_ic_miss_helper(JavaThread *thread, TRAPS) { 1526 ResourceMark rm(thread); 1527 CallInfo call_info; 1528 Bytecodes::Code bc; 1529 1530 // receiver is NULL for static calls. An exception is thrown for NULL 1531 // receivers for non-static calls 1532 Handle receiver = find_callee_info(thread, bc, call_info, 1533 CHECK_(methodHandle())); 1534 // Compiler1 can produce virtual call sites that can actually be statically bound 1535 // If we fell thru to below we would think that the site was going megamorphic 1536 // when in fact the site can never miss. Worse because we'd think it was megamorphic 1537 // we'd try and do a vtable dispatch however methods that can be statically bound 1538 // don't have vtable entries (vtable_index < 0) and we'd blow up. So we force a 1539 // reresolution of the call site (as if we did a handle_wrong_method and not an 1540 // plain ic_miss) and the site will be converted to an optimized virtual call site 1541 // never to miss again. I don't believe C2 will produce code like this but if it 1542 // did this would still be the correct thing to do for it too, hence no ifdef. 1543 // 1544 if (call_info.resolved_method()->can_be_statically_bound()) { 1545 methodHandle callee_method = SharedRuntime::reresolve_call_site(thread, CHECK_(methodHandle())); 1546 if (TraceCallFixup) { 1547 RegisterMap reg_map(thread, false); 1548 frame caller_frame = thread->last_frame().sender(®_map); 1549 ResourceMark rm(thread); 1550 tty->print("converting IC miss to reresolve (%s) call to", Bytecodes::name(bc)); 1551 callee_method->print_short_name(tty); 1552 tty->print_cr(" from pc: " INTPTR_FORMAT, p2i(caller_frame.pc())); 1553 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code())); 1554 } 1555 return callee_method; 1556 } 1557 1558 methodHandle callee_method = call_info.selected_method(); 1559 1560 bool should_be_mono = false; 1561 1562 #ifndef PRODUCT 1563 Atomic::inc(&_ic_miss_ctr); 1564 1565 // Statistics & Tracing 1566 if (TraceCallFixup) { 1567 ResourceMark rm(thread); 1568 tty->print("IC miss (%s) call to", Bytecodes::name(bc)); 1569 callee_method->print_short_name(tty); 1570 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code())); 1571 } 1572 1573 if (ICMissHistogram) { 1574 MutexLocker m(VMStatistic_lock); 1575 RegisterMap reg_map(thread, false); 1576 frame f = thread->last_frame().real_sender(®_map);// skip runtime stub 1577 // produce statistics under the lock 1578 trace_ic_miss(f.pc()); 1579 } 1580 #endif 1581 1582 // install an event collector so that when a vtable stub is created the 1583 // profiler can be notified via a DYNAMIC_CODE_GENERATED event. The 1584 // event can't be posted when the stub is created as locks are held 1585 // - instead the event will be deferred until the event collector goes 1586 // out of scope. 1587 JvmtiDynamicCodeEventCollector event_collector; 1588 1589 // Update inline cache to megamorphic. Skip update if we are called from interpreted. 1590 { MutexLocker ml_patch (CompiledIC_lock); 1591 RegisterMap reg_map(thread, false); 1592 frame caller_frame = thread->last_frame().sender(®_map); 1593 CodeBlob* cb = caller_frame.cb(); 1594 if (cb->is_nmethod()) { 1595 CompiledIC* inline_cache = CompiledIC_before(((nmethod*)cb), caller_frame.pc()); 1596 bool should_be_mono = false; 1597 if (inline_cache->is_optimized()) { 1598 if (TraceCallFixup) { 1599 ResourceMark rm(thread); 1600 tty->print("OPTIMIZED IC miss (%s) call to", Bytecodes::name(bc)); 1601 callee_method->print_short_name(tty); 1602 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code())); 1603 } 1604 should_be_mono = true; 1605 } else if (inline_cache->is_icholder_call()) { 1606 CompiledICHolder* ic_oop = inline_cache->cached_icholder(); 1607 if (ic_oop != NULL) { 1608 1609 if (receiver()->klass() == ic_oop->holder_klass()) { 1610 // This isn't a real miss. We must have seen that compiled code 1611 // is now available and we want the call site converted to a 1612 // monomorphic compiled call site. 1613 // We can't assert for callee_method->code() != NULL because it 1614 // could have been deoptimized in the meantime 1615 if (TraceCallFixup) { 1616 ResourceMark rm(thread); 1617 tty->print("FALSE IC miss (%s) converting to compiled call to", Bytecodes::name(bc)); 1618 callee_method->print_short_name(tty); 1619 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code())); 1620 } 1621 should_be_mono = true; 1622 } 1623 } 1624 } 1625 1626 if (should_be_mono) { 1627 1628 // We have a path that was monomorphic but was going interpreted 1629 // and now we have (or had) a compiled entry. We correct the IC 1630 // by using a new icBuffer. 1631 CompiledICInfo info; 1632 KlassHandle receiver_klass(THREAD, receiver()->klass()); 1633 inline_cache->compute_monomorphic_entry(callee_method, 1634 receiver_klass, 1635 inline_cache->is_optimized(), 1636 false, 1637 info, CHECK_(methodHandle())); 1638 inline_cache->set_to_monomorphic(info); 1639 } else if (!inline_cache->is_megamorphic() && !inline_cache->is_clean()) { 1640 // Potential change to megamorphic 1641 bool successful = inline_cache->set_to_megamorphic(&call_info, bc, CHECK_(methodHandle())); 1642 if (!successful) { 1643 inline_cache->set_to_clean(); 1644 } 1645 } else { 1646 // Either clean or megamorphic 1647 } 1648 } else { 1649 fatal("Unimplemented"); 1650 } 1651 } // Release CompiledIC_lock 1652 1653 return callee_method; 1654 } 1655 1656 // 1657 // Resets a call-site in compiled code so it will get resolved again. 1658 // This routines handles both virtual call sites, optimized virtual call 1659 // sites, and static call sites. Typically used to change a call sites 1660 // destination from compiled to interpreted. 1661 // 1662 methodHandle SharedRuntime::reresolve_call_site(JavaThread *thread, TRAPS) { 1663 ResourceMark rm(thread); 1664 RegisterMap reg_map(thread, false); 1665 frame stub_frame = thread->last_frame(); 1666 assert(stub_frame.is_runtime_frame(), "must be a runtimeStub"); 1667 frame caller = stub_frame.sender(®_map); 1668 1669 // Do nothing if the frame isn't a live compiled frame. 1670 // nmethod could be deoptimized by the time we get here 1671 // so no update to the caller is needed. 1672 1673 if (caller.is_compiled_frame() && !caller.is_deoptimized_frame()) { 1674 1675 address pc = caller.pc(); 1676 1677 // Check for static or virtual call 1678 bool is_static_call = false; 1679 nmethod* caller_nm = CodeCache::find_nmethod(pc); 1680 1681 // Default call_addr is the location of the "basic" call. 1682 // Determine the address of the call we a reresolving. With 1683 // Inline Caches we will always find a recognizable call. 1684 // With Inline Caches disabled we may or may not find a 1685 // recognizable call. We will always find a call for static 1686 // calls and for optimized virtual calls. For vanilla virtual 1687 // calls it depends on the state of the UseInlineCaches switch. 1688 // 1689 // With Inline Caches disabled we can get here for a virtual call 1690 // for two reasons: 1691 // 1 - calling an abstract method. The vtable for abstract methods 1692 // will run us thru handle_wrong_method and we will eventually 1693 // end up in the interpreter to throw the ame. 1694 // 2 - a racing deoptimization. We could be doing a vanilla vtable 1695 // call and between the time we fetch the entry address and 1696 // we jump to it the target gets deoptimized. Similar to 1 1697 // we will wind up in the interprter (thru a c2i with c2). 1698 // 1699 address call_addr = NULL; 1700 { 1701 // Get call instruction under lock because another thread may be 1702 // busy patching it. 1703 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag); 1704 // Location of call instruction 1705 if (NativeCall::is_call_before(pc)) { 1706 NativeCall *ncall = nativeCall_before(pc); 1707 call_addr = ncall->instruction_address(); 1708 } 1709 } 1710 // Make sure nmethod doesn't get deoptimized and removed until 1711 // this is done with it. 1712 // CLEANUP - with lazy deopt shouldn't need this lock 1713 nmethodLocker nmlock(caller_nm); 1714 1715 if (call_addr != NULL) { 1716 RelocIterator iter(caller_nm, call_addr, call_addr+1); 1717 int ret = iter.next(); // Get item 1718 if (ret) { 1719 assert(iter.addr() == call_addr, "must find call"); 1720 if (iter.type() == relocInfo::static_call_type) { 1721 is_static_call = true; 1722 } else { 1723 assert(iter.type() == relocInfo::virtual_call_type || 1724 iter.type() == relocInfo::opt_virtual_call_type 1725 , "unexpected relocInfo. type"); 1726 } 1727 } else { 1728 assert(!UseInlineCaches, "relocation info. must exist for this address"); 1729 } 1730 1731 // Cleaning the inline cache will force a new resolve. This is more robust 1732 // than directly setting it to the new destination, since resolving of calls 1733 // is always done through the same code path. (experience shows that it 1734 // leads to very hard to track down bugs, if an inline cache gets updated 1735 // to a wrong method). It should not be performance critical, since the 1736 // resolve is only done once. 1737 1738 MutexLocker ml(CompiledIC_lock); 1739 if (is_static_call) { 1740 CompiledStaticCall* ssc= compiledStaticCall_at(call_addr); 1741 ssc->set_to_clean(); 1742 } else { 1743 // compiled, dispatched call (which used to call an interpreted method) 1744 CompiledIC* inline_cache = CompiledIC_at(caller_nm, call_addr); 1745 inline_cache->set_to_clean(); 1746 } 1747 } 1748 } 1749 1750 methodHandle callee_method = find_callee_method(thread, CHECK_(methodHandle())); 1751 1752 1753 #ifndef PRODUCT 1754 Atomic::inc(&_wrong_method_ctr); 1755 1756 if (TraceCallFixup) { 1757 ResourceMark rm(thread); 1758 tty->print("handle_wrong_method reresolving call to"); 1759 callee_method->print_short_name(tty); 1760 tty->print_cr(" code: " INTPTR_FORMAT, p2i(callee_method->code())); 1761 } 1762 #endif 1763 1764 return callee_method; 1765 } 1766 1767 #ifdef ASSERT 1768 void SharedRuntime::check_member_name_argument_is_last_argument(const methodHandle& method, 1769 const BasicType* sig_bt, 1770 const VMRegPair* regs) { 1771 ResourceMark rm; 1772 const int total_args_passed = method->size_of_parameters(); 1773 const VMRegPair* regs_with_member_name = regs; 1774 VMRegPair* regs_without_member_name = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed - 1); 1775 1776 const int member_arg_pos = total_args_passed - 1; 1777 assert(member_arg_pos >= 0 && member_arg_pos < total_args_passed, "oob"); 1778 assert(sig_bt[member_arg_pos] == T_OBJECT, "dispatch argument must be an object"); 1779 1780 const bool is_outgoing = method->is_method_handle_intrinsic(); 1781 int comp_args_on_stack = java_calling_convention(sig_bt, regs_without_member_name, total_args_passed - 1, is_outgoing); 1782 1783 for (int i = 0; i < member_arg_pos; i++) { 1784 VMReg a = regs_with_member_name[i].first(); 1785 VMReg b = regs_without_member_name[i].first(); 1786 assert(a->value() == b->value(), "register allocation mismatch: a=" INTX_FORMAT ", b=" INTX_FORMAT, a->value(), b->value()); 1787 } 1788 assert(regs_with_member_name[member_arg_pos].first()->is_valid(), "bad member arg"); 1789 } 1790 #endif 1791 1792 // --------------------------------------------------------------------------- 1793 // We are calling the interpreter via a c2i. Normally this would mean that 1794 // we were called by a compiled method. However we could have lost a race 1795 // where we went int -> i2c -> c2i and so the caller could in fact be 1796 // interpreted. If the caller is compiled we attempt to patch the caller 1797 // so he no longer calls into the interpreter. 1798 IRT_LEAF(void, SharedRuntime::fixup_callers_callsite(Method* method, address caller_pc)) 1799 Method* moop(method); 1800 1801 address entry_point = moop->from_compiled_entry(); 1802 1803 // It's possible that deoptimization can occur at a call site which hasn't 1804 // been resolved yet, in which case this function will be called from 1805 // an nmethod that has been patched for deopt and we can ignore the 1806 // request for a fixup. 1807 // Also it is possible that we lost a race in that from_compiled_entry 1808 // is now back to the i2c in that case we don't need to patch and if 1809 // we did we'd leap into space because the callsite needs to use 1810 // "to interpreter" stub in order to load up the Method*. Don't 1811 // ask me how I know this... 1812 1813 CodeBlob* cb = CodeCache::find_blob(caller_pc); 1814 if (!cb->is_nmethod() || entry_point == moop->get_c2i_entry()) { 1815 return; 1816 } 1817 1818 // The check above makes sure this is a nmethod. 1819 nmethod* nm = cb->as_nmethod_or_null(); 1820 assert(nm, "must be"); 1821 1822 // Get the return PC for the passed caller PC. 1823 address return_pc = caller_pc + frame::pc_return_offset; 1824 1825 // There is a benign race here. We could be attempting to patch to a compiled 1826 // entry point at the same time the callee is being deoptimized. If that is 1827 // the case then entry_point may in fact point to a c2i and we'd patch the 1828 // call site with the same old data. clear_code will set code() to NULL 1829 // at the end of it. If we happen to see that NULL then we can skip trying 1830 // to patch. If we hit the window where the callee has a c2i in the 1831 // from_compiled_entry and the NULL isn't present yet then we lose the race 1832 // and patch the code with the same old data. Asi es la vida. 1833 1834 if (moop->code() == NULL) return; 1835 1836 if (nm->is_in_use()) { 1837 1838 // Expect to find a native call there (unless it was no-inline cache vtable dispatch) 1839 MutexLockerEx ml_patch(Patching_lock, Mutex::_no_safepoint_check_flag); 1840 if (NativeCall::is_call_before(return_pc)) { 1841 NativeCall *call = nativeCall_before(return_pc); 1842 // 1843 // bug 6281185. We might get here after resolving a call site to a vanilla 1844 // virtual call. Because the resolvee uses the verified entry it may then 1845 // see compiled code and attempt to patch the site by calling us. This would 1846 // then incorrectly convert the call site to optimized and its downhill from 1847 // there. If you're lucky you'll get the assert in the bugid, if not you've 1848 // just made a call site that could be megamorphic into a monomorphic site 1849 // for the rest of its life! Just another racing bug in the life of 1850 // fixup_callers_callsite ... 1851 // 1852 RelocIterator iter(nm, call->instruction_address(), call->next_instruction_address()); 1853 iter.next(); 1854 assert(iter.has_current(), "must have a reloc at java call site"); 1855 relocInfo::relocType typ = iter.reloc()->type(); 1856 if (typ != relocInfo::static_call_type && 1857 typ != relocInfo::opt_virtual_call_type && 1858 typ != relocInfo::static_stub_type) { 1859 return; 1860 } 1861 address destination = call->destination(); 1862 if (destination != entry_point) { 1863 CodeBlob* callee = CodeCache::find_blob(destination); 1864 // callee == cb seems weird. It means calling interpreter thru stub. 1865 if (callee == cb || callee->is_adapter_blob()) { 1866 // static call or optimized virtual 1867 if (TraceCallFixup) { 1868 tty->print("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 call->set_destination_mt_safe(entry_point); 1873 } else { 1874 if (TraceCallFixup) { 1875 tty->print("failed to fixup callsite at " INTPTR_FORMAT " to compiled code for", p2i(caller_pc)); 1876 moop->print_short_name(tty); 1877 tty->print_cr(" to " INTPTR_FORMAT, p2i(entry_point)); 1878 } 1879 // assert is too strong could also be resolve destinations. 1880 // assert(InlineCacheBuffer::contains(destination) || VtableStubs::contains(destination), "must be"); 1881 } 1882 } else { 1883 if (TraceCallFixup) { 1884 tty->print("already patched callsite at " INTPTR_FORMAT " to compiled code for", p2i(caller_pc)); 1885 moop->print_short_name(tty); 1886 tty->print_cr(" to " INTPTR_FORMAT, p2i(entry_point)); 1887 } 1888 } 1889 } 1890 } 1891 IRT_END 1892 1893 1894 // same as JVM_Arraycopy, but called directly from compiled code 1895 JRT_ENTRY(void, SharedRuntime::slow_arraycopy_C(oopDesc* src, jint src_pos, 1896 oopDesc* dest, jint dest_pos, 1897 jint length, 1898 JavaThread* thread)) { 1899 #ifndef PRODUCT 1900 _slow_array_copy_ctr++; 1901 #endif 1902 // Check if we have null pointers 1903 if (src == NULL || dest == NULL) { 1904 THROW(vmSymbols::java_lang_NullPointerException()); 1905 } 1906 // Do the copy. The casts to arrayOop are necessary to the copy_array API, 1907 // even though the copy_array API also performs dynamic checks to ensure 1908 // that src and dest are truly arrays (and are conformable). 1909 // The copy_array mechanism is awkward and could be removed, but 1910 // the compilers don't call this function except as a last resort, 1911 // so it probably doesn't matter. 1912 src->klass()->copy_array((arrayOopDesc*)src, src_pos, 1913 (arrayOopDesc*)dest, dest_pos, 1914 length, thread); 1915 } 1916 JRT_END 1917 1918 char* SharedRuntime::generate_class_cast_message( 1919 JavaThread* thread, const char* objName) { 1920 1921 // Get target class name from the checkcast instruction 1922 vframeStream vfst(thread, true); 1923 assert(!vfst.at_end(), "Java frame must exist"); 1924 Bytecode_checkcast cc(vfst.method(), vfst.method()->bcp_from(vfst.bci())); 1925 Klass* targetKlass = vfst.method()->constants()->klass_at( 1926 cc.index(), thread); 1927 return generate_class_cast_message(objName, targetKlass->external_name()); 1928 } 1929 1930 char* SharedRuntime::generate_class_cast_message( 1931 const char* objName, const char* targetKlassName, const char* desc) { 1932 size_t msglen = strlen(objName) + strlen(desc) + strlen(targetKlassName) + 1; 1933 1934 char* message = NEW_RESOURCE_ARRAY(char, msglen); 1935 if (NULL == message) { 1936 // Shouldn't happen, but don't cause even more problems if it does 1937 message = const_cast<char*>(objName); 1938 } else { 1939 jio_snprintf(message, msglen, "%s%s%s", objName, desc, targetKlassName); 1940 } 1941 return message; 1942 } 1943 1944 JRT_LEAF(void, SharedRuntime::reguard_yellow_pages()) 1945 (void) JavaThread::current()->reguard_stack(); 1946 JRT_END 1947 1948 1949 // Handles the uncommon case in locking, i.e., contention or an inflated lock. 1950 JRT_BLOCK_ENTRY(void, SharedRuntime::complete_monitor_locking_C(oopDesc* _obj, BasicLock* lock, JavaThread* thread)) 1951 // Disable ObjectSynchronizer::quick_enter() in default config 1952 // until JDK-8077392 is resolved. 1953 if ((SyncFlags & 256) != 0 && !SafepointSynchronize::is_synchronizing()) { 1954 // Only try quick_enter() if we're not trying to reach a safepoint 1955 // so that the calling thread reaches the safepoint more quickly. 1956 if (ObjectSynchronizer::quick_enter(_obj, thread, lock)) return; 1957 } 1958 // NO_ASYNC required because an async exception on the state transition destructor 1959 // would leave you with the lock held and it would never be released. 1960 // The normal monitorenter NullPointerException is thrown without acquiring a lock 1961 // and the model is that an exception implies the method failed. 1962 JRT_BLOCK_NO_ASYNC 1963 oop obj(_obj); 1964 if (PrintBiasedLockingStatistics) { 1965 Atomic::inc(BiasedLocking::slow_path_entry_count_addr()); 1966 } 1967 Handle h_obj(THREAD, obj); 1968 if (UseBiasedLocking) { 1969 // Retry fast entry if bias is revoked to avoid unnecessary inflation 1970 ObjectSynchronizer::fast_enter(h_obj, lock, true, CHECK); 1971 } else { 1972 ObjectSynchronizer::slow_enter(h_obj, lock, CHECK); 1973 } 1974 assert(!HAS_PENDING_EXCEPTION, "Should have no exception here"); 1975 JRT_BLOCK_END 1976 JRT_END 1977 1978 // Handles the uncommon cases of monitor unlocking in compiled code 1979 JRT_LEAF(void, SharedRuntime::complete_monitor_unlocking_C(oopDesc* _obj, BasicLock* lock, JavaThread * THREAD)) 1980 oop obj(_obj); 1981 assert(JavaThread::current() == THREAD, "invariant"); 1982 // I'm not convinced we need the code contained by MIGHT_HAVE_PENDING anymore 1983 // testing was unable to ever fire the assert that guarded it so I have removed it. 1984 assert(!HAS_PENDING_EXCEPTION, "Do we need code below anymore?"); 1985 #undef MIGHT_HAVE_PENDING 1986 #ifdef MIGHT_HAVE_PENDING 1987 // Save and restore any pending_exception around the exception mark. 1988 // While the slow_exit must not throw an exception, we could come into 1989 // this routine with one set. 1990 oop pending_excep = NULL; 1991 const char* pending_file; 1992 int pending_line; 1993 if (HAS_PENDING_EXCEPTION) { 1994 pending_excep = PENDING_EXCEPTION; 1995 pending_file = THREAD->exception_file(); 1996 pending_line = THREAD->exception_line(); 1997 CLEAR_PENDING_EXCEPTION; 1998 } 1999 #endif /* MIGHT_HAVE_PENDING */ 2000 2001 { 2002 // Exit must be non-blocking, and therefore no exceptions can be thrown. 2003 EXCEPTION_MARK; 2004 ObjectSynchronizer::slow_exit(obj, lock, THREAD); 2005 } 2006 2007 #ifdef MIGHT_HAVE_PENDING 2008 if (pending_excep != NULL) { 2009 THREAD->set_pending_exception(pending_excep, pending_file, pending_line); 2010 } 2011 #endif /* MIGHT_HAVE_PENDING */ 2012 JRT_END 2013 2014 #ifndef PRODUCT 2015 2016 void SharedRuntime::print_statistics() { 2017 ttyLocker ttyl; 2018 if (xtty != NULL) xtty->head("statistics type='SharedRuntime'"); 2019 2020 if (_throw_null_ctr) tty->print_cr("%5d implicit null throw", _throw_null_ctr); 2021 2022 SharedRuntime::print_ic_miss_histogram(); 2023 2024 if (CountRemovableExceptions) { 2025 if (_nof_removable_exceptions > 0) { 2026 Unimplemented(); // this counter is not yet incremented 2027 tty->print_cr("Removable exceptions: %d", _nof_removable_exceptions); 2028 } 2029 } 2030 2031 // Dump the JRT_ENTRY counters 2032 if (_new_instance_ctr) tty->print_cr("%5d new instance requires GC", _new_instance_ctr); 2033 if (_new_array_ctr) tty->print_cr("%5d new array requires GC", _new_array_ctr); 2034 if (_multi1_ctr) tty->print_cr("%5d multianewarray 1 dim", _multi1_ctr); 2035 if (_multi2_ctr) tty->print_cr("%5d multianewarray 2 dim", _multi2_ctr); 2036 if (_multi3_ctr) tty->print_cr("%5d multianewarray 3 dim", _multi3_ctr); 2037 if (_multi4_ctr) tty->print_cr("%5d multianewarray 4 dim", _multi4_ctr); 2038 if (_multi5_ctr) tty->print_cr("%5d multianewarray 5 dim", _multi5_ctr); 2039 2040 tty->print_cr("%5d inline cache miss in compiled", _ic_miss_ctr); 2041 tty->print_cr("%5d wrong method", _wrong_method_ctr); 2042 tty->print_cr("%5d unresolved static call site", _resolve_static_ctr); 2043 tty->print_cr("%5d unresolved virtual call site", _resolve_virtual_ctr); 2044 tty->print_cr("%5d unresolved opt virtual call site", _resolve_opt_virtual_ctr); 2045 2046 if (_mon_enter_stub_ctr) tty->print_cr("%5d monitor enter stub", _mon_enter_stub_ctr); 2047 if (_mon_exit_stub_ctr) tty->print_cr("%5d monitor exit stub", _mon_exit_stub_ctr); 2048 if (_mon_enter_ctr) tty->print_cr("%5d monitor enter slow", _mon_enter_ctr); 2049 if (_mon_exit_ctr) tty->print_cr("%5d monitor exit slow", _mon_exit_ctr); 2050 if (_partial_subtype_ctr) tty->print_cr("%5d slow partial subtype", _partial_subtype_ctr); 2051 if (_jbyte_array_copy_ctr) tty->print_cr("%5d byte array copies", _jbyte_array_copy_ctr); 2052 if (_jshort_array_copy_ctr) tty->print_cr("%5d short array copies", _jshort_array_copy_ctr); 2053 if (_jint_array_copy_ctr) tty->print_cr("%5d int array copies", _jint_array_copy_ctr); 2054 if (_jlong_array_copy_ctr) tty->print_cr("%5d long array copies", _jlong_array_copy_ctr); 2055 if (_oop_array_copy_ctr) tty->print_cr("%5d oop array copies", _oop_array_copy_ctr); 2056 if (_checkcast_array_copy_ctr) tty->print_cr("%5d checkcast array copies", _checkcast_array_copy_ctr); 2057 if (_unsafe_array_copy_ctr) tty->print_cr("%5d unsafe array copies", _unsafe_array_copy_ctr); 2058 if (_generic_array_copy_ctr) tty->print_cr("%5d generic array copies", _generic_array_copy_ctr); 2059 if (_slow_array_copy_ctr) tty->print_cr("%5d slow array copies", _slow_array_copy_ctr); 2060 if (_find_handler_ctr) tty->print_cr("%5d find exception handler", _find_handler_ctr); 2061 if (_rethrow_ctr) tty->print_cr("%5d rethrow handler", _rethrow_ctr); 2062 2063 AdapterHandlerLibrary::print_statistics(); 2064 2065 if (xtty != NULL) xtty->tail("statistics"); 2066 } 2067 2068 inline double percent(int x, int y) { 2069 return 100.0 * x / MAX2(y, 1); 2070 } 2071 2072 class MethodArityHistogram { 2073 public: 2074 enum { MAX_ARITY = 256 }; 2075 private: 2076 static int _arity_histogram[MAX_ARITY]; // histogram of #args 2077 static int _size_histogram[MAX_ARITY]; // histogram of arg size in words 2078 static int _max_arity; // max. arity seen 2079 static int _max_size; // max. arg size seen 2080 2081 static void add_method_to_histogram(nmethod* nm) { 2082 Method* m = nm->method(); 2083 ArgumentCount args(m->signature()); 2084 int arity = args.size() + (m->is_static() ? 0 : 1); 2085 int argsize = m->size_of_parameters(); 2086 arity = MIN2(arity, MAX_ARITY-1); 2087 argsize = MIN2(argsize, MAX_ARITY-1); 2088 int count = nm->method()->compiled_invocation_count(); 2089 _arity_histogram[arity] += count; 2090 _size_histogram[argsize] += count; 2091 _max_arity = MAX2(_max_arity, arity); 2092 _max_size = MAX2(_max_size, argsize); 2093 } 2094 2095 void print_histogram_helper(int n, int* histo, const char* name) { 2096 const int N = MIN2(5, n); 2097 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):"); 2098 double sum = 0; 2099 double weighted_sum = 0; 2100 int i; 2101 for (i = 0; i <= n; i++) { sum += histo[i]; weighted_sum += i*histo[i]; } 2102 double rest = sum; 2103 double percent = sum / 100; 2104 for (i = 0; i <= N; i++) { 2105 rest -= histo[i]; 2106 tty->print_cr("%4d: %7d (%5.1f%%)", i, histo[i], histo[i] / percent); 2107 } 2108 tty->print_cr("rest: %7d (%5.1f%%))", (int)rest, rest / percent); 2109 tty->print_cr("(avg. %s = %3.1f, max = %d)", name, weighted_sum / sum, n); 2110 } 2111 2112 void print_histogram() { 2113 tty->print_cr("\nHistogram of call arity (incl. rcvr, calls to compiled methods only):"); 2114 print_histogram_helper(_max_arity, _arity_histogram, "arity"); 2115 tty->print_cr("\nSame for parameter size (in words):"); 2116 print_histogram_helper(_max_size, _size_histogram, "size"); 2117 tty->cr(); 2118 } 2119 2120 public: 2121 MethodArityHistogram() { 2122 MutexLockerEx mu(CodeCache_lock, Mutex::_no_safepoint_check_flag); 2123 _max_arity = _max_size = 0; 2124 for (int i = 0; i < MAX_ARITY; i++) _arity_histogram[i] = _size_histogram[i] = 0; 2125 CodeCache::nmethods_do(add_method_to_histogram); 2126 print_histogram(); 2127 } 2128 }; 2129 2130 int MethodArityHistogram::_arity_histogram[MethodArityHistogram::MAX_ARITY]; 2131 int MethodArityHistogram::_size_histogram[MethodArityHistogram::MAX_ARITY]; 2132 int MethodArityHistogram::_max_arity; 2133 int MethodArityHistogram::_max_size; 2134 2135 void SharedRuntime::print_call_statistics(int comp_total) { 2136 tty->print_cr("Calls from compiled code:"); 2137 int total = _nof_normal_calls + _nof_interface_calls + _nof_static_calls; 2138 int mono_c = _nof_normal_calls - _nof_optimized_calls - _nof_megamorphic_calls; 2139 int mono_i = _nof_interface_calls - _nof_optimized_interface_calls - _nof_megamorphic_interface_calls; 2140 tty->print_cr("\t%9d (%4.1f%%) total non-inlined ", total, percent(total, total)); 2141 tty->print_cr("\t%9d (%4.1f%%) virtual calls ", _nof_normal_calls, percent(_nof_normal_calls, total)); 2142 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_calls, percent(_nof_inlined_calls, _nof_normal_calls)); 2143 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_calls, percent(_nof_optimized_calls, _nof_normal_calls)); 2144 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_c, percent(mono_c, _nof_normal_calls)); 2145 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_calls, percent(_nof_megamorphic_calls, _nof_normal_calls)); 2146 tty->print_cr("\t%9d (%4.1f%%) interface calls ", _nof_interface_calls, percent(_nof_interface_calls, total)); 2147 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_interface_calls, percent(_nof_inlined_interface_calls, _nof_interface_calls)); 2148 tty->print_cr("\t %9d (%3.0f%%) optimized ", _nof_optimized_interface_calls, percent(_nof_optimized_interface_calls, _nof_interface_calls)); 2149 tty->print_cr("\t %9d (%3.0f%%) monomorphic ", mono_i, percent(mono_i, _nof_interface_calls)); 2150 tty->print_cr("\t %9d (%3.0f%%) megamorphic ", _nof_megamorphic_interface_calls, percent(_nof_megamorphic_interface_calls, _nof_interface_calls)); 2151 tty->print_cr("\t%9d (%4.1f%%) static/special calls", _nof_static_calls, percent(_nof_static_calls, total)); 2152 tty->print_cr("\t %9d (%3.0f%%) inlined ", _nof_inlined_static_calls, percent(_nof_inlined_static_calls, _nof_static_calls)); 2153 tty->cr(); 2154 tty->print_cr("Note 1: counter updates are not MT-safe."); 2155 tty->print_cr("Note 2: %% in major categories are relative to total non-inlined calls;"); 2156 tty->print_cr(" %% in nested categories are relative to their category"); 2157 tty->print_cr(" (and thus add up to more than 100%% with inlining)"); 2158 tty->cr(); 2159 2160 MethodArityHistogram h; 2161 } 2162 #endif 2163 2164 2165 // A simple wrapper class around the calling convention information 2166 // that allows sharing of adapters for the same calling convention. 2167 class AdapterFingerPrint : public CHeapObj<mtCode> { 2168 private: 2169 enum { 2170 _basic_type_bits = 4, 2171 _basic_type_mask = right_n_bits(_basic_type_bits), 2172 _basic_types_per_int = BitsPerInt / _basic_type_bits, 2173 _compact_int_count = 3 2174 }; 2175 // TO DO: Consider integrating this with a more global scheme for compressing signatures. 2176 // For now, 4 bits per components (plus T_VOID gaps after double/long) is not excessive. 2177 2178 union { 2179 int _compact[_compact_int_count]; 2180 int* _fingerprint; 2181 } _value; 2182 int _length; // A negative length indicates the fingerprint is in the compact form, 2183 // Otherwise _value._fingerprint is the array. 2184 2185 // Remap BasicTypes that are handled equivalently by the adapters. 2186 // These are correct for the current system but someday it might be 2187 // necessary to make this mapping platform dependent. 2188 static int adapter_encoding(BasicType in) { 2189 switch (in) { 2190 case T_BOOLEAN: 2191 case T_BYTE: 2192 case T_SHORT: 2193 case T_CHAR: 2194 // There are all promoted to T_INT in the calling convention 2195 return T_INT; 2196 2197 case T_OBJECT: 2198 case T_VALUETYPE: 2199 case T_ARRAY: 2200 // In other words, we assume that any register good enough for 2201 // an int or long is good enough for a managed pointer. 2202 #ifdef _LP64 2203 return T_LONG; 2204 #else 2205 return T_INT; 2206 #endif 2207 2208 case T_INT: 2209 case T_LONG: 2210 case T_FLOAT: 2211 case T_DOUBLE: 2212 case T_VOID: 2213 return in; 2214 2215 default: 2216 ShouldNotReachHere(); 2217 return T_CONFLICT; 2218 } 2219 } 2220 2221 public: 2222 AdapterFingerPrint(int total_args_passed, BasicType* sig_bt) { 2223 // The fingerprint is based on the BasicType signature encoded 2224 // into an array of ints with eight entries per int. 2225 int* ptr; 2226 int len = (total_args_passed + (_basic_types_per_int-1)) / _basic_types_per_int; 2227 if (len <= _compact_int_count) { 2228 assert(_compact_int_count == 3, "else change next line"); 2229 _value._compact[0] = _value._compact[1] = _value._compact[2] = 0; 2230 // Storing the signature encoded as signed chars hits about 98% 2231 // of the time. 2232 _length = -len; 2233 ptr = _value._compact; 2234 } else { 2235 _length = len; 2236 _value._fingerprint = NEW_C_HEAP_ARRAY(int, _length, mtCode); 2237 ptr = _value._fingerprint; 2238 } 2239 2240 // Now pack the BasicTypes with 8 per int 2241 int sig_index = 0; 2242 for (int index = 0; index < len; index++) { 2243 int value = 0; 2244 for (int byte = 0; byte < _basic_types_per_int; byte++) { 2245 int bt = ((sig_index < total_args_passed) 2246 ? adapter_encoding(sig_bt[sig_index++]) 2247 : 0); 2248 assert((bt & _basic_type_mask) == bt, "must fit in 4 bits"); 2249 value = (value << _basic_type_bits) | bt; 2250 } 2251 ptr[index] = value; 2252 } 2253 } 2254 2255 ~AdapterFingerPrint() { 2256 if (_length > 0) { 2257 FREE_C_HEAP_ARRAY(int, _value._fingerprint); 2258 } 2259 } 2260 2261 int value(int index) { 2262 if (_length < 0) { 2263 return _value._compact[index]; 2264 } 2265 return _value._fingerprint[index]; 2266 } 2267 int length() { 2268 if (_length < 0) return -_length; 2269 return _length; 2270 } 2271 2272 bool is_compact() { 2273 return _length <= 0; 2274 } 2275 2276 unsigned int compute_hash() { 2277 int hash = 0; 2278 for (int i = 0; i < length(); i++) { 2279 int v = value(i); 2280 hash = (hash << 8) ^ v ^ (hash >> 5); 2281 } 2282 return (unsigned int)hash; 2283 } 2284 2285 const char* as_string() { 2286 stringStream st; 2287 st.print("0x"); 2288 for (int i = 0; i < length(); i++) { 2289 st.print("%08x", value(i)); 2290 } 2291 return st.as_string(); 2292 } 2293 2294 bool equals(AdapterFingerPrint* other) { 2295 if (other->_length != _length) { 2296 return false; 2297 } 2298 if (_length < 0) { 2299 assert(_compact_int_count == 3, "else change next line"); 2300 return _value._compact[0] == other->_value._compact[0] && 2301 _value._compact[1] == other->_value._compact[1] && 2302 _value._compact[2] == other->_value._compact[2]; 2303 } else { 2304 for (int i = 0; i < _length; i++) { 2305 if (_value._fingerprint[i] != other->_value._fingerprint[i]) { 2306 return false; 2307 } 2308 } 2309 } 2310 return true; 2311 } 2312 }; 2313 2314 2315 // A hashtable mapping from AdapterFingerPrints to AdapterHandlerEntries 2316 class AdapterHandlerTable : public BasicHashtable<mtCode> { 2317 friend class AdapterHandlerTableIterator; 2318 2319 private: 2320 2321 #ifndef PRODUCT 2322 static int _lookups; // number of calls to lookup 2323 static int _buckets; // number of buckets checked 2324 static int _equals; // number of buckets checked with matching hash 2325 static int _hits; // number of successful lookups 2326 static int _compact; // number of equals calls with compact signature 2327 #endif 2328 2329 AdapterHandlerEntry* bucket(int i) { 2330 return (AdapterHandlerEntry*)BasicHashtable<mtCode>::bucket(i); 2331 } 2332 2333 public: 2334 AdapterHandlerTable() 2335 : BasicHashtable<mtCode>(293, sizeof(AdapterHandlerEntry)) { } 2336 2337 // Create a new entry suitable for insertion in the table 2338 AdapterHandlerEntry* new_entry(AdapterFingerPrint* fingerprint, address i2c_entry, address c2i_entry, address c2i_unverified_entry) { 2339 AdapterHandlerEntry* entry = (AdapterHandlerEntry*)BasicHashtable<mtCode>::new_entry(fingerprint->compute_hash()); 2340 entry->init(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry); 2341 return entry; 2342 } 2343 2344 // Insert an entry into the table 2345 void add(AdapterHandlerEntry* entry) { 2346 int index = hash_to_index(entry->hash()); 2347 add_entry(index, entry); 2348 } 2349 2350 void free_entry(AdapterHandlerEntry* entry) { 2351 entry->deallocate(); 2352 BasicHashtable<mtCode>::free_entry(entry); 2353 } 2354 2355 // Find a entry with the same fingerprint if it exists 2356 AdapterHandlerEntry* lookup(int total_args_passed, BasicType* sig_bt) { 2357 NOT_PRODUCT(_lookups++); 2358 AdapterFingerPrint fp(total_args_passed, sig_bt); 2359 unsigned int hash = fp.compute_hash(); 2360 int index = hash_to_index(hash); 2361 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) { 2362 NOT_PRODUCT(_buckets++); 2363 if (e->hash() == hash) { 2364 NOT_PRODUCT(_equals++); 2365 if (fp.equals(e->fingerprint())) { 2366 #ifndef PRODUCT 2367 if (fp.is_compact()) _compact++; 2368 _hits++; 2369 #endif 2370 return e; 2371 } 2372 } 2373 } 2374 return NULL; 2375 } 2376 2377 #ifndef PRODUCT 2378 void print_statistics() { 2379 ResourceMark rm; 2380 int longest = 0; 2381 int empty = 0; 2382 int total = 0; 2383 int nonempty = 0; 2384 for (int index = 0; index < table_size(); index++) { 2385 int count = 0; 2386 for (AdapterHandlerEntry* e = bucket(index); e != NULL; e = e->next()) { 2387 count++; 2388 } 2389 if (count != 0) nonempty++; 2390 if (count == 0) empty++; 2391 if (count > longest) longest = count; 2392 total += count; 2393 } 2394 tty->print_cr("AdapterHandlerTable: empty %d longest %d total %d average %f", 2395 empty, longest, total, total / (double)nonempty); 2396 tty->print_cr("AdapterHandlerTable: lookups %d buckets %d equals %d hits %d compact %d", 2397 _lookups, _buckets, _equals, _hits, _compact); 2398 } 2399 #endif 2400 }; 2401 2402 2403 #ifndef PRODUCT 2404 2405 int AdapterHandlerTable::_lookups; 2406 int AdapterHandlerTable::_buckets; 2407 int AdapterHandlerTable::_equals; 2408 int AdapterHandlerTable::_hits; 2409 int AdapterHandlerTable::_compact; 2410 2411 #endif 2412 2413 class AdapterHandlerTableIterator : public StackObj { 2414 private: 2415 AdapterHandlerTable* _table; 2416 int _index; 2417 AdapterHandlerEntry* _current; 2418 2419 void scan() { 2420 while (_index < _table->table_size()) { 2421 AdapterHandlerEntry* a = _table->bucket(_index); 2422 _index++; 2423 if (a != NULL) { 2424 _current = a; 2425 return; 2426 } 2427 } 2428 } 2429 2430 public: 2431 AdapterHandlerTableIterator(AdapterHandlerTable* table): _table(table), _index(0), _current(NULL) { 2432 scan(); 2433 } 2434 bool has_next() { 2435 return _current != NULL; 2436 } 2437 AdapterHandlerEntry* next() { 2438 if (_current != NULL) { 2439 AdapterHandlerEntry* result = _current; 2440 _current = _current->next(); 2441 if (_current == NULL) scan(); 2442 return result; 2443 } else { 2444 return NULL; 2445 } 2446 } 2447 }; 2448 2449 2450 // --------------------------------------------------------------------------- 2451 // Implementation of AdapterHandlerLibrary 2452 AdapterHandlerTable* AdapterHandlerLibrary::_adapters = NULL; 2453 AdapterHandlerEntry* AdapterHandlerLibrary::_abstract_method_handler = NULL; 2454 const int AdapterHandlerLibrary_size = 16*K; 2455 BufferBlob* AdapterHandlerLibrary::_buffer = NULL; 2456 2457 BufferBlob* AdapterHandlerLibrary::buffer_blob() { 2458 // Should be called only when AdapterHandlerLibrary_lock is active. 2459 if (_buffer == NULL) // Initialize lazily 2460 _buffer = BufferBlob::create("adapters", AdapterHandlerLibrary_size); 2461 return _buffer; 2462 } 2463 2464 extern "C" void unexpected_adapter_call() { 2465 ShouldNotCallThis(); 2466 } 2467 2468 void AdapterHandlerLibrary::initialize() { 2469 if (_adapters != NULL) return; 2470 _adapters = new AdapterHandlerTable(); 2471 2472 if (!CodeCacheExtensions::skip_compiler_support()) { 2473 // Create a special handler for abstract methods. Abstract methods 2474 // are never compiled so an i2c entry is somewhat meaningless, but 2475 // throw AbstractMethodError just in case. 2476 // Pass wrong_method_abstract for the c2i transitions to return 2477 // AbstractMethodError for invalid invocations. 2478 address wrong_method_abstract = SharedRuntime::get_handle_wrong_method_abstract_stub(); 2479 _abstract_method_handler = AdapterHandlerLibrary::new_entry(new AdapterFingerPrint(0, NULL), 2480 StubRoutines::throw_AbstractMethodError_entry(), 2481 wrong_method_abstract, wrong_method_abstract); 2482 } else { 2483 // Adapters are not supposed to be used. 2484 // Generate a special one to cause an error if used (and store this 2485 // singleton in place of the useless _abstract_method_error adapter). 2486 address entry = (address) &unexpected_adapter_call; 2487 _abstract_method_handler = AdapterHandlerLibrary::new_entry(new AdapterFingerPrint(0, NULL), 2488 entry, 2489 entry, 2490 entry); 2491 2492 } 2493 } 2494 2495 AdapterHandlerEntry* AdapterHandlerLibrary::new_entry(AdapterFingerPrint* fingerprint, 2496 address i2c_entry, 2497 address c2i_entry, 2498 address c2i_unverified_entry) { 2499 return _adapters->new_entry(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry); 2500 } 2501 2502 AdapterHandlerEntry* AdapterHandlerLibrary::get_adapter(const methodHandle& method) { 2503 // Use customized signature handler. Need to lock around updates to 2504 // the AdapterHandlerTable (it is not safe for concurrent readers 2505 // and a single writer: this could be fixed if it becomes a 2506 // problem). 2507 2508 ResourceMark rm; 2509 2510 NOT_PRODUCT(int insts_size); 2511 AdapterBlob* new_adapter = NULL; 2512 AdapterHandlerEntry* entry = NULL; 2513 AdapterFingerPrint* fingerprint = NULL; 2514 { 2515 MutexLocker mu(AdapterHandlerLibrary_lock); 2516 // make sure data structure is initialized 2517 initialize(); 2518 2519 if (CodeCacheExtensions::skip_compiler_support()) { 2520 // adapters are useless and should not be used, including the 2521 // abstract_method_handler. However, some callers check that 2522 // an adapter was installed. 2523 // Return the singleton adapter, stored into _abstract_method_handler 2524 // and modified to cause an error if we ever call it. 2525 return _abstract_method_handler; 2526 } 2527 2528 if (method->is_abstract()) { 2529 return _abstract_method_handler; 2530 } 2531 2532 // Fill in the signature array, for the calling-convention call. 2533 int total_args_passed = method->size_of_parameters(); // All args on stack 2534 2535 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed); 2536 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed); 2537 int i = 0; 2538 if (!method->is_static()) // Pass in receiver first 2539 sig_bt[i++] = T_OBJECT; 2540 for (SignatureStream ss(method->signature()); !ss.at_return_type(); ss.next()) { 2541 sig_bt[i++] = ss.type(); // Collect remaining bits of signature 2542 if (ss.type() == T_LONG || ss.type() == T_DOUBLE) 2543 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots 2544 } 2545 assert(i == total_args_passed, ""); 2546 2547 // Lookup method signature's fingerprint 2548 entry = _adapters->lookup(total_args_passed, sig_bt); 2549 2550 #ifdef ASSERT 2551 AdapterHandlerEntry* shared_entry = NULL; 2552 // Start adapter sharing verification only after the VM is booted. 2553 if (VerifyAdapterSharing && (entry != NULL)) { 2554 shared_entry = entry; 2555 entry = NULL; 2556 } 2557 #endif 2558 2559 if (entry != NULL) { 2560 return entry; 2561 } 2562 2563 // Get a description of the compiled java calling convention and the largest used (VMReg) stack slot usage 2564 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, false); 2565 2566 // Make a C heap allocated version of the fingerprint to store in the adapter 2567 fingerprint = new AdapterFingerPrint(total_args_passed, sig_bt); 2568 2569 // StubRoutines::code2() is initialized after this function can be called. As a result, 2570 // VerifyAdapterCalls and VerifyAdapterSharing can fail if we re-use code that generated 2571 // prior to StubRoutines::code2() being set. Checks refer to checks generated in an I2C 2572 // stub that ensure that an I2C stub is called from an interpreter frame. 2573 bool contains_all_checks = StubRoutines::code2() != NULL; 2574 2575 // Create I2C & C2I handlers 2576 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache 2577 if (buf != NULL) { 2578 CodeBuffer buffer(buf); 2579 short buffer_locs[20]; 2580 buffer.insts()->initialize_shared_locs((relocInfo*)buffer_locs, 2581 sizeof(buffer_locs)/sizeof(relocInfo)); 2582 2583 MacroAssembler _masm(&buffer); 2584 entry = SharedRuntime::generate_i2c2i_adapters(&_masm, 2585 total_args_passed, 2586 comp_args_on_stack, 2587 sig_bt, 2588 regs, 2589 fingerprint); 2590 #ifdef ASSERT 2591 if (VerifyAdapterSharing) { 2592 if (shared_entry != NULL) { 2593 assert(shared_entry->compare_code(buf->code_begin(), buffer.insts_size()), "code must match"); 2594 // Release the one just created and return the original 2595 _adapters->free_entry(entry); 2596 return shared_entry; 2597 } else { 2598 entry->save_code(buf->code_begin(), buffer.insts_size()); 2599 } 2600 } 2601 #endif 2602 2603 new_adapter = AdapterBlob::create(&buffer); 2604 NOT_PRODUCT(insts_size = buffer.insts_size()); 2605 } 2606 if (new_adapter == NULL) { 2607 // CodeCache is full, disable compilation 2608 // Ought to log this but compile log is only per compile thread 2609 // and we're some non descript Java thread. 2610 return NULL; // Out of CodeCache space 2611 } 2612 entry->relocate(new_adapter->content_begin()); 2613 #ifndef PRODUCT 2614 // debugging suppport 2615 if (PrintAdapterHandlers || PrintStubCode) { 2616 ttyLocker ttyl; 2617 entry->print_adapter_on(tty); 2618 tty->print_cr("i2c argument handler #%d for: %s %s %s (%d bytes generated)", 2619 _adapters->number_of_entries(), (method->is_static() ? "static" : "receiver"), 2620 method->signature()->as_C_string(), fingerprint->as_string(), insts_size); 2621 tty->print_cr("c2i argument handler starts at %p", entry->get_c2i_entry()); 2622 if (Verbose || PrintStubCode) { 2623 address first_pc = entry->base_address(); 2624 if (first_pc != NULL) { 2625 Disassembler::decode(first_pc, first_pc + insts_size); 2626 tty->cr(); 2627 } 2628 } 2629 } 2630 #endif 2631 // Add the entry only if the entry contains all required checks (see sharedRuntime_xxx.cpp) 2632 // The checks are inserted only if -XX:+VerifyAdapterCalls is specified. 2633 if (contains_all_checks || !VerifyAdapterCalls) { 2634 _adapters->add(entry); 2635 } 2636 } 2637 // Outside of the lock 2638 if (new_adapter != NULL) { 2639 char blob_id[256]; 2640 jio_snprintf(blob_id, 2641 sizeof(blob_id), 2642 "%s(%s)@" PTR_FORMAT, 2643 new_adapter->name(), 2644 fingerprint->as_string(), 2645 new_adapter->content_begin()); 2646 Forte::register_stub(blob_id, new_adapter->content_begin(), new_adapter->content_end()); 2647 2648 if (JvmtiExport::should_post_dynamic_code_generated()) { 2649 JvmtiExport::post_dynamic_code_generated(blob_id, new_adapter->content_begin(), new_adapter->content_end()); 2650 } 2651 } 2652 return entry; 2653 } 2654 2655 address AdapterHandlerEntry::base_address() { 2656 address base = _i2c_entry; 2657 if (base == NULL) base = _c2i_entry; 2658 assert(base <= _c2i_entry || _c2i_entry == NULL, ""); 2659 assert(base <= _c2i_unverified_entry || _c2i_unverified_entry == NULL, ""); 2660 return base; 2661 } 2662 2663 void AdapterHandlerEntry::relocate(address new_base) { 2664 address old_base = base_address(); 2665 assert(old_base != NULL, ""); 2666 ptrdiff_t delta = new_base - old_base; 2667 if (_i2c_entry != NULL) 2668 _i2c_entry += delta; 2669 if (_c2i_entry != NULL) 2670 _c2i_entry += delta; 2671 if (_c2i_unverified_entry != NULL) 2672 _c2i_unverified_entry += delta; 2673 assert(base_address() == new_base, ""); 2674 } 2675 2676 2677 void AdapterHandlerEntry::deallocate() { 2678 delete _fingerprint; 2679 #ifdef ASSERT 2680 if (_saved_code) FREE_C_HEAP_ARRAY(unsigned char, _saved_code); 2681 #endif 2682 } 2683 2684 2685 #ifdef ASSERT 2686 // Capture the code before relocation so that it can be compared 2687 // against other versions. If the code is captured after relocation 2688 // then relative instructions won't be equivalent. 2689 void AdapterHandlerEntry::save_code(unsigned char* buffer, int length) { 2690 _saved_code = NEW_C_HEAP_ARRAY(unsigned char, length, mtCode); 2691 _saved_code_length = length; 2692 memcpy(_saved_code, buffer, length); 2693 } 2694 2695 2696 bool AdapterHandlerEntry::compare_code(unsigned char* buffer, int length) { 2697 if (length != _saved_code_length) { 2698 return false; 2699 } 2700 2701 return (memcmp(buffer, _saved_code, length) == 0) ? true : false; 2702 } 2703 #endif 2704 2705 2706 /** 2707 * Create a native wrapper for this native method. The wrapper converts the 2708 * Java-compiled calling convention to the native convention, handles 2709 * arguments, and transitions to native. On return from the native we transition 2710 * back to java blocking if a safepoint is in progress. 2711 */ 2712 void AdapterHandlerLibrary::create_native_wrapper(const methodHandle& method) { 2713 ResourceMark rm; 2714 nmethod* nm = NULL; 2715 2716 assert(method->is_native(), "must be native"); 2717 assert(method->is_method_handle_intrinsic() || 2718 method->has_native_function(), "must have something valid to call!"); 2719 2720 { 2721 // Perform the work while holding the lock, but perform any printing outside the lock 2722 MutexLocker mu(AdapterHandlerLibrary_lock); 2723 // See if somebody beat us to it 2724 if (method->code() != NULL) { 2725 return; 2726 } 2727 2728 const int compile_id = CompileBroker::assign_compile_id(method, CompileBroker::standard_entry_bci); 2729 assert(compile_id > 0, "Must generate native wrapper"); 2730 2731 2732 ResourceMark rm; 2733 BufferBlob* buf = buffer_blob(); // the temporary code buffer in CodeCache 2734 if (buf != NULL) { 2735 CodeBuffer buffer(buf); 2736 double locs_buf[20]; 2737 buffer.insts()->initialize_shared_locs((relocInfo*)locs_buf, sizeof(locs_buf) / sizeof(relocInfo)); 2738 MacroAssembler _masm(&buffer); 2739 2740 // Fill in the signature array, for the calling-convention call. 2741 const int total_args_passed = method->size_of_parameters(); 2742 2743 BasicType* sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed); 2744 VMRegPair* regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed); 2745 int i=0; 2746 if (!method->is_static()) // Pass in receiver first 2747 sig_bt[i++] = T_OBJECT; 2748 SignatureStream ss(method->signature()); 2749 for (; !ss.at_return_type(); ss.next()) { 2750 sig_bt[i++] = ss.type(); // Collect remaining bits of signature 2751 if (ss.type() == T_LONG || ss.type() == T_DOUBLE) 2752 sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots 2753 } 2754 assert(i == total_args_passed, ""); 2755 BasicType ret_type = ss.type(); 2756 2757 // Now get the compiled-Java layout as input (or output) arguments. 2758 // NOTE: Stubs for compiled entry points of method handle intrinsics 2759 // are just trampolines so the argument registers must be outgoing ones. 2760 const bool is_outgoing = method->is_method_handle_intrinsic(); 2761 int comp_args_on_stack = SharedRuntime::java_calling_convention(sig_bt, regs, total_args_passed, is_outgoing); 2762 2763 // Generate the compiled-to-native wrapper code 2764 nm = SharedRuntime::generate_native_wrapper(&_masm, method, compile_id, sig_bt, regs, ret_type); 2765 2766 if (nm != NULL) { 2767 method->set_code(method, nm); 2768 2769 DirectiveSet* directive = DirectivesStack::getDefaultDirective(CompileBroker::compiler(CompLevel_simple)); 2770 if (directive->PrintAssemblyOption) { 2771 nm->print_code(); 2772 } 2773 DirectivesStack::release(directive); 2774 } 2775 } 2776 } // Unlock AdapterHandlerLibrary_lock 2777 2778 2779 // Install the generated code. 2780 if (nm != NULL) { 2781 if (PrintCompilation) { 2782 ttyLocker ttyl; 2783 CompileTask::print(tty, nm, method->is_static() ? "(static)" : ""); 2784 } 2785 nm->post_compiled_method_load_event(); 2786 } 2787 } 2788 2789 JRT_ENTRY_NO_ASYNC(void, SharedRuntime::block_for_jni_critical(JavaThread* thread)) 2790 assert(thread == JavaThread::current(), "must be"); 2791 // The code is about to enter a JNI lazy critical native method and 2792 // _needs_gc is true, so if this thread is already in a critical 2793 // section then just return, otherwise this thread should block 2794 // until needs_gc has been cleared. 2795 if (thread->in_critical()) { 2796 return; 2797 } 2798 // Lock and unlock a critical section to give the system a chance to block 2799 GCLocker::lock_critical(thread); 2800 GCLocker::unlock_critical(thread); 2801 JRT_END 2802 2803 // ------------------------------------------------------------------------- 2804 // Java-Java calling convention 2805 // (what you use when Java calls Java) 2806 2807 //------------------------------name_for_receiver---------------------------------- 2808 // For a given signature, return the VMReg for parameter 0. 2809 VMReg SharedRuntime::name_for_receiver() { 2810 VMRegPair regs; 2811 BasicType sig_bt = T_OBJECT; 2812 (void) java_calling_convention(&sig_bt, ®s, 1, true); 2813 // Return argument 0 register. In the LP64 build pointers 2814 // take 2 registers, but the VM wants only the 'main' name. 2815 return regs.first(); 2816 } 2817 2818 VMRegPair *SharedRuntime::find_callee_arguments(Symbol* sig, bool has_receiver, bool has_appendix, int* arg_size) { 2819 // This method is returning a data structure allocating as a 2820 // ResourceObject, so do not put any ResourceMarks in here. 2821 char *s = sig->as_C_string(); 2822 int len = (int)strlen(s); 2823 s++; len--; // Skip opening paren 2824 char *t = s+len; 2825 while (*(--t) != ')'); // Find close paren 2826 2827 BasicType *sig_bt = NEW_RESOURCE_ARRAY(BasicType, 256); 2828 VMRegPair *regs = NEW_RESOURCE_ARRAY(VMRegPair, 256); 2829 int cnt = 0; 2830 if (has_receiver) { 2831 sig_bt[cnt++] = T_OBJECT; // Receiver is argument 0; not in signature 2832 } 2833 2834 while (s < t) { 2835 switch (*s++) { // Switch on signature character 2836 case 'B': sig_bt[cnt++] = T_BYTE; break; 2837 case 'C': sig_bt[cnt++] = T_CHAR; break; 2838 case 'D': sig_bt[cnt++] = T_DOUBLE; sig_bt[cnt++] = T_VOID; break; 2839 case 'F': sig_bt[cnt++] = T_FLOAT; break; 2840 case 'I': sig_bt[cnt++] = T_INT; break; 2841 case 'J': sig_bt[cnt++] = T_LONG; sig_bt[cnt++] = T_VOID; break; 2842 case 'S': sig_bt[cnt++] = T_SHORT; break; 2843 case 'Z': sig_bt[cnt++] = T_BOOLEAN; break; 2844 case 'V': sig_bt[cnt++] = T_VOID; break; 2845 case 'L': // Oop 2846 while (*s++ != ';'); // Skip signature 2847 sig_bt[cnt++] = T_OBJECT; 2848 break; 2849 case 'Q': // Oop 2850 while (*s++ != ';'); // Skip signature 2851 sig_bt[cnt++] = T_VALUETYPE; 2852 break; 2853 case '[': { // Array 2854 do { // Skip optional size 2855 while (*s >= '0' && *s <= '9') s++; 2856 } while (*s++ == '['); // Nested arrays? 2857 // Skip element type 2858 if (s[-1] == 'L') 2859 while (*s++ != ';'); // Skip signature 2860 sig_bt[cnt++] = T_ARRAY; 2861 break; 2862 } 2863 default : ShouldNotReachHere(); 2864 } 2865 } 2866 2867 if (has_appendix) { 2868 sig_bt[cnt++] = T_OBJECT; 2869 } 2870 2871 assert(cnt < 256, "grow table size"); 2872 2873 int comp_args_on_stack; 2874 comp_args_on_stack = java_calling_convention(sig_bt, regs, cnt, true); 2875 2876 // the calling convention doesn't count out_preserve_stack_slots so 2877 // we must add that in to get "true" stack offsets. 2878 2879 if (comp_args_on_stack) { 2880 for (int i = 0; i < cnt; i++) { 2881 VMReg reg1 = regs[i].first(); 2882 if (reg1->is_stack()) { 2883 // Yuck 2884 reg1 = reg1->bias(out_preserve_stack_slots()); 2885 } 2886 VMReg reg2 = regs[i].second(); 2887 if (reg2->is_stack()) { 2888 // Yuck 2889 reg2 = reg2->bias(out_preserve_stack_slots()); 2890 } 2891 regs[i].set_pair(reg2, reg1); 2892 } 2893 } 2894 2895 // results 2896 *arg_size = cnt; 2897 return regs; 2898 } 2899 2900 // OSR Migration Code 2901 // 2902 // This code is used convert interpreter frames into compiled frames. It is 2903 // called from very start of a compiled OSR nmethod. A temp array is 2904 // allocated to hold the interesting bits of the interpreter frame. All 2905 // active locks are inflated to allow them to move. The displaced headers and 2906 // active interpreter locals are copied into the temp buffer. Then we return 2907 // back to the compiled code. The compiled code then pops the current 2908 // interpreter frame off the stack and pushes a new compiled frame. Then it 2909 // copies the interpreter locals and displaced headers where it wants. 2910 // Finally it calls back to free the temp buffer. 2911 // 2912 // All of this is done NOT at any Safepoint, nor is any safepoint or GC allowed. 2913 2914 JRT_LEAF(intptr_t*, SharedRuntime::OSR_migration_begin( JavaThread *thread) ) 2915 2916 // 2917 // This code is dependent on the memory layout of the interpreter local 2918 // array and the monitors. On all of our platforms the layout is identical 2919 // so this code is shared. If some platform lays the their arrays out 2920 // differently then this code could move to platform specific code or 2921 // the code here could be modified to copy items one at a time using 2922 // frame accessor methods and be platform independent. 2923 2924 frame fr = thread->last_frame(); 2925 assert(fr.is_interpreted_frame(), ""); 2926 assert(fr.interpreter_frame_expression_stack_size()==0, "only handle empty stacks"); 2927 2928 // Figure out how many monitors are active. 2929 int active_monitor_count = 0; 2930 for (BasicObjectLock *kptr = fr.interpreter_frame_monitor_end(); 2931 kptr < fr.interpreter_frame_monitor_begin(); 2932 kptr = fr.next_monitor_in_interpreter_frame(kptr) ) { 2933 if (kptr->obj() != NULL) active_monitor_count++; 2934 } 2935 2936 // QQQ we could place number of active monitors in the array so that compiled code 2937 // could double check it. 2938 2939 Method* moop = fr.interpreter_frame_method(); 2940 int max_locals = moop->max_locals(); 2941 // Allocate temp buffer, 1 word per local & 2 per active monitor 2942 int buf_size_words = max_locals + active_monitor_count*2; 2943 intptr_t *buf = NEW_C_HEAP_ARRAY(intptr_t,buf_size_words, mtCode); 2944 2945 // Copy the locals. Order is preserved so that loading of longs works. 2946 // Since there's no GC I can copy the oops blindly. 2947 assert(sizeof(HeapWord)==sizeof(intptr_t), "fix this code"); 2948 Copy::disjoint_words((HeapWord*)fr.interpreter_frame_local_at(max_locals-1), 2949 (HeapWord*)&buf[0], 2950 max_locals); 2951 2952 // Inflate locks. Copy the displaced headers. Be careful, there can be holes. 2953 int i = max_locals; 2954 for (BasicObjectLock *kptr2 = fr.interpreter_frame_monitor_end(); 2955 kptr2 < fr.interpreter_frame_monitor_begin(); 2956 kptr2 = fr.next_monitor_in_interpreter_frame(kptr2) ) { 2957 if (kptr2->obj() != NULL) { // Avoid 'holes' in the monitor array 2958 BasicLock *lock = kptr2->lock(); 2959 // Inflate so the displaced header becomes position-independent 2960 if (lock->displaced_header()->is_unlocked()) 2961 ObjectSynchronizer::inflate_helper(kptr2->obj()); 2962 // Now the displaced header is free to move 2963 buf[i++] = (intptr_t)lock->displaced_header(); 2964 buf[i++] = cast_from_oop<intptr_t>(kptr2->obj()); 2965 } 2966 } 2967 assert(i - max_locals == active_monitor_count*2, "found the expected number of monitors"); 2968 2969 return buf; 2970 JRT_END 2971 2972 JRT_LEAF(void, SharedRuntime::OSR_migration_end( intptr_t* buf) ) 2973 FREE_C_HEAP_ARRAY(intptr_t, buf); 2974 JRT_END 2975 2976 bool AdapterHandlerLibrary::contains(const CodeBlob* b) { 2977 AdapterHandlerTableIterator iter(_adapters); 2978 while (iter.has_next()) { 2979 AdapterHandlerEntry* a = iter.next(); 2980 if (b == CodeCache::find_blob(a->get_i2c_entry())) return true; 2981 } 2982 return false; 2983 } 2984 2985 void AdapterHandlerLibrary::print_handler_on(outputStream* st, const CodeBlob* b) { 2986 AdapterHandlerTableIterator iter(_adapters); 2987 while (iter.has_next()) { 2988 AdapterHandlerEntry* a = iter.next(); 2989 if (b == CodeCache::find_blob(a->get_i2c_entry())) { 2990 st->print("Adapter for signature: "); 2991 a->print_adapter_on(tty); 2992 return; 2993 } 2994 } 2995 assert(false, "Should have found handler"); 2996 } 2997 2998 void AdapterHandlerEntry::print_adapter_on(outputStream* st) const { 2999 st->print_cr("AHE@" INTPTR_FORMAT ": %s i2c: " INTPTR_FORMAT " c2i: " INTPTR_FORMAT " c2iUV: " INTPTR_FORMAT, 3000 p2i(this), fingerprint()->as_string(), 3001 p2i(get_i2c_entry()), p2i(get_c2i_entry()), p2i(get_c2i_unverified_entry())); 3002 3003 } 3004 3005 #ifndef PRODUCT 3006 3007 void AdapterHandlerLibrary::print_statistics() { 3008 _adapters->print_statistics(); 3009 } 3010 3011 #endif /* PRODUCT */ 3012 3013 JRT_LEAF(void, SharedRuntime::enable_stack_reserved_zone(JavaThread* thread)) 3014 assert(thread->is_Java_thread(), "Only Java threads have a stack reserved zone"); 3015 thread->enable_stack_reserved_zone(); 3016 thread->set_reserved_stack_activation(thread->stack_base()); 3017 JRT_END 3018 3019 frame SharedRuntime::look_for_reserved_stack_annotated_method(JavaThread* thread, frame fr) { 3020 frame activation; 3021 int decode_offset = 0; 3022 nmethod* nm = NULL; 3023 frame prv_fr = fr; 3024 int count = 1; 3025 3026 assert(fr.is_java_frame(), "Must start on Java frame"); 3027 3028 while (!fr.is_first_frame()) { 3029 Method* method = NULL; 3030 // Compiled java method case. 3031 if (decode_offset != 0) { 3032 DebugInfoReadStream stream(nm, decode_offset); 3033 decode_offset = stream.read_int(); 3034 method = (Method*)nm->metadata_at(stream.read_int()); 3035 } else { 3036 if (fr.is_first_java_frame()) break; 3037 address pc = fr.pc(); 3038 prv_fr = fr; 3039 if (fr.is_interpreted_frame()) { 3040 method = fr.interpreter_frame_method(); 3041 fr = fr.java_sender(); 3042 } else { 3043 CodeBlob* cb = fr.cb(); 3044 fr = fr.java_sender(); 3045 if (cb == NULL || !cb->is_nmethod()) { 3046 continue; 3047 } 3048 nm = (nmethod*)cb; 3049 if (nm->method()->is_native()) { 3050 method = nm->method(); 3051 } else { 3052 PcDesc* pd = nm->pc_desc_at(pc); 3053 assert(pd != NULL, "PcDesc must not be NULL"); 3054 decode_offset = pd->scope_decode_offset(); 3055 // if decode_offset is not equal to 0, it will execute the 3056 // "compiled java method case" at the beginning of the loop. 3057 continue; 3058 } 3059 } 3060 } 3061 if (method->has_reserved_stack_access()) { 3062 ResourceMark rm(thread); 3063 activation = prv_fr; 3064 warning("Potentially dangerous stack overflow in " 3065 "ReservedStackAccess annotated method %s [%d]", 3066 method->name_and_sig_as_C_string(), count++); 3067 EventReservedStackActivation event; 3068 if (event.should_commit()) { 3069 event.set_method(method); 3070 event.commit(); 3071 } 3072 } 3073 } 3074 return activation; 3075 } 3076