1 /* 2 * Copyright (c) 1999, 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 "asm/codeBuffer.hpp" 27 #include "c1/c1_CodeStubs.hpp" 28 #include "c1/c1_Defs.hpp" 29 #include "c1/c1_FrameMap.hpp" 30 #include "c1/c1_LIRAssembler.hpp" 31 #include "c1/c1_MacroAssembler.hpp" 32 #include "c1/c1_Runtime1.hpp" 33 #include "classfile/systemDictionary.hpp" 34 #include "classfile/vmSymbols.hpp" 35 #include "code/codeBlob.hpp" 36 #include "code/codeCacheExtensions.hpp" 37 #include "code/compiledIC.hpp" 38 #include "code/pcDesc.hpp" 39 #include "code/scopeDesc.hpp" 40 #include "code/vtableStubs.hpp" 41 #include "compiler/disassembler.hpp" 42 #include "gc/shared/barrierSet.hpp" 43 #include "gc/shared/collectedHeap.hpp" 44 #include "interpreter/bytecode.hpp" 45 #include "interpreter/interpreter.hpp" 46 #include "memory/allocation.inline.hpp" 47 #include "memory/oopFactory.hpp" 48 #include "memory/resourceArea.hpp" 49 #include "oops/objArrayKlass.hpp" 50 #include "oops/oop.inline.hpp" 51 #include "runtime/atomic.inline.hpp" 52 #include "runtime/biasedLocking.hpp" 53 #include "runtime/compilationPolicy.hpp" 54 #include "runtime/interfaceSupport.hpp" 55 #include "runtime/javaCalls.hpp" 56 #include "runtime/sharedRuntime.hpp" 57 #include "runtime/threadCritical.hpp" 58 #include "runtime/vframe.hpp" 59 #include "runtime/vframeArray.hpp" 60 #include "runtime/vm_version.hpp" 61 #include "utilities/copy.hpp" 62 #include "utilities/events.hpp" 63 64 65 // Implementation of StubAssembler 66 67 StubAssembler::StubAssembler(CodeBuffer* code, const char * name, int stub_id) : C1_MacroAssembler(code) { 68 _name = name; 69 _must_gc_arguments = false; 70 _frame_size = no_frame_size; 71 _num_rt_args = 0; 72 _stub_id = stub_id; 73 } 74 75 76 void StubAssembler::set_info(const char* name, bool must_gc_arguments) { 77 _name = name; 78 _must_gc_arguments = must_gc_arguments; 79 } 80 81 82 void StubAssembler::set_frame_size(int size) { 83 if (_frame_size == no_frame_size) { 84 _frame_size = size; 85 } 86 assert(_frame_size == size, "can't change the frame size"); 87 } 88 89 90 void StubAssembler::set_num_rt_args(int args) { 91 if (_num_rt_args == 0) { 92 _num_rt_args = args; 93 } 94 assert(_num_rt_args == args, "can't change the number of args"); 95 } 96 97 // Implementation of Runtime1 98 99 CodeBlob* Runtime1::_blobs[Runtime1::number_of_ids]; 100 const char *Runtime1::_blob_names[] = { 101 RUNTIME1_STUBS(STUB_NAME, LAST_STUB_NAME) 102 }; 103 104 #ifndef PRODUCT 105 // statistics 106 int Runtime1::_generic_arraycopy_cnt = 0; 107 int Runtime1::_primitive_arraycopy_cnt = 0; 108 int Runtime1::_oop_arraycopy_cnt = 0; 109 int Runtime1::_generic_arraycopystub_cnt = 0; 110 int Runtime1::_arraycopy_slowcase_cnt = 0; 111 int Runtime1::_arraycopy_checkcast_cnt = 0; 112 int Runtime1::_arraycopy_checkcast_attempt_cnt = 0; 113 int Runtime1::_new_type_array_slowcase_cnt = 0; 114 int Runtime1::_new_object_array_slowcase_cnt = 0; 115 int Runtime1::_new_instance_slowcase_cnt = 0; 116 int Runtime1::_new_multi_array_slowcase_cnt = 0; 117 int Runtime1::_monitorenter_slowcase_cnt = 0; 118 int Runtime1::_monitorexit_slowcase_cnt = 0; 119 int Runtime1::_patch_code_slowcase_cnt = 0; 120 int Runtime1::_throw_range_check_exception_count = 0; 121 int Runtime1::_throw_index_exception_count = 0; 122 int Runtime1::_throw_div0_exception_count = 0; 123 int Runtime1::_throw_null_pointer_exception_count = 0; 124 int Runtime1::_throw_class_cast_exception_count = 0; 125 int Runtime1::_throw_incompatible_class_change_error_count = 0; 126 int Runtime1::_throw_array_store_exception_count = 0; 127 int Runtime1::_throw_count = 0; 128 129 static int _byte_arraycopy_stub_cnt = 0; 130 static int _short_arraycopy_stub_cnt = 0; 131 static int _int_arraycopy_stub_cnt = 0; 132 static int _long_arraycopy_stub_cnt = 0; 133 static int _oop_arraycopy_stub_cnt = 0; 134 135 address Runtime1::arraycopy_count_address(BasicType type) { 136 switch (type) { 137 case T_BOOLEAN: 138 case T_BYTE: return (address)&_byte_arraycopy_stub_cnt; 139 case T_CHAR: 140 case T_SHORT: return (address)&_short_arraycopy_stub_cnt; 141 case T_FLOAT: 142 case T_INT: return (address)&_int_arraycopy_stub_cnt; 143 case T_DOUBLE: 144 case T_LONG: return (address)&_long_arraycopy_stub_cnt; 145 case T_ARRAY: 146 case T_OBJECT: return (address)&_oop_arraycopy_stub_cnt; 147 default: 148 ShouldNotReachHere(); 149 return NULL; 150 } 151 } 152 153 154 #endif 155 156 // Simple helper to see if the caller of a runtime stub which 157 // entered the VM has been deoptimized 158 159 static bool caller_is_deopted() { 160 JavaThread* thread = JavaThread::current(); 161 RegisterMap reg_map(thread, false); 162 frame runtime_frame = thread->last_frame(); 163 frame caller_frame = runtime_frame.sender(®_map); 164 assert(caller_frame.is_compiled_frame(), "must be compiled"); 165 return caller_frame.is_deoptimized_frame(); 166 } 167 168 // Stress deoptimization 169 static void deopt_caller() { 170 if ( !caller_is_deopted()) { 171 JavaThread* thread = JavaThread::current(); 172 RegisterMap reg_map(thread, false); 173 frame runtime_frame = thread->last_frame(); 174 frame caller_frame = runtime_frame.sender(®_map); 175 Deoptimization::deoptimize_frame(thread, caller_frame.id()); 176 assert(caller_is_deopted(), "Must be deoptimized"); 177 } 178 } 179 180 181 void Runtime1::generate_blob_for(BufferBlob* buffer_blob, StubID id) { 182 assert(0 <= id && id < number_of_ids, "illegal stub id"); 183 ResourceMark rm; 184 // create code buffer for code storage 185 CodeBuffer code(buffer_blob); 186 187 OopMapSet* oop_maps; 188 int frame_size; 189 bool must_gc_arguments; 190 191 if (!CodeCacheExtensions::skip_compiler_support()) { 192 // bypass useless code generation 193 Compilation::setup_code_buffer(&code, 0); 194 195 // create assembler for code generation 196 StubAssembler* sasm = new StubAssembler(&code, name_for(id), id); 197 // generate code for runtime stub 198 oop_maps = generate_code_for(id, sasm); 199 assert(oop_maps == NULL || sasm->frame_size() != no_frame_size, 200 "if stub has an oop map it must have a valid frame size"); 201 202 #ifdef ASSERT 203 // Make sure that stubs that need oopmaps have them 204 switch (id) { 205 // These stubs don't need to have an oopmap 206 case dtrace_object_alloc_id: 207 case g1_pre_barrier_slow_id: 208 case g1_post_barrier_slow_id: 209 case slow_subtype_check_id: 210 case fpu2long_stub_id: 211 case unwind_exception_id: 212 case counter_overflow_id: 213 #if defined(SPARC) || defined(PPC) 214 case handle_exception_nofpu_id: // Unused on sparc 215 #endif 216 break; 217 218 // All other stubs should have oopmaps 219 default: 220 assert(oop_maps != NULL, "must have an oopmap"); 221 } 222 #endif 223 224 // align so printing shows nop's instead of random code at the end (SimpleStubs are aligned) 225 sasm->align(BytesPerWord); 226 // make sure all code is in code buffer 227 sasm->flush(); 228 229 frame_size = sasm->frame_size(); 230 must_gc_arguments = sasm->must_gc_arguments(); 231 } else { 232 /* ignored values */ 233 oop_maps = NULL; 234 frame_size = 0; 235 must_gc_arguments = false; 236 } 237 // create blob - distinguish a few special cases 238 CodeBlob* blob = RuntimeStub::new_runtime_stub(name_for(id), 239 &code, 240 CodeOffsets::frame_never_safe, 241 frame_size, 242 oop_maps, 243 must_gc_arguments); 244 // install blob 245 assert(blob != NULL, "blob must exist"); 246 _blobs[id] = blob; 247 } 248 249 250 void Runtime1::initialize(BufferBlob* blob) { 251 // platform-dependent initialization 252 initialize_pd(); 253 // generate stubs 254 for (int id = 0; id < number_of_ids; id++) generate_blob_for(blob, (StubID)id); 255 // printing 256 #ifndef PRODUCT 257 if (PrintSimpleStubs) { 258 ResourceMark rm; 259 for (int id = 0; id < number_of_ids; id++) { 260 _blobs[id]->print(); 261 if (_blobs[id]->oop_maps() != NULL) { 262 _blobs[id]->oop_maps()->print(); 263 } 264 } 265 } 266 #endif 267 } 268 269 270 CodeBlob* Runtime1::blob_for(StubID id) { 271 assert(0 <= id && id < number_of_ids, "illegal stub id"); 272 return _blobs[id]; 273 } 274 275 276 const char* Runtime1::name_for(StubID id) { 277 assert(0 <= id && id < number_of_ids, "illegal stub id"); 278 return _blob_names[id]; 279 } 280 281 const char* Runtime1::name_for_address(address entry) { 282 for (int id = 0; id < number_of_ids; id++) { 283 if (entry == entry_for((StubID)id)) return name_for((StubID)id); 284 } 285 286 #define FUNCTION_CASE(a, f) \ 287 if ((intptr_t)a == CAST_FROM_FN_PTR(intptr_t, f)) return #f 288 289 FUNCTION_CASE(entry, os::javaTimeMillis); 290 FUNCTION_CASE(entry, os::javaTimeNanos); 291 FUNCTION_CASE(entry, SharedRuntime::OSR_migration_end); 292 FUNCTION_CASE(entry, SharedRuntime::d2f); 293 FUNCTION_CASE(entry, SharedRuntime::d2i); 294 FUNCTION_CASE(entry, SharedRuntime::d2l); 295 FUNCTION_CASE(entry, SharedRuntime::dcos); 296 FUNCTION_CASE(entry, SharedRuntime::dexp); 297 FUNCTION_CASE(entry, SharedRuntime::dlog); 298 FUNCTION_CASE(entry, SharedRuntime::dlog10); 299 FUNCTION_CASE(entry, SharedRuntime::dpow); 300 FUNCTION_CASE(entry, SharedRuntime::drem); 301 FUNCTION_CASE(entry, SharedRuntime::dsin); 302 FUNCTION_CASE(entry, SharedRuntime::dtan); 303 FUNCTION_CASE(entry, SharedRuntime::f2i); 304 FUNCTION_CASE(entry, SharedRuntime::f2l); 305 FUNCTION_CASE(entry, SharedRuntime::frem); 306 FUNCTION_CASE(entry, SharedRuntime::l2d); 307 FUNCTION_CASE(entry, SharedRuntime::l2f); 308 FUNCTION_CASE(entry, SharedRuntime::ldiv); 309 FUNCTION_CASE(entry, SharedRuntime::lmul); 310 FUNCTION_CASE(entry, SharedRuntime::lrem); 311 FUNCTION_CASE(entry, SharedRuntime::lrem); 312 FUNCTION_CASE(entry, SharedRuntime::dtrace_method_entry); 313 FUNCTION_CASE(entry, SharedRuntime::dtrace_method_exit); 314 FUNCTION_CASE(entry, is_instance_of); 315 FUNCTION_CASE(entry, trace_block_entry); 316 #ifdef TRACE_HAVE_INTRINSICS 317 FUNCTION_CASE(entry, TRACE_TIME_METHOD); 318 #endif 319 FUNCTION_CASE(entry, StubRoutines::updateBytesCRC32()); 320 321 #undef FUNCTION_CASE 322 323 // Soft float adds more runtime names. 324 return pd_name_for_address(entry); 325 } 326 327 328 JRT_ENTRY(void, Runtime1::new_instance(JavaThread* thread, Klass* klass)) 329 NOT_PRODUCT(_new_instance_slowcase_cnt++;) 330 331 assert(klass->is_klass(), "not a class"); 332 instanceKlassHandle h(thread, klass); 333 h->check_valid_for_instantiation(true, CHECK); 334 // make sure klass is initialized 335 h->initialize(CHECK); 336 // allocate instance and return via TLS 337 oop obj = h->allocate_instance(CHECK); 338 thread->set_vm_result(obj); 339 JRT_END 340 341 342 JRT_ENTRY(void, Runtime1::new_type_array(JavaThread* thread, Klass* klass, jint length)) 343 NOT_PRODUCT(_new_type_array_slowcase_cnt++;) 344 // Note: no handle for klass needed since they are not used 345 // anymore after new_typeArray() and no GC can happen before. 346 // (This may have to change if this code changes!) 347 assert(klass->is_klass(), "not a class"); 348 BasicType elt_type = TypeArrayKlass::cast(klass)->element_type(); 349 oop obj = oopFactory::new_typeArray(elt_type, length, CHECK); 350 thread->set_vm_result(obj); 351 // This is pretty rare but this runtime patch is stressful to deoptimization 352 // if we deoptimize here so force a deopt to stress the path. 353 if (DeoptimizeALot) { 354 deopt_caller(); 355 } 356 357 JRT_END 358 359 360 JRT_ENTRY(void, Runtime1::new_object_array(JavaThread* thread, Klass* array_klass, jint length)) 361 NOT_PRODUCT(_new_object_array_slowcase_cnt++;) 362 363 // Note: no handle for klass needed since they are not used 364 // anymore after new_objArray() and no GC can happen before. 365 // (This may have to change if this code changes!) 366 assert(array_klass->is_klass(), "not a class"); 367 Klass* elem_klass = ObjArrayKlass::cast(array_klass)->element_klass(); 368 objArrayOop obj = oopFactory::new_objArray(elem_klass, length, CHECK); 369 thread->set_vm_result(obj); 370 // This is pretty rare but this runtime patch is stressful to deoptimization 371 // if we deoptimize here so force a deopt to stress the path. 372 if (DeoptimizeALot) { 373 deopt_caller(); 374 } 375 JRT_END 376 377 378 JRT_ENTRY(void, Runtime1::new_multi_array(JavaThread* thread, Klass* klass, int rank, jint* dims)) 379 NOT_PRODUCT(_new_multi_array_slowcase_cnt++;) 380 381 assert(klass->is_klass(), "not a class"); 382 assert(rank >= 1, "rank must be nonzero"); 383 oop obj = ArrayKlass::cast(klass)->multi_allocate(rank, dims, CHECK); 384 thread->set_vm_result(obj); 385 JRT_END 386 387 388 JRT_ENTRY(void, Runtime1::unimplemented_entry(JavaThread* thread, StubID id)) 389 tty->print_cr("Runtime1::entry_for(%d) returned unimplemented entry point", id); 390 JRT_END 391 392 393 JRT_ENTRY(void, Runtime1::throw_array_store_exception(JavaThread* thread, oopDesc* obj)) 394 ResourceMark rm(thread); 395 const char* klass_name = obj->klass()->external_name(); 396 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArrayStoreException(), klass_name); 397 JRT_END 398 399 400 // counter_overflow() is called from within C1-compiled methods. The enclosing method is the method 401 // associated with the top activation record. The inlinee (that is possibly included in the enclosing 402 // method) method oop is passed as an argument. In order to do that it is embedded in the code as 403 // a constant. 404 static nmethod* counter_overflow_helper(JavaThread* THREAD, int branch_bci, Method* m) { 405 nmethod* osr_nm = NULL; 406 methodHandle method(THREAD, m); 407 408 RegisterMap map(THREAD, false); 409 frame fr = THREAD->last_frame().sender(&map); 410 nmethod* nm = (nmethod*) fr.cb(); 411 assert(nm!= NULL && nm->is_nmethod(), "Sanity check"); 412 methodHandle enclosing_method(THREAD, nm->method()); 413 414 CompLevel level = (CompLevel)nm->comp_level(); 415 int bci = InvocationEntryBci; 416 if (branch_bci != InvocationEntryBci) { 417 // Compute destination bci 418 address pc = method()->code_base() + branch_bci; 419 Bytecodes::Code branch = Bytecodes::code_at(method(), pc); 420 int offset = 0; 421 switch (branch) { 422 case Bytecodes::_if_icmplt: case Bytecodes::_iflt: 423 case Bytecodes::_if_icmpgt: case Bytecodes::_ifgt: 424 case Bytecodes::_if_icmple: case Bytecodes::_ifle: 425 case Bytecodes::_if_icmpge: case Bytecodes::_ifge: 426 case Bytecodes::_if_icmpeq: case Bytecodes::_if_acmpeq: case Bytecodes::_ifeq: 427 case Bytecodes::_if_icmpne: case Bytecodes::_if_acmpne: case Bytecodes::_ifne: 428 case Bytecodes::_ifnull: case Bytecodes::_ifnonnull: case Bytecodes::_goto: 429 offset = (int16_t)Bytes::get_Java_u2(pc + 1); 430 break; 431 case Bytecodes::_goto_w: 432 offset = Bytes::get_Java_u4(pc + 1); 433 break; 434 default: ; 435 } 436 bci = branch_bci + offset; 437 } 438 assert(!HAS_PENDING_EXCEPTION, "Should not have any exceptions pending"); 439 osr_nm = CompilationPolicy::policy()->event(enclosing_method, method, branch_bci, bci, level, nm, THREAD); 440 assert(!HAS_PENDING_EXCEPTION, "Event handler should not throw any exceptions"); 441 return osr_nm; 442 } 443 444 JRT_BLOCK_ENTRY(address, Runtime1::counter_overflow(JavaThread* thread, int bci, Method* method)) 445 nmethod* osr_nm; 446 JRT_BLOCK 447 osr_nm = counter_overflow_helper(thread, bci, method); 448 if (osr_nm != NULL) { 449 RegisterMap map(thread, false); 450 frame fr = thread->last_frame().sender(&map); 451 Deoptimization::deoptimize_frame(thread, fr.id()); 452 } 453 JRT_BLOCK_END 454 return NULL; 455 JRT_END 456 457 extern void vm_exit(int code); 458 459 // Enter this method from compiled code handler below. This is where we transition 460 // to VM mode. This is done as a helper routine so that the method called directly 461 // from compiled code does not have to transition to VM. This allows the entry 462 // method to see if the nmethod that we have just looked up a handler for has 463 // been deoptimized while we were in the vm. This simplifies the assembly code 464 // cpu directories. 465 // 466 // We are entering here from exception stub (via the entry method below) 467 // If there is a compiled exception handler in this method, we will continue there; 468 // otherwise we will unwind the stack and continue at the caller of top frame method 469 // Note: we enter in Java using a special JRT wrapper. This wrapper allows us to 470 // control the area where we can allow a safepoint. After we exit the safepoint area we can 471 // check to see if the handler we are going to return is now in a nmethod that has 472 // been deoptimized. If that is the case we return the deopt blob 473 // unpack_with_exception entry instead. This makes life for the exception blob easier 474 // because making that same check and diverting is painful from assembly language. 475 JRT_ENTRY_NO_ASYNC(static address, exception_handler_for_pc_helper(JavaThread* thread, oopDesc* ex, address pc, nmethod*& nm)) 476 // Reset method handle flag. 477 thread->set_is_method_handle_return(false); 478 479 Handle exception(thread, ex); 480 nm = CodeCache::find_nmethod(pc); 481 assert(nm != NULL, "this is not an nmethod"); 482 // Adjust the pc as needed/ 483 if (nm->is_deopt_pc(pc)) { 484 RegisterMap map(thread, false); 485 frame exception_frame = thread->last_frame().sender(&map); 486 // if the frame isn't deopted then pc must not correspond to the caller of last_frame 487 assert(exception_frame.is_deoptimized_frame(), "must be deopted"); 488 pc = exception_frame.pc(); 489 } 490 #ifdef ASSERT 491 assert(exception.not_null(), "NULL exceptions should be handled by throw_exception"); 492 assert(exception->is_oop(), "just checking"); 493 // Check that exception is a subclass of Throwable, otherwise we have a VerifyError 494 if (!(exception->is_a(SystemDictionary::Throwable_klass()))) { 495 if (ExitVMOnVerifyError) vm_exit(-1); 496 ShouldNotReachHere(); 497 } 498 #endif 499 500 // Check the stack guard pages and reenable them if necessary and there is 501 // enough space on the stack to do so. Use fast exceptions only if the guard 502 // pages are enabled. 503 bool guard_pages_enabled = thread->stack_yellow_zone_enabled(); 504 if (!guard_pages_enabled) guard_pages_enabled = thread->reguard_stack(); 505 506 if (JvmtiExport::can_post_on_exceptions()) { 507 // To ensure correct notification of exception catches and throws 508 // we have to deoptimize here. If we attempted to notify the 509 // catches and throws during this exception lookup it's possible 510 // we could deoptimize on the way out of the VM and end back in 511 // the interpreter at the throw site. This would result in double 512 // notifications since the interpreter would also notify about 513 // these same catches and throws as it unwound the frame. 514 515 RegisterMap reg_map(thread); 516 frame stub_frame = thread->last_frame(); 517 frame caller_frame = stub_frame.sender(®_map); 518 519 // We don't really want to deoptimize the nmethod itself since we 520 // can actually continue in the exception handler ourselves but I 521 // don't see an easy way to have the desired effect. 522 Deoptimization::deoptimize_frame(thread, caller_frame.id()); 523 assert(caller_is_deopted(), "Must be deoptimized"); 524 525 return SharedRuntime::deopt_blob()->unpack_with_exception_in_tls(); 526 } 527 528 // ExceptionCache is used only for exceptions at call sites and not for implicit exceptions 529 if (guard_pages_enabled) { 530 address fast_continuation = nm->handler_for_exception_and_pc(exception, pc); 531 if (fast_continuation != NULL) { 532 // Set flag if return address is a method handle call site. 533 thread->set_is_method_handle_return(nm->is_method_handle_return(pc)); 534 return fast_continuation; 535 } 536 } 537 538 // If the stack guard pages are enabled, check whether there is a handler in 539 // the current method. Otherwise (guard pages disabled), force an unwind and 540 // skip the exception cache update (i.e., just leave continuation==NULL). 541 address continuation = NULL; 542 if (guard_pages_enabled) { 543 544 // New exception handling mechanism can support inlined methods 545 // with exception handlers since the mappings are from PC to PC 546 547 // debugging support 548 // tracing 549 if (TraceExceptions) { 550 ttyLocker ttyl; 551 ResourceMark rm; 552 tty->print_cr("Exception <%s> (" INTPTR_FORMAT ") thrown in compiled method <%s> at PC " INTPTR_FORMAT " for thread " INTPTR_FORMAT "", 553 exception->print_value_string(), p2i((address)exception()), nm->method()->print_value_string(), p2i(pc), p2i(thread)); 554 } 555 // for AbortVMOnException flag 556 NOT_PRODUCT(Exceptions::debug_check_abort(exception)); 557 558 // Clear out the exception oop and pc since looking up an 559 // exception handler can cause class loading, which might throw an 560 // exception and those fields are expected to be clear during 561 // normal bytecode execution. 562 thread->clear_exception_oop_and_pc(); 563 564 Handle original_exception(thread, exception()); 565 566 continuation = SharedRuntime::compute_compiled_exc_handler(nm, pc, exception, false, false); 567 // If an exception was thrown during exception dispatch, the exception oop may have changed 568 thread->set_exception_oop(exception()); 569 thread->set_exception_pc(pc); 570 571 // the exception cache is used only by non-implicit exceptions 572 // Update the exception cache only when there didn't happen 573 // another exception during the computation of the compiled 574 // exception handler. 575 if (continuation != NULL && original_exception() == exception()) { 576 nm->add_handler_for_exception_and_pc(exception, pc, continuation); 577 } 578 } 579 580 thread->set_vm_result(exception()); 581 // Set flag if return address is a method handle call site. 582 thread->set_is_method_handle_return(nm->is_method_handle_return(pc)); 583 584 if (TraceExceptions) { 585 ttyLocker ttyl; 586 ResourceMark rm; 587 tty->print_cr("Thread " PTR_FORMAT " continuing at PC " PTR_FORMAT " for exception thrown at PC " PTR_FORMAT, 588 p2i(thread), p2i(continuation), p2i(pc)); 589 } 590 591 return continuation; 592 JRT_END 593 594 // Enter this method from compiled code only if there is a Java exception handler 595 // in the method handling the exception. 596 // We are entering here from exception stub. We don't do a normal VM transition here. 597 // We do it in a helper. This is so we can check to see if the nmethod we have just 598 // searched for an exception handler has been deoptimized in the meantime. 599 address Runtime1::exception_handler_for_pc(JavaThread* thread) { 600 oop exception = thread->exception_oop(); 601 address pc = thread->exception_pc(); 602 // Still in Java mode 603 DEBUG_ONLY(ResetNoHandleMark rnhm); 604 nmethod* nm = NULL; 605 address continuation = NULL; 606 { 607 // Enter VM mode by calling the helper 608 ResetNoHandleMark rnhm; 609 continuation = exception_handler_for_pc_helper(thread, exception, pc, nm); 610 } 611 // Back in JAVA, use no oops DON'T safepoint 612 613 // Now check to see if the nmethod we were called from is now deoptimized. 614 // If so we must return to the deopt blob and deoptimize the nmethod 615 if (nm != NULL && caller_is_deopted()) { 616 continuation = SharedRuntime::deopt_blob()->unpack_with_exception_in_tls(); 617 } 618 619 assert(continuation != NULL, "no handler found"); 620 return continuation; 621 } 622 623 624 JRT_ENTRY(void, Runtime1::throw_range_check_exception(JavaThread* thread, int index)) 625 NOT_PRODUCT(_throw_range_check_exception_count++;) 626 char message[jintAsStringSize]; 627 sprintf(message, "%d", index); 628 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArrayIndexOutOfBoundsException(), message); 629 JRT_END 630 631 632 JRT_ENTRY(void, Runtime1::throw_index_exception(JavaThread* thread, int index)) 633 NOT_PRODUCT(_throw_index_exception_count++;) 634 char message[16]; 635 sprintf(message, "%d", index); 636 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IndexOutOfBoundsException(), message); 637 JRT_END 638 639 640 JRT_ENTRY(void, Runtime1::throw_div0_exception(JavaThread* thread)) 641 NOT_PRODUCT(_throw_div0_exception_count++;) 642 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_ArithmeticException(), "/ by zero"); 643 JRT_END 644 645 646 JRT_ENTRY(void, Runtime1::throw_null_pointer_exception(JavaThread* thread)) 647 NOT_PRODUCT(_throw_null_pointer_exception_count++;) 648 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_NullPointerException()); 649 JRT_END 650 651 652 JRT_ENTRY(void, Runtime1::throw_class_cast_exception(JavaThread* thread, oopDesc* object)) 653 NOT_PRODUCT(_throw_class_cast_exception_count++;) 654 ResourceMark rm(thread); 655 char* message = SharedRuntime::generate_class_cast_message( 656 thread, object->klass()->external_name()); 657 SharedRuntime::throw_and_post_jvmti_exception( 658 thread, vmSymbols::java_lang_ClassCastException(), message); 659 JRT_END 660 661 662 JRT_ENTRY(void, Runtime1::throw_incompatible_class_change_error(JavaThread* thread)) 663 NOT_PRODUCT(_throw_incompatible_class_change_error_count++;) 664 ResourceMark rm(thread); 665 SharedRuntime::throw_and_post_jvmti_exception(thread, vmSymbols::java_lang_IncompatibleClassChangeError()); 666 JRT_END 667 668 669 JRT_ENTRY_NO_ASYNC(void, Runtime1::monitorenter(JavaThread* thread, oopDesc* obj, BasicObjectLock* lock)) 670 NOT_PRODUCT(_monitorenter_slowcase_cnt++;) 671 if (PrintBiasedLockingStatistics) { 672 Atomic::inc(BiasedLocking::slow_path_entry_count_addr()); 673 } 674 Handle h_obj(thread, obj); 675 assert(h_obj()->is_oop(), "must be NULL or an object"); 676 if (UseBiasedLocking) { 677 // Retry fast entry if bias is revoked to avoid unnecessary inflation 678 ObjectSynchronizer::fast_enter(h_obj, lock->lock(), true, CHECK); 679 } else { 680 if (UseFastLocking) { 681 // When using fast locking, the compiled code has already tried the fast case 682 assert(obj == lock->obj(), "must match"); 683 ObjectSynchronizer::slow_enter(h_obj, lock->lock(), THREAD); 684 } else { 685 lock->set_obj(obj); 686 ObjectSynchronizer::fast_enter(h_obj, lock->lock(), false, THREAD); 687 } 688 } 689 JRT_END 690 691 692 JRT_LEAF(void, Runtime1::monitorexit(JavaThread* thread, BasicObjectLock* lock)) 693 NOT_PRODUCT(_monitorexit_slowcase_cnt++;) 694 assert(thread == JavaThread::current(), "threads must correspond"); 695 assert(thread->last_Java_sp(), "last_Java_sp must be set"); 696 // monitorexit is non-blocking (leaf routine) => no exceptions can be thrown 697 EXCEPTION_MARK; 698 699 oop obj = lock->obj(); 700 assert(obj->is_oop(), "must be NULL or an object"); 701 if (UseFastLocking) { 702 // When using fast locking, the compiled code has already tried the fast case 703 ObjectSynchronizer::slow_exit(obj, lock->lock(), THREAD); 704 } else { 705 ObjectSynchronizer::fast_exit(obj, lock->lock(), THREAD); 706 } 707 JRT_END 708 709 // Cf. OptoRuntime::deoptimize_caller_frame 710 JRT_ENTRY(void, Runtime1::deoptimize(JavaThread* thread, jint trap_request)) 711 // Called from within the owner thread, so no need for safepoint 712 RegisterMap reg_map(thread, false); 713 frame stub_frame = thread->last_frame(); 714 assert(stub_frame.is_runtime_frame(), "Sanity check"); 715 frame caller_frame = stub_frame.sender(®_map); 716 nmethod* nm = caller_frame.cb()->as_nmethod_or_null(); 717 assert(nm != NULL, "Sanity check"); 718 methodHandle method(thread, nm->method()); 719 assert(nm == CodeCache::find_nmethod(caller_frame.pc()), "Should be the same"); 720 Deoptimization::DeoptAction action = Deoptimization::trap_request_action(trap_request); 721 Deoptimization::DeoptReason reason = Deoptimization::trap_request_reason(trap_request); 722 723 if (action == Deoptimization::Action_make_not_entrant) { 724 if (nm->make_not_entrant()) { 725 if (reason == Deoptimization::Reason_tenured) { 726 MethodData* trap_mdo = Deoptimization::get_method_data(thread, method, true /*create_if_missing*/); 727 if (trap_mdo != NULL) { 728 trap_mdo->inc_tenure_traps(); 729 } 730 } 731 } 732 } 733 734 // Deoptimize the caller frame. 735 Deoptimization::deoptimize_frame(thread, caller_frame.id()); 736 // Return to the now deoptimized frame. 737 JRT_END 738 739 740 #ifndef DEOPTIMIZE_WHEN_PATCHING 741 742 static Klass* resolve_field_return_klass(methodHandle caller, int bci, TRAPS) { 743 Bytecode_field field_access(caller, bci); 744 // This can be static or non-static field access 745 Bytecodes::Code code = field_access.code(); 746 747 // We must load class, initialize class and resolvethe field 748 fieldDescriptor result; // initialize class if needed 749 constantPoolHandle constants(THREAD, caller->constants()); 750 LinkResolver::resolve_field_access(result, constants, field_access.index(), Bytecodes::java_code(code), CHECK_NULL); 751 return result.field_holder(); 752 } 753 754 755 // 756 // This routine patches sites where a class wasn't loaded or 757 // initialized at the time the code was generated. It handles 758 // references to classes, fields and forcing of initialization. Most 759 // of the cases are straightforward and involving simply forcing 760 // resolution of a class, rewriting the instruction stream with the 761 // needed constant and replacing the call in this function with the 762 // patched code. The case for static field is more complicated since 763 // the thread which is in the process of initializing a class can 764 // access it's static fields but other threads can't so the code 765 // either has to deoptimize when this case is detected or execute a 766 // check that the current thread is the initializing thread. The 767 // current 768 // 769 // Patches basically look like this: 770 // 771 // 772 // patch_site: jmp patch stub ;; will be patched 773 // continue: ... 774 // ... 775 // ... 776 // ... 777 // 778 // They have a stub which looks like this: 779 // 780 // ;; patch body 781 // movl <const>, reg (for class constants) 782 // <or> movl [reg1 + <const>], reg (for field offsets) 783 // <or> movl reg, [reg1 + <const>] (for field offsets) 784 // <being_init offset> <bytes to copy> <bytes to skip> 785 // patch_stub: call Runtime1::patch_code (through a runtime stub) 786 // jmp patch_site 787 // 788 // 789 // A normal patch is done by rewriting the patch body, usually a move, 790 // and then copying it into place over top of the jmp instruction 791 // being careful to flush caches and doing it in an MP-safe way. The 792 // constants following the patch body are used to find various pieces 793 // of the patch relative to the call site for Runtime1::patch_code. 794 // The case for getstatic and putstatic is more complicated because 795 // getstatic and putstatic have special semantics when executing while 796 // the class is being initialized. getstatic/putstatic on a class 797 // which is being_initialized may be executed by the initializing 798 // thread but other threads have to block when they execute it. This 799 // is accomplished in compiled code by executing a test of the current 800 // thread against the initializing thread of the class. It's emitted 801 // as boilerplate in their stub which allows the patched code to be 802 // executed before it's copied back into the main body of the nmethod. 803 // 804 // being_init: get_thread(<tmp reg> 805 // cmpl [reg1 + <init_thread_offset>], <tmp reg> 806 // jne patch_stub 807 // movl [reg1 + <const>], reg (for field offsets) <or> 808 // movl reg, [reg1 + <const>] (for field offsets) 809 // jmp continue 810 // <being_init offset> <bytes to copy> <bytes to skip> 811 // patch_stub: jmp Runtim1::patch_code (through a runtime stub) 812 // jmp patch_site 813 // 814 // If the class is being initialized the patch body is rewritten and 815 // the patch site is rewritten to jump to being_init, instead of 816 // patch_stub. Whenever this code is executed it checks the current 817 // thread against the intializing thread so other threads will enter 818 // the runtime and end up blocked waiting the class to finish 819 // initializing inside the calls to resolve_field below. The 820 // initializing class will continue on it's way. Once the class is 821 // fully_initialized, the intializing_thread of the class becomes 822 // NULL, so the next thread to execute this code will fail the test, 823 // call into patch_code and complete the patching process by copying 824 // the patch body back into the main part of the nmethod and resume 825 // executing. 826 // 827 // 828 829 JRT_ENTRY(void, Runtime1::patch_code(JavaThread* thread, Runtime1::StubID stub_id )) 830 NOT_PRODUCT(_patch_code_slowcase_cnt++;) 831 832 ResourceMark rm(thread); 833 RegisterMap reg_map(thread, false); 834 frame runtime_frame = thread->last_frame(); 835 frame caller_frame = runtime_frame.sender(®_map); 836 837 // last java frame on stack 838 vframeStream vfst(thread, true); 839 assert(!vfst.at_end(), "Java frame must exist"); 840 841 methodHandle caller_method(THREAD, vfst.method()); 842 // Note that caller_method->code() may not be same as caller_code because of OSR's 843 // Note also that in the presence of inlining it is not guaranteed 844 // that caller_method() == caller_code->method() 845 846 int bci = vfst.bci(); 847 Bytecodes::Code code = caller_method()->java_code_at(bci); 848 849 // this is used by assertions in the access_field_patching_id 850 BasicType patch_field_type = T_ILLEGAL; 851 bool deoptimize_for_volatile = false; 852 bool deoptimize_for_atomic = false; 853 int patch_field_offset = -1; 854 KlassHandle init_klass(THREAD, NULL); // klass needed by load_klass_patching code 855 KlassHandle load_klass(THREAD, NULL); // klass needed by load_klass_patching code 856 Handle mirror(THREAD, NULL); // oop needed by load_mirror_patching code 857 Handle appendix(THREAD, NULL); // oop needed by appendix_patching code 858 bool load_klass_or_mirror_patch_id = 859 (stub_id == Runtime1::load_klass_patching_id || stub_id == Runtime1::load_mirror_patching_id); 860 861 if (stub_id == Runtime1::access_field_patching_id) { 862 863 Bytecode_field field_access(caller_method, bci); 864 fieldDescriptor result; // initialize class if needed 865 Bytecodes::Code code = field_access.code(); 866 constantPoolHandle constants(THREAD, caller_method->constants()); 867 LinkResolver::resolve_field_access(result, constants, field_access.index(), Bytecodes::java_code(code), CHECK); 868 patch_field_offset = result.offset(); 869 870 // If we're patching a field which is volatile then at compile it 871 // must not have been know to be volatile, so the generated code 872 // isn't correct for a volatile reference. The nmethod has to be 873 // deoptimized so that the code can be regenerated correctly. 874 // This check is only needed for access_field_patching since this 875 // is the path for patching field offsets. load_klass is only 876 // used for patching references to oops which don't need special 877 // handling in the volatile case. 878 879 deoptimize_for_volatile = result.access_flags().is_volatile(); 880 881 // If we are patching a field which should be atomic, then 882 // the generated code is not correct either, force deoptimizing. 883 // We need to only cover T_LONG and T_DOUBLE fields, as we can 884 // break access atomicity only for them. 885 886 // Strictly speaking, the deoptimizaation on 64-bit platforms 887 // is unnecessary, and T_LONG stores on 32-bit platforms need 888 // to be handled by special patching code when AlwaysAtomicAccesses 889 // becomes product feature. At this point, we are still going 890 // for the deoptimization for consistency against volatile 891 // accesses. 892 893 patch_field_type = result.field_type(); 894 deoptimize_for_atomic = (AlwaysAtomicAccesses && (patch_field_type == T_DOUBLE || patch_field_type == T_LONG)); 895 896 } else if (load_klass_or_mirror_patch_id) { 897 Klass* k = NULL; 898 switch (code) { 899 case Bytecodes::_putstatic: 900 case Bytecodes::_getstatic: 901 { Klass* klass = resolve_field_return_klass(caller_method, bci, CHECK); 902 init_klass = KlassHandle(THREAD, klass); 903 mirror = Handle(THREAD, klass->java_mirror()); 904 } 905 break; 906 case Bytecodes::_new: 907 { Bytecode_new bnew(caller_method(), caller_method->bcp_from(bci)); 908 k = caller_method->constants()->klass_at(bnew.index(), CHECK); 909 } 910 break; 911 case Bytecodes::_multianewarray: 912 { Bytecode_multianewarray mna(caller_method(), caller_method->bcp_from(bci)); 913 k = caller_method->constants()->klass_at(mna.index(), CHECK); 914 } 915 break; 916 case Bytecodes::_instanceof: 917 { Bytecode_instanceof io(caller_method(), caller_method->bcp_from(bci)); 918 k = caller_method->constants()->klass_at(io.index(), CHECK); 919 } 920 break; 921 case Bytecodes::_checkcast: 922 { Bytecode_checkcast cc(caller_method(), caller_method->bcp_from(bci)); 923 k = caller_method->constants()->klass_at(cc.index(), CHECK); 924 } 925 break; 926 case Bytecodes::_anewarray: 927 { Bytecode_anewarray anew(caller_method(), caller_method->bcp_from(bci)); 928 Klass* ek = caller_method->constants()->klass_at(anew.index(), CHECK); 929 k = ek->array_klass(CHECK); 930 } 931 break; 932 case Bytecodes::_ldc: 933 case Bytecodes::_ldc_w: 934 { 935 Bytecode_loadconstant cc(caller_method, bci); 936 oop m = cc.resolve_constant(CHECK); 937 mirror = Handle(THREAD, m); 938 } 939 break; 940 default: fatal("unexpected bytecode for load_klass_or_mirror_patch_id"); 941 } 942 // convert to handle 943 load_klass = KlassHandle(THREAD, k); 944 } else if (stub_id == load_appendix_patching_id) { 945 Bytecode_invoke bytecode(caller_method, bci); 946 Bytecodes::Code bc = bytecode.invoke_code(); 947 948 CallInfo info; 949 constantPoolHandle pool(thread, caller_method->constants()); 950 int index = bytecode.index(); 951 LinkResolver::resolve_invoke(info, Handle(), pool, index, bc, CHECK); 952 appendix = info.resolved_appendix(); 953 switch (bc) { 954 case Bytecodes::_invokehandle: { 955 int cache_index = ConstantPool::decode_cpcache_index(index, true); 956 assert(cache_index >= 0 && cache_index < pool->cache()->length(), "unexpected cache index"); 957 pool->cache()->entry_at(cache_index)->set_method_handle(pool, info); 958 break; 959 } 960 case Bytecodes::_invokedynamic: { 961 pool->invokedynamic_cp_cache_entry_at(index)->set_dynamic_call(pool, info); 962 break; 963 } 964 default: fatal("unexpected bytecode for load_appendix_patching_id"); 965 } 966 } else { 967 ShouldNotReachHere(); 968 } 969 970 if (deoptimize_for_volatile || deoptimize_for_atomic) { 971 // At compile time we assumed the field wasn't volatile/atomic but after 972 // loading it turns out it was volatile/atomic so we have to throw the 973 // compiled code out and let it be regenerated. 974 if (TracePatching) { 975 if (deoptimize_for_volatile) { 976 tty->print_cr("Deoptimizing for patching volatile field reference"); 977 } 978 if (deoptimize_for_atomic) { 979 tty->print_cr("Deoptimizing for patching atomic field reference"); 980 } 981 } 982 983 // It's possible the nmethod was invalidated in the last 984 // safepoint, but if it's still alive then make it not_entrant. 985 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc()); 986 if (nm != NULL) { 987 nm->make_not_entrant(); 988 } 989 990 Deoptimization::deoptimize_frame(thread, caller_frame.id()); 991 992 // Return to the now deoptimized frame. 993 } 994 995 // Now copy code back 996 997 { 998 MutexLockerEx ml_patch (Patching_lock, Mutex::_no_safepoint_check_flag); 999 // 1000 // Deoptimization may have happened while we waited for the lock. 1001 // In that case we don't bother to do any patching we just return 1002 // and let the deopt happen 1003 if (!caller_is_deopted()) { 1004 NativeGeneralJump* jump = nativeGeneralJump_at(caller_frame.pc()); 1005 address instr_pc = jump->jump_destination(); 1006 NativeInstruction* ni = nativeInstruction_at(instr_pc); 1007 if (ni->is_jump() ) { 1008 // the jump has not been patched yet 1009 // The jump destination is slow case and therefore not part of the stubs 1010 // (stubs are only for StaticCalls) 1011 1012 // format of buffer 1013 // .... 1014 // instr byte 0 <-- copy_buff 1015 // instr byte 1 1016 // .. 1017 // instr byte n-1 1018 // n 1019 // .... <-- call destination 1020 1021 address stub_location = caller_frame.pc() + PatchingStub::patch_info_offset(); 1022 unsigned char* byte_count = (unsigned char*) (stub_location - 1); 1023 unsigned char* byte_skip = (unsigned char*) (stub_location - 2); 1024 unsigned char* being_initialized_entry_offset = (unsigned char*) (stub_location - 3); 1025 address copy_buff = stub_location - *byte_skip - *byte_count; 1026 address being_initialized_entry = stub_location - *being_initialized_entry_offset; 1027 if (TracePatching) { 1028 tty->print_cr(" Patching %s at bci %d at address " INTPTR_FORMAT " (%s)", Bytecodes::name(code), bci, 1029 p2i(instr_pc), (stub_id == Runtime1::access_field_patching_id) ? "field" : "klass"); 1030 nmethod* caller_code = CodeCache::find_nmethod(caller_frame.pc()); 1031 assert(caller_code != NULL, "nmethod not found"); 1032 1033 // NOTE we use pc() not original_pc() because we already know they are 1034 // identical otherwise we'd have never entered this block of code 1035 1036 const ImmutableOopMap* map = caller_code->oop_map_for_return_address(caller_frame.pc()); 1037 assert(map != NULL, "null check"); 1038 map->print(); 1039 tty->cr(); 1040 1041 Disassembler::decode(copy_buff, copy_buff + *byte_count, tty); 1042 } 1043 // depending on the code below, do_patch says whether to copy the patch body back into the nmethod 1044 bool do_patch = true; 1045 if (stub_id == Runtime1::access_field_patching_id) { 1046 // The offset may not be correct if the class was not loaded at code generation time. 1047 // Set it now. 1048 NativeMovRegMem* n_move = nativeMovRegMem_at(copy_buff); 1049 assert(n_move->offset() == 0 || (n_move->offset() == 4 && (patch_field_type == T_DOUBLE || patch_field_type == T_LONG)), "illegal offset for type"); 1050 assert(patch_field_offset >= 0, "illegal offset"); 1051 n_move->add_offset_in_bytes(patch_field_offset); 1052 } else if (load_klass_or_mirror_patch_id) { 1053 // If a getstatic or putstatic is referencing a klass which 1054 // isn't fully initialized, the patch body isn't copied into 1055 // place until initialization is complete. In this case the 1056 // patch site is setup so that any threads besides the 1057 // initializing thread are forced to come into the VM and 1058 // block. 1059 do_patch = (code != Bytecodes::_getstatic && code != Bytecodes::_putstatic) || 1060 InstanceKlass::cast(init_klass())->is_initialized(); 1061 NativeGeneralJump* jump = nativeGeneralJump_at(instr_pc); 1062 if (jump->jump_destination() == being_initialized_entry) { 1063 assert(do_patch == true, "initialization must be complete at this point"); 1064 } else { 1065 // patch the instruction <move reg, klass> 1066 NativeMovConstReg* n_copy = nativeMovConstReg_at(copy_buff); 1067 1068 assert(n_copy->data() == 0 || 1069 n_copy->data() == (intptr_t)Universe::non_oop_word(), 1070 "illegal init value"); 1071 if (stub_id == Runtime1::load_klass_patching_id) { 1072 assert(load_klass() != NULL, "klass not set"); 1073 n_copy->set_data((intx) (load_klass())); 1074 } else { 1075 assert(mirror() != NULL, "klass not set"); 1076 // Don't need a G1 pre-barrier here since we assert above that data isn't an oop. 1077 n_copy->set_data(cast_from_oop<intx>(mirror())); 1078 } 1079 1080 if (TracePatching) { 1081 Disassembler::decode(copy_buff, copy_buff + *byte_count, tty); 1082 } 1083 } 1084 } else if (stub_id == Runtime1::load_appendix_patching_id) { 1085 NativeMovConstReg* n_copy = nativeMovConstReg_at(copy_buff); 1086 assert(n_copy->data() == 0 || 1087 n_copy->data() == (intptr_t)Universe::non_oop_word(), 1088 "illegal init value"); 1089 n_copy->set_data(cast_from_oop<intx>(appendix())); 1090 1091 if (TracePatching) { 1092 Disassembler::decode(copy_buff, copy_buff + *byte_count, tty); 1093 } 1094 } else { 1095 ShouldNotReachHere(); 1096 } 1097 1098 #if defined(SPARC) || defined(PPC) 1099 if (load_klass_or_mirror_patch_id || 1100 stub_id == Runtime1::load_appendix_patching_id) { 1101 // Update the location in the nmethod with the proper 1102 // metadata. When the code was generated, a NULL was stuffed 1103 // in the metadata table and that table needs to be update to 1104 // have the right value. On intel the value is kept 1105 // directly in the instruction instead of in the metadata 1106 // table, so set_data above effectively updated the value. 1107 nmethod* nm = CodeCache::find_nmethod(instr_pc); 1108 assert(nm != NULL, "invalid nmethod_pc"); 1109 RelocIterator mds(nm, copy_buff, copy_buff + 1); 1110 bool found = false; 1111 while (mds.next() && !found) { 1112 if (mds.type() == relocInfo::oop_type) { 1113 assert(stub_id == Runtime1::load_mirror_patching_id || 1114 stub_id == Runtime1::load_appendix_patching_id, "wrong stub id"); 1115 oop_Relocation* r = mds.oop_reloc(); 1116 oop* oop_adr = r->oop_addr(); 1117 *oop_adr = stub_id == Runtime1::load_mirror_patching_id ? mirror() : appendix(); 1118 r->fix_oop_relocation(); 1119 found = true; 1120 } else if (mds.type() == relocInfo::metadata_type) { 1121 assert(stub_id == Runtime1::load_klass_patching_id, "wrong stub id"); 1122 metadata_Relocation* r = mds.metadata_reloc(); 1123 Metadata** metadata_adr = r->metadata_addr(); 1124 *metadata_adr = load_klass(); 1125 r->fix_metadata_relocation(); 1126 found = true; 1127 } 1128 } 1129 assert(found, "the metadata must exist!"); 1130 } 1131 #endif 1132 if (do_patch) { 1133 // replace instructions 1134 // first replace the tail, then the call 1135 #ifdef ARM 1136 if((load_klass_or_mirror_patch_id || 1137 stub_id == Runtime1::load_appendix_patching_id) && 1138 nativeMovConstReg_at(copy_buff)->is_pc_relative()) { 1139 nmethod* nm = CodeCache::find_nmethod(instr_pc); 1140 address addr = NULL; 1141 assert(nm != NULL, "invalid nmethod_pc"); 1142 RelocIterator mds(nm, copy_buff, copy_buff + 1); 1143 while (mds.next()) { 1144 if (mds.type() == relocInfo::oop_type) { 1145 assert(stub_id == Runtime1::load_mirror_patching_id || 1146 stub_id == Runtime1::load_appendix_patching_id, "wrong stub id"); 1147 oop_Relocation* r = mds.oop_reloc(); 1148 addr = (address)r->oop_addr(); 1149 break; 1150 } else if (mds.type() == relocInfo::metadata_type) { 1151 assert(stub_id == Runtime1::load_klass_patching_id, "wrong stub id"); 1152 metadata_Relocation* r = mds.metadata_reloc(); 1153 addr = (address)r->metadata_addr(); 1154 break; 1155 } 1156 } 1157 assert(addr != NULL, "metadata relocation must exist"); 1158 copy_buff -= *byte_count; 1159 NativeMovConstReg* n_copy2 = nativeMovConstReg_at(copy_buff); 1160 n_copy2->set_pc_relative_offset(addr, instr_pc); 1161 } 1162 #endif 1163 1164 for (int i = NativeCall::instruction_size; i < *byte_count; i++) { 1165 address ptr = copy_buff + i; 1166 int a_byte = (*ptr) & 0xFF; 1167 address dst = instr_pc + i; 1168 *(unsigned char*)dst = (unsigned char) a_byte; 1169 } 1170 ICache::invalidate_range(instr_pc, *byte_count); 1171 NativeGeneralJump::replace_mt_safe(instr_pc, copy_buff); 1172 1173 if (load_klass_or_mirror_patch_id || 1174 stub_id == Runtime1::load_appendix_patching_id) { 1175 relocInfo::relocType rtype = 1176 (stub_id == Runtime1::load_klass_patching_id) ? 1177 relocInfo::metadata_type : 1178 relocInfo::oop_type; 1179 // update relocInfo to metadata 1180 nmethod* nm = CodeCache::find_nmethod(instr_pc); 1181 assert(nm != NULL, "invalid nmethod_pc"); 1182 1183 // The old patch site is now a move instruction so update 1184 // the reloc info so that it will get updated during 1185 // future GCs. 1186 RelocIterator iter(nm, (address)instr_pc, (address)(instr_pc + 1)); 1187 relocInfo::change_reloc_info_for_address(&iter, (address) instr_pc, 1188 relocInfo::none, rtype); 1189 #ifdef SPARC 1190 // Sparc takes two relocations for an metadata so update the second one. 1191 address instr_pc2 = instr_pc + NativeMovConstReg::add_offset; 1192 RelocIterator iter2(nm, instr_pc2, instr_pc2 + 1); 1193 relocInfo::change_reloc_info_for_address(&iter2, (address) instr_pc2, 1194 relocInfo::none, rtype); 1195 #endif 1196 #ifdef PPC 1197 { address instr_pc2 = instr_pc + NativeMovConstReg::lo_offset; 1198 RelocIterator iter2(nm, instr_pc2, instr_pc2 + 1); 1199 relocInfo::change_reloc_info_for_address(&iter2, (address) instr_pc2, 1200 relocInfo::none, rtype); 1201 } 1202 #endif 1203 } 1204 1205 } else { 1206 ICache::invalidate_range(copy_buff, *byte_count); 1207 NativeGeneralJump::insert_unconditional(instr_pc, being_initialized_entry); 1208 } 1209 } 1210 } 1211 } 1212 1213 // If we are patching in a non-perm oop, make sure the nmethod 1214 // is on the right list. 1215 if (ScavengeRootsInCode && ((mirror.not_null() && mirror()->is_scavengable()) || 1216 (appendix.not_null() && appendix->is_scavengable()))) { 1217 MutexLockerEx ml_code (CodeCache_lock, Mutex::_no_safepoint_check_flag); 1218 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc()); 1219 guarantee(nm != NULL, "only nmethods can contain non-perm oops"); 1220 if (!nm->on_scavenge_root_list()) { 1221 CodeCache::add_scavenge_root_nmethod(nm); 1222 } 1223 1224 // Since we've patched some oops in the nmethod, 1225 // (re)register it with the heap. 1226 Universe::heap()->register_nmethod(nm); 1227 } 1228 JRT_END 1229 1230 #else // DEOPTIMIZE_WHEN_PATCHING 1231 1232 JRT_ENTRY(void, Runtime1::patch_code(JavaThread* thread, Runtime1::StubID stub_id )) 1233 RegisterMap reg_map(thread, false); 1234 1235 NOT_PRODUCT(_patch_code_slowcase_cnt++;) 1236 if (TracePatching) { 1237 tty->print_cr("Deoptimizing because patch is needed"); 1238 } 1239 1240 frame runtime_frame = thread->last_frame(); 1241 frame caller_frame = runtime_frame.sender(®_map); 1242 1243 // It's possible the nmethod was invalidated in the last 1244 // safepoint, but if it's still alive then make it not_entrant. 1245 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc()); 1246 if (nm != NULL) { 1247 nm->make_not_entrant(); 1248 } 1249 1250 Deoptimization::deoptimize_frame(thread, caller_frame.id()); 1251 1252 // Return to the now deoptimized frame. 1253 JRT_END 1254 1255 #endif // DEOPTIMIZE_WHEN_PATCHING 1256 1257 // 1258 // Entry point for compiled code. We want to patch a nmethod. 1259 // We don't do a normal VM transition here because we want to 1260 // know after the patching is complete and any safepoint(s) are taken 1261 // if the calling nmethod was deoptimized. We do this by calling a 1262 // helper method which does the normal VM transition and when it 1263 // completes we can check for deoptimization. This simplifies the 1264 // assembly code in the cpu directories. 1265 // 1266 int Runtime1::move_klass_patching(JavaThread* thread) { 1267 // 1268 // NOTE: we are still in Java 1269 // 1270 Thread* THREAD = thread; 1271 debug_only(NoHandleMark nhm;) 1272 { 1273 // Enter VM mode 1274 1275 ResetNoHandleMark rnhm; 1276 patch_code(thread, load_klass_patching_id); 1277 } 1278 // Back in JAVA, use no oops DON'T safepoint 1279 1280 // Return true if calling code is deoptimized 1281 1282 return caller_is_deopted(); 1283 } 1284 1285 int Runtime1::move_mirror_patching(JavaThread* thread) { 1286 // 1287 // NOTE: we are still in Java 1288 // 1289 Thread* THREAD = thread; 1290 debug_only(NoHandleMark nhm;) 1291 { 1292 // Enter VM mode 1293 1294 ResetNoHandleMark rnhm; 1295 patch_code(thread, load_mirror_patching_id); 1296 } 1297 // Back in JAVA, use no oops DON'T safepoint 1298 1299 // Return true if calling code is deoptimized 1300 1301 return caller_is_deopted(); 1302 } 1303 1304 int Runtime1::move_appendix_patching(JavaThread* thread) { 1305 // 1306 // NOTE: we are still in Java 1307 // 1308 Thread* THREAD = thread; 1309 debug_only(NoHandleMark nhm;) 1310 { 1311 // Enter VM mode 1312 1313 ResetNoHandleMark rnhm; 1314 patch_code(thread, load_appendix_patching_id); 1315 } 1316 // Back in JAVA, use no oops DON'T safepoint 1317 1318 // Return true if calling code is deoptimized 1319 1320 return caller_is_deopted(); 1321 } 1322 // 1323 // Entry point for compiled code. We want to patch a nmethod. 1324 // We don't do a normal VM transition here because we want to 1325 // know after the patching is complete and any safepoint(s) are taken 1326 // if the calling nmethod was deoptimized. We do this by calling a 1327 // helper method which does the normal VM transition and when it 1328 // completes we can check for deoptimization. This simplifies the 1329 // assembly code in the cpu directories. 1330 // 1331 1332 int Runtime1::access_field_patching(JavaThread* thread) { 1333 // 1334 // NOTE: we are still in Java 1335 // 1336 Thread* THREAD = thread; 1337 debug_only(NoHandleMark nhm;) 1338 { 1339 // Enter VM mode 1340 1341 ResetNoHandleMark rnhm; 1342 patch_code(thread, access_field_patching_id); 1343 } 1344 // Back in JAVA, use no oops DON'T safepoint 1345 1346 // Return true if calling code is deoptimized 1347 1348 return caller_is_deopted(); 1349 JRT_END 1350 1351 1352 JRT_LEAF(void, Runtime1::trace_block_entry(jint block_id)) 1353 // for now we just print out the block id 1354 tty->print("%d ", block_id); 1355 JRT_END 1356 1357 1358 // Array copy return codes. 1359 enum { 1360 ac_failed = -1, // arraycopy failed 1361 ac_ok = 0 // arraycopy succeeded 1362 }; 1363 1364 1365 // Below length is the # elements copied. 1366 template <class T> int obj_arraycopy_work(oopDesc* src, T* src_addr, 1367 oopDesc* dst, T* dst_addr, 1368 int length) { 1369 1370 // For performance reasons, we assume we are using a card marking write 1371 // barrier. The assert will fail if this is not the case. 1372 // Note that we use the non-virtual inlineable variant of write_ref_array. 1373 BarrierSet* bs = Universe::heap()->barrier_set(); 1374 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); 1375 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well."); 1376 if (src == dst) { 1377 // same object, no check 1378 bs->write_ref_array_pre(dst_addr, length); 1379 Copy::conjoint_oops_atomic(src_addr, dst_addr, length); 1380 bs->write_ref_array((HeapWord*)dst_addr, length); 1381 return ac_ok; 1382 } else { 1383 Klass* bound = ObjArrayKlass::cast(dst->klass())->element_klass(); 1384 Klass* stype = ObjArrayKlass::cast(src->klass())->element_klass(); 1385 if (stype == bound || stype->is_subtype_of(bound)) { 1386 // Elements are guaranteed to be subtypes, so no check necessary 1387 bs->write_ref_array_pre(dst_addr, length); 1388 Copy::conjoint_oops_atomic(src_addr, dst_addr, length); 1389 bs->write_ref_array((HeapWord*)dst_addr, length); 1390 return ac_ok; 1391 } 1392 } 1393 return ac_failed; 1394 } 1395 1396 // fast and direct copy of arrays; returning -1, means that an exception may be thrown 1397 // and we did not copy anything 1398 JRT_LEAF(int, Runtime1::arraycopy(oopDesc* src, int src_pos, oopDesc* dst, int dst_pos, int length)) 1399 #ifndef PRODUCT 1400 _generic_arraycopy_cnt++; // Slow-path oop array copy 1401 #endif 1402 1403 if (src == NULL || dst == NULL || src_pos < 0 || dst_pos < 0 || length < 0) return ac_failed; 1404 if (!dst->is_array() || !src->is_array()) return ac_failed; 1405 if ((unsigned int) arrayOop(src)->length() < (unsigned int)src_pos + (unsigned int)length) return ac_failed; 1406 if ((unsigned int) arrayOop(dst)->length() < (unsigned int)dst_pos + (unsigned int)length) return ac_failed; 1407 1408 if (length == 0) return ac_ok; 1409 if (src->is_typeArray()) { 1410 Klass* klass_oop = src->klass(); 1411 if (klass_oop != dst->klass()) return ac_failed; 1412 TypeArrayKlass* klass = TypeArrayKlass::cast(klass_oop); 1413 const int l2es = klass->log2_element_size(); 1414 const int ihs = klass->array_header_in_bytes() / wordSize; 1415 char* src_addr = (char*) ((oopDesc**)src + ihs) + (src_pos << l2es); 1416 char* dst_addr = (char*) ((oopDesc**)dst + ihs) + (dst_pos << l2es); 1417 // Potential problem: memmove is not guaranteed to be word atomic 1418 // Revisit in Merlin 1419 memmove(dst_addr, src_addr, length << l2es); 1420 return ac_ok; 1421 } else if (src->is_objArray() && dst->is_objArray()) { 1422 if (UseCompressedOops) { 1423 narrowOop *src_addr = objArrayOop(src)->obj_at_addr<narrowOop>(src_pos); 1424 narrowOop *dst_addr = objArrayOop(dst)->obj_at_addr<narrowOop>(dst_pos); 1425 return obj_arraycopy_work(src, src_addr, dst, dst_addr, length); 1426 } else { 1427 oop *src_addr = objArrayOop(src)->obj_at_addr<oop>(src_pos); 1428 oop *dst_addr = objArrayOop(dst)->obj_at_addr<oop>(dst_pos); 1429 return obj_arraycopy_work(src, src_addr, dst, dst_addr, length); 1430 } 1431 } 1432 return ac_failed; 1433 JRT_END 1434 1435 1436 JRT_LEAF(void, Runtime1::primitive_arraycopy(HeapWord* src, HeapWord* dst, int length)) 1437 #ifndef PRODUCT 1438 _primitive_arraycopy_cnt++; 1439 #endif 1440 1441 if (length == 0) return; 1442 // Not guaranteed to be word atomic, but that doesn't matter 1443 // for anything but an oop array, which is covered by oop_arraycopy. 1444 Copy::conjoint_jbytes(src, dst, length); 1445 JRT_END 1446 1447 JRT_LEAF(void, Runtime1::oop_arraycopy(HeapWord* src, HeapWord* dst, int num)) 1448 #ifndef PRODUCT 1449 _oop_arraycopy_cnt++; 1450 #endif 1451 1452 if (num == 0) return; 1453 BarrierSet* bs = Universe::heap()->barrier_set(); 1454 assert(bs->has_write_ref_array_opt(), "Barrier set must have ref array opt"); 1455 assert(bs->has_write_ref_array_pre_opt(), "For pre-barrier as well."); 1456 if (UseCompressedOops) { 1457 bs->write_ref_array_pre((narrowOop*)dst, num); 1458 Copy::conjoint_oops_atomic((narrowOop*) src, (narrowOop*) dst, num); 1459 } else { 1460 bs->write_ref_array_pre((oop*)dst, num); 1461 Copy::conjoint_oops_atomic((oop*) src, (oop*) dst, num); 1462 } 1463 bs->write_ref_array(dst, num); 1464 JRT_END 1465 1466 1467 JRT_LEAF(int, Runtime1::is_instance_of(oopDesc* mirror, oopDesc* obj)) 1468 // had to return int instead of bool, otherwise there may be a mismatch 1469 // between the C calling convention and the Java one. 1470 // e.g., on x86, GCC may clear only %al when returning a bool false, but 1471 // JVM takes the whole %eax as the return value, which may misinterpret 1472 // the return value as a boolean true. 1473 1474 assert(mirror != NULL, "should null-check on mirror before calling"); 1475 Klass* k = java_lang_Class::as_Klass(mirror); 1476 return (k != NULL && obj != NULL && obj->is_a(k)) ? 1 : 0; 1477 JRT_END 1478 1479 JRT_ENTRY(void, Runtime1::predicate_failed_trap(JavaThread* thread)) 1480 ResourceMark rm; 1481 1482 assert(!TieredCompilation, "incompatible with tiered compilation"); 1483 1484 RegisterMap reg_map(thread, false); 1485 frame runtime_frame = thread->last_frame(); 1486 frame caller_frame = runtime_frame.sender(®_map); 1487 1488 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc()); 1489 assert (nm != NULL, "no more nmethod?"); 1490 nm->make_not_entrant(); 1491 1492 methodHandle m(nm->method()); 1493 MethodData* mdo = m->method_data(); 1494 1495 if (mdo == NULL && !HAS_PENDING_EXCEPTION) { 1496 // Build an MDO. Ignore errors like OutOfMemory; 1497 // that simply means we won't have an MDO to update. 1498 Method::build_interpreter_method_data(m, THREAD); 1499 if (HAS_PENDING_EXCEPTION) { 1500 assert((PENDING_EXCEPTION->is_a(SystemDictionary::OutOfMemoryError_klass())), "we expect only an OOM error here"); 1501 CLEAR_PENDING_EXCEPTION; 1502 } 1503 mdo = m->method_data(); 1504 } 1505 1506 if (mdo != NULL) { 1507 mdo->inc_trap_count(Deoptimization::Reason_none); 1508 } 1509 1510 if (TracePredicateFailedTraps) { 1511 stringStream ss1, ss2; 1512 vframeStream vfst(thread); 1513 methodHandle inlinee = methodHandle(vfst.method()); 1514 inlinee->print_short_name(&ss1); 1515 m->print_short_name(&ss2); 1516 tty->print_cr("Predicate failed trap in method %s at bci %d inlined in %s at pc " INTPTR_FORMAT, ss1.as_string(), vfst.bci(), ss2.as_string(), p2i(caller_frame.pc())); 1517 } 1518 1519 1520 Deoptimization::deoptimize_frame(thread, caller_frame.id()); 1521 1522 JRT_END 1523 1524 #ifndef PRODUCT 1525 void Runtime1::print_statistics() { 1526 tty->print_cr("C1 Runtime statistics:"); 1527 tty->print_cr(" _resolve_invoke_virtual_cnt: %d", SharedRuntime::_resolve_virtual_ctr); 1528 tty->print_cr(" _resolve_invoke_opt_virtual_cnt: %d", SharedRuntime::_resolve_opt_virtual_ctr); 1529 tty->print_cr(" _resolve_invoke_static_cnt: %d", SharedRuntime::_resolve_static_ctr); 1530 tty->print_cr(" _handle_wrong_method_cnt: %d", SharedRuntime::_wrong_method_ctr); 1531 tty->print_cr(" _ic_miss_cnt: %d", SharedRuntime::_ic_miss_ctr); 1532 tty->print_cr(" _generic_arraycopy_cnt: %d", _generic_arraycopy_cnt); 1533 tty->print_cr(" _generic_arraycopystub_cnt: %d", _generic_arraycopystub_cnt); 1534 tty->print_cr(" _byte_arraycopy_cnt: %d", _byte_arraycopy_stub_cnt); 1535 tty->print_cr(" _short_arraycopy_cnt: %d", _short_arraycopy_stub_cnt); 1536 tty->print_cr(" _int_arraycopy_cnt: %d", _int_arraycopy_stub_cnt); 1537 tty->print_cr(" _long_arraycopy_cnt: %d", _long_arraycopy_stub_cnt); 1538 tty->print_cr(" _primitive_arraycopy_cnt: %d", _primitive_arraycopy_cnt); 1539 tty->print_cr(" _oop_arraycopy_cnt (C): %d", Runtime1::_oop_arraycopy_cnt); 1540 tty->print_cr(" _oop_arraycopy_cnt (stub): %d", _oop_arraycopy_stub_cnt); 1541 tty->print_cr(" _arraycopy_slowcase_cnt: %d", _arraycopy_slowcase_cnt); 1542 tty->print_cr(" _arraycopy_checkcast_cnt: %d", _arraycopy_checkcast_cnt); 1543 tty->print_cr(" _arraycopy_checkcast_attempt_cnt:%d", _arraycopy_checkcast_attempt_cnt); 1544 1545 tty->print_cr(" _new_type_array_slowcase_cnt: %d", _new_type_array_slowcase_cnt); 1546 tty->print_cr(" _new_object_array_slowcase_cnt: %d", _new_object_array_slowcase_cnt); 1547 tty->print_cr(" _new_instance_slowcase_cnt: %d", _new_instance_slowcase_cnt); 1548 tty->print_cr(" _new_multi_array_slowcase_cnt: %d", _new_multi_array_slowcase_cnt); 1549 tty->print_cr(" _monitorenter_slowcase_cnt: %d", _monitorenter_slowcase_cnt); 1550 tty->print_cr(" _monitorexit_slowcase_cnt: %d", _monitorexit_slowcase_cnt); 1551 tty->print_cr(" _patch_code_slowcase_cnt: %d", _patch_code_slowcase_cnt); 1552 1553 tty->print_cr(" _throw_range_check_exception_count: %d:", _throw_range_check_exception_count); 1554 tty->print_cr(" _throw_index_exception_count: %d:", _throw_index_exception_count); 1555 tty->print_cr(" _throw_div0_exception_count: %d:", _throw_div0_exception_count); 1556 tty->print_cr(" _throw_null_pointer_exception_count: %d:", _throw_null_pointer_exception_count); 1557 tty->print_cr(" _throw_class_cast_exception_count: %d:", _throw_class_cast_exception_count); 1558 tty->print_cr(" _throw_incompatible_class_change_error_count: %d:", _throw_incompatible_class_change_error_count); 1559 tty->print_cr(" _throw_array_store_exception_count: %d:", _throw_array_store_exception_count); 1560 tty->print_cr(" _throw_count: %d:", _throw_count); 1561 1562 SharedRuntime::print_ic_miss_histogram(); 1563 tty->cr(); 1564 } 1565 #endif // PRODUCT