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