1 /* 2 * Copyright (c) 2003, 2012, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "asm/macroAssembler.hpp" 27 #include "asm/macroAssembler.inline.hpp" 28 #include "code/debugInfoRec.hpp" 29 #include "code/icBuffer.hpp" 30 #include "code/vtableStubs.hpp" 31 #include "interpreter/interpreter.hpp" 32 #include "oops/compiledICHolder.hpp" 33 #include "prims/jvmtiRedefineClassesTrace.hpp" 34 #include "runtime/sharedRuntime.hpp" 35 #include "runtime/vframeArray.hpp" 36 #include "vmreg_x86.inline.hpp" 37 #ifdef COMPILER1 38 #include "c1/c1_Runtime1.hpp" 39 #endif 40 #ifdef COMPILER2 41 #include "opto/runtime.hpp" 42 #endif 43 44 #define __ masm-> 45 46 const int StackAlignmentInSlots = StackAlignmentInBytes / VMRegImpl::stack_slot_size; 47 48 class SimpleRuntimeFrame { 49 50 public: 51 52 // Most of the runtime stubs have this simple frame layout. 53 // This class exists to make the layout shared in one place. 54 // Offsets are for compiler stack slots, which are jints. 55 enum layout { 56 // The frame sender code expects that rbp will be in the "natural" place and 57 // will override any oopMap setting for it. We must therefore force the layout 58 // so that it agrees with the frame sender code. 59 rbp_off = frame::arg_reg_save_area_bytes/BytesPerInt, 60 rbp_off2, 61 return_off, return_off2, 62 framesize 63 }; 64 }; 65 66 class RegisterSaver { 67 // Capture info about frame layout. Layout offsets are in jint 68 // units because compiler frame slots are jints. 69 #define DEF_XMM_OFFS(regnum) xmm ## regnum ## _off = xmm_off + (regnum)*16/BytesPerInt, xmm ## regnum ## H_off 70 enum layout { 71 fpu_state_off = frame::arg_reg_save_area_bytes/BytesPerInt, // fxsave save area 72 xmm_off = fpu_state_off + 160/BytesPerInt, // offset in fxsave save area 73 DEF_XMM_OFFS(0), 74 DEF_XMM_OFFS(1), 75 DEF_XMM_OFFS(2), 76 DEF_XMM_OFFS(3), 77 DEF_XMM_OFFS(4), 78 DEF_XMM_OFFS(5), 79 DEF_XMM_OFFS(6), 80 DEF_XMM_OFFS(7), 81 DEF_XMM_OFFS(8), 82 DEF_XMM_OFFS(9), 83 DEF_XMM_OFFS(10), 84 DEF_XMM_OFFS(11), 85 DEF_XMM_OFFS(12), 86 DEF_XMM_OFFS(13), 87 DEF_XMM_OFFS(14), 88 DEF_XMM_OFFS(15), 89 fpu_state_end = fpu_state_off + ((FPUStateSizeInWords-1)*wordSize / BytesPerInt), 90 fpu_stateH_end, 91 r15_off, r15H_off, 92 r14_off, r14H_off, 93 r13_off, r13H_off, 94 r12_off, r12H_off, 95 r11_off, r11H_off, 96 r10_off, r10H_off, 97 r9_off, r9H_off, 98 r8_off, r8H_off, 99 rdi_off, rdiH_off, 100 rsi_off, rsiH_off, 101 ignore_off, ignoreH_off, // extra copy of rbp 102 rsp_off, rspH_off, 103 rbx_off, rbxH_off, 104 rdx_off, rdxH_off, 105 rcx_off, rcxH_off, 106 rax_off, raxH_off, 107 // 16-byte stack alignment fill word: see MacroAssembler::push/pop_IU_state 108 align_off, alignH_off, 109 flags_off, flagsH_off, 110 // The frame sender code expects that rbp will be in the "natural" place and 111 // will override any oopMap setting for it. We must therefore force the layout 112 // so that it agrees with the frame sender code. 113 rbp_off, rbpH_off, // copy of rbp we will restore 114 return_off, returnH_off, // slot for return address 115 reg_save_size // size in compiler stack slots 116 }; 117 118 public: 119 static OopMap* save_live_registers(MacroAssembler* masm, int additional_frame_words, int* total_frame_words, bool save_vectors = false); 120 static void restore_live_registers(MacroAssembler* masm, bool restore_vectors = false); 121 122 // Offsets into the register save area 123 // Used by deoptimization when it is managing result register 124 // values on its own 125 126 static int rax_offset_in_bytes(void) { return BytesPerInt * rax_off; } 127 static int rdx_offset_in_bytes(void) { return BytesPerInt * rdx_off; } 128 static int rbx_offset_in_bytes(void) { return BytesPerInt * rbx_off; } 129 static int xmm0_offset_in_bytes(void) { return BytesPerInt * xmm0_off; } 130 static int return_offset_in_bytes(void) { return BytesPerInt * return_off; } 131 132 // During deoptimization only the result registers need to be restored, 133 // all the other values have already been extracted. 134 static void restore_result_registers(MacroAssembler* masm); 135 }; 136 137 OopMap* RegisterSaver::save_live_registers(MacroAssembler* masm, int additional_frame_words, int* total_frame_words, bool save_vectors) { 138 int vect_words = 0; 139 #ifdef COMPILER2 140 if (save_vectors) { 141 assert(UseAVX > 0, "256bit vectors are supported only with AVX"); 142 assert(MaxVectorSize == 32, "only 256bit vectors are supported now"); 143 // Save upper half of YMM registes 144 vect_words = 16 * 16 / wordSize; 145 additional_frame_words += vect_words; 146 } 147 #else 148 assert(!save_vectors, "vectors are generated only by C2"); 149 #endif 150 151 // Always make the frame size 16-byte aligned 152 int frame_size_in_bytes = round_to(additional_frame_words*wordSize + 153 reg_save_size*BytesPerInt, 16); 154 // OopMap frame size is in compiler stack slots (jint's) not bytes or words 155 int frame_size_in_slots = frame_size_in_bytes / BytesPerInt; 156 // The caller will allocate additional_frame_words 157 int additional_frame_slots = additional_frame_words*wordSize / BytesPerInt; 158 // CodeBlob frame size is in words. 159 int frame_size_in_words = frame_size_in_bytes / wordSize; 160 *total_frame_words = frame_size_in_words; 161 162 // Save registers, fpu state, and flags. 163 // We assume caller has already pushed the return address onto the 164 // stack, so rsp is 8-byte aligned here. 165 // We push rpb twice in this sequence because we want the real rbp 166 // to be under the return like a normal enter. 167 168 __ enter(); // rsp becomes 16-byte aligned here 169 __ push_CPU_state(); // Push a multiple of 16 bytes 170 171 if (vect_words > 0) { 172 assert(vect_words*wordSize == 256, ""); 173 __ subptr(rsp, 256); // Save upper half of YMM registes 174 __ vextractf128h(Address(rsp, 0),xmm0); 175 __ vextractf128h(Address(rsp, 16),xmm1); 176 __ vextractf128h(Address(rsp, 32),xmm2); 177 __ vextractf128h(Address(rsp, 48),xmm3); 178 __ vextractf128h(Address(rsp, 64),xmm4); 179 __ vextractf128h(Address(rsp, 80),xmm5); 180 __ vextractf128h(Address(rsp, 96),xmm6); 181 __ vextractf128h(Address(rsp,112),xmm7); 182 __ vextractf128h(Address(rsp,128),xmm8); 183 __ vextractf128h(Address(rsp,144),xmm9); 184 __ vextractf128h(Address(rsp,160),xmm10); 185 __ vextractf128h(Address(rsp,176),xmm11); 186 __ vextractf128h(Address(rsp,192),xmm12); 187 __ vextractf128h(Address(rsp,208),xmm13); 188 __ vextractf128h(Address(rsp,224),xmm14); 189 __ vextractf128h(Address(rsp,240),xmm15); 190 } 191 if (frame::arg_reg_save_area_bytes != 0) { 192 // Allocate argument register save area 193 __ subptr(rsp, frame::arg_reg_save_area_bytes); 194 } 195 196 // Set an oopmap for the call site. This oopmap will map all 197 // oop-registers and debug-info registers as callee-saved. This 198 // will allow deoptimization at this safepoint to find all possible 199 // debug-info recordings, as well as let GC find all oops. 200 201 OopMapSet *oop_maps = new OopMapSet(); 202 OopMap* map = new OopMap(frame_size_in_slots, 0); 203 204 #define STACK_OFFSET(x) VMRegImpl::stack2reg((x) + additional_frame_slots) 205 206 map->set_callee_saved(STACK_OFFSET( rax_off ), rax->as_VMReg()); 207 map->set_callee_saved(STACK_OFFSET( rcx_off ), rcx->as_VMReg()); 208 map->set_callee_saved(STACK_OFFSET( rdx_off ), rdx->as_VMReg()); 209 map->set_callee_saved(STACK_OFFSET( rbx_off ), rbx->as_VMReg()); 210 // rbp location is known implicitly by the frame sender code, needs no oopmap 211 // and the location where rbp was saved by is ignored 212 map->set_callee_saved(STACK_OFFSET( rsi_off ), rsi->as_VMReg()); 213 map->set_callee_saved(STACK_OFFSET( rdi_off ), rdi->as_VMReg()); 214 map->set_callee_saved(STACK_OFFSET( r8_off ), r8->as_VMReg()); 215 map->set_callee_saved(STACK_OFFSET( r9_off ), r9->as_VMReg()); 216 map->set_callee_saved(STACK_OFFSET( r10_off ), r10->as_VMReg()); 217 map->set_callee_saved(STACK_OFFSET( r11_off ), r11->as_VMReg()); 218 map->set_callee_saved(STACK_OFFSET( r12_off ), r12->as_VMReg()); 219 map->set_callee_saved(STACK_OFFSET( r13_off ), r13->as_VMReg()); 220 map->set_callee_saved(STACK_OFFSET( r14_off ), r14->as_VMReg()); 221 map->set_callee_saved(STACK_OFFSET( r15_off ), r15->as_VMReg()); 222 map->set_callee_saved(STACK_OFFSET(xmm0_off ), xmm0->as_VMReg()); 223 map->set_callee_saved(STACK_OFFSET(xmm1_off ), xmm1->as_VMReg()); 224 map->set_callee_saved(STACK_OFFSET(xmm2_off ), xmm2->as_VMReg()); 225 map->set_callee_saved(STACK_OFFSET(xmm3_off ), xmm3->as_VMReg()); 226 map->set_callee_saved(STACK_OFFSET(xmm4_off ), xmm4->as_VMReg()); 227 map->set_callee_saved(STACK_OFFSET(xmm5_off ), xmm5->as_VMReg()); 228 map->set_callee_saved(STACK_OFFSET(xmm6_off ), xmm6->as_VMReg()); 229 map->set_callee_saved(STACK_OFFSET(xmm7_off ), xmm7->as_VMReg()); 230 map->set_callee_saved(STACK_OFFSET(xmm8_off ), xmm8->as_VMReg()); 231 map->set_callee_saved(STACK_OFFSET(xmm9_off ), xmm9->as_VMReg()); 232 map->set_callee_saved(STACK_OFFSET(xmm10_off), xmm10->as_VMReg()); 233 map->set_callee_saved(STACK_OFFSET(xmm11_off), xmm11->as_VMReg()); 234 map->set_callee_saved(STACK_OFFSET(xmm12_off), xmm12->as_VMReg()); 235 map->set_callee_saved(STACK_OFFSET(xmm13_off), xmm13->as_VMReg()); 236 map->set_callee_saved(STACK_OFFSET(xmm14_off), xmm14->as_VMReg()); 237 map->set_callee_saved(STACK_OFFSET(xmm15_off), xmm15->as_VMReg()); 238 239 // %%% These should all be a waste but we'll keep things as they were for now 240 if (true) { 241 map->set_callee_saved(STACK_OFFSET( raxH_off ), rax->as_VMReg()->next()); 242 map->set_callee_saved(STACK_OFFSET( rcxH_off ), rcx->as_VMReg()->next()); 243 map->set_callee_saved(STACK_OFFSET( rdxH_off ), rdx->as_VMReg()->next()); 244 map->set_callee_saved(STACK_OFFSET( rbxH_off ), rbx->as_VMReg()->next()); 245 // rbp location is known implicitly by the frame sender code, needs no oopmap 246 map->set_callee_saved(STACK_OFFSET( rsiH_off ), rsi->as_VMReg()->next()); 247 map->set_callee_saved(STACK_OFFSET( rdiH_off ), rdi->as_VMReg()->next()); 248 map->set_callee_saved(STACK_OFFSET( r8H_off ), r8->as_VMReg()->next()); 249 map->set_callee_saved(STACK_OFFSET( r9H_off ), r9->as_VMReg()->next()); 250 map->set_callee_saved(STACK_OFFSET( r10H_off ), r10->as_VMReg()->next()); 251 map->set_callee_saved(STACK_OFFSET( r11H_off ), r11->as_VMReg()->next()); 252 map->set_callee_saved(STACK_OFFSET( r12H_off ), r12->as_VMReg()->next()); 253 map->set_callee_saved(STACK_OFFSET( r13H_off ), r13->as_VMReg()->next()); 254 map->set_callee_saved(STACK_OFFSET( r14H_off ), r14->as_VMReg()->next()); 255 map->set_callee_saved(STACK_OFFSET( r15H_off ), r15->as_VMReg()->next()); 256 map->set_callee_saved(STACK_OFFSET(xmm0H_off ), xmm0->as_VMReg()->next()); 257 map->set_callee_saved(STACK_OFFSET(xmm1H_off ), xmm1->as_VMReg()->next()); 258 map->set_callee_saved(STACK_OFFSET(xmm2H_off ), xmm2->as_VMReg()->next()); 259 map->set_callee_saved(STACK_OFFSET(xmm3H_off ), xmm3->as_VMReg()->next()); 260 map->set_callee_saved(STACK_OFFSET(xmm4H_off ), xmm4->as_VMReg()->next()); 261 map->set_callee_saved(STACK_OFFSET(xmm5H_off ), xmm5->as_VMReg()->next()); 262 map->set_callee_saved(STACK_OFFSET(xmm6H_off ), xmm6->as_VMReg()->next()); 263 map->set_callee_saved(STACK_OFFSET(xmm7H_off ), xmm7->as_VMReg()->next()); 264 map->set_callee_saved(STACK_OFFSET(xmm8H_off ), xmm8->as_VMReg()->next()); 265 map->set_callee_saved(STACK_OFFSET(xmm9H_off ), xmm9->as_VMReg()->next()); 266 map->set_callee_saved(STACK_OFFSET(xmm10H_off), xmm10->as_VMReg()->next()); 267 map->set_callee_saved(STACK_OFFSET(xmm11H_off), xmm11->as_VMReg()->next()); 268 map->set_callee_saved(STACK_OFFSET(xmm12H_off), xmm12->as_VMReg()->next()); 269 map->set_callee_saved(STACK_OFFSET(xmm13H_off), xmm13->as_VMReg()->next()); 270 map->set_callee_saved(STACK_OFFSET(xmm14H_off), xmm14->as_VMReg()->next()); 271 map->set_callee_saved(STACK_OFFSET(xmm15H_off), xmm15->as_VMReg()->next()); 272 } 273 274 return map; 275 } 276 277 void RegisterSaver::restore_live_registers(MacroAssembler* masm, bool restore_vectors) { 278 if (frame::arg_reg_save_area_bytes != 0) { 279 // Pop arg register save area 280 __ addptr(rsp, frame::arg_reg_save_area_bytes); 281 } 282 #ifdef COMPILER2 283 if (restore_vectors) { 284 // Restore upper half of YMM registes. 285 assert(UseAVX > 0, "256bit vectors are supported only with AVX"); 286 assert(MaxVectorSize == 32, "only 256bit vectors are supported now"); 287 __ vinsertf128h(xmm0, Address(rsp, 0)); 288 __ vinsertf128h(xmm1, Address(rsp, 16)); 289 __ vinsertf128h(xmm2, Address(rsp, 32)); 290 __ vinsertf128h(xmm3, Address(rsp, 48)); 291 __ vinsertf128h(xmm4, Address(rsp, 64)); 292 __ vinsertf128h(xmm5, Address(rsp, 80)); 293 __ vinsertf128h(xmm6, Address(rsp, 96)); 294 __ vinsertf128h(xmm7, Address(rsp,112)); 295 __ vinsertf128h(xmm8, Address(rsp,128)); 296 __ vinsertf128h(xmm9, Address(rsp,144)); 297 __ vinsertf128h(xmm10, Address(rsp,160)); 298 __ vinsertf128h(xmm11, Address(rsp,176)); 299 __ vinsertf128h(xmm12, Address(rsp,192)); 300 __ vinsertf128h(xmm13, Address(rsp,208)); 301 __ vinsertf128h(xmm14, Address(rsp,224)); 302 __ vinsertf128h(xmm15, Address(rsp,240)); 303 __ addptr(rsp, 256); 304 } 305 #else 306 assert(!restore_vectors, "vectors are generated only by C2"); 307 #endif 308 // Recover CPU state 309 __ pop_CPU_state(); 310 // Get the rbp described implicitly by the calling convention (no oopMap) 311 __ pop(rbp); 312 } 313 314 void RegisterSaver::restore_result_registers(MacroAssembler* masm) { 315 316 // Just restore result register. Only used by deoptimization. By 317 // now any callee save register that needs to be restored to a c2 318 // caller of the deoptee has been extracted into the vframeArray 319 // and will be stuffed into the c2i adapter we create for later 320 // restoration so only result registers need to be restored here. 321 322 // Restore fp result register 323 __ movdbl(xmm0, Address(rsp, xmm0_offset_in_bytes())); 324 // Restore integer result register 325 __ movptr(rax, Address(rsp, rax_offset_in_bytes())); 326 __ movptr(rdx, Address(rsp, rdx_offset_in_bytes())); 327 328 // Pop all of the register save are off the stack except the return address 329 __ addptr(rsp, return_offset_in_bytes()); 330 } 331 332 // Is vector's size (in bytes) bigger than a size saved by default? 333 // 16 bytes XMM registers are saved by default using fxsave/fxrstor instructions. 334 bool SharedRuntime::is_wide_vector(int size) { 335 return size > 16; 336 } 337 338 // The java_calling_convention describes stack locations as ideal slots on 339 // a frame with no abi restrictions. Since we must observe abi restrictions 340 // (like the placement of the register window) the slots must be biased by 341 // the following value. 342 static int reg2offset_in(VMReg r) { 343 // Account for saved rbp and return address 344 // This should really be in_preserve_stack_slots 345 return (r->reg2stack() + 4) * VMRegImpl::stack_slot_size; 346 } 347 348 static int reg2offset_out(VMReg r) { 349 return (r->reg2stack() + SharedRuntime::out_preserve_stack_slots()) * VMRegImpl::stack_slot_size; 350 } 351 352 // --------------------------------------------------------------------------- 353 // Read the array of BasicTypes from a signature, and compute where the 354 // arguments should go. Values in the VMRegPair regs array refer to 4-byte 355 // quantities. Values less than VMRegImpl::stack0 are registers, those above 356 // refer to 4-byte stack slots. All stack slots are based off of the stack pointer 357 // as framesizes are fixed. 358 // VMRegImpl::stack0 refers to the first slot 0(sp). 359 // and VMRegImpl::stack0+1 refers to the memory word 4-byes higher. Register 360 // up to RegisterImpl::number_of_registers) are the 64-bit 361 // integer registers. 362 363 // Note: the INPUTS in sig_bt are in units of Java argument words, which are 364 // either 32-bit or 64-bit depending on the build. The OUTPUTS are in 32-bit 365 // units regardless of build. Of course for i486 there is no 64 bit build 366 367 // The Java calling convention is a "shifted" version of the C ABI. 368 // By skipping the first C ABI register we can call non-static jni methods 369 // with small numbers of arguments without having to shuffle the arguments 370 // at all. Since we control the java ABI we ought to at least get some 371 // advantage out of it. 372 373 int SharedRuntime::java_calling_convention(const BasicType *sig_bt, 374 VMRegPair *regs, 375 int total_args_passed, 376 int is_outgoing) { 377 378 // Create the mapping between argument positions and 379 // registers. 380 static const Register INT_ArgReg[Argument::n_int_register_parameters_j] = { 381 j_rarg0, j_rarg1, j_rarg2, j_rarg3, j_rarg4, j_rarg5 382 }; 383 static const XMMRegister FP_ArgReg[Argument::n_float_register_parameters_j] = { 384 j_farg0, j_farg1, j_farg2, j_farg3, 385 j_farg4, j_farg5, j_farg6, j_farg7 386 }; 387 388 389 uint int_args = 0; 390 uint fp_args = 0; 391 uint stk_args = 0; // inc by 2 each time 392 393 for (int i = 0; i < total_args_passed; i++) { 394 switch (sig_bt[i]) { 395 case T_BOOLEAN: 396 case T_CHAR: 397 case T_BYTE: 398 case T_SHORT: 399 case T_INT: 400 if (int_args < Argument::n_int_register_parameters_j) { 401 regs[i].set1(INT_ArgReg[int_args++]->as_VMReg()); 402 } else { 403 regs[i].set1(VMRegImpl::stack2reg(stk_args)); 404 stk_args += 2; 405 } 406 break; 407 case T_VOID: 408 // halves of T_LONG or T_DOUBLE 409 assert(i != 0 && (sig_bt[i - 1] == T_LONG || sig_bt[i - 1] == T_DOUBLE), "expecting half"); 410 regs[i].set_bad(); 411 break; 412 case T_LONG: 413 assert(sig_bt[i + 1] == T_VOID, "expecting half"); 414 // fall through 415 case T_OBJECT: 416 case T_ARRAY: 417 case T_ADDRESS: 418 if (int_args < Argument::n_int_register_parameters_j) { 419 regs[i].set2(INT_ArgReg[int_args++]->as_VMReg()); 420 } else { 421 regs[i].set2(VMRegImpl::stack2reg(stk_args)); 422 stk_args += 2; 423 } 424 break; 425 case T_FLOAT: 426 if (fp_args < Argument::n_float_register_parameters_j) { 427 regs[i].set1(FP_ArgReg[fp_args++]->as_VMReg()); 428 } else { 429 regs[i].set1(VMRegImpl::stack2reg(stk_args)); 430 stk_args += 2; 431 } 432 break; 433 case T_DOUBLE: 434 assert(sig_bt[i + 1] == T_VOID, "expecting half"); 435 if (fp_args < Argument::n_float_register_parameters_j) { 436 regs[i].set2(FP_ArgReg[fp_args++]->as_VMReg()); 437 } else { 438 regs[i].set2(VMRegImpl::stack2reg(stk_args)); 439 stk_args += 2; 440 } 441 break; 442 default: 443 ShouldNotReachHere(); 444 break; 445 } 446 } 447 448 return round_to(stk_args, 2); 449 } 450 451 // Patch the callers callsite with entry to compiled code if it exists. 452 static void patch_callers_callsite(MacroAssembler *masm) { 453 Label L; 454 __ cmpptr(Address(rbx, in_bytes(Method::code_offset())), (int32_t)NULL_WORD); 455 __ jcc(Assembler::equal, L); 456 457 // Save the current stack pointer 458 __ mov(r13, rsp); 459 // Schedule the branch target address early. 460 // Call into the VM to patch the caller, then jump to compiled callee 461 // rax isn't live so capture return address while we easily can 462 __ movptr(rax, Address(rsp, 0)); 463 464 // align stack so push_CPU_state doesn't fault 465 __ andptr(rsp, -(StackAlignmentInBytes)); 466 __ push_CPU_state(); 467 468 // VM needs caller's callsite 469 // VM needs target method 470 // This needs to be a long call since we will relocate this adapter to 471 // the codeBuffer and it may not reach 472 473 // Allocate argument register save area 474 if (frame::arg_reg_save_area_bytes != 0) { 475 __ subptr(rsp, frame::arg_reg_save_area_bytes); 476 } 477 __ mov(c_rarg0, rbx); 478 __ mov(c_rarg1, rax); 479 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, SharedRuntime::fixup_callers_callsite))); 480 481 // De-allocate argument register save area 482 if (frame::arg_reg_save_area_bytes != 0) { 483 __ addptr(rsp, frame::arg_reg_save_area_bytes); 484 } 485 486 __ pop_CPU_state(); 487 // restore sp 488 __ mov(rsp, r13); 489 __ bind(L); 490 } 491 492 493 static void gen_c2i_adapter(MacroAssembler *masm, 494 int total_args_passed, 495 int comp_args_on_stack, 496 const BasicType *sig_bt, 497 const VMRegPair *regs, 498 Label& skip_fixup) { 499 // Before we get into the guts of the C2I adapter, see if we should be here 500 // at all. We've come from compiled code and are attempting to jump to the 501 // interpreter, which means the caller made a static call to get here 502 // (vcalls always get a compiled target if there is one). Check for a 503 // compiled target. If there is one, we need to patch the caller's call. 504 patch_callers_callsite(masm); 505 506 __ bind(skip_fixup); 507 508 // Since all args are passed on the stack, total_args_passed * 509 // Interpreter::stackElementSize is the space we need. Plus 1 because 510 // we also account for the return address location since 511 // we store it first rather than hold it in rax across all the shuffling 512 513 int extraspace = (total_args_passed * Interpreter::stackElementSize) + wordSize; 514 515 // stack is aligned, keep it that way 516 extraspace = round_to(extraspace, 2*wordSize); 517 518 // Get return address 519 __ pop(rax); 520 521 // set senderSP value 522 __ mov(r13, rsp); 523 524 __ subptr(rsp, extraspace); 525 526 // Store the return address in the expected location 527 __ movptr(Address(rsp, 0), rax); 528 529 // Now write the args into the outgoing interpreter space 530 for (int i = 0; i < total_args_passed; i++) { 531 if (sig_bt[i] == T_VOID) { 532 assert(i > 0 && (sig_bt[i-1] == T_LONG || sig_bt[i-1] == T_DOUBLE), "missing half"); 533 continue; 534 } 535 536 // offset to start parameters 537 int st_off = (total_args_passed - i) * Interpreter::stackElementSize; 538 int next_off = st_off - Interpreter::stackElementSize; 539 540 // Say 4 args: 541 // i st_off 542 // 0 32 T_LONG 543 // 1 24 T_VOID 544 // 2 16 T_OBJECT 545 // 3 8 T_BOOL 546 // - 0 return address 547 // 548 // However to make thing extra confusing. Because we can fit a long/double in 549 // a single slot on a 64 bt vm and it would be silly to break them up, the interpreter 550 // leaves one slot empty and only stores to a single slot. In this case the 551 // slot that is occupied is the T_VOID slot. See I said it was confusing. 552 553 VMReg r_1 = regs[i].first(); 554 VMReg r_2 = regs[i].second(); 555 if (!r_1->is_valid()) { 556 assert(!r_2->is_valid(), ""); 557 continue; 558 } 559 if (r_1->is_stack()) { 560 // memory to memory use rax 561 int ld_off = r_1->reg2stack() * VMRegImpl::stack_slot_size + extraspace; 562 if (!r_2->is_valid()) { 563 // sign extend?? 564 __ movl(rax, Address(rsp, ld_off)); 565 __ movptr(Address(rsp, st_off), rax); 566 567 } else { 568 569 __ movq(rax, Address(rsp, ld_off)); 570 571 // Two VMREgs|OptoRegs can be T_OBJECT, T_ADDRESS, T_DOUBLE, T_LONG 572 // T_DOUBLE and T_LONG use two slots in the interpreter 573 if ( sig_bt[i] == T_LONG || sig_bt[i] == T_DOUBLE) { 574 // ld_off == LSW, ld_off+wordSize == MSW 575 // st_off == MSW, next_off == LSW 576 __ movq(Address(rsp, next_off), rax); 577 #ifdef ASSERT 578 // Overwrite the unused slot with known junk 579 __ mov64(rax, CONST64(0xdeadffffdeadaaaa)); 580 __ movptr(Address(rsp, st_off), rax); 581 #endif /* ASSERT */ 582 } else { 583 __ movq(Address(rsp, st_off), rax); 584 } 585 } 586 } else if (r_1->is_Register()) { 587 Register r = r_1->as_Register(); 588 if (!r_2->is_valid()) { 589 // must be only an int (or less ) so move only 32bits to slot 590 // why not sign extend?? 591 __ movl(Address(rsp, st_off), r); 592 } else { 593 // Two VMREgs|OptoRegs can be T_OBJECT, T_ADDRESS, T_DOUBLE, T_LONG 594 // T_DOUBLE and T_LONG use two slots in the interpreter 595 if ( sig_bt[i] == T_LONG || sig_bt[i] == T_DOUBLE) { 596 // long/double in gpr 597 #ifdef ASSERT 598 // Overwrite the unused slot with known junk 599 __ mov64(rax, CONST64(0xdeadffffdeadaaab)); 600 __ movptr(Address(rsp, st_off), rax); 601 #endif /* ASSERT */ 602 __ movq(Address(rsp, next_off), r); 603 } else { 604 __ movptr(Address(rsp, st_off), r); 605 } 606 } 607 } else { 608 assert(r_1->is_XMMRegister(), ""); 609 if (!r_2->is_valid()) { 610 // only a float use just part of the slot 611 __ movflt(Address(rsp, st_off), r_1->as_XMMRegister()); 612 } else { 613 #ifdef ASSERT 614 // Overwrite the unused slot with known junk 615 __ mov64(rax, CONST64(0xdeadffffdeadaaac)); 616 __ movptr(Address(rsp, st_off), rax); 617 #endif /* ASSERT */ 618 __ movdbl(Address(rsp, next_off), r_1->as_XMMRegister()); 619 } 620 } 621 } 622 623 // Schedule the branch target address early. 624 __ movptr(rcx, Address(rbx, in_bytes(Method::interpreter_entry_offset()))); 625 __ jmp(rcx); 626 } 627 628 static void range_check(MacroAssembler* masm, Register pc_reg, Register temp_reg, 629 address code_start, address code_end, 630 Label& L_ok) { 631 Label L_fail; 632 __ lea(temp_reg, ExternalAddress(code_start)); 633 __ cmpptr(pc_reg, temp_reg); 634 __ jcc(Assembler::belowEqual, L_fail); 635 __ lea(temp_reg, ExternalAddress(code_end)); 636 __ cmpptr(pc_reg, temp_reg); 637 __ jcc(Assembler::below, L_ok); 638 __ bind(L_fail); 639 } 640 641 static void gen_i2c_adapter(MacroAssembler *masm, 642 int total_args_passed, 643 int comp_args_on_stack, 644 const BasicType *sig_bt, 645 const VMRegPair *regs) { 646 647 // Note: r13 contains the senderSP on entry. We must preserve it since 648 // we may do a i2c -> c2i transition if we lose a race where compiled 649 // code goes non-entrant while we get args ready. 650 // In addition we use r13 to locate all the interpreter args as 651 // we must align the stack to 16 bytes on an i2c entry else we 652 // lose alignment we expect in all compiled code and register 653 // save code can segv when fxsave instructions find improperly 654 // aligned stack pointer. 655 656 // Adapters can be frameless because they do not require the caller 657 // to perform additional cleanup work, such as correcting the stack pointer. 658 // An i2c adapter is frameless because the *caller* frame, which is interpreted, 659 // routinely repairs its own stack pointer (from interpreter_frame_last_sp), 660 // even if a callee has modified the stack pointer. 661 // A c2i adapter is frameless because the *callee* frame, which is interpreted, 662 // routinely repairs its caller's stack pointer (from sender_sp, which is set 663 // up via the senderSP register). 664 // In other words, if *either* the caller or callee is interpreted, we can 665 // get the stack pointer repaired after a call. 666 // This is why c2i and i2c adapters cannot be indefinitely composed. 667 // In particular, if a c2i adapter were to somehow call an i2c adapter, 668 // both caller and callee would be compiled methods, and neither would 669 // clean up the stack pointer changes performed by the two adapters. 670 // If this happens, control eventually transfers back to the compiled 671 // caller, but with an uncorrected stack, causing delayed havoc. 672 673 // Pick up the return address 674 __ movptr(rax, Address(rsp, 0)); 675 676 if (VerifyAdapterCalls && 677 (Interpreter::code() != NULL || StubRoutines::code1() != NULL)) { 678 // So, let's test for cascading c2i/i2c adapters right now. 679 // assert(Interpreter::contains($return_addr) || 680 // StubRoutines::contains($return_addr), 681 // "i2c adapter must return to an interpreter frame"); 682 __ block_comment("verify_i2c { "); 683 Label L_ok; 684 if (Interpreter::code() != NULL) 685 range_check(masm, rax, r11, 686 Interpreter::code()->code_start(), Interpreter::code()->code_end(), 687 L_ok); 688 if (StubRoutines::code1() != NULL) 689 range_check(masm, rax, r11, 690 StubRoutines::code1()->code_begin(), StubRoutines::code1()->code_end(), 691 L_ok); 692 if (StubRoutines::code2() != NULL) 693 range_check(masm, rax, r11, 694 StubRoutines::code2()->code_begin(), StubRoutines::code2()->code_end(), 695 L_ok); 696 const char* msg = "i2c adapter must return to an interpreter frame"; 697 __ block_comment(msg); 698 __ stop(msg); 699 __ bind(L_ok); 700 __ block_comment("} verify_i2ce "); 701 } 702 703 // Must preserve original SP for loading incoming arguments because 704 // we need to align the outgoing SP for compiled code. 705 __ movptr(r11, rsp); 706 707 // Cut-out for having no stack args. Since up to 2 int/oop args are passed 708 // in registers, we will occasionally have no stack args. 709 int comp_words_on_stack = 0; 710 if (comp_args_on_stack) { 711 // Sig words on the stack are greater-than VMRegImpl::stack0. Those in 712 // registers are below. By subtracting stack0, we either get a negative 713 // number (all values in registers) or the maximum stack slot accessed. 714 715 // Convert 4-byte c2 stack slots to words. 716 comp_words_on_stack = round_to(comp_args_on_stack*VMRegImpl::stack_slot_size, wordSize)>>LogBytesPerWord; 717 // Round up to miminum stack alignment, in wordSize 718 comp_words_on_stack = round_to(comp_words_on_stack, 2); 719 __ subptr(rsp, comp_words_on_stack * wordSize); 720 } 721 722 723 // Ensure compiled code always sees stack at proper alignment 724 __ andptr(rsp, -16); 725 726 // push the return address and misalign the stack that youngest frame always sees 727 // as far as the placement of the call instruction 728 __ push(rax); 729 730 // Put saved SP in another register 731 const Register saved_sp = rax; 732 __ movptr(saved_sp, r11); 733 734 // Will jump to the compiled code just as if compiled code was doing it. 735 // Pre-load the register-jump target early, to schedule it better. 736 __ movptr(r11, Address(rbx, in_bytes(Method::from_compiled_offset()))); 737 738 // Now generate the shuffle code. Pick up all register args and move the 739 // rest through the floating point stack top. 740 for (int i = 0; i < total_args_passed; i++) { 741 if (sig_bt[i] == T_VOID) { 742 // Longs and doubles are passed in native word order, but misaligned 743 // in the 32-bit build. 744 assert(i > 0 && (sig_bt[i-1] == T_LONG || sig_bt[i-1] == T_DOUBLE), "missing half"); 745 continue; 746 } 747 748 // Pick up 0, 1 or 2 words from SP+offset. 749 750 assert(!regs[i].second()->is_valid() || regs[i].first()->next() == regs[i].second(), 751 "scrambled load targets?"); 752 // Load in argument order going down. 753 int ld_off = (total_args_passed - i)*Interpreter::stackElementSize; 754 // Point to interpreter value (vs. tag) 755 int next_off = ld_off - Interpreter::stackElementSize; 756 // 757 // 758 // 759 VMReg r_1 = regs[i].first(); 760 VMReg r_2 = regs[i].second(); 761 if (!r_1->is_valid()) { 762 assert(!r_2->is_valid(), ""); 763 continue; 764 } 765 if (r_1->is_stack()) { 766 // Convert stack slot to an SP offset (+ wordSize to account for return address ) 767 int st_off = regs[i].first()->reg2stack()*VMRegImpl::stack_slot_size + wordSize; 768 769 // We can use r13 as a temp here because compiled code doesn't need r13 as an input 770 // and if we end up going thru a c2i because of a miss a reasonable value of r13 771 // will be generated. 772 if (!r_2->is_valid()) { 773 // sign extend??? 774 __ movl(r13, Address(saved_sp, ld_off)); 775 __ movptr(Address(rsp, st_off), r13); 776 } else { 777 // 778 // We are using two optoregs. This can be either T_OBJECT, T_ADDRESS, T_LONG, or T_DOUBLE 779 // the interpreter allocates two slots but only uses one for thr T_LONG or T_DOUBLE case 780 // So we must adjust where to pick up the data to match the interpreter. 781 // 782 // Interpreter local[n] == MSW, local[n+1] == LSW however locals 783 // are accessed as negative so LSW is at LOW address 784 785 // ld_off is MSW so get LSW 786 const int offset = (sig_bt[i]==T_LONG||sig_bt[i]==T_DOUBLE)? 787 next_off : ld_off; 788 __ movq(r13, Address(saved_sp, offset)); 789 // st_off is LSW (i.e. reg.first()) 790 __ movq(Address(rsp, st_off), r13); 791 } 792 } else if (r_1->is_Register()) { // Register argument 793 Register r = r_1->as_Register(); 794 assert(r != rax, "must be different"); 795 if (r_2->is_valid()) { 796 // 797 // We are using two VMRegs. This can be either T_OBJECT, T_ADDRESS, T_LONG, or T_DOUBLE 798 // the interpreter allocates two slots but only uses one for thr T_LONG or T_DOUBLE case 799 // So we must adjust where to pick up the data to match the interpreter. 800 801 const int offset = (sig_bt[i]==T_LONG||sig_bt[i]==T_DOUBLE)? 802 next_off : ld_off; 803 804 // this can be a misaligned move 805 __ movq(r, Address(saved_sp, offset)); 806 } else { 807 // sign extend and use a full word? 808 __ movl(r, Address(saved_sp, ld_off)); 809 } 810 } else { 811 if (!r_2->is_valid()) { 812 __ movflt(r_1->as_XMMRegister(), Address(saved_sp, ld_off)); 813 } else { 814 __ movdbl(r_1->as_XMMRegister(), Address(saved_sp, next_off)); 815 } 816 } 817 } 818 819 // 6243940 We might end up in handle_wrong_method if 820 // the callee is deoptimized as we race thru here. If that 821 // happens we don't want to take a safepoint because the 822 // caller frame will look interpreted and arguments are now 823 // "compiled" so it is much better to make this transition 824 // invisible to the stack walking code. Unfortunately if 825 // we try and find the callee by normal means a safepoint 826 // is possible. So we stash the desired callee in the thread 827 // and the vm will find there should this case occur. 828 829 __ movptr(Address(r15_thread, JavaThread::callee_target_offset()), rbx); 830 831 // put Method* where a c2i would expect should we end up there 832 // only needed becaus eof c2 resolve stubs return Method* as a result in 833 // rax 834 __ mov(rax, rbx); 835 __ jmp(r11); 836 } 837 838 // --------------------------------------------------------------- 839 AdapterHandlerEntry* SharedRuntime::generate_i2c2i_adapters(MacroAssembler *masm, 840 int total_args_passed, 841 int comp_args_on_stack, 842 const BasicType *sig_bt, 843 const VMRegPair *regs, 844 AdapterFingerPrint* fingerprint) { 845 address i2c_entry = __ pc(); 846 847 gen_i2c_adapter(masm, total_args_passed, comp_args_on_stack, sig_bt, regs); 848 849 // ------------------------------------------------------------------------- 850 // Generate a C2I adapter. On entry we know rbx holds the Method* during calls 851 // to the interpreter. The args start out packed in the compiled layout. They 852 // need to be unpacked into the interpreter layout. This will almost always 853 // require some stack space. We grow the current (compiled) stack, then repack 854 // the args. We finally end in a jump to the generic interpreter entry point. 855 // On exit from the interpreter, the interpreter will restore our SP (lest the 856 // compiled code, which relys solely on SP and not RBP, get sick). 857 858 address c2i_unverified_entry = __ pc(); 859 Label skip_fixup; 860 Label ok; 861 862 Register holder = rax; 863 Register receiver = j_rarg0; 864 Register temp = rbx; 865 866 { 867 __ load_klass(temp, receiver); 868 __ cmpptr(temp, Address(holder, CompiledICHolder::holder_klass_offset())); 869 __ movptr(rbx, Address(holder, CompiledICHolder::holder_method_offset())); 870 __ jcc(Assembler::equal, ok); 871 __ jump(RuntimeAddress(SharedRuntime::get_ic_miss_stub())); 872 873 __ bind(ok); 874 // Method might have been compiled since the call site was patched to 875 // interpreted if that is the case treat it as a miss so we can get 876 // the call site corrected. 877 __ cmpptr(Address(rbx, in_bytes(Method::code_offset())), (int32_t)NULL_WORD); 878 __ jcc(Assembler::equal, skip_fixup); 879 __ jump(RuntimeAddress(SharedRuntime::get_ic_miss_stub())); 880 } 881 882 address c2i_entry = __ pc(); 883 884 gen_c2i_adapter(masm, total_args_passed, comp_args_on_stack, sig_bt, regs, skip_fixup); 885 886 __ flush(); 887 return AdapterHandlerLibrary::new_entry(fingerprint, i2c_entry, c2i_entry, c2i_unverified_entry); 888 } 889 890 int SharedRuntime::c_calling_convention(const BasicType *sig_bt, 891 VMRegPair *regs, 892 int total_args_passed) { 893 // We return the amount of VMRegImpl stack slots we need to reserve for all 894 // the arguments NOT counting out_preserve_stack_slots. 895 896 // NOTE: These arrays will have to change when c1 is ported 897 #ifdef _WIN64 898 static const Register INT_ArgReg[Argument::n_int_register_parameters_c] = { 899 c_rarg0, c_rarg1, c_rarg2, c_rarg3 900 }; 901 static const XMMRegister FP_ArgReg[Argument::n_float_register_parameters_c] = { 902 c_farg0, c_farg1, c_farg2, c_farg3 903 }; 904 #else 905 static const Register INT_ArgReg[Argument::n_int_register_parameters_c] = { 906 c_rarg0, c_rarg1, c_rarg2, c_rarg3, c_rarg4, c_rarg5 907 }; 908 static const XMMRegister FP_ArgReg[Argument::n_float_register_parameters_c] = { 909 c_farg0, c_farg1, c_farg2, c_farg3, 910 c_farg4, c_farg5, c_farg6, c_farg7 911 }; 912 #endif // _WIN64 913 914 915 uint int_args = 0; 916 uint fp_args = 0; 917 uint stk_args = 0; // inc by 2 each time 918 919 for (int i = 0; i < total_args_passed; i++) { 920 switch (sig_bt[i]) { 921 case T_BOOLEAN: 922 case T_CHAR: 923 case T_BYTE: 924 case T_SHORT: 925 case T_INT: 926 if (int_args < Argument::n_int_register_parameters_c) { 927 regs[i].set1(INT_ArgReg[int_args++]->as_VMReg()); 928 #ifdef _WIN64 929 fp_args++; 930 // Allocate slots for callee to stuff register args the stack. 931 stk_args += 2; 932 #endif 933 } else { 934 regs[i].set1(VMRegImpl::stack2reg(stk_args)); 935 stk_args += 2; 936 } 937 break; 938 case T_LONG: 939 assert(sig_bt[i + 1] == T_VOID, "expecting half"); 940 // fall through 941 case T_OBJECT: 942 case T_ARRAY: 943 case T_ADDRESS: 944 case T_METADATA: 945 if (int_args < Argument::n_int_register_parameters_c) { 946 regs[i].set2(INT_ArgReg[int_args++]->as_VMReg()); 947 #ifdef _WIN64 948 fp_args++; 949 stk_args += 2; 950 #endif 951 } else { 952 regs[i].set2(VMRegImpl::stack2reg(stk_args)); 953 stk_args += 2; 954 } 955 break; 956 case T_FLOAT: 957 if (fp_args < Argument::n_float_register_parameters_c) { 958 regs[i].set1(FP_ArgReg[fp_args++]->as_VMReg()); 959 #ifdef _WIN64 960 int_args++; 961 // Allocate slots for callee to stuff register args the stack. 962 stk_args += 2; 963 #endif 964 } else { 965 regs[i].set1(VMRegImpl::stack2reg(stk_args)); 966 stk_args += 2; 967 } 968 break; 969 case T_DOUBLE: 970 assert(sig_bt[i + 1] == T_VOID, "expecting half"); 971 if (fp_args < Argument::n_float_register_parameters_c) { 972 regs[i].set2(FP_ArgReg[fp_args++]->as_VMReg()); 973 #ifdef _WIN64 974 int_args++; 975 // Allocate slots for callee to stuff register args the stack. 976 stk_args += 2; 977 #endif 978 } else { 979 regs[i].set2(VMRegImpl::stack2reg(stk_args)); 980 stk_args += 2; 981 } 982 break; 983 case T_VOID: // Halves of longs and doubles 984 assert(i != 0 && (sig_bt[i - 1] == T_LONG || sig_bt[i - 1] == T_DOUBLE), "expecting half"); 985 regs[i].set_bad(); 986 break; 987 default: 988 ShouldNotReachHere(); 989 break; 990 } 991 } 992 #ifdef _WIN64 993 // windows abi requires that we always allocate enough stack space 994 // for 4 64bit registers to be stored down. 995 if (stk_args < 8) { 996 stk_args = 8; 997 } 998 #endif // _WIN64 999 1000 return stk_args; 1001 } 1002 1003 // On 64 bit we will store integer like items to the stack as 1004 // 64 bits items (sparc abi) even though java would only store 1005 // 32bits for a parameter. On 32bit it will simply be 32 bits 1006 // So this routine will do 32->32 on 32bit and 32->64 on 64bit 1007 static void move32_64(MacroAssembler* masm, VMRegPair src, VMRegPair dst) { 1008 if (src.first()->is_stack()) { 1009 if (dst.first()->is_stack()) { 1010 // stack to stack 1011 __ movslq(rax, Address(rbp, reg2offset_in(src.first()))); 1012 __ movq(Address(rsp, reg2offset_out(dst.first())), rax); 1013 } else { 1014 // stack to reg 1015 __ movslq(dst.first()->as_Register(), Address(rbp, reg2offset_in(src.first()))); 1016 } 1017 } else if (dst.first()->is_stack()) { 1018 // reg to stack 1019 // Do we really have to sign extend??? 1020 // __ movslq(src.first()->as_Register(), src.first()->as_Register()); 1021 __ movq(Address(rsp, reg2offset_out(dst.first())), src.first()->as_Register()); 1022 } else { 1023 // Do we really have to sign extend??? 1024 // __ movslq(dst.first()->as_Register(), src.first()->as_Register()); 1025 if (dst.first() != src.first()) { 1026 __ movq(dst.first()->as_Register(), src.first()->as_Register()); 1027 } 1028 } 1029 } 1030 1031 static void move_ptr(MacroAssembler* masm, VMRegPair src, VMRegPair dst) { 1032 if (src.first()->is_stack()) { 1033 if (dst.first()->is_stack()) { 1034 // stack to stack 1035 __ movq(rax, Address(rbp, reg2offset_in(src.first()))); 1036 __ movq(Address(rsp, reg2offset_out(dst.first())), rax); 1037 } else { 1038 // stack to reg 1039 __ movq(dst.first()->as_Register(), Address(rbp, reg2offset_in(src.first()))); 1040 } 1041 } else if (dst.first()->is_stack()) { 1042 // reg to stack 1043 __ movq(Address(rsp, reg2offset_out(dst.first())), src.first()->as_Register()); 1044 } else { 1045 if (dst.first() != src.first()) { 1046 __ movq(dst.first()->as_Register(), src.first()->as_Register()); 1047 } 1048 } 1049 } 1050 1051 // An oop arg. Must pass a handle not the oop itself 1052 static void object_move(MacroAssembler* masm, 1053 OopMap* map, 1054 int oop_handle_offset, 1055 int framesize_in_slots, 1056 VMRegPair src, 1057 VMRegPair dst, 1058 bool is_receiver, 1059 int* receiver_offset) { 1060 1061 // must pass a handle. First figure out the location we use as a handle 1062 1063 Register rHandle = dst.first()->is_stack() ? rax : dst.first()->as_Register(); 1064 1065 // See if oop is NULL if it is we need no handle 1066 1067 if (src.first()->is_stack()) { 1068 1069 // Oop is already on the stack as an argument 1070 int offset_in_older_frame = src.first()->reg2stack() + SharedRuntime::out_preserve_stack_slots(); 1071 map->set_oop(VMRegImpl::stack2reg(offset_in_older_frame + framesize_in_slots)); 1072 if (is_receiver) { 1073 *receiver_offset = (offset_in_older_frame + framesize_in_slots) * VMRegImpl::stack_slot_size; 1074 } 1075 1076 __ cmpptr(Address(rbp, reg2offset_in(src.first())), (int32_t)NULL_WORD); 1077 __ lea(rHandle, Address(rbp, reg2offset_in(src.first()))); 1078 // conditionally move a NULL 1079 __ cmovptr(Assembler::equal, rHandle, Address(rbp, reg2offset_in(src.first()))); 1080 } else { 1081 1082 // Oop is in an a register we must store it to the space we reserve 1083 // on the stack for oop_handles and pass a handle if oop is non-NULL 1084 1085 const Register rOop = src.first()->as_Register(); 1086 int oop_slot; 1087 if (rOop == j_rarg0) 1088 oop_slot = 0; 1089 else if (rOop == j_rarg1) 1090 oop_slot = 1; 1091 else if (rOop == j_rarg2) 1092 oop_slot = 2; 1093 else if (rOop == j_rarg3) 1094 oop_slot = 3; 1095 else if (rOop == j_rarg4) 1096 oop_slot = 4; 1097 else { 1098 assert(rOop == j_rarg5, "wrong register"); 1099 oop_slot = 5; 1100 } 1101 1102 oop_slot = oop_slot * VMRegImpl::slots_per_word + oop_handle_offset; 1103 int offset = oop_slot*VMRegImpl::stack_slot_size; 1104 1105 map->set_oop(VMRegImpl::stack2reg(oop_slot)); 1106 // Store oop in handle area, may be NULL 1107 __ movptr(Address(rsp, offset), rOop); 1108 if (is_receiver) { 1109 *receiver_offset = offset; 1110 } 1111 1112 __ cmpptr(rOop, (int32_t)NULL_WORD); 1113 __ lea(rHandle, Address(rsp, offset)); 1114 // conditionally move a NULL from the handle area where it was just stored 1115 __ cmovptr(Assembler::equal, rHandle, Address(rsp, offset)); 1116 } 1117 1118 // If arg is on the stack then place it otherwise it is already in correct reg. 1119 if (dst.first()->is_stack()) { 1120 __ movptr(Address(rsp, reg2offset_out(dst.first())), rHandle); 1121 } 1122 } 1123 1124 // A float arg may have to do float reg int reg conversion 1125 static void float_move(MacroAssembler* masm, VMRegPair src, VMRegPair dst) { 1126 assert(!src.second()->is_valid() && !dst.second()->is_valid(), "bad float_move"); 1127 1128 // The calling conventions assures us that each VMregpair is either 1129 // all really one physical register or adjacent stack slots. 1130 // This greatly simplifies the cases here compared to sparc. 1131 1132 if (src.first()->is_stack()) { 1133 if (dst.first()->is_stack()) { 1134 __ movl(rax, Address(rbp, reg2offset_in(src.first()))); 1135 __ movptr(Address(rsp, reg2offset_out(dst.first())), rax); 1136 } else { 1137 // stack to reg 1138 assert(dst.first()->is_XMMRegister(), "only expect xmm registers as parameters"); 1139 __ movflt(dst.first()->as_XMMRegister(), Address(rbp, reg2offset_in(src.first()))); 1140 } 1141 } else if (dst.first()->is_stack()) { 1142 // reg to stack 1143 assert(src.first()->is_XMMRegister(), "only expect xmm registers as parameters"); 1144 __ movflt(Address(rsp, reg2offset_out(dst.first())), src.first()->as_XMMRegister()); 1145 } else { 1146 // reg to reg 1147 // In theory these overlap but the ordering is such that this is likely a nop 1148 if ( src.first() != dst.first()) { 1149 __ movdbl(dst.first()->as_XMMRegister(), src.first()->as_XMMRegister()); 1150 } 1151 } 1152 } 1153 1154 // A long move 1155 static void long_move(MacroAssembler* masm, VMRegPair src, VMRegPair dst) { 1156 1157 // The calling conventions assures us that each VMregpair is either 1158 // all really one physical register or adjacent stack slots. 1159 // This greatly simplifies the cases here compared to sparc. 1160 1161 if (src.is_single_phys_reg() ) { 1162 if (dst.is_single_phys_reg()) { 1163 if (dst.first() != src.first()) { 1164 __ mov(dst.first()->as_Register(), src.first()->as_Register()); 1165 } 1166 } else { 1167 assert(dst.is_single_reg(), "not a stack pair"); 1168 __ movq(Address(rsp, reg2offset_out(dst.first())), src.first()->as_Register()); 1169 } 1170 } else if (dst.is_single_phys_reg()) { 1171 assert(src.is_single_reg(), "not a stack pair"); 1172 __ movq(dst.first()->as_Register(), Address(rbp, reg2offset_out(src.first()))); 1173 } else { 1174 assert(src.is_single_reg() && dst.is_single_reg(), "not stack pairs"); 1175 __ movq(rax, Address(rbp, reg2offset_in(src.first()))); 1176 __ movq(Address(rsp, reg2offset_out(dst.first())), rax); 1177 } 1178 } 1179 1180 // A double move 1181 static void double_move(MacroAssembler* masm, VMRegPair src, VMRegPair dst) { 1182 1183 // The calling conventions assures us that each VMregpair is either 1184 // all really one physical register or adjacent stack slots. 1185 // This greatly simplifies the cases here compared to sparc. 1186 1187 if (src.is_single_phys_reg() ) { 1188 if (dst.is_single_phys_reg()) { 1189 // In theory these overlap but the ordering is such that this is likely a nop 1190 if ( src.first() != dst.first()) { 1191 __ movdbl(dst.first()->as_XMMRegister(), src.first()->as_XMMRegister()); 1192 } 1193 } else { 1194 assert(dst.is_single_reg(), "not a stack pair"); 1195 __ movdbl(Address(rsp, reg2offset_out(dst.first())), src.first()->as_XMMRegister()); 1196 } 1197 } else if (dst.is_single_phys_reg()) { 1198 assert(src.is_single_reg(), "not a stack pair"); 1199 __ movdbl(dst.first()->as_XMMRegister(), Address(rbp, reg2offset_out(src.first()))); 1200 } else { 1201 assert(src.is_single_reg() && dst.is_single_reg(), "not stack pairs"); 1202 __ movq(rax, Address(rbp, reg2offset_in(src.first()))); 1203 __ movq(Address(rsp, reg2offset_out(dst.first())), rax); 1204 } 1205 } 1206 1207 1208 void SharedRuntime::save_native_result(MacroAssembler *masm, BasicType ret_type, int frame_slots) { 1209 // We always ignore the frame_slots arg and just use the space just below frame pointer 1210 // which by this time is free to use 1211 switch (ret_type) { 1212 case T_FLOAT: 1213 __ movflt(Address(rbp, -wordSize), xmm0); 1214 break; 1215 case T_DOUBLE: 1216 __ movdbl(Address(rbp, -wordSize), xmm0); 1217 break; 1218 case T_VOID: break; 1219 default: { 1220 __ movptr(Address(rbp, -wordSize), rax); 1221 } 1222 } 1223 } 1224 1225 void SharedRuntime::restore_native_result(MacroAssembler *masm, BasicType ret_type, int frame_slots) { 1226 // We always ignore the frame_slots arg and just use the space just below frame pointer 1227 // which by this time is free to use 1228 switch (ret_type) { 1229 case T_FLOAT: 1230 __ movflt(xmm0, Address(rbp, -wordSize)); 1231 break; 1232 case T_DOUBLE: 1233 __ movdbl(xmm0, Address(rbp, -wordSize)); 1234 break; 1235 case T_VOID: break; 1236 default: { 1237 __ movptr(rax, Address(rbp, -wordSize)); 1238 } 1239 } 1240 } 1241 1242 static void save_args(MacroAssembler *masm, int arg_count, int first_arg, VMRegPair *args) { 1243 for ( int i = first_arg ; i < arg_count ; i++ ) { 1244 if (args[i].first()->is_Register()) { 1245 __ push(args[i].first()->as_Register()); 1246 } else if (args[i].first()->is_XMMRegister()) { 1247 __ subptr(rsp, 2*wordSize); 1248 __ movdbl(Address(rsp, 0), args[i].first()->as_XMMRegister()); 1249 } 1250 } 1251 } 1252 1253 static void restore_args(MacroAssembler *masm, int arg_count, int first_arg, VMRegPair *args) { 1254 for ( int i = arg_count - 1 ; i >= first_arg ; i-- ) { 1255 if (args[i].first()->is_Register()) { 1256 __ pop(args[i].first()->as_Register()); 1257 } else if (args[i].first()->is_XMMRegister()) { 1258 __ movdbl(args[i].first()->as_XMMRegister(), Address(rsp, 0)); 1259 __ addptr(rsp, 2*wordSize); 1260 } 1261 } 1262 } 1263 1264 1265 static void save_or_restore_arguments(MacroAssembler* masm, 1266 const int stack_slots, 1267 const int total_in_args, 1268 const int arg_save_area, 1269 OopMap* map, 1270 VMRegPair* in_regs, 1271 BasicType* in_sig_bt) { 1272 // if map is non-NULL then the code should store the values, 1273 // otherwise it should load them. 1274 int slot = arg_save_area; 1275 // Save down double word first 1276 for ( int i = 0; i < total_in_args; i++) { 1277 if (in_regs[i].first()->is_XMMRegister() && in_sig_bt[i] == T_DOUBLE) { 1278 int offset = slot * VMRegImpl::stack_slot_size; 1279 slot += VMRegImpl::slots_per_word; 1280 assert(slot <= stack_slots, "overflow"); 1281 if (map != NULL) { 1282 __ movdbl(Address(rsp, offset), in_regs[i].first()->as_XMMRegister()); 1283 } else { 1284 __ movdbl(in_regs[i].first()->as_XMMRegister(), Address(rsp, offset)); 1285 } 1286 } 1287 if (in_regs[i].first()->is_Register() && 1288 (in_sig_bt[i] == T_LONG || in_sig_bt[i] == T_ARRAY)) { 1289 int offset = slot * VMRegImpl::stack_slot_size; 1290 if (map != NULL) { 1291 __ movq(Address(rsp, offset), in_regs[i].first()->as_Register()); 1292 if (in_sig_bt[i] == T_ARRAY) { 1293 map->set_oop(VMRegImpl::stack2reg(slot));; 1294 } 1295 } else { 1296 __ movq(in_regs[i].first()->as_Register(), Address(rsp, offset)); 1297 } 1298 slot += VMRegImpl::slots_per_word; 1299 } 1300 } 1301 // Save or restore single word registers 1302 for ( int i = 0; i < total_in_args; i++) { 1303 if (in_regs[i].first()->is_Register()) { 1304 int offset = slot * VMRegImpl::stack_slot_size; 1305 slot++; 1306 assert(slot <= stack_slots, "overflow"); 1307 1308 // Value is in an input register pass we must flush it to the stack 1309 const Register reg = in_regs[i].first()->as_Register(); 1310 switch (in_sig_bt[i]) { 1311 case T_BOOLEAN: 1312 case T_CHAR: 1313 case T_BYTE: 1314 case T_SHORT: 1315 case T_INT: 1316 if (map != NULL) { 1317 __ movl(Address(rsp, offset), reg); 1318 } else { 1319 __ movl(reg, Address(rsp, offset)); 1320 } 1321 break; 1322 case T_ARRAY: 1323 case T_LONG: 1324 // handled above 1325 break; 1326 case T_OBJECT: 1327 default: ShouldNotReachHere(); 1328 } 1329 } else if (in_regs[i].first()->is_XMMRegister()) { 1330 if (in_sig_bt[i] == T_FLOAT) { 1331 int offset = slot * VMRegImpl::stack_slot_size; 1332 slot++; 1333 assert(slot <= stack_slots, "overflow"); 1334 if (map != NULL) { 1335 __ movflt(Address(rsp, offset), in_regs[i].first()->as_XMMRegister()); 1336 } else { 1337 __ movflt(in_regs[i].first()->as_XMMRegister(), Address(rsp, offset)); 1338 } 1339 } 1340 } else if (in_regs[i].first()->is_stack()) { 1341 if (in_sig_bt[i] == T_ARRAY && map != NULL) { 1342 int offset_in_older_frame = in_regs[i].first()->reg2stack() + SharedRuntime::out_preserve_stack_slots(); 1343 map->set_oop(VMRegImpl::stack2reg(offset_in_older_frame + stack_slots)); 1344 } 1345 } 1346 } 1347 } 1348 1349 1350 // Check GC_locker::needs_gc and enter the runtime if it's true. This 1351 // keeps a new JNI critical region from starting until a GC has been 1352 // forced. Save down any oops in registers and describe them in an 1353 // OopMap. 1354 static void check_needs_gc_for_critical_native(MacroAssembler* masm, 1355 int stack_slots, 1356 int total_c_args, 1357 int total_in_args, 1358 int arg_save_area, 1359 OopMapSet* oop_maps, 1360 VMRegPair* in_regs, 1361 BasicType* in_sig_bt) { 1362 __ block_comment("check GC_locker::needs_gc"); 1363 Label cont; 1364 __ cmp8(ExternalAddress((address)GC_locker::needs_gc_address()), false); 1365 __ jcc(Assembler::equal, cont); 1366 1367 // Save down any incoming oops and call into the runtime to halt for a GC 1368 1369 OopMap* map = new OopMap(stack_slots * 2, 0 /* arg_slots*/); 1370 save_or_restore_arguments(masm, stack_slots, total_in_args, 1371 arg_save_area, map, in_regs, in_sig_bt); 1372 1373 address the_pc = __ pc(); 1374 oop_maps->add_gc_map( __ offset(), map); 1375 __ set_last_Java_frame(rsp, noreg, the_pc); 1376 1377 __ block_comment("block_for_jni_critical"); 1378 __ movptr(c_rarg0, r15_thread); 1379 __ mov(r12, rsp); // remember sp 1380 __ subptr(rsp, frame::arg_reg_save_area_bytes); // windows 1381 __ andptr(rsp, -16); // align stack as required by ABI 1382 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, SharedRuntime::block_for_jni_critical))); 1383 __ mov(rsp, r12); // restore sp 1384 __ reinit_heapbase(); 1385 1386 __ reset_last_Java_frame(false, true); 1387 1388 save_or_restore_arguments(masm, stack_slots, total_in_args, 1389 arg_save_area, NULL, in_regs, in_sig_bt); 1390 1391 __ bind(cont); 1392 #ifdef ASSERT 1393 if (StressCriticalJNINatives) { 1394 // Stress register saving 1395 OopMap* map = new OopMap(stack_slots * 2, 0 /* arg_slots*/); 1396 save_or_restore_arguments(masm, stack_slots, total_in_args, 1397 arg_save_area, map, in_regs, in_sig_bt); 1398 // Destroy argument registers 1399 for (int i = 0; i < total_in_args - 1; i++) { 1400 if (in_regs[i].first()->is_Register()) { 1401 const Register reg = in_regs[i].first()->as_Register(); 1402 __ xorptr(reg, reg); 1403 } else if (in_regs[i].first()->is_XMMRegister()) { 1404 __ xorpd(in_regs[i].first()->as_XMMRegister(), in_regs[i].first()->as_XMMRegister()); 1405 } else if (in_regs[i].first()->is_FloatRegister()) { 1406 ShouldNotReachHere(); 1407 } else if (in_regs[i].first()->is_stack()) { 1408 // Nothing to do 1409 } else { 1410 ShouldNotReachHere(); 1411 } 1412 if (in_sig_bt[i] == T_LONG || in_sig_bt[i] == T_DOUBLE) { 1413 i++; 1414 } 1415 } 1416 1417 save_or_restore_arguments(masm, stack_slots, total_in_args, 1418 arg_save_area, NULL, in_regs, in_sig_bt); 1419 } 1420 #endif 1421 } 1422 1423 // Unpack an array argument into a pointer to the body and the length 1424 // if the array is non-null, otherwise pass 0 for both. 1425 static void unpack_array_argument(MacroAssembler* masm, VMRegPair reg, BasicType in_elem_type, VMRegPair body_arg, VMRegPair length_arg) { 1426 Register tmp_reg = rax; 1427 assert(!body_arg.first()->is_Register() || body_arg.first()->as_Register() != tmp_reg, 1428 "possible collision"); 1429 assert(!length_arg.first()->is_Register() || length_arg.first()->as_Register() != tmp_reg, 1430 "possible collision"); 1431 1432 __ block_comment("unpack_array_argument {"); 1433 1434 // Pass the length, ptr pair 1435 Label is_null, done; 1436 VMRegPair tmp; 1437 tmp.set_ptr(tmp_reg->as_VMReg()); 1438 if (reg.first()->is_stack()) { 1439 // Load the arg up from the stack 1440 move_ptr(masm, reg, tmp); 1441 reg = tmp; 1442 } 1443 __ testptr(reg.first()->as_Register(), reg.first()->as_Register()); 1444 __ jccb(Assembler::equal, is_null); 1445 __ lea(tmp_reg, Address(reg.first()->as_Register(), arrayOopDesc::base_offset_in_bytes(in_elem_type))); 1446 move_ptr(masm, tmp, body_arg); 1447 // load the length relative to the body. 1448 __ movl(tmp_reg, Address(tmp_reg, arrayOopDesc::length_offset_in_bytes() - 1449 arrayOopDesc::base_offset_in_bytes(in_elem_type))); 1450 move32_64(masm, tmp, length_arg); 1451 __ jmpb(done); 1452 __ bind(is_null); 1453 // Pass zeros 1454 __ xorptr(tmp_reg, tmp_reg); 1455 move_ptr(masm, tmp, body_arg); 1456 move32_64(masm, tmp, length_arg); 1457 __ bind(done); 1458 1459 __ block_comment("} unpack_array_argument"); 1460 } 1461 1462 1463 // Different signatures may require very different orders for the move 1464 // to avoid clobbering other arguments. There's no simple way to 1465 // order them safely. Compute a safe order for issuing stores and 1466 // break any cycles in those stores. This code is fairly general but 1467 // it's not necessary on the other platforms so we keep it in the 1468 // platform dependent code instead of moving it into a shared file. 1469 // (See bugs 7013347 & 7145024.) 1470 // Note that this code is specific to LP64. 1471 class ComputeMoveOrder: public StackObj { 1472 class MoveOperation: public ResourceObj { 1473 friend class ComputeMoveOrder; 1474 private: 1475 VMRegPair _src; 1476 VMRegPair _dst; 1477 int _src_index; 1478 int _dst_index; 1479 bool _processed; 1480 MoveOperation* _next; 1481 MoveOperation* _prev; 1482 1483 static int get_id(VMRegPair r) { 1484 return r.first()->value(); 1485 } 1486 1487 public: 1488 MoveOperation(int src_index, VMRegPair src, int dst_index, VMRegPair dst): 1489 _src(src) 1490 , _src_index(src_index) 1491 , _dst(dst) 1492 , _dst_index(dst_index) 1493 , _next(NULL) 1494 , _prev(NULL) 1495 , _processed(false) { 1496 } 1497 1498 VMRegPair src() const { return _src; } 1499 int src_id() const { return get_id(src()); } 1500 int src_index() const { return _src_index; } 1501 VMRegPair dst() const { return _dst; } 1502 void set_dst(int i, VMRegPair dst) { _dst_index = i, _dst = dst; } 1503 int dst_index() const { return _dst_index; } 1504 int dst_id() const { return get_id(dst()); } 1505 MoveOperation* next() const { return _next; } 1506 MoveOperation* prev() const { return _prev; } 1507 void set_processed() { _processed = true; } 1508 bool is_processed() const { return _processed; } 1509 1510 // insert 1511 void break_cycle(VMRegPair temp_register) { 1512 // create a new store following the last store 1513 // to move from the temp_register to the original 1514 MoveOperation* new_store = new MoveOperation(-1, temp_register, dst_index(), dst()); 1515 1516 // break the cycle of links and insert new_store at the end 1517 // break the reverse link. 1518 MoveOperation* p = prev(); 1519 assert(p->next() == this, "must be"); 1520 _prev = NULL; 1521 p->_next = new_store; 1522 new_store->_prev = p; 1523 1524 // change the original store to save it's value in the temp. 1525 set_dst(-1, temp_register); 1526 } 1527 1528 void link(GrowableArray<MoveOperation*>& killer) { 1529 // link this store in front the store that it depends on 1530 MoveOperation* n = killer.at_grow(src_id(), NULL); 1531 if (n != NULL) { 1532 assert(_next == NULL && n->_prev == NULL, "shouldn't have been set yet"); 1533 _next = n; 1534 n->_prev = this; 1535 } 1536 } 1537 }; 1538 1539 private: 1540 GrowableArray<MoveOperation*> edges; 1541 1542 public: 1543 ComputeMoveOrder(int total_in_args, VMRegPair* in_regs, int total_c_args, VMRegPair* out_regs, 1544 BasicType* in_sig_bt, GrowableArray<int>& arg_order, VMRegPair tmp_vmreg) { 1545 // Move operations where the dest is the stack can all be 1546 // scheduled first since they can't interfere with the other moves. 1547 for (int i = total_in_args - 1, c_arg = total_c_args - 1; i >= 0; i--, c_arg--) { 1548 if (in_sig_bt[i] == T_ARRAY) { 1549 c_arg--; 1550 if (out_regs[c_arg].first()->is_stack() && 1551 out_regs[c_arg + 1].first()->is_stack()) { 1552 arg_order.push(i); 1553 arg_order.push(c_arg); 1554 } else { 1555 if (out_regs[c_arg].first()->is_stack() || 1556 in_regs[i].first() == out_regs[c_arg].first()) { 1557 add_edge(i, in_regs[i].first(), c_arg, out_regs[c_arg + 1]); 1558 } else { 1559 add_edge(i, in_regs[i].first(), c_arg, out_regs[c_arg]); 1560 } 1561 } 1562 } else if (in_sig_bt[i] == T_VOID) { 1563 arg_order.push(i); 1564 arg_order.push(c_arg); 1565 } else { 1566 if (out_regs[c_arg].first()->is_stack() || 1567 in_regs[i].first() == out_regs[c_arg].first()) { 1568 arg_order.push(i); 1569 arg_order.push(c_arg); 1570 } else { 1571 add_edge(i, in_regs[i].first(), c_arg, out_regs[c_arg]); 1572 } 1573 } 1574 } 1575 // Break any cycles in the register moves and emit the in the 1576 // proper order. 1577 GrowableArray<MoveOperation*>* stores = get_store_order(tmp_vmreg); 1578 for (int i = 0; i < stores->length(); i++) { 1579 arg_order.push(stores->at(i)->src_index()); 1580 arg_order.push(stores->at(i)->dst_index()); 1581 } 1582 } 1583 1584 // Collected all the move operations 1585 void add_edge(int src_index, VMRegPair src, int dst_index, VMRegPair dst) { 1586 if (src.first() == dst.first()) return; 1587 edges.append(new MoveOperation(src_index, src, dst_index, dst)); 1588 } 1589 1590 // Walk the edges breaking cycles between moves. The result list 1591 // can be walked in order to produce the proper set of loads 1592 GrowableArray<MoveOperation*>* get_store_order(VMRegPair temp_register) { 1593 // Record which moves kill which values 1594 GrowableArray<MoveOperation*> killer; 1595 for (int i = 0; i < edges.length(); i++) { 1596 MoveOperation* s = edges.at(i); 1597 assert(killer.at_grow(s->dst_id(), NULL) == NULL, "only one killer"); 1598 killer.at_put_grow(s->dst_id(), s, NULL); 1599 } 1600 assert(killer.at_grow(MoveOperation::get_id(temp_register), NULL) == NULL, 1601 "make sure temp isn't in the registers that are killed"); 1602 1603 // create links between loads and stores 1604 for (int i = 0; i < edges.length(); i++) { 1605 edges.at(i)->link(killer); 1606 } 1607 1608 // at this point, all the move operations are chained together 1609 // in a doubly linked list. Processing it backwards finds 1610 // the beginning of the chain, forwards finds the end. If there's 1611 // a cycle it can be broken at any point, so pick an edge and walk 1612 // backward until the list ends or we end where we started. 1613 GrowableArray<MoveOperation*>* stores = new GrowableArray<MoveOperation*>(); 1614 for (int e = 0; e < edges.length(); e++) { 1615 MoveOperation* s = edges.at(e); 1616 if (!s->is_processed()) { 1617 MoveOperation* start = s; 1618 // search for the beginning of the chain or cycle 1619 while (start->prev() != NULL && start->prev() != s) { 1620 start = start->prev(); 1621 } 1622 if (start->prev() == s) { 1623 start->break_cycle(temp_register); 1624 } 1625 // walk the chain forward inserting to store list 1626 while (start != NULL) { 1627 stores->append(start); 1628 start->set_processed(); 1629 start = start->next(); 1630 } 1631 } 1632 } 1633 return stores; 1634 } 1635 }; 1636 1637 static void verify_oop_args(MacroAssembler* masm, 1638 methodHandle method, 1639 const BasicType* sig_bt, 1640 const VMRegPair* regs) { 1641 Register temp_reg = rbx; // not part of any compiled calling seq 1642 if (VerifyOops) { 1643 for (int i = 0; i < method->size_of_parameters(); i++) { 1644 if (sig_bt[i] == T_OBJECT || 1645 sig_bt[i] == T_ARRAY) { 1646 VMReg r = regs[i].first(); 1647 assert(r->is_valid(), "bad oop arg"); 1648 if (r->is_stack()) { 1649 __ movptr(temp_reg, Address(rsp, r->reg2stack() * VMRegImpl::stack_slot_size + wordSize)); 1650 __ verify_oop(temp_reg); 1651 } else { 1652 __ verify_oop(r->as_Register()); 1653 } 1654 } 1655 } 1656 } 1657 } 1658 1659 static void gen_special_dispatch(MacroAssembler* masm, 1660 methodHandle method, 1661 const BasicType* sig_bt, 1662 const VMRegPair* regs) { 1663 verify_oop_args(masm, method, sig_bt, regs); 1664 vmIntrinsics::ID iid = method->intrinsic_id(); 1665 1666 // Now write the args into the outgoing interpreter space 1667 bool has_receiver = false; 1668 Register receiver_reg = noreg; 1669 int member_arg_pos = -1; 1670 Register member_reg = noreg; 1671 int ref_kind = MethodHandles::signature_polymorphic_intrinsic_ref_kind(iid); 1672 if (ref_kind != 0) { 1673 member_arg_pos = method->size_of_parameters() - 1; // trailing MemberName argument 1674 member_reg = rbx; // known to be free at this point 1675 has_receiver = MethodHandles::ref_kind_has_receiver(ref_kind); 1676 } else if (iid == vmIntrinsics::_invokeBasic) { 1677 has_receiver = true; 1678 } else { 1679 fatal(err_msg_res("unexpected intrinsic id %d", iid)); 1680 } 1681 1682 if (member_reg != noreg) { 1683 // Load the member_arg into register, if necessary. 1684 SharedRuntime::check_member_name_argument_is_last_argument(method, sig_bt, regs); 1685 VMReg r = regs[member_arg_pos].first(); 1686 if (r->is_stack()) { 1687 __ movptr(member_reg, Address(rsp, r->reg2stack() * VMRegImpl::stack_slot_size + wordSize)); 1688 } else { 1689 // no data motion is needed 1690 member_reg = r->as_Register(); 1691 } 1692 } 1693 1694 if (has_receiver) { 1695 // Make sure the receiver is loaded into a register. 1696 assert(method->size_of_parameters() > 0, "oob"); 1697 assert(sig_bt[0] == T_OBJECT, "receiver argument must be an object"); 1698 VMReg r = regs[0].first(); 1699 assert(r->is_valid(), "bad receiver arg"); 1700 if (r->is_stack()) { 1701 // Porting note: This assumes that compiled calling conventions always 1702 // pass the receiver oop in a register. If this is not true on some 1703 // platform, pick a temp and load the receiver from stack. 1704 fatal("receiver always in a register"); 1705 receiver_reg = j_rarg0; // known to be free at this point 1706 __ movptr(receiver_reg, Address(rsp, r->reg2stack() * VMRegImpl::stack_slot_size + wordSize)); 1707 } else { 1708 // no data motion is needed 1709 receiver_reg = r->as_Register(); 1710 } 1711 } 1712 1713 // Figure out which address we are really jumping to: 1714 MethodHandles::generate_method_handle_dispatch(masm, iid, 1715 receiver_reg, member_reg, /*for_compiler_entry:*/ true); 1716 } 1717 1718 // --------------------------------------------------------------------------- 1719 // Generate a native wrapper for a given method. The method takes arguments 1720 // in the Java compiled code convention, marshals them to the native 1721 // convention (handlizes oops, etc), transitions to native, makes the call, 1722 // returns to java state (possibly blocking), unhandlizes any result and 1723 // returns. 1724 // 1725 // Critical native functions are a shorthand for the use of 1726 // GetPrimtiveArrayCritical and disallow the use of any other JNI 1727 // functions. The wrapper is expected to unpack the arguments before 1728 // passing them to the callee and perform checks before and after the 1729 // native call to ensure that they GC_locker 1730 // lock_critical/unlock_critical semantics are followed. Some other 1731 // parts of JNI setup are skipped like the tear down of the JNI handle 1732 // block and the check for pending exceptions it's impossible for them 1733 // to be thrown. 1734 // 1735 // They are roughly structured like this: 1736 // if (GC_locker::needs_gc()) 1737 // SharedRuntime::block_for_jni_critical(); 1738 // tranistion to thread_in_native 1739 // unpack arrray arguments and call native entry point 1740 // check for safepoint in progress 1741 // check if any thread suspend flags are set 1742 // call into JVM and possible unlock the JNI critical 1743 // if a GC was suppressed while in the critical native. 1744 // transition back to thread_in_Java 1745 // return to caller 1746 // 1747 nmethod* SharedRuntime::generate_native_wrapper(MacroAssembler* masm, 1748 methodHandle method, 1749 int compile_id, 1750 BasicType* in_sig_bt, 1751 VMRegPair* in_regs, 1752 BasicType ret_type) { 1753 if (method->is_method_handle_intrinsic()) { 1754 vmIntrinsics::ID iid = method->intrinsic_id(); 1755 intptr_t start = (intptr_t)__ pc(); 1756 int vep_offset = ((intptr_t)__ pc()) - start; 1757 gen_special_dispatch(masm, 1758 method, 1759 in_sig_bt, 1760 in_regs); 1761 int frame_complete = ((intptr_t)__ pc()) - start; // not complete, period 1762 __ flush(); 1763 int stack_slots = SharedRuntime::out_preserve_stack_slots(); // no out slots at all, actually 1764 return nmethod::new_native_nmethod(method, 1765 compile_id, 1766 masm->code(), 1767 vep_offset, 1768 frame_complete, 1769 stack_slots / VMRegImpl::slots_per_word, 1770 in_ByteSize(-1), 1771 in_ByteSize(-1), 1772 (OopMapSet*)NULL); 1773 } 1774 bool is_critical_native = true; 1775 address native_func = method->critical_native_function(); 1776 if (native_func == NULL) { 1777 native_func = method->native_function(); 1778 is_critical_native = false; 1779 } 1780 assert(native_func != NULL, "must have function"); 1781 1782 // An OopMap for lock (and class if static) 1783 OopMapSet *oop_maps = new OopMapSet(); 1784 intptr_t start = (intptr_t)__ pc(); 1785 1786 // We have received a description of where all the java arg are located 1787 // on entry to the wrapper. We need to convert these args to where 1788 // the jni function will expect them. To figure out where they go 1789 // we convert the java signature to a C signature by inserting 1790 // the hidden arguments as arg[0] and possibly arg[1] (static method) 1791 1792 const int total_in_args = method->size_of_parameters(); 1793 int total_c_args = total_in_args; 1794 if (!is_critical_native) { 1795 total_c_args += 1; 1796 if (method->is_static()) { 1797 total_c_args++; 1798 } 1799 } else { 1800 for (int i = 0; i < total_in_args; i++) { 1801 if (in_sig_bt[i] == T_ARRAY) { 1802 total_c_args++; 1803 } 1804 } 1805 } 1806 1807 BasicType* out_sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_c_args); 1808 VMRegPair* out_regs = NEW_RESOURCE_ARRAY(VMRegPair, total_c_args); 1809 BasicType* in_elem_bt = NULL; 1810 1811 int argc = 0; 1812 if (!is_critical_native) { 1813 out_sig_bt[argc++] = T_ADDRESS; 1814 if (method->is_static()) { 1815 out_sig_bt[argc++] = T_OBJECT; 1816 } 1817 1818 for (int i = 0; i < total_in_args ; i++ ) { 1819 out_sig_bt[argc++] = in_sig_bt[i]; 1820 } 1821 } else { 1822 Thread* THREAD = Thread::current(); 1823 in_elem_bt = NEW_RESOURCE_ARRAY(BasicType, total_in_args); 1824 SignatureStream ss(method->signature()); 1825 for (int i = 0; i < total_in_args ; i++ ) { 1826 if (in_sig_bt[i] == T_ARRAY) { 1827 // Arrays are passed as int, elem* pair 1828 out_sig_bt[argc++] = T_INT; 1829 out_sig_bt[argc++] = T_ADDRESS; 1830 Symbol* atype = ss.as_symbol(CHECK_NULL); 1831 const char* at = atype->as_C_string(); 1832 if (strlen(at) == 2) { 1833 assert(at[0] == '[', "must be"); 1834 switch (at[1]) { 1835 case 'B': in_elem_bt[i] = T_BYTE; break; 1836 case 'C': in_elem_bt[i] = T_CHAR; break; 1837 case 'D': in_elem_bt[i] = T_DOUBLE; break; 1838 case 'F': in_elem_bt[i] = T_FLOAT; break; 1839 case 'I': in_elem_bt[i] = T_INT; break; 1840 case 'J': in_elem_bt[i] = T_LONG; break; 1841 case 'S': in_elem_bt[i] = T_SHORT; break; 1842 case 'Z': in_elem_bt[i] = T_BOOLEAN; break; 1843 default: ShouldNotReachHere(); 1844 } 1845 } 1846 } else { 1847 out_sig_bt[argc++] = in_sig_bt[i]; 1848 in_elem_bt[i] = T_VOID; 1849 } 1850 if (in_sig_bt[i] != T_VOID) { 1851 assert(in_sig_bt[i] == ss.type(), "must match"); 1852 ss.next(); 1853 } 1854 } 1855 } 1856 1857 // Now figure out where the args must be stored and how much stack space 1858 // they require. 1859 int out_arg_slots; 1860 out_arg_slots = c_calling_convention(out_sig_bt, out_regs, total_c_args); 1861 1862 // Compute framesize for the wrapper. We need to handlize all oops in 1863 // incoming registers 1864 1865 // Calculate the total number of stack slots we will need. 1866 1867 // First count the abi requirement plus all of the outgoing args 1868 int stack_slots = SharedRuntime::out_preserve_stack_slots() + out_arg_slots; 1869 1870 // Now the space for the inbound oop handle area 1871 int total_save_slots = 6 * VMRegImpl::slots_per_word; // 6 arguments passed in registers 1872 if (is_critical_native) { 1873 // Critical natives may have to call out so they need a save area 1874 // for register arguments. 1875 int double_slots = 0; 1876 int single_slots = 0; 1877 for ( int i = 0; i < total_in_args; i++) { 1878 if (in_regs[i].first()->is_Register()) { 1879 const Register reg = in_regs[i].first()->as_Register(); 1880 switch (in_sig_bt[i]) { 1881 case T_BOOLEAN: 1882 case T_BYTE: 1883 case T_SHORT: 1884 case T_CHAR: 1885 case T_INT: single_slots++; break; 1886 case T_ARRAY: // specific to LP64 (7145024) 1887 case T_LONG: double_slots++; break; 1888 default: ShouldNotReachHere(); 1889 } 1890 } else if (in_regs[i].first()->is_XMMRegister()) { 1891 switch (in_sig_bt[i]) { 1892 case T_FLOAT: single_slots++; break; 1893 case T_DOUBLE: double_slots++; break; 1894 default: ShouldNotReachHere(); 1895 } 1896 } else if (in_regs[i].first()->is_FloatRegister()) { 1897 ShouldNotReachHere(); 1898 } 1899 } 1900 total_save_slots = double_slots * 2 + single_slots; 1901 // align the save area 1902 if (double_slots != 0) { 1903 stack_slots = round_to(stack_slots, 2); 1904 } 1905 } 1906 1907 int oop_handle_offset = stack_slots; 1908 stack_slots += total_save_slots; 1909 1910 // Now any space we need for handlizing a klass if static method 1911 1912 int klass_slot_offset = 0; 1913 int klass_offset = -1; 1914 int lock_slot_offset = 0; 1915 bool is_static = false; 1916 1917 if (method->is_static()) { 1918 klass_slot_offset = stack_slots; 1919 stack_slots += VMRegImpl::slots_per_word; 1920 klass_offset = klass_slot_offset * VMRegImpl::stack_slot_size; 1921 is_static = true; 1922 } 1923 1924 // Plus a lock if needed 1925 1926 if (method->is_synchronized()) { 1927 lock_slot_offset = stack_slots; 1928 stack_slots += VMRegImpl::slots_per_word; 1929 } 1930 1931 // Now a place (+2) to save return values or temp during shuffling 1932 // + 4 for return address (which we own) and saved rbp 1933 stack_slots += 6; 1934 1935 // Ok The space we have allocated will look like: 1936 // 1937 // 1938 // FP-> | | 1939 // |---------------------| 1940 // | 2 slots for moves | 1941 // |---------------------| 1942 // | lock box (if sync) | 1943 // |---------------------| <- lock_slot_offset 1944 // | klass (if static) | 1945 // |---------------------| <- klass_slot_offset 1946 // | oopHandle area | 1947 // |---------------------| <- oop_handle_offset (6 java arg registers) 1948 // | outbound memory | 1949 // | based arguments | 1950 // | | 1951 // |---------------------| 1952 // | | 1953 // SP-> | out_preserved_slots | 1954 // 1955 // 1956 1957 1958 // Now compute actual number of stack words we need rounding to make 1959 // stack properly aligned. 1960 stack_slots = round_to(stack_slots, StackAlignmentInSlots); 1961 1962 int stack_size = stack_slots * VMRegImpl::stack_slot_size; 1963 1964 // First thing make an ic check to see if we should even be here 1965 1966 // We are free to use all registers as temps without saving them and 1967 // restoring them except rbp. rbp is the only callee save register 1968 // as far as the interpreter and the compiler(s) are concerned. 1969 1970 1971 const Register ic_reg = rax; 1972 const Register receiver = j_rarg0; 1973 1974 Label hit; 1975 Label exception_pending; 1976 1977 assert_different_registers(ic_reg, receiver, rscratch1); 1978 __ verify_oop(receiver); 1979 __ load_klass(rscratch1, receiver); 1980 __ cmpq(ic_reg, rscratch1); 1981 __ jcc(Assembler::equal, hit); 1982 1983 __ jump(RuntimeAddress(SharedRuntime::get_ic_miss_stub())); 1984 1985 // Verified entry point must be aligned 1986 __ align(8); 1987 1988 __ bind(hit); 1989 1990 int vep_offset = ((intptr_t)__ pc()) - start; 1991 1992 // The instruction at the verified entry point must be 5 bytes or longer 1993 // because it can be patched on the fly by make_non_entrant. The stack bang 1994 // instruction fits that requirement. 1995 1996 // Generate stack overflow check 1997 1998 if (UseStackBanging) { 1999 __ bang_stack_with_offset(StackShadowPages*os::vm_page_size()); 2000 } else { 2001 // need a 5 byte instruction to allow MT safe patching to non-entrant 2002 __ fat_nop(); 2003 } 2004 2005 // Generate a new frame for the wrapper. 2006 __ enter(); 2007 // -2 because return address is already present and so is saved rbp 2008 __ subptr(rsp, stack_size - 2*wordSize); 2009 2010 // Frame is now completed as far as size and linkage. 2011 int frame_complete = ((intptr_t)__ pc()) - start; 2012 2013 #ifdef ASSERT 2014 { 2015 Label L; 2016 __ mov(rax, rsp); 2017 __ andptr(rax, -16); // must be 16 byte boundary (see amd64 ABI) 2018 __ cmpptr(rax, rsp); 2019 __ jcc(Assembler::equal, L); 2020 __ stop("improperly aligned stack"); 2021 __ bind(L); 2022 } 2023 #endif /* ASSERT */ 2024 2025 2026 // We use r14 as the oop handle for the receiver/klass 2027 // It is callee save so it survives the call to native 2028 2029 const Register oop_handle_reg = r14; 2030 2031 if (is_critical_native) { 2032 check_needs_gc_for_critical_native(masm, stack_slots, total_c_args, total_in_args, 2033 oop_handle_offset, oop_maps, in_regs, in_sig_bt); 2034 } 2035 2036 // 2037 // We immediately shuffle the arguments so that any vm call we have to 2038 // make from here on out (sync slow path, jvmti, etc.) we will have 2039 // captured the oops from our caller and have a valid oopMap for 2040 // them. 2041 2042 // ----------------- 2043 // The Grand Shuffle 2044 2045 // The Java calling convention is either equal (linux) or denser (win64) than the 2046 // c calling convention. However the because of the jni_env argument the c calling 2047 // convention always has at least one more (and two for static) arguments than Java. 2048 // Therefore if we move the args from java -> c backwards then we will never have 2049 // a register->register conflict and we don't have to build a dependency graph 2050 // and figure out how to break any cycles. 2051 // 2052 2053 // Record esp-based slot for receiver on stack for non-static methods 2054 int receiver_offset = -1; 2055 2056 // This is a trick. We double the stack slots so we can claim 2057 // the oops in the caller's frame. Since we are sure to have 2058 // more args than the caller doubling is enough to make 2059 // sure we can capture all the incoming oop args from the 2060 // caller. 2061 // 2062 OopMap* map = new OopMap(stack_slots * 2, 0 /* arg_slots*/); 2063 2064 // Mark location of rbp (someday) 2065 // map->set_callee_saved(VMRegImpl::stack2reg( stack_slots - 2), stack_slots * 2, 0, vmreg(rbp)); 2066 2067 // Use eax, ebx as temporaries during any memory-memory moves we have to do 2068 // All inbound args are referenced based on rbp and all outbound args via rsp. 2069 2070 2071 #ifdef ASSERT 2072 bool reg_destroyed[RegisterImpl::number_of_registers]; 2073 bool freg_destroyed[XMMRegisterImpl::number_of_registers]; 2074 for ( int r = 0 ; r < RegisterImpl::number_of_registers ; r++ ) { 2075 reg_destroyed[r] = false; 2076 } 2077 for ( int f = 0 ; f < XMMRegisterImpl::number_of_registers ; f++ ) { 2078 freg_destroyed[f] = false; 2079 } 2080 2081 #endif /* ASSERT */ 2082 2083 // This may iterate in two different directions depending on the 2084 // kind of native it is. The reason is that for regular JNI natives 2085 // the incoming and outgoing registers are offset upwards and for 2086 // critical natives they are offset down. 2087 GrowableArray<int> arg_order(2 * total_in_args); 2088 VMRegPair tmp_vmreg; 2089 tmp_vmreg.set1(rbx->as_VMReg()); 2090 2091 if (!is_critical_native) { 2092 for (int i = total_in_args - 1, c_arg = total_c_args - 1; i >= 0; i--, c_arg--) { 2093 arg_order.push(i); 2094 arg_order.push(c_arg); 2095 } 2096 } else { 2097 // Compute a valid move order, using tmp_vmreg to break any cycles 2098 ComputeMoveOrder cmo(total_in_args, in_regs, total_c_args, out_regs, in_sig_bt, arg_order, tmp_vmreg); 2099 } 2100 2101 int temploc = -1; 2102 for (int ai = 0; ai < arg_order.length(); ai += 2) { 2103 int i = arg_order.at(ai); 2104 int c_arg = arg_order.at(ai + 1); 2105 __ block_comment(err_msg("move %d -> %d", i, c_arg)); 2106 if (c_arg == -1) { 2107 assert(is_critical_native, "should only be required for critical natives"); 2108 // This arg needs to be moved to a temporary 2109 __ mov(tmp_vmreg.first()->as_Register(), in_regs[i].first()->as_Register()); 2110 in_regs[i] = tmp_vmreg; 2111 temploc = i; 2112 continue; 2113 } else if (i == -1) { 2114 assert(is_critical_native, "should only be required for critical natives"); 2115 // Read from the temporary location 2116 assert(temploc != -1, "must be valid"); 2117 i = temploc; 2118 temploc = -1; 2119 } 2120 #ifdef ASSERT 2121 if (in_regs[i].first()->is_Register()) { 2122 assert(!reg_destroyed[in_regs[i].first()->as_Register()->encoding()], "destroyed reg!"); 2123 } else if (in_regs[i].first()->is_XMMRegister()) { 2124 assert(!freg_destroyed[in_regs[i].first()->as_XMMRegister()->encoding()], "destroyed reg!"); 2125 } 2126 if (out_regs[c_arg].first()->is_Register()) { 2127 reg_destroyed[out_regs[c_arg].first()->as_Register()->encoding()] = true; 2128 } else if (out_regs[c_arg].first()->is_XMMRegister()) { 2129 freg_destroyed[out_regs[c_arg].first()->as_XMMRegister()->encoding()] = true; 2130 } 2131 #endif /* ASSERT */ 2132 switch (in_sig_bt[i]) { 2133 case T_ARRAY: 2134 if (is_critical_native) { 2135 unpack_array_argument(masm, in_regs[i], in_elem_bt[i], out_regs[c_arg + 1], out_regs[c_arg]); 2136 c_arg++; 2137 #ifdef ASSERT 2138 if (out_regs[c_arg].first()->is_Register()) { 2139 reg_destroyed[out_regs[c_arg].first()->as_Register()->encoding()] = true; 2140 } else if (out_regs[c_arg].first()->is_XMMRegister()) { 2141 freg_destroyed[out_regs[c_arg].first()->as_XMMRegister()->encoding()] = true; 2142 } 2143 #endif 2144 break; 2145 } 2146 case T_OBJECT: 2147 assert(!is_critical_native, "no oop arguments"); 2148 object_move(masm, map, oop_handle_offset, stack_slots, in_regs[i], out_regs[c_arg], 2149 ((i == 0) && (!is_static)), 2150 &receiver_offset); 2151 break; 2152 case T_VOID: 2153 break; 2154 2155 case T_FLOAT: 2156 float_move(masm, in_regs[i], out_regs[c_arg]); 2157 break; 2158 2159 case T_DOUBLE: 2160 assert( i + 1 < total_in_args && 2161 in_sig_bt[i + 1] == T_VOID && 2162 out_sig_bt[c_arg+1] == T_VOID, "bad arg list"); 2163 double_move(masm, in_regs[i], out_regs[c_arg]); 2164 break; 2165 2166 case T_LONG : 2167 long_move(masm, in_regs[i], out_regs[c_arg]); 2168 break; 2169 2170 case T_ADDRESS: assert(false, "found T_ADDRESS in java args"); 2171 2172 default: 2173 move32_64(masm, in_regs[i], out_regs[c_arg]); 2174 } 2175 } 2176 2177 int c_arg; 2178 2179 // Pre-load a static method's oop into r14. Used both by locking code and 2180 // the normal JNI call code. 2181 if (!is_critical_native) { 2182 // point c_arg at the first arg that is already loaded in case we 2183 // need to spill before we call out 2184 c_arg = total_c_args - total_in_args; 2185 2186 if (method->is_static()) { 2187 2188 // load oop into a register 2189 __ movoop(oop_handle_reg, JNIHandles::make_local(method->method_holder()->java_mirror())); 2190 2191 // Now handlize the static class mirror it's known not-null. 2192 __ movptr(Address(rsp, klass_offset), oop_handle_reg); 2193 map->set_oop(VMRegImpl::stack2reg(klass_slot_offset)); 2194 2195 // Now get the handle 2196 __ lea(oop_handle_reg, Address(rsp, klass_offset)); 2197 // store the klass handle as second argument 2198 __ movptr(c_rarg1, oop_handle_reg); 2199 // and protect the arg if we must spill 2200 c_arg--; 2201 } 2202 } else { 2203 // For JNI critical methods we need to save all registers in save_args. 2204 c_arg = 0; 2205 } 2206 2207 // Change state to native (we save the return address in the thread, since it might not 2208 // be pushed on the stack when we do a a stack traversal). It is enough that the pc() 2209 // points into the right code segment. It does not have to be the correct return pc. 2210 // We use the same pc/oopMap repeatedly when we call out 2211 2212 intptr_t the_pc = (intptr_t) __ pc(); 2213 oop_maps->add_gc_map(the_pc - start, map); 2214 2215 __ set_last_Java_frame(rsp, noreg, (address)the_pc); 2216 2217 2218 // We have all of the arguments setup at this point. We must not touch any register 2219 // argument registers at this point (what if we save/restore them there are no oop? 2220 2221 { 2222 SkipIfEqual skip(masm, &DTraceMethodProbes, false); 2223 // protect the args we've loaded 2224 save_args(masm, total_c_args, c_arg, out_regs); 2225 __ mov_metadata(c_rarg1, method()); 2226 __ call_VM_leaf( 2227 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_entry), 2228 r15_thread, c_rarg1); 2229 restore_args(masm, total_c_args, c_arg, out_regs); 2230 } 2231 2232 // RedefineClasses() tracing support for obsolete method entry 2233 if (RC_TRACE_IN_RANGE(0x00001000, 0x00002000)) { 2234 // protect the args we've loaded 2235 save_args(masm, total_c_args, c_arg, out_regs); 2236 __ mov_metadata(c_rarg1, method()); 2237 __ call_VM_leaf( 2238 CAST_FROM_FN_PTR(address, SharedRuntime::rc_trace_method_entry), 2239 r15_thread, c_rarg1); 2240 restore_args(masm, total_c_args, c_arg, out_regs); 2241 } 2242 2243 // Lock a synchronized method 2244 2245 // Register definitions used by locking and unlocking 2246 2247 const Register swap_reg = rax; // Must use rax for cmpxchg instruction 2248 const Register obj_reg = rbx; // Will contain the oop 2249 const Register lock_reg = r13; // Address of compiler lock object (BasicLock) 2250 const Register old_hdr = r13; // value of old header at unlock time 2251 2252 Label slow_path_lock; 2253 Label lock_done; 2254 2255 if (method->is_synchronized()) { 2256 assert(!is_critical_native, "unhandled"); 2257 2258 2259 const int mark_word_offset = BasicLock::displaced_header_offset_in_bytes(); 2260 2261 // Get the handle (the 2nd argument) 2262 __ mov(oop_handle_reg, c_rarg1); 2263 2264 // Get address of the box 2265 2266 __ lea(lock_reg, Address(rsp, lock_slot_offset * VMRegImpl::stack_slot_size)); 2267 2268 // Load the oop from the handle 2269 __ movptr(obj_reg, Address(oop_handle_reg, 0)); 2270 2271 if (UseBiasedLocking) { 2272 __ biased_locking_enter(lock_reg, obj_reg, swap_reg, rscratch1, false, lock_done, &slow_path_lock); 2273 } 2274 2275 // Load immediate 1 into swap_reg %rax 2276 __ movl(swap_reg, 1); 2277 2278 // Load (object->mark() | 1) into swap_reg %rax 2279 __ orptr(swap_reg, Address(obj_reg, 0)); 2280 2281 // Save (object->mark() | 1) into BasicLock's displaced header 2282 __ movptr(Address(lock_reg, mark_word_offset), swap_reg); 2283 2284 if (os::is_MP()) { 2285 __ lock(); 2286 } 2287 2288 // src -> dest iff dest == rax else rax <- dest 2289 __ cmpxchgptr(lock_reg, Address(obj_reg, 0)); 2290 __ jcc(Assembler::equal, lock_done); 2291 2292 // Hmm should this move to the slow path code area??? 2293 2294 // Test if the oopMark is an obvious stack pointer, i.e., 2295 // 1) (mark & 3) == 0, and 2296 // 2) rsp <= mark < mark + os::pagesize() 2297 // These 3 tests can be done by evaluating the following 2298 // expression: ((mark - rsp) & (3 - os::vm_page_size())), 2299 // assuming both stack pointer and pagesize have their 2300 // least significant 2 bits clear. 2301 // NOTE: the oopMark is in swap_reg %rax as the result of cmpxchg 2302 2303 __ subptr(swap_reg, rsp); 2304 __ andptr(swap_reg, 3 - os::vm_page_size()); 2305 2306 // Save the test result, for recursive case, the result is zero 2307 __ movptr(Address(lock_reg, mark_word_offset), swap_reg); 2308 __ jcc(Assembler::notEqual, slow_path_lock); 2309 2310 // Slow path will re-enter here 2311 2312 __ bind(lock_done); 2313 } 2314 2315 2316 // Finally just about ready to make the JNI call 2317 2318 2319 // get JNIEnv* which is first argument to native 2320 if (!is_critical_native) { 2321 __ lea(c_rarg0, Address(r15_thread, in_bytes(JavaThread::jni_environment_offset()))); 2322 } 2323 2324 // Now set thread in native 2325 __ movl(Address(r15_thread, JavaThread::thread_state_offset()), _thread_in_native); 2326 2327 __ call(RuntimeAddress(native_func)); 2328 2329 // Verify or restore cpu control state after JNI call 2330 __ restore_cpu_control_state_after_jni(); 2331 2332 // Unpack native results. 2333 switch (ret_type) { 2334 case T_BOOLEAN: __ c2bool(rax); break; 2335 case T_CHAR : __ movzwl(rax, rax); break; 2336 case T_BYTE : __ sign_extend_byte (rax); break; 2337 case T_SHORT : __ sign_extend_short(rax); break; 2338 case T_INT : /* nothing to do */ break; 2339 case T_DOUBLE : 2340 case T_FLOAT : 2341 // Result is in xmm0 we'll save as needed 2342 break; 2343 case T_ARRAY: // Really a handle 2344 case T_OBJECT: // Really a handle 2345 break; // can't de-handlize until after safepoint check 2346 case T_VOID: break; 2347 case T_LONG: break; 2348 default : ShouldNotReachHere(); 2349 } 2350 2351 // Switch thread to "native transition" state before reading the synchronization state. 2352 // This additional state is necessary because reading and testing the synchronization 2353 // state is not atomic w.r.t. GC, as this scenario demonstrates: 2354 // Java thread A, in _thread_in_native state, loads _not_synchronized and is preempted. 2355 // VM thread changes sync state to synchronizing and suspends threads for GC. 2356 // Thread A is resumed to finish this native method, but doesn't block here since it 2357 // didn't see any synchronization is progress, and escapes. 2358 __ movl(Address(r15_thread, JavaThread::thread_state_offset()), _thread_in_native_trans); 2359 2360 if(os::is_MP()) { 2361 if (UseMembar) { 2362 // Force this write out before the read below 2363 __ membar(Assembler::Membar_mask_bits( 2364 Assembler::LoadLoad | Assembler::LoadStore | 2365 Assembler::StoreLoad | Assembler::StoreStore)); 2366 } else { 2367 // Write serialization page so VM thread can do a pseudo remote membar. 2368 // We use the current thread pointer to calculate a thread specific 2369 // offset to write to within the page. This minimizes bus traffic 2370 // due to cache line collision. 2371 __ serialize_memory(r15_thread, rcx); 2372 } 2373 } 2374 2375 Label after_transition; 2376 2377 // check for safepoint operation in progress and/or pending suspend requests 2378 { 2379 Label Continue; 2380 2381 __ cmp32(ExternalAddress((address)SafepointSynchronize::address_of_state()), 2382 SafepointSynchronize::_not_synchronized); 2383 2384 Label L; 2385 __ jcc(Assembler::notEqual, L); 2386 __ cmpl(Address(r15_thread, JavaThread::suspend_flags_offset()), 0); 2387 __ jcc(Assembler::equal, Continue); 2388 __ bind(L); 2389 2390 // Don't use call_VM as it will see a possible pending exception and forward it 2391 // and never return here preventing us from clearing _last_native_pc down below. 2392 // Also can't use call_VM_leaf either as it will check to see if rsi & rdi are 2393 // preserved and correspond to the bcp/locals pointers. So we do a runtime call 2394 // by hand. 2395 // 2396 save_native_result(masm, ret_type, stack_slots); 2397 __ mov(c_rarg0, r15_thread); 2398 __ mov(r12, rsp); // remember sp 2399 __ subptr(rsp, frame::arg_reg_save_area_bytes); // windows 2400 __ andptr(rsp, -16); // align stack as required by ABI 2401 if (!is_critical_native) { 2402 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, JavaThread::check_special_condition_for_native_trans))); 2403 } else { 2404 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, JavaThread::check_special_condition_for_native_trans_and_transition))); 2405 } 2406 __ mov(rsp, r12); // restore sp 2407 __ reinit_heapbase(); 2408 // Restore any method result value 2409 restore_native_result(masm, ret_type, stack_slots); 2410 2411 if (is_critical_native) { 2412 // The call above performed the transition to thread_in_Java so 2413 // skip the transition logic below. 2414 __ jmpb(after_transition); 2415 } 2416 2417 __ bind(Continue); 2418 } 2419 2420 // change thread state 2421 __ movl(Address(r15_thread, JavaThread::thread_state_offset()), _thread_in_Java); 2422 __ bind(after_transition); 2423 2424 Label reguard; 2425 Label reguard_done; 2426 __ cmpl(Address(r15_thread, JavaThread::stack_guard_state_offset()), JavaThread::stack_guard_yellow_disabled); 2427 __ jcc(Assembler::equal, reguard); 2428 __ bind(reguard_done); 2429 2430 // native result if any is live 2431 2432 // Unlock 2433 Label unlock_done; 2434 Label slow_path_unlock; 2435 if (method->is_synchronized()) { 2436 2437 // Get locked oop from the handle we passed to jni 2438 __ movptr(obj_reg, Address(oop_handle_reg, 0)); 2439 2440 Label done; 2441 2442 if (UseBiasedLocking) { 2443 __ biased_locking_exit(obj_reg, old_hdr, done); 2444 } 2445 2446 // Simple recursive lock? 2447 2448 __ cmpptr(Address(rsp, lock_slot_offset * VMRegImpl::stack_slot_size), (int32_t)NULL_WORD); 2449 __ jcc(Assembler::equal, done); 2450 2451 // Must save rax if if it is live now because cmpxchg must use it 2452 if (ret_type != T_FLOAT && ret_type != T_DOUBLE && ret_type != T_VOID) { 2453 save_native_result(masm, ret_type, stack_slots); 2454 } 2455 2456 2457 // get address of the stack lock 2458 __ lea(rax, Address(rsp, lock_slot_offset * VMRegImpl::stack_slot_size)); 2459 // get old displaced header 2460 __ movptr(old_hdr, Address(rax, 0)); 2461 2462 // Atomic swap old header if oop still contains the stack lock 2463 if (os::is_MP()) { 2464 __ lock(); 2465 } 2466 __ cmpxchgptr(old_hdr, Address(obj_reg, 0)); 2467 __ jcc(Assembler::notEqual, slow_path_unlock); 2468 2469 // slow path re-enters here 2470 __ bind(unlock_done); 2471 if (ret_type != T_FLOAT && ret_type != T_DOUBLE && ret_type != T_VOID) { 2472 restore_native_result(masm, ret_type, stack_slots); 2473 } 2474 2475 __ bind(done); 2476 2477 } 2478 { 2479 SkipIfEqual skip(masm, &DTraceMethodProbes, false); 2480 save_native_result(masm, ret_type, stack_slots); 2481 __ mov_metadata(c_rarg1, method()); 2482 __ call_VM_leaf( 2483 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_method_exit), 2484 r15_thread, c_rarg1); 2485 restore_native_result(masm, ret_type, stack_slots); 2486 } 2487 2488 __ reset_last_Java_frame(false, true); 2489 2490 // Unpack oop result 2491 if (ret_type == T_OBJECT || ret_type == T_ARRAY) { 2492 Label L; 2493 __ testptr(rax, rax); 2494 __ jcc(Assembler::zero, L); 2495 __ movptr(rax, Address(rax, 0)); 2496 __ bind(L); 2497 __ verify_oop(rax); 2498 } 2499 2500 if (!is_critical_native) { 2501 // reset handle block 2502 __ movptr(rcx, Address(r15_thread, JavaThread::active_handles_offset())); 2503 __ movptr(Address(rcx, JNIHandleBlock::top_offset_in_bytes()), (int32_t)NULL_WORD); 2504 } 2505 2506 // pop our frame 2507 2508 __ leave(); 2509 2510 if (!is_critical_native) { 2511 // Any exception pending? 2512 __ cmpptr(Address(r15_thread, in_bytes(Thread::pending_exception_offset())), (int32_t)NULL_WORD); 2513 __ jcc(Assembler::notEqual, exception_pending); 2514 } 2515 2516 // Return 2517 2518 __ ret(0); 2519 2520 // Unexpected paths are out of line and go here 2521 2522 if (!is_critical_native) { 2523 // forward the exception 2524 __ bind(exception_pending); 2525 2526 // and forward the exception 2527 __ jump(RuntimeAddress(StubRoutines::forward_exception_entry())); 2528 } 2529 2530 // Slow path locking & unlocking 2531 if (method->is_synchronized()) { 2532 2533 // BEGIN Slow path lock 2534 __ bind(slow_path_lock); 2535 2536 // has last_Java_frame setup. No exceptions so do vanilla call not call_VM 2537 // args are (oop obj, BasicLock* lock, JavaThread* thread) 2538 2539 // protect the args we've loaded 2540 save_args(masm, total_c_args, c_arg, out_regs); 2541 2542 __ mov(c_rarg0, obj_reg); 2543 __ mov(c_rarg1, lock_reg); 2544 __ mov(c_rarg2, r15_thread); 2545 2546 // Not a leaf but we have last_Java_frame setup as we want 2547 __ call_VM_leaf(CAST_FROM_FN_PTR(address, SharedRuntime::complete_monitor_locking_C), 3); 2548 restore_args(masm, total_c_args, c_arg, out_regs); 2549 2550 #ifdef ASSERT 2551 { Label L; 2552 __ cmpptr(Address(r15_thread, in_bytes(Thread::pending_exception_offset())), (int32_t)NULL_WORD); 2553 __ jcc(Assembler::equal, L); 2554 __ stop("no pending exception allowed on exit from monitorenter"); 2555 __ bind(L); 2556 } 2557 #endif 2558 __ jmp(lock_done); 2559 2560 // END Slow path lock 2561 2562 // BEGIN Slow path unlock 2563 __ bind(slow_path_unlock); 2564 2565 // If we haven't already saved the native result we must save it now as xmm registers 2566 // are still exposed. 2567 2568 if (ret_type == T_FLOAT || ret_type == T_DOUBLE ) { 2569 save_native_result(masm, ret_type, stack_slots); 2570 } 2571 2572 __ lea(c_rarg1, Address(rsp, lock_slot_offset * VMRegImpl::stack_slot_size)); 2573 2574 __ mov(c_rarg0, obj_reg); 2575 __ mov(r12, rsp); // remember sp 2576 __ subptr(rsp, frame::arg_reg_save_area_bytes); // windows 2577 __ andptr(rsp, -16); // align stack as required by ABI 2578 2579 // Save pending exception around call to VM (which contains an EXCEPTION_MARK) 2580 // NOTE that obj_reg == rbx currently 2581 __ movptr(rbx, Address(r15_thread, in_bytes(Thread::pending_exception_offset()))); 2582 __ movptr(Address(r15_thread, in_bytes(Thread::pending_exception_offset())), (int32_t)NULL_WORD); 2583 2584 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, SharedRuntime::complete_monitor_unlocking_C))); 2585 __ mov(rsp, r12); // restore sp 2586 __ reinit_heapbase(); 2587 #ifdef ASSERT 2588 { 2589 Label L; 2590 __ cmpptr(Address(r15_thread, in_bytes(Thread::pending_exception_offset())), (int)NULL_WORD); 2591 __ jcc(Assembler::equal, L); 2592 __ stop("no pending exception allowed on exit complete_monitor_unlocking_C"); 2593 __ bind(L); 2594 } 2595 #endif /* ASSERT */ 2596 2597 __ movptr(Address(r15_thread, in_bytes(Thread::pending_exception_offset())), rbx); 2598 2599 if (ret_type == T_FLOAT || ret_type == T_DOUBLE ) { 2600 restore_native_result(masm, ret_type, stack_slots); 2601 } 2602 __ jmp(unlock_done); 2603 2604 // END Slow path unlock 2605 2606 } // synchronized 2607 2608 // SLOW PATH Reguard the stack if needed 2609 2610 __ bind(reguard); 2611 save_native_result(masm, ret_type, stack_slots); 2612 __ mov(r12, rsp); // remember sp 2613 __ subptr(rsp, frame::arg_reg_save_area_bytes); // windows 2614 __ andptr(rsp, -16); // align stack as required by ABI 2615 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, SharedRuntime::reguard_yellow_pages))); 2616 __ mov(rsp, r12); // restore sp 2617 __ reinit_heapbase(); 2618 restore_native_result(masm, ret_type, stack_slots); 2619 // and continue 2620 __ jmp(reguard_done); 2621 2622 2623 2624 __ flush(); 2625 2626 nmethod *nm = nmethod::new_native_nmethod(method, 2627 compile_id, 2628 masm->code(), 2629 vep_offset, 2630 frame_complete, 2631 stack_slots / VMRegImpl::slots_per_word, 2632 (is_static ? in_ByteSize(klass_offset) : in_ByteSize(receiver_offset)), 2633 in_ByteSize(lock_slot_offset*VMRegImpl::stack_slot_size), 2634 oop_maps); 2635 2636 if (is_critical_native) { 2637 nm->set_lazy_critical_native(true); 2638 } 2639 2640 return nm; 2641 2642 } 2643 2644 #ifdef HAVE_DTRACE_H 2645 // --------------------------------------------------------------------------- 2646 // Generate a dtrace nmethod for a given signature. The method takes arguments 2647 // in the Java compiled code convention, marshals them to the native 2648 // abi and then leaves nops at the position you would expect to call a native 2649 // function. When the probe is enabled the nops are replaced with a trap 2650 // instruction that dtrace inserts and the trace will cause a notification 2651 // to dtrace. 2652 // 2653 // The probes are only able to take primitive types and java/lang/String as 2654 // arguments. No other java types are allowed. Strings are converted to utf8 2655 // strings so that from dtrace point of view java strings are converted to C 2656 // strings. There is an arbitrary fixed limit on the total space that a method 2657 // can use for converting the strings. (256 chars per string in the signature). 2658 // So any java string larger then this is truncated. 2659 2660 static int fp_offset[ConcreteRegisterImpl::number_of_registers] = { 0 }; 2661 static bool offsets_initialized = false; 2662 2663 2664 nmethod *SharedRuntime::generate_dtrace_nmethod(MacroAssembler *masm, 2665 methodHandle method) { 2666 2667 2668 // generate_dtrace_nmethod is guarded by a mutex so we are sure to 2669 // be single threaded in this method. 2670 assert(AdapterHandlerLibrary_lock->owned_by_self(), "must be"); 2671 2672 if (!offsets_initialized) { 2673 fp_offset[c_rarg0->as_VMReg()->value()] = -1 * wordSize; 2674 fp_offset[c_rarg1->as_VMReg()->value()] = -2 * wordSize; 2675 fp_offset[c_rarg2->as_VMReg()->value()] = -3 * wordSize; 2676 fp_offset[c_rarg3->as_VMReg()->value()] = -4 * wordSize; 2677 fp_offset[c_rarg4->as_VMReg()->value()] = -5 * wordSize; 2678 fp_offset[c_rarg5->as_VMReg()->value()] = -6 * wordSize; 2679 2680 fp_offset[c_farg0->as_VMReg()->value()] = -7 * wordSize; 2681 fp_offset[c_farg1->as_VMReg()->value()] = -8 * wordSize; 2682 fp_offset[c_farg2->as_VMReg()->value()] = -9 * wordSize; 2683 fp_offset[c_farg3->as_VMReg()->value()] = -10 * wordSize; 2684 fp_offset[c_farg4->as_VMReg()->value()] = -11 * wordSize; 2685 fp_offset[c_farg5->as_VMReg()->value()] = -12 * wordSize; 2686 fp_offset[c_farg6->as_VMReg()->value()] = -13 * wordSize; 2687 fp_offset[c_farg7->as_VMReg()->value()] = -14 * wordSize; 2688 2689 offsets_initialized = true; 2690 } 2691 // Fill in the signature array, for the calling-convention call. 2692 int total_args_passed = method->size_of_parameters(); 2693 2694 BasicType* in_sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed); 2695 VMRegPair *in_regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed); 2696 2697 // The signature we are going to use for the trap that dtrace will see 2698 // java/lang/String is converted. We drop "this" and any other object 2699 // is converted to NULL. (A one-slot java/lang/Long object reference 2700 // is converted to a two-slot long, which is why we double the allocation). 2701 BasicType* out_sig_bt = NEW_RESOURCE_ARRAY(BasicType, total_args_passed * 2); 2702 VMRegPair* out_regs = NEW_RESOURCE_ARRAY(VMRegPair, total_args_passed * 2); 2703 2704 int i=0; 2705 int total_strings = 0; 2706 int first_arg_to_pass = 0; 2707 int total_c_args = 0; 2708 2709 // Skip the receiver as dtrace doesn't want to see it 2710 if( !method->is_static() ) { 2711 in_sig_bt[i++] = T_OBJECT; 2712 first_arg_to_pass = 1; 2713 } 2714 2715 // We need to convert the java args to where a native (non-jni) function 2716 // would expect them. To figure out where they go we convert the java 2717 // signature to a C signature. 2718 2719 SignatureStream ss(method->signature()); 2720 for ( ; !ss.at_return_type(); ss.next()) { 2721 BasicType bt = ss.type(); 2722 in_sig_bt[i++] = bt; // Collect remaining bits of signature 2723 out_sig_bt[total_c_args++] = bt; 2724 if( bt == T_OBJECT) { 2725 Symbol* s = ss.as_symbol_or_null(); // symbol is created 2726 if (s == vmSymbols::java_lang_String()) { 2727 total_strings++; 2728 out_sig_bt[total_c_args-1] = T_ADDRESS; 2729 } else if (s == vmSymbols::java_lang_Boolean() || 2730 s == vmSymbols::java_lang_Character() || 2731 s == vmSymbols::java_lang_Byte() || 2732 s == vmSymbols::java_lang_Short() || 2733 s == vmSymbols::java_lang_Integer() || 2734 s == vmSymbols::java_lang_Float()) { 2735 out_sig_bt[total_c_args-1] = T_INT; 2736 } else if (s == vmSymbols::java_lang_Long() || 2737 s == vmSymbols::java_lang_Double()) { 2738 out_sig_bt[total_c_args-1] = T_LONG; 2739 out_sig_bt[total_c_args++] = T_VOID; 2740 } 2741 } else if ( bt == T_LONG || bt == T_DOUBLE ) { 2742 in_sig_bt[i++] = T_VOID; // Longs & doubles take 2 Java slots 2743 // We convert double to long 2744 out_sig_bt[total_c_args-1] = T_LONG; 2745 out_sig_bt[total_c_args++] = T_VOID; 2746 } else if ( bt == T_FLOAT) { 2747 // We convert float to int 2748 out_sig_bt[total_c_args-1] = T_INT; 2749 } 2750 } 2751 2752 assert(i==total_args_passed, "validly parsed signature"); 2753 2754 // Now get the compiled-Java layout as input arguments 2755 int comp_args_on_stack; 2756 comp_args_on_stack = SharedRuntime::java_calling_convention( 2757 in_sig_bt, in_regs, total_args_passed, false); 2758 2759 // Now figure out where the args must be stored and how much stack space 2760 // they require (neglecting out_preserve_stack_slots but space for storing 2761 // the 1st six register arguments). It's weird see int_stk_helper. 2762 2763 int out_arg_slots; 2764 out_arg_slots = c_calling_convention(out_sig_bt, out_regs, total_c_args); 2765 2766 // Calculate the total number of stack slots we will need. 2767 2768 // First count the abi requirement plus all of the outgoing args 2769 int stack_slots = SharedRuntime::out_preserve_stack_slots() + out_arg_slots; 2770 2771 // Now space for the string(s) we must convert 2772 int* string_locs = NEW_RESOURCE_ARRAY(int, total_strings + 1); 2773 for (i = 0; i < total_strings ; i++) { 2774 string_locs[i] = stack_slots; 2775 stack_slots += max_dtrace_string_size / VMRegImpl::stack_slot_size; 2776 } 2777 2778 // Plus the temps we might need to juggle register args 2779 // regs take two slots each 2780 stack_slots += (Argument::n_int_register_parameters_c + 2781 Argument::n_float_register_parameters_c) * 2; 2782 2783 2784 // + 4 for return address (which we own) and saved rbp, 2785 2786 stack_slots += 4; 2787 2788 // Ok The space we have allocated will look like: 2789 // 2790 // 2791 // FP-> | | 2792 // |---------------------| 2793 // | string[n] | 2794 // |---------------------| <- string_locs[n] 2795 // | string[n-1] | 2796 // |---------------------| <- string_locs[n-1] 2797 // | ... | 2798 // | ... | 2799 // |---------------------| <- string_locs[1] 2800 // | string[0] | 2801 // |---------------------| <- string_locs[0] 2802 // | outbound memory | 2803 // | based arguments | 2804 // | | 2805 // |---------------------| 2806 // | | 2807 // SP-> | out_preserved_slots | 2808 // 2809 // 2810 2811 // Now compute actual number of stack words we need rounding to make 2812 // stack properly aligned. 2813 stack_slots = round_to(stack_slots, 4 * VMRegImpl::slots_per_word); 2814 2815 int stack_size = stack_slots * VMRegImpl::stack_slot_size; 2816 2817 intptr_t start = (intptr_t)__ pc(); 2818 2819 // First thing make an ic check to see if we should even be here 2820 2821 // We are free to use all registers as temps without saving them and 2822 // restoring them except rbp. rbp, is the only callee save register 2823 // as far as the interpreter and the compiler(s) are concerned. 2824 2825 const Register ic_reg = rax; 2826 const Register receiver = rcx; 2827 Label hit; 2828 Label exception_pending; 2829 2830 2831 __ verify_oop(receiver); 2832 __ cmpl(ic_reg, Address(receiver, oopDesc::klass_offset_in_bytes())); 2833 __ jcc(Assembler::equal, hit); 2834 2835 __ jump(RuntimeAddress(SharedRuntime::get_ic_miss_stub())); 2836 2837 // verified entry must be aligned for code patching. 2838 // and the first 5 bytes must be in the same cache line 2839 // if we align at 8 then we will be sure 5 bytes are in the same line 2840 __ align(8); 2841 2842 __ bind(hit); 2843 2844 int vep_offset = ((intptr_t)__ pc()) - start; 2845 2846 2847 // The instruction at the verified entry point must be 5 bytes or longer 2848 // because it can be patched on the fly by make_non_entrant. The stack bang 2849 // instruction fits that requirement. 2850 2851 // Generate stack overflow check 2852 2853 if (UseStackBanging) { 2854 if (stack_size <= StackShadowPages*os::vm_page_size()) { 2855 __ bang_stack_with_offset(StackShadowPages*os::vm_page_size()); 2856 } else { 2857 __ movl(rax, stack_size); 2858 __ bang_stack_size(rax, rbx); 2859 } 2860 } else { 2861 // need a 5 byte instruction to allow MT safe patching to non-entrant 2862 __ fat_nop(); 2863 } 2864 2865 assert(((uintptr_t)__ pc() - start - vep_offset) >= 5, 2866 "valid size for make_non_entrant"); 2867 2868 // Generate a new frame for the wrapper. 2869 __ enter(); 2870 2871 // -4 because return address is already present and so is saved rbp, 2872 if (stack_size - 2*wordSize != 0) { 2873 __ subq(rsp, stack_size - 2*wordSize); 2874 } 2875 2876 // Frame is now completed as far a size and linkage. 2877 2878 int frame_complete = ((intptr_t)__ pc()) - start; 2879 2880 int c_arg, j_arg; 2881 2882 // State of input register args 2883 2884 bool live[ConcreteRegisterImpl::number_of_registers]; 2885 2886 live[j_rarg0->as_VMReg()->value()] = false; 2887 live[j_rarg1->as_VMReg()->value()] = false; 2888 live[j_rarg2->as_VMReg()->value()] = false; 2889 live[j_rarg3->as_VMReg()->value()] = false; 2890 live[j_rarg4->as_VMReg()->value()] = false; 2891 live[j_rarg5->as_VMReg()->value()] = false; 2892 2893 live[j_farg0->as_VMReg()->value()] = false; 2894 live[j_farg1->as_VMReg()->value()] = false; 2895 live[j_farg2->as_VMReg()->value()] = false; 2896 live[j_farg3->as_VMReg()->value()] = false; 2897 live[j_farg4->as_VMReg()->value()] = false; 2898 live[j_farg5->as_VMReg()->value()] = false; 2899 live[j_farg6->as_VMReg()->value()] = false; 2900 live[j_farg7->as_VMReg()->value()] = false; 2901 2902 2903 bool rax_is_zero = false; 2904 2905 // All args (except strings) destined for the stack are moved first 2906 for (j_arg = first_arg_to_pass, c_arg = 0 ; 2907 j_arg < total_args_passed ; j_arg++, c_arg++ ) { 2908 VMRegPair src = in_regs[j_arg]; 2909 VMRegPair dst = out_regs[c_arg]; 2910 2911 // Get the real reg value or a dummy (rsp) 2912 2913 int src_reg = src.first()->is_reg() ? 2914 src.first()->value() : 2915 rsp->as_VMReg()->value(); 2916 2917 bool useless = in_sig_bt[j_arg] == T_ARRAY || 2918 (in_sig_bt[j_arg] == T_OBJECT && 2919 out_sig_bt[c_arg] != T_INT && 2920 out_sig_bt[c_arg] != T_ADDRESS && 2921 out_sig_bt[c_arg] != T_LONG); 2922 2923 live[src_reg] = !useless; 2924 2925 if (dst.first()->is_stack()) { 2926 2927 // Even though a string arg in a register is still live after this loop 2928 // after the string conversion loop (next) it will be dead so we take 2929 // advantage of that now for simpler code to manage live. 2930 2931 live[src_reg] = false; 2932 switch (in_sig_bt[j_arg]) { 2933 2934 case T_ARRAY: 2935 case T_OBJECT: 2936 { 2937 Address stack_dst(rsp, reg2offset_out(dst.first())); 2938 2939 if (out_sig_bt[c_arg] == T_INT || out_sig_bt[c_arg] == T_LONG) { 2940 // need to unbox a one-word value 2941 Register in_reg = rax; 2942 if ( src.first()->is_reg() ) { 2943 in_reg = src.first()->as_Register(); 2944 } else { 2945 __ movq(rax, Address(rbp, reg2offset_in(src.first()))); 2946 rax_is_zero = false; 2947 } 2948 Label skipUnbox; 2949 __ movptr(Address(rsp, reg2offset_out(dst.first())), 2950 (int32_t)NULL_WORD); 2951 __ testq(in_reg, in_reg); 2952 __ jcc(Assembler::zero, skipUnbox); 2953 2954 BasicType bt = out_sig_bt[c_arg]; 2955 int box_offset = java_lang_boxing_object::value_offset_in_bytes(bt); 2956 Address src1(in_reg, box_offset); 2957 if ( bt == T_LONG ) { 2958 __ movq(in_reg, src1); 2959 __ movq(stack_dst, in_reg); 2960 assert(out_sig_bt[c_arg+1] == T_VOID, "must be"); 2961 ++c_arg; // skip over T_VOID to keep the loop indices in sync 2962 } else { 2963 __ movl(in_reg, src1); 2964 __ movl(stack_dst, in_reg); 2965 } 2966 2967 __ bind(skipUnbox); 2968 } else if (out_sig_bt[c_arg] != T_ADDRESS) { 2969 // Convert the arg to NULL 2970 if (!rax_is_zero) { 2971 __ xorq(rax, rax); 2972 rax_is_zero = true; 2973 } 2974 __ movq(stack_dst, rax); 2975 } 2976 } 2977 break; 2978 2979 case T_VOID: 2980 break; 2981 2982 case T_FLOAT: 2983 // This does the right thing since we know it is destined for the 2984 // stack 2985 float_move(masm, src, dst); 2986 break; 2987 2988 case T_DOUBLE: 2989 // This does the right thing since we know it is destined for the 2990 // stack 2991 double_move(masm, src, dst); 2992 break; 2993 2994 case T_LONG : 2995 long_move(masm, src, dst); 2996 break; 2997 2998 case T_ADDRESS: assert(false, "found T_ADDRESS in java args"); 2999 3000 default: 3001 move32_64(masm, src, dst); 3002 } 3003 } 3004 3005 } 3006 3007 // If we have any strings we must store any register based arg to the stack 3008 // This includes any still live xmm registers too. 3009 3010 int sid = 0; 3011 3012 if (total_strings > 0 ) { 3013 for (j_arg = first_arg_to_pass, c_arg = 0 ; 3014 j_arg < total_args_passed ; j_arg++, c_arg++ ) { 3015 VMRegPair src = in_regs[j_arg]; 3016 VMRegPair dst = out_regs[c_arg]; 3017 3018 if (src.first()->is_reg()) { 3019 Address src_tmp(rbp, fp_offset[src.first()->value()]); 3020 3021 // string oops were left untouched by the previous loop even if the 3022 // eventual (converted) arg is destined for the stack so park them 3023 // away now (except for first) 3024 3025 if (out_sig_bt[c_arg] == T_ADDRESS) { 3026 Address utf8_addr = Address( 3027 rsp, string_locs[sid++] * VMRegImpl::stack_slot_size); 3028 if (sid != 1) { 3029 // The first string arg won't be killed until after the utf8 3030 // conversion 3031 __ movq(utf8_addr, src.first()->as_Register()); 3032 } 3033 } else if (dst.first()->is_reg()) { 3034 if (in_sig_bt[j_arg] == T_FLOAT || in_sig_bt[j_arg] == T_DOUBLE) { 3035 3036 // Convert the xmm register to an int and store it in the reserved 3037 // location for the eventual c register arg 3038 XMMRegister f = src.first()->as_XMMRegister(); 3039 if (in_sig_bt[j_arg] == T_FLOAT) { 3040 __ movflt(src_tmp, f); 3041 } else { 3042 __ movdbl(src_tmp, f); 3043 } 3044 } else { 3045 // If the arg is an oop type we don't support don't bother to store 3046 // it remember string was handled above. 3047 bool useless = in_sig_bt[j_arg] == T_ARRAY || 3048 (in_sig_bt[j_arg] == T_OBJECT && 3049 out_sig_bt[c_arg] != T_INT && 3050 out_sig_bt[c_arg] != T_LONG); 3051 3052 if (!useless) { 3053 __ movq(src_tmp, src.first()->as_Register()); 3054 } 3055 } 3056 } 3057 } 3058 if (in_sig_bt[j_arg] == T_OBJECT && out_sig_bt[c_arg] == T_LONG) { 3059 assert(out_sig_bt[c_arg+1] == T_VOID, "must be"); 3060 ++c_arg; // skip over T_VOID to keep the loop indices in sync 3061 } 3062 } 3063 3064 // Now that the volatile registers are safe, convert all the strings 3065 sid = 0; 3066 3067 for (j_arg = first_arg_to_pass, c_arg = 0 ; 3068 j_arg < total_args_passed ; j_arg++, c_arg++ ) { 3069 if (out_sig_bt[c_arg] == T_ADDRESS) { 3070 // It's a string 3071 Address utf8_addr = Address( 3072 rsp, string_locs[sid++] * VMRegImpl::stack_slot_size); 3073 // The first string we find might still be in the original java arg 3074 // register 3075 3076 VMReg src = in_regs[j_arg].first(); 3077 3078 // We will need to eventually save the final argument to the trap 3079 // in the von-volatile location dedicated to src. This is the offset 3080 // from fp we will use. 3081 int src_off = src->is_reg() ? 3082 fp_offset[src->value()] : reg2offset_in(src); 3083 3084 // This is where the argument will eventually reside 3085 VMRegPair dst = out_regs[c_arg]; 3086 3087 if (src->is_reg()) { 3088 if (sid == 1) { 3089 __ movq(c_rarg0, src->as_Register()); 3090 } else { 3091 __ movq(c_rarg0, utf8_addr); 3092 } 3093 } else { 3094 // arg is still in the original location 3095 __ movq(c_rarg0, Address(rbp, reg2offset_in(src))); 3096 } 3097 Label done, convert; 3098 3099 // see if the oop is NULL 3100 __ testq(c_rarg0, c_rarg0); 3101 __ jcc(Assembler::notEqual, convert); 3102 3103 if (dst.first()->is_reg()) { 3104 // Save the ptr to utf string in the origina src loc or the tmp 3105 // dedicated to it 3106 __ movq(Address(rbp, src_off), c_rarg0); 3107 } else { 3108 __ movq(Address(rsp, reg2offset_out(dst.first())), c_rarg0); 3109 } 3110 __ jmp(done); 3111 3112 __ bind(convert); 3113 3114 __ lea(c_rarg1, utf8_addr); 3115 if (dst.first()->is_reg()) { 3116 __ movq(Address(rbp, src_off), c_rarg1); 3117 } else { 3118 __ movq(Address(rsp, reg2offset_out(dst.first())), c_rarg1); 3119 } 3120 // And do the conversion 3121 __ call(RuntimeAddress( 3122 CAST_FROM_FN_PTR(address, SharedRuntime::get_utf))); 3123 3124 __ bind(done); 3125 } 3126 if (in_sig_bt[j_arg] == T_OBJECT && out_sig_bt[c_arg] == T_LONG) { 3127 assert(out_sig_bt[c_arg+1] == T_VOID, "must be"); 3128 ++c_arg; // skip over T_VOID to keep the loop indices in sync 3129 } 3130 } 3131 // The get_utf call killed all the c_arg registers 3132 live[c_rarg0->as_VMReg()->value()] = false; 3133 live[c_rarg1->as_VMReg()->value()] = false; 3134 live[c_rarg2->as_VMReg()->value()] = false; 3135 live[c_rarg3->as_VMReg()->value()] = false; 3136 live[c_rarg4->as_VMReg()->value()] = false; 3137 live[c_rarg5->as_VMReg()->value()] = false; 3138 3139 live[c_farg0->as_VMReg()->value()] = false; 3140 live[c_farg1->as_VMReg()->value()] = false; 3141 live[c_farg2->as_VMReg()->value()] = false; 3142 live[c_farg3->as_VMReg()->value()] = false; 3143 live[c_farg4->as_VMReg()->value()] = false; 3144 live[c_farg5->as_VMReg()->value()] = false; 3145 live[c_farg6->as_VMReg()->value()] = false; 3146 live[c_farg7->as_VMReg()->value()] = false; 3147 } 3148 3149 // Now we can finally move the register args to their desired locations 3150 3151 rax_is_zero = false; 3152 3153 for (j_arg = first_arg_to_pass, c_arg = 0 ; 3154 j_arg < total_args_passed ; j_arg++, c_arg++ ) { 3155 3156 VMRegPair src = in_regs[j_arg]; 3157 VMRegPair dst = out_regs[c_arg]; 3158 3159 // Only need to look for args destined for the interger registers (since we 3160 // convert float/double args to look like int/long outbound) 3161 if (dst.first()->is_reg()) { 3162 Register r = dst.first()->as_Register(); 3163 3164 // Check if the java arg is unsupported and thereofre useless 3165 bool useless = in_sig_bt[j_arg] == T_ARRAY || 3166 (in_sig_bt[j_arg] == T_OBJECT && 3167 out_sig_bt[c_arg] != T_INT && 3168 out_sig_bt[c_arg] != T_ADDRESS && 3169 out_sig_bt[c_arg] != T_LONG); 3170 3171 3172 // If we're going to kill an existing arg save it first 3173 if (live[dst.first()->value()]) { 3174 // you can't kill yourself 3175 if (src.first() != dst.first()) { 3176 __ movq(Address(rbp, fp_offset[dst.first()->value()]), r); 3177 } 3178 } 3179 if (src.first()->is_reg()) { 3180 if (live[src.first()->value()] ) { 3181 if (in_sig_bt[j_arg] == T_FLOAT) { 3182 __ movdl(r, src.first()->as_XMMRegister()); 3183 } else if (in_sig_bt[j_arg] == T_DOUBLE) { 3184 __ movdq(r, src.first()->as_XMMRegister()); 3185 } else if (r != src.first()->as_Register()) { 3186 if (!useless) { 3187 __ movq(r, src.first()->as_Register()); 3188 } 3189 } 3190 } else { 3191 // If the arg is an oop type we don't support don't bother to store 3192 // it 3193 if (!useless) { 3194 if (in_sig_bt[j_arg] == T_DOUBLE || 3195 in_sig_bt[j_arg] == T_LONG || 3196 in_sig_bt[j_arg] == T_OBJECT ) { 3197 __ movq(r, Address(rbp, fp_offset[src.first()->value()])); 3198 } else { 3199 __ movl(r, Address(rbp, fp_offset[src.first()->value()])); 3200 } 3201 } 3202 } 3203 live[src.first()->value()] = false; 3204 } else if (!useless) { 3205 // full sized move even for int should be ok 3206 __ movq(r, Address(rbp, reg2offset_in(src.first()))); 3207 } 3208 3209 // At this point r has the original java arg in the final location 3210 // (assuming it wasn't useless). If the java arg was an oop 3211 // we have a bit more to do 3212 3213 if (in_sig_bt[j_arg] == T_ARRAY || in_sig_bt[j_arg] == T_OBJECT ) { 3214 if (out_sig_bt[c_arg] == T_INT || out_sig_bt[c_arg] == T_LONG) { 3215 // need to unbox a one-word value 3216 Label skip; 3217 __ testq(r, r); 3218 __ jcc(Assembler::equal, skip); 3219 BasicType bt = out_sig_bt[c_arg]; 3220 int box_offset = java_lang_boxing_object::value_offset_in_bytes(bt); 3221 Address src1(r, box_offset); 3222 if ( bt == T_LONG ) { 3223 __ movq(r, src1); 3224 } else { 3225 __ movl(r, src1); 3226 } 3227 __ bind(skip); 3228 3229 } else if (out_sig_bt[c_arg] != T_ADDRESS) { 3230 // Convert the arg to NULL 3231 __ xorq(r, r); 3232 } 3233 } 3234 3235 // dst can longer be holding an input value 3236 live[dst.first()->value()] = false; 3237 } 3238 if (in_sig_bt[j_arg] == T_OBJECT && out_sig_bt[c_arg] == T_LONG) { 3239 assert(out_sig_bt[c_arg+1] == T_VOID, "must be"); 3240 ++c_arg; // skip over T_VOID to keep the loop indices in sync 3241 } 3242 } 3243 3244 3245 // Ok now we are done. Need to place the nop that dtrace wants in order to 3246 // patch in the trap 3247 int patch_offset = ((intptr_t)__ pc()) - start; 3248 3249 __ nop(); 3250 3251 3252 // Return 3253 3254 __ leave(); 3255 __ ret(0); 3256 3257 __ flush(); 3258 3259 nmethod *nm = nmethod::new_dtrace_nmethod( 3260 method, masm->code(), vep_offset, patch_offset, frame_complete, 3261 stack_slots / VMRegImpl::slots_per_word); 3262 return nm; 3263 3264 } 3265 3266 #endif // HAVE_DTRACE_H 3267 3268 // this function returns the adjust size (in number of words) to a c2i adapter 3269 // activation for use during deoptimization 3270 int Deoptimization::last_frame_adjust(int callee_parameters, int callee_locals ) { 3271 return (callee_locals - callee_parameters) * Interpreter::stackElementWords; 3272 } 3273 3274 3275 uint SharedRuntime::out_preserve_stack_slots() { 3276 return 0; 3277 } 3278 3279 //------------------------------generate_deopt_blob---------------------------- 3280 void SharedRuntime::generate_deopt_blob() { 3281 // Allocate space for the code 3282 ResourceMark rm; 3283 // Setup code generation tools 3284 CodeBuffer buffer("deopt_blob", 2048, 1024); 3285 MacroAssembler* masm = new MacroAssembler(&buffer); 3286 int frame_size_in_words; 3287 OopMap* map = NULL; 3288 OopMapSet *oop_maps = new OopMapSet(); 3289 3290 // ------------- 3291 // This code enters when returning to a de-optimized nmethod. A return 3292 // address has been pushed on the the stack, and return values are in 3293 // registers. 3294 // If we are doing a normal deopt then we were called from the patched 3295 // nmethod from the point we returned to the nmethod. So the return 3296 // address on the stack is wrong by NativeCall::instruction_size 3297 // We will adjust the value so it looks like we have the original return 3298 // address on the stack (like when we eagerly deoptimized). 3299 // In the case of an exception pending when deoptimizing, we enter 3300 // with a return address on the stack that points after the call we patched 3301 // into the exception handler. We have the following register state from, 3302 // e.g., the forward exception stub (see stubGenerator_x86_64.cpp). 3303 // rax: exception oop 3304 // rbx: exception handler 3305 // rdx: throwing pc 3306 // So in this case we simply jam rdx into the useless return address and 3307 // the stack looks just like we want. 3308 // 3309 // At this point we need to de-opt. We save the argument return 3310 // registers. We call the first C routine, fetch_unroll_info(). This 3311 // routine captures the return values and returns a structure which 3312 // describes the current frame size and the sizes of all replacement frames. 3313 // The current frame is compiled code and may contain many inlined 3314 // functions, each with their own JVM state. We pop the current frame, then 3315 // push all the new frames. Then we call the C routine unpack_frames() to 3316 // populate these frames. Finally unpack_frames() returns us the new target 3317 // address. Notice that callee-save registers are BLOWN here; they have 3318 // already been captured in the vframeArray at the time the return PC was 3319 // patched. 3320 address start = __ pc(); 3321 Label cont; 3322 3323 // Prolog for non exception case! 3324 3325 // Save everything in sight. 3326 map = RegisterSaver::save_live_registers(masm, 0, &frame_size_in_words); 3327 3328 // Normal deoptimization. Save exec mode for unpack_frames. 3329 __ movl(r14, Deoptimization::Unpack_deopt); // callee-saved 3330 __ jmp(cont); 3331 3332 int reexecute_offset = __ pc() - start; 3333 3334 // Reexecute case 3335 // return address is the pc describes what bci to do re-execute at 3336 3337 // No need to update map as each call to save_live_registers will produce identical oopmap 3338 (void) RegisterSaver::save_live_registers(masm, 0, &frame_size_in_words); 3339 3340 __ movl(r14, Deoptimization::Unpack_reexecute); // callee-saved 3341 __ jmp(cont); 3342 3343 int exception_offset = __ pc() - start; 3344 3345 // Prolog for exception case 3346 3347 // all registers are dead at this entry point, except for rax, and 3348 // rdx which contain the exception oop and exception pc 3349 // respectively. Set them in TLS and fall thru to the 3350 // unpack_with_exception_in_tls entry point. 3351 3352 __ movptr(Address(r15_thread, JavaThread::exception_pc_offset()), rdx); 3353 __ movptr(Address(r15_thread, JavaThread::exception_oop_offset()), rax); 3354 3355 int exception_in_tls_offset = __ pc() - start; 3356 3357 // new implementation because exception oop is now passed in JavaThread 3358 3359 // Prolog for exception case 3360 // All registers must be preserved because they might be used by LinearScan 3361 // Exceptiop oop and throwing PC are passed in JavaThread 3362 // tos: stack at point of call to method that threw the exception (i.e. only 3363 // args are on the stack, no return address) 3364 3365 // make room on stack for the return address 3366 // It will be patched later with the throwing pc. The correct value is not 3367 // available now because loading it from memory would destroy registers. 3368 __ push(0); 3369 3370 // Save everything in sight. 3371 map = RegisterSaver::save_live_registers(masm, 0, &frame_size_in_words); 3372 3373 // Now it is safe to overwrite any register 3374 3375 // Deopt during an exception. Save exec mode for unpack_frames. 3376 __ movl(r14, Deoptimization::Unpack_exception); // callee-saved 3377 3378 // load throwing pc from JavaThread and patch it as the return address 3379 // of the current frame. Then clear the field in JavaThread 3380 3381 __ movptr(rdx, Address(r15_thread, JavaThread::exception_pc_offset())); 3382 __ movptr(Address(rbp, wordSize), rdx); 3383 __ movptr(Address(r15_thread, JavaThread::exception_pc_offset()), (int32_t)NULL_WORD); 3384 3385 #ifdef ASSERT 3386 // verify that there is really an exception oop in JavaThread 3387 __ movptr(rax, Address(r15_thread, JavaThread::exception_oop_offset())); 3388 __ verify_oop(rax); 3389 3390 // verify that there is no pending exception 3391 Label no_pending_exception; 3392 __ movptr(rax, Address(r15_thread, Thread::pending_exception_offset())); 3393 __ testptr(rax, rax); 3394 __ jcc(Assembler::zero, no_pending_exception); 3395 __ stop("must not have pending exception here"); 3396 __ bind(no_pending_exception); 3397 #endif 3398 3399 __ bind(cont); 3400 3401 // Call C code. Need thread and this frame, but NOT official VM entry 3402 // crud. We cannot block on this call, no GC can happen. 3403 // 3404 // UnrollBlock* fetch_unroll_info(JavaThread* thread) 3405 3406 // fetch_unroll_info needs to call last_java_frame(). 3407 3408 __ set_last_Java_frame(noreg, noreg, NULL); 3409 #ifdef ASSERT 3410 { Label L; 3411 __ cmpptr(Address(r15_thread, 3412 JavaThread::last_Java_fp_offset()), 3413 (int32_t)0); 3414 __ jcc(Assembler::equal, L); 3415 __ stop("SharedRuntime::generate_deopt_blob: last_Java_fp not cleared"); 3416 __ bind(L); 3417 } 3418 #endif // ASSERT 3419 __ mov(c_rarg0, r15_thread); 3420 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, Deoptimization::fetch_unroll_info))); 3421 3422 // Need to have an oopmap that tells fetch_unroll_info where to 3423 // find any register it might need. 3424 oop_maps->add_gc_map(__ pc() - start, map); 3425 3426 __ reset_last_Java_frame(false, false); 3427 3428 // Load UnrollBlock* into rdi 3429 __ mov(rdi, rax); 3430 3431 Label noException; 3432 __ cmpl(r14, Deoptimization::Unpack_exception); // Was exception pending? 3433 __ jcc(Assembler::notEqual, noException); 3434 __ movptr(rax, Address(r15_thread, JavaThread::exception_oop_offset())); 3435 // QQQ this is useless it was NULL above 3436 __ movptr(rdx, Address(r15_thread, JavaThread::exception_pc_offset())); 3437 __ movptr(Address(r15_thread, JavaThread::exception_oop_offset()), (int32_t)NULL_WORD); 3438 __ movptr(Address(r15_thread, JavaThread::exception_pc_offset()), (int32_t)NULL_WORD); 3439 3440 __ verify_oop(rax); 3441 3442 // Overwrite the result registers with the exception results. 3443 __ movptr(Address(rsp, RegisterSaver::rax_offset_in_bytes()), rax); 3444 // I think this is useless 3445 __ movptr(Address(rsp, RegisterSaver::rdx_offset_in_bytes()), rdx); 3446 3447 __ bind(noException); 3448 3449 // Only register save data is on the stack. 3450 // Now restore the result registers. Everything else is either dead 3451 // or captured in the vframeArray. 3452 RegisterSaver::restore_result_registers(masm); 3453 3454 // All of the register save area has been popped of the stack. Only the 3455 // return address remains. 3456 3457 // Pop all the frames we must move/replace. 3458 // 3459 // Frame picture (youngest to oldest) 3460 // 1: self-frame (no frame link) 3461 // 2: deopting frame (no frame link) 3462 // 3: caller of deopting frame (could be compiled/interpreted). 3463 // 3464 // Note: by leaving the return address of self-frame on the stack 3465 // and using the size of frame 2 to adjust the stack 3466 // when we are done the return to frame 3 will still be on the stack. 3467 3468 // Pop deoptimized frame 3469 __ movl(rcx, Address(rdi, Deoptimization::UnrollBlock::size_of_deoptimized_frame_offset_in_bytes())); 3470 __ addptr(rsp, rcx); 3471 3472 // rsp should be pointing at the return address to the caller (3) 3473 3474 // Stack bang to make sure there's enough room for these interpreter frames. 3475 if (UseStackBanging) { 3476 __ movl(rbx, Address(rdi, Deoptimization::UnrollBlock::total_frame_sizes_offset_in_bytes())); 3477 __ bang_stack_size(rbx, rcx); 3478 } 3479 3480 // Load address of array of frame pcs into rcx 3481 __ movptr(rcx, Address(rdi, Deoptimization::UnrollBlock::frame_pcs_offset_in_bytes())); 3482 3483 // Trash the old pc 3484 __ addptr(rsp, wordSize); 3485 3486 // Load address of array of frame sizes into rsi 3487 __ movptr(rsi, Address(rdi, Deoptimization::UnrollBlock::frame_sizes_offset_in_bytes())); 3488 3489 // Load counter into rdx 3490 __ movl(rdx, Address(rdi, Deoptimization::UnrollBlock::number_of_frames_offset_in_bytes())); 3491 3492 // Pick up the initial fp we should save 3493 __ movptr(rbp, Address(rdi, Deoptimization::UnrollBlock::initial_info_offset_in_bytes())); 3494 3495 // Now adjust the caller's stack to make up for the extra locals 3496 // but record the original sp so that we can save it in the skeletal interpreter 3497 // frame and the stack walking of interpreter_sender will get the unextended sp 3498 // value and not the "real" sp value. 3499 3500 const Register sender_sp = r8; 3501 3502 __ mov(sender_sp, rsp); 3503 __ movl(rbx, Address(rdi, 3504 Deoptimization::UnrollBlock:: 3505 caller_adjustment_offset_in_bytes())); 3506 __ subptr(rsp, rbx); 3507 3508 // Push interpreter frames in a loop 3509 Label loop; 3510 __ bind(loop); 3511 __ movptr(rbx, Address(rsi, 0)); // Load frame size 3512 #ifdef CC_INTERP 3513 __ subptr(rbx, 4*wordSize); // we'll push pc and ebp by hand and 3514 #ifdef ASSERT 3515 __ push(0xDEADDEAD); // Make a recognizable pattern 3516 __ push(0xDEADDEAD); 3517 #else /* ASSERT */ 3518 __ subptr(rsp, 2*wordSize); // skip the "static long no_param" 3519 #endif /* ASSERT */ 3520 #else 3521 __ subptr(rbx, 2*wordSize); // We'll push pc and ebp by hand 3522 #endif // CC_INTERP 3523 __ pushptr(Address(rcx, 0)); // Save return address 3524 __ enter(); // Save old & set new ebp 3525 __ subptr(rsp, rbx); // Prolog 3526 #ifdef CC_INTERP 3527 __ movptr(Address(rbp, 3528 -(sizeof(BytecodeInterpreter)) + in_bytes(byte_offset_of(BytecodeInterpreter, _sender_sp))), 3529 sender_sp); // Make it walkable 3530 #else /* CC_INTERP */ 3531 // This value is corrected by layout_activation_impl 3532 __ movptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), (int32_t)NULL_WORD ); 3533 __ movptr(Address(rbp, frame::interpreter_frame_sender_sp_offset * wordSize), sender_sp); // Make it walkable 3534 #endif /* CC_INTERP */ 3535 __ mov(sender_sp, rsp); // Pass sender_sp to next frame 3536 __ addptr(rsi, wordSize); // Bump array pointer (sizes) 3537 __ addptr(rcx, wordSize); // Bump array pointer (pcs) 3538 __ decrementl(rdx); // Decrement counter 3539 __ jcc(Assembler::notZero, loop); 3540 __ pushptr(Address(rcx, 0)); // Save final return address 3541 3542 // Re-push self-frame 3543 __ enter(); // Save old & set new ebp 3544 3545 // Allocate a full sized register save area. 3546 // Return address and rbp are in place, so we allocate two less words. 3547 __ subptr(rsp, (frame_size_in_words - 2) * wordSize); 3548 3549 // Restore frame locals after moving the frame 3550 __ movdbl(Address(rsp, RegisterSaver::xmm0_offset_in_bytes()), xmm0); 3551 __ movptr(Address(rsp, RegisterSaver::rax_offset_in_bytes()), rax); 3552 3553 // Call C code. Need thread but NOT official VM entry 3554 // crud. We cannot block on this call, no GC can happen. Call should 3555 // restore return values to their stack-slots with the new SP. 3556 // 3557 // void Deoptimization::unpack_frames(JavaThread* thread, int exec_mode) 3558 3559 // Use rbp because the frames look interpreted now 3560 // Save "the_pc" since it cannot easily be retrieved using the last_java_SP after we aligned SP. 3561 // Don't need the precise return PC here, just precise enough to point into this code blob. 3562 address the_pc = __ pc(); 3563 __ set_last_Java_frame(noreg, rbp, the_pc); 3564 3565 __ andptr(rsp, -(StackAlignmentInBytes)); // Fix stack alignment as required by ABI 3566 __ mov(c_rarg0, r15_thread); 3567 __ movl(c_rarg1, r14); // second arg: exec_mode 3568 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, Deoptimization::unpack_frames))); 3569 // Revert SP alignment after call since we're going to do some SP relative addressing below 3570 __ movptr(rsp, Address(r15_thread, JavaThread::last_Java_sp_offset())); 3571 3572 // Set an oopmap for the call site 3573 // Use the same PC we used for the last java frame 3574 oop_maps->add_gc_map(the_pc - start, 3575 new OopMap( frame_size_in_words, 0 )); 3576 3577 // Clear fp AND pc 3578 __ reset_last_Java_frame(true, true); 3579 3580 // Collect return values 3581 __ movdbl(xmm0, Address(rsp, RegisterSaver::xmm0_offset_in_bytes())); 3582 __ movptr(rax, Address(rsp, RegisterSaver::rax_offset_in_bytes())); 3583 // I think this is useless (throwing pc?) 3584 __ movptr(rdx, Address(rsp, RegisterSaver::rdx_offset_in_bytes())); 3585 3586 // Pop self-frame. 3587 __ leave(); // Epilog 3588 3589 // Jump to interpreter 3590 __ ret(0); 3591 3592 // Make sure all code is generated 3593 masm->flush(); 3594 3595 _deopt_blob = DeoptimizationBlob::create(&buffer, oop_maps, 0, exception_offset, reexecute_offset, frame_size_in_words); 3596 _deopt_blob->set_unpack_with_exception_in_tls_offset(exception_in_tls_offset); 3597 } 3598 3599 #ifdef COMPILER2 3600 //------------------------------generate_uncommon_trap_blob-------------------- 3601 void SharedRuntime::generate_uncommon_trap_blob() { 3602 // Allocate space for the code 3603 ResourceMark rm; 3604 // Setup code generation tools 3605 CodeBuffer buffer("uncommon_trap_blob", 2048, 1024); 3606 MacroAssembler* masm = new MacroAssembler(&buffer); 3607 3608 assert(SimpleRuntimeFrame::framesize % 4 == 0, "sp not 16-byte aligned"); 3609 3610 address start = __ pc(); 3611 3612 // Push self-frame. We get here with a return address on the 3613 // stack, so rsp is 8-byte aligned until we allocate our frame. 3614 __ subptr(rsp, SimpleRuntimeFrame::return_off << LogBytesPerInt); // Epilog! 3615 3616 // No callee saved registers. rbp is assumed implicitly saved 3617 __ movptr(Address(rsp, SimpleRuntimeFrame::rbp_off << LogBytesPerInt), rbp); 3618 3619 // compiler left unloaded_class_index in j_rarg0 move to where the 3620 // runtime expects it. 3621 __ movl(c_rarg1, j_rarg0); 3622 3623 __ set_last_Java_frame(noreg, noreg, NULL); 3624 3625 // Call C code. Need thread but NOT official VM entry 3626 // crud. We cannot block on this call, no GC can happen. Call should 3627 // capture callee-saved registers as well as return values. 3628 // Thread is in rdi already. 3629 // 3630 // UnrollBlock* uncommon_trap(JavaThread* thread, jint unloaded_class_index); 3631 3632 __ mov(c_rarg0, r15_thread); 3633 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, Deoptimization::uncommon_trap))); 3634 3635 // Set an oopmap for the call site 3636 OopMapSet* oop_maps = new OopMapSet(); 3637 OopMap* map = new OopMap(SimpleRuntimeFrame::framesize, 0); 3638 3639 // location of rbp is known implicitly by the frame sender code 3640 3641 oop_maps->add_gc_map(__ pc() - start, map); 3642 3643 __ reset_last_Java_frame(false, false); 3644 3645 // Load UnrollBlock* into rdi 3646 __ mov(rdi, rax); 3647 3648 // Pop all the frames we must move/replace. 3649 // 3650 // Frame picture (youngest to oldest) 3651 // 1: self-frame (no frame link) 3652 // 2: deopting frame (no frame link) 3653 // 3: caller of deopting frame (could be compiled/interpreted). 3654 3655 // Pop self-frame. We have no frame, and must rely only on rax and rsp. 3656 __ addptr(rsp, (SimpleRuntimeFrame::framesize - 2) << LogBytesPerInt); // Epilog! 3657 3658 // Pop deoptimized frame (int) 3659 __ movl(rcx, Address(rdi, 3660 Deoptimization::UnrollBlock:: 3661 size_of_deoptimized_frame_offset_in_bytes())); 3662 __ addptr(rsp, rcx); 3663 3664 // rsp should be pointing at the return address to the caller (3) 3665 3666 // Stack bang to make sure there's enough room for these interpreter frames. 3667 if (UseStackBanging) { 3668 __ movl(rbx, Address(rdi ,Deoptimization::UnrollBlock::total_frame_sizes_offset_in_bytes())); 3669 __ bang_stack_size(rbx, rcx); 3670 } 3671 3672 // Load address of array of frame pcs into rcx (address*) 3673 __ movptr(rcx, 3674 Address(rdi, 3675 Deoptimization::UnrollBlock::frame_pcs_offset_in_bytes())); 3676 3677 // Trash the return pc 3678 __ addptr(rsp, wordSize); 3679 3680 // Load address of array of frame sizes into rsi (intptr_t*) 3681 __ movptr(rsi, Address(rdi, 3682 Deoptimization::UnrollBlock:: 3683 frame_sizes_offset_in_bytes())); 3684 3685 // Counter 3686 __ movl(rdx, Address(rdi, 3687 Deoptimization::UnrollBlock:: 3688 number_of_frames_offset_in_bytes())); // (int) 3689 3690 // Pick up the initial fp we should save 3691 __ movptr(rbp, 3692 Address(rdi, 3693 Deoptimization::UnrollBlock::initial_info_offset_in_bytes())); 3694 3695 // Now adjust the caller's stack to make up for the extra locals but 3696 // record the original sp so that we can save it in the skeletal 3697 // interpreter frame and the stack walking of interpreter_sender 3698 // will get the unextended sp value and not the "real" sp value. 3699 3700 const Register sender_sp = r8; 3701 3702 __ mov(sender_sp, rsp); 3703 __ movl(rbx, Address(rdi, 3704 Deoptimization::UnrollBlock:: 3705 caller_adjustment_offset_in_bytes())); // (int) 3706 __ subptr(rsp, rbx); 3707 3708 // Push interpreter frames in a loop 3709 Label loop; 3710 __ bind(loop); 3711 __ movptr(rbx, Address(rsi, 0)); // Load frame size 3712 __ subptr(rbx, 2 * wordSize); // We'll push pc and rbp by hand 3713 __ pushptr(Address(rcx, 0)); // Save return address 3714 __ enter(); // Save old & set new rbp 3715 __ subptr(rsp, rbx); // Prolog 3716 #ifdef CC_INTERP 3717 __ movptr(Address(rbp, 3718 -(sizeof(BytecodeInterpreter)) + in_bytes(byte_offset_of(BytecodeInterpreter, _sender_sp))), 3719 sender_sp); // Make it walkable 3720 #else // CC_INTERP 3721 __ movptr(Address(rbp, frame::interpreter_frame_sender_sp_offset * wordSize), 3722 sender_sp); // Make it walkable 3723 // This value is corrected by layout_activation_impl 3724 __ movptr(Address(rbp, frame::interpreter_frame_last_sp_offset * wordSize), (int32_t)NULL_WORD ); 3725 #endif // CC_INTERP 3726 __ mov(sender_sp, rsp); // Pass sender_sp to next frame 3727 __ addptr(rsi, wordSize); // Bump array pointer (sizes) 3728 __ addptr(rcx, wordSize); // Bump array pointer (pcs) 3729 __ decrementl(rdx); // Decrement counter 3730 __ jcc(Assembler::notZero, loop); 3731 __ pushptr(Address(rcx, 0)); // Save final return address 3732 3733 // Re-push self-frame 3734 __ enter(); // Save old & set new rbp 3735 __ subptr(rsp, (SimpleRuntimeFrame::framesize - 4) << LogBytesPerInt); 3736 // Prolog 3737 3738 // Use rbp because the frames look interpreted now 3739 // Save "the_pc" since it cannot easily be retrieved using the last_java_SP after we aligned SP. 3740 // Don't need the precise return PC here, just precise enough to point into this code blob. 3741 address the_pc = __ pc(); 3742 __ set_last_Java_frame(noreg, rbp, the_pc); 3743 3744 // Call C code. Need thread but NOT official VM entry 3745 // crud. We cannot block on this call, no GC can happen. Call should 3746 // restore return values to their stack-slots with the new SP. 3747 // Thread is in rdi already. 3748 // 3749 // BasicType unpack_frames(JavaThread* thread, int exec_mode); 3750 3751 __ andptr(rsp, -(StackAlignmentInBytes)); // Align SP as required by ABI 3752 __ mov(c_rarg0, r15_thread); 3753 __ movl(c_rarg1, Deoptimization::Unpack_uncommon_trap); 3754 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, Deoptimization::unpack_frames))); 3755 3756 // Set an oopmap for the call site 3757 // Use the same PC we used for the last java frame 3758 oop_maps->add_gc_map(the_pc - start, new OopMap(SimpleRuntimeFrame::framesize, 0)); 3759 3760 // Clear fp AND pc 3761 __ reset_last_Java_frame(true, true); 3762 3763 // Pop self-frame. 3764 __ leave(); // Epilog 3765 3766 // Jump to interpreter 3767 __ ret(0); 3768 3769 // Make sure all code is generated 3770 masm->flush(); 3771 3772 _uncommon_trap_blob = UncommonTrapBlob::create(&buffer, oop_maps, 3773 SimpleRuntimeFrame::framesize >> 1); 3774 } 3775 #endif // COMPILER2 3776 3777 3778 //------------------------------generate_handler_blob------ 3779 // 3780 // Generate a special Compile2Runtime blob that saves all registers, 3781 // and setup oopmap. 3782 // 3783 SafepointBlob* SharedRuntime::generate_handler_blob(address call_ptr, int poll_type) { 3784 assert(StubRoutines::forward_exception_entry() != NULL, 3785 "must be generated before"); 3786 3787 ResourceMark rm; 3788 OopMapSet *oop_maps = new OopMapSet(); 3789 OopMap* map; 3790 3791 // Allocate space for the code. Setup code generation tools. 3792 CodeBuffer buffer("handler_blob", 2048, 1024); 3793 MacroAssembler* masm = new MacroAssembler(&buffer); 3794 3795 address start = __ pc(); 3796 address call_pc = NULL; 3797 int frame_size_in_words; 3798 bool cause_return = (poll_type == POLL_AT_RETURN); 3799 bool save_vectors = (poll_type == POLL_AT_VECTOR_LOOP); 3800 3801 // Make room for return address (or push it again) 3802 if (!cause_return) { 3803 __ push(rbx); 3804 } 3805 3806 // Save registers, fpu state, and flags 3807 map = RegisterSaver::save_live_registers(masm, 0, &frame_size_in_words, save_vectors); 3808 3809 // The following is basically a call_VM. However, we need the precise 3810 // address of the call in order to generate an oopmap. Hence, we do all the 3811 // work outselves. 3812 3813 __ set_last_Java_frame(noreg, noreg, NULL); 3814 3815 // The return address must always be correct so that frame constructor never 3816 // sees an invalid pc. 3817 3818 if (!cause_return) { 3819 // overwrite the dummy value we pushed on entry 3820 __ movptr(c_rarg0, Address(r15_thread, JavaThread::saved_exception_pc_offset())); 3821 __ movptr(Address(rbp, wordSize), c_rarg0); 3822 } 3823 3824 // Do the call 3825 __ mov(c_rarg0, r15_thread); 3826 __ call(RuntimeAddress(call_ptr)); 3827 3828 // Set an oopmap for the call site. This oopmap will map all 3829 // oop-registers and debug-info registers as callee-saved. This 3830 // will allow deoptimization at this safepoint to find all possible 3831 // debug-info recordings, as well as let GC find all oops. 3832 3833 oop_maps->add_gc_map( __ pc() - start, map); 3834 3835 Label noException; 3836 3837 __ reset_last_Java_frame(false, false); 3838 3839 __ cmpptr(Address(r15_thread, Thread::pending_exception_offset()), (int32_t)NULL_WORD); 3840 __ jcc(Assembler::equal, noException); 3841 3842 // Exception pending 3843 3844 RegisterSaver::restore_live_registers(masm, save_vectors); 3845 3846 __ jump(RuntimeAddress(StubRoutines::forward_exception_entry())); 3847 3848 // No exception case 3849 __ bind(noException); 3850 3851 // Normal exit, restore registers and exit. 3852 RegisterSaver::restore_live_registers(masm, save_vectors); 3853 3854 __ ret(0); 3855 3856 // Make sure all code is generated 3857 masm->flush(); 3858 3859 // Fill-out other meta info 3860 return SafepointBlob::create(&buffer, oop_maps, frame_size_in_words); 3861 } 3862 3863 // 3864 // generate_resolve_blob - call resolution (static/virtual/opt-virtual/ic-miss 3865 // 3866 // Generate a stub that calls into vm to find out the proper destination 3867 // of a java call. All the argument registers are live at this point 3868 // but since this is generic code we don't know what they are and the caller 3869 // must do any gc of the args. 3870 // 3871 RuntimeStub* SharedRuntime::generate_resolve_blob(address destination, const char* name) { 3872 assert (StubRoutines::forward_exception_entry() != NULL, "must be generated before"); 3873 3874 // allocate space for the code 3875 ResourceMark rm; 3876 3877 CodeBuffer buffer(name, 1000, 512); 3878 MacroAssembler* masm = new MacroAssembler(&buffer); 3879 3880 int frame_size_in_words; 3881 3882 OopMapSet *oop_maps = new OopMapSet(); 3883 OopMap* map = NULL; 3884 3885 int start = __ offset(); 3886 3887 map = RegisterSaver::save_live_registers(masm, 0, &frame_size_in_words); 3888 3889 int frame_complete = __ offset(); 3890 3891 __ set_last_Java_frame(noreg, noreg, NULL); 3892 3893 __ mov(c_rarg0, r15_thread); 3894 3895 __ call(RuntimeAddress(destination)); 3896 3897 3898 // Set an oopmap for the call site. 3899 // We need this not only for callee-saved registers, but also for volatile 3900 // registers that the compiler might be keeping live across a safepoint. 3901 3902 oop_maps->add_gc_map( __ offset() - start, map); 3903 3904 // rax contains the address we are going to jump to assuming no exception got installed 3905 3906 // clear last_Java_sp 3907 __ reset_last_Java_frame(false, false); 3908 // check for pending exceptions 3909 Label pending; 3910 __ cmpptr(Address(r15_thread, Thread::pending_exception_offset()), (int32_t)NULL_WORD); 3911 __ jcc(Assembler::notEqual, pending); 3912 3913 // get the returned Method* 3914 __ get_vm_result_2(rbx, r15_thread); 3915 __ movptr(Address(rsp, RegisterSaver::rbx_offset_in_bytes()), rbx); 3916 3917 __ movptr(Address(rsp, RegisterSaver::rax_offset_in_bytes()), rax); 3918 3919 RegisterSaver::restore_live_registers(masm); 3920 3921 // We are back the the original state on entry and ready to go. 3922 3923 __ jmp(rax); 3924 3925 // Pending exception after the safepoint 3926 3927 __ bind(pending); 3928 3929 RegisterSaver::restore_live_registers(masm); 3930 3931 // exception pending => remove activation and forward to exception handler 3932 3933 __ movptr(Address(r15_thread, JavaThread::vm_result_offset()), (int)NULL_WORD); 3934 3935 __ movptr(rax, Address(r15_thread, Thread::pending_exception_offset())); 3936 __ jump(RuntimeAddress(StubRoutines::forward_exception_entry())); 3937 3938 // ------------- 3939 // make sure all code is generated 3940 masm->flush(); 3941 3942 // return the blob 3943 // frame_size_words or bytes?? 3944 return RuntimeStub::new_runtime_stub(name, &buffer, frame_complete, frame_size_in_words, oop_maps, true); 3945 } 3946 3947 3948 #ifdef COMPILER2 3949 // This is here instead of runtime_x86_64.cpp because it uses SimpleRuntimeFrame 3950 // 3951 //------------------------------generate_exception_blob--------------------------- 3952 // creates exception blob at the end 3953 // Using exception blob, this code is jumped from a compiled method. 3954 // (see emit_exception_handler in x86_64.ad file) 3955 // 3956 // Given an exception pc at a call we call into the runtime for the 3957 // handler in this method. This handler might merely restore state 3958 // (i.e. callee save registers) unwind the frame and jump to the 3959 // exception handler for the nmethod if there is no Java level handler 3960 // for the nmethod. 3961 // 3962 // This code is entered with a jmp. 3963 // 3964 // Arguments: 3965 // rax: exception oop 3966 // rdx: exception pc 3967 // 3968 // Results: 3969 // rax: exception oop 3970 // rdx: exception pc in caller or ??? 3971 // destination: exception handler of caller 3972 // 3973 // Note: the exception pc MUST be at a call (precise debug information) 3974 // Registers rax, rdx, rcx, rsi, rdi, r8-r11 are not callee saved. 3975 // 3976 3977 void OptoRuntime::generate_exception_blob() { 3978 assert(!OptoRuntime::is_callee_saved_register(RDX_num), ""); 3979 assert(!OptoRuntime::is_callee_saved_register(RAX_num), ""); 3980 assert(!OptoRuntime::is_callee_saved_register(RCX_num), ""); 3981 3982 assert(SimpleRuntimeFrame::framesize % 4 == 0, "sp not 16-byte aligned"); 3983 3984 // Allocate space for the code 3985 ResourceMark rm; 3986 // Setup code generation tools 3987 CodeBuffer buffer("exception_blob", 2048, 1024); 3988 MacroAssembler* masm = new MacroAssembler(&buffer); 3989 3990 3991 address start = __ pc(); 3992 3993 // Exception pc is 'return address' for stack walker 3994 __ push(rdx); 3995 __ subptr(rsp, SimpleRuntimeFrame::return_off << LogBytesPerInt); // Prolog 3996 3997 // Save callee-saved registers. See x86_64.ad. 3998 3999 // rbp is an implicitly saved callee saved register (i.e. the calling 4000 // convention will save restore it in prolog/epilog) Other than that 4001 // there are no callee save registers now that adapter frames are gone. 4002 4003 __ movptr(Address(rsp, SimpleRuntimeFrame::rbp_off << LogBytesPerInt), rbp); 4004 4005 // Store exception in Thread object. We cannot pass any arguments to the 4006 // handle_exception call, since we do not want to make any assumption 4007 // about the size of the frame where the exception happened in. 4008 // c_rarg0 is either rdi (Linux) or rcx (Windows). 4009 __ movptr(Address(r15_thread, JavaThread::exception_oop_offset()),rax); 4010 __ movptr(Address(r15_thread, JavaThread::exception_pc_offset()), rdx); 4011 4012 // This call does all the hard work. It checks if an exception handler 4013 // exists in the method. 4014 // If so, it returns the handler address. 4015 // If not, it prepares for stack-unwinding, restoring the callee-save 4016 // registers of the frame being removed. 4017 // 4018 // address OptoRuntime::handle_exception_C(JavaThread* thread) 4019 4020 // At a method handle call, the stack may not be properly aligned 4021 // when returning with an exception. 4022 address the_pc = __ pc(); 4023 __ set_last_Java_frame(noreg, noreg, the_pc); 4024 __ mov(c_rarg0, r15_thread); 4025 __ andptr(rsp, -(StackAlignmentInBytes)); // Align stack 4026 __ call(RuntimeAddress(CAST_FROM_FN_PTR(address, OptoRuntime::handle_exception_C))); 4027 4028 // Set an oopmap for the call site. This oopmap will only be used if we 4029 // are unwinding the stack. Hence, all locations will be dead. 4030 // Callee-saved registers will be the same as the frame above (i.e., 4031 // handle_exception_stub), since they were restored when we got the 4032 // exception. 4033 4034 OopMapSet* oop_maps = new OopMapSet(); 4035 4036 oop_maps->add_gc_map(the_pc - start, new OopMap(SimpleRuntimeFrame::framesize, 0)); 4037 4038 __ reset_last_Java_frame(false, true); 4039 4040 // Restore callee-saved registers 4041 4042 // rbp is an implicitly saved callee saved register (i.e. the calling 4043 // convention will save restore it in prolog/epilog) Other than that 4044 // there are no callee save registers no that adapter frames are gone. 4045 4046 __ movptr(rbp, Address(rsp, SimpleRuntimeFrame::rbp_off << LogBytesPerInt)); 4047 4048 __ addptr(rsp, SimpleRuntimeFrame::return_off << LogBytesPerInt); // Epilog 4049 __ pop(rdx); // No need for exception pc anymore 4050 4051 // rax: exception handler 4052 4053 // Restore SP from BP if the exception PC is a MethodHandle call site. 4054 __ cmpl(Address(r15_thread, JavaThread::is_method_handle_return_offset()), 0); 4055 __ cmovptr(Assembler::notEqual, rsp, rbp_mh_SP_save); 4056 4057 // We have a handler in rax (could be deopt blob). 4058 __ mov(r8, rax); 4059 4060 // Get the exception oop 4061 __ movptr(rax, Address(r15_thread, JavaThread::exception_oop_offset())); 4062 // Get the exception pc in case we are deoptimized 4063 __ movptr(rdx, Address(r15_thread, JavaThread::exception_pc_offset())); 4064 #ifdef ASSERT 4065 __ movptr(Address(r15_thread, JavaThread::exception_handler_pc_offset()), (int)NULL_WORD); 4066 __ movptr(Address(r15_thread, JavaThread::exception_pc_offset()), (int)NULL_WORD); 4067 #endif 4068 // Clear the exception oop so GC no longer processes it as a root. 4069 __ movptr(Address(r15_thread, JavaThread::exception_oop_offset()), (int)NULL_WORD); 4070 4071 // rax: exception oop 4072 // r8: exception handler 4073 // rdx: exception pc 4074 // Jump to handler 4075 4076 __ jmp(r8); 4077 4078 // Make sure all code is generated 4079 masm->flush(); 4080 4081 // Set exception blob 4082 _exception_blob = ExceptionBlob::create(&buffer, oop_maps, SimpleRuntimeFrame::framesize >> 1); 4083 } 4084 #endif // COMPILER2