1 /* 2 * Copyright (c) 2003, 2024, Oracle and/or its affiliates. All rights reserved. 3 * Copyright (c) 2014, 2021, Red Hat Inc. All rights reserved. 4 * Copyright (c) 2021, Azul Systems, Inc. All rights reserved. 5 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 6 * 7 * This code is free software; you can redistribute it and/or modify it 8 * under the terms of the GNU General Public License version 2 only, as 9 * published by the Free Software Foundation. 10 * 11 * This code is distributed in the hope that it will be useful, but WITHOUT 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * version 2 for more details (a copy is included in the LICENSE file that 15 * accompanied this code). 16 * 17 * You should have received a copy of the GNU General Public License version 18 * 2 along with this work; if not, write to the Free Software Foundation, 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 20 * 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 22 * or visit www.oracle.com if you need additional information or have any 23 * questions. 24 * 25 */ 26 27 #include "precompiled.hpp" 28 #include "asm/macroAssembler.hpp" 29 #include "asm/macroAssembler.inline.hpp" 30 #include "code/codeCache.hpp" 31 #include "code/compiledIC.hpp" 32 #include "code/debugInfoRec.hpp" 33 #include "code/vtableStubs.hpp" 34 #include "compiler/oopMap.hpp" 35 #include "gc/shared/barrierSetAssembler.hpp" 36 #include "interpreter/interpreter.hpp" 37 #include "interpreter/interp_masm.hpp" 38 #include "logging/log.hpp" 39 #include "memory/resourceArea.hpp" 40 #include "nativeInst_aarch64.hpp" 41 #include "oops/klass.inline.hpp" 42 #include "oops/method.inline.hpp" 43 #include "prims/methodHandles.hpp" 44 #include "runtime/continuation.hpp" 45 #include "runtime/continuationEntry.inline.hpp" 46 #include "runtime/globals.hpp" 47 #include "runtime/jniHandles.hpp" 48 #include "runtime/safepointMechanism.hpp" 49 #include "runtime/sharedRuntime.hpp" 50 #include "runtime/signature.hpp" 51 #include "runtime/stubRoutines.hpp" 52 #include "runtime/vframeArray.hpp" 53 #include "utilities/align.hpp" 54 #include "utilities/formatBuffer.hpp" 55 #include "vmreg_aarch64.inline.hpp" 56 #ifdef COMPILER1 57 #include "c1/c1_Runtime1.hpp" 58 #endif 59 #ifdef COMPILER2 60 #include "adfiles/ad_aarch64.hpp" 61 #include "opto/runtime.hpp" 62 #endif 63 #if INCLUDE_JVMCI 64 #include "jvmci/jvmciJavaClasses.hpp" 65 #endif 66 67 #define __ masm-> 68 69 const int StackAlignmentInSlots = StackAlignmentInBytes / VMRegImpl::stack_slot_size; 70 71 class SimpleRuntimeFrame { 72 73 public: 74 75 // Most of the runtime stubs have this simple frame layout. 76 // This class exists to make the layout shared in one place. 77 // Offsets are for compiler stack slots, which are jints. 78 enum layout { 79 // The frame sender code expects that rbp will be in the "natural" place and 80 // will override any oopMap setting for it. We must therefore force the layout 81 // so that it agrees with the frame sender code. 82 // we don't expect any arg reg save area so aarch64 asserts that 83 // frame::arg_reg_save_area_bytes == 0 84 rfp_off = 0, 85 rfp_off2, 86 return_off, return_off2, 87 framesize 88 }; 89 }; 90 91 // FIXME -- this is used by C1 92 class RegisterSaver { 93 const bool _save_vectors; 94 public: 95 RegisterSaver(bool save_vectors) : _save_vectors(save_vectors) {} 96 97 OopMap* save_live_registers(MacroAssembler* masm, int additional_frame_words, int* total_frame_words); 98 void restore_live_registers(MacroAssembler* masm); 99 100 // Offsets into the register save area 101 // Used by deoptimization when it is managing result register 102 // values on its own 103 104 int reg_offset_in_bytes(Register r); 105 int r0_offset_in_bytes() { return reg_offset_in_bytes(r0); } 106 int rscratch1_offset_in_bytes() { return reg_offset_in_bytes(rscratch1); } 107 int v0_offset_in_bytes(); 108 109 // Total stack size in bytes for saving sve predicate registers. 110 int total_sve_predicate_in_bytes(); 111 112 // Capture info about frame layout 113 // Note this is only correct when not saving full vectors. 114 enum layout { 115 fpu_state_off = 0, 116 fpu_state_end = fpu_state_off + FPUStateSizeInWords - 1, 117 // The frame sender code expects that rfp will be in 118 // the "natural" place and will override any oopMap 119 // setting for it. We must therefore force the layout 120 // so that it agrees with the frame sender code. 121 r0_off = fpu_state_off + FPUStateSizeInWords, 122 rfp_off = r0_off + (Register::number_of_registers - 2) * Register::max_slots_per_register, 123 return_off = rfp_off + Register::max_slots_per_register, // slot for return address 124 reg_save_size = return_off + Register::max_slots_per_register}; 125 126 }; 127 128 int RegisterSaver::reg_offset_in_bytes(Register r) { 129 // The integer registers are located above the floating point 130 // registers in the stack frame pushed by save_live_registers() so the 131 // offset depends on whether we are saving full vectors, and whether 132 // those vectors are NEON or SVE. 133 134 int slots_per_vect = FloatRegister::save_slots_per_register; 135 136 #if COMPILER2_OR_JVMCI 137 if (_save_vectors) { 138 slots_per_vect = FloatRegister::slots_per_neon_register; 139 140 #ifdef COMPILER2 141 if (Matcher::supports_scalable_vector()) { 142 slots_per_vect = Matcher::scalable_vector_reg_size(T_FLOAT); 143 } 144 #endif 145 } 146 #endif 147 148 int r0_offset = v0_offset_in_bytes() + (slots_per_vect * FloatRegister::number_of_registers) * BytesPerInt; 149 return r0_offset + r->encoding() * wordSize; 150 } 151 152 int RegisterSaver::v0_offset_in_bytes() { 153 // The floating point registers are located above the predicate registers if 154 // they are present in the stack frame pushed by save_live_registers(). So the 155 // offset depends on the saved total predicate vectors in the stack frame. 156 return (total_sve_predicate_in_bytes() / VMRegImpl::stack_slot_size) * BytesPerInt; 157 } 158 159 int RegisterSaver::total_sve_predicate_in_bytes() { 160 #ifdef COMPILER2 161 if (_save_vectors && Matcher::supports_scalable_vector()) { 162 return (Matcher::scalable_vector_reg_size(T_BYTE) >> LogBitsPerByte) * 163 PRegister::number_of_registers; 164 } 165 #endif 166 return 0; 167 } 168 169 OopMap* RegisterSaver::save_live_registers(MacroAssembler* masm, int additional_frame_words, int* total_frame_words) { 170 bool use_sve = false; 171 int sve_vector_size_in_bytes = 0; 172 int sve_vector_size_in_slots = 0; 173 int sve_predicate_size_in_slots = 0; 174 int total_predicate_in_bytes = total_sve_predicate_in_bytes(); 175 int total_predicate_in_slots = total_predicate_in_bytes / VMRegImpl::stack_slot_size; 176 177 #ifdef COMPILER2 178 use_sve = Matcher::supports_scalable_vector(); 179 if (use_sve) { 180 sve_vector_size_in_bytes = Matcher::scalable_vector_reg_size(T_BYTE); 181 sve_vector_size_in_slots = Matcher::scalable_vector_reg_size(T_FLOAT); 182 sve_predicate_size_in_slots = Matcher::scalable_predicate_reg_slots(); 183 } 184 #endif 185 186 #if COMPILER2_OR_JVMCI 187 if (_save_vectors) { 188 int extra_save_slots_per_register = 0; 189 // Save upper half of vector registers 190 if (use_sve) { 191 extra_save_slots_per_register = sve_vector_size_in_slots - FloatRegister::save_slots_per_register; 192 } else { 193 extra_save_slots_per_register = FloatRegister::extra_save_slots_per_neon_register; 194 } 195 int extra_vector_bytes = extra_save_slots_per_register * 196 VMRegImpl::stack_slot_size * 197 FloatRegister::number_of_registers; 198 additional_frame_words += ((extra_vector_bytes + total_predicate_in_bytes) / wordSize); 199 } 200 #else 201 assert(!_save_vectors, "vectors are generated only by C2 and JVMCI"); 202 #endif 203 204 int frame_size_in_bytes = align_up(additional_frame_words * wordSize + 205 reg_save_size * BytesPerInt, 16); 206 // OopMap frame size is in compiler stack slots (jint's) not bytes or words 207 int frame_size_in_slots = frame_size_in_bytes / BytesPerInt; 208 // The caller will allocate additional_frame_words 209 int additional_frame_slots = additional_frame_words * wordSize / BytesPerInt; 210 // CodeBlob frame size is in words. 211 int frame_size_in_words = frame_size_in_bytes / wordSize; 212 *total_frame_words = frame_size_in_words; 213 214 // Save Integer and Float registers. 215 __ enter(); 216 __ push_CPU_state(_save_vectors, use_sve, sve_vector_size_in_bytes, total_predicate_in_bytes); 217 218 // Set an oopmap for the call site. This oopmap will map all 219 // oop-registers and debug-info registers as callee-saved. This 220 // will allow deoptimization at this safepoint to find all possible 221 // debug-info recordings, as well as let GC find all oops. 222 223 OopMapSet *oop_maps = new OopMapSet(); 224 OopMap* oop_map = new OopMap(frame_size_in_slots, 0); 225 226 for (int i = 0; i < Register::number_of_registers; i++) { 227 Register r = as_Register(i); 228 if (i <= rfp->encoding() && r != rscratch1 && r != rscratch2) { 229 // SP offsets are in 4-byte words. 230 // Register slots are 8 bytes wide, 32 floating-point registers. 231 int sp_offset = Register::max_slots_per_register * i + 232 FloatRegister::save_slots_per_register * FloatRegister::number_of_registers; 233 oop_map->set_callee_saved(VMRegImpl::stack2reg(sp_offset + additional_frame_slots), r->as_VMReg()); 234 } 235 } 236 237 for (int i = 0; i < FloatRegister::number_of_registers; i++) { 238 FloatRegister r = as_FloatRegister(i); 239 int sp_offset = 0; 240 if (_save_vectors) { 241 sp_offset = use_sve ? (total_predicate_in_slots + sve_vector_size_in_slots * i) : 242 (FloatRegister::slots_per_neon_register * i); 243 } else { 244 sp_offset = FloatRegister::save_slots_per_register * i; 245 } 246 oop_map->set_callee_saved(VMRegImpl::stack2reg(sp_offset), r->as_VMReg()); 247 } 248 249 return oop_map; 250 } 251 252 void RegisterSaver::restore_live_registers(MacroAssembler* masm) { 253 #ifdef COMPILER2 254 __ pop_CPU_state(_save_vectors, Matcher::supports_scalable_vector(), 255 Matcher::scalable_vector_reg_size(T_BYTE), total_sve_predicate_in_bytes()); 256 #else 257 #if !INCLUDE_JVMCI 258 assert(!_save_vectors, "vectors are generated only by C2 and JVMCI"); 259 #endif 260 __ pop_CPU_state(_save_vectors); 261 #endif 262 __ ldp(rfp, lr, Address(__ post(sp, 2 * wordSize))); 263 __ authenticate_return_address(); 264 } 265 266 // Is vector's size (in bytes) bigger than a size saved by default? 267 // 8 bytes vector registers are saved by default on AArch64. 268 // The SVE supported min vector size is 8 bytes and we need to save 269 // predicate registers when the vector size is 8 bytes as well. 270 bool SharedRuntime::is_wide_vector(int size) { 271 return size > 8 || (UseSVE > 0 && size >= 8); 272 } 273 274 // --------------------------------------------------------------------------- 275 // Read the array of BasicTypes from a signature, and compute where the 276 // arguments should go. Values in the VMRegPair regs array refer to 4-byte 277 // quantities. Values less than VMRegImpl::stack0 are registers, those above 278 // refer to 4-byte stack slots. All stack slots are based off of the stack pointer 279 // as framesizes are fixed. 280 // VMRegImpl::stack0 refers to the first slot 0(sp). 281 // and VMRegImpl::stack0+1 refers to the memory word 4-byes higher. 282 // Register up to Register::number_of_registers are the 64-bit 283 // integer registers. 284 285 // Note: the INPUTS in sig_bt are in units of Java argument words, 286 // which are 64-bit. The OUTPUTS are in 32-bit units. 287 288 // The Java calling convention is a "shifted" version of the C ABI. 289 // By skipping the first C ABI register we can call non-static jni 290 // methods with small numbers of arguments without having to shuffle 291 // the arguments at all. Since we control the java ABI we ought to at 292 // least get some advantage out of it. 293 294 int SharedRuntime::java_calling_convention(const BasicType *sig_bt, 295 VMRegPair *regs, 296 int total_args_passed) { 297 298 // Create the mapping between argument positions and 299 // registers. 300 static const Register INT_ArgReg[Argument::n_int_register_parameters_j] = { 301 j_rarg0, j_rarg1, j_rarg2, j_rarg3, j_rarg4, j_rarg5, j_rarg6, j_rarg7 302 }; 303 static const FloatRegister FP_ArgReg[Argument::n_float_register_parameters_j] = { 304 j_farg0, j_farg1, j_farg2, j_farg3, 305 j_farg4, j_farg5, j_farg6, j_farg7 306 }; 307 308 309 uint int_args = 0; 310 uint fp_args = 0; 311 uint stk_args = 0; 312 313 for (int i = 0; i < total_args_passed; i++) { 314 switch (sig_bt[i]) { 315 case T_BOOLEAN: 316 case T_CHAR: 317 case T_BYTE: 318 case T_SHORT: 319 case T_INT: 320 if (int_args < Argument::n_int_register_parameters_j) { 321 regs[i].set1(INT_ArgReg[int_args++]->as_VMReg()); 322 } else { 323 stk_args = align_up(stk_args, 2); 324 regs[i].set1(VMRegImpl::stack2reg(stk_args)); 325 stk_args += 1; 326 } 327 break; 328 case T_VOID: 329 // halves of T_LONG or T_DOUBLE 330 assert(i != 0 && (sig_bt[i - 1] == T_LONG || sig_bt[i - 1] == T_DOUBLE), "expecting half"); 331 regs[i].set_bad(); 332 break; 333 case T_LONG: 334 assert((i + 1) < total_args_passed && sig_bt[i + 1] == T_VOID, "expecting half"); 335 // fall through 336 case T_OBJECT: 337 case T_ARRAY: 338 case T_ADDRESS: 339 if (int_args < Argument::n_int_register_parameters_j) { 340 regs[i].set2(INT_ArgReg[int_args++]->as_VMReg()); 341 } else { 342 stk_args = align_up(stk_args, 2); 343 regs[i].set2(VMRegImpl::stack2reg(stk_args)); 344 stk_args += 2; 345 } 346 break; 347 case T_FLOAT: 348 if (fp_args < Argument::n_float_register_parameters_j) { 349 regs[i].set1(FP_ArgReg[fp_args++]->as_VMReg()); 350 } else { 351 stk_args = align_up(stk_args, 2); 352 regs[i].set1(VMRegImpl::stack2reg(stk_args)); 353 stk_args += 1; 354 } 355 break; 356 case T_DOUBLE: 357 assert((i + 1) < total_args_passed && sig_bt[i + 1] == T_VOID, "expecting half"); 358 if (fp_args < Argument::n_float_register_parameters_j) { 359 regs[i].set2(FP_ArgReg[fp_args++]->as_VMReg()); 360 } else { 361 stk_args = align_up(stk_args, 2); 362 regs[i].set2(VMRegImpl::stack2reg(stk_args)); 363 stk_args += 2; 364 } 365 break; 366 default: 367 ShouldNotReachHere(); 368 break; 369 } 370 } 371 372 return stk_args; 373 } 374 375 // Patch the callers callsite with entry to compiled code if it exists. 376 static void patch_callers_callsite(MacroAssembler *masm) { 377 Label L; 378 __ ldr(rscratch1, Address(rmethod, in_bytes(Method::code_offset()))); 379 __ cbz(rscratch1, L); 380 381 __ enter(); 382 __ push_CPU_state(); 383 384 // VM needs caller's callsite 385 // VM needs target method 386 // This needs to be a long call since we will relocate this adapter to 387 // the codeBuffer and it may not reach 388 389 #ifndef PRODUCT 390 assert(frame::arg_reg_save_area_bytes == 0, "not expecting frame reg save area"); 391 #endif 392 393 __ mov(c_rarg0, rmethod); 394 __ mov(c_rarg1, lr); 395 __ authenticate_return_address(c_rarg1); 396 __ lea(rscratch1, RuntimeAddress(CAST_FROM_FN_PTR(address, SharedRuntime::fixup_callers_callsite))); 397 __ blr(rscratch1); 398 399 // Explicit isb required because fixup_callers_callsite may change the code 400 // stream. 401 __ safepoint_isb(); 402 403 __ pop_CPU_state(); 404 // restore sp 405 __ leave(); 406 __ bind(L); 407 } 408 409 static void gen_c2i_adapter(MacroAssembler *masm, 410 int total_args_passed, 411 int comp_args_on_stack, 412 const BasicType *sig_bt, 413 const VMRegPair *regs, 414 Label& skip_fixup) { 415 // Before we get into the guts of the C2I adapter, see if we should be here 416 // at all. We've come from compiled code and are attempting to jump to the 417 // interpreter, which means the caller made a static call to get here 418 // (vcalls always get a compiled target if there is one). Check for a 419 // compiled target. If there is one, we need to patch the caller's call. 420 patch_callers_callsite(masm); 421 422 __ bind(skip_fixup); 423 424 int words_pushed = 0; 425 426 // Since all args are passed on the stack, total_args_passed * 427 // Interpreter::stackElementSize is the space we need. 428 429 int extraspace = total_args_passed * Interpreter::stackElementSize; 430 431 __ mov(r19_sender_sp, sp); 432 433 // stack is aligned, keep it that way 434 extraspace = align_up(extraspace, 2*wordSize); 435 436 if (extraspace) 437 __ sub(sp, sp, extraspace); 438 439 // Now write the args into the outgoing interpreter space 440 for (int i = 0; i < total_args_passed; i++) { 441 if (sig_bt[i] == T_VOID) { 442 assert(i > 0 && (sig_bt[i-1] == T_LONG || sig_bt[i-1] == T_DOUBLE), "missing half"); 443 continue; 444 } 445 446 // offset to start parameters 447 int st_off = (total_args_passed - i - 1) * Interpreter::stackElementSize; 448 int next_off = st_off - Interpreter::stackElementSize; 449 450 // Say 4 args: 451 // i st_off 452 // 0 32 T_LONG 453 // 1 24 T_VOID 454 // 2 16 T_OBJECT 455 // 3 8 T_BOOL 456 // - 0 return address 457 // 458 // However to make thing extra confusing. Because we can fit a Java long/double in 459 // a single slot on a 64 bt vm and it would be silly to break them up, the interpreter 460 // leaves one slot empty and only stores to a single slot. In this case the 461 // slot that is occupied is the T_VOID slot. See I said it was confusing. 462 463 VMReg r_1 = regs[i].first(); 464 VMReg r_2 = regs[i].second(); 465 if (!r_1->is_valid()) { 466 assert(!r_2->is_valid(), ""); 467 continue; 468 } 469 if (r_1->is_stack()) { 470 // memory to memory use rscratch1 471 int ld_off = (r_1->reg2stack() * VMRegImpl::stack_slot_size 472 + extraspace 473 + words_pushed * wordSize); 474 if (!r_2->is_valid()) { 475 // sign extend?? 476 __ ldrw(rscratch1, Address(sp, ld_off)); 477 __ str(rscratch1, Address(sp, st_off)); 478 479 } else { 480 481 __ ldr(rscratch1, Address(sp, ld_off)); 482 483 // Two VMREgs|OptoRegs can be T_OBJECT, T_ADDRESS, T_DOUBLE, T_LONG 484 // T_DOUBLE and T_LONG use two slots in the interpreter 485 if ( sig_bt[i] == T_LONG || sig_bt[i] == T_DOUBLE) { 486 // ld_off == LSW, ld_off+wordSize == MSW 487 // st_off == MSW, next_off == LSW 488 __ str(rscratch1, Address(sp, next_off)); 489 #ifdef ASSERT 490 // Overwrite the unused slot with known junk 491 __ mov(rscratch1, (uint64_t)0xdeadffffdeadaaaaull); 492 __ str(rscratch1, Address(sp, st_off)); 493 #endif /* ASSERT */ 494 } else { 495 __ str(rscratch1, Address(sp, st_off)); 496 } 497 } 498 } else if (r_1->is_Register()) { 499 Register r = r_1->as_Register(); 500 if (!r_2->is_valid()) { 501 // must be only an int (or less ) so move only 32bits to slot 502 // why not sign extend?? 503 __ str(r, Address(sp, st_off)); 504 } else { 505 // Two VMREgs|OptoRegs can be T_OBJECT, T_ADDRESS, T_DOUBLE, T_LONG 506 // T_DOUBLE and T_LONG use two slots in the interpreter 507 if ( sig_bt[i] == T_LONG || sig_bt[i] == T_DOUBLE) { 508 // jlong/double in gpr 509 #ifdef ASSERT 510 // Overwrite the unused slot with known junk 511 __ mov(rscratch1, (uint64_t)0xdeadffffdeadaaabull); 512 __ str(rscratch1, Address(sp, st_off)); 513 #endif /* ASSERT */ 514 __ str(r, Address(sp, next_off)); 515 } else { 516 __ str(r, Address(sp, st_off)); 517 } 518 } 519 } else { 520 assert(r_1->is_FloatRegister(), ""); 521 if (!r_2->is_valid()) { 522 // only a float use just part of the slot 523 __ strs(r_1->as_FloatRegister(), Address(sp, st_off)); 524 } else { 525 #ifdef ASSERT 526 // Overwrite the unused slot with known junk 527 __ mov(rscratch1, (uint64_t)0xdeadffffdeadaaacull); 528 __ str(rscratch1, Address(sp, st_off)); 529 #endif /* ASSERT */ 530 __ strd(r_1->as_FloatRegister(), Address(sp, next_off)); 531 } 532 } 533 } 534 535 __ mov(esp, sp); // Interp expects args on caller's expression stack 536 537 __ ldr(rscratch1, Address(rmethod, in_bytes(Method::interpreter_entry_offset()))); 538 __ br(rscratch1); 539 } 540 541 542 void SharedRuntime::gen_i2c_adapter(MacroAssembler *masm, 543 int total_args_passed, 544 int comp_args_on_stack, 545 const BasicType *sig_bt, 546 const VMRegPair *regs) { 547 548 // Note: r19_sender_sp contains the senderSP on entry. We must 549 // preserve it since we may do a i2c -> c2i transition if we lose a 550 // race where compiled code goes non-entrant while we get args 551 // ready. 552 553 // Adapters are frameless. 554 555 // An i2c adapter is frameless because the *caller* frame, which is 556 // interpreted, routinely repairs its own esp (from 557 // interpreter_frame_last_sp), even if a callee has modified the 558 // stack pointer. It also recalculates and aligns sp. 559 560 // A c2i adapter is frameless because the *callee* frame, which is 561 // interpreted, routinely repairs its caller's sp (from sender_sp, 562 // which is set up via the senderSP register). 563 564 // In other words, if *either* the caller or callee is interpreted, we can 565 // get the stack pointer repaired after a call. 566 567 // This is why c2i and i2c adapters cannot be indefinitely composed. 568 // In particular, if a c2i adapter were to somehow call an i2c adapter, 569 // both caller and callee would be compiled methods, and neither would 570 // clean up the stack pointer changes performed by the two adapters. 571 // If this happens, control eventually transfers back to the compiled 572 // caller, but with an uncorrected stack, causing delayed havoc. 573 574 if (VerifyAdapterCalls && 575 (Interpreter::code() != nullptr || StubRoutines::final_stubs_code() != nullptr)) { 576 #if 0 577 // So, let's test for cascading c2i/i2c adapters right now. 578 // assert(Interpreter::contains($return_addr) || 579 // StubRoutines::contains($return_addr), 580 // "i2c adapter must return to an interpreter frame"); 581 __ block_comment("verify_i2c { "); 582 Label L_ok; 583 if (Interpreter::code() != nullptr) { 584 range_check(masm, rax, r11, 585 Interpreter::code()->code_start(), Interpreter::code()->code_end(), 586 L_ok); 587 } 588 if (StubRoutines::initial_stubs_code() != nullptr) { 589 range_check(masm, rax, r11, 590 StubRoutines::initial_stubs_code()->code_begin(), 591 StubRoutines::initial_stubs_code()->code_end(), 592 L_ok); 593 } 594 if (StubRoutines::final_stubs_code() != nullptr) { 595 range_check(masm, rax, r11, 596 StubRoutines::final_stubs_code()->code_begin(), 597 StubRoutines::final_stubs_code()->code_end(), 598 L_ok); 599 } 600 const char* msg = "i2c adapter must return to an interpreter frame"; 601 __ block_comment(msg); 602 __ stop(msg); 603 __ bind(L_ok); 604 __ block_comment("} verify_i2ce "); 605 #endif 606 } 607 608 // Cut-out for having no stack args. 609 int comp_words_on_stack = align_up(comp_args_on_stack*VMRegImpl::stack_slot_size, wordSize)>>LogBytesPerWord; 610 if (comp_args_on_stack) { 611 __ sub(rscratch1, sp, comp_words_on_stack * wordSize); 612 __ andr(sp, rscratch1, -16); 613 } 614 615 // Will jump to the compiled code just as if compiled code was doing it. 616 // Pre-load the register-jump target early, to schedule it better. 617 __ ldr(rscratch1, Address(rmethod, in_bytes(Method::from_compiled_offset()))); 618 619 #if INCLUDE_JVMCI 620 if (EnableJVMCI) { 621 // check if this call should be routed towards a specific entry point 622 __ ldr(rscratch2, Address(rthread, in_bytes(JavaThread::jvmci_alternate_call_target_offset()))); 623 Label no_alternative_target; 624 __ cbz(rscratch2, no_alternative_target); 625 __ mov(rscratch1, rscratch2); 626 __ str(zr, Address(rthread, in_bytes(JavaThread::jvmci_alternate_call_target_offset()))); 627 __ bind(no_alternative_target); 628 } 629 #endif // INCLUDE_JVMCI 630 631 // Now generate the shuffle code. 632 for (int i = 0; i < total_args_passed; i++) { 633 if (sig_bt[i] == T_VOID) { 634 assert(i > 0 && (sig_bt[i-1] == T_LONG || sig_bt[i-1] == T_DOUBLE), "missing half"); 635 continue; 636 } 637 638 // Pick up 0, 1 or 2 words from SP+offset. 639 640 assert(!regs[i].second()->is_valid() || regs[i].first()->next() == regs[i].second(), 641 "scrambled load targets?"); 642 // Load in argument order going down. 643 int ld_off = (total_args_passed - i - 1)*Interpreter::stackElementSize; 644 // Point to interpreter value (vs. tag) 645 int next_off = ld_off - Interpreter::stackElementSize; 646 // 647 // 648 // 649 VMReg r_1 = regs[i].first(); 650 VMReg r_2 = regs[i].second(); 651 if (!r_1->is_valid()) { 652 assert(!r_2->is_valid(), ""); 653 continue; 654 } 655 if (r_1->is_stack()) { 656 // Convert stack slot to an SP offset (+ wordSize to account for return address ) 657 int st_off = regs[i].first()->reg2stack()*VMRegImpl::stack_slot_size; 658 if (!r_2->is_valid()) { 659 // sign extend??? 660 __ ldrsw(rscratch2, Address(esp, ld_off)); 661 __ str(rscratch2, Address(sp, st_off)); 662 } else { 663 // 664 // We are using two optoregs. This can be either T_OBJECT, 665 // T_ADDRESS, T_LONG, or T_DOUBLE the interpreter allocates 666 // two slots but only uses one for thr T_LONG or T_DOUBLE case 667 // So we must adjust where to pick up the data to match the 668 // interpreter. 669 // 670 // Interpreter local[n] == MSW, local[n+1] == LSW however locals 671 // are accessed as negative so LSW is at LOW address 672 673 // ld_off is MSW so get LSW 674 const int offset = (sig_bt[i]==T_LONG||sig_bt[i]==T_DOUBLE)? 675 next_off : ld_off; 676 __ ldr(rscratch2, Address(esp, offset)); 677 // st_off is LSW (i.e. reg.first()) 678 __ str(rscratch2, Address(sp, st_off)); 679 } 680 } else if (r_1->is_Register()) { // Register argument 681 Register r = r_1->as_Register(); 682 if (r_2->is_valid()) { 683 // 684 // We are using two VMRegs. This can be either T_OBJECT, 685 // T_ADDRESS, T_LONG, or T_DOUBLE the interpreter allocates 686 // two slots but only uses one for thr T_LONG or T_DOUBLE case 687 // So we must adjust where to pick up the data to match the 688 // interpreter. 689 690 const int offset = (sig_bt[i]==T_LONG||sig_bt[i]==T_DOUBLE)? 691 next_off : ld_off; 692 693 // this can be a misaligned move 694 __ ldr(r, Address(esp, offset)); 695 } else { 696 // sign extend and use a full word? 697 __ ldrw(r, Address(esp, ld_off)); 698 } 699 } else { 700 if (!r_2->is_valid()) { 701 __ ldrs(r_1->as_FloatRegister(), Address(esp, ld_off)); 702 } else { 703 __ ldrd(r_1->as_FloatRegister(), Address(esp, next_off)); 704 } 705 } 706 } 707 708 __ mov(rscratch2, rscratch1); 709 __ push_cont_fastpath(rthread); // Set JavaThread::_cont_fastpath to the sp of the oldest interpreted frame we know about; kills rscratch1 710 __ mov(rscratch1, rscratch2); 711 712 // 6243940 We might end up in handle_wrong_method if 713 // the callee is deoptimized as we race thru here. If that 714 // happens we don't want to take a safepoint because the 715 // caller frame will look interpreted and arguments are now 716 // "compiled" so it is much better to make this transition 717 // invisible to the stack walking code. Unfortunately if 718 // we try and find the callee by normal means a safepoint 719 // is possible. So we stash the desired callee in the thread 720 // and the vm will find there should this case occur. 721 722 __ str(rmethod, Address(rthread, JavaThread::callee_target_offset())); 723 724 __ br(rscratch1); 725 } 726 727 // --------------------------------------------------------------- 728 AdapterHandlerEntry* SharedRuntime::generate_i2c2i_adapters(MacroAssembler *masm, 729 int total_args_passed, 730 int comp_args_on_stack, 731 const BasicType *sig_bt, 732 const VMRegPair *regs, 733 AdapterFingerPrint* fingerprint) { 734 address i2c_entry = __ pc(); 735 736 gen_i2c_adapter(masm, total_args_passed, comp_args_on_stack, sig_bt, regs); 737 738 address c2i_unverified_entry = __ pc(); 739 Label skip_fixup; 740 741 Register data = rscratch2; 742 Register receiver = j_rarg0; 743 Register tmp = r10; // A call-clobbered register not used for arg passing 744 745 // ------------------------------------------------------------------------- 746 // Generate a C2I adapter. On entry we know rmethod holds the Method* during calls 747 // to the interpreter. The args start out packed in the compiled layout. They 748 // need to be unpacked into the interpreter layout. This will almost always 749 // require some stack space. We grow the current (compiled) stack, then repack 750 // the args. We finally end in a jump to the generic interpreter entry point. 751 // On exit from the interpreter, the interpreter will restore our SP (lest the 752 // compiled code, which relies solely on SP and not FP, get sick). 753 754 { 755 __ block_comment("c2i_unverified_entry {"); 756 // Method might have been compiled since the call site was patched to 757 // interpreted; if that is the case treat it as a miss so we can get 758 // the call site corrected. 759 __ ic_check(1 /* end_alignment */); 760 __ ldr(rmethod, Address(data, CompiledICData::speculated_method_offset())); 761 762 __ ldr(rscratch1, Address(rmethod, in_bytes(Method::code_offset()))); 763 __ cbz(rscratch1, skip_fixup); 764 __ far_jump(RuntimeAddress(SharedRuntime::get_ic_miss_stub())); 765 __ block_comment("} c2i_unverified_entry"); 766 } 767 768 address c2i_entry = __ pc(); 769 770 // Class initialization barrier for static methods 771 address c2i_no_clinit_check_entry = nullptr; 772 if (VM_Version::supports_fast_class_init_checks()) { 773 Label L_skip_barrier; 774 775 { // Bypass the barrier for non-static methods 776 __ ldrw(rscratch1, Address(rmethod, Method::access_flags_offset())); 777 __ andsw(zr, rscratch1, JVM_ACC_STATIC); 778 __ br(Assembler::EQ, L_skip_barrier); // non-static 779 } 780 781 __ load_method_holder(rscratch2, rmethod); 782 __ clinit_barrier(rscratch2, rscratch1, &L_skip_barrier); 783 __ far_jump(RuntimeAddress(SharedRuntime::get_handle_wrong_method_stub())); 784 785 __ bind(L_skip_barrier); 786 c2i_no_clinit_check_entry = __ pc(); 787 } 788 789 BarrierSetAssembler* bs = BarrierSet::barrier_set()->barrier_set_assembler(); 790 bs->c2i_entry_barrier(masm); 791 792 gen_c2i_adapter(masm, total_args_passed, comp_args_on_stack, sig_bt, regs, skip_fixup); 793 794 return AdapterHandlerLibrary::new_entry(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry, c2i_no_clinit_check_entry); 795 } 796 797 static int c_calling_convention_priv(const BasicType *sig_bt, 798 VMRegPair *regs, 799 int total_args_passed) { 800 801 // We return the amount of VMRegImpl stack slots we need to reserve for all 802 // the arguments NOT counting out_preserve_stack_slots. 803 804 static const Register INT_ArgReg[Argument::n_int_register_parameters_c] = { 805 c_rarg0, c_rarg1, c_rarg2, c_rarg3, c_rarg4, c_rarg5, c_rarg6, c_rarg7 806 }; 807 static const FloatRegister FP_ArgReg[Argument::n_float_register_parameters_c] = { 808 c_farg0, c_farg1, c_farg2, c_farg3, 809 c_farg4, c_farg5, c_farg6, c_farg7 810 }; 811 812 uint int_args = 0; 813 uint fp_args = 0; 814 uint stk_args = 0; // inc by 2 each time 815 816 for (int i = 0; i < total_args_passed; i++) { 817 switch (sig_bt[i]) { 818 case T_BOOLEAN: 819 case T_CHAR: 820 case T_BYTE: 821 case T_SHORT: 822 case T_INT: 823 if (int_args < Argument::n_int_register_parameters_c) { 824 regs[i].set1(INT_ArgReg[int_args++]->as_VMReg()); 825 } else { 826 #ifdef __APPLE__ 827 // Less-than word types are stored one after another. 828 // The code is unable to handle this so bailout. 829 return -1; 830 #endif 831 regs[i].set1(VMRegImpl::stack2reg(stk_args)); 832 stk_args += 2; 833 } 834 break; 835 case T_LONG: 836 assert((i + 1) < total_args_passed && sig_bt[i + 1] == T_VOID, "expecting half"); 837 // fall through 838 case T_OBJECT: 839 case T_ARRAY: 840 case T_ADDRESS: 841 case T_METADATA: 842 if (int_args < Argument::n_int_register_parameters_c) { 843 regs[i].set2(INT_ArgReg[int_args++]->as_VMReg()); 844 } else { 845 regs[i].set2(VMRegImpl::stack2reg(stk_args)); 846 stk_args += 2; 847 } 848 break; 849 case T_FLOAT: 850 if (fp_args < Argument::n_float_register_parameters_c) { 851 regs[i].set1(FP_ArgReg[fp_args++]->as_VMReg()); 852 } else { 853 #ifdef __APPLE__ 854 // Less-than word types are stored one after another. 855 // The code is unable to handle this so bailout. 856 return -1; 857 #endif 858 regs[i].set1(VMRegImpl::stack2reg(stk_args)); 859 stk_args += 2; 860 } 861 break; 862 case T_DOUBLE: 863 assert((i + 1) < total_args_passed && sig_bt[i + 1] == T_VOID, "expecting half"); 864 if (fp_args < Argument::n_float_register_parameters_c) { 865 regs[i].set2(FP_ArgReg[fp_args++]->as_VMReg()); 866 } else { 867 regs[i].set2(VMRegImpl::stack2reg(stk_args)); 868 stk_args += 2; 869 } 870 break; 871 case T_VOID: // Halves of longs and doubles 872 assert(i != 0 && (sig_bt[i - 1] == T_LONG || sig_bt[i - 1] == T_DOUBLE), "expecting half"); 873 regs[i].set_bad(); 874 break; 875 default: 876 ShouldNotReachHere(); 877 break; 878 } 879 } 880 881 return stk_args; 882 } 883 884 int SharedRuntime::vector_calling_convention(VMRegPair *regs, 885 uint num_bits, 886 uint total_args_passed) { 887 Unimplemented(); 888 return 0; 889 } 890 891 int SharedRuntime::c_calling_convention(const BasicType *sig_bt, 892 VMRegPair *regs, 893 int total_args_passed) 894 { 895 int result = c_calling_convention_priv(sig_bt, regs, total_args_passed); 896 guarantee(result >= 0, "Unsupported arguments configuration"); 897 return result; 898 } 899 900 901 void SharedRuntime::save_native_result(MacroAssembler *masm, BasicType ret_type, int frame_slots) { 902 // We always ignore the frame_slots arg and just use the space just below frame pointer 903 // which by this time is free to use 904 switch (ret_type) { 905 case T_FLOAT: 906 __ strs(v0, Address(rfp, -wordSize)); 907 break; 908 case T_DOUBLE: 909 __ strd(v0, Address(rfp, -wordSize)); 910 break; 911 case T_VOID: break; 912 default: { 913 __ str(r0, Address(rfp, -wordSize)); 914 } 915 } 916 } 917 918 void SharedRuntime::restore_native_result(MacroAssembler *masm, BasicType ret_type, int frame_slots) { 919 // We always ignore the frame_slots arg and just use the space just below frame pointer 920 // which by this time is free to use 921 switch (ret_type) { 922 case T_FLOAT: 923 __ ldrs(v0, Address(rfp, -wordSize)); 924 break; 925 case T_DOUBLE: 926 __ ldrd(v0, Address(rfp, -wordSize)); 927 break; 928 case T_VOID: break; 929 default: { 930 __ ldr(r0, Address(rfp, -wordSize)); 931 } 932 } 933 } 934 static void save_args(MacroAssembler *masm, int arg_count, int first_arg, VMRegPair *args) { 935 RegSet x; 936 for ( int i = first_arg ; i < arg_count ; i++ ) { 937 if (args[i].first()->is_Register()) { 938 x = x + args[i].first()->as_Register(); 939 } else if (args[i].first()->is_FloatRegister()) { 940 __ strd(args[i].first()->as_FloatRegister(), Address(__ pre(sp, -2 * wordSize))); 941 } 942 } 943 __ push(x, sp); 944 } 945 946 static void restore_args(MacroAssembler *masm, int arg_count, int first_arg, VMRegPair *args) { 947 RegSet x; 948 for ( int i = first_arg ; i < arg_count ; i++ ) { 949 if (args[i].first()->is_Register()) { 950 x = x + args[i].first()->as_Register(); 951 } else { 952 ; 953 } 954 } 955 __ pop(x, sp); 956 for ( int i = arg_count - 1 ; i >= first_arg ; i-- ) { 957 if (args[i].first()->is_Register()) { 958 ; 959 } else if (args[i].first()->is_FloatRegister()) { 960 __ ldrd(args[i].first()->as_FloatRegister(), Address(__ post(sp, 2 * wordSize))); 961 } 962 } 963 } 964 965 static void verify_oop_args(MacroAssembler* masm, 966 const methodHandle& method, 967 const BasicType* sig_bt, 968 const VMRegPair* regs) { 969 Register temp_reg = r19; // not part of any compiled calling seq 970 if (VerifyOops) { 971 for (int i = 0; i < method->size_of_parameters(); i++) { 972 if (sig_bt[i] == T_OBJECT || 973 sig_bt[i] == T_ARRAY) { 974 VMReg r = regs[i].first(); 975 assert(r->is_valid(), "bad oop arg"); 976 if (r->is_stack()) { 977 __ ldr(temp_reg, Address(sp, r->reg2stack() * VMRegImpl::stack_slot_size)); 978 __ verify_oop(temp_reg); 979 } else { 980 __ verify_oop(r->as_Register()); 981 } 982 } 983 } 984 } 985 } 986 987 // on exit, sp points to the ContinuationEntry 988 static OopMap* continuation_enter_setup(MacroAssembler* masm, int& stack_slots) { 989 assert(ContinuationEntry::size() % VMRegImpl::stack_slot_size == 0, ""); 990 assert(in_bytes(ContinuationEntry::cont_offset()) % VMRegImpl::stack_slot_size == 0, ""); 991 assert(in_bytes(ContinuationEntry::chunk_offset()) % VMRegImpl::stack_slot_size == 0, ""); 992 993 stack_slots += (int)ContinuationEntry::size()/wordSize; 994 __ sub(sp, sp, (int)ContinuationEntry::size()); // place Continuation metadata 995 996 OopMap* map = new OopMap(((int)ContinuationEntry::size() + wordSize)/ VMRegImpl::stack_slot_size, 0 /* arg_slots*/); 997 998 __ ldr(rscratch1, Address(rthread, JavaThread::cont_entry_offset())); 999 __ str(rscratch1, Address(sp, ContinuationEntry::parent_offset())); 1000 __ mov(rscratch1, sp); // we can't use sp as the source in str 1001 __ str(rscratch1, Address(rthread, JavaThread::cont_entry_offset())); 1002 1003 return map; 1004 } 1005 1006 // on entry c_rarg1 points to the continuation 1007 // sp points to ContinuationEntry 1008 // c_rarg3 -- isVirtualThread 1009 static void fill_continuation_entry(MacroAssembler* masm) { 1010 #ifdef ASSERT 1011 __ movw(rscratch1, ContinuationEntry::cookie_value()); 1012 __ strw(rscratch1, Address(sp, ContinuationEntry::cookie_offset())); 1013 #endif 1014 1015 __ str (c_rarg1, Address(sp, ContinuationEntry::cont_offset())); 1016 __ strw(c_rarg3, Address(sp, ContinuationEntry::flags_offset())); 1017 __ str (zr, Address(sp, ContinuationEntry::chunk_offset())); 1018 __ strw(zr, Address(sp, ContinuationEntry::argsize_offset())); 1019 __ strw(zr, Address(sp, ContinuationEntry::pin_count_offset())); 1020 1021 __ ldr(rscratch1, Address(rthread, JavaThread::cont_fastpath_offset())); 1022 __ str(rscratch1, Address(sp, ContinuationEntry::parent_cont_fastpath_offset())); 1023 __ ldr(rscratch1, Address(rthread, JavaThread::held_monitor_count_offset())); 1024 __ str(rscratch1, Address(sp, ContinuationEntry::parent_held_monitor_count_offset())); 1025 1026 __ str(zr, Address(rthread, JavaThread::cont_fastpath_offset())); 1027 __ str(zr, Address(rthread, JavaThread::held_monitor_count_offset())); 1028 } 1029 1030 // on entry, sp points to the ContinuationEntry 1031 // on exit, rfp points to the spilled rfp in the entry frame 1032 static void continuation_enter_cleanup(MacroAssembler* masm) { 1033 #ifndef PRODUCT 1034 Label OK; 1035 __ ldr(rscratch1, Address(rthread, JavaThread::cont_entry_offset())); 1036 __ cmp(sp, rscratch1); 1037 __ br(Assembler::EQ, OK); 1038 __ stop("incorrect sp1"); 1039 __ bind(OK); 1040 #endif 1041 1042 __ ldr(rscratch1, Address(sp, ContinuationEntry::parent_cont_fastpath_offset())); 1043 __ str(rscratch1, Address(rthread, JavaThread::cont_fastpath_offset())); 1044 __ ldr(rscratch1, Address(sp, ContinuationEntry::parent_held_monitor_count_offset())); 1045 __ str(rscratch1, Address(rthread, JavaThread::held_monitor_count_offset())); 1046 1047 __ ldr(rscratch2, Address(sp, ContinuationEntry::parent_offset())); 1048 __ str(rscratch2, Address(rthread, JavaThread::cont_entry_offset())); 1049 __ add(rfp, sp, (int)ContinuationEntry::size()); 1050 } 1051 1052 // enterSpecial(Continuation c, boolean isContinue, boolean isVirtualThread) 1053 // On entry: c_rarg1 -- the continuation object 1054 // c_rarg2 -- isContinue 1055 // c_rarg3 -- isVirtualThread 1056 static void gen_continuation_enter(MacroAssembler* masm, 1057 const methodHandle& method, 1058 const BasicType* sig_bt, 1059 const VMRegPair* regs, 1060 int& exception_offset, 1061 OopMapSet*oop_maps, 1062 int& frame_complete, 1063 int& stack_slots, 1064 int& interpreted_entry_offset, 1065 int& compiled_entry_offset) { 1066 //verify_oop_args(masm, method, sig_bt, regs); 1067 Address resolve(SharedRuntime::get_resolve_static_call_stub(), relocInfo::static_call_type); 1068 1069 address start = __ pc(); 1070 1071 Label call_thaw, exit; 1072 1073 // i2i entry used at interp_only_mode only 1074 interpreted_entry_offset = __ pc() - start; 1075 { 1076 1077 #ifdef ASSERT 1078 Label is_interp_only; 1079 __ ldrw(rscratch1, Address(rthread, JavaThread::interp_only_mode_offset())); 1080 __ cbnzw(rscratch1, is_interp_only); 1081 __ stop("enterSpecial interpreter entry called when not in interp_only_mode"); 1082 __ bind(is_interp_only); 1083 #endif 1084 1085 // Read interpreter arguments into registers (this is an ad-hoc i2c adapter) 1086 __ ldr(c_rarg1, Address(esp, Interpreter::stackElementSize*2)); 1087 __ ldr(c_rarg2, Address(esp, Interpreter::stackElementSize*1)); 1088 __ ldr(c_rarg3, Address(esp, Interpreter::stackElementSize*0)); 1089 __ push_cont_fastpath(rthread); 1090 1091 __ enter(); 1092 stack_slots = 2; // will be adjusted in setup 1093 OopMap* map = continuation_enter_setup(masm, stack_slots); 1094 // The frame is complete here, but we only record it for the compiled entry, so the frame would appear unsafe, 1095 // but that's okay because at the very worst we'll miss an async sample, but we're in interp_only_mode anyway. 1096 1097 fill_continuation_entry(masm); 1098 1099 __ cbnz(c_rarg2, call_thaw); 1100 1101 const address tr_call = __ trampoline_call(resolve); 1102 if (tr_call == nullptr) { 1103 fatal("CodeCache is full at gen_continuation_enter"); 1104 } 1105 1106 oop_maps->add_gc_map(__ pc() - start, map); 1107 __ post_call_nop(); 1108 1109 __ b(exit); 1110 1111 address stub = CompiledDirectCall::emit_to_interp_stub(masm, tr_call); 1112 if (stub == nullptr) { 1113 fatal("CodeCache is full at gen_continuation_enter"); 1114 } 1115 } 1116 1117 // compiled entry 1118 __ align(CodeEntryAlignment); 1119 compiled_entry_offset = __ pc() - start; 1120 1121 __ enter(); 1122 stack_slots = 2; // will be adjusted in setup 1123 OopMap* map = continuation_enter_setup(masm, stack_slots); 1124 frame_complete = __ pc() - start; 1125 1126 fill_continuation_entry(masm); 1127 1128 __ cbnz(c_rarg2, call_thaw); 1129 1130 const address tr_call = __ trampoline_call(resolve); 1131 if (tr_call == nullptr) { 1132 fatal("CodeCache is full at gen_continuation_enter"); 1133 } 1134 1135 oop_maps->add_gc_map(__ pc() - start, map); 1136 __ post_call_nop(); 1137 1138 __ b(exit); 1139 1140 __ bind(call_thaw); 1141 1142 __ rt_call(CAST_FROM_FN_PTR(address, StubRoutines::cont_thaw())); 1143 oop_maps->add_gc_map(__ pc() - start, map->deep_copy()); 1144 ContinuationEntry::_return_pc_offset = __ pc() - start; 1145 __ post_call_nop(); 1146 1147 __ bind(exit); 1148 continuation_enter_cleanup(masm); 1149 __ leave(); 1150 __ ret(lr); 1151 1152 /// exception handling 1153 1154 exception_offset = __ pc() - start; 1155 { 1156 __ mov(r19, r0); // save return value contaning the exception oop in callee-saved R19 1157 1158 continuation_enter_cleanup(masm); 1159 1160 __ ldr(c_rarg1, Address(rfp, wordSize)); // return address 1161 __ authenticate_return_address(c_rarg1); 1162 __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::exception_handler_for_return_address), rthread, c_rarg1); 1163 1164 // see OptoRuntime::generate_exception_blob: r0 -- exception oop, r3 -- exception pc 1165 1166 __ mov(r1, r0); // the exception handler 1167 __ mov(r0, r19); // restore return value contaning the exception oop 1168 __ verify_oop(r0); 1169 1170 __ leave(); 1171 __ mov(r3, lr); 1172 __ br(r1); // the exception handler 1173 } 1174 1175 address stub = CompiledDirectCall::emit_to_interp_stub(masm, tr_call); 1176 if (stub == nullptr) { 1177 fatal("CodeCache is full at gen_continuation_enter"); 1178 } 1179 } 1180 1181 static void gen_continuation_yield(MacroAssembler* masm, 1182 const methodHandle& method, 1183 const BasicType* sig_bt, 1184 const VMRegPair* regs, 1185 OopMapSet* oop_maps, 1186 int& frame_complete, 1187 int& stack_slots, 1188 int& compiled_entry_offset) { 1189 enum layout { 1190 rfp_off1, 1191 rfp_off2, 1192 lr_off, 1193 lr_off2, 1194 framesize // inclusive of return address 1195 }; 1196 // assert(is_even(framesize/2), "sp not 16-byte aligned"); 1197 stack_slots = framesize / VMRegImpl::slots_per_word; 1198 assert(stack_slots == 2, "recheck layout"); 1199 1200 address start = __ pc(); 1201 1202 compiled_entry_offset = __ pc() - start; 1203 __ enter(); 1204 1205 __ mov(c_rarg1, sp); 1206 1207 frame_complete = __ pc() - start; 1208 address the_pc = __ pc(); 1209 1210 __ post_call_nop(); // this must be exactly after the pc value that is pushed into the frame info, we use this nop for fast CodeBlob lookup 1211 1212 __ mov(c_rarg0, rthread); 1213 __ set_last_Java_frame(sp, rfp, the_pc, rscratch1); 1214 __ call_VM_leaf(Continuation::freeze_entry(), 2); 1215 __ reset_last_Java_frame(true); 1216 1217 Label pinned; 1218 1219 __ cbnz(r0, pinned); 1220 1221 // We've succeeded, set sp to the ContinuationEntry 1222 __ ldr(rscratch1, Address(rthread, JavaThread::cont_entry_offset())); 1223 __ mov(sp, rscratch1); 1224 continuation_enter_cleanup(masm); 1225 1226 __ bind(pinned); // pinned -- return to caller 1227 1228 // handle pending exception thrown by freeze 1229 __ ldr(rscratch1, Address(rthread, in_bytes(Thread::pending_exception_offset()))); 1230 Label ok; 1231 __ cbz(rscratch1, ok); 1232 __ leave(); 1233 __ lea(rscratch1, RuntimeAddress(StubRoutines::forward_exception_entry())); 1234 __ br(rscratch1); 1235 __ bind(ok); 1236 1237 __ leave(); 1238 __ ret(lr); 1239 1240 OopMap* map = new OopMap(framesize, 1); 1241 oop_maps->add_gc_map(the_pc - start, map); 1242 } 1243 1244 static void gen_special_dispatch(MacroAssembler* masm, 1245 const methodHandle& method, 1246 const BasicType* sig_bt, 1247 const VMRegPair* regs) { 1248 verify_oop_args(masm, method, sig_bt, regs); 1249 vmIntrinsics::ID iid = method->intrinsic_id(); 1250 1251 // Now write the args into the outgoing interpreter space 1252 bool has_receiver = false; 1253 Register receiver_reg = noreg; 1254 int member_arg_pos = -1; 1255 Register member_reg = noreg; 1256 int ref_kind = MethodHandles::signature_polymorphic_intrinsic_ref_kind(iid); 1257 if (ref_kind != 0) { 1258 member_arg_pos = method->size_of_parameters() - 1; // trailing MemberName argument 1259 member_reg = r19; // known to be free at this point 1260 has_receiver = MethodHandles::ref_kind_has_receiver(ref_kind); 1261 } else if (iid == vmIntrinsics::_invokeBasic) { 1262 has_receiver = true; 1263 } else if (iid == vmIntrinsics::_linkToNative) { 1264 member_arg_pos = method->size_of_parameters() - 1; // trailing NativeEntryPoint argument 1265 member_reg = r19; // known to be free at this point 1266 } else { 1267 fatal("unexpected intrinsic id %d", vmIntrinsics::as_int(iid)); 1268 } 1269 1270 if (member_reg != noreg) { 1271 // Load the member_arg into register, if necessary. 1272 SharedRuntime::check_member_name_argument_is_last_argument(method, sig_bt, regs); 1273 VMReg r = regs[member_arg_pos].first(); 1274 if (r->is_stack()) { 1275 __ ldr(member_reg, Address(sp, r->reg2stack() * VMRegImpl::stack_slot_size)); 1276 } else { 1277 // no data motion is needed 1278 member_reg = r->as_Register(); 1279 } 1280 } 1281 1282 if (has_receiver) { 1283 // Make sure the receiver is loaded into a register. 1284 assert(method->size_of_parameters() > 0, "oob"); 1285 assert(sig_bt[0] == T_OBJECT, "receiver argument must be an object"); 1286 VMReg r = regs[0].first(); 1287 assert(r->is_valid(), "bad receiver arg"); 1288 if (r->is_stack()) { 1289 // Porting note: This assumes that compiled calling conventions always 1290 // pass the receiver oop in a register. If this is not true on some 1291 // platform, pick a temp and load the receiver from stack. 1292 fatal("receiver always in a register"); 1293 receiver_reg = r2; // known to be free at this point 1294 __ ldr(receiver_reg, Address(sp, r->reg2stack() * VMRegImpl::stack_slot_size)); 1295 } else { 1296 // no data motion is needed 1297 receiver_reg = r->as_Register(); 1298 } 1299 } 1300 1301 // Figure out which address we are really jumping to: 1302 MethodHandles::generate_method_handle_dispatch(masm, iid, 1303 receiver_reg, member_reg, /*for_compiler_entry:*/ true); 1304 } 1305 1306 // --------------------------------------------------------------------------- 1307 // Generate a native wrapper for a given method. The method takes arguments 1308 // in the Java compiled code convention, marshals them to the native 1309 // convention (handlizes oops, etc), transitions to native, makes the call, 1310 // returns to java state (possibly blocking), unhandlizes any result and 1311 // returns. 1312 // 1313 // Critical native functions are a shorthand for the use of 1314 // GetPrimtiveArrayCritical and disallow the use of any other JNI 1315 // functions. The wrapper is expected to unpack the arguments before 1316 // passing them to the callee. Critical native functions leave the state _in_Java, 1317 // since they block out GC. 1318 // Some other parts of JNI setup are skipped like the tear down of the JNI handle 1319 // block and the check for pending exceptions it's impossible for them 1320 // to be thrown. 1321 // 1322 nmethod* SharedRuntime::generate_native_wrapper(MacroAssembler* masm, 1323 const methodHandle& method, 1324 int compile_id, 1325 BasicType* in_sig_bt, 1326 VMRegPair* in_regs, 1327 BasicType ret_type) { 1328 if (method->is_continuation_native_intrinsic()) { 1329 int exception_offset = -1; 1330 OopMapSet* oop_maps = new OopMapSet(); 1331 int frame_complete = -1; 1332 int stack_slots = -1; 1333 int interpreted_entry_offset = -1; 1334 int vep_offset = -1; 1335 if (method->is_continuation_enter_intrinsic()) { 1336 gen_continuation_enter(masm, 1337 method, 1338 in_sig_bt, 1339 in_regs, 1340 exception_offset, 1341 oop_maps, 1342 frame_complete, 1343 stack_slots, 1344 interpreted_entry_offset, 1345 vep_offset); 1346 } else if (method->is_continuation_yield_intrinsic()) { 1347 gen_continuation_yield(masm, 1348 method, 1349 in_sig_bt, 1350 in_regs, 1351 oop_maps, 1352 frame_complete, 1353 stack_slots, 1354 vep_offset); 1355 } else { 1356 guarantee(false, "Unknown Continuation native intrinsic"); 1357 } 1358 1359 #ifdef ASSERT 1360 if (method->is_continuation_enter_intrinsic()) { 1361 assert(interpreted_entry_offset != -1, "Must be set"); 1362 assert(exception_offset != -1, "Must be set"); 1363 } else { 1364 assert(interpreted_entry_offset == -1, "Must be unset"); 1365 assert(exception_offset == -1, "Must be unset"); 1366 } 1367 assert(frame_complete != -1, "Must be set"); 1368 assert(stack_slots != -1, "Must be set"); 1369 assert(vep_offset != -1, "Must be set"); 1370 #endif 1371 1372 __ flush(); 1373 nmethod* nm = nmethod::new_native_nmethod(method, 1374 compile_id, 1375 masm->code(), 1376 vep_offset, 1377 frame_complete, 1378 stack_slots, 1379 in_ByteSize(-1), 1380 in_ByteSize(-1), 1381 oop_maps, 1382 exception_offset); 1383 if (nm == nullptr) return nm; 1384 if (method->is_continuation_enter_intrinsic()) { 1385 ContinuationEntry::set_enter_code(nm, interpreted_entry_offset); 1386 } else if (method->is_continuation_yield_intrinsic()) { 1387 _cont_doYield_stub = nm; 1388 } else { 1389 guarantee(false, "Unknown Continuation native intrinsic"); 1390 } 1391 return nm; 1392 } 1393 1394 if (method->is_method_handle_intrinsic()) { 1395 vmIntrinsics::ID iid = method->intrinsic_id(); 1396 intptr_t start = (intptr_t)__ pc(); 1397 int vep_offset = ((intptr_t)__ pc()) - start; 1398 1399 // First instruction must be a nop as it may need to be patched on deoptimisation 1400 __ nop(); 1401 gen_special_dispatch(masm, 1402 method, 1403 in_sig_bt, 1404 in_regs); 1405 int frame_complete = ((intptr_t)__ pc()) - start; // not complete, period 1406 __ flush(); 1407 int stack_slots = SharedRuntime::out_preserve_stack_slots(); // no out slots at all, actually 1408 return nmethod::new_native_nmethod(method, 1409 compile_id, 1410 masm->code(), 1411 vep_offset, 1412 frame_complete, 1413 stack_slots / VMRegImpl::slots_per_word, 1414 in_ByteSize(-1), 1415 in_ByteSize(-1), 1416 nullptr); 1417 } 1418 address native_func = method->native_function(); 1419 assert(native_func != nullptr, "must have function"); 1420 1421 // An OopMap for lock (and class if static) 1422 OopMapSet *oop_maps = new OopMapSet(); 1423 intptr_t start = (intptr_t)__ pc(); 1424 1425 // We have received a description of where all the java arg are located 1426 // on entry to the wrapper. We need to convert these args to where 1427 // the jni function will expect them. To figure out where they go 1428 // we convert the java signature to a C signature by inserting 1429 // the hidden arguments as arg[0] and possibly arg[1] (static method) 1430 1431 const int total_in_args = method->size_of_parameters(); 1432 int total_c_args = total_in_args + (method->is_static() ? 2 : 1); 1433 1434 BasicType* out_sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_c_args); 1435 VMRegPair* out_regs = NEW_RESOURCE_ARRAY(VMRegPair, total_c_args); 1436 BasicType* in_elem_bt = nullptr; 1437 1438 int argc = 0; 1439 out_sig_bt[argc++] = T_ADDRESS; 1440 if (method->is_static()) { 1441 out_sig_bt[argc++] = T_OBJECT; 1442 } 1443 1444 for (int i = 0; i < total_in_args ; i++ ) { 1445 out_sig_bt[argc++] = in_sig_bt[i]; 1446 } 1447 1448 // Now figure out where the args must be stored and how much stack space 1449 // they require. 1450 int out_arg_slots; 1451 out_arg_slots = c_calling_convention_priv(out_sig_bt, out_regs, total_c_args); 1452 1453 if (out_arg_slots < 0) { 1454 return nullptr; 1455 } 1456 1457 // Compute framesize for the wrapper. We need to handlize all oops in 1458 // incoming registers 1459 1460 // Calculate the total number of stack slots we will need. 1461 1462 // First count the abi requirement plus all of the outgoing args 1463 int stack_slots = SharedRuntime::out_preserve_stack_slots() + out_arg_slots; 1464 1465 // Now the space for the inbound oop handle area 1466 int total_save_slots = 8 * VMRegImpl::slots_per_word; // 8 arguments passed in registers 1467 1468 int oop_handle_offset = stack_slots; 1469 stack_slots += total_save_slots; 1470 1471 // Now any space we need for handlizing a klass if static method 1472 1473 int klass_slot_offset = 0; 1474 int klass_offset = -1; 1475 int lock_slot_offset = 0; 1476 bool is_static = false; 1477 1478 if (method->is_static()) { 1479 klass_slot_offset = stack_slots; 1480 stack_slots += VMRegImpl::slots_per_word; 1481 klass_offset = klass_slot_offset * VMRegImpl::stack_slot_size; 1482 is_static = true; 1483 } 1484 1485 // Plus a lock if needed 1486 1487 if (method->is_synchronized()) { 1488 lock_slot_offset = stack_slots; 1489 stack_slots += VMRegImpl::slots_per_word; 1490 } 1491 1492 // Now a place (+2) to save return values or temp during shuffling 1493 // + 4 for return address (which we own) and saved rfp 1494 stack_slots += 6; 1495 1496 // Ok The space we have allocated will look like: 1497 // 1498 // 1499 // FP-> | | 1500 // |---------------------| 1501 // | 2 slots for moves | 1502 // |---------------------| 1503 // | lock box (if sync) | 1504 // |---------------------| <- lock_slot_offset 1505 // | klass (if static) | 1506 // |---------------------| <- klass_slot_offset 1507 // | oopHandle area | 1508 // |---------------------| <- oop_handle_offset (8 java arg registers) 1509 // | outbound memory | 1510 // | based arguments | 1511 // | | 1512 // |---------------------| 1513 // | | 1514 // SP-> | out_preserved_slots | 1515 // 1516 // 1517 1518 1519 // Now compute actual number of stack words we need rounding to make 1520 // stack properly aligned. 1521 stack_slots = align_up(stack_slots, StackAlignmentInSlots); 1522 1523 int stack_size = stack_slots * VMRegImpl::stack_slot_size; 1524 1525 // First thing make an ic check to see if we should even be here 1526 1527 // We are free to use all registers as temps without saving them and 1528 // restoring them except rfp. rfp is the only callee save register 1529 // as far as the interpreter and the compiler(s) are concerned. 1530 1531 const Register receiver = j_rarg0; 1532 1533 Label exception_pending; 1534 1535 assert_different_registers(receiver, rscratch1); 1536 __ verify_oop(receiver); 1537 __ ic_check(8 /* end_alignment */); 1538 1539 // Verified entry point must be aligned 1540 int vep_offset = ((intptr_t)__ pc()) - start; 1541 1542 // If we have to make this method not-entrant we'll overwrite its 1543 // first instruction with a jump. For this action to be legal we 1544 // must ensure that this first instruction is a B, BL, NOP, BKPT, 1545 // SVC, HVC, or SMC. Make it a NOP. 1546 __ nop(); 1547 1548 if (VM_Version::supports_fast_class_init_checks() && method->needs_clinit_barrier()) { 1549 Label L_skip_barrier; 1550 __ mov_metadata(rscratch2, method->method_holder()); // InstanceKlass* 1551 __ clinit_barrier(rscratch2, rscratch1, &L_skip_barrier); 1552 __ far_jump(RuntimeAddress(SharedRuntime::get_handle_wrong_method_stub())); 1553 1554 __ bind(L_skip_barrier); 1555 } 1556 1557 // Generate stack overflow check 1558 __ bang_stack_with_offset(checked_cast<int>(StackOverflow::stack_shadow_zone_size())); 1559 1560 // Generate a new frame for the wrapper. 1561 __ enter(); 1562 // -2 because return address is already present and so is saved rfp 1563 __ sub(sp, sp, stack_size - 2*wordSize); 1564 1565 BarrierSetAssembler* bs = BarrierSet::barrier_set()->barrier_set_assembler(); 1566 bs->nmethod_entry_barrier(masm, nullptr /* slow_path */, nullptr /* continuation */, nullptr /* guard */); 1567 1568 // Frame is now completed as far as size and linkage. 1569 int frame_complete = ((intptr_t)__ pc()) - start; 1570 1571 // We use r20 as the oop handle for the receiver/klass 1572 // It is callee save so it survives the call to native 1573 1574 const Register oop_handle_reg = r20; 1575 1576 // 1577 // We immediately shuffle the arguments so that any vm call we have to 1578 // make from here on out (sync slow path, jvmti, etc.) we will have 1579 // captured the oops from our caller and have a valid oopMap for 1580 // them. 1581 1582 // ----------------- 1583 // The Grand Shuffle 1584 1585 // The Java calling convention is either equal (linux) or denser (win64) than the 1586 // c calling convention. However the because of the jni_env argument the c calling 1587 // convention always has at least one more (and two for static) arguments than Java. 1588 // Therefore if we move the args from java -> c backwards then we will never have 1589 // a register->register conflict and we don't have to build a dependency graph 1590 // and figure out how to break any cycles. 1591 // 1592 1593 // Record esp-based slot for receiver on stack for non-static methods 1594 int receiver_offset = -1; 1595 1596 // This is a trick. We double the stack slots so we can claim 1597 // the oops in the caller's frame. Since we are sure to have 1598 // more args than the caller doubling is enough to make 1599 // sure we can capture all the incoming oop args from the 1600 // caller. 1601 // 1602 OopMap* map = new OopMap(stack_slots * 2, 0 /* arg_slots*/); 1603 1604 // Mark location of rfp (someday) 1605 // map->set_callee_saved(VMRegImpl::stack2reg( stack_slots - 2), stack_slots * 2, 0, vmreg(rfp)); 1606 1607 1608 int float_args = 0; 1609 int int_args = 0; 1610 1611 #ifdef ASSERT 1612 bool reg_destroyed[Register::number_of_registers]; 1613 bool freg_destroyed[FloatRegister::number_of_registers]; 1614 for ( int r = 0 ; r < Register::number_of_registers ; r++ ) { 1615 reg_destroyed[r] = false; 1616 } 1617 for ( int f = 0 ; f < FloatRegister::number_of_registers ; f++ ) { 1618 freg_destroyed[f] = false; 1619 } 1620 1621 #endif /* ASSERT */ 1622 1623 // For JNI natives the incoming and outgoing registers are offset upwards. 1624 GrowableArray<int> arg_order(2 * total_in_args); 1625 VMRegPair tmp_vmreg; 1626 tmp_vmreg.set2(r19->as_VMReg()); 1627 1628 for (int i = total_in_args - 1, c_arg = total_c_args - 1; i >= 0; i--, c_arg--) { 1629 arg_order.push(i); 1630 arg_order.push(c_arg); 1631 } 1632 1633 int temploc = -1; 1634 for (int ai = 0; ai < arg_order.length(); ai += 2) { 1635 int i = arg_order.at(ai); 1636 int c_arg = arg_order.at(ai + 1); 1637 __ block_comment(err_msg("move %d -> %d", i, c_arg)); 1638 assert(c_arg != -1 && i != -1, "wrong order"); 1639 #ifdef ASSERT 1640 if (in_regs[i].first()->is_Register()) { 1641 assert(!reg_destroyed[in_regs[i].first()->as_Register()->encoding()], "destroyed reg!"); 1642 } else if (in_regs[i].first()->is_FloatRegister()) { 1643 assert(!freg_destroyed[in_regs[i].first()->as_FloatRegister()->encoding()], "destroyed reg!"); 1644 } 1645 if (out_regs[c_arg].first()->is_Register()) { 1646 reg_destroyed[out_regs[c_arg].first()->as_Register()->encoding()] = true; 1647 } else if (out_regs[c_arg].first()->is_FloatRegister()) { 1648 freg_destroyed[out_regs[c_arg].first()->as_FloatRegister()->encoding()] = true; 1649 } 1650 #endif /* ASSERT */ 1651 switch (in_sig_bt[i]) { 1652 case T_ARRAY: 1653 case T_OBJECT: 1654 __ object_move(map, oop_handle_offset, stack_slots, in_regs[i], out_regs[c_arg], 1655 ((i == 0) && (!is_static)), 1656 &receiver_offset); 1657 int_args++; 1658 break; 1659 case T_VOID: 1660 break; 1661 1662 case T_FLOAT: 1663 __ float_move(in_regs[i], out_regs[c_arg]); 1664 float_args++; 1665 break; 1666 1667 case T_DOUBLE: 1668 assert( i + 1 < total_in_args && 1669 in_sig_bt[i + 1] == T_VOID && 1670 out_sig_bt[c_arg+1] == T_VOID, "bad arg list"); 1671 __ double_move(in_regs[i], out_regs[c_arg]); 1672 float_args++; 1673 break; 1674 1675 case T_LONG : 1676 __ long_move(in_regs[i], out_regs[c_arg]); 1677 int_args++; 1678 break; 1679 1680 case T_ADDRESS: assert(false, "found T_ADDRESS in java args"); 1681 1682 default: 1683 __ move32_64(in_regs[i], out_regs[c_arg]); 1684 int_args++; 1685 } 1686 } 1687 1688 // point c_arg at the first arg that is already loaded in case we 1689 // need to spill before we call out 1690 int c_arg = total_c_args - total_in_args; 1691 1692 // Pre-load a static method's oop into c_rarg1. 1693 if (method->is_static()) { 1694 1695 // load oop into a register 1696 __ movoop(c_rarg1, 1697 JNIHandles::make_local(method->method_holder()->java_mirror())); 1698 1699 // Now handlize the static class mirror it's known not-null. 1700 __ str(c_rarg1, Address(sp, klass_offset)); 1701 map->set_oop(VMRegImpl::stack2reg(klass_slot_offset)); 1702 1703 // Now get the handle 1704 __ lea(c_rarg1, Address(sp, klass_offset)); 1705 // and protect the arg if we must spill 1706 c_arg--; 1707 } 1708 1709 // Change state to native (we save the return address in the thread, since it might not 1710 // be pushed on the stack when we do a stack traversal). 1711 // We use the same pc/oopMap repeatedly when we call out 1712 1713 Label native_return; 1714 __ set_last_Java_frame(sp, noreg, native_return, rscratch1); 1715 1716 Label dtrace_method_entry, dtrace_method_entry_done; 1717 { 1718 uint64_t offset; 1719 __ adrp(rscratch1, ExternalAddress((address)&DTraceMethodProbes), offset); 1720 __ ldrb(rscratch1, Address(rscratch1, offset)); 1721 __ cbnzw(rscratch1, dtrace_method_entry); 1722 __ bind(dtrace_method_entry_done); 1723 } 1724 1725 // RedefineClasses() tracing support for obsolete method entry 1726 if (log_is_enabled(Trace, redefine, class, obsolete)) { 1727 // protect the args we've loaded 1728 save_args(masm, total_c_args, c_arg, out_regs); 1729 __ mov_metadata(c_rarg1, method()); 1730 __ call_VM_leaf( 1731 CAST_FROM_FN_PTR(address, SharedRuntime::rc_trace_method_entry), 1732 rthread, c_rarg1); 1733 restore_args(masm, total_c_args, c_arg, out_regs); 1734 } 1735 1736 // Lock a synchronized method 1737 1738 // Register definitions used by locking and unlocking 1739 1740 const Register swap_reg = r0; 1741 const Register obj_reg = r19; // Will contain the oop 1742 const Register lock_reg = r13; // Address of compiler lock object (BasicLock) 1743 const Register old_hdr = r13; // value of old header at unlock time 1744 const Register lock_tmp = r14; // Temporary used by lightweight_lock/unlock 1745 const Register tmp = lr; 1746 1747 Label slow_path_lock; 1748 Label lock_done; 1749 1750 if (method->is_synchronized()) { 1751 Label count; 1752 const int mark_word_offset = BasicLock::displaced_header_offset_in_bytes(); 1753 1754 // Get the handle (the 2nd argument) 1755 __ mov(oop_handle_reg, c_rarg1); 1756 1757 // Get address of the box 1758 1759 __ lea(lock_reg, Address(sp, lock_slot_offset * VMRegImpl::stack_slot_size)); 1760 1761 // Load the oop from the handle 1762 __ ldr(obj_reg, Address(oop_handle_reg, 0)); 1763 1764 if (LockingMode == LM_MONITOR) { 1765 __ b(slow_path_lock); 1766 } else if (LockingMode == LM_LEGACY) { 1767 // Load (object->mark() | 1) into swap_reg %r0 1768 __ ldr(rscratch1, Address(obj_reg, oopDesc::mark_offset_in_bytes())); 1769 __ orr(swap_reg, rscratch1, 1); 1770 1771 // Save (object->mark() | 1) into BasicLock's displaced header 1772 __ str(swap_reg, Address(lock_reg, mark_word_offset)); 1773 1774 // src -> dest iff dest == r0 else r0 <- dest 1775 __ cmpxchg_obj_header(r0, lock_reg, obj_reg, rscratch1, count, /*fallthrough*/nullptr); 1776 1777 // Hmm should this move to the slow path code area??? 1778 1779 // Test if the oopMark is an obvious stack pointer, i.e., 1780 // 1) (mark & 3) == 0, and 1781 // 2) sp <= mark < mark + os::pagesize() 1782 // These 3 tests can be done by evaluating the following 1783 // expression: ((mark - sp) & (3 - os::vm_page_size())), 1784 // assuming both stack pointer and pagesize have their 1785 // least significant 2 bits clear. 1786 // NOTE: the oopMark is in swap_reg %r0 as the result of cmpxchg 1787 1788 __ sub(swap_reg, sp, swap_reg); 1789 __ neg(swap_reg, swap_reg); 1790 __ ands(swap_reg, swap_reg, 3 - (int)os::vm_page_size()); 1791 1792 // Save the test result, for recursive case, the result is zero 1793 __ str(swap_reg, Address(lock_reg, mark_word_offset)); 1794 __ br(Assembler::NE, slow_path_lock); 1795 } else { 1796 assert(LockingMode == LM_LIGHTWEIGHT, "must be"); 1797 __ lightweight_lock(lock_reg, obj_reg, swap_reg, tmp, lock_tmp, slow_path_lock); 1798 } 1799 __ bind(count); 1800 __ increment(Address(rthread, JavaThread::held_monitor_count_offset())); 1801 1802 // Slow path will re-enter here 1803 __ bind(lock_done); 1804 } 1805 1806 1807 // Finally just about ready to make the JNI call 1808 1809 // get JNIEnv* which is first argument to native 1810 __ lea(c_rarg0, Address(rthread, in_bytes(JavaThread::jni_environment_offset()))); 1811 1812 // Now set thread in native 1813 __ mov(rscratch1, _thread_in_native); 1814 __ lea(rscratch2, Address(rthread, JavaThread::thread_state_offset())); 1815 __ stlrw(rscratch1, rscratch2); 1816 1817 __ rt_call(native_func); 1818 1819 __ bind(native_return); 1820 1821 intptr_t return_pc = (intptr_t) __ pc(); 1822 oop_maps->add_gc_map(return_pc - start, map); 1823 1824 // Verify or restore cpu control state after JNI call 1825 __ restore_cpu_control_state_after_jni(rscratch1, rscratch2); 1826 1827 // Unpack native results. 1828 switch (ret_type) { 1829 case T_BOOLEAN: __ c2bool(r0); break; 1830 case T_CHAR : __ ubfx(r0, r0, 0, 16); break; 1831 case T_BYTE : __ sbfx(r0, r0, 0, 8); break; 1832 case T_SHORT : __ sbfx(r0, r0, 0, 16); break; 1833 case T_INT : __ sbfx(r0, r0, 0, 32); break; 1834 case T_DOUBLE : 1835 case T_FLOAT : 1836 // Result is in v0 we'll save as needed 1837 break; 1838 case T_ARRAY: // Really a handle 1839 case T_OBJECT: // Really a handle 1840 break; // can't de-handlize until after safepoint check 1841 case T_VOID: break; 1842 case T_LONG: break; 1843 default : ShouldNotReachHere(); 1844 } 1845 1846 Label safepoint_in_progress, safepoint_in_progress_done; 1847 Label after_transition; 1848 1849 // Switch thread to "native transition" state before reading the synchronization state. 1850 // This additional state is necessary because reading and testing the synchronization 1851 // state is not atomic w.r.t. GC, as this scenario demonstrates: 1852 // Java thread A, in _thread_in_native state, loads _not_synchronized and is preempted. 1853 // VM thread changes sync state to synchronizing and suspends threads for GC. 1854 // Thread A is resumed to finish this native method, but doesn't block here since it 1855 // didn't see any synchronization is progress, and escapes. 1856 __ mov(rscratch1, _thread_in_native_trans); 1857 1858 __ strw(rscratch1, Address(rthread, JavaThread::thread_state_offset())); 1859 1860 // Force this write out before the read below 1861 if (!UseSystemMemoryBarrier) { 1862 __ dmb(Assembler::ISH); 1863 } 1864 1865 __ verify_sve_vector_length(); 1866 1867 // Check for safepoint operation in progress and/or pending suspend requests. 1868 { 1869 // We need an acquire here to ensure that any subsequent load of the 1870 // global SafepointSynchronize::_state flag is ordered after this load 1871 // of the thread-local polling word. We don't want this poll to 1872 // return false (i.e. not safepointing) and a later poll of the global 1873 // SafepointSynchronize::_state spuriously to return true. 1874 // 1875 // This is to avoid a race when we're in a native->Java transition 1876 // racing the code which wakes up from a safepoint. 1877 1878 __ safepoint_poll(safepoint_in_progress, true /* at_return */, true /* acquire */, false /* in_nmethod */); 1879 __ ldrw(rscratch1, Address(rthread, JavaThread::suspend_flags_offset())); 1880 __ cbnzw(rscratch1, safepoint_in_progress); 1881 __ bind(safepoint_in_progress_done); 1882 } 1883 1884 // change thread state 1885 __ mov(rscratch1, _thread_in_Java); 1886 __ lea(rscratch2, Address(rthread, JavaThread::thread_state_offset())); 1887 __ stlrw(rscratch1, rscratch2); 1888 __ bind(after_transition); 1889 1890 Label reguard; 1891 Label reguard_done; 1892 __ ldrb(rscratch1, Address(rthread, JavaThread::stack_guard_state_offset())); 1893 __ cmpw(rscratch1, StackOverflow::stack_guard_yellow_reserved_disabled); 1894 __ br(Assembler::EQ, reguard); 1895 __ bind(reguard_done); 1896 1897 // native result if any is live 1898 1899 // Unlock 1900 Label unlock_done; 1901 Label slow_path_unlock; 1902 if (method->is_synchronized()) { 1903 1904 // Get locked oop from the handle we passed to jni 1905 __ ldr(obj_reg, Address(oop_handle_reg, 0)); 1906 1907 Label done, not_recursive; 1908 1909 if (LockingMode == LM_LEGACY) { 1910 // Simple recursive lock? 1911 __ ldr(rscratch1, Address(sp, lock_slot_offset * VMRegImpl::stack_slot_size)); 1912 __ cbnz(rscratch1, not_recursive); 1913 __ decrement(Address(rthread, JavaThread::held_monitor_count_offset())); 1914 __ b(done); 1915 } 1916 1917 __ bind(not_recursive); 1918 1919 // Must save r0 if if it is live now because cmpxchg must use it 1920 if (ret_type != T_FLOAT && ret_type != T_DOUBLE && ret_type != T_VOID) { 1921 save_native_result(masm, ret_type, stack_slots); 1922 } 1923 1924 if (LockingMode == LM_MONITOR) { 1925 __ b(slow_path_unlock); 1926 } else if (LockingMode == LM_LEGACY) { 1927 // get address of the stack lock 1928 __ lea(r0, Address(sp, lock_slot_offset * VMRegImpl::stack_slot_size)); 1929 // get old displaced header 1930 __ ldr(old_hdr, Address(r0, 0)); 1931 1932 // Atomic swap old header if oop still contains the stack lock 1933 Label count; 1934 __ cmpxchg_obj_header(r0, old_hdr, obj_reg, rscratch1, count, &slow_path_unlock); 1935 __ bind(count); 1936 __ decrement(Address(rthread, JavaThread::held_monitor_count_offset())); 1937 } else { 1938 assert(LockingMode == LM_LIGHTWEIGHT, ""); 1939 __ lightweight_unlock(obj_reg, old_hdr, swap_reg, lock_tmp, slow_path_unlock); 1940 __ decrement(Address(rthread, JavaThread::held_monitor_count_offset())); 1941 } 1942 1943 // slow path re-enters here 1944 __ bind(unlock_done); 1945 if (ret_type != T_FLOAT && ret_type != T_DOUBLE && ret_type != T_VOID) { 1946 restore_native_result(masm, ret_type, stack_slots); 1947 } 1948 1949 __ bind(done); 1950 } 1951 1952 Label dtrace_method_exit, dtrace_method_exit_done; 1953 { 1954 uint64_t offset; 1955 __ adrp(rscratch1, ExternalAddress((address)&DTraceMethodProbes), offset); 1956 __ ldrb(rscratch1, Address(rscratch1, offset)); 1957 __ cbnzw(rscratch1, dtrace_method_exit); 1958 __ bind(dtrace_method_exit_done); 1959 } 1960 1961 __ reset_last_Java_frame(false); 1962 1963 // Unbox oop result, e.g. JNIHandles::resolve result. 1964 if (is_reference_type(ret_type)) { 1965 __ resolve_jobject(r0, r1, r2); 1966 } 1967 1968 if (CheckJNICalls) { 1969 // clear_pending_jni_exception_check 1970 __ str(zr, Address(rthread, JavaThread::pending_jni_exception_check_fn_offset())); 1971 } 1972 1973 // reset handle block 1974 __ ldr(r2, Address(rthread, JavaThread::active_handles_offset())); 1975 __ str(zr, Address(r2, JNIHandleBlock::top_offset())); 1976 1977 __ leave(); 1978 1979 // Any exception pending? 1980 __ ldr(rscratch1, Address(rthread, in_bytes(Thread::pending_exception_offset()))); 1981 __ cbnz(rscratch1, exception_pending); 1982 1983 // We're done 1984 __ ret(lr); 1985 1986 // Unexpected paths are out of line and go here 1987 1988 // forward the exception 1989 __ bind(exception_pending); 1990 1991 // and forward the exception 1992 __ far_jump(RuntimeAddress(StubRoutines::forward_exception_entry())); 1993 1994 // Slow path locking & unlocking 1995 if (method->is_synchronized()) { 1996 1997 __ block_comment("Slow path lock {"); 1998 __ bind(slow_path_lock); 1999 2000 // has last_Java_frame setup. No exceptions so do vanilla call not call_VM 2001 // args are (oop obj, BasicLock* lock, JavaThread* thread) 2002 2003 // protect the args we've loaded 2004 save_args(masm, total_c_args, c_arg, out_regs); 2005 2006 __ mov(c_rarg0, obj_reg); 2007 __ mov(c_rarg1, lock_reg); 2008 __ mov(c_rarg2, rthread); 2009 2010 // Not a leaf but we have last_Java_frame setup as we want 2011 __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::complete_monitor_locking_C), 3); 2012 restore_args(masm, total_c_args, c_arg, out_regs); 2013 2014 #ifdef ASSERT 2015 { Label L; 2016 __ ldr(rscratch1, Address(rthread, in_bytes(Thread::pending_exception_offset()))); 2017 __ cbz(rscratch1, L); 2018 __ stop("no pending exception allowed on exit from monitorenter"); 2019 __ bind(L); 2020 } 2021 #endif 2022 __ b(lock_done); 2023 2024 __ block_comment("} Slow path lock"); 2025 2026 __ block_comment("Slow path unlock {"); 2027 __ bind(slow_path_unlock); 2028 2029 // If we haven't already saved the native result we must save it now as xmm registers 2030 // are still exposed. 2031 2032 if (ret_type == T_FLOAT || ret_type == T_DOUBLE ) { 2033 save_native_result(masm, ret_type, stack_slots); 2034 } 2035 2036 __ mov(c_rarg2, rthread); 2037 __ lea(c_rarg1, Address(sp, lock_slot_offset * VMRegImpl::stack_slot_size)); 2038 __ mov(c_rarg0, obj_reg); 2039 2040 // Save pending exception around call to VM (which contains an EXCEPTION_MARK) 2041 // NOTE that obj_reg == r19 currently 2042 __ ldr(r19, Address(rthread, in_bytes(Thread::pending_exception_offset()))); 2043 __ str(zr, Address(rthread, in_bytes(Thread::pending_exception_offset()))); 2044 2045 __ rt_call(CAST_FROM_FN_PTR(address, SharedRuntime::complete_monitor_unlocking_C)); 2046 2047 #ifdef ASSERT 2048 { 2049 Label L; 2050 __ ldr(rscratch1, Address(rthread, in_bytes(Thread::pending_exception_offset()))); 2051 __ cbz(rscratch1, L); 2052 __ stop("no pending exception allowed on exit complete_monitor_unlocking_C"); 2053 __ bind(L); 2054 } 2055 #endif /* ASSERT */ 2056 2057 __ str(r19, Address(rthread, in_bytes(Thread::pending_exception_offset()))); 2058 2059 if (ret_type == T_FLOAT || ret_type == T_DOUBLE ) { 2060 restore_native_result(masm, ret_type, stack_slots); 2061 } 2062 __ b(unlock_done); 2063 2064 __ block_comment("} Slow path unlock"); 2065 2066 } // synchronized 2067 2068 // SLOW PATH Reguard the stack if needed 2069 2070 __ bind(reguard); 2071 save_native_result(masm, ret_type, stack_slots); 2072 __ rt_call(CAST_FROM_FN_PTR(address, SharedRuntime::reguard_yellow_pages)); 2073 restore_native_result(masm, ret_type, stack_slots); 2074 // and continue 2075 __ b(reguard_done); 2076 2077 // SLOW PATH safepoint 2078 { 2079 __ block_comment("safepoint {"); 2080 __ bind(safepoint_in_progress); 2081 2082 // Don't use call_VM as it will see a possible pending exception and forward it 2083 // and never return here preventing us from clearing _last_native_pc down below. 2084 // 2085 save_native_result(masm, ret_type, stack_slots); 2086 __ mov(c_rarg0, rthread); 2087 #ifndef PRODUCT 2088 assert(frame::arg_reg_save_area_bytes == 0, "not expecting frame reg save area"); 2089 #endif 2090 __ lea(rscratch1, RuntimeAddress(CAST_FROM_FN_PTR(address, JavaThread::check_special_condition_for_native_trans))); 2091 __ blr(rscratch1); 2092 2093 // Restore any method result value 2094 restore_native_result(masm, ret_type, stack_slots); 2095 2096 __ b(safepoint_in_progress_done); 2097 __ block_comment("} safepoint"); 2098 } 2099 2100 // SLOW PATH dtrace support 2101 { 2102 __ block_comment("dtrace entry {"); 2103 __ bind(dtrace_method_entry); 2104 2105 // We have all of the arguments setup at this point. We must not touch any register 2106 // argument registers at this point (what if we save/restore them there are no oop? 2107 2108 save_args(masm, total_c_args, c_arg, out_regs); 2109 __ mov_metadata(c_rarg1, method()); 2110 __ call_VM_leaf( 2111 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), 2112 rthread, c_rarg1); 2113 restore_args(masm, total_c_args, c_arg, out_regs); 2114 __ b(dtrace_method_entry_done); 2115 __ block_comment("} dtrace entry"); 2116 } 2117 2118 { 2119 __ block_comment("dtrace exit {"); 2120 __ bind(dtrace_method_exit); 2121 save_native_result(masm, ret_type, stack_slots); 2122 __ mov_metadata(c_rarg1, method()); 2123 __ call_VM_leaf( 2124 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), 2125 rthread, c_rarg1); 2126 restore_native_result(masm, ret_type, stack_slots); 2127 __ b(dtrace_method_exit_done); 2128 __ block_comment("} dtrace exit"); 2129 } 2130 2131 2132 __ flush(); 2133 2134 nmethod *nm = nmethod::new_native_nmethod(method, 2135 compile_id, 2136 masm->code(), 2137 vep_offset, 2138 frame_complete, 2139 stack_slots / VMRegImpl::slots_per_word, 2140 (is_static ? in_ByteSize(klass_offset) : in_ByteSize(receiver_offset)), 2141 in_ByteSize(lock_slot_offset*VMRegImpl::stack_slot_size), 2142 oop_maps); 2143 2144 return nm; 2145 } 2146 2147 // this function returns the adjust size (in number of words) to a c2i adapter 2148 // activation for use during deoptimization 2149 int Deoptimization::last_frame_adjust(int callee_parameters, int callee_locals) { 2150 assert(callee_locals >= callee_parameters, 2151 "test and remove; got more parms than locals"); 2152 if (callee_locals < callee_parameters) 2153 return 0; // No adjustment for negative locals 2154 int diff = (callee_locals - callee_parameters) * Interpreter::stackElementWords; 2155 // diff is counted in stack words 2156 return align_up(diff, 2); 2157 } 2158 2159 2160 //------------------------------generate_deopt_blob---------------------------- 2161 void SharedRuntime::generate_deopt_blob() { 2162 // Allocate space for the code 2163 ResourceMark rm; 2164 // Setup code generation tools 2165 int pad = 0; 2166 #if INCLUDE_JVMCI 2167 if (EnableJVMCI) { 2168 pad += 512; // Increase the buffer size when compiling for JVMCI 2169 } 2170 #endif 2171 CodeBuffer buffer("deopt_blob", 2048+pad, 1024); 2172 MacroAssembler* masm = new MacroAssembler(&buffer); 2173 int frame_size_in_words; 2174 OopMap* map = nullptr; 2175 OopMapSet *oop_maps = new OopMapSet(); 2176 RegisterSaver reg_save(COMPILER2_OR_JVMCI != 0); 2177 2178 // ------------- 2179 // This code enters when returning to a de-optimized nmethod. A return 2180 // address has been pushed on the stack, and return values are in 2181 // registers. 2182 // If we are doing a normal deopt then we were called from the patched 2183 // nmethod from the point we returned to the nmethod. So the return 2184 // address on the stack is wrong by NativeCall::instruction_size 2185 // We will adjust the value so it looks like we have the original return 2186 // address on the stack (like when we eagerly deoptimized). 2187 // In the case of an exception pending when deoptimizing, we enter 2188 // with a return address on the stack that points after the call we patched 2189 // into the exception handler. We have the following register state from, 2190 // e.g., the forward exception stub (see stubGenerator_x86_64.cpp). 2191 // r0: exception oop 2192 // r19: exception handler 2193 // r3: throwing pc 2194 // So in this case we simply jam r3 into the useless return address and 2195 // the stack looks just like we want. 2196 // 2197 // At this point we need to de-opt. We save the argument return 2198 // registers. We call the first C routine, fetch_unroll_info(). This 2199 // routine captures the return values and returns a structure which 2200 // describes the current frame size and the sizes of all replacement frames. 2201 // The current frame is compiled code and may contain many inlined 2202 // functions, each with their own JVM state. We pop the current frame, then 2203 // push all the new frames. Then we call the C routine unpack_frames() to 2204 // populate these frames. Finally unpack_frames() returns us the new target 2205 // address. Notice that callee-save registers are BLOWN here; they have 2206 // already been captured in the vframeArray at the time the return PC was 2207 // patched. 2208 address start = __ pc(); 2209 Label cont; 2210 2211 // Prolog for non exception case! 2212 2213 // Save everything in sight. 2214 map = reg_save.save_live_registers(masm, 0, &frame_size_in_words); 2215 2216 // Normal deoptimization. Save exec mode for unpack_frames. 2217 __ movw(rcpool, Deoptimization::Unpack_deopt); // callee-saved 2218 __ b(cont); 2219 2220 int reexecute_offset = __ pc() - start; 2221 #if INCLUDE_JVMCI && !defined(COMPILER1) 2222 if (EnableJVMCI && UseJVMCICompiler) { 2223 // JVMCI does not use this kind of deoptimization 2224 __ should_not_reach_here(); 2225 } 2226 #endif 2227 2228 // Reexecute case 2229 // return address is the pc describes what bci to do re-execute at 2230 2231 // No need to update map as each call to save_live_registers will produce identical oopmap 2232 (void) reg_save.save_live_registers(masm, 0, &frame_size_in_words); 2233 2234 __ movw(rcpool, Deoptimization::Unpack_reexecute); // callee-saved 2235 __ b(cont); 2236 2237 #if INCLUDE_JVMCI 2238 Label after_fetch_unroll_info_call; 2239 int implicit_exception_uncommon_trap_offset = 0; 2240 int uncommon_trap_offset = 0; 2241 2242 if (EnableJVMCI) { 2243 implicit_exception_uncommon_trap_offset = __ pc() - start; 2244 2245 __ ldr(lr, Address(rthread, in_bytes(JavaThread::jvmci_implicit_exception_pc_offset()))); 2246 __ str(zr, Address(rthread, in_bytes(JavaThread::jvmci_implicit_exception_pc_offset()))); 2247 2248 uncommon_trap_offset = __ pc() - start; 2249 2250 // Save everything in sight. 2251 reg_save.save_live_registers(masm, 0, &frame_size_in_words); 2252 // fetch_unroll_info needs to call last_java_frame() 2253 Label retaddr; 2254 __ set_last_Java_frame(sp, noreg, retaddr, rscratch1); 2255 2256 __ ldrw(c_rarg1, Address(rthread, in_bytes(JavaThread::pending_deoptimization_offset()))); 2257 __ movw(rscratch1, -1); 2258 __ strw(rscratch1, Address(rthread, in_bytes(JavaThread::pending_deoptimization_offset()))); 2259 2260 __ movw(rcpool, (int32_t)Deoptimization::Unpack_reexecute); 2261 __ mov(c_rarg0, rthread); 2262 __ movw(c_rarg2, rcpool); // exec mode 2263 __ lea(rscratch1, 2264 RuntimeAddress(CAST_FROM_FN_PTR(address, 2265 Deoptimization::uncommon_trap))); 2266 __ blr(rscratch1); 2267 __ bind(retaddr); 2268 oop_maps->add_gc_map( __ pc()-start, map->deep_copy()); 2269 2270 __ reset_last_Java_frame(false); 2271 2272 __ b(after_fetch_unroll_info_call); 2273 } // EnableJVMCI 2274 #endif // INCLUDE_JVMCI 2275 2276 int exception_offset = __ pc() - start; 2277 2278 // Prolog for exception case 2279 2280 // all registers are dead at this entry point, except for r0, and 2281 // r3 which contain the exception oop and exception pc 2282 // respectively. Set them in TLS and fall thru to the 2283 // unpack_with_exception_in_tls entry point. 2284 2285 __ str(r3, Address(rthread, JavaThread::exception_pc_offset())); 2286 __ str(r0, Address(rthread, JavaThread::exception_oop_offset())); 2287 2288 int exception_in_tls_offset = __ pc() - start; 2289 2290 // new implementation because exception oop is now passed in JavaThread 2291 2292 // Prolog for exception case 2293 // All registers must be preserved because they might be used by LinearScan 2294 // Exceptiop oop and throwing PC are passed in JavaThread 2295 // tos: stack at point of call to method that threw the exception (i.e. only 2296 // args are on the stack, no return address) 2297 2298 // The return address pushed by save_live_registers will be patched 2299 // later with the throwing pc. The correct value is not available 2300 // now because loading it from memory would destroy registers. 2301 2302 // NB: The SP at this point must be the SP of the method that is 2303 // being deoptimized. Deoptimization assumes that the frame created 2304 // here by save_live_registers is immediately below the method's SP. 2305 // This is a somewhat fragile mechanism. 2306 2307 // Save everything in sight. 2308 map = reg_save.save_live_registers(masm, 0, &frame_size_in_words); 2309 2310 // Now it is safe to overwrite any register 2311 2312 // Deopt during an exception. Save exec mode for unpack_frames. 2313 __ mov(rcpool, Deoptimization::Unpack_exception); // callee-saved 2314 2315 // load throwing pc from JavaThread and patch it as the return address 2316 // of the current frame. Then clear the field in JavaThread 2317 __ ldr(r3, Address(rthread, JavaThread::exception_pc_offset())); 2318 __ protect_return_address(r3); 2319 __ str(r3, Address(rfp, wordSize)); 2320 __ str(zr, Address(rthread, JavaThread::exception_pc_offset())); 2321 2322 #ifdef ASSERT 2323 // verify that there is really an exception oop in JavaThread 2324 __ ldr(r0, Address(rthread, JavaThread::exception_oop_offset())); 2325 __ verify_oop(r0); 2326 2327 // verify that there is no pending exception 2328 Label no_pending_exception; 2329 __ ldr(rscratch1, Address(rthread, Thread::pending_exception_offset())); 2330 __ cbz(rscratch1, no_pending_exception); 2331 __ stop("must not have pending exception here"); 2332 __ bind(no_pending_exception); 2333 #endif 2334 2335 __ bind(cont); 2336 2337 // Call C code. Need thread and this frame, but NOT official VM entry 2338 // crud. We cannot block on this call, no GC can happen. 2339 // 2340 // UnrollBlock* fetch_unroll_info(JavaThread* thread) 2341 2342 // fetch_unroll_info needs to call last_java_frame(). 2343 2344 Label retaddr; 2345 __ set_last_Java_frame(sp, noreg, retaddr, rscratch1); 2346 #ifdef ASSERT 2347 { Label L; 2348 __ ldr(rscratch1, Address(rthread, JavaThread::last_Java_fp_offset())); 2349 __ cbz(rscratch1, L); 2350 __ stop("SharedRuntime::generate_deopt_blob: last_Java_fp not cleared"); 2351 __ bind(L); 2352 } 2353 #endif // ASSERT 2354 __ mov(c_rarg0, rthread); 2355 __ mov(c_rarg1, rcpool); 2356 __ lea(rscratch1, RuntimeAddress(CAST_FROM_FN_PTR(address, Deoptimization::fetch_unroll_info))); 2357 __ blr(rscratch1); 2358 __ bind(retaddr); 2359 2360 // Need to have an oopmap that tells fetch_unroll_info where to 2361 // find any register it might need. 2362 oop_maps->add_gc_map(__ pc() - start, map); 2363 2364 __ reset_last_Java_frame(false); 2365 2366 #if INCLUDE_JVMCI 2367 if (EnableJVMCI) { 2368 __ bind(after_fetch_unroll_info_call); 2369 } 2370 #endif 2371 2372 // Load UnrollBlock* into r5 2373 __ mov(r5, r0); 2374 2375 __ ldrw(rcpool, Address(r5, Deoptimization::UnrollBlock::unpack_kind_offset())); 2376 Label noException; 2377 __ cmpw(rcpool, Deoptimization::Unpack_exception); // Was exception pending? 2378 __ br(Assembler::NE, noException); 2379 __ ldr(r0, Address(rthread, JavaThread::exception_oop_offset())); 2380 // QQQ this is useless it was null above 2381 __ ldr(r3, Address(rthread, JavaThread::exception_pc_offset())); 2382 __ str(zr, Address(rthread, JavaThread::exception_oop_offset())); 2383 __ str(zr, Address(rthread, JavaThread::exception_pc_offset())); 2384 2385 __ verify_oop(r0); 2386 2387 // Overwrite the result registers with the exception results. 2388 __ str(r0, Address(sp, reg_save.r0_offset_in_bytes())); 2389 // I think this is useless 2390 // __ str(r3, Address(sp, RegisterSaver::r3_offset_in_bytes())); 2391 2392 __ bind(noException); 2393 2394 // Only register save data is on the stack. 2395 // Now restore the result registers. Everything else is either dead 2396 // or captured in the vframeArray. 2397 2398 // Restore fp result register 2399 __ ldrd(v0, Address(sp, reg_save.v0_offset_in_bytes())); 2400 // Restore integer result register 2401 __ ldr(r0, Address(sp, reg_save.r0_offset_in_bytes())); 2402 2403 // Pop all of the register save area off the stack 2404 __ add(sp, sp, frame_size_in_words * wordSize); 2405 2406 // All of the register save area has been popped of the stack. Only the 2407 // return address remains. 2408 2409 // Pop all the frames we must move/replace. 2410 // 2411 // Frame picture (youngest to oldest) 2412 // 1: self-frame (no frame link) 2413 // 2: deopting frame (no frame link) 2414 // 3: caller of deopting frame (could be compiled/interpreted). 2415 // 2416 // Note: by leaving the return address of self-frame on the stack 2417 // and using the size of frame 2 to adjust the stack 2418 // when we are done the return to frame 3 will still be on the stack. 2419 2420 // Pop deoptimized frame 2421 __ ldrw(r2, Address(r5, Deoptimization::UnrollBlock::size_of_deoptimized_frame_offset())); 2422 __ sub(r2, r2, 2 * wordSize); 2423 __ add(sp, sp, r2); 2424 __ ldp(rfp, zr, __ post(sp, 2 * wordSize)); 2425 2426 #ifdef ASSERT 2427 // Compilers generate code that bang the stack by as much as the 2428 // interpreter would need. So this stack banging should never 2429 // trigger a fault. Verify that it does not on non product builds. 2430 __ ldrw(r19, Address(r5, Deoptimization::UnrollBlock::total_frame_sizes_offset())); 2431 __ bang_stack_size(r19, r2); 2432 #endif 2433 // Load address of array of frame pcs into r2 2434 __ ldr(r2, Address(r5, Deoptimization::UnrollBlock::frame_pcs_offset())); 2435 2436 // Trash the old pc 2437 // __ addptr(sp, wordSize); FIXME ???? 2438 2439 // Load address of array of frame sizes into r4 2440 __ ldr(r4, Address(r5, Deoptimization::UnrollBlock::frame_sizes_offset())); 2441 2442 // Load counter into r3 2443 __ ldrw(r3, Address(r5, Deoptimization::UnrollBlock::number_of_frames_offset())); 2444 2445 // Now adjust the caller's stack to make up for the extra locals 2446 // but record the original sp so that we can save it in the skeletal interpreter 2447 // frame and the stack walking of interpreter_sender will get the unextended sp 2448 // value and not the "real" sp value. 2449 2450 const Register sender_sp = r6; 2451 2452 __ mov(sender_sp, sp); 2453 __ ldrw(r19, Address(r5, 2454 Deoptimization::UnrollBlock:: 2455 caller_adjustment_offset())); 2456 __ sub(sp, sp, r19); 2457 2458 // Push interpreter frames in a loop 2459 __ mov(rscratch1, (uint64_t)0xDEADDEAD); // Make a recognizable pattern 2460 __ mov(rscratch2, rscratch1); 2461 Label loop; 2462 __ bind(loop); 2463 __ ldr(r19, Address(__ post(r4, wordSize))); // Load frame size 2464 __ sub(r19, r19, 2*wordSize); // We'll push pc and fp by hand 2465 __ ldr(lr, Address(__ post(r2, wordSize))); // Load pc 2466 __ enter(); // Save old & set new fp 2467 __ sub(sp, sp, r19); // Prolog 2468 // This value is corrected by layout_activation_impl 2469 __ str(zr, Address(rfp, frame::interpreter_frame_last_sp_offset * wordSize)); 2470 __ str(sender_sp, Address(rfp, frame::interpreter_frame_sender_sp_offset * wordSize)); // Make it walkable 2471 __ mov(sender_sp, sp); // Pass sender_sp to next frame 2472 __ sub(r3, r3, 1); // Decrement counter 2473 __ cbnz(r3, loop); 2474 2475 // Re-push self-frame 2476 __ ldr(lr, Address(r2)); 2477 __ enter(); 2478 2479 // Allocate a full sized register save area. We subtract 2 because 2480 // enter() just pushed 2 words 2481 __ sub(sp, sp, (frame_size_in_words - 2) * wordSize); 2482 2483 // Restore frame locals after moving the frame 2484 __ strd(v0, Address(sp, reg_save.v0_offset_in_bytes())); 2485 __ str(r0, Address(sp, reg_save.r0_offset_in_bytes())); 2486 2487 // Call C code. Need thread but NOT official VM entry 2488 // crud. We cannot block on this call, no GC can happen. Call should 2489 // restore return values to their stack-slots with the new SP. 2490 // 2491 // void Deoptimization::unpack_frames(JavaThread* thread, int exec_mode) 2492 2493 // Use rfp because the frames look interpreted now 2494 // Don't need the precise return PC here, just precise enough to point into this code blob. 2495 address the_pc = __ pc(); 2496 __ set_last_Java_frame(sp, rfp, the_pc, rscratch1); 2497 2498 __ mov(c_rarg0, rthread); 2499 __ movw(c_rarg1, rcpool); // second arg: exec_mode 2500 __ lea(rscratch1, RuntimeAddress(CAST_FROM_FN_PTR(address, Deoptimization::unpack_frames))); 2501 __ blr(rscratch1); 2502 2503 // Set an oopmap for the call site 2504 // Use the same PC we used for the last java frame 2505 oop_maps->add_gc_map(the_pc - start, 2506 new OopMap( frame_size_in_words, 0 )); 2507 2508 // Clear fp AND pc 2509 __ reset_last_Java_frame(true); 2510 2511 // Collect return values 2512 __ ldrd(v0, Address(sp, reg_save.v0_offset_in_bytes())); 2513 __ ldr(r0, Address(sp, reg_save.r0_offset_in_bytes())); 2514 // I think this is useless (throwing pc?) 2515 // __ ldr(r3, Address(sp, RegisterSaver::r3_offset_in_bytes())); 2516 2517 // Pop self-frame. 2518 __ leave(); // Epilog 2519 2520 // Jump to interpreter 2521 __ ret(lr); 2522 2523 // Make sure all code is generated 2524 masm->flush(); 2525 2526 _deopt_blob = DeoptimizationBlob::create(&buffer, oop_maps, 0, exception_offset, reexecute_offset, frame_size_in_words); 2527 _deopt_blob->set_unpack_with_exception_in_tls_offset(exception_in_tls_offset); 2528 #if INCLUDE_JVMCI 2529 if (EnableJVMCI) { 2530 _deopt_blob->set_uncommon_trap_offset(uncommon_trap_offset); 2531 _deopt_blob->set_implicit_exception_uncommon_trap_offset(implicit_exception_uncommon_trap_offset); 2532 } 2533 #endif 2534 } 2535 2536 // Number of stack slots between incoming argument block and the start of 2537 // a new frame. The PROLOG must add this many slots to the stack. The 2538 // EPILOG must remove this many slots. aarch64 needs two slots for 2539 // return address and fp. 2540 // TODO think this is correct but check 2541 uint SharedRuntime::in_preserve_stack_slots() { 2542 return 4; 2543 } 2544 2545 uint SharedRuntime::out_preserve_stack_slots() { 2546 return 0; 2547 } 2548 2549 #ifdef COMPILER2 2550 //------------------------------generate_uncommon_trap_blob-------------------- 2551 void SharedRuntime::generate_uncommon_trap_blob() { 2552 // Allocate space for the code 2553 ResourceMark rm; 2554 // Setup code generation tools 2555 CodeBuffer buffer("uncommon_trap_blob", 2048, 1024); 2556 MacroAssembler* masm = new MacroAssembler(&buffer); 2557 2558 assert(SimpleRuntimeFrame::framesize % 4 == 0, "sp not 16-byte aligned"); 2559 2560 address start = __ pc(); 2561 2562 // Push self-frame. We get here with a return address in LR 2563 // and sp should be 16 byte aligned 2564 // push rfp and retaddr by hand 2565 __ protect_return_address(); 2566 __ stp(rfp, lr, Address(__ pre(sp, -2 * wordSize))); 2567 // we don't expect an arg reg save area 2568 #ifndef PRODUCT 2569 assert(frame::arg_reg_save_area_bytes == 0, "not expecting frame reg save area"); 2570 #endif 2571 // compiler left unloaded_class_index in j_rarg0 move to where the 2572 // runtime expects it. 2573 if (c_rarg1 != j_rarg0) { 2574 __ movw(c_rarg1, j_rarg0); 2575 } 2576 2577 // we need to set the past SP to the stack pointer of the stub frame 2578 // and the pc to the address where this runtime call will return 2579 // although actually any pc in this code blob will do). 2580 Label retaddr; 2581 __ set_last_Java_frame(sp, noreg, retaddr, rscratch1); 2582 2583 // Call C code. Need thread but NOT official VM entry 2584 // crud. We cannot block on this call, no GC can happen. Call should 2585 // capture callee-saved registers as well as return values. 2586 // Thread is in rdi already. 2587 // 2588 // UnrollBlock* uncommon_trap(JavaThread* thread, jint unloaded_class_index); 2589 // 2590 // n.b. 2 gp args, 0 fp args, integral return type 2591 2592 __ mov(c_rarg0, rthread); 2593 __ movw(c_rarg2, (unsigned)Deoptimization::Unpack_uncommon_trap); 2594 __ lea(rscratch1, 2595 RuntimeAddress(CAST_FROM_FN_PTR(address, 2596 Deoptimization::uncommon_trap))); 2597 __ blr(rscratch1); 2598 __ bind(retaddr); 2599 2600 // Set an oopmap for the call site 2601 OopMapSet* oop_maps = new OopMapSet(); 2602 OopMap* map = new OopMap(SimpleRuntimeFrame::framesize, 0); 2603 2604 // location of rfp is known implicitly by the frame sender code 2605 2606 oop_maps->add_gc_map(__ pc() - start, map); 2607 2608 __ reset_last_Java_frame(false); 2609 2610 // move UnrollBlock* into r4 2611 __ mov(r4, r0); 2612 2613 #ifdef ASSERT 2614 { Label L; 2615 __ ldrw(rscratch1, Address(r4, Deoptimization::UnrollBlock::unpack_kind_offset())); 2616 __ cmpw(rscratch1, (unsigned)Deoptimization::Unpack_uncommon_trap); 2617 __ br(Assembler::EQ, L); 2618 __ stop("SharedRuntime::generate_uncommon_trap_blob: expected Unpack_uncommon_trap"); 2619 __ bind(L); 2620 } 2621 #endif 2622 2623 // Pop all the frames we must move/replace. 2624 // 2625 // Frame picture (youngest to oldest) 2626 // 1: self-frame (no frame link) 2627 // 2: deopting frame (no frame link) 2628 // 3: caller of deopting frame (could be compiled/interpreted). 2629 2630 // Pop self-frame. We have no frame, and must rely only on r0 and sp. 2631 __ add(sp, sp, (SimpleRuntimeFrame::framesize) << LogBytesPerInt); // Epilog! 2632 2633 // Pop deoptimized frame (int) 2634 __ ldrw(r2, Address(r4, 2635 Deoptimization::UnrollBlock:: 2636 size_of_deoptimized_frame_offset())); 2637 __ sub(r2, r2, 2 * wordSize); 2638 __ add(sp, sp, r2); 2639 __ ldp(rfp, zr, __ post(sp, 2 * wordSize)); 2640 2641 #ifdef ASSERT 2642 // Compilers generate code that bang the stack by as much as the 2643 // interpreter would need. So this stack banging should never 2644 // trigger a fault. Verify that it does not on non product builds. 2645 __ ldrw(r1, Address(r4, 2646 Deoptimization::UnrollBlock:: 2647 total_frame_sizes_offset())); 2648 __ bang_stack_size(r1, r2); 2649 #endif 2650 2651 // Load address of array of frame pcs into r2 (address*) 2652 __ ldr(r2, Address(r4, 2653 Deoptimization::UnrollBlock::frame_pcs_offset())); 2654 2655 // Load address of array of frame sizes into r5 (intptr_t*) 2656 __ ldr(r5, Address(r4, 2657 Deoptimization::UnrollBlock:: 2658 frame_sizes_offset())); 2659 2660 // Counter 2661 __ ldrw(r3, Address(r4, 2662 Deoptimization::UnrollBlock:: 2663 number_of_frames_offset())); // (int) 2664 2665 // Now adjust the caller's stack to make up for the extra locals but 2666 // record the original sp so that we can save it in the skeletal 2667 // interpreter frame and the stack walking of interpreter_sender 2668 // will get the unextended sp value and not the "real" sp value. 2669 2670 const Register sender_sp = r8; 2671 2672 __ mov(sender_sp, sp); 2673 __ ldrw(r1, Address(r4, 2674 Deoptimization::UnrollBlock:: 2675 caller_adjustment_offset())); // (int) 2676 __ sub(sp, sp, r1); 2677 2678 // Push interpreter frames in a loop 2679 Label loop; 2680 __ bind(loop); 2681 __ ldr(r1, Address(r5, 0)); // Load frame size 2682 __ sub(r1, r1, 2 * wordSize); // We'll push pc and rfp by hand 2683 __ ldr(lr, Address(r2, 0)); // Save return address 2684 __ enter(); // and old rfp & set new rfp 2685 __ sub(sp, sp, r1); // Prolog 2686 __ str(sender_sp, Address(rfp, frame::interpreter_frame_sender_sp_offset * wordSize)); // Make it walkable 2687 // This value is corrected by layout_activation_impl 2688 __ str(zr, Address(rfp, frame::interpreter_frame_last_sp_offset * wordSize)); 2689 __ mov(sender_sp, sp); // Pass sender_sp to next frame 2690 __ add(r5, r5, wordSize); // Bump array pointer (sizes) 2691 __ add(r2, r2, wordSize); // Bump array pointer (pcs) 2692 __ subsw(r3, r3, 1); // Decrement counter 2693 __ br(Assembler::GT, loop); 2694 __ ldr(lr, Address(r2, 0)); // save final return address 2695 // Re-push self-frame 2696 __ enter(); // & old rfp & set new rfp 2697 2698 // Use rfp because the frames look interpreted now 2699 // Save "the_pc" since it cannot easily be retrieved using the last_java_SP after we aligned SP. 2700 // Don't need the precise return PC here, just precise enough to point into this code blob. 2701 address the_pc = __ pc(); 2702 __ set_last_Java_frame(sp, rfp, the_pc, rscratch1); 2703 2704 // Call C code. Need thread but NOT official VM entry 2705 // crud. We cannot block on this call, no GC can happen. Call should 2706 // restore return values to their stack-slots with the new SP. 2707 // Thread is in rdi already. 2708 // 2709 // BasicType unpack_frames(JavaThread* thread, int exec_mode); 2710 // 2711 // n.b. 2 gp args, 0 fp args, integral return type 2712 2713 // sp should already be aligned 2714 __ mov(c_rarg0, rthread); 2715 __ movw(c_rarg1, (unsigned)Deoptimization::Unpack_uncommon_trap); 2716 __ lea(rscratch1, RuntimeAddress(CAST_FROM_FN_PTR(address, Deoptimization::unpack_frames))); 2717 __ blr(rscratch1); 2718 2719 // Set an oopmap for the call site 2720 // Use the same PC we used for the last java frame 2721 oop_maps->add_gc_map(the_pc - start, new OopMap(SimpleRuntimeFrame::framesize, 0)); 2722 2723 // Clear fp AND pc 2724 __ reset_last_Java_frame(true); 2725 2726 // Pop self-frame. 2727 __ leave(); // Epilog 2728 2729 // Jump to interpreter 2730 __ ret(lr); 2731 2732 // Make sure all code is generated 2733 masm->flush(); 2734 2735 _uncommon_trap_blob = UncommonTrapBlob::create(&buffer, oop_maps, 2736 SimpleRuntimeFrame::framesize >> 1); 2737 } 2738 #endif // COMPILER2 2739 2740 2741 //------------------------------generate_handler_blob------ 2742 // 2743 // Generate a special Compile2Runtime blob that saves all registers, 2744 // and setup oopmap. 2745 // 2746 SafepointBlob* SharedRuntime::generate_handler_blob(address call_ptr, int poll_type) { 2747 ResourceMark rm; 2748 OopMapSet *oop_maps = new OopMapSet(); 2749 OopMap* map; 2750 2751 // Allocate space for the code. Setup code generation tools. 2752 CodeBuffer buffer("handler_blob", 2048, 1024); 2753 MacroAssembler* masm = new MacroAssembler(&buffer); 2754 2755 address start = __ pc(); 2756 address call_pc = nullptr; 2757 int frame_size_in_words; 2758 bool cause_return = (poll_type == POLL_AT_RETURN); 2759 RegisterSaver reg_save(poll_type == POLL_AT_VECTOR_LOOP /* save_vectors */); 2760 2761 // When the signal occurred, the LR was either signed and stored on the stack (in which 2762 // case it will be restored from the stack before being used) or unsigned and not stored 2763 // on the stack. Stipping ensures we get the right value. 2764 __ strip_return_address(); 2765 2766 // Save Integer and Float registers. 2767 map = reg_save.save_live_registers(masm, 0, &frame_size_in_words); 2768 2769 // The following is basically a call_VM. However, we need the precise 2770 // address of the call in order to generate an oopmap. Hence, we do all the 2771 // work ourselves. 2772 2773 Label retaddr; 2774 __ set_last_Java_frame(sp, noreg, retaddr, rscratch1); 2775 2776 // The return address must always be correct so that frame constructor never 2777 // sees an invalid pc. 2778 2779 if (!cause_return) { 2780 // overwrite the return address pushed by save_live_registers 2781 // Additionally, r20 is a callee-saved register so we can look at 2782 // it later to determine if someone changed the return address for 2783 // us! 2784 __ ldr(r20, Address(rthread, JavaThread::saved_exception_pc_offset())); 2785 __ protect_return_address(r20); 2786 __ str(r20, Address(rfp, wordSize)); 2787 } 2788 2789 // Do the call 2790 __ mov(c_rarg0, rthread); 2791 __ lea(rscratch1, RuntimeAddress(call_ptr)); 2792 __ blr(rscratch1); 2793 __ bind(retaddr); 2794 2795 // Set an oopmap for the call site. This oopmap will map all 2796 // oop-registers and debug-info registers as callee-saved. This 2797 // will allow deoptimization at this safepoint to find all possible 2798 // debug-info recordings, as well as let GC find all oops. 2799 2800 oop_maps->add_gc_map( __ pc() - start, map); 2801 2802 Label noException; 2803 2804 __ reset_last_Java_frame(false); 2805 2806 __ membar(Assembler::LoadLoad | Assembler::LoadStore); 2807 2808 __ ldr(rscratch1, Address(rthread, Thread::pending_exception_offset())); 2809 __ cbz(rscratch1, noException); 2810 2811 // Exception pending 2812 2813 reg_save.restore_live_registers(masm); 2814 2815 __ far_jump(RuntimeAddress(StubRoutines::forward_exception_entry())); 2816 2817 // No exception case 2818 __ bind(noException); 2819 2820 Label no_adjust, bail; 2821 if (!cause_return) { 2822 // If our stashed return pc was modified by the runtime we avoid touching it 2823 __ ldr(rscratch1, Address(rfp, wordSize)); 2824 __ cmp(r20, rscratch1); 2825 __ br(Assembler::NE, no_adjust); 2826 __ authenticate_return_address(r20); 2827 2828 #ifdef ASSERT 2829 // Verify the correct encoding of the poll we're about to skip. 2830 // See NativeInstruction::is_ldrw_to_zr() 2831 __ ldrw(rscratch1, Address(r20)); 2832 __ ubfx(rscratch2, rscratch1, 22, 10); 2833 __ cmpw(rscratch2, 0b1011100101); 2834 __ br(Assembler::NE, bail); 2835 __ ubfx(rscratch2, rscratch1, 0, 5); 2836 __ cmpw(rscratch2, 0b11111); 2837 __ br(Assembler::NE, bail); 2838 #endif 2839 // Adjust return pc forward to step over the safepoint poll instruction 2840 __ add(r20, r20, NativeInstruction::instruction_size); 2841 __ protect_return_address(r20); 2842 __ str(r20, Address(rfp, wordSize)); 2843 } 2844 2845 __ bind(no_adjust); 2846 // Normal exit, restore registers and exit. 2847 reg_save.restore_live_registers(masm); 2848 2849 __ ret(lr); 2850 2851 #ifdef ASSERT 2852 __ bind(bail); 2853 __ stop("Attempting to adjust pc to skip safepoint poll but the return point is not what we expected"); 2854 #endif 2855 2856 // Make sure all code is generated 2857 masm->flush(); 2858 2859 // Fill-out other meta info 2860 return SafepointBlob::create(&buffer, oop_maps, frame_size_in_words); 2861 } 2862 2863 // 2864 // generate_resolve_blob - call resolution (static/virtual/opt-virtual/ic-miss 2865 // 2866 // Generate a stub that calls into vm to find out the proper destination 2867 // of a java call. All the argument registers are live at this point 2868 // but since this is generic code we don't know what they are and the caller 2869 // must do any gc of the args. 2870 // 2871 RuntimeStub* SharedRuntime::generate_resolve_blob(address destination, const char* name) { 2872 assert (StubRoutines::forward_exception_entry() != nullptr, "must be generated before"); 2873 2874 // allocate space for the code 2875 ResourceMark rm; 2876 2877 CodeBuffer buffer(name, 1000, 512); 2878 MacroAssembler* masm = new MacroAssembler(&buffer); 2879 2880 int frame_size_in_words; 2881 RegisterSaver reg_save(false /* save_vectors */); 2882 2883 OopMapSet *oop_maps = new OopMapSet(); 2884 OopMap* map = nullptr; 2885 2886 int start = __ offset(); 2887 2888 map = reg_save.save_live_registers(masm, 0, &frame_size_in_words); 2889 2890 int frame_complete = __ offset(); 2891 2892 { 2893 Label retaddr; 2894 __ set_last_Java_frame(sp, noreg, retaddr, rscratch1); 2895 2896 __ mov(c_rarg0, rthread); 2897 __ lea(rscratch1, RuntimeAddress(destination)); 2898 2899 __ blr(rscratch1); 2900 __ bind(retaddr); 2901 } 2902 2903 // Set an oopmap for the call site. 2904 // We need this not only for callee-saved registers, but also for volatile 2905 // registers that the compiler might be keeping live across a safepoint. 2906 2907 oop_maps->add_gc_map( __ offset() - start, map); 2908 2909 // r0 contains the address we are going to jump to assuming no exception got installed 2910 2911 // clear last_Java_sp 2912 __ reset_last_Java_frame(false); 2913 // check for pending exceptions 2914 Label pending; 2915 __ ldr(rscratch1, Address(rthread, Thread::pending_exception_offset())); 2916 __ cbnz(rscratch1, pending); 2917 2918 // get the returned Method* 2919 __ get_vm_result_2(rmethod, rthread); 2920 __ str(rmethod, Address(sp, reg_save.reg_offset_in_bytes(rmethod))); 2921 2922 // r0 is where we want to jump, overwrite rscratch1 which is saved and scratch 2923 __ str(r0, Address(sp, reg_save.rscratch1_offset_in_bytes())); 2924 reg_save.restore_live_registers(masm); 2925 2926 // We are back to the original state on entry and ready to go. 2927 2928 __ br(rscratch1); 2929 2930 // Pending exception after the safepoint 2931 2932 __ bind(pending); 2933 2934 reg_save.restore_live_registers(masm); 2935 2936 // exception pending => remove activation and forward to exception handler 2937 2938 __ str(zr, Address(rthread, JavaThread::vm_result_offset())); 2939 2940 __ ldr(r0, Address(rthread, Thread::pending_exception_offset())); 2941 __ far_jump(RuntimeAddress(StubRoutines::forward_exception_entry())); 2942 2943 // ------------- 2944 // make sure all code is generated 2945 masm->flush(); 2946 2947 // return the blob 2948 // frame_size_words or bytes?? 2949 return RuntimeStub::new_runtime_stub(name, &buffer, frame_complete, frame_size_in_words, oop_maps, true); 2950 } 2951 2952 #ifdef COMPILER2 2953 // This is here instead of runtime_aarch64_64.cpp because it uses SimpleRuntimeFrame 2954 // 2955 //------------------------------generate_exception_blob--------------------------- 2956 // creates exception blob at the end 2957 // Using exception blob, this code is jumped from a compiled method. 2958 // (see emit_exception_handler in x86_64.ad file) 2959 // 2960 // Given an exception pc at a call we call into the runtime for the 2961 // handler in this method. This handler might merely restore state 2962 // (i.e. callee save registers) unwind the frame and jump to the 2963 // exception handler for the nmethod if there is no Java level handler 2964 // for the nmethod. 2965 // 2966 // This code is entered with a jmp. 2967 // 2968 // Arguments: 2969 // r0: exception oop 2970 // r3: exception pc 2971 // 2972 // Results: 2973 // r0: exception oop 2974 // r3: exception pc in caller or ??? 2975 // destination: exception handler of caller 2976 // 2977 // Note: the exception pc MUST be at a call (precise debug information) 2978 // Registers r0, r3, r2, r4, r5, r8-r11 are not callee saved. 2979 // 2980 2981 void OptoRuntime::generate_exception_blob() { 2982 assert(!OptoRuntime::is_callee_saved_register(R3_num), ""); 2983 assert(!OptoRuntime::is_callee_saved_register(R0_num), ""); 2984 assert(!OptoRuntime::is_callee_saved_register(R2_num), ""); 2985 2986 assert(SimpleRuntimeFrame::framesize % 4 == 0, "sp not 16-byte aligned"); 2987 2988 // Allocate space for the code 2989 ResourceMark rm; 2990 // Setup code generation tools 2991 CodeBuffer buffer("exception_blob", 2048, 1024); 2992 MacroAssembler* masm = new MacroAssembler(&buffer); 2993 2994 // TODO check various assumptions made here 2995 // 2996 // make sure we do so before running this 2997 2998 address start = __ pc(); 2999 3000 // push rfp and retaddr by hand 3001 // Exception pc is 'return address' for stack walker 3002 __ protect_return_address(); 3003 __ stp(rfp, lr, Address(__ pre(sp, -2 * wordSize))); 3004 // there are no callee save registers and we don't expect an 3005 // arg reg save area 3006 #ifndef PRODUCT 3007 assert(frame::arg_reg_save_area_bytes == 0, "not expecting frame reg save area"); 3008 #endif 3009 // Store exception in Thread object. We cannot pass any arguments to the 3010 // handle_exception call, since we do not want to make any assumption 3011 // about the size of the frame where the exception happened in. 3012 __ str(r0, Address(rthread, JavaThread::exception_oop_offset())); 3013 __ str(r3, Address(rthread, JavaThread::exception_pc_offset())); 3014 3015 // This call does all the hard work. It checks if an exception handler 3016 // exists in the method. 3017 // If so, it returns the handler address. 3018 // If not, it prepares for stack-unwinding, restoring the callee-save 3019 // registers of the frame being removed. 3020 // 3021 // address OptoRuntime::handle_exception_C(JavaThread* thread) 3022 // 3023 // n.b. 1 gp arg, 0 fp args, integral return type 3024 3025 // the stack should always be aligned 3026 address the_pc = __ pc(); 3027 __ set_last_Java_frame(sp, noreg, the_pc, rscratch1); 3028 __ mov(c_rarg0, rthread); 3029 __ lea(rscratch1, RuntimeAddress(CAST_FROM_FN_PTR(address, OptoRuntime::handle_exception_C))); 3030 __ blr(rscratch1); 3031 // handle_exception_C is a special VM call which does not require an explicit 3032 // instruction sync afterwards. 3033 3034 // May jump to SVE compiled code 3035 __ reinitialize_ptrue(); 3036 3037 // Set an oopmap for the call site. This oopmap will only be used if we 3038 // are unwinding the stack. Hence, all locations will be dead. 3039 // Callee-saved registers will be the same as the frame above (i.e., 3040 // handle_exception_stub), since they were restored when we got the 3041 // exception. 3042 3043 OopMapSet* oop_maps = new OopMapSet(); 3044 3045 oop_maps->add_gc_map(the_pc - start, new OopMap(SimpleRuntimeFrame::framesize, 0)); 3046 3047 __ reset_last_Java_frame(false); 3048 3049 // Restore callee-saved registers 3050 3051 // rfp is an implicitly saved callee saved register (i.e. the calling 3052 // convention will save restore it in prolog/epilog) Other than that 3053 // there are no callee save registers now that adapter frames are gone. 3054 // and we dont' expect an arg reg save area 3055 __ ldp(rfp, r3, Address(__ post(sp, 2 * wordSize))); 3056 __ authenticate_return_address(r3); 3057 3058 // r0: exception handler 3059 3060 // We have a handler in r0 (could be deopt blob). 3061 __ mov(r8, r0); 3062 3063 // Get the exception oop 3064 __ ldr(r0, Address(rthread, JavaThread::exception_oop_offset())); 3065 // Get the exception pc in case we are deoptimized 3066 __ ldr(r4, Address(rthread, JavaThread::exception_pc_offset())); 3067 #ifdef ASSERT 3068 __ str(zr, Address(rthread, JavaThread::exception_handler_pc_offset())); 3069 __ str(zr, Address(rthread, JavaThread::exception_pc_offset())); 3070 #endif 3071 // Clear the exception oop so GC no longer processes it as a root. 3072 __ str(zr, Address(rthread, JavaThread::exception_oop_offset())); 3073 3074 // r0: exception oop 3075 // r8: exception handler 3076 // r4: exception pc 3077 // Jump to handler 3078 3079 __ br(r8); 3080 3081 // Make sure all code is generated 3082 masm->flush(); 3083 3084 // Set exception blob 3085 _exception_blob = ExceptionBlob::create(&buffer, oop_maps, SimpleRuntimeFrame::framesize >> 1); 3086 } 3087 3088 #endif // COMPILER2