20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "asm/codeBuffer.hpp"
26 #include "c1/c1_CodeStubs.hpp"
27 #include "c1/c1_Defs.hpp"
28 #include "c1/c1_LIRAssembler.hpp"
29 #include "c1/c1_MacroAssembler.hpp"
30 #include "c1/c1_Runtime1.hpp"
31 #include "classfile/javaClasses.inline.hpp"
32 #include "classfile/vmClasses.hpp"
33 #include "classfile/vmSymbols.hpp"
34 #include "code/aotCodeCache.hpp"
35 #include "code/codeBlob.hpp"
36 #include "code/compiledIC.hpp"
37 #include "code/scopeDesc.hpp"
38 #include "code/vtableStubs.hpp"
39 #include "compiler/compilationPolicy.hpp"
40 #include "compiler/disassembler.hpp"
41 #include "compiler/oopMap.hpp"
42 #include "gc/shared/barrierSet.hpp"
43 #include "gc/shared/c1/barrierSetC1.hpp"
44 #include "gc/shared/collectedHeap.hpp"
45 #include "interpreter/bytecode.hpp"
46 #include "interpreter/interpreter.hpp"
47 #include "jfr/support/jfrIntrinsics.hpp"
48 #include "logging/log.hpp"
49 #include "memory/oopFactory.hpp"
50 #include "memory/resourceArea.hpp"
51 #include "memory/universe.hpp"
52 #include "oops/access.inline.hpp"
53 #include "oops/objArrayKlass.hpp"
54 #include "oops/objArrayOop.inline.hpp"
55 #include "oops/oop.inline.hpp"
56 #include "prims/jvmtiExport.hpp"
57 #include "runtime/atomicAccess.hpp"
58 #include "runtime/fieldDescriptor.inline.hpp"
59 #include "runtime/frame.inline.hpp"
60 #include "runtime/handles.inline.hpp"
61 #include "runtime/interfaceSupport.inline.hpp"
62 #include "runtime/javaCalls.hpp"
63 #include "runtime/sharedRuntime.hpp"
64 #include "runtime/stackWatermarkSet.hpp"
65 #include "runtime/stubInfo.hpp"
66 #include "runtime/stubRoutines.hpp"
67 #include "runtime/vframe.inline.hpp"
68 #include "runtime/vframeArray.hpp"
69 #include "runtime/vm_version.hpp"
70 #include "utilities/copy.hpp"
71 #include "utilities/events.hpp"
72
73
74 // Implementation of StubAssembler
75
76 StubAssembler::StubAssembler(CodeBuffer* code, const char * name, int stub_id) : C1_MacroAssembler(code) {
77 _name = name;
78 _must_gc_arguments = false;
79 _frame_size = no_frame_size;
80 _num_rt_args = 0;
81 _stub_id = stub_id;
82 }
83
84
85 void StubAssembler::set_info(const char* name, bool must_gc_arguments) {
86 _name = name;
87 _must_gc_arguments = must_gc_arguments;
88 }
89
252 case StubId::c1_slow_subtype_check_id:
253 case StubId::c1_fpu2long_stub_id:
254 case StubId::c1_unwind_exception_id:
255 case StubId::c1_counter_overflow_id:
256 case StubId::c1_is_instance_of_id:
257 expect_oop_map = false;
258 break;
259 default:
260 break;
261 }
262 #endif
263 C1StubAssemblerCodeGenClosure cl(id);
264 CodeBlob* blob = generate_blob(buffer_blob, id, name_for(id), expect_oop_map, &cl);
265 // install blob
266 int idx = StubInfo::c1_offset(id); // will assert on non-c1 id
267 _blobs[idx] = blob;
268 return blob != nullptr;
269 }
270
271 bool Runtime1::initialize(BufferBlob* blob) {
272 // platform-dependent initialization
273 initialize_pd();
274 // iterate blobs in C1 group and generate a single stub per blob
275 StubId id = StubInfo::stub_base(StubGroup::C1);
276 StubId limit = StubInfo::next(StubInfo::stub_max(StubGroup::C1));
277 for (; id != limit; id = StubInfo::next(id)) {
278 if (!generate_blob_for(blob, id)) {
279 return false;
280 }
281 if (id == StubId::c1_forward_exception_id) {
282 // publish early c1 stubs at this point so later stubs can refer to them
283 AOTCodeCache::init_early_c1_table();
284 }
285 }
286 // printing
287 #ifndef PRODUCT
288 if (PrintSimpleStubs) {
289 ResourceMark rm;
290 id = StubInfo::stub_base(StubGroup::C1);
291 for (; id != limit; id = StubInfo::next(id)) {
351 FUNCTION_CASE(entry, trace_block_entry);
352 #ifdef JFR_HAVE_INTRINSICS
353 FUNCTION_CASE(entry, JfrTime::time_function());
354 #endif
355 FUNCTION_CASE(entry, StubRoutines::updateBytesCRC32());
356 FUNCTION_CASE(entry, StubRoutines::updateBytesCRC32C());
357 FUNCTION_CASE(entry, StubRoutines::vectorizedMismatch());
358 FUNCTION_CASE(entry, StubRoutines::dexp());
359 FUNCTION_CASE(entry, StubRoutines::dlog());
360 FUNCTION_CASE(entry, StubRoutines::dlog10());
361 FUNCTION_CASE(entry, StubRoutines::dpow());
362 FUNCTION_CASE(entry, StubRoutines::dsin());
363 FUNCTION_CASE(entry, StubRoutines::dcos());
364 FUNCTION_CASE(entry, StubRoutines::dtan());
365 FUNCTION_CASE(entry, StubRoutines::dsinh());
366 FUNCTION_CASE(entry, StubRoutines::dtanh());
367 FUNCTION_CASE(entry, StubRoutines::dcbrt());
368
369 #undef FUNCTION_CASE
370
371 // Soft float adds more runtime names.
372 return pd_name_for_address(entry);
373 }
374
375
376 JRT_ENTRY(void, Runtime1::new_instance(JavaThread* current, Klass* klass))
377 #ifndef PRODUCT
378 if (PrintC1Statistics) {
379 _new_instance_slowcase_cnt++;
380 }
381 #endif
382 assert(klass->is_klass(), "not a class");
383 Handle holder(current, klass->klass_holder()); // keep the klass alive
384 InstanceKlass* h = InstanceKlass::cast(klass);
385 h->check_valid_for_instantiation(true, CHECK);
386 // make sure klass is initialized
387 h->initialize(CHECK);
388 // allocate instance and return via TLS
389 oop obj = h->allocate_instance(CHECK);
390 current->set_vm_result_oop(obj);
391 JRT_END
392
393
394 JRT_ENTRY(void, Runtime1::new_type_array(JavaThread* current, Klass* klass, jint length))
395 #ifndef PRODUCT
396 if (PrintC1Statistics) {
397 _new_type_array_slowcase_cnt++;
398 }
399 #endif
400 // Note: no handle for klass needed since they are not used
401 // anymore after new_typeArray() and no GC can happen before.
402 // (This may have to change if this code changes!)
403 assert(klass->is_klass(), "not a class");
404 BasicType elt_type = TypeArrayKlass::cast(klass)->element_type();
405 oop obj = oopFactory::new_typeArray(elt_type, length, CHECK);
406 current->set_vm_result_oop(obj);
407 // This is pretty rare but this runtime patch is stressful to deoptimization
408 // if we deoptimize here so force a deopt to stress the path.
409 if (DeoptimizeALot) {
410 deopt_caller(current);
411 }
412
413 JRT_END
414
415
416 JRT_ENTRY(void, Runtime1::new_object_array(JavaThread* current, Klass* array_klass, jint length))
417 #ifndef PRODUCT
418 if (PrintC1Statistics) {
419 _new_object_array_slowcase_cnt++;
420 }
421 #endif
422 // Note: no handle for klass needed since they are not used
423 // anymore after new_objArray() and no GC can happen before.
424 // (This may have to change if this code changes!)
425 assert(array_klass->is_klass(), "not a class");
426 Handle holder(current, array_klass->klass_holder()); // keep the klass alive
427 Klass* elem_klass = ObjArrayKlass::cast(array_klass)->element_klass();
428 objArrayOop obj = oopFactory::new_objArray(elem_klass, length, CHECK);
429 current->set_vm_result_oop(obj);
430 // This is pretty rare but this runtime patch is stressful to deoptimization
431 // if we deoptimize here so force a deopt to stress the path.
432 if (DeoptimizeALot) {
433 deopt_caller(current);
434 }
435 JRT_END
436
437
438 JRT_ENTRY(void, Runtime1::new_multi_array(JavaThread* current, Klass* klass, int rank, jint* dims))
439 #ifndef PRODUCT
440 if (PrintC1Statistics) {
441 _new_multi_array_slowcase_cnt++;
442 }
443 #endif
444 assert(klass->is_klass(), "not a class");
445 assert(rank >= 1, "rank must be nonzero");
446 Handle holder(current, klass->klass_holder()); // keep the klass alive
447 oop obj = ArrayKlass::cast(klass)->multi_allocate(rank, dims, CHECK);
448 current->set_vm_result_oop(obj);
449 JRT_END
450
451
452 JRT_ENTRY(void, Runtime1::unimplemented_entry(JavaThread* current, StubId id))
453 tty->print_cr("Runtime1::entry_for(%d) returned unimplemented entry point", (int)id);
454 JRT_END
455
456
457 JRT_ENTRY(void, Runtime1::throw_array_store_exception(JavaThread* current, oopDesc* obj))
458 ResourceMark rm(current);
489 case Bytecodes::_if_icmplt: case Bytecodes::_iflt:
490 case Bytecodes::_if_icmpgt: case Bytecodes::_ifgt:
491 case Bytecodes::_if_icmple: case Bytecodes::_ifle:
492 case Bytecodes::_if_icmpge: case Bytecodes::_ifge:
493 case Bytecodes::_if_icmpeq: case Bytecodes::_if_acmpeq: case Bytecodes::_ifeq:
494 case Bytecodes::_if_icmpne: case Bytecodes::_if_acmpne: case Bytecodes::_ifne:
495 case Bytecodes::_ifnull: case Bytecodes::_ifnonnull: case Bytecodes::_goto:
496 offset = (int16_t)Bytes::get_Java_u2(pc + 1);
497 break;
498 case Bytecodes::_goto_w:
499 offset = Bytes::get_Java_u4(pc + 1);
500 break;
501 default: ;
502 }
503 bci = branch_bci + offset;
504 }
505 osr_nm = CompilationPolicy::event(enclosing_method, method, branch_bci, bci, level, nm, current);
506 return osr_nm;
507 }
508
509 JRT_BLOCK_ENTRY(address, Runtime1::counter_overflow(JavaThread* current, int bci, Method* method))
510 nmethod* osr_nm;
511 JRT_BLOCK_NO_ASYNC
512 osr_nm = counter_overflow_helper(current, bci, method);
513 if (osr_nm != nullptr) {
514 RegisterMap map(current,
515 RegisterMap::UpdateMap::skip,
516 RegisterMap::ProcessFrames::include,
517 RegisterMap::WalkContinuation::skip);
518 frame fr = current->last_frame().sender(&map);
519 Deoptimization::deoptimize_frame(current, fr.id());
520 }
521 JRT_BLOCK_END
522 return nullptr;
523 JRT_END
524
525 extern void vm_exit(int code);
526
527 // Enter this method from compiled code handler below. This is where we transition
528 // to VM mode. This is done as a helper routine so that the method called directly
529 // from compiled code does not have to transition to VM. This allows the entry
530 // method to see if the nmethod that we have just looked up a handler for has
531 // been deoptimized while we were in the vm. This simplifies the assembly code
532 // cpu directories.
533 //
534 // We are entering here from exception stub (via the entry method below)
535 // If there is a compiled exception handler in this method, we will continue there;
536 // otherwise we will unwind the stack and continue at the caller of top frame method
537 // Note: we enter in Java using a special JRT wrapper. This wrapper allows us to
538 // control the area where we can allow a safepoint. After we exit the safepoint area we can
539 // check to see if the handler we are going to return is now in a nmethod that has
540 // been deoptimized. If that is the case we return the deopt blob
541 // unpack_with_exception entry instead. This makes life for the exception blob easier
542 // because making that same check and diverting is painful from assembly language.
543 JRT_ENTRY_NO_ASYNC(static address, exception_handler_for_pc_helper(JavaThread* current, oopDesc* ex, address pc, nmethod*& nm))
544 MACOS_AARCH64_ONLY(current->wx_enable_write());
545 Handle exception(current, ex);
546
547 // This function is called when we are about to throw an exception. Therefore,
548 // we have to poll the stack watermark barrier to make sure that not yet safe
549 // stack frames are made safe before returning into them.
550 if (current->last_frame().cb() == Runtime1::blob_for(StubId::c1_handle_exception_from_callee_id)) {
551 // The StubId::c1_handle_exception_from_callee_id handler is invoked after the
552 // frame has been unwound. It instead builds its own stub frame, to call the
553 // runtime. But the throwing frame has already been unwound here.
554 StackWatermarkSet::after_unwind(current);
555 }
556
557 nm = CodeCache::find_nmethod(pc);
558 assert(nm != nullptr, "this is not an nmethod");
559 // Adjust the pc as needed/
560 if (nm->is_deopt_pc(pc)) {
561 RegisterMap map(current,
562 RegisterMap::UpdateMap::skip,
563 RegisterMap::ProcessFrames::include,
749 _throw_class_cast_exception_count++;
750 }
751 #endif
752 ResourceMark rm(current);
753 char* message = SharedRuntime::generate_class_cast_message(current, object->klass());
754 SharedRuntime::throw_and_post_jvmti_exception(current, vmSymbols::java_lang_ClassCastException(), message);
755 JRT_END
756
757
758 JRT_ENTRY(void, Runtime1::throw_incompatible_class_change_error(JavaThread* current))
759 #ifndef PRODUCT
760 if (PrintC1Statistics) {
761 _throw_incompatible_class_change_error_count++;
762 }
763 #endif
764 ResourceMark rm(current);
765 SharedRuntime::throw_and_post_jvmti_exception(current, vmSymbols::java_lang_IncompatibleClassChangeError());
766 JRT_END
767
768
769 JRT_BLOCK_ENTRY(void, Runtime1::monitorenter(JavaThread* current, oopDesc* obj, BasicObjectLock* lock))
770 #ifndef PRODUCT
771 if (PrintC1Statistics) {
772 _monitorenter_slowcase_cnt++;
773 }
774 #endif
775 assert(obj == lock->obj(), "must match");
776 SharedRuntime::monitor_enter_helper(obj, lock->lock(), current);
777 JRT_END
778
779
780 JRT_LEAF(void, Runtime1::monitorexit(JavaThread* current, BasicObjectLock* lock))
781 assert(current == JavaThread::current(), "pre-condition");
782 #ifndef PRODUCT
783 if (PrintC1Statistics) {
784 _monitorexit_slowcase_cnt++;
785 }
786 #endif
787 assert(current->last_Java_sp(), "last_Java_sp must be set");
788 oop obj = lock->obj();
789 assert(oopDesc::is_oop(obj), "must be null or an object");
790 SharedRuntime::monitor_exit_helper(obj, lock->lock(), current);
791 JRT_END
792
793 // Cf. OptoRuntime::deoptimize_caller_frame
794 JRT_ENTRY(void, Runtime1::deoptimize(JavaThread* current, jint trap_request))
795 // Called from within the owner thread, so no need for safepoint
796 RegisterMap reg_map(current,
797 RegisterMap::UpdateMap::skip,
798 RegisterMap::ProcessFrames::include,
799 RegisterMap::WalkContinuation::skip);
800 frame stub_frame = current->last_frame();
801 assert(stub_frame.is_runtime_frame(), "Sanity check");
802 frame caller_frame = stub_frame.sender(®_map);
803 nmethod* nm = caller_frame.cb()->as_nmethod_or_null();
804 assert(nm != nullptr, "Sanity check");
805 methodHandle method(current, nm->method());
806 assert(nm == CodeCache::find_nmethod(caller_frame.pc()), "Should be the same");
807 Deoptimization::DeoptAction action = Deoptimization::trap_request_action(trap_request);
808 Deoptimization::DeoptReason reason = Deoptimization::trap_request_reason(trap_request);
809
810 if (action == Deoptimization::Action_make_not_entrant) {
811 if (nm->make_not_entrant(nmethod::InvalidationReason::C1_DEOPTIMIZE)) {
812 if (reason == Deoptimization::Reason_tenured) {
813 MethodData* trap_mdo = Deoptimization::get_method_data(current, method, true /*create_if_missing*/);
814 if (trap_mdo != nullptr) {
817 }
818 }
819 }
820
821 // Deoptimize the caller frame.
822 Deoptimization::deoptimize_frame(current, caller_frame.id());
823 // Return to the now deoptimized frame.
824 JRT_END
825
826
827 #ifndef DEOPTIMIZE_WHEN_PATCHING
828
829 static Klass* resolve_field_return_klass(const methodHandle& caller, int bci, TRAPS) {
830 Bytecode_field field_access(caller, bci);
831 // This can be static or non-static field access
832 Bytecodes::Code code = field_access.code();
833
834 // We must load class, initialize class and resolve the field
835 fieldDescriptor result; // initialize class if needed
836 constantPoolHandle constants(THREAD, caller->constants());
837 LinkResolver::resolve_field_access(result, constants, field_access.index(), caller, Bytecodes::java_code(code), CHECK_NULL);
838 return result.field_holder();
839 }
840
841
842 //
843 // This routine patches sites where a class wasn't loaded or
844 // initialized at the time the code was generated. It handles
845 // references to classes, fields and forcing of initialization. Most
846 // of the cases are straightforward and involving simply forcing
847 // resolution of a class, rewriting the instruction stream with the
848 // needed constant and replacing the call in this function with the
849 // patched code. The case for static field is more complicated since
850 // the thread which is in the process of initializing a class can
851 // access it's static fields but other threads can't so the code
852 // either has to deoptimize when this case is detected or execute a
853 // check that the current thread is the initializing thread. The
854 // current
855 //
856 // Patches basically look like this:
857 //
920 // always end up with a correct outcome. This is easiest if there are
921 // few or no intermediate states. (Some inline caches have two
922 // related instructions that must be patched in tandem. For those,
923 // intermediate states seem to be unavoidable, but we will get the
924 // right answer from all possible observation orders.)
925 //
926 // When patching the entry instruction at the head of a method, or a
927 // linkable call instruction inside of a method, we try very hard to
928 // use a patch sequence which executes as a single memory transaction.
929 // This means, in practice, that when thread A patches an instruction,
930 // it should patch a 32-bit or 64-bit word that somehow overlaps the
931 // instruction or is contained in it. We believe that memory hardware
932 // will never break up such a word write, if it is naturally aligned
933 // for the word being written. We also know that some CPUs work very
934 // hard to create atomic updates even of naturally unaligned words,
935 // but we don't want to bet the farm on this always working.
936 //
937 // Therefore, if there is any chance of a race condition, we try to
938 // patch only naturally aligned words, as single, full-word writes.
939
940 JRT_ENTRY(void, Runtime1::patch_code(JavaThread* current, StubId stub_id ))
941 #ifndef PRODUCT
942 if (PrintC1Statistics) {
943 _patch_code_slowcase_cnt++;
944 }
945 #endif
946
947 ResourceMark rm(current);
948 RegisterMap reg_map(current,
949 RegisterMap::UpdateMap::skip,
950 RegisterMap::ProcessFrames::include,
951 RegisterMap::WalkContinuation::skip);
952 frame runtime_frame = current->last_frame();
953 frame caller_frame = runtime_frame.sender(®_map);
954
955 // last java frame on stack
956 vframeStream vfst(current, true);
957 assert(!vfst.at_end(), "Java frame must exist");
958
959 methodHandle caller_method(current, vfst.method());
960 // Note that caller_method->code() may not be same as caller_code because of OSR's
965 Bytecodes::Code code = caller_method()->java_code_at(bci);
966
967 // this is used by assertions in the access_field_patching_id
968 BasicType patch_field_type = T_ILLEGAL;
969 bool deoptimize_for_volatile = false;
970 bool deoptimize_for_atomic = false;
971 int patch_field_offset = -1;
972 Klass* init_klass = nullptr; // klass needed by load_klass_patching code
973 Klass* load_klass = nullptr; // klass needed by load_klass_patching code
974 Handle mirror(current, nullptr); // oop needed by load_mirror_patching code
975 Handle appendix(current, nullptr); // oop needed by appendix_patching code
976 bool load_klass_or_mirror_patch_id =
977 (stub_id == StubId::c1_load_klass_patching_id || stub_id == StubId::c1_load_mirror_patching_id);
978
979 if (stub_id == StubId::c1_access_field_patching_id) {
980
981 Bytecode_field field_access(caller_method, bci);
982 fieldDescriptor result; // initialize class if needed
983 Bytecodes::Code code = field_access.code();
984 constantPoolHandle constants(current, caller_method->constants());
985 LinkResolver::resolve_field_access(result, constants, field_access.index(), caller_method, Bytecodes::java_code(code), CHECK);
986 patch_field_offset = result.offset();
987
988 // If we're patching a field which is volatile then at compile it
989 // must not have been know to be volatile, so the generated code
990 // isn't correct for a volatile reference. The nmethod has to be
991 // deoptimized so that the code can be regenerated correctly.
992 // This check is only needed for access_field_patching since this
993 // is the path for patching field offsets. load_klass is only
994 // used for patching references to oops which don't need special
995 // handling in the volatile case.
996
997 deoptimize_for_volatile = result.access_flags().is_volatile();
998
999 // If we are patching a field which should be atomic, then
1000 // the generated code is not correct either, force deoptimizing.
1001 // We need to only cover T_LONG and T_DOUBLE fields, as we can
1002 // break access atomicity only for them.
1003
1004 // Strictly speaking, the deoptimization on 64-bit platforms
1005 // is unnecessary, and T_LONG stores on 32-bit platforms need
1303 switch (code) {
1304 case Bytecodes::_new:
1305 case Bytecodes::_anewarray:
1306 case Bytecodes::_multianewarray:
1307 case Bytecodes::_instanceof:
1308 case Bytecodes::_checkcast: {
1309 Bytecode bc(caller_method(), caller_method->bcp_from(bci));
1310 constantTag tag = caller_method->constants()->tag_at(bc.get_index_u2(code));
1311 if (tag.is_unresolved_klass_in_error()) {
1312 return false; // throws resolution error
1313 }
1314 break;
1315 }
1316
1317 default: break;
1318 }
1319 }
1320 return true;
1321 }
1322
1323 void Runtime1::patch_code(JavaThread* current, StubId stub_id) {
1324 #ifndef PRODUCT
1325 if (PrintC1Statistics) {
1326 _patch_code_slowcase_cnt++;
1327 }
1328 #endif
1329
1330 // Enable WXWrite: the function is called by c1 stub as a runtime function
1331 // (see another implementation above).
1332 MACOS_AARCH64_ONLY(ThreadWXEnable wx(WXWrite, current));
1333
1334 if (TracePatching) {
1335 tty->print_cr("Deoptimizing because patch is needed");
1336 }
1337
1338 RegisterMap reg_map(current,
1339 RegisterMap::UpdateMap::skip,
1340 RegisterMap::ProcessFrames::include,
1341 RegisterMap::WalkContinuation::skip);
1342
1343 frame runtime_frame = current->last_frame();
1344 frame caller_frame = runtime_frame.sender(®_map);
1345 assert(caller_frame.is_compiled_frame(), "Wrong frame type");
1346
1347 if (is_patching_needed(current, stub_id)) {
1348 // Make sure the nmethod is invalidated, i.e. made not entrant.
1349 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc());
1350 if (nm != nullptr) {
1351 nm->make_not_entrant(nmethod::InvalidationReason::C1_DEOPTIMIZE_FOR_PATCHING);
1352 }
1353 }
1354
1355 Deoptimization::deoptimize_frame(current, caller_frame.id());
1356 // Return to the now deoptimized frame.
1357 postcond(caller_is_deopted(current));
1358 }
1359
1360 #endif // DEOPTIMIZE_WHEN_PATCHING
1361
1362 // Entry point for compiled code. We want to patch a nmethod.
1363 // We don't do a normal VM transition here because we want to
1364 // know after the patching is complete and any safepoint(s) are taken
1365 // if the calling nmethod was deoptimized. We do this by calling a
1366 // helper method which does the normal VM transition and when it
1367 // completes we can check for deoptimization. This simplifies the
1368 // assembly code in the cpu directories.
1369 //
1370 int Runtime1::move_klass_patching(JavaThread* current) {
1371 //
1372 // NOTE: we are still in Java
1373 //
1374 DEBUG_ONLY(NoHandleMark nhm;)
1375 {
1376 // Enter VM mode
1377 ResetNoHandleMark rnhm;
1378 patch_code(current, StubId::c1_load_klass_patching_id);
1429 int Runtime1::access_field_patching(JavaThread* current) {
1430 //
1431 // NOTE: we are still in Java
1432 //
1433 // Handles created in this function will be deleted by the
1434 // HandleMarkCleaner in the transition to the VM.
1435 NoHandleMark nhm;
1436 {
1437 // Enter VM mode
1438 ResetNoHandleMark rnhm;
1439 patch_code(current, StubId::c1_access_field_patching_id);
1440 }
1441 // Back in JAVA, use no oops DON'T safepoint
1442
1443 // Return true if calling code is deoptimized
1444
1445 return caller_is_deopted(current);
1446 }
1447
1448
1449 JRT_LEAF(void, Runtime1::trace_block_entry(jint block_id))
1450 // for now we just print out the block id
1451 tty->print("%d ", block_id);
1452 JRT_END
1453
1454
1455 JRT_LEAF(int, Runtime1::is_instance_of(oopDesc* mirror, oopDesc* obj))
1456 // had to return int instead of bool, otherwise there may be a mismatch
1457 // between the C calling convention and the Java one.
1458 // e.g., on x86, GCC may clear only %al when returning a bool false, but
1459 // JVM takes the whole %eax as the return value, which may misinterpret
1460 // the return value as a boolean true.
1461
1462 assert(mirror != nullptr, "should null-check on mirror before calling");
1463 Klass* k = java_lang_Class::as_Klass(mirror);
1464 return (k != nullptr && obj != nullptr && obj->is_a(k)) ? 1 : 0;
1465 JRT_END
1466
1467 JRT_ENTRY(void, Runtime1::predicate_failed_trap(JavaThread* current))
1468 ResourceMark rm;
1469
1470 RegisterMap reg_map(current,
1471 RegisterMap::UpdateMap::skip,
1472 RegisterMap::ProcessFrames::include,
1473 RegisterMap::WalkContinuation::skip);
1474 frame runtime_frame = current->last_frame();
1475 frame caller_frame = runtime_frame.sender(®_map);
1476
1477 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc());
1478 assert (nm != nullptr, "no more nmethod?");
1479 nm->make_not_entrant(nmethod::InvalidationReason::C1_PREDICATE_FAILED_TRAP);
1480
1481 methodHandle m(current, nm->method());
1482 MethodData* mdo = m->method_data();
1483
1484 if (mdo == nullptr && !HAS_PENDING_EXCEPTION) {
1485 // Build an MDO. Ignore errors like OutOfMemory;
1486 // that simply means we won't have an MDO to update.
1487 Method::build_profiling_method_data(m, THREAD);
1507 }
1508
1509
1510 Deoptimization::deoptimize_frame(current, caller_frame.id());
1511
1512 JRT_END
1513
1514 // Check exception if AbortVMOnException flag set
1515 JRT_LEAF(void, Runtime1::check_abort_on_vm_exception(oopDesc* ex))
1516 ResourceMark rm;
1517 const char* message = nullptr;
1518 if (ex->is_a(vmClasses::Throwable_klass())) {
1519 oop msg = java_lang_Throwable::message(ex);
1520 if (msg != nullptr) {
1521 message = java_lang_String::as_utf8_string(msg);
1522 }
1523 }
1524 Exceptions::debug_check_abort(ex->klass()->external_name(), message);
1525 JRT_END
1526
1527 #ifndef PRODUCT
1528 void Runtime1::print_statistics() {
1529 tty->print_cr("C1 Runtime statistics:");
1530 tty->print_cr(" _resolve_invoke_virtual_cnt: %u", SharedRuntime::_resolve_virtual_ctr);
1531 tty->print_cr(" _resolve_invoke_opt_virtual_cnt: %u", SharedRuntime::_resolve_opt_virtual_ctr);
1532 tty->print_cr(" _resolve_invoke_static_cnt: %u", SharedRuntime::_resolve_static_ctr);
1533 tty->print_cr(" _handle_wrong_method_cnt: %u", SharedRuntime::_wrong_method_ctr);
1534 tty->print_cr(" _ic_miss_cnt: %u", SharedRuntime::_ic_miss_ctr);
1535 tty->print_cr(" _generic_arraycopystub_cnt: %u", _generic_arraycopystub_cnt);
1536 tty->print_cr(" _byte_arraycopy_cnt: %u", _byte_arraycopy_stub_cnt);
1537 tty->print_cr(" _short_arraycopy_cnt: %u", _short_arraycopy_stub_cnt);
1538 tty->print_cr(" _int_arraycopy_cnt: %u", _int_arraycopy_stub_cnt);
1539 tty->print_cr(" _long_arraycopy_cnt: %u", _long_arraycopy_stub_cnt);
1540 tty->print_cr(" _oop_arraycopy_cnt: %u", _oop_arraycopy_stub_cnt);
1541 tty->print_cr(" _arraycopy_slowcase_cnt: %u", _arraycopy_slowcase_cnt);
1542 tty->print_cr(" _arraycopy_checkcast_cnt: %u", _arraycopy_checkcast_cnt);
1543 tty->print_cr(" _arraycopy_checkcast_attempt_cnt:%u", _arraycopy_checkcast_attempt_cnt);
1544
1545 tty->print_cr(" _new_type_array_slowcase_cnt: %u", _new_type_array_slowcase_cnt);
1546 tty->print_cr(" _new_object_array_slowcase_cnt: %u", _new_object_array_slowcase_cnt);
1547 tty->print_cr(" _new_instance_slowcase_cnt: %u", _new_instance_slowcase_cnt);
1548 tty->print_cr(" _new_multi_array_slowcase_cnt: %u", _new_multi_array_slowcase_cnt);
1549 tty->print_cr(" _monitorenter_slowcase_cnt: %u", _monitorenter_slowcase_cnt);
1550 tty->print_cr(" _monitorexit_slowcase_cnt: %u", _monitorexit_slowcase_cnt);
1551 tty->print_cr(" _patch_code_slowcase_cnt: %u", _patch_code_slowcase_cnt);
1552
1553 tty->print_cr(" _throw_range_check_exception_count: %u:", _throw_range_check_exception_count);
1554 tty->print_cr(" _throw_index_exception_count: %u:", _throw_index_exception_count);
1555 tty->print_cr(" _throw_div0_exception_count: %u:", _throw_div0_exception_count);
1556 tty->print_cr(" _throw_null_pointer_exception_count: %u:", _throw_null_pointer_exception_count);
1557 tty->print_cr(" _throw_class_cast_exception_count: %u:", _throw_class_cast_exception_count);
1558 tty->print_cr(" _throw_incompatible_class_change_error_count: %u:", _throw_incompatible_class_change_error_count);
1559 tty->print_cr(" _throw_count: %u:", _throw_count);
1560
1561 SharedRuntime::print_ic_miss_histogram();
1562 tty->cr();
1563 }
1564 #endif // PRODUCT
|
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "asm/codeBuffer.hpp"
26 #include "c1/c1_CodeStubs.hpp"
27 #include "c1/c1_Defs.hpp"
28 #include "c1/c1_LIRAssembler.hpp"
29 #include "c1/c1_MacroAssembler.hpp"
30 #include "c1/c1_Runtime1.hpp"
31 #include "classfile/javaClasses.inline.hpp"
32 #include "classfile/vmClasses.hpp"
33 #include "classfile/vmSymbols.hpp"
34 #include "code/aotCodeCache.hpp"
35 #include "code/codeBlob.hpp"
36 #include "code/compiledIC.hpp"
37 #include "code/scopeDesc.hpp"
38 #include "code/vtableStubs.hpp"
39 #include "compiler/compilationPolicy.hpp"
40 #include "compiler/compilerDefinitions.inline.hpp"
41 #include "compiler/disassembler.hpp"
42 #include "compiler/oopMap.hpp"
43 #include "gc/shared/barrierSet.hpp"
44 #include "gc/shared/c1/barrierSetC1.hpp"
45 #include "gc/shared/collectedHeap.hpp"
46 #include "interpreter/bytecode.hpp"
47 #include "interpreter/interpreter.hpp"
48 #include "jfr/support/jfrIntrinsics.hpp"
49 #include "logging/log.hpp"
50 #include "memory/oopFactory.hpp"
51 #include "memory/resourceArea.hpp"
52 #include "memory/universe.hpp"
53 #include "oops/access.inline.hpp"
54 #include "oops/objArrayKlass.hpp"
55 #include "oops/objArrayOop.inline.hpp"
56 #include "oops/oop.inline.hpp"
57 #include "prims/jvmtiExport.hpp"
58 #include "runtime/atomicAccess.hpp"
59 #include "runtime/fieldDescriptor.inline.hpp"
60 #include "runtime/frame.inline.hpp"
61 #include "runtime/handles.inline.hpp"
62 #include "runtime/interfaceSupport.inline.hpp"
63 #include "runtime/javaCalls.hpp"
64 #include "runtime/perfData.inline.hpp"
65 #include "runtime/runtimeUpcalls.hpp"
66 #include "runtime/sharedRuntime.hpp"
67 #include "runtime/stackWatermarkSet.hpp"
68 #include "runtime/stubInfo.hpp"
69 #include "runtime/stubRoutines.hpp"
70 #include "runtime/vframe.inline.hpp"
71 #include "runtime/vframeArray.hpp"
72 #include "runtime/vm_version.hpp"
73 #include "services/management.hpp"
74 #include "utilities/copy.hpp"
75 #include "utilities/events.hpp"
76
77
78 // Implementation of StubAssembler
79
80 StubAssembler::StubAssembler(CodeBuffer* code, const char * name, int stub_id) : C1_MacroAssembler(code) {
81 _name = name;
82 _must_gc_arguments = false;
83 _frame_size = no_frame_size;
84 _num_rt_args = 0;
85 _stub_id = stub_id;
86 }
87
88
89 void StubAssembler::set_info(const char* name, bool must_gc_arguments) {
90 _name = name;
91 _must_gc_arguments = must_gc_arguments;
92 }
93
256 case StubId::c1_slow_subtype_check_id:
257 case StubId::c1_fpu2long_stub_id:
258 case StubId::c1_unwind_exception_id:
259 case StubId::c1_counter_overflow_id:
260 case StubId::c1_is_instance_of_id:
261 expect_oop_map = false;
262 break;
263 default:
264 break;
265 }
266 #endif
267 C1StubAssemblerCodeGenClosure cl(id);
268 CodeBlob* blob = generate_blob(buffer_blob, id, name_for(id), expect_oop_map, &cl);
269 // install blob
270 int idx = StubInfo::c1_offset(id); // will assert on non-c1 id
271 _blobs[idx] = blob;
272 return blob != nullptr;
273 }
274
275 bool Runtime1::initialize(BufferBlob* blob) {
276 init_counters();
277 // platform-dependent initialization
278 initialize_pd();
279 // iterate blobs in C1 group and generate a single stub per blob
280 StubId id = StubInfo::stub_base(StubGroup::C1);
281 StubId limit = StubInfo::next(StubInfo::stub_max(StubGroup::C1));
282 for (; id != limit; id = StubInfo::next(id)) {
283 if (!generate_blob_for(blob, id)) {
284 return false;
285 }
286 if (id == StubId::c1_forward_exception_id) {
287 // publish early c1 stubs at this point so later stubs can refer to them
288 AOTCodeCache::init_early_c1_table();
289 }
290 }
291 // printing
292 #ifndef PRODUCT
293 if (PrintSimpleStubs) {
294 ResourceMark rm;
295 id = StubInfo::stub_base(StubGroup::C1);
296 for (; id != limit; id = StubInfo::next(id)) {
356 FUNCTION_CASE(entry, trace_block_entry);
357 #ifdef JFR_HAVE_INTRINSICS
358 FUNCTION_CASE(entry, JfrTime::time_function());
359 #endif
360 FUNCTION_CASE(entry, StubRoutines::updateBytesCRC32());
361 FUNCTION_CASE(entry, StubRoutines::updateBytesCRC32C());
362 FUNCTION_CASE(entry, StubRoutines::vectorizedMismatch());
363 FUNCTION_CASE(entry, StubRoutines::dexp());
364 FUNCTION_CASE(entry, StubRoutines::dlog());
365 FUNCTION_CASE(entry, StubRoutines::dlog10());
366 FUNCTION_CASE(entry, StubRoutines::dpow());
367 FUNCTION_CASE(entry, StubRoutines::dsin());
368 FUNCTION_CASE(entry, StubRoutines::dcos());
369 FUNCTION_CASE(entry, StubRoutines::dtan());
370 FUNCTION_CASE(entry, StubRoutines::dsinh());
371 FUNCTION_CASE(entry, StubRoutines::dtanh());
372 FUNCTION_CASE(entry, StubRoutines::dcbrt());
373
374 #undef FUNCTION_CASE
375
376 // Runtime upcalls also has a map of addresses to names
377 const char* upcall_name = RuntimeUpcalls::get_name_for_upcall_address(entry);
378 if (upcall_name != nullptr) {
379 return upcall_name;
380 }
381
382 // Soft float adds more runtime names.
383 return pd_name_for_address(entry);
384 }
385
386
387 JRT_ENTRY_PROF(void, Runtime1, new_instance, Runtime1::new_instance(JavaThread* current, Klass* klass))
388 #ifndef PRODUCT
389 if (PrintC1Statistics) {
390 _new_instance_slowcase_cnt++;
391 }
392 #endif
393 assert(klass->is_klass(), "not a class");
394 Handle holder(current, klass->klass_holder()); // keep the klass alive
395 InstanceKlass* h = InstanceKlass::cast(klass);
396 h->check_valid_for_instantiation(true, CHECK);
397 // make sure klass is initialized
398 h->initialize(CHECK);
399 // allocate instance and return via TLS
400 oop obj = h->allocate_instance(CHECK);
401 current->set_vm_result_oop(obj);
402 JRT_END
403
404
405 JRT_ENTRY_PROF(void, Runtime1, new_type_array, Runtime1::new_type_array(JavaThread* current, Klass* klass, jint length))
406 #ifndef PRODUCT
407 if (PrintC1Statistics) {
408 _new_type_array_slowcase_cnt++;
409 }
410 #endif
411 // Note: no handle for klass needed since they are not used
412 // anymore after new_typeArray() and no GC can happen before.
413 // (This may have to change if this code changes!)
414 assert(klass->is_klass(), "not a class");
415 BasicType elt_type = TypeArrayKlass::cast(klass)->element_type();
416 oop obj = oopFactory::new_typeArray(elt_type, length, CHECK);
417 current->set_vm_result_oop(obj);
418 // This is pretty rare but this runtime patch is stressful to deoptimization
419 // if we deoptimize here so force a deopt to stress the path.
420 if (DeoptimizeALot) {
421 deopt_caller(current);
422 }
423
424 JRT_END
425
426
427 JRT_ENTRY_PROF(void, Runtime1, new_object_array, Runtime1::new_object_array(JavaThread* current, Klass* array_klass, jint length))
428 #ifndef PRODUCT
429 if (PrintC1Statistics) {
430 _new_object_array_slowcase_cnt++;
431 }
432 #endif
433 // Note: no handle for klass needed since they are not used
434 // anymore after new_objArray() and no GC can happen before.
435 // (This may have to change if this code changes!)
436 assert(array_klass->is_klass(), "not a class");
437 Handle holder(current, array_klass->klass_holder()); // keep the klass alive
438 Klass* elem_klass = ObjArrayKlass::cast(array_klass)->element_klass();
439 objArrayOop obj = oopFactory::new_objArray(elem_klass, length, CHECK);
440 current->set_vm_result_oop(obj);
441 // This is pretty rare but this runtime patch is stressful to deoptimization
442 // if we deoptimize here so force a deopt to stress the path.
443 if (DeoptimizeALot) {
444 deopt_caller(current);
445 }
446 JRT_END
447
448
449 JRT_ENTRY_PROF(void, Runtime1, new_multi_array, Runtime1::new_multi_array(JavaThread* current, Klass* klass, int rank, jint* dims))
450 #ifndef PRODUCT
451 if (PrintC1Statistics) {
452 _new_multi_array_slowcase_cnt++;
453 }
454 #endif
455 assert(klass->is_klass(), "not a class");
456 assert(rank >= 1, "rank must be nonzero");
457 Handle holder(current, klass->klass_holder()); // keep the klass alive
458 oop obj = ArrayKlass::cast(klass)->multi_allocate(rank, dims, CHECK);
459 current->set_vm_result_oop(obj);
460 JRT_END
461
462
463 JRT_ENTRY(void, Runtime1::unimplemented_entry(JavaThread* current, StubId id))
464 tty->print_cr("Runtime1::entry_for(%d) returned unimplemented entry point", (int)id);
465 JRT_END
466
467
468 JRT_ENTRY(void, Runtime1::throw_array_store_exception(JavaThread* current, oopDesc* obj))
469 ResourceMark rm(current);
500 case Bytecodes::_if_icmplt: case Bytecodes::_iflt:
501 case Bytecodes::_if_icmpgt: case Bytecodes::_ifgt:
502 case Bytecodes::_if_icmple: case Bytecodes::_ifle:
503 case Bytecodes::_if_icmpge: case Bytecodes::_ifge:
504 case Bytecodes::_if_icmpeq: case Bytecodes::_if_acmpeq: case Bytecodes::_ifeq:
505 case Bytecodes::_if_icmpne: case Bytecodes::_if_acmpne: case Bytecodes::_ifne:
506 case Bytecodes::_ifnull: case Bytecodes::_ifnonnull: case Bytecodes::_goto:
507 offset = (int16_t)Bytes::get_Java_u2(pc + 1);
508 break;
509 case Bytecodes::_goto_w:
510 offset = Bytes::get_Java_u4(pc + 1);
511 break;
512 default: ;
513 }
514 bci = branch_bci + offset;
515 }
516 osr_nm = CompilationPolicy::event(enclosing_method, method, branch_bci, bci, level, nm, current);
517 return osr_nm;
518 }
519
520 JRT_BLOCK_ENTRY_PROF(address, Runtime1, counter_overflow, Runtime1::counter_overflow(JavaThread* current, int bci, Method* method))
521 nmethod* osr_nm;
522 JRT_BLOCK_NO_ASYNC
523 osr_nm = counter_overflow_helper(current, bci, method);
524 if (osr_nm != nullptr) {
525 RegisterMap map(current,
526 RegisterMap::UpdateMap::skip,
527 RegisterMap::ProcessFrames::include,
528 RegisterMap::WalkContinuation::skip);
529 frame fr = current->last_frame().sender(&map);
530 Deoptimization::deoptimize_frame(current, fr.id());
531 }
532 JRT_BLOCK_END
533 return nullptr;
534 JRT_END
535
536 extern void vm_exit(int code);
537
538 // Enter this method from compiled code handler below. This is where we transition
539 // to VM mode. This is done as a helper routine so that the method called directly
540 // from compiled code does not have to transition to VM. This allows the entry
541 // method to see if the nmethod that we have just looked up a handler for has
542 // been deoptimized while we were in the vm. This simplifies the assembly code
543 // cpu directories.
544 //
545 // We are entering here from exception stub (via the entry method below)
546 // If there is a compiled exception handler in this method, we will continue there;
547 // otherwise we will unwind the stack and continue at the caller of top frame method
548 // Note: we enter in Java using a special JRT wrapper. This wrapper allows us to
549 // control the area where we can allow a safepoint. After we exit the safepoint area we can
550 // check to see if the handler we are going to return is now in a nmethod that has
551 // been deoptimized. If that is the case we return the deopt blob
552 // unpack_with_exception entry instead. This makes life for the exception blob easier
553 // because making that same check and diverting is painful from assembly language.
554 JRT_ENTRY_NO_ASYNC_PROF(static address, Runtime1, exception_handler_for_pc_helper, exception_handler_for_pc_helper(JavaThread* current, oopDesc* ex, address pc, nmethod*& nm))
555 MACOS_AARCH64_ONLY(current->wx_enable_write());
556 Handle exception(current, ex);
557
558 // This function is called when we are about to throw an exception. Therefore,
559 // we have to poll the stack watermark barrier to make sure that not yet safe
560 // stack frames are made safe before returning into them.
561 if (current->last_frame().cb() == Runtime1::blob_for(StubId::c1_handle_exception_from_callee_id)) {
562 // The StubId::c1_handle_exception_from_callee_id handler is invoked after the
563 // frame has been unwound. It instead builds its own stub frame, to call the
564 // runtime. But the throwing frame has already been unwound here.
565 StackWatermarkSet::after_unwind(current);
566 }
567
568 nm = CodeCache::find_nmethod(pc);
569 assert(nm != nullptr, "this is not an nmethod");
570 // Adjust the pc as needed/
571 if (nm->is_deopt_pc(pc)) {
572 RegisterMap map(current,
573 RegisterMap::UpdateMap::skip,
574 RegisterMap::ProcessFrames::include,
760 _throw_class_cast_exception_count++;
761 }
762 #endif
763 ResourceMark rm(current);
764 char* message = SharedRuntime::generate_class_cast_message(current, object->klass());
765 SharedRuntime::throw_and_post_jvmti_exception(current, vmSymbols::java_lang_ClassCastException(), message);
766 JRT_END
767
768
769 JRT_ENTRY(void, Runtime1::throw_incompatible_class_change_error(JavaThread* current))
770 #ifndef PRODUCT
771 if (PrintC1Statistics) {
772 _throw_incompatible_class_change_error_count++;
773 }
774 #endif
775 ResourceMark rm(current);
776 SharedRuntime::throw_and_post_jvmti_exception(current, vmSymbols::java_lang_IncompatibleClassChangeError());
777 JRT_END
778
779
780 JRT_BLOCK_ENTRY_PROF(void, Runtime1, monitorenter, Runtime1::monitorenter(JavaThread* current, oopDesc* obj, BasicObjectLock* lock))
781 #ifndef PRODUCT
782 if (PrintC1Statistics) {
783 _monitorenter_slowcase_cnt++;
784 }
785 #endif
786 assert(obj == lock->obj(), "must match");
787 SharedRuntime::monitor_enter_helper(obj, lock->lock(), current);
788 JRT_END
789
790
791 JRT_LEAF_PROF(void, Runtime1, monitorexit, Runtime1::monitorexit(JavaThread* current, BasicObjectLock* lock))
792 assert(current == JavaThread::current(), "pre-condition");
793 #ifndef PRODUCT
794 if (PrintC1Statistics) {
795 _monitorexit_slowcase_cnt++;
796 }
797 #endif
798 assert(current->last_Java_sp(), "last_Java_sp must be set");
799 oop obj = lock->obj();
800 assert(oopDesc::is_oop(obj), "must be null or an object");
801 SharedRuntime::monitor_exit_helper(obj, lock->lock(), current);
802 JRT_END
803
804 // Cf. OptoRuntime::deoptimize_caller_frame
805 JRT_ENTRY_PROF(void, Runtime1, deoptimize, Runtime1::deoptimize(JavaThread* current, jint trap_request))
806 // Called from within the owner thread, so no need for safepoint
807 RegisterMap reg_map(current,
808 RegisterMap::UpdateMap::skip,
809 RegisterMap::ProcessFrames::include,
810 RegisterMap::WalkContinuation::skip);
811 frame stub_frame = current->last_frame();
812 assert(stub_frame.is_runtime_frame(), "Sanity check");
813 frame caller_frame = stub_frame.sender(®_map);
814 nmethod* nm = caller_frame.cb()->as_nmethod_or_null();
815 assert(nm != nullptr, "Sanity check");
816 methodHandle method(current, nm->method());
817 assert(nm == CodeCache::find_nmethod(caller_frame.pc()), "Should be the same");
818 Deoptimization::DeoptAction action = Deoptimization::trap_request_action(trap_request);
819 Deoptimization::DeoptReason reason = Deoptimization::trap_request_reason(trap_request);
820
821 if (action == Deoptimization::Action_make_not_entrant) {
822 if (nm->make_not_entrant(nmethod::InvalidationReason::C1_DEOPTIMIZE)) {
823 if (reason == Deoptimization::Reason_tenured) {
824 MethodData* trap_mdo = Deoptimization::get_method_data(current, method, true /*create_if_missing*/);
825 if (trap_mdo != nullptr) {
828 }
829 }
830 }
831
832 // Deoptimize the caller frame.
833 Deoptimization::deoptimize_frame(current, caller_frame.id());
834 // Return to the now deoptimized frame.
835 JRT_END
836
837
838 #ifndef DEOPTIMIZE_WHEN_PATCHING
839
840 static Klass* resolve_field_return_klass(const methodHandle& caller, int bci, TRAPS) {
841 Bytecode_field field_access(caller, bci);
842 // This can be static or non-static field access
843 Bytecodes::Code code = field_access.code();
844
845 // We must load class, initialize class and resolve the field
846 fieldDescriptor result; // initialize class if needed
847 constantPoolHandle constants(THREAD, caller->constants());
848 LinkResolver::resolve_field_access(result, constants, field_access.index(), caller,
849 Bytecodes::java_code(code), ClassInitMode::init, CHECK_NULL);
850 return result.field_holder();
851 }
852
853
854 //
855 // This routine patches sites where a class wasn't loaded or
856 // initialized at the time the code was generated. It handles
857 // references to classes, fields and forcing of initialization. Most
858 // of the cases are straightforward and involving simply forcing
859 // resolution of a class, rewriting the instruction stream with the
860 // needed constant and replacing the call in this function with the
861 // patched code. The case for static field is more complicated since
862 // the thread which is in the process of initializing a class can
863 // access it's static fields but other threads can't so the code
864 // either has to deoptimize when this case is detected or execute a
865 // check that the current thread is the initializing thread. The
866 // current
867 //
868 // Patches basically look like this:
869 //
932 // always end up with a correct outcome. This is easiest if there are
933 // few or no intermediate states. (Some inline caches have two
934 // related instructions that must be patched in tandem. For those,
935 // intermediate states seem to be unavoidable, but we will get the
936 // right answer from all possible observation orders.)
937 //
938 // When patching the entry instruction at the head of a method, or a
939 // linkable call instruction inside of a method, we try very hard to
940 // use a patch sequence which executes as a single memory transaction.
941 // This means, in practice, that when thread A patches an instruction,
942 // it should patch a 32-bit or 64-bit word that somehow overlaps the
943 // instruction or is contained in it. We believe that memory hardware
944 // will never break up such a word write, if it is naturally aligned
945 // for the word being written. We also know that some CPUs work very
946 // hard to create atomic updates even of naturally unaligned words,
947 // but we don't want to bet the farm on this always working.
948 //
949 // Therefore, if there is any chance of a race condition, we try to
950 // patch only naturally aligned words, as single, full-word writes.
951
952 JRT_ENTRY_PROF(void, Runtime1, patch_code, Runtime1::patch_code(JavaThread* current, StubId stub_id))
953 #ifndef PRODUCT
954 if (PrintC1Statistics) {
955 _patch_code_slowcase_cnt++;
956 }
957 #endif
958
959 ResourceMark rm(current);
960 RegisterMap reg_map(current,
961 RegisterMap::UpdateMap::skip,
962 RegisterMap::ProcessFrames::include,
963 RegisterMap::WalkContinuation::skip);
964 frame runtime_frame = current->last_frame();
965 frame caller_frame = runtime_frame.sender(®_map);
966
967 // last java frame on stack
968 vframeStream vfst(current, true);
969 assert(!vfst.at_end(), "Java frame must exist");
970
971 methodHandle caller_method(current, vfst.method());
972 // Note that caller_method->code() may not be same as caller_code because of OSR's
977 Bytecodes::Code code = caller_method()->java_code_at(bci);
978
979 // this is used by assertions in the access_field_patching_id
980 BasicType patch_field_type = T_ILLEGAL;
981 bool deoptimize_for_volatile = false;
982 bool deoptimize_for_atomic = false;
983 int patch_field_offset = -1;
984 Klass* init_klass = nullptr; // klass needed by load_klass_patching code
985 Klass* load_klass = nullptr; // klass needed by load_klass_patching code
986 Handle mirror(current, nullptr); // oop needed by load_mirror_patching code
987 Handle appendix(current, nullptr); // oop needed by appendix_patching code
988 bool load_klass_or_mirror_patch_id =
989 (stub_id == StubId::c1_load_klass_patching_id || stub_id == StubId::c1_load_mirror_patching_id);
990
991 if (stub_id == StubId::c1_access_field_patching_id) {
992
993 Bytecode_field field_access(caller_method, bci);
994 fieldDescriptor result; // initialize class if needed
995 Bytecodes::Code code = field_access.code();
996 constantPoolHandle constants(current, caller_method->constants());
997 LinkResolver::resolve_field_access(result, constants, field_access.index(), caller_method,
998 Bytecodes::java_code(code), ClassInitMode::init, CHECK);
999 patch_field_offset = result.offset();
1000
1001 // If we're patching a field which is volatile then at compile it
1002 // must not have been know to be volatile, so the generated code
1003 // isn't correct for a volatile reference. The nmethod has to be
1004 // deoptimized so that the code can be regenerated correctly.
1005 // This check is only needed for access_field_patching since this
1006 // is the path for patching field offsets. load_klass is only
1007 // used for patching references to oops which don't need special
1008 // handling in the volatile case.
1009
1010 deoptimize_for_volatile = result.access_flags().is_volatile();
1011
1012 // If we are patching a field which should be atomic, then
1013 // the generated code is not correct either, force deoptimizing.
1014 // We need to only cover T_LONG and T_DOUBLE fields, as we can
1015 // break access atomicity only for them.
1016
1017 // Strictly speaking, the deoptimization on 64-bit platforms
1018 // is unnecessary, and T_LONG stores on 32-bit platforms need
1316 switch (code) {
1317 case Bytecodes::_new:
1318 case Bytecodes::_anewarray:
1319 case Bytecodes::_multianewarray:
1320 case Bytecodes::_instanceof:
1321 case Bytecodes::_checkcast: {
1322 Bytecode bc(caller_method(), caller_method->bcp_from(bci));
1323 constantTag tag = caller_method->constants()->tag_at(bc.get_index_u2(code));
1324 if (tag.is_unresolved_klass_in_error()) {
1325 return false; // throws resolution error
1326 }
1327 break;
1328 }
1329
1330 default: break;
1331 }
1332 }
1333 return true;
1334 }
1335
1336 PROF_ENTRY(void, Runtime1, patch_code, Runtime1::patch_code(JavaThread* current, StubId stub_id))
1337 #ifndef PRODUCT
1338 if (PrintC1Statistics) {
1339 _patch_code_slowcase_cnt++;
1340 }
1341 #endif
1342
1343 // Enable WXWrite: the function is called by c1 stub as a runtime function
1344 // (see another implementation above).
1345 MACOS_AARCH64_ONLY(ThreadWXEnable wx(WXWrite, current));
1346
1347 if (TracePatching) {
1348 tty->print_cr("Deoptimizing because patch is needed");
1349 }
1350
1351 RegisterMap reg_map(current,
1352 RegisterMap::UpdateMap::skip,
1353 RegisterMap::ProcessFrames::include,
1354 RegisterMap::WalkContinuation::skip);
1355
1356 frame runtime_frame = current->last_frame();
1357 frame caller_frame = runtime_frame.sender(®_map);
1358 assert(caller_frame.is_compiled_frame(), "Wrong frame type");
1359
1360 if (is_patching_needed(current, stub_id)) {
1361 // Make sure the nmethod is invalidated, i.e. made not entrant.
1362 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc());
1363 if (nm != nullptr) {
1364 nm->make_not_entrant(nmethod::InvalidationReason::C1_DEOPTIMIZE_FOR_PATCHING);
1365 }
1366 }
1367
1368 Deoptimization::deoptimize_frame(current, caller_frame.id());
1369 // Return to the now deoptimized frame.
1370 postcond(caller_is_deopted(current));
1371 PROF_END
1372
1373 #endif // DEOPTIMIZE_WHEN_PATCHING
1374
1375 // Entry point for compiled code. We want to patch a nmethod.
1376 // We don't do a normal VM transition here because we want to
1377 // know after the patching is complete and any safepoint(s) are taken
1378 // if the calling nmethod was deoptimized. We do this by calling a
1379 // helper method which does the normal VM transition and when it
1380 // completes we can check for deoptimization. This simplifies the
1381 // assembly code in the cpu directories.
1382 //
1383 int Runtime1::move_klass_patching(JavaThread* current) {
1384 //
1385 // NOTE: we are still in Java
1386 //
1387 DEBUG_ONLY(NoHandleMark nhm;)
1388 {
1389 // Enter VM mode
1390 ResetNoHandleMark rnhm;
1391 patch_code(current, StubId::c1_load_klass_patching_id);
1442 int Runtime1::access_field_patching(JavaThread* current) {
1443 //
1444 // NOTE: we are still in Java
1445 //
1446 // Handles created in this function will be deleted by the
1447 // HandleMarkCleaner in the transition to the VM.
1448 NoHandleMark nhm;
1449 {
1450 // Enter VM mode
1451 ResetNoHandleMark rnhm;
1452 patch_code(current, StubId::c1_access_field_patching_id);
1453 }
1454 // Back in JAVA, use no oops DON'T safepoint
1455
1456 // Return true if calling code is deoptimized
1457
1458 return caller_is_deopted(current);
1459 }
1460
1461
1462 JRT_LEAF_PROF_NO_THREAD(void, Runtime1, trace_block_entry, Runtime1::trace_block_entry(jint block_id))
1463 // for now we just print out the block id
1464 tty->print("%d ", block_id);
1465 JRT_END
1466
1467
1468 JRT_LEAF_PROF_NO_THREAD(int, Runtime1, is_instance_of, Runtime1::is_instance_of(oopDesc* mirror, oopDesc* obj))
1469 // had to return int instead of bool, otherwise there may be a mismatch
1470 // between the C calling convention and the Java one.
1471 // e.g., on x86, GCC may clear only %al when returning a bool false, but
1472 // JVM takes the whole %eax as the return value, which may misinterpret
1473 // the return value as a boolean true.
1474
1475 assert(mirror != nullptr, "should null-check on mirror before calling");
1476 Klass* k = java_lang_Class::as_Klass(mirror);
1477 return (k != nullptr && obj != nullptr && obj->is_a(k)) ? 1 : 0;
1478 JRT_END
1479
1480 JRT_ENTRY_PROF(void, Runtime1, predicate_failed_trap, Runtime1::predicate_failed_trap(JavaThread* current))
1481 ResourceMark rm;
1482
1483 RegisterMap reg_map(current,
1484 RegisterMap::UpdateMap::skip,
1485 RegisterMap::ProcessFrames::include,
1486 RegisterMap::WalkContinuation::skip);
1487 frame runtime_frame = current->last_frame();
1488 frame caller_frame = runtime_frame.sender(®_map);
1489
1490 nmethod* nm = CodeCache::find_nmethod(caller_frame.pc());
1491 assert (nm != nullptr, "no more nmethod?");
1492 nm->make_not_entrant(nmethod::InvalidationReason::C1_PREDICATE_FAILED_TRAP);
1493
1494 methodHandle m(current, nm->method());
1495 MethodData* mdo = m->method_data();
1496
1497 if (mdo == nullptr && !HAS_PENDING_EXCEPTION) {
1498 // Build an MDO. Ignore errors like OutOfMemory;
1499 // that simply means we won't have an MDO to update.
1500 Method::build_profiling_method_data(m, THREAD);
1520 }
1521
1522
1523 Deoptimization::deoptimize_frame(current, caller_frame.id());
1524
1525 JRT_END
1526
1527 // Check exception if AbortVMOnException flag set
1528 JRT_LEAF(void, Runtime1::check_abort_on_vm_exception(oopDesc* ex))
1529 ResourceMark rm;
1530 const char* message = nullptr;
1531 if (ex->is_a(vmClasses::Throwable_klass())) {
1532 oop msg = java_lang_Throwable::message(ex);
1533 if (msg != nullptr) {
1534 message = java_lang_String::as_utf8_string(msg);
1535 }
1536 }
1537 Exceptions::debug_check_abort(ex->klass()->external_name(), message);
1538 JRT_END
1539
1540 #define DO_COUNTERS(macro) \
1541 macro(Runtime1, new_instance) \
1542 macro(Runtime1, new_type_array) \
1543 macro(Runtime1, new_object_array) \
1544 macro(Runtime1, new_multi_array) \
1545 macro(Runtime1, counter_overflow) \
1546 macro(Runtime1, exception_handler_for_pc_helper) \
1547 macro(Runtime1, monitorenter) \
1548 macro(Runtime1, monitorexit) \
1549 macro(Runtime1, deoptimize) \
1550 macro(Runtime1, is_instance_of) \
1551 macro(Runtime1, predicate_failed_trap) \
1552 macro(Runtime1, patch_code)
1553
1554 #define INIT_COUNTER(sub, name) \
1555 NEWPERFTICKCOUNTERS(_perf_##sub##_##name##_timer, SUN_CI, #sub "::" #name); \
1556 NEWPERFEVENTCOUNTER(_perf_##sub##_##name##_count, SUN_CI, #sub "::" #name "_count");
1557
1558 void Runtime1::init_counters() {
1559 assert(CompilerConfig::is_c1_enabled(), "");
1560
1561 if (UsePerfData) {
1562 EXCEPTION_MARK;
1563
1564 DO_COUNTERS(INIT_COUNTER)
1565
1566 if (HAS_PENDING_EXCEPTION) {
1567 vm_exit_during_initialization("Runtime1::init_counters() failed unexpectedly");
1568 }
1569 }
1570 }
1571 #undef INIT_COUNTER
1572
1573 #define PRINT_COUNTER(sub, name) { \
1574 if (_perf_##sub##_##name##_count != nullptr) { \
1575 jlong count = _perf_##sub##_##name##_count->get_value(); \
1576 if (count > 0) { \
1577 st->print_cr(" %-50s = " JLONG_FORMAT_W(6) "us (elapsed) " JLONG_FORMAT_W(6) "us (thread) (" JLONG_FORMAT_W(5) " events)", #sub "::" #name, \
1578 _perf_##sub##_##name##_timer->elapsed_counter_value_us(), \
1579 _perf_##sub##_##name##_timer->thread_counter_value_us(), \
1580 count); \
1581 }}}
1582
1583
1584 void Runtime1::print_counters_on(outputStream* st) {
1585 if (UsePerfData && ProfileRuntimeCalls && CompilerConfig::is_c1_enabled()) {
1586 DO_COUNTERS(PRINT_COUNTER)
1587 } else {
1588 st->print_cr(" Runtime1: no info (%s is disabled)",
1589 (!CompilerConfig::is_c1_enabled() ? "C1" : (UsePerfData ? "ProfileRuntimeCalls" : "UsePerfData")));
1590 }
1591 }
1592
1593 #undef PRINT_COUNTER
1594 #undef DO_COUNTERS
1595
1596 #ifndef PRODUCT
1597 void Runtime1::print_statistics_on(outputStream* st) {
1598 st->print_cr("C1 Runtime statistics:");
1599 st->print_cr(" _resolve_invoke_virtual_cnt: %u", SharedRuntime::_resolve_virtual_ctr);
1600 st->print_cr(" _resolve_invoke_opt_virtual_cnt: %u", SharedRuntime::_resolve_opt_virtual_ctr);
1601 st->print_cr(" _resolve_invoke_static_cnt: %u", SharedRuntime::_resolve_static_ctr);
1602 st->print_cr(" _handle_wrong_method_cnt: %u", SharedRuntime::_wrong_method_ctr);
1603 st->print_cr(" _ic_miss_cnt: %u", SharedRuntime::_ic_miss_ctr);
1604 st->print_cr(" _generic_arraycopystub_cnt: %u", _generic_arraycopystub_cnt);
1605 st->print_cr(" _byte_arraycopy_cnt: %u", _byte_arraycopy_stub_cnt);
1606 st->print_cr(" _short_arraycopy_cnt: %u", _short_arraycopy_stub_cnt);
1607 st->print_cr(" _int_arraycopy_cnt: %u", _int_arraycopy_stub_cnt);
1608 st->print_cr(" _long_arraycopy_cnt: %u", _long_arraycopy_stub_cnt);
1609 st->print_cr(" _oop_arraycopy_cnt: %u", _oop_arraycopy_stub_cnt);
1610 st->print_cr(" _arraycopy_slowcase_cnt: %u", _arraycopy_slowcase_cnt);
1611 st->print_cr(" _arraycopy_checkcast_cnt: %u", _arraycopy_checkcast_cnt);
1612 st->print_cr(" _arraycopy_checkcast_attempt_cnt:%u", _arraycopy_checkcast_attempt_cnt);
1613
1614 st->print_cr(" _new_type_array_slowcase_cnt: %u", _new_type_array_slowcase_cnt);
1615 st->print_cr(" _new_object_array_slowcase_cnt: %u", _new_object_array_slowcase_cnt);
1616 st->print_cr(" _new_instance_slowcase_cnt: %u", _new_instance_slowcase_cnt);
1617 st->print_cr(" _new_multi_array_slowcase_cnt: %u", _new_multi_array_slowcase_cnt);
1618 st->print_cr(" _monitorenter_slowcase_cnt: %u", _monitorenter_slowcase_cnt);
1619 st->print_cr(" _monitorexit_slowcase_cnt: %u", _monitorexit_slowcase_cnt);
1620 st->print_cr(" _patch_code_slowcase_cnt: %u", _patch_code_slowcase_cnt);
1621
1622 st->print_cr(" _throw_range_check_exception_count: %u:", _throw_range_check_exception_count);
1623 st->print_cr(" _throw_index_exception_count: %u:", _throw_index_exception_count);
1624 st->print_cr(" _throw_div0_exception_count: %u:", _throw_div0_exception_count);
1625 st->print_cr(" _throw_null_pointer_exception_count: %u:", _throw_null_pointer_exception_count);
1626 st->print_cr(" _throw_class_cast_exception_count: %u:", _throw_class_cast_exception_count);
1627 st->print_cr(" _throw_incompatible_class_change_error_count: %u:", _throw_incompatible_class_change_error_count);
1628 st->print_cr(" _throw_count: %u:", _throw_count);
1629
1630 SharedRuntime::print_ic_miss_histogram_on(st);
1631 st->cr();
1632 }
1633 #endif // PRODUCT
|